A record tells us what left a trace. When do relations among records also tell us which event came first? Ordinary pointer copying cannot answer: its gates commute, leaving the same complete endpoint state for every visit order. We contrast it with a reversible record-before-exchange protocol. Each station records the carrier's arriving bit, then replaces it by an independent label whose copy is retained. Station-indexed endpoint correlations reveal the predecessor of every station and recover the unknown global permutation. The local gate orientation, one-pass architecture and preparation boundary are supplied; timestamps and chronological station ranks are not. We then follow the resources that make these records available. Joint purity bounds price acquisition, recontact can restore coherence, and renewing a noisy bank removes the entropy of the complete retained state. These are distinct tasks, with distinct physical permissions. The result connects identifiable order to the history and maintenance of records, while leaving the origin of the clock parameter and acquisition boundary as formation questions. Complete proofs, finite-sample constants and renewal protocols are retained in the appendices. Main and Appendices PDFs are supplied separately, with full sources and scientific supplements in the accompanying ZIP.
A record tells us what left a trace. When do relations among records also tell us which event came first? Ordinary pointer copying cannot answer: its gates commute, leaving the same complete endpoint state for every visit order. We contrast it with a reversible record-before-exchange protocol. Each station records the carrier's arriving bit, then replaces it by an independent label whose copy is retained. Station-indexed endpoint correlations reveal the predecessor of every station and recover the unknown global permutation. The local gate orientation, one-pass architecture and preparation boundary are supplied; timestamps and chronological station ranks are not. We then follow the resources that make these records available. Joint purity bounds price acquisition, recontact can restore coherence, and renewing a noisy bank removes the entropy of the complete retained state. These are distinct tasks, with distinct physical permissions. The result connects identifiable order to the history and maintenance of records, while leaving the origin of the clock parameter and acquisition boundary as formation questions. Complete proofs, finite-sample constants and renewal protocols are retained in the appendices. Main and Appendices PDFs are supplied separately, with full sources and scientific supplements in the accompanying ZIP.
How do a structured world, a physical interface and a subject capable of revising its own participation form together? HAFF, Q-RAIF and T-DOME retain these three responsibilities. The present volume follows their main sequence; Foundation, Consciousness, Imprint, Brain Anchor and the Q-RAIF companions develop its additional mathematical and explanatory interfaces. The world line now puts physical selection before arbitrary redescription. Interactions select persistent blocks, coherence-decay rates give a coupling-dependent Euclidean relation, and conditions for a spatial interpretation become an explicit target. Transfer dynamics are not derived from dephasing; response-based distances require a separately identified reversible generator. A prepared recording direction passes into internal use in F; after the original contact is undone, the surviving action carrier becomes G's actual program. D connects its selected field port to a conditional semiclassical JT response (G1; D1). Ready states, coupling repertoire, total source and gravitational data remain physical responsibilities. A separate exchange experiment identifies event order; neither experiment derives the preparation boundary or time parameter. The common-source and modular-consistency line tests a stronger shared geometric law. The interface line connects propagation, operator representation and the cost of control through actual generators. A zero transverse residual places a control family in the spatial-generator span; covering every spatial direction additionally requires the calibration map's full row rank (C1; QR-C, Section 4). Equal positive cost forms alone do not establish that alignment. Minimal vector-potential coupling is a known aligned case, not a derivation of every actuator's access to it. The subject line gives task-information prices, a finite history-formation theorem and continued inquiry and repair from an acquired model. The specific gains differ: F–G traces a program value to a previous interaction rather than an external choice; TD-II learns a reading direction from training rather than supplying the correct direction. Ready registers, gate repertoire and schedule in the former, and the training channel, task and budget in the latter, remain inputs. These are advances in formation and provenance, not a claim that total preparation resources have decreased. Finite A is a separate material realization: one semiclassical mean-action scalar/JT history carries an acquired record into a physical source, geometric response and later X-basis reading, with a signal of order 10⁻⁹. Sustained thermal updating B at fixed exhaust capacity over growing runs and joint sharp heat export with effective return C retain stronger conjectural status. Neither establishes universal explanatory closure. The Imprint Chain's typed interface table and the postscript's cosmic formation-and-return conjecture keep the larger programme visible without borrowing those conjectures as proofs. This edition presents the argument in a Main volume and its full evidence in an Appendices volume. The paired PDFs link directly to one another. The accompanying source archive includes member papers and their scientific dependencies for page-level reconstruction. Main and full Appendices PDFs are separate; sources and scientific supplements accompany them in a ZIP.
Keeping a record changes which alternatives can interfere. On a pair of eight-state clock channels, we derive three recording operations whose identical final measurement has probabilities 1/4, 9/32, and 3/8. The full-current instrument retains fifteen distinct histories and transfers incoming occupation phase into their relative phases. Requiring its physical realization to conserve both native clock energy and occupation has a stronger consequence: every collective one-channel observable is conserved, and all admissible operations lie in the permutation commutant. This yields an exact reference-count balance, a sharp state-dependent disturbance bound, and a finite-reference obstruction to exact neutral recording. We characterize the complete finite-reference attainable region by an explicit finite algebraic synthesis problem, including its no-reference endpoint. A conserving collision construction then supplies a concrete attainable family, with an exact diamond-error formula and a uniform reference-return bound. These results connect the choice of record to observable dynamics and to the reference that pays for their implementation. A finite discrimination protocol states the required preparation, error tolerance, sample count, and independently calibrated time and energy scales. First public preprint release, version 1.0. The files include the PDF, the main TeX file, and a complete source archive with editable schematics and relevant verification supplements. 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 small quantum arrangement — a reader qubit Q₁ coupled to a remainder qubit Q₂ through one fixed gate, with declared operations on Q₁ only — has access to some distinctions of the remainder and not to others. This manuscript follows that arrangement through fourteen research units — thirteen with a model, exact proofs and an executable checker (with certified interval enclosures wherever a propagation is read), and one, the maintenance criterion, a definition with checked decision logic — and organizes what they establish around four distinctions. First, protecting an access restriction is different from preserving the distinctions a reader can use: a universal leakage bound and an exact one-gate value are proved; a reset-based maintenance pulse prolongs limited leakage at the price of previously accessible information, while a reversible pulse prolongs it and preserves the full declared input class. Second, meeting protection criteria does not identify a mechanism: a prepared finite clock-controller meets four declared criteria at four sizes, and so does a static field with the clock decoupled, and so does the clock's free mean field at the largest size. Third, restoring a supporting condition does not necessarily recover the capability: coupling alignment is shown to be a supporting condition of the capability, and a restoring process that improves alignment in six matched realizations meets the full restoration standard in one, misses it narrowly in one and fails in four, while useful access is preserved in none. Fourth, retaining a relation, delivering it to a reader and using it internally are different achievements, and a supplied design's advantage can reverse when its context changes without the comparison identifying the mechanism: a sector record restores access at three of four endpoints under an added permission; an internal coupling improves the primary endpoint without reaching the reference; a two-by-two of axis term and gating cell reverses both contrasts. Each result is stated with what it does not establish. No conclusion about self-maintenance, ownership or experience is drawn. The deposit is a technical manuscript, not peer-reviewed, that consolidates fourteen closed research notes and adds no theorem; the supporting proofs are in the notes. The package contains the manuscript (PDF and Markdown), the fourteen notes with two errata, every checker and its run record, the failure-path harness with its recorded outputs and a release adapter, the two earlier baseline notes, a claim-to-proof map, a correction ledger, a source lock and a manifest with the SHA-256 of every file. Every number printed in the manuscript was read by script from a packaged run record. Running checks/run_all.sh reproduces every checker's recorded summary line with the declared dependencies only (Python 3.11 or later; sympy 1.14, mpmath 1.3, numpy); the harness coverage, including the checkers it does not cover, is stated in §10 and Appendix A. Drafting and computation were AI-assisted under the author's direction. Archive SHA-256: 119d835b2d2e19463f3eb6478ea34ddbdf4deea220a5d6d6fe528dcf7061bedb.
How can a physical receiver record an earlier event and preserve that record through repeated copying, resetting, and later operations? This paper constructs a finite protocol that achieves this within a specified effective scalar-current model. A smooth reversible archive reader exposes successive digits of an actual initial position. A sign-preserving loader and coherent copying gate transfer each digit into a separate physical receiver. An exact Ermakov reset restores the scratch wave while retaining its correlations in a reset bank. The analysis follows the complete original configuration law throughout, without assuming a fresh statistical population after reset. For the stated initial-law bound and a schedule lasting 10,000 model time units, the paper proves a joint failure probability below 0.0000002641 for 44 records. This bound covers both correct copying of the earlier archive digits and preservation of the written records through subsequent operations. Any error inherited from an earlier archive warmup must be accounted for separately. Further results establish finite calibration criteria, control of archive motion between operations, and approximate reset uniformly over a specified constant spring-gain interval. Exact counterexamples explain why restoring or exchanging a wave factor does not automatically restore statistical independence.The paper supplies complete proofs and explicit error bounds. Physical preparation of the admitted initial stock, material realization of the controls, and integration into a complete measurement apparatus remain additional requirements.
Problem What must a physical record preserve to reveal temporal direction, measure duration, and support a calibrated experiment? This two-volume mathematical working paper distinguishes causal order, clock readings, and forward–reverse evidence, and studies their joint realization under one history law. Principal results Relative-entropy disintegration identifies evidence lost through observation. Graph potentials characterize sufficient current sensors by the absence of affinity on unobserved cycles; paired histories extend the criterion to silent events and indistinguishable reaction channels. Anonymous records, finite memory, and stopped decisions are treated explicitly. Compensated currents control clock calibration under shared environmental dynamics. A preparation-and-work identity bounds directional records and terminal organization together. Exact elimination retains hidden memory, while inverse and energy margins control response. A moving-sector comparison bounds the complete quantum apparatus record, including interactions, leakage, and transport; a spectral gap gives an explicit operating-time estimate. Analytical constructions and counterexamples cover graph–matter selection, ring and torus persistence, localized field clocks and receivers, and source-correlated records. A kinetic parent combines a selected ring, an inertial field, and a finite reversible receiver. Preparation frontiers separate information cost from attainable initial laws of a fixed dynamics. Methods, scope, and open questions The proofs use conditioning, path potentials, martingale compensation, generating functions, and stable operator comparison. The project includes editable sources, bibliography, 47 reproducible finite verification programs, provenance, and a separate corrections report. The results concern specified model classes and conditional external inputs. Selected spatial geometry is not a derived Lorentzian spacetime; the joint ring receiver uses supplied capture materials and diffusive transport. A common microscopic derivation of Lorentzian geometry, apparatus formation, two distinct proper-time clocks, constrained gravitational response, and typical directional preparation remains open.
One bit is all it takes to start the universe. Here “one bit” names the initial informational resource under the stated premises, not the theorem’s only assumption. Its two basis values control an explicit isometric preparation into the no-event and event history sectors; composing that preparation with the literal lifecycle gives distinct zero-clock and completed-event outputs, while the canonical bit prior recovers the uniform history law and all printed branch masses. The whole theorem in one line: First informative bit → 1D → 2D → 3D → durable quantum record → two operational event clocks → record-controlled dynamics. This work realizes that complete sequence as one exact theorem, with every stage finite, explicitly typed, and joined to the next. A first informative distinction acquires a one-dimensional relational home; finite events create filled two- and three-dimensional structure; the completed event leaves a persistent completion signal telling WHEN a later operation is eligible and a durable record of WHAT occurred; retained event order produces two noninterchangeable operational clocks, and the durable record controls a later quantum operation whose output statistics depend measurably on that record. The central new result is the exact end-to-end closure of this sequence as one normalized full-history lifecycle across explicitly joined finite carriers, with every firing and nonfiring history retained. To our knowledge, this is the first explicit finite theorem to close that complete conjunction while retaining both event and no-event histories in one normalized lifecycle across explicitly joined finite carriers. Established mathematical tools certify the interfaces; they do not supply the joined lifecycle proved here. Finite GNS canonically represents the commutative event laws; the labelled noncommutative carrier and full finite effect structure are selected inputs, and the Born-trace and CPTP forms follow from the stated consistency hypotheses on that selected base. Under the complete displayed base every lifecycle map is constructed exactly; whether the pre-activation formation equations alone uniquely force the router, fine writer/hold activation, fresh-row preparation, and comparator is a separate upstream parent-forcing problem and is not used by the completed construction. Every implemented map is exhibited, and the archived executable verification suite passes in ordinary and optimized execution and rejects all registered fault-injection controls. The theorem requires no external clock, singular initial datum, continuum-spacetime limiting procedure, postselection, discarded history, or selected-branch renormalization. The dated primary-source search protocol, version pins, screening ledger, and complete-conjunction matrix are archived in `evidence/COMPLETE_CONJUNCTION_LITERATURE_SEARCH_RECEIPT.json`. SI calibration, continuum spacetime, gravity, quantum field theory, and cosmology begin at later layers.