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

Observability as Openness: Finite-Stage Verification and How Non-Robust Structure Registers

Emil Alon

Published Oct 30, 2026• 0 citations
Publisher

Abstract

Physics reports its exact null results as bounds. We derive from the apparatus the form of what a measurement can certify, of which that practice is the idealized expression. If a measurement stops in one of finitely many separated record states, reached continuously from the configuration, the content of a record, the set of admissible configurations that could have produced it, is open, and on a connected space a discriminating apparatus must sometimes return no verdict (Lamport’s principle); for independent noisy records, a theorem of Genin and Kelly gives the same openness for verifiable hypotheses. Two consequences follow, known in other forms from computable analysis and learning theory: what a registration certifies holds on an open set (O1), and a condition that fails at admissible configurations arbitrarily close to the true one is never certified (O2), while one that the admissible set makes hold on a neighbourhood, as for quantized values, is certified exactly. We then ask how much non-robust structure a registration of given precision delivers. At the golden Siegel parameter of z² + c, a Taylor-model enclosure and certified witnesses show that a bracket of radius ε on parameter and initial state certifies exactly the first K Fibonacci closest returns of an orbit in the disc, with K within one rung of ½ log_φ(1/ε) at the six widths from 10⁻⁴ to 10⁻⁹. The record structure rests on a ladder theorem for Siegel discs.

DOI
10.5281/zenodo.23798095

Related papers

The Cohomology of Copying

The Institute for Applied Ontological Mathematics

Whether a quantum proof outperforms a classical one — both checked by the same efficient quantum verifier — is a question answered, so far, only relative to oracles. Beneath that answer is a structure with no quantum content at all: the difference between a resource one can copy and one one cannot. We show that this difference is cohomological. A witness that carries a copy map collapses every verifier to a memoryless sampler, so its distinguishing power is a functional of k-wise marginals alone; the obstruction to copying is a Čech class on a cover of a state by its measurement bases, and the Forrelation function of Aaronson and Ambainis is exactly the transition cocycle of that cover. The separation holds precisely when the class is nonzero: invisible from inside any single copyable chart, where it is a coboundary, and visible to the linear witness that reads the whole cover at once. Four familiar facts turn out to be four faces of the same class. Its non-vanishing is the no-cloning theorem; the dimension of its kernel is the Landauer erasure cost of the witness register; its representative on the standard/Hadamard cover is Forrelation; and the collapse of the copyable verifier onto one chart is why a classical witness, for these problems, cannot win. We make each face a finite, exactly computed certificate: on a corpus of distinguishing tasks built from Heisenberg–Weyl orbits, every depth-two adaptive sampler has advantage exactly zero — a total quantification over the strategy space, not a sampled estimate — while the linear witness reads a squared-Forrelation gap the kernel computes from truth tables through the Hadamard transform. Two independent exact computations agree on every verdict, and the engine that results either returns a gap two exact paths both certify, or refuses — and a refusal carries its own evidence, a certificate of exactly the obstruction that stopped it. The asymptotic separation of the underlying family is not ours; we cite it. What is ours is the identification — that a separation of complexity classes is, at bottom, a hole. All results below are machine-checked in Lean 4; the formal record and its axiom footprint are described in Section 8. The paper is legible in mathematics alone. Published by The Institute for Applied Ontological Mathematics.

•Oct 11, 2026•0 citations

Observer Dynamics and Discrete Records

Philip Lilien

