Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Vertices of the Covariant Coherent Simplex: On a Minimal Covering Kernel the Arity Share Is Boundary Data

NANJIE MA

Published Sep 6, 2026• 0 citations
Publisher

Abstract

Companion to The Nature of Reality: The Quantum Narrative Matrix Hypothesis (https://doi.org/10.5281/zenodo.20630985). This note occupies discrete-generally-covariant coherent dynamics on the registered minimal covering kernel EK-A0007, in the port-resolved convention at port budget two, truncated at a finite horizon N. It does not replace the parent programme. The truncated covariant coherent set is affinely isomorphic to the probability simplex on the level-N isomorphism classes. Its extreme points are the uniform laws on labelled ported histories that terminate at a single class, so the number of extremal covariant dynamics at horizon N equals the class count. At each extreme point the arity-two count is deterministic, with vanishing variance, and the attainable counts are exactly the integers {0, 1, …, N−3} for N ≥ 3. The arity-two share is therefore an affine functional that attains every value of its spectrum with zero fluctuation at a vertex. No principle expressible from coherence and discrete general covariance alone can pin that share: the share is boundary data. The same vertex family yields, for every bound k ≥ 0, a coherent measure on the infinite graph whose arity-two count never exceeds k at any level, so a vanishing asymptotic density does not pin the dynamics either. An exact census through N = 12 is reported. A coarser recursive tree hash is not a complete invariant on this growth graph and undercounts classes from grade seven. This record does not derive a physical leftover intensity, does not establish a realised multiplicity of physical source laws, does not classify a Martin boundary, and does not claim cosmogenesis payment. All census arithmetic is exact rational arithmetic; no Monte Carlo is used. The infinite-graph extreme-point construction and the geometry of the certified family are occupied by a separate already-published companion (https://doi.org/10.5281/zenodo.22520894) and are not included here. A measure-level renormalisation semigroup on that certified locus remains a further separate companion.

DOI
10.5281/zenodo.22524083

Related papers

What Contextual Holonomy Detects: the All-versus-Nothing Sector, Two Gap Certificates, and the Section Dependence of Wigner-Friend Holonomy

Manuel Flores Gordillo

Preprint. Third paper of the contextuality-obstructions program, alongside Paper A (the canonical class of the MASA context stack), Paper B (the obstruction spectrum of Weyl context families), Paper D (the observer-context category) and a synthesis note. The slogan "contextual holonomy encodes quantum contextuality" is attractive and, as usually stated, false. This paper gives it a sharp form. On the context stack of maximal abelian subalgebras the canonical degree-2 class has order exactly n, and its cocycle holonomy along closed context loops detects EXACTLY the all-versus-nothing sector of contextuality for closed-triple Weyl families at even local dimension. Both containments are strict, each by an explicit certificate: at d=3 the class is nontrivial of order 3 while the achievable state-independent AvN value is 0, and KCBS exhibits state-dependent contextuality where the class shadow vanishes. The Wigner-friend loop generated by H and S splits by level: its projective (Pancharatnam) holonomy is +1 while its determinant-section holonomy is exactly -i, so any interpretational claim about "the" holonomy of that loop must state which one it means. ATTRIBUTION. The classification of state-independent values for qudit Weyl families, the even/odd dichotomy and the fixed value d/2, on which the state-independent side of the equivalence rests, is DUE TO Abramsky, Cercelescu and Constantin (FSCD 2024). Attainment at general even d is the Raussendorf-Okay-Zurel-Feldmann construction. This paper uses both and rediscovers neither. A RETRACTION IS CARRIED IN THIS PAPER, NOT BURIED. An earlier draft presented the tier-two facets of the d=4 census on a (1/(2*sqrt2))Z grid with a single coefficient magnitude 3/(2*sqrt2), and read the resulting unit-coefficient bounds 4*sqrt2 and 14*sqrt2/3 as placing Tsirelson's sqrt2 inside the tier-two geometry. The whole presentation was a normalization artifact and is withdrawn (Retraction 1): the stored lift has coefficients in {0,+-1} with integer bounds 6 and 7, every facet functional in the census is rational, and Q(sqrt2) is not among the eighteen canonical arithmetic fields. Certificate: d4_arithmetic_profile.py. WHERE THE EVIDENCE IS THIN, STATED IN THE PAPER. Two sweeps quoted here drew no positive instances at all: the d=4 half of the 2,100-family equivalence test, and the 6,500-trial false-certificate sweep, which draws no contextual family at any of d=2,4,8 and therefore establishes the absence of false certificates only vacuously. Both are disclosed where they appear. Theorem 2 is labelled machine-validated rather than proved: the closed form is established end to end for the deletion families treated, while the general closed-triple d=2 statement in compressed coordinates remains open and is recorded as open in the verification ledger. HARDWARE CAVEAT, STATED UP FRONT. The quoted significances, about 56 sigma for the ray-level Wigner-friend holonomy and 35.4 sigma for the Peres-Mermin witness above the deterministic bound 4, are shot-noise statistical only, computed under the implemented witness model and conditional on compatibility and nondisturbance assumptions. They are not systematics-aware and neither measurement is loophole-free; a roughly 3.5 sigma preparation offset on one strand is itself evidence of unmodelled systematics. We also record that the pinned value S = 4.6125 cannot be recomputed from the stored counts (a naive recomputation gives 4.5662, a gap of about 2.7 standard errors); the archived value 4.558 +- 0.018 is the one an independent reader can reproduce from the deposited data. Read these as consistency checks on real hardware, not as precision measurements or certifications. STATUS AND SCOPE. This is a preprint, not a peer-reviewed article. It was held back from the first publication batch and released only after three adversarial review passes; what each pass found, and how each item was closed, is recorded in verification/INDEX.md rather than quietly fixed. One defect found there is NOT closed and belongs to the companion Paper B, which cites a false-certificate artifact that is not in fact in the repository; it is recorded rather than left for a reader to discover. COMPANIONS. Paper A: https://doi.org/10.5281/zenodo.21630431 . Paper B: https://doi.org/10.5281/zenodo.21630630 . Paper D: https://doi.org/10.5281/zenodo.21630697 . Note: https://doi.org/10.5281/zenodo.21630739 . Code archive: https://doi.org/10.5281/zenodo.21498498 AI-ASSISTANCE DISCLOSURE. Large-language-model assistants (Anthropic Claude) were used substantially in drafting, in developing the verification scripts, in literature search and in proposing proofs. Every load-bearing claim is machine-verified independently of that assistance by the scripts named in the text, and the author takes full responsibility for the results, including any errors. VERIFICATION CODE. https://github.com/manuflog/contextuality-obstructions

•Jul 28, 2026•0 citations

APF Paper 14 — Quantum Mechanics from Beginning to End — Technical Supplement

Ethan Brooke

This is the Technical Supplement — the proof-dense companion and the canonical formal record for the paper's claims. The main paper argues; the supplement proves. Every load-bearing claim traces to a named check function in the APF verification engine, and the supplement is the document a referee should audit first. The supplement is self-contained for Paper 14: every definition, proof, and grade the paper rests on appears in this one document — the substrate primitives and the marginal admissibility floor, proved; the locality and cost-uniqueness lemmas; the Δ calculus with both fences' witnesses written out; the Boolean-defender bridge with its five certified physical hypotheses and the 3-4-5 worked witness computed on the page; the gate pipeline with a gate-by-axiom comparison to the operational-reconstruction literature (Hardy; Chiribella–D'Ariano–Perinotti; Masanes–Müller; Barnum–Wilce; Spekkens; Abramsky–Brandenburger); the native correlation family constructed explicitly, rung by rung; the resolution triad set against standard thermodynamics (Landauer, erasure, environment-assisted recovery); a consolidated readings register listing every claim below [P] with its falsifier and status; a glossary mapping the framework's vocabulary onto standard quantum-information terms; and a worked end-to-end instance — device to interrogation normal form to exact feasibility certificate to priced ledger, with every tolerance explicit. A reproducibility appendix pins every claim to the APF theorem bank at a named GitHub commit and the archived Engine release (DOI 10.5281/zenodo.18529115); the certificates reproduce deterministically in exact rational arithmetic. About the series. Admissibility Physics is a structural realist reconstruction program built on a single commitment: any bounded region of the world can hold only finitely many distinctions. A principle of least enforcement cost then selects, among all the ways those distinctions might be arranged, the configurations a finite world can sustain. From this the content of physics is reconstructed rather than postulated: the Standard Model's gauge group and matter content, the Hilbert-space and Born-rule architecture of quantum mechanics, the geometry and field equations of general relativity, the four laws of thermodynamics, and the large-scale budget of cosmology emerge as different readings of one finite-capacity ledger. The unification is quantitative as well as conceptual: the framework's dimensionless constants appear not as free parameters but as counts read off that ledger — among them the dark-energy fraction ΩΛ = 42/61 and the weak mixing angle sin2θW = 3/13 — fixed, in the strongest cases, to within current measurement. The core derivation runs Papers 0–11; the extension papers carry the individual sectors. Each paper's main text and Technical Supplement is deposited separately; every quantitative claim traces to a named, executable check in the public theorem bank (over 3,800 bank-registered theorems, 48 quantitative predictions); and each result is carried at an explicit, graded level of confidence — from analytically forced to structurally grounded — with the measurements that would refute it named. Admissibility Physics is offered as a candidate, not a finished theory. If the program holds, the laws of physics could not have been otherwise: they are what a finite world permits. Website: admissibilityphysics.com. Engine and theorem bank: https://github.com/Ethan-Brooke/APF-Engine. Full series and latest deposits: Zenodo community admissibility_physics. The Engine — Admissibility Physics: An Executable Constraint Framework and Constants Map — DOI 10.5281/zenodo.18529115. Paper 0 — What Physics Permits: A Constraint-First Framework for Physics — DOI 10.5281/zenodo.18439523 Paper 1 — The Enforceability of Distinction — DOI 10.5281/zenodo.18439200 Paper 2 — Finite Admissibility and the Failure of Global Description — DOI 10.5281/zenodo.18439274 Paper 3 — Entropy, Time, and Accumulated Cost — DOI 10.5281/zenodo.18439363 Paper 4 — Admissibility Constraints and Structural Saturation — DOI 10.5281/zenodo.18439397 Paper 5 — Quantum Structure from Finite Enforceability — DOI 10.5281/zenodo.18439433 Paper 6 — Dynamics and Geometry as Optimal Admissible Reallocation — DOI 10.5281/zenodo.18439445 Paper 7 — A Minimal Quantum of Action from Finite Admissibility — DOI 10.5281/zenodo.18439513 Paper 8 — The Admissibility-Capacity Ledger — DOI 10.5281/zenodo.19721384 Paper 9 — The Geometric Substrate as Cost Structure of Comparison Continuations — DOI 10.5281/zenodo.20041675 Paper 10 — The Calculus of Finite Continuability — DOI 10.5281/zenodo.20041680 Paper 11 — Forced Universality from Capacity-Bounded Admissibility — DOI 10.5281/zenodo.20684198 Paper 12 — The Gauge Sector of Admissibility Physics — DOI 10.5281/zenodo.21212521 Paper 13 — The Minimal Admissibility Core — DOI 10.5281/zenodo.18361446 Paper 14 — The Quantum Story — DOI 10.5281/zenodo.21212188 Paper 16 — Markov Breakdown and the Hard Problems — DOI 10.5281/zenodo.20684207 Paper 18 — The Electroweak Sector as a Capacity Equilibrium — DOI 10.5281/zenodo.20684209 Paper 19 — Large-Angle CMB Suppression as a Finite-Continuability Constraint — DOI 10.5281/zenodo.21199218 Paper 20 — The Enforcement Crystal — DOI 10.5281/zenodo.18531732 Paper 23 — Magnetically Dark Winding-Class Quantum Processors — DOI 10.5281/zenodo.21199220 Paper 24 — The Recruitment-Radius Extension — Foundations — DOI 10.5281/zenodo.20684211 Paper 25 — The Recruitment-Radius Extension: Applications — DOI 10.5281/zenodo.21199222 Paper 28 — Absolute Mass Scales from Electroweak Capacity Saturation — DOI 10.5281/zenodo.20684215 Paper 29 — Plaquette Representation Dominance and Confinement — DOI 10.5281/zenodo.20684218 Paper 30 — A Tube Mechanism for the Lattice Mass Gap — DOI 10.5281/zenodo.20684220 Paper 31 — Osterwalder–Schrader Structure of Lattice Yang–Mills — DOI 10.5281/zenodo.20684222 Paper 32 — Quark Anchors as APF Trace Masses — DOI 10.5281/zenodo.21199226 Paper 33 — Trace-to-Scheme Export Architecture — DOI 10.5281/zenodo.20684224 Paper 35 — The Dark Sector as a Two-Role Capacity Decomposition — DOI 10.5281/zenodo.20684228 Paper 36 — The Missing Floor — DOI 10.5281/zenodo.21199228 Paper 37 — Collapse as Realignment — DOI 10.5281/zenodo.21199231 Paper 38 — Unification as Ledger — DOI 10.5281/zenodo.21199233 Paper 39 — Coherent Phase Regimes in the APF Interface Engine — DOI 10.5281/zenodo.21199235 Paper 40 — The Thermodynamics of Finite Distinction (Between Symmetry and the Void) — DOI 10.5281/zenodo.20684235 Paper 41 — The Horizon as a Continuation Ledger — DOI 10.5281/zenodo.20684241 Paper 42 — The Weak Mixing Angle Is Not Free — DOI 10.5281/zenodo.20684245 Paper 43 — The Neutrino Sector — DOI 10.5281/zenodo.21194191 Paper 44 — What a Finite Theory Owes the Continuum — DOI 10.5281/zenodo.21195874 Paper 45 — What the Vacuum Can Keep — DOI 10.5281/zenodo.21194195 Paper 46 — The Strong CP Angle Is Not Free — DOI 10.5281/zenodo.21194197 Paper 47 — The Confinement Antecedent Is Not Forced — DOI 10.5281/zenodo.21194199 Paper 48 — The Light-Bending Weight Is Not Free — DOI 10.5281/zenodo.21199627 Technical Supplements cross-link to their main paper via isSupplementTo and to the engine via isDocumentedBy. Concept DOIs above resolve to the latest version.

•Jul 5, 2026•0 citations

The Ledger Is Not Enough: Counts, Memory and Observable Content in a Finite Record Framework

David Elliman

STATUS (18 October 2026). The physics programme that motivated this work was concluded in October 2026 and its claim of a unified derivation withdrawn. The results in this paper do not depend on that programme and stand as stated. Can an exact account of recorded events also determine what happens next? We examine this question in a finite quantum model with 48 preparations and an apparatus with ten distinguishable outcomes. Two reversible evolution rules reproduce exactly the same first-use specification but predict different results when the apparatus is used again. A separate example fixes one evolution rule: two possible histories then have identical counts of reads, commits and service events, yet different probabilities for the next outcome. Counts alone are therefore insufficient for prediction in this model. What remains visible depends on the observation. At eight preparations, even the complete individual-read distributions agree between the two rules, while correlations between the reads distinguish them. We classify two explicitly specified families of observations and determine exact ranges for the simpler family, showing both how distinctions are lost and how they can survive. The results separate event accounting, the choice of evolution, retained memory and the conversion of records into measured responses. They are conditional finite-model results, not a derivation of a physical dynamics or a measured coupling. The contribution is a set of exact counterexamples and classifications, rather than new principles of quantum theory. Exact computations and explicit proofs identify the additional response, weighting and sampling choices that a predictive physical interpretation must supply. Version 0.2 incorporates corrections following an author-requested preprint review. The deposit supplies the PDF, editable LaTeX with three TikZ figures, bibliography, exact fixture data for 96 two-read processes over 48 preparations, and a portable Python/SymPy verifier. The revised verifier passes 2,926 exact assertions. These are conditional finite-model results; no physical law, bridge, weighting or sampling measure is selected. The unchanged historical audit sources are available in a separately linked companion archive. Frozen audit sources and INT99 result dossier: https://doi.org/10.5281/zenodo.22541080.

•Sep 6, 2026•0 citations

The Coherence Dissipation Law on the C60 Operator: what the graph forces, what it forbids, and the open-system form that survives

Jason Almasy

Reproducibility note and two wording corrections (28 October 2026). The note’s appendix promises check_dissipation_law.py, which version 1 did not carry. It has been written and run: 109 checks, 109 pass, with 53 derived from the C60 adjacency alone, 45 from the stated premises, 6 internal-consistency, 4 Monte-Carlo and 1 using a reconstructed input. The MEASURED set is empty, and that is itself a check: the note’s own flow-position paragraph says it compares no kernel number with measured data, and that was confirmed rather than assumed. Definitions are tagged as such and are never counted as derivations. Every entry of Table 1 and every number in §3, §4, §5.3, §6.1 and §6.2 reproduces. 1. §3.1’s “fails by at least 19%” is a property of one draw, not a bound. On the setup described, the smallest control deviation is 40.6%, so the floor holds there comfortably. But across 500 random cases (25 draws × 5 β × 4 t) the minimum falls to 10.1%, with 0.6% of cases below 19%. The substantive content is far stronger than the stated floor and should be given instead: every one of the 500 control cases exceeds its own KMS error by a factor of 3.5×10¹³ or more. Suggested wording: “fails by factors of 10¹³ or more above the machine-precision residual.” Relatedly, §3.1’s “relative error 3×10⁻¹⁵” is the typical value, not an attainable bound: the median over 500 cases is 3.23×10⁻¹⁵, the 90th percentile 8.1×10⁻¹⁵, the maximum 2.2×10⁻¹³. 2. §6.2’s “Stratonovich simulation” label does not fit the reported figure. The number itself is right — the theory value 19.44 and the closed form are exact and confirmed — but a direct Stratonovich–Heun integral of the locked case carries a large O(dt) bias, because the phase-difference modes relax at rate ~K = 30: dt = 0.002 gives 14.94 and dt = 0.001 gives 17.16, so reaching the reported 0.15% would need dt ≈ 10⁻⁵, far beyond what “N = 6, D = 0.25, K = 30, 400 replicas” implies. The exact Itō form of the same quantity, D⁻¹(⟨ΣFi²⟩ + D⟨∇·F⟩), carries no stochastic-integral bias and gives 19.4651 at dt = 0.001, converging to theory as dt falls. So the estimator, not the result, is what the label misnames. Separately, the ω list is never given, so the printed simulated triple is not reproducible as such; the printed theory triple is internally consistent (24.42 − 19.44 = 4.98 exactly) and is reproduced exactly from a reconstructed ω with mean 0.9 and population variance 0.2075. The note’s “var” is unambiguously the population variance — the identity fails for the sample variance. 3. §1’s “the C60 spectral values 1, 4−φ and φ” is loose on the third. 1 is an eigenvalue of A with multiplicity 9; 4−φ is an eigenvalue of L = 3I − A with multiplicity 5, since 3 − 1/φ = 4 − φ; but φ is an eigenvalue of neither (nearest level 0.0565 away in A, 0.1796 in L). Only −φ is, with multiplicity 5. The note says so itself two paragraphs later, so this is internal looseness of wording rather than a numerical error, and the product identity (4−φ)·φ = 3φ−1 = 3.854101966249685 is exact. Two results are worth naming because they are stronger than stated. Aut(A) ≅ Ih is confirmed structurally, not merely by order: order 120, 31 involutions, centre of order 2 and no element of order 4, which pins A₅ × C₂ and rules out S₅ (25 involutions, trivial centre). And in §6.1 the garbled line is ΔSsys = −TC₁, the total correlation: the system’s entropy falls by exactly the correlation that forms, verified symbolically, with C/8 = H(p₁) exactly — which is why the printed closed form for (E/S)op holds. Ψop was rebuilt from ledger quantities alone, with no A, B or C in it, and agrees with the printed form to 2.5×10⁻¹⁷⁵. A scope and status note on the coherence dissipation law. Separates what the C60 adjacency forces from what it forbids, and states the open-system form that survives after the bare coefficient was retired in the record. The law in every surviving form is posited, not forced, and the paper says so wherever it matters. Includes the two-ledger theorem under stated premises, a no-go result limited to coherence functionals built from the adjacency, and a verification script.

•Oct 24, 2026•0 citations

Self-Certification in the Collision Architecture: the Blindness Group, its Collapse Conditions, and the Gauge of the Stoica Degeneracy

Ryan Cardwell, Claude

Version 1 (first deposit, 2026-08). 19 pages. Every quantitative claim traces to a pre-registered evidence block with an archived log in the companion zip; the ledger of failed predictions is an appendix of the paper. A long-running dispute asks whether a quantum world selects its own decomposition into subsystems from the Hamiltonian and the state alone. Stoica (Adv. Theor. Math. Phys. 26, 3895 (2022)) proves that a structure so constructed cannot be both essentially unique and physically relevant, the non-uniqueness being modulo the unitaries commuting with H; Soulas, Franzmann and Di Biagio (arXiv:2512.07468) object that producing a second structure that way modifies the input pair, and prove a positive uniqueness theorem under two hypotheses. Both are correct, about different groups, and this paper makes the difference arithmetic. Working inside the collision architecture of the companion flagship (doi:10.5281/zenodo.22014601, all versions), where an interior memory writes records of a system and audits itself from them, the two invariance groups an interior audit actually has are measured. FIRST, the audit's Hamiltonian-side content is exactly constant on the orbits of the commutant of H, the fibres of the transport map are exactly those orbits, and the resulting gauge has the closed form sum_i m_i^2 - 1 in the eigenvalue multiplicities: the degeneracy has a computable size, three dimensions inside sixteen for a generic four-level Hamiltonian, five at (2,3), and larger exactly when the symmetry group is NON-ABELIAN (Heisenberg gives nine; abelian symmetry forces no spectral degeneracy). SECOND, the audit's total content is invariant not under that commutant but under the stabiliser of the PAIR (H, psi), which is trivial precisely under the Soulas hypotheses: the orbit holds the Hamiltonian side fixed to 2.7e-15 and pays for the second structure entirely on the state side, 1.14. The stabiliser formula quantifies exactly when their free-action condition holds and by how many dimensions it fails otherwise. THIRD, the record statistics carry their own blindness: the directions invisible to the census, whatever the state and the time, form a group, and for a register read in one basis per cell it is exactly span{I, T} at every fragment count, proved by a symplectic argument over F_2 requiring no induction -- in this deposit, by two algorithmically independent F_2 implementations plus a dense-matrix verification. That scope is the result rather than a caveat: the one-bit blindness is the price of a one-basis readout, and it is the only thing that price buys; reading a second basis on every cell collapses the group to the identity and credentials the full matrix algebra. The twist is the product of the observer's own precession with all of its own readouts, T = P R_1 ... R_k exactly, so the blindness group is the CENTRE of the credentialed algebra: an interior observer cannot see the centre its own operations generate. The credentialed algebra is everything commuting with that one bit, of dimension d^2/2. Blindness under this reading is an identity and not a similarity: for T in the blindness group the census under rho and under T rho T-dagger agrees exactly at trace distance 0.740, so no additional sampling can separate them. The paper prints the response functional every margin and census count is computed from, together with its grid and state. Around the group sit its measured collapse conditions: the price list of restorations (menus that eject the twist restore visibility at costs that double register by register, 10/20/40 contexts on the z-menu and 4/8/16 on the y/z-menu at k = 2, 3, 4, stated as observed at three points, not derived); the sorting condition for which twist configurations a restoration menu revives, named as reach membership of the displacement in the Krylov closure of the menu (63/63 exact at k = 2 in three independent engines, 255/255 at k = 3 in exact rational arithmetic; an all-time reach lemma proves the decision grid decision-faithful and shows it deliberately not span-complete); the genericity of visibility (the blindness locus is a union of alignment strata computed in part: a QND family at the minimal codimension 2 and twist families indexed by subsets of cells at codimension 2k, with a bounded search that surfaced a mixed partial-twist family the hand count had missed); and both branches of the open-world dichotomy reproduced from the group definition alone. The transport side is independently rebuilt: the W-alone computation the framework's kill switch depends on was reconstructed from the printed setting alone and the switch does not fire. A closing section isolates the mechanism shared with an earlier half-space result and shows, against the natural reading, that the two halves are distinct subspaces meeting in a quarter: one lemma, distinct instances. All quantitative claims were pre-registered before their runs. The ledger of failed predictions is an appendix and is kept in full, including a posted mechanism that died, a symmetry law corrected to Schur's criterion, a numerics trap caught only because a posted claim came back wrong, engine deaths from the exact-census campaign convicted by their own gates, and errors printed in earlier drafts and caught in review. The delineation of what is inherited from the literature is stated throughout; the paper asserts no priority claims.

•Aug 26, 2026•0 citations

Finite-Time Observability and Physical Memory of Hidden Protocol Order

Joel Pearcey

Boundary equivalence, practical detectability and physical memory are different properties of an experiment. We separate them on an exactly reproducible six-vertex reciprocal network. Complete passive boundary data are invariant along an SO(3) family of internal Laplacians. Two closed controls induce non-commuting fibre transports, yet their order is exactly invisible to the passive experiment. An active boundary readout sees the commutator only at fourth order in loop side and linearly in readout-symmetry breaking, so its fixed-noise repeat burden is of order rho^-2 ell^-8. For a known binary alternative, the equal-block-cost optimum is repeated use of the single block with the largest whitened projection; no multi-block protocol can beat this by root-mean-square aggregation. At the reference operating point a Gaussian detector requires 287 blocks and a sign-quantised detector requires 451, reproducing the classical hard-limiter penalty. We then construct a physical observer rather than infer one from sample complexity. A raw sign tape and its 452-state sufficient count have terminal reset entropies of 450.3006 and 6.16795 bits but the same closed-computation ledger: compression moves erasure earlier rather than removing it. A 39-state sequential accumulator reaches error 0.075246 in 244.836 expected blocks. Source-matched finite-time reset protocols obey local detailed balance exactly and yield reproducible work and heat distributions. Finally, finite carrier coherence imposes a threshold correlation time below which the required evidence cannot be accumulated at all, independent of precision. An exactly non-zero, rationally certified interior distinction can therefore be permanently unusable to a finite-coherence observer. The contribution is not the general claim that boundaries underdetermine interiors, which is classical. It is a certified finite example linking non-Abelian quotient geometry, fourth-order readout, eighth-order evidence, finite-state inference, physical reset and a maximal future-decision deficiency, without identifying any two of those levels. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: frozen parent Gate 4 and Gate 5 inputs, production and verification code, all machine-readable tables, 150,000 trajectory records, publication figures, and SHA-256 checksums. The verifier passes 37 numerical and structural checks.

•Sep 13, 2026•0 citations
Companion to The Nature of Reality: The Quantum Narrative Matrix Hypothesis (https://doi.org/10.5281/zenodo.20630985). This note occupies discrete-generally-covariant coherent dynamics on the registered minimal covering kernel EK-A0007, in the port-resolved convention at port budget two, truncated at a finite horizon N. It does not replace the parent programme. The truncated covariant coherent set is affinely isomorphic to the probability simplex on the level-N isomorphism classes. Its extreme points are the uniform laws on labelled ported histories that terminate at a single class, so the number of extremal covariant dynamics at horizon N equals the class count. At each extreme point the arity-two count is deterministic, with vanishing variance, and the attainable counts are exactly the integers {0, 1, …, N−3} for N ≥ 3. The arity-two share is therefore an affine functional that attains every value of its spectrum with zero fluctuation at a vertex. No principle expressible from coherence and discrete general covariance alone can pin that share: the share is boundary data. The same vertex family yields, for every bound k ≥ 0, a coherent measure on the infinite graph whose arity-two count never exceeds k at any level, so a vanishing asymptotic density does not pin the dynamics either. An exact census through N = 12 is reported. A coarser recursive tree hash is not a complete invariant on this growth graph and undercounts classes from grade seven. This record does not derive a physical leftover intensity, does not establish a realised multiplicity of physical source laws, does not classify a Martin boundary, and does not claim cosmogenesis payment. All census arithmetic is exact rational arithmetic; no Monte Carlo is used. The infinite-graph extreme-point construction and the geometry of the certified family are occupied by a separate already-published companion (https://doi.org/10.5281/zenodo.22520894) and are not included here. A measure-level renormalisation semigroup on that certified locus remains a further separate companion.
Preprint. Third paper of the contextuality-obstructions program, alongside Paper A (the canonical class of the MASA context stack), Paper B (the obstruction spectrum of Weyl context families), Paper D (the observer-context category) and a synthesis note. The slogan "contextual holonomy encodes quantum contextuality" is attractive and, as usually stated, false. This paper gives it a sharp form. On the context stack of maximal abelian subalgebras the canonical degree-2 class has order exactly n, and its cocycle holonomy along closed context loops detects EXACTLY the all-versus-nothing sector of contextuality for closed-triple Weyl families at even local dimension. Both containments are strict, each by an explicit certificate: at d=3 the class is nontrivial of order 3 while the achievable state-independent AvN value is 0, and KCBS exhibits state-dependent contextuality where the class shadow vanishes. The Wigner-friend loop generated by H and S splits by level: its projective (Pancharatnam) holonomy is +1 while its determinant-section holonomy is exactly -i, so any interpretational claim about "the" holonomy of that loop must state which one it means. ATTRIBUTION. The classification of state-independent values for qudit Weyl families, the even/odd dichotomy and the fixed value d/2, on which the state-independent side of the equivalence rests, is DUE TO Abramsky, Cercelescu and Constantin (FSCD 2024). Attainment at general even d is the Raussendorf-Okay-Zurel-Feldmann construction. This paper uses both and rediscovers neither. A RETRACTION IS CARRIED IN THIS PAPER, NOT BURIED. An earlier draft presented the tier-two facets of the d=4 census on a (1/(2*sqrt2))Z grid with a single coefficient magnitude 3/(2*sqrt2), and read the resulting unit-coefficient bounds 4*sqrt2 and 14*sqrt2/3 as placing Tsirelson's sqrt2 inside the tier-two geometry. The whole presentation was a normalization artifact and is withdrawn (Retraction 1): the stored lift has coefficients in {0,+-1} with integer bounds 6 and 7, every facet functional in the census is rational, and Q(sqrt2) is not among the eighteen canonical arithmetic fields. Certificate: d4_arithmetic_profile.py. WHERE THE EVIDENCE IS THIN, STATED IN THE PAPER. Two sweeps quoted here drew no positive instances at all: the d=4 half of the 2,100-family equivalence test, and the 6,500-trial false-certificate sweep, which draws no contextual family at any of d=2,4,8 and therefore establishes the absence of false certificates only vacuously. Both are disclosed where they appear. Theorem 2 is labelled machine-validated rather than proved: the closed form is established end to end for the deletion families treated, while the general closed-triple d=2 statement in compressed coordinates remains open and is recorded as open in the verification ledger. HARDWARE CAVEAT, STATED UP FRONT. The quoted significances, about 56 sigma for the ray-level Wigner-friend holonomy and 35.4 sigma for the Peres-Mermin witness above the deterministic bound 4, are shot-noise statistical only, computed under the implemented witness model and conditional on compatibility and nondisturbance assumptions. They are not systematics-aware and neither measurement is loophole-free; a roughly 3.5 sigma preparation offset on one strand is itself evidence of unmodelled systematics. We also record that the pinned value S = 4.6125 cannot be recomputed from the stored counts (a naive recomputation gives 4.5662, a gap of about 2.7 standard errors); the archived value 4.558 +- 0.018 is the one an independent reader can reproduce from the deposited data. Read these as consistency checks on real hardware, not as precision measurements or certifications. STATUS AND SCOPE. This is a preprint, not a peer-reviewed article. It was held back from the first publication batch and released only after three adversarial review passes; what each pass found, and how each item was closed, is recorded in verification/INDEX.md rather than quietly fixed. One defect found there is NOT closed and belongs to the companion Paper B, which cites a false-certificate artifact that is not in fact in the repository; it is recorded rather than left for a reader to discover. COMPANIONS. Paper A: https://doi.org/10.5281/zenodo.21630431 . Paper B: https://doi.org/10.5281/zenodo.21630630 . Paper D: https://doi.org/10.5281/zenodo.21630697 . Note: https://doi.org/10.5281/zenodo.21630739 . Code archive: https://doi.org/10.5281/zenodo.21498498 AI-ASSISTANCE DISCLOSURE. Large-language-model assistants (Anthropic Claude) were used substantially in drafting, in developing the verification scripts, in literature search and in proposing proofs. Every load-bearing claim is machine-verified independently of that assistance by the scripts named in the text, and the author takes full responsibility for the results, including any errors. VERIFICATION CODE. https://github.com/manuflog/contextuality-obstructions
This is the Technical Supplement — the proof-dense companion and the canonical formal record for the paper's claims. The main paper argues; the supplement proves. Every load-bearing claim traces to a named check function in the APF verification engine, and the supplement is the document a referee should audit first. The supplement is self-contained for Paper 14: every definition, proof, and grade the paper rests on appears in this one document — the substrate primitives and the marginal admissibility floor, proved; the locality and cost-uniqueness lemmas; the Δ calculus with both fences' witnesses written out; the Boolean-defender bridge with its five certified physical hypotheses and the 3-4-5 worked witness computed on the page; the gate pipeline with a gate-by-axiom comparison to the operational-reconstruction literature (Hardy; Chiribella–D'Ariano–Perinotti; Masanes–Müller; Barnum–Wilce; Spekkens; Abramsky–Brandenburger); the native correlation family constructed explicitly, rung by rung; the resolution triad set against standard thermodynamics (Landauer, erasure, environment-assisted recovery); a consolidated readings register listing every claim below [P] with its falsifier and status; a glossary mapping the framework's vocabulary onto standard quantum-information terms; and a worked end-to-end instance — device to interrogation normal form to exact feasibility certificate to priced ledger, with every tolerance explicit. A reproducibility appendix pins every claim to the APF theorem bank at a named GitHub commit and the archived Engine release (DOI 10.5281/zenodo.18529115); the certificates reproduce deterministically in exact rational arithmetic. About the series. Admissibility Physics is a structural realist reconstruction program built on a single commitment: any bounded region of the world can hold only finitely many distinctions. A principle of least enforcement cost then selects, among all the ways those distinctions might be arranged, the configurations a finite world can sustain. From this the content of physics is reconstructed rather than postulated: the Standard Model's gauge group and matter content, the Hilbert-space and Born-rule architecture of quantum mechanics, the geometry and field equations of general relativity, the four laws of thermodynamics, and the large-scale budget of cosmology emerge as different readings of one finite-capacity ledger. The unification is quantitative as well as conceptual: the framework's dimensionless constants appear not as free parameters but as counts read off that ledger — among them the dark-energy fraction ΩΛ = 42/61 and the weak mixing angle sin2θW = 3/13 — fixed, in the strongest cases, to within current measurement. The core derivation runs Papers 0–11; the extension papers carry the individual sectors. Each paper's main text and Technical Supplement is deposited separately; every quantitative claim traces to a named, executable check in the public theorem bank (over 3,800 bank-registered theorems, 48 quantitative predictions); and each result is carried at an explicit, graded level of confidence — from analytically forced to structurally grounded — with the measurements that would refute it named. Admissibility Physics is offered as a candidate, not a finished theory. If the program holds, the laws of physics could not have been otherwise: they are what a finite world permits. Website: admissibilityphysics.com. Engine and theorem bank: https://github.com/Ethan-Brooke/APF-Engine. Full series and latest deposits: Zenodo community admissibility_physics. The Engine — Admissibility Physics: An Executable Constraint Framework and Constants Map — DOI 10.5281/zenodo.18529115. Paper 0 — What Physics Permits: A Constraint-First Framework for Physics — DOI 10.5281/zenodo.18439523 Paper 1 — The Enforceability of Distinction — DOI 10.5281/zenodo.18439200 Paper 2 — Finite Admissibility and the Failure of Global Description — DOI 10.5281/zenodo.18439274 Paper 3 — Entropy, Time, and Accumulated Cost — DOI 10.5281/zenodo.18439363 Paper 4 — Admissibility Constraints and Structural Saturation — DOI 10.5281/zenodo.18439397 Paper 5 — Quantum Structure from Finite Enforceability — DOI 10.5281/zenodo.18439433 Paper 6 — Dynamics and Geometry as Optimal Admissible Reallocation — DOI 10.5281/zenodo.18439445 Paper 7 — A Minimal Quantum of Action from Finite Admissibility — DOI 10.5281/zenodo.18439513 Paper 8 — The Admissibility-Capacity Ledger — DOI 10.5281/zenodo.19721384 Paper 9 — The Geometric Substrate as Cost Structure of Comparison Continuations — DOI 10.5281/zenodo.20041675 Paper 10 — The Calculus of Finite Continuability — DOI 10.5281/zenodo.20041680 Paper 11 — Forced Universality from Capacity-Bounded Admissibility — DOI 10.5281/zenodo.20684198 Paper 12 — The Gauge Sector of Admissibility Physics — DOI 10.5281/zenodo.21212521 Paper 13 — The Minimal Admissibility Core — DOI 10.5281/zenodo.18361446 Paper 14 — The Quantum Story — DOI 10.5281/zenodo.21212188 Paper 16 — Markov Breakdown and the Hard Problems — DOI 10.5281/zenodo.20684207 Paper 18 — The Electroweak Sector as a Capacity Equilibrium — DOI 10.5281/zenodo.20684209 Paper 19 — Large-Angle CMB Suppression as a Finite-Continuability Constraint — DOI 10.5281/zenodo.21199218 Paper 20 — The Enforcement Crystal — DOI 10.5281/zenodo.18531732 Paper 23 — Magnetically Dark Winding-Class Quantum Processors — DOI 10.5281/zenodo.21199220 Paper 24 — The Recruitment-Radius Extension — Foundations — DOI 10.5281/zenodo.20684211 Paper 25 — The Recruitment-Radius Extension: Applications — DOI 10.5281/zenodo.21199222 Paper 28 — Absolute Mass Scales from Electroweak Capacity Saturation — DOI 10.5281/zenodo.20684215 Paper 29 — Plaquette Representation Dominance and Confinement — DOI 10.5281/zenodo.20684218 Paper 30 — A Tube Mechanism for the Lattice Mass Gap — DOI 10.5281/zenodo.20684220 Paper 31 — Osterwalder–Schrader Structure of Lattice Yang–Mills — DOI 10.5281/zenodo.20684222 Paper 32 — Quark Anchors as APF Trace Masses — DOI 10.5281/zenodo.21199226 Paper 33 — Trace-to-Scheme Export Architecture — DOI 10.5281/zenodo.20684224 Paper 35 — The Dark Sector as a Two-Role Capacity Decomposition — DOI 10.5281/zenodo.20684228 Paper 36 — The Missing Floor — DOI 10.5281/zenodo.21199228 Paper 37 — Collapse as Realignment — DOI 10.5281/zenodo.21199231 Paper 38 — Unification as Ledger — DOI 10.5281/zenodo.21199233 Paper 39 — Coherent Phase Regimes in the APF Interface Engine — DOI 10.5281/zenodo.21199235 Paper 40 — The Thermodynamics of Finite Distinction (Between Symmetry and the Void) — DOI 10.5281/zenodo.20684235 Paper 41 — The Horizon as a Continuation Ledger — DOI 10.5281/zenodo.20684241 Paper 42 — The Weak Mixing Angle Is Not Free — DOI 10.5281/zenodo.20684245 Paper 43 — The Neutrino Sector — DOI 10.5281/zenodo.21194191 Paper 44 — What a Finite Theory Owes the Continuum — DOI 10.5281/zenodo.21195874 Paper 45 — What the Vacuum Can Keep — DOI 10.5281/zenodo.21194195 Paper 46 — The Strong CP Angle Is Not Free — DOI 10.5281/zenodo.21194197 Paper 47 — The Confinement Antecedent Is Not Forced — DOI 10.5281/zenodo.21194199 Paper 48 — The Light-Bending Weight Is Not Free — DOI 10.5281/zenodo.21199627 Technical Supplements cross-link to their main paper via isSupplementTo and to the engine via isDocumentedBy. Concept DOIs above resolve to the latest version.
STATUS (18 October 2026). The physics programme that motivated this work was concluded in October 2026 and its claim of a unified derivation withdrawn. The results in this paper do not depend on that programme and stand as stated. Can an exact account of recorded events also determine what happens next? We examine this question in a finite quantum model with 48 preparations and an apparatus with ten distinguishable outcomes. Two reversible evolution rules reproduce exactly the same first-use specification but predict different results when the apparatus is used again. A separate example fixes one evolution rule: two possible histories then have identical counts of reads, commits and service events, yet different probabilities for the next outcome. Counts alone are therefore insufficient for prediction in this model. What remains visible depends on the observation. At eight preparations, even the complete individual-read distributions agree between the two rules, while correlations between the reads distinguish them. We classify two explicitly specified families of observations and determine exact ranges for the simpler family, showing both how distinctions are lost and how they can survive. The results separate event accounting, the choice of evolution, retained memory and the conversion of records into measured responses. They are conditional finite-model results, not a derivation of a physical dynamics or a measured coupling. The contribution is a set of exact counterexamples and classifications, rather than new principles of quantum theory. Exact computations and explicit proofs identify the additional response, weighting and sampling choices that a predictive physical interpretation must supply. Version 0.2 incorporates corrections following an author-requested preprint review. The deposit supplies the PDF, editable LaTeX with three TikZ figures, bibliography, exact fixture data for 96 two-read processes over 48 preparations, and a portable Python/SymPy verifier. The revised verifier passes 2,926 exact assertions. These are conditional finite-model results; no physical law, bridge, weighting or sampling measure is selected. The unchanged historical audit sources are available in a separately linked companion archive. Frozen audit sources and INT99 result dossier: https://doi.org/10.5281/zenodo.22541080.
Reproducibility note and two wording corrections (28 October 2026). The note’s appendix promises check_dissipation_law.py, which version 1 did not carry. It has been written and run: 109 checks, 109 pass, with 53 derived from the C60 adjacency alone, 45 from the stated premises, 6 internal-consistency, 4 Monte-Carlo and 1 using a reconstructed input. The MEASURED set is empty, and that is itself a check: the note’s own flow-position paragraph says it compares no kernel number with measured data, and that was confirmed rather than assumed. Definitions are tagged as such and are never counted as derivations. Every entry of Table 1 and every number in §3, §4, §5.3, §6.1 and §6.2 reproduces. 1. §3.1’s “fails by at least 19%” is a property of one draw, not a bound. On the setup described, the smallest control deviation is 40.6%, so the floor holds there comfortably. But across 500 random cases (25 draws × 5 β × 4 t) the minimum falls to 10.1%, with 0.6% of cases below 19%. The substantive content is far stronger than the stated floor and should be given instead: every one of the 500 control cases exceeds its own KMS error by a factor of 3.5×10¹³ or more. Suggested wording: “fails by factors of 10¹³ or more above the machine-precision residual.” Relatedly, §3.1’s “relative error 3×10⁻¹⁵” is the typical value, not an attainable bound: the median over 500 cases is 3.23×10⁻¹⁵, the 90th percentile 8.1×10⁻¹⁵, the maximum 2.2×10⁻¹³. 2. §6.2’s “Stratonovich simulation” label does not fit the reported figure. The number itself is right — the theory value 19.44 and the closed form are exact and confirmed — but a direct Stratonovich–Heun integral of the locked case carries a large O(dt) bias, because the phase-difference modes relax at rate ~K = 30: dt = 0.002 gives 14.94 and dt = 0.001 gives 17.16, so reaching the reported 0.15% would need dt ≈ 10⁻⁵, far beyond what “N = 6, D = 0.25, K = 30, 400 replicas” implies. The exact Itō form of the same quantity, D⁻¹(⟨ΣFi²⟩ + D⟨∇·F⟩), carries no stochastic-integral bias and gives 19.4651 at dt = 0.001, converging to theory as dt falls. So the estimator, not the result, is what the label misnames. Separately, the ω list is never given, so the printed simulated triple is not reproducible as such; the printed theory triple is internally consistent (24.42 − 19.44 = 4.98 exactly) and is reproduced exactly from a reconstructed ω with mean 0.9 and population variance 0.2075. The note’s “var” is unambiguously the population variance — the identity fails for the sample variance. 3. §1’s “the C60 spectral values 1, 4−φ and φ” is loose on the third. 1 is an eigenvalue of A with multiplicity 9; 4−φ is an eigenvalue of L = 3I − A with multiplicity 5, since 3 − 1/φ = 4 − φ; but φ is an eigenvalue of neither (nearest level 0.0565 away in A, 0.1796 in L). Only −φ is, with multiplicity 5. The note says so itself two paragraphs later, so this is internal looseness of wording rather than a numerical error, and the product identity (4−φ)·φ = 3φ−1 = 3.854101966249685 is exact. Two results are worth naming because they are stronger than stated. Aut(A) ≅ Ih is confirmed structurally, not merely by order: order 120, 31 involutions, centre of order 2 and no element of order 4, which pins A₅ × C₂ and rules out S₅ (25 involutions, trivial centre). And in §6.1 the garbled line is ΔSsys = −TC₁, the total correlation: the system’s entropy falls by exactly the correlation that forms, verified symbolically, with C/8 = H(p₁) exactly — which is why the printed closed form for (E/S)op holds. Ψop was rebuilt from ledger quantities alone, with no A, B or C in it, and agrees with the printed form to 2.5×10⁻¹⁷⁵. A scope and status note on the coherence dissipation law. Separates what the C60 adjacency forces from what it forbids, and states the open-system form that survives after the bare coefficient was retired in the record. The law in every surviving form is posited, not forced, and the paper says so wherever it matters. Includes the two-ledger theorem under stated premises, a no-go result limited to coherence functionals built from the adjacency, and a verification script.
Version 1 (first deposit, 2026-08). 19 pages. Every quantitative claim traces to a pre-registered evidence block with an archived log in the companion zip; the ledger of failed predictions is an appendix of the paper. A long-running dispute asks whether a quantum world selects its own decomposition into subsystems from the Hamiltonian and the state alone. Stoica (Adv. Theor. Math. Phys. 26, 3895 (2022)) proves that a structure so constructed cannot be both essentially unique and physically relevant, the non-uniqueness being modulo the unitaries commuting with H; Soulas, Franzmann and Di Biagio (arXiv:2512.07468) object that producing a second structure that way modifies the input pair, and prove a positive uniqueness theorem under two hypotheses. Both are correct, about different groups, and this paper makes the difference arithmetic. Working inside the collision architecture of the companion flagship (doi:10.5281/zenodo.22014601, all versions), where an interior memory writes records of a system and audits itself from them, the two invariance groups an interior audit actually has are measured. FIRST, the audit's Hamiltonian-side content is exactly constant on the orbits of the commutant of H, the fibres of the transport map are exactly those orbits, and the resulting gauge has the closed form sum_i m_i^2 - 1 in the eigenvalue multiplicities: the degeneracy has a computable size, three dimensions inside sixteen for a generic four-level Hamiltonian, five at (2,3), and larger exactly when the symmetry group is NON-ABELIAN (Heisenberg gives nine; abelian symmetry forces no spectral degeneracy). SECOND, the audit's total content is invariant not under that commutant but under the stabiliser of the PAIR (H, psi), which is trivial precisely under the Soulas hypotheses: the orbit holds the Hamiltonian side fixed to 2.7e-15 and pays for the second structure entirely on the state side, 1.14. The stabiliser formula quantifies exactly when their free-action condition holds and by how many dimensions it fails otherwise. THIRD, the record statistics carry their own blindness: the directions invisible to the census, whatever the state and the time, form a group, and for a register read in one basis per cell it is exactly span{I, T} at every fragment count, proved by a symplectic argument over F_2 requiring no induction -- in this deposit, by two algorithmically independent F_2 implementations plus a dense-matrix verification. That scope is the result rather than a caveat: the one-bit blindness is the price of a one-basis readout, and it is the only thing that price buys; reading a second basis on every cell collapses the group to the identity and credentials the full matrix algebra. The twist is the product of the observer's own precession with all of its own readouts, T = P R_1 ... R_k exactly, so the blindness group is the CENTRE of the credentialed algebra: an interior observer cannot see the centre its own operations generate. The credentialed algebra is everything commuting with that one bit, of dimension d^2/2. Blindness under this reading is an identity and not a similarity: for T in the blindness group the census under rho and under T rho T-dagger agrees exactly at trace distance 0.740, so no additional sampling can separate them. The paper prints the response functional every margin and census count is computed from, together with its grid and state. Around the group sit its measured collapse conditions: the price list of restorations (menus that eject the twist restore visibility at costs that double register by register, 10/20/40 contexts on the z-menu and 4/8/16 on the y/z-menu at k = 2, 3, 4, stated as observed at three points, not derived); the sorting condition for which twist configurations a restoration menu revives, named as reach membership of the displacement in the Krylov closure of the menu (63/63 exact at k = 2 in three independent engines, 255/255 at k = 3 in exact rational arithmetic; an all-time reach lemma proves the decision grid decision-faithful and shows it deliberately not span-complete); the genericity of visibility (the blindness locus is a union of alignment strata computed in part: a QND family at the minimal codimension 2 and twist families indexed by subsets of cells at codimension 2k, with a bounded search that surfaced a mixed partial-twist family the hand count had missed); and both branches of the open-world dichotomy reproduced from the group definition alone. The transport side is independently rebuilt: the W-alone computation the framework's kill switch depends on was reconstructed from the printed setting alone and the switch does not fire. A closing section isolates the mechanism shared with an earlier half-space result and shows, against the natural reading, that the two halves are distinct subspaces meeting in a quarter: one lemma, distinct instances. All quantitative claims were pre-registered before their runs. The ledger of failed predictions is an appendix and is kept in full, including a posted mechanism that died, a symmetry law corrected to Schur's criterion, a numerics trap caught only because a posted claim came back wrong, engine deaths from the exact-census campaign convicted by their own gates, and errors printed in earlier drafts and caught in review. The delineation of what is inherited from the literature is stated throughout; the paper asserts no priority claims.
Boundary equivalence, practical detectability and physical memory are different properties of an experiment. We separate them on an exactly reproducible six-vertex reciprocal network. Complete passive boundary data are invariant along an SO(3) family of internal Laplacians. Two closed controls induce non-commuting fibre transports, yet their order is exactly invisible to the passive experiment. An active boundary readout sees the commutator only at fourth order in loop side and linearly in readout-symmetry breaking, so its fixed-noise repeat burden is of order rho^-2 ell^-8. For a known binary alternative, the equal-block-cost optimum is repeated use of the single block with the largest whitened projection; no multi-block protocol can beat this by root-mean-square aggregation. At the reference operating point a Gaussian detector requires 287 blocks and a sign-quantised detector requires 451, reproducing the classical hard-limiter penalty. We then construct a physical observer rather than infer one from sample complexity. A raw sign tape and its 452-state sufficient count have terminal reset entropies of 450.3006 and 6.16795 bits but the same closed-computation ledger: compression moves erasure earlier rather than removing it. A 39-state sequential accumulator reaches error 0.075246 in 244.836 expected blocks. Source-matched finite-time reset protocols obey local detailed balance exactly and yield reproducible work and heat distributions. Finally, finite carrier coherence imposes a threshold correlation time below which the required evidence cannot be accumulated at all, independent of precision. An exactly non-zero, rationally certified interior distinction can therefore be permanently unusable to a finite-coherence observer. The contribution is not the general claim that boundaries underdetermine interiors, which is classical. It is a certified finite example linking non-Abelian quotient geometry, fourth-order readout, eighth-order evidence, finite-state inference, physical reset and a maximal future-decision deficiency, without identifying any two of those levels. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: frozen parent Gate 4 and Gate 5 inputs, production and verification code, all machine-readable tables, 150,000 trajectory records, publication figures, and SHA-256 checksums. The verifier passes 37 numerical and structural checks.