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.
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.
The Substrate Language Compiler is the executable computation branch of the SAM Research Project. The current frozen revision, SLCV1.2-H14F-EA18WA-D9, preserves the N100 native basis and H14F exact variable-elimination fallback of the earlier SLC line while installing the complete Exact Algebra of a Write, the directional T18/Z4^9 Weil adapter with reconstructible W9 reciprocal history, and an exact reversible dyadic block interface at depths 1 through 9. The source grammar remains the object of computation: N100 is not replaced by a smaller physical problem, and the current machine still returns exact global tensors whose coefficient sums close to the complete formal state count. The canonical N100 frustrated-spin computation retains all 2^100 formal binary configurations of the unchanged 100-spin, 260-edge Hamiltonian. The structure-first route detects eight exact components of sizes 15,15,15,15,15,10,10,5, evaluates 165,920 local assignments, and reconvolves them into the same coefficientwise-identical tensor returned by the full H14F path. The current SLC therefore treats graph structure, separator width, quotient rank, reversible history, and readout type as computational certificates rather than as after-the-fact annotations. SLCV1.2 adds a native write engine whose exact finite semantics include the complete 256-state W8 shell, B-gated X1 activation, W9 record emission and W9-to-W8 return, signed Z4^9 action, endpoint reversal, the 161-coordinate nonconstant history quotient, completed-mode projection, analytic Bt/Et/J/P+/- operators, and multiplicative-ledger readback. A 4,096-write program applied at every one of 262,144 addresses represents 1,073,741,824 logical transitions; the compiled group-law path produces bit-identical output and exact inverse closure with a recorded same-task speedup of 1784.531387x. The directional Weil fusion replaces the former NumPy write seam with this native exact write while leaving the prime-spacing and completed-Weil channels unchanged. The machine now joins exact dense state computation, typed record semantics, reciprocal direction, and read-only Weil custody in one frozen architecture. The result is a compiler whose central principle is unchanged: preserve the complete mathematical object, identify the information that must remain live, contract the rest exactly, and retain enough custody that the result can be independently reconstructed
Physical Sources, Finite Detectors, Persistent Records, and Actual Events This paper develops a unified account of quantum measurement under the Admissibility and Standing Constraint (AASC) framework, connecting constructed physical sources, quantum instruments, material amplification, finite record retention, event probabilities, and the actuality of measurement outcomes. The paper distinguishes three separate objects: a complete quantum instrument containing all outcome operations, including unresolved and failed outcomes; a material record carried by a physical system whose acquisition and retention can be analyzed; an actual history describing which occurrences belong to one original experimental run. A complete instrument and a persistent material record can be constructed without assuming that linear quantum dynamics alone selects one globally definite original-run history. Conversely, the admission of an actual event does not by itself determine its probability law or conditional quantum state. The physical construction contains two complementary measurement targets: a regulated interacting gauge–Higgs–fermion source with its full source Hamiltonian retained during finite receiver pulses; an explicitly parameterized six-mode cosine circuit with source and pump interfaces, losses, distinguishable outputs, a two-polarization intrinsic-spin receiver, and a finite energy-resolving thermal amplifier. The material-registration chain includes source-code loading, driven conversion, output registration, pump-displacement removal, transfer to an intrinsic material spin, finite Gibbs-collision amplification, endpoint reading, and quiet record retention. Electronic display labels, material flags, missed counts, dark displays, blanks, and unreadable outcomes remain distinct and are retained in the joint error ledger. The paper establishes: informative bounded receivers on an interacting quantum source; finite-pulse calibration with the complete source Hamiltonian retained; a complete monitored detector model; finite preparation and amplification bounds; coherent composition of instruments and records; adaptive record composition; local-instrument compatibility; calibrated affine probability uniqueness; sharp coherent calibration limits; sequential probability laws and compatible conditional states; explicit actual-history requirements. A finite Fourier residual certificate bounds the complete monitored detector instrument over its full 35.587ms interval by 0.063241 in restricted diamond norm. Exact interval arithmetic gives seeded amplifier endpoint fidelity greater than 0.9999235242 after 1,024 finite collisions, together with an explicit conditional survival bound for a subsequent 100ms quiet hold. The probability analysis shows that positivity, density-operator dependence, affinity under classical mixtures, and calibration fix the trace probability rule for the declared readout. Approximate sector calibration alone permits coherent deviations of order the square root of the calibration error; stronger linear bounds require additional structure. The paper’s central measurement-theoretic conclusion is deliberately separated from its successful detector construction. A complete instrument admits an exclusive-history completion, but linear quantum dynamics alone does not select one such history. Source-specific preparation, reader analysis, and a bounded counting-law completion supply the additional physical input required to select an actual history. The resulting framework substantially develops the material and probabilistic parts of quantum measurement while isolating apparatus errors, actual-history law, and event-selection assumptions as explicit obligations. The work does not claim to solve every interpretation of the measurement problem, derive a universal collapse law, establish unrestricted detector accuracy, or identify a finite calibration certificate with an experimental calibration. Principal contributions A unified source-to-detector account of quantum measurement. Constructed interacting quantum sources with finite receivers. Six-mode cosine-circuit detector realization. Material registration and finite amplification chain. Two-polarization intrinsic-spin receiver. Finite thermal collision and endpoint-reading model. Full-duration restricted diamond-norm detector bound. Interval-certified amplifier fidelity. Conditional quiet-hold survival bound. Retention of blanks, wrong, unreadable, and missed outcomes. Calibrated affine probability uniqueness. Sequential instruments and compatible conditional states. Explicit separation of complete instruments, material records, and actual histories. Source-specific conditions for actual-event selection. Complete physical error and assumption ledger.
A retained account can outlast its present address. Original Write, interacting-clock, spin and outgoing-field resultsdistinguish predictive state, timed history and energetic complement. This development adds source-linked spectral predictions,compact memory and monitor derivations, exact finite-source nonclosure certificates, a worked paid-reference protocol, andan eight-time ensemble measurement with explicit apparatus and sampling budgets. Signed phases, full source energy andphysical calibration remain in the same account. A companion source-to-field extension separates complete energy from adiagnostic minimum, gives exact spatial receiving constructions, and derives an operational coupling-response criterion for theactual interacting clock.
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.
We study how calibrated support information on positive incidence records can certify a complete outcome-resolved operation. On a supplied four-dimensional complex carrier, the original null-supported preparations span a codimension-one operator hyperplane. Exact branch preservation is characterized by the adjoint incidence moment; retaining outcomes can expose a distinction cancelled by the averaged operation. The canonical failure of a faithful filter preserves the hyperplane exactly under a reciprocal-spectrum condition. We prove a quantitative six-plane coercivity estimate and use positive leakage to control the full successful map, including a feasible scale correction and success conditioning. A shared matrix effect constraint then classifies complete pairs of nonzero invertible faithful outcomes. Independently admissible fitted branches need not admit a small repair within their prescribed target family. For a prespecified nonsaturated canonical success/failure instrument, testing both outcome supports and controlling shared gains gives a reference-uniform flagged diamond bound. Complete comparisons compose through finite classical histories with probabilities retained. A fixed-sample binomial construction converts raw counts into a simultaneous confidence-qualified instrument estimate. Its present constants yield large sufficient sample budgets, and an exact contamination example demonstrates conservatism even at population probabilities. The results are conditional on the carrier, common process, preparation, readout, and statistical contract. They do not establish a physical apparatus, device-memory tolerance, efficient experimental certification, or gravitational dynamics. Selected supporting declarations have two recorded Lean 4.19.0 executions and declaration-level source, type and axiom review; this is not an end-to-end formalization of the argument.