We develop the observer function as a context-dependent process connecting continuous preparations to distinguishable records. The central mathematical result remains conditional: separated asymptotically stable outcomes produce a discrete basin quotient on the regular domain, while finite registration requires additional preparation and settling conditions. We extend that foundation with an integrated switched receiver whose preparation probabilities, fidelity, sufficient registration time, and disturbance margin follow from one specified law. A thermal version derives the outcome kernel and finite-horizon retention probabilities from an overdamped diffusion. Acceptance sensitivity and a declared predictive test expose the dependence on readout resolution and preparation. This integrated error budget belongs to one maintained-source receiver class; it does not validate a universal observer law. The detailed state space remains continuous. Scope. We establish conditional mathematical mechanisms and one physically interpretable receiver class. The binary source target is declared in advance. The calculations do not constitute experimental validation, a derivation of fundamental quantization, a quantum measurement theory, or a universal law of consciousness. Candidate definitions complete structures left open in the source manuscripts. Standard mathematical results and methods are organized into explicit proofs and reproducible model calculations; they are not claimed as new mathematical discoveries. The contribution is a conditional construction and its quantitative limits within that declared model. Universal physical scope and a fundamental-continuum ontology remain research hypotheses. In simple terms, the paper asks: How can a continuous system produce clear, discrete records (like “this” versus “that”) without the underlying state itself becoming discrete? It treats observation as a process that starts with a continuous preparation (a starting condition that can vary smoothly) and ends with a distinguishable record. The main mathematical claim is conditional and limited: - If a dynamical system has a few well-separated, asymptotically stable outcomes (think of two valleys a ball can roll into and stay in), then the continuous state space can be divided into open basins that lead to those different outcomes. The *labels* of those basins form a discrete structure (a discrete quotient), even though every individual trajectory stays continuous and the full state never jumps. - Getting a usable record in finite time, and knowing how reliable it is, requires extra conditions: the preparation has to be good enough, the system has to settle fast enough, and you need margins against disturbances. Attraction alone is not enough. The paper then builds one concrete example of this a “switched receiver.” Imagine a simple overdamped device (like a particle in a double-well potential) that is temporarily coupled to a source (the thing being observed), then disconnected so it can settle. From a single specified law the paper derives: the probabilities that a random preparation ends up correct, wrong, or still unresolved by a deadline, a sufficient time and disturbance margin that guarantees correct registration for every allowed preparation (in the deterministic, bounded-forcing case), and, when thermal noise is added, an outcome probability kernel plus retention probabilities over finite horizons. It shows where weaker claims fail. For example, two states that both get the same accepted label can still respond very differently to a later probe, so the label alone is not always a sufficient description. A wider acceptance window improves the numbers, but only because you relaxed the criterion, not because the dynamics improved. And there are simple counterexamples where a discrete label persists without the system settling to an attracting equilibrium. It does not derive fundamental quantization, a general quantum measurement theory, a universal observer law, or anything about consciousness. The detailed state remains continuous. The results hold inside one declared model class (a maintained-source cubic receiver). Extending them to freely evolving sources, higher dimensions, or other physical systems requires new derivations. Universality stays a research hypothesis. In short: the paper supplies a precise, limited mathematical mechanism by which continuous dynamics can generate discrete records under stated conditions, works out the numbers for one realistic receiver class (including noise and retention), and carefully lists what remains open. It is a conditional construction with quantitative limits, not a universal derivation. Explainer video Watch on YouTube (Roots of Reality): https://youtu.be/HJ9AYugKj_0 The video, its thumbnail and description are included in this record. Podcast How Continuous Physics Generates Binary Records Watch on YouTube (Roots of Reality): https://www.youtube.com/watch?v=YK6ruIbwmZs The podcast video, its thumbnail and description are included in this record.

•Oct 17, 2026•0 citations

Engineered Observation Limits in Exact Finite Models: What an Information-Theoretic Audit Certifies, Where It Stops, and Where It Does Not

Andrew H. Bond

The cryptography arc of the observation-theory campaigns, eleven registered runs in exact finite toy models, arranged as three movements. What such an audit certifies, an engineered secret-sharing plateau that is a step where an interaction-borne one is not, a conditional information certificate that proves non-garbling without a threshold, unanimous scalar leakage orderings that carry no task guarantee outside certified comparability, and two entropy accountings whose difference turns over while their ratio does not. Where it stops, a constant carries zero entropy, so an audit built from informations is blind to a trapdoor by that bound while it sees a declared one-bit leak immediately, and only a procedure's declared freedom is auditable because the artifact carries no record of the search behind it. Where it does not stop, reading an ensemble that is not orthogonal costs two bits of information for each unit of induced error while an orthogonal ensemble is read perfectly and leaves no trace, and one classical record is held in full by both consumers while one shared correlation is held by one. Three of the eleven runs failed their declared bars and are reported with their design errors named alongside the corrected registrations. Every number is bound by assertion to a committed evidence record. The models are toy models chosen for exact enumeration, nothing is claimed about computational hardness or asymptotic security, no real cipher, protocol, curve, device, or deployed system is modeled or evaluated, and no attack is developed.

