The Synkyria Refusal Stack v1.0 (Archival Proof Object): Law → Bounds → Operator → Evidence

This deposit is an archival proof object: a unified stack showing that refusal (explicit rejection/gating) is a viability primitive in finite-capacity information-processing systems, and that the refusal necessity line and operator semantics can be reviewed externally without disclosing internal thresholds or proprietary parameters. In the strict sense, this is the foundational Refusal Stack: any later Synkyria runtime or pilot claim about refusal is intended to be either reducible to this stack or must declare a versioned extension with explicit deltas. Within the Synkyria project, it marks the first locked, external-safe refusal stack (v1.0). The stack aligns four layers: Law (thermodynamic / queue-theoretic necessity): under sustained overload in bounded fields, any policy that enforces zero long-run rejection forces holding/viability collapse. Bounds (late recognition under finite capacity): correct identification under late-certifiability regimes cannot be achieved by “load-or-discard” architectures under bounded carried load; a non-trivial intermediate representation channel is required. Operator (audit-ready set-invariance): when admissible continuations become empty, a viability-preserving controller must output explicit refusal with traceable reasons and audit-safe witness discipline. Evidence (external-safe): reproducible trace-level evidence packs with manifests, frames/actions JSONL, checksums, and comparison reports enable independent verification and baseline comparison without disclosing internal thresholds or proprietary coefficients. Component DOIs: Doc 0: 10.5281/zenodo.18787472 Doc 1 (TTR): 10.5281/zenodo.18557678 Doc 2 (Late Recognition): 10.5281/zenodo.18786531 Doc 3 (Audit-Ready Refusal): 10.5281/zenodo.18292441 Evidence v0.1: 10.5281/zenodo.18789150