A theoretical and computational framework separating accepted protocol support, record-quality diagnostics, replicated entropy moments and implementation-level bookkeeping. A bounded positive effect induces a completed quotient Hilbert space; integer density-matrix moments are calculated through permutations on identical product copies; signed entropy increments telescope along a fixed reduction. Version 3.2 clarifies support versus distinguishability, finite-dimensional assumptions, higher-order observables, finite-copy uncertainty, numerical rank, logarithm units, additive ledgers and the limits of return diagnostics. A failed chosen inverse does not alone establish irreversible dynamics, and zero entropy residual does not establish state or apparatus return. The companion provides new reproducible central-spin and 500-state SWAP checks, an explicitly defined dephasing control, the recovered historical ledger script and its rerun, editable equations and manuscript sources. Missing historical central-spin and entropy-fit generators are disclosed. The associated Finite Record Protocol Calculator v0.3.0 supplies instrument/record diagnostics, Python and JavaScript parity checks, strict validation and a reduced-state entropy-path interface. This is the first deposit of this manuscript series, superseding working drafts v1.0 through v3.1. All examples are analytic or simulated; no laboratory measurements, empirical anchor, independent Born-rule derivation, emergent geometry or thermodynamic cost inferred from the accepted effect alone are claimed. The manuscript uses CC BY 4.0. Executable software and source code in the companion retain separate rights; see LICENSE_SCOPE.txt and software_dependency/RIGHTS.txt.
A theoretical and computational framework separating accepted protocol support, record-quality diagnostics, replicated entropy moments and implementation-level bookkeeping. A bounded positive effect induces a completed quotient Hilbert space; integer density-matrix moments are calculated through permutations on identical product copies; signed entropy increments telescope along a fixed reduction. Version 3.2 clarifies support versus distinguishability, finite-dimensional assumptions, higher-order observables, finite-copy uncertainty, numerical rank, logarithm units, additive ledgers and the limits of return diagnostics. A failed chosen inverse does not alone establish irreversible dynamics, and zero entropy residual does not establish state or apparatus return. The companion provides new reproducible central-spin and 500-state SWAP checks, an explicitly defined dephasing control, the recovered historical ledger script and its rerun, editable equations and manuscript sources. Missing historical central-spin and entropy-fit generators are disclosed. The associated Finite Record Protocol Calculator v0.3.0 supplies instrument/record diagnostics, Python and JavaScript parity checks, strict validation and a reduced-state entropy-path interface. This is the first deposit of this manuscript series, superseding working drafts v1.0 through v3.1. All examples are analytic or simulated; no laboratory measurements, empirical anchor, independent Born-rule derivation, emergent geometry or thermodynamic cost inferred from the accepted effect alone are claimed. The manuscript uses CC BY 4.0. Executable software and source code in the companion retain separate rights; see LICENSE_SCOPE.txt and software_dependency/RIGHTS.txt.
A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.
A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.
Finite observer domains can form stable records while disagreeing locally, suffering false triggers, or receiving correlated disturbances. This paper develops a thermodynamic account of how overlapping domains can preserve a shared record sector without a central corrector. The mechanism is not a digital error-correcting code: no bit string, encoding map, parity-check circuit, decoding algorithm, or external controller is assumed. Instead, physical overlap supplies consistency pressure, independent evidence supplies correction direction, and detailed-balance dynamics supplies the irreversible cost of reconciliation. Pairwise overlap mismatch is represented by the minimum relative-entropy cost of reconciling two restrictions with a common state, equal to twice the classical or quantum Jensen-Shannon divergence. Near agreement this cost is governed by the Bogoliubov-Kubo-Mori metric. A stability bound relates horizontal overlap strain to record-channel information loss when retention is close to a BKM-orthogonal projection. For memoryful records, the same geometry lifts to finite process histories through conditional expectation of the path score. Classical and quantum conditional-response models identify the stored correction burden as relative-entropy free energy, with its decay governed by independently computed entropy production. In reciprocal networks, overlap alone enforces consensus rather than truth; fault tolerance appears only when evidence channels are sufficiently diverse. An exact graph-theoretic bound shows that local false-island protection is controlled by weighted boundary expansion, while the global sector is controlled by total evidence. Finite temperature and record barriers produce a bounded operating window between under-protection and excessive rigidity. Version 1.1 incorporates downstream validation from a companion finite-regulator study. A connected overlap atlas can collectively reconstruct Jacobson’s equilibrium equation of state even though each individual observer is rank deficient. This does not turn graph protection into a derivation of gravity: record-sector protection and null-direction tensor reconstruction are distinct roles of overlap, and neither internal consistency nor overlap consensus authenticates source truth without independent provenance.
Exact computation becomes a reusable scientific result when the distinctions carried by its source surviveobservation, transformation and reuse. This volume develops that principle through the computationalframework of the Substrate Accumulation Model: complete state spaces, certified operators, signed Gramaccounts and retained histories. Source decompositions make exact joint spin densities through N = 5000tractable while preserving the original Hamiltonian and integer counts. Complete Schur constructionsexpose the information, residuals and terminal payments that subsequent calculations require.The arithmetic program has an exact floor-block evaluator with conditional O(N3/2 log N) traversal cost, ex-plicitly charged kernel and precision costs, and finite screened-remainder gains. Query-dependent featureminima and a quadratic source-independent norm obstruction identify useful compressions and a preciselimit of energy-only transfer. The global signed estimate required for the Riemann-hypothesis implicationremains open. In stochastic dynamics, complete source moments yield new signed-chain memory bounds,sharper resolvent references and a common positive ordinary-clock receiver. Optimal alternating sched-ules still lose an extensive gap at fixed duration, with a sharp reversible-sampling variance bound.The physical-source examples retain their full accounts. Continuum vector capacity, a classified paired-Write optimum and exact bank/storage costs separate recoverable work from its initial preparation. He-3response reveals a low intrinsic excitation invisible to one projector and supplies a thermal inverse withfinite error control. Confined compensated dynamics approach an invariant dark set; radiating-mode stabil-ity and whole-quadrupole action bounds retain their hypotheses. Certified JC1 polygon transport, rationalreceivers with controlled bit growth and optimal finite membership codes make the corresponding source-to-observation maps executable.Part 2 connects these results to actual GEN6 operations and Duck research records. The latest nativeservice ended early after a 4 GiB memory-limit failure; completed receipts, analytical proofs and missingnative outcomes are reported separately. All four complete contributions, failed attempts, corrected succes-sors and reproducibility sources remain available. Physical selection, calibration and reusable apparatuscosts remain explicit wherever the source law does not determine them.
This theoretical and computational preprint integrates standard QND measurement and posterior-martingale results with finite-confidence decisions and physically retained observer records. Under a declared quantum instrument and its standard outcome probabilities, the posterior is a bounded martingale on an increasing observation filtration. A precise sufficient identification condition yields asymptotic terminal weights; a binary Gaussian benchmark gives exact mean stopping times, finite-threshold latch probabilities, and a controlled population-transfer bias bound. Version 2.3 is the first public release. It distinguishes accumulated observations from lossy current memory; assumed Born/instrument probabilities from derived consistency results; expected entropy from pathwise ambiguity; continuous confidence endpoints from discrete overshoot and unresolved runs; and Kramers first escape from endpoint readout error. It also clarifies the conditional D18/D19 persistence-selector interface and the separate D1092 finite-resource ledger, with direct attribution to established QND convergence and filtering literature. The companion archive includes the editable manuscript, PDF, equation sources, a fixed validation protocol, executable independent checks, numerical results, a revision ledger, and unchanged historical inputs. Historical simulation summaries are explicitly distinguished from new executions; some older executable sources were unavailable. The new audit includes exact finite-kernel and stopped-posterior checks, Gaussian likelihood-mixture calculations, five neutral and four population-transfer boundary-value cases, and retention/accounting controls. All examples are analytic or synthetic. No laboratory measurements, independent Born-rule derivation, measurement-problem solution, universal physical selector, or new empirical anchor are claimed.