•Aug 7, 2026•0 citations

Gleason from Inside: Certification, Forgery, and the Audit Hierarchy of a Quantum Memory

Ryan Cardwell, Claude

An interior observer cannot step outside its world to test the quantum probability rule; everything it knows arrives through records written into its own memory. This paper asks what such an observer can certify about the rule from those records alone, within a minimal two-record collision register. Results: the register's complete memory-side statistics (census) in closed form, making it a self-calibrating interior tomograph; an interior Gleason theorem at first order (the audit's response matrix has full rank with kernel exactly the Born-model tangent; the threshold is two records); the global forgery geography (a bounded shell and a lattice stratum pass every identity) with an identity-futility theorem proving this necessary and an exact repair (one PSD condition on a back-action-corrected moment matrix, complete at two records with gauge classified); the completed arena (det M_c = sin^2 phi (1 - |b|^2): one complex PSD condition is physicality plus tomography, its imaginary part the register's measurable complexness); the real-amplitude strike (complexness is credential-relative: cell dimension and readout sharpness; with both enforced, real registers are convicted by the census's zero channels at a dial rate of 0.40 census gap per unit certified sharpness); and a hardware campaign on ibm_kingston in which the audit detected, localized, mechanism-confirmed, and time-tracked a device systematic. Pre-registered throughout; failed predictions ledgered in an appendix.

•Aug 19, 2026•5 citations

Hilbert Event Geometry and the Quadratic Weight from Operational Primitives: A Conditional Reconstruction with an Assumption-Dependence and Failure Map

william rodgers

We study how much of the Hilbert-space and Born-rule structure of quantum theory can be obtained from operational primitives that involve records but not probabilities. The setting is a regime in which coherent alternatives recombine without leaving a stable record. We obtain three results of different kinds. Geometry. From composable contributions, record-inert reversible controls and amplitude scalings, under named conditions, we obtain a real inner-product event geometry. The existence of the inner product is equivalent to bounded mixing and is assumed in that form. In a worked interferometer with one mode per channel, the metric is not an input: metric-free port swaps and phase flips fix the form up to scale, and boundedness only forces the other controls to preserve it. Its uniqueness up to scale, the orthogonality of distinct outcomes, and the representation of events by orthogonal projections are derived. Obstruction. This geometry, even with full symmetry about the preparation and exact dyadic standards, does not select the quadratic weight: the preparation mixed with the maximally mixed state survives. The structural operations exhibited here certify only values on which the quadratic weight equals the counting weight. On restricted event families where Gleason’s theorem is unavailable, a calibration order oriented by the quadratic magnitude selects it: given exact standards, a state is the quadratic one exactly when it respects all such brackets. Whether such an orientation can be earned is the open problem. Given such brackets and refinement only to a finite depth K, every admissible state lies within 2^-K of the quadratic weight, without the Archimedean step. On the full projection lattice, Gleason’s theorem with null support, or sphere-transitive symmetry with null support, gives other conditional routes. Bridge. A predictive probability kernel is introduced separately. Its identification with the real quadratic weight ||P_A ψ||² / ||ψ||² is conditional on kernel-admission hypotheses, one of which is equivalent to the Born value; the complex form needs phase invariance in addition. The hypotheses select a class of contexts, and none is shown to be forced. For each we state the physical feature it expresses and a sufficient condition where one is known, and we work out one apparatus in which the geometry-stage hypotheses hold together. For all but one we give a context in which it fails (for the founding conditions, one that leaves the regime); for the remaining one, TCC-1, we give an illustration. This paper is the first in a series built on a common framework, Structural Ledger Consistency (in preparation).

•Nov 1, 2026•0 citations

Collective charge response is not determined by the few-particle sectors

M.J. Baek

Preprint and reproducibility archive; not peer reviewed. What this record contains. The full text of the manuscript "Identical Few-Particle Gauge Hamiltonians, Programmable Collective Charge Response" (M. J. Baek), its Supplementary Information with complete proofs, and the archive that certifies every closed-form value the paper states. The result. Few-particle dynamics are routinely used to infer collective response in paired quantum matter. This work constructs finite-range interacting response twins that defeat that inference exactly. For any prescribed finite p, two positive finite-range parents have complete static gauge Hamiltonians that coincide at every Peierls link phase on every sector N ≤ p and first separate at N = p+1; their zero-twist finite-density ground rays are the same Dicke condensate, yet their collective charge curvatures differ extensively. The obstruction has no universal depth, and the paper locates it exactly: the blind depth equals the spectator body order, the algebraic bound is independent of geometric range, and bounded range still bounds depth only through the number of sites a ball can hold — so no arbitrary-depth family of uniformly fixed range is claimed. Conversely, a structurally closed exact-pair tower closes at depth two. What is hidden is designable: with d(d+1)/2 displacement families the whole symmetric response-tensor difference is locally realizable at interior filling, and a triangular-lattice twin pair differs only in shear while both diagonal responses stay equal. A 4×4 hard-core-qubit discriminator gives an exact factor-of-two contrast with an internal null control and a state-preparation certificate in 17 equal-time settings. What is certified, and what is not. Results proved in closed form are stated as theorems and proved in full in the Supplementary Information; results established by exact rational or symbolic computation are labelled computer-assisted and carry the script that produces them; the 16-qubit discriminator is a blueprint with an end-to-end noise simulation, not a hardware demonstration, which is not claimed anywhere. Scope limits, open proof lines and one refuted conjecture are recorded explicitly rather than omitted. The archive. response_twins_unified_v1.0.zip contains the manuscript and Supplementary sources, the proof notes, the complete fail-closed verification harness (31 executed stages in release mode — 27 claim-bearing certificate stages, 1 non-claim diagnostic stage and three fail-closed gates — and 24 in quick mode) with one frozen log per stage, independent reimplementations of the load-bearing calculations, negative controls that must fail, the exact-arithmetic certificates behind every closed-form value in the paper, the figure-generation scripts, the scientific claim and provenance record (79 rows with status and scope notes, 50 of them naming the in-archive script or certificate that checks them, the rest saying in words why not), and a per-file SHA-256 manifest of all 209 payload files. Verifying it. Extract the archive and run python3 REPRODUCIBILITY/run_all.py --mode quick for the fast subset or --mode release for all 31 stages; bash BUILD.sh rebuilds both PDFs from source. The three gates check journal-format limits, the release payload against its manifest, and every number the documentation states about the artefacts. Running the harness does not modify the archive: all runtime output is written outside the immutable tree, so verification cannot invalidate the manifest. README.md separates reproducing the content (TeX Live 2023 or newer) from reproducing the archived PDF bytes, which needs the exact producing build recorded inside the PDFs. Licences. Manuscript, Supplementary Information and documentation CC BY 4.0; source code MIT; certificate data CC0 1.0. LICENSE.md is the authoritative per-file mapping and is included both in the archive and as a separate file on this record.

•Aug 7, 2026•0 citations
Physics reports its exact null results as bounds. We derive from the apparatus the form of what a measurement can certify, of which that practice is the idealized expression. If a measurement stops in one of finitely many separated record states, reached continuously from the configuration, the content of a record, the set of admissible configurations that could have produced it, is open, and on a connected space a discriminating apparatus must sometimes return no verdict (Lamport’s principle); for independent noisy records, a theorem of Genin and Kelly gives the same openness for verifiable hypotheses. Two consequences follow, known in other forms from computable analysis and learning theory: what a registration certifies holds on an open set (O1), and a condition that fails at admissible configurations arbitrarily close to the true one is never certified (O2), while one that the admissible set makes hold on a neighbourhood, as for quantized values, is certified exactly. We then ask how much non-robust structure a registration of given precision delivers. At the golden Siegel parameter of z² + c, a Taylor-model enclosure and certified witnesses show that a bracket of radius ε on parameter and initial state certifies exactly the first K Fibonacci closest returns of an orbit in the disc, with K within one rung of ½ log_φ(1/ε) at the six widths from 10⁻⁴ to 10⁻⁹. The record structure rests on a ladder theorem for Siegel discs.
Whether a quantum proof outperforms a classical one — both checked by the same efficient quantum verifier — is a question answered, so far, only relative to oracles. Beneath that answer is a structure with no quantum content at all: the difference between a resource one can copy and one one cannot. We show that this difference is cohomological. A witness that carries a copy map collapses every verifier to a memoryless sampler, so its distinguishing power is a functional of k-wise marginals alone; the obstruction to copying is a Čech class on a cover of a state by its measurement bases, and the Forrelation function of Aaronson and Ambainis is exactly the transition cocycle of that cover. The separation holds precisely when the class is nonzero: invisible from inside any single copyable chart, where it is a coboundary, and visible to the linear witness that reads the whole cover at once. Four familiar facts turn out to be four faces of the same class. Its non-vanishing is the no-cloning theorem; the dimension of its kernel is the Landauer erasure cost of the witness register; its representative on the standard/Hadamard cover is Forrelation; and the collapse of the copyable verifier onto one chart is why a classical witness, for these problems, cannot win. We make each face a finite, exactly computed certificate: on a corpus of distinguishing tasks built from Heisenberg–Weyl orbits, every depth-two adaptive sampler has advantage exactly zero — a total quantification over the strategy space, not a sampled estimate — while the linear witness reads a squared-Forrelation gap the kernel computes from truth tables through the Hadamard transform. Two independent exact computations agree on every verdict, and the engine that results either returns a gap two exact paths both certify, or refuses — and a refusal carries its own evidence, a certificate of exactly the obstruction that stopped it. The asymptotic separation of the underlying family is not ours; we cite it. What is ours is the identification — that a separation of complexity classes is, at bottom, a hole. All results below are machine-checked in Lean 4; the formal record and its axiom footprint are described in Section 8. The paper is legible in mathematics alone. Published by The Institute for Applied Ontological Mathematics.
We develop the observer function as a context-dependent process connecting continuous preparations to distinguishable records. The central mathematical result remains conditional: separated asymptotically stable outcomes produce a discrete basin quotient on the regular domain, while finite registration requires additional preparation and settling conditions. We extend that foundation with an integrated switched receiver whose preparation probabilities, fidelity, sufficient registration time, and disturbance margin follow from one specified law. A thermal version derives the outcome kernel and finite-horizon retention probabilities from an overdamped diffusion. Acceptance sensitivity and a declared predictive test expose the dependence on readout resolution and preparation. This integrated error budget belongs to one maintained-source receiver class; it does not validate a universal observer law. The detailed state space remains continuous. Scope. We establish conditional mathematical mechanisms and one physically interpretable receiver class. The binary source target is declared in advance. The calculations do not constitute experimental validation, a derivation of fundamental quantization, a quantum measurement theory, or a universal law of consciousness. Candidate definitions complete structures left open in the source manuscripts. Standard mathematical results and methods are organized into explicit proofs and reproducible model calculations; they are not claimed as new mathematical discoveries. The contribution is a conditional construction and its quantitative limits within that declared model. Universal physical scope and a fundamental-continuum ontology remain research hypotheses. In simple terms, the paper asks: How can a continuous system produce clear, discrete records (like “this” versus “that”) without the underlying state itself becoming discrete? It treats observation as a process that starts with a continuous preparation (a starting condition that can vary smoothly) and ends with a distinguishable record. The main mathematical claim is conditional and limited: - If a dynamical system has a few well-separated, asymptotically stable outcomes (think of two valleys a ball can roll into and stay in), then the continuous state space can be divided into open basins that lead to those different outcomes. The *labels* of those basins form a discrete structure (a discrete quotient), even though every individual trajectory stays continuous and the full state never jumps. - Getting a usable record in finite time, and knowing how reliable it is, requires extra conditions: the preparation has to be good enough, the system has to settle fast enough, and you need margins against disturbances. Attraction alone is not enough. The paper then builds one concrete example of this a “switched receiver.” Imagine a simple overdamped device (like a particle in a double-well potential) that is temporarily coupled to a source (the thing being observed), then disconnected so it can settle. From a single specified law the paper derives: the probabilities that a random preparation ends up correct, wrong, or still unresolved by a deadline, a sufficient time and disturbance margin that guarantees correct registration for every allowed preparation (in the deterministic, bounded-forcing case), and, when thermal noise is added, an outcome probability kernel plus retention probabilities over finite horizons. It shows where weaker claims fail. For example, two states that both get the same accepted label can still respond very differently to a later probe, so the label alone is not always a sufficient description. A wider acceptance window improves the numbers, but only because you relaxed the criterion, not because the dynamics improved. And there are simple counterexamples where a discrete label persists without the system settling to an attracting equilibrium. It does not derive fundamental quantization, a general quantum measurement theory, a universal observer law, or anything about consciousness. The detailed state remains continuous. The results hold inside one declared model class (a maintained-source cubic receiver). Extending them to freely evolving sources, higher dimensions, or other physical systems requires new derivations. Universality stays a research hypothesis. In short: the paper supplies a precise, limited mathematical mechanism by which continuous dynamics can generate discrete records under stated conditions, works out the numbers for one realistic receiver class (including noise and retention), and carefully lists what remains open. It is a conditional construction with quantitative limits, not a universal derivation. Explainer video Watch on YouTube (Roots of Reality): https://youtu.be/HJ9AYugKj_0 The video, its thumbnail and description are included in this record. Podcast How Continuous Physics Generates Binary Records Watch on YouTube (Roots of Reality): https://www.youtube.com/watch?v=YK6ruIbwmZs The podcast video, its thumbnail and description are included in this record.
The cryptography arc of the observation-theory campaigns, eleven registered runs in exact finite toy models, arranged as three movements. What such an audit certifies, an engineered secret-sharing plateau that is a step where an interaction-borne one is not, a conditional information certificate that proves non-garbling without a threshold, unanimous scalar leakage orderings that carry no task guarantee outside certified comparability, and two entropy accountings whose difference turns over while their ratio does not. Where it stops, a constant carries zero entropy, so an audit built from informations is blind to a trapdoor by that bound while it sees a declared one-bit leak immediately, and only a procedure's declared freedom is auditable because the artifact carries no record of the search behind it. Where it does not stop, reading an ensemble that is not orthogonal costs two bits of information for each unit of induced error while an orthogonal ensemble is read perfectly and leaves no trace, and one classical record is held in full by both consumers while one shared correlation is held by one. Three of the eleven runs failed their declared bars and are reported with their design errors named alongside the corrected registrations. Every number is bound by assertion to a committed evidence record. The models are toy models chosen for exact enumeration, nothing is claimed about computational hardness or asymptotic security, no real cipher, protocol, curve, device, or deployed system is modeled or evaluated, and no attack is developed.
An interior observer cannot step outside its world to test the quantum probability rule; everything it knows arrives through records written into its own memory. This paper asks what such an observer can certify about the rule from those records alone, within a minimal two-record collision register. Results: the register's complete memory-side statistics (census) in closed form, making it a self-calibrating interior tomograph; an interior Gleason theorem at first order (the audit's response matrix has full rank with kernel exactly the Born-model tangent; the threshold is two records); the global forgery geography (a bounded shell and a lattice stratum pass every identity) with an identity-futility theorem proving this necessary and an exact repair (one PSD condition on a back-action-corrected moment matrix, complete at two records with gauge classified); the completed arena (det M_c = sin^2 phi (1 - |b|^2): one complex PSD condition is physicality plus tomography, its imaginary part the register's measurable complexness); the real-amplitude strike (complexness is credential-relative: cell dimension and readout sharpness; with both enforced, real registers are convicted by the census's zero channels at a dial rate of 0.40 census gap per unit certified sharpness); and a hardware campaign on ibm_kingston in which the audit detected, localized, mechanism-confirmed, and time-tracked a device systematic. Pre-registered throughout; failed predictions ledgered in an appendix.
We study how much of the Hilbert-space and Born-rule structure of quantum theory can be obtained from operational primitives that involve records but not probabilities. The setting is a regime in which coherent alternatives recombine without leaving a stable record. We obtain three results of different kinds. Geometry. From composable contributions, record-inert reversible controls and amplitude scalings, under named conditions, we obtain a real inner-product event geometry. The existence of the inner product is equivalent to bounded mixing and is assumed in that form. In a worked interferometer with one mode per channel, the metric is not an input: metric-free port swaps and phase flips fix the form up to scale, and boundedness only forces the other controls to preserve it. Its uniqueness up to scale, the orthogonality of distinct outcomes, and the representation of events by orthogonal projections are derived. Obstruction. This geometry, even with full symmetry about the preparation and exact dyadic standards, does not select the quadratic weight: the preparation mixed with the maximally mixed state survives. The structural operations exhibited here certify only values on which the quadratic weight equals the counting weight. On restricted event families where Gleason’s theorem is unavailable, a calibration order oriented by the quadratic magnitude selects it: given exact standards, a state is the quadratic one exactly when it respects all such brackets. Whether such an orientation can be earned is the open problem. Given such brackets and refinement only to a finite depth K, every admissible state lies within 2^-K of the quadratic weight, without the Archimedean step. On the full projection lattice, Gleason’s theorem with null support, or sphere-transitive symmetry with null support, gives other conditional routes. Bridge. A predictive probability kernel is introduced separately. Its identification with the real quadratic weight ||P_A ψ||² / ||ψ||² is conditional on kernel-admission hypotheses, one of which is equivalent to the Born value; the complex form needs phase invariance in addition. The hypotheses select a class of contexts, and none is shown to be forced. For each we state the physical feature it expresses and a sufficient condition where one is known, and we work out one apparatus in which the geometry-stage hypotheses hold together. For all but one we give a context in which it fails (for the founding conditions, one that leaves the regime); for the remaining one, TCC-1, we give an illustration. This paper is the first in a series built on a common framework, Structural Ledger Consistency (in preparation).
Preprint and reproducibility archive; not peer reviewed. What this record contains. The full text of the manuscript "Identical Few-Particle Gauge Hamiltonians, Programmable Collective Charge Response" (M. J. Baek), its Supplementary Information with complete proofs, and the archive that certifies every closed-form value the paper states. The result. Few-particle dynamics are routinely used to infer collective response in paired quantum matter. This work constructs finite-range interacting response twins that defeat that inference exactly. For any prescribed finite p, two positive finite-range parents have complete static gauge Hamiltonians that coincide at every Peierls link phase on every sector N ≤ p and first separate at N = p+1; their zero-twist finite-density ground rays are the same Dicke condensate, yet their collective charge curvatures differ extensively. The obstruction has no universal depth, and the paper locates it exactly: the blind depth equals the spectator body order, the algebraic bound is independent of geometric range, and bounded range still bounds depth only through the number of sites a ball can hold — so no arbitrary-depth family of uniformly fixed range is claimed. Conversely, a structurally closed exact-pair tower closes at depth two. What is hidden is designable: with d(d+1)/2 displacement families the whole symmetric response-tensor difference is locally realizable at interior filling, and a triangular-lattice twin pair differs only in shear while both diagonal responses stay equal. A 4×4 hard-core-qubit discriminator gives an exact factor-of-two contrast with an internal null control and a state-preparation certificate in 17 equal-time settings. What is certified, and what is not. Results proved in closed form are stated as theorems and proved in full in the Supplementary Information; results established by exact rational or symbolic computation are labelled computer-assisted and carry the script that produces them; the 16-qubit discriminator is a blueprint with an end-to-end noise simulation, not a hardware demonstration, which is not claimed anywhere. Scope limits, open proof lines and one refuted conjecture are recorded explicitly rather than omitted. The archive. response_twins_unified_v1.0.zip contains the manuscript and Supplementary sources, the proof notes, the complete fail-closed verification harness (31 executed stages in release mode — 27 claim-bearing certificate stages, 1 non-claim diagnostic stage and three fail-closed gates — and 24 in quick mode) with one frozen log per stage, independent reimplementations of the load-bearing calculations, negative controls that must fail, the exact-arithmetic certificates behind every closed-form value in the paper, the figure-generation scripts, the scientific claim and provenance record (79 rows with status and scope notes, 50 of them naming the in-archive script or certificate that checks them, the rest saying in words why not), and a per-file SHA-256 manifest of all 209 payload files. Verifying it. Extract the archive and run python3 REPRODUCIBILITY/run_all.py --mode quick for the fast subset or --mode release for all 31 stages; bash BUILD.sh rebuilds both PDFs from source. The three gates check journal-format limits, the release payload against its manifest, and every number the documentation states about the artefacts. Running the harness does not modify the archive: all runtime output is written outside the immutable tree, so verification cannot invalidate the manifest. README.md separates reproducing the content (TeX Live 2023 or newer) from reproducing the archived PDF bytes, which needs the exact producing build recorded inside the PDFs. Licences. Manuscript, Supplementary Information and documentation CC BY 4.0; source code MIT; certificate data CC0 1.0. LICENSE.md is the authoritative per-file mapping and is included both in the archive and as a separate file on this record.