Can a Born-type probability structure arise on a substrate that is only a finite stochastic process? A stochastic program built from six primitive operations supplies the final matrix; a specified layered architecture constructs, from its outputs, a record layer, a two-dimensional real carrier and a quadratic law, and supports an adopted Born calculus. The six operations alone do not give this structure, and the square-root encoding and the projection are construction choices. Our main contribution is the architecture: a directed acyclic graph whose arrows are each marked as derived, chosen, adopted or standard mathematics, with the kind of check behind each. On registered populations, a snapshot predictor whose rank-two case is the law predicts the substrate's sampled label frequencies with lower aggregate loss than named competitors, and, in the construction's canonical basis, its cross terms carry its advantage over the diagonal rule. In each of 2,122 census cases the encoded state is not a function of the anonymous initial record description: two point preparations sharing all three labels differ by at least 1/25 in the trace probability of raw label 0, a statement about exact data, not operational access. This bound is retrospective: the registered bound 3/20 fails in 117 cases of the full census. On the original worked case the updates by the final matrix and its square do not lift to the carrier. The measurement rules are adopted: Lüders tests, all densities and effects, and additivity; on them the trace rule is unique, and finite ontic models with additive responses, and measurable preparation-noncontextual representations preserving the specified mixtures, are excluded. We do not claim that the substrate produces the measurement rule, that the layer forms in the run, or a derivation of quantum theory. The source code of the stochastic program, the constructions, the reproduction pipeline, the verification commands and the Lean 4 proofs are available at https://github.com/ioannist/six-birds-born (release v1.0). AI systems were used throughout this work, as the manuscript describes; the author directed the research, made the scientific decisions and is responsible for the content.
Can a Born-type probability structure arise on a substrate that is only a finite stochastic process? A stochastic program built from six primitive operations supplies the final matrix; a specified layered architecture constructs, from its outputs, a record layer, a two-dimensional real carrier and a quadratic law, and supports an adopted Born calculus. The six operations alone do not give this structure, and the square-root encoding and the projection are construction choices. Our main contribution is the architecture: a directed acyclic graph whose arrows are each marked as derived, chosen, adopted or standard mathematics, with the kind of check behind each. On registered populations, a snapshot predictor whose rank-two case is the law predicts the substrate's sampled label frequencies with lower aggregate loss than named competitors, and, in the construction's canonical basis, its cross terms carry its advantage over the diagonal rule. In each of 2,122 census cases the encoded state is not a function of the anonymous initial record description: two point preparations sharing all three labels differ by at least 1/25 in the trace probability of raw label 0, a statement about exact data, not operational access. This bound is retrospective: the registered bound 3/20 fails in 117 cases of the full census. On the original worked case the updates by the final matrix and its square do not lift to the carrier. The measurement rules are adopted: Lüders tests, all densities and effects, and additivity; on them the trace rule is unique, and finite ontic models with additive responses, and measurable preparation-noncontextual representations preserving the specified mixtures, are excluded. We do not claim that the substrate produces the measurement rule, that the layer forms in the run, or a derivation of quantum theory. The source code of the stochastic program, the constructions, the reproduction pipeline, the verification commands and the Lean 4 proofs are available at https://github.com/ioannist/six-birds-born (release v1.0). AI systems were used throughout this work, as the manuscript describes; the author directed the research, made the scientific decisions and is responsible for the content.
This deposit contains the manuscript and the three analysis scripts (with outputs and SHA-256 hashes) for Part III of the SFIT Stochastic-Braid Substrate series. The paper separates three objects that are often conflated in attempts to obtain quantum measurement statistics from a classical substrate: (i) the substrate configuration (positions, velocities, helicities of the Part I defects), (ii) the channel population xk≥0, ∑kxk=1, and (iii) the record probability P(k), i.e. the probability that a physical record names channel k. The Born rule relates (iii) to (ii); it says nothing by itself about how (ii) arises from (i). The paper asks three questions and reports the status of each: 1. Can a shared, finite carrier enforce exclusive records? In a coupled-mode model with explicit local detectors, detector-local back-reaction lowers the gated coincidence parameter from α=1.00 to α=0.57–0.60 at the strongest back-reaction tested, but only when detector thresholds are comparable to the carrier energy. At thresholds one-twentieth of the carrier energy, α stays at 0.96–1.00. Strong exclusion (α<0.1) was not reached in any of 136 configurations. Result: partial suppression only. 2. Under what conditions does record selection reproduce Born weights? Two sufficient routes are identified, each with a precisely quantified fragility. Route 1: exactly memoryless (exponential) detector thresholds give Born frequencies by a common-time-change argument; gamma thresholds of shape 2 depart by TV distance 0.08–0.15. Route 2: a bounded martingale for channel populations absorbed at a vertex gives Born weights for any functional form of the exchange law; a first-passage bound and a converse are proved (given absorption, zero conditional drift is necessary), and a biased exchange kernel is shown to follow the Kimura fixation formula, so zero drift must hold to order 1/M in the number of exchange units. Common-mode noise on the shared carrier cannot substitute for detector-local randomness: with fixed thresholds the largest channel fires first in every run, at every reversal rate. 3. Does Part I supply these conditions? No. The Part I helicity representation acts by permutation matrices, and no permutation action yields zero conditional drift for any filtration unless it is the identity (for pairwise-distinct populations). Measured on the Part I crossing process, the drift is nonzero at every test state, and populations are rearranged but never concentrated; sector populations are exactly invariant. This identifies braiding as neutral with respect to record selection. Scope and caveats. No derivation of the Born rule or of quantum superposition from the substrate is claimed. The internal state ψ is an input; the exchange kernel of Route 2 is global and postulated; memoryless detector thresholds (Route 1) are assumed; strong exclusion was not achieved; and the first-passage record of Proposition 3 (α=0 by conservation) has not been combined with local detectors in simulation. Real amplitudes suffice for the single-system statistics studied, but real-amplitude quantum theory is experimentally distinguishable from complex quantum theory in network scenarios. Each result in the manuscript is tagged [DERIVED], [ASSUMED], or [TESTED]. Three scripts produce every number in the paper; each states its model, metrics, controls, predictions and decision rules in its header, fixed before the runs reported. The scripts were not preregistered; this deposit supplies them together with their outputs and hashes to support reproducibility.
We present the foundational layer of a research program that derives quantum-mechanical, relativistic, and thermodynamic structure from a single ontology: a ledger of sealed records. The ledger is governed by three axioms: R, laws are laws of whole sealed histories; S, no distinction without a record; and C, couplings are fixed by self-consistency under refinement. The program builds on the stochastic-quantum correspondence of Barandes' indivisible processes, replacing configuration trajectories by committed records as the primitive. The main results, each at stated scope and with machine-verified receipts, are as follows. First, the Born layer: record weights compose through square roots, and tame-class reconstruction recovers the Weyl algebra and the Schrodinger representation, via Stone-von Neumann, from record towers, with ladder operators, selection rules, and exact continuum targets approached at machine precision. Second, Lorentz signature: the commitment structure of records forces a Lorentzian (1,d) split with derived orientation classes. The spatial dimension d = 3 is selected by a minimality principle graded as input in the text, not derived. The operational identification lapse = local clock rate is verified to 3.7 x 10^{-8} in curved record geometries as a model-internal consistency receipt, with first 3+1-dimensional cosmological checks presented qualitatively and no cosmological number claimed in this batch. Third, the arrow of time: reflection positivity is a theorem for eventless sectors with finite primitive Markov presentations, the entropy-production functional is the path-measure relative entropy sigma = D(P_AB || P_BA), the classical identity of stochastic thermodynamics in record-pair form, and the presentation hypothesis is sharp. An explicit reversible, valid, finite-rank process, the "record clock", fails reflection positivity, separating record laws from general reversible processes. Fourth, thermality: horizon temperature T = kappa / 2 pi is recovered in exact lattice constructions, presented in full in the companion horizon paper and cited here only as a consistency credential. We state precisely what is axiom, what is theorem, what is named identification, and what is imported mathematics; the full dependency audit is part of the paper. We also delimit the program's frontier: the tame class, the regularity stratum of the emergent continuum, and continuous sector families.
The Born rule connects squared amplitudes with the frequencies of recorded outcomes. This preprint constructs that connection through two explicit mechanisms: the square is a lattice index; probability is a fixation share. Complex multiplication on a lattice of rank two produces a contact layer whose cardinality equals the squared modulus of the register content. Loading one unit at each contact turns this arithmetic count into conserved mass. Fair transfers redistribute the units until a single contact survives. A bounded-martingale argument then gives each contact a winning probability equal to its initial share. Within the specified interaction class, the resulting Born law is exact, holds from every initial clock address, and is independent of the encounter schedule, provided fairness and completion are maintained. Polarization of the contact count also recovers the Hermitian geometry of the register. A single object, harmonic mass, connects the outcome law to the arrow of fixation. Its normalized coordinates give the conditional probabilities of future records, while its positive support can only shrink: an excluded alternative cannot return during the same run. The paper develops finite certificates for this structure, including sectorwise balance and a characterization of robustness under causal changes of the interaction parameter. Protected block outputs yield the sequential Born–Lüders law. Rational generalized measurements admit exact integer dilations and use the same fixation mechanism. Quantitative continuity gives a unique extension to arbitrary finite-dimensional states and measurements; controlled truncations extend the probability law to normal states on separable Hilbert spaces, including continuous spectra. The construction also makes the resources of recording calculable. Exact transfer costs, bounds on deviations from the Born law, retention times, and slow recording-error dynamics are derived. A temporal certificate reconstructs contact masses from activity measurements independently of winner frequencies. Developed within the Theory of Structural Articulation, the paper provides a complete finite event-source realization and a criterion for transferring its law to other physical carriers. Application to a particular recording process requires independent verification of contact loading, interaction balance, completion, and protection of the recorded block.
⚠️ CORRECTION NOTICE (added 2026): The author has since identified serious errors in this work through a systematic adversarial audit. The central claims of this record should not be relied upon. Specific issues found across this research program include implementation errors (e.g., conflation of signed cosine with cos²), circular definitions, proof gaps, results that reduce to known theorems, and effects that vanish under proper null models and direct-influence correction. This record is left online for transparency and as a documented case, not as a valid result. For the author's current, audited methodology, see the later work on classical-baseline auditing of quantum-like contextuality claims: https://doi.org/10.5281/zenodo.20680607 — A. Ogasawara This work investigates the structural origin of the Born rule within the framework of the Order-Projection Principle (OPP). We consider outcome-indexed measurements associated with orthonormal bases in finite-dimensional Hilbert spaces and analyze the constraints imposed by:(i) outcome-information separation (OIS),(ii) positivity and completeness of measurement operators, and(iii) non-contextuality of probability assignments. Under these conditions, we show that measurement operators reduce to rank-1 projectors and that, within an overlap-based family of candidate probability functions, the quadratic form P(e|ψ) = |⟨e|ψ⟩|² is uniquely compatible with non-contextuality. The result is obtained without introducing additional auxiliary axioms beyond the outcome-level formulation of the OPP framework. The role of linear structure (A4) and quadratic observation (A5) is also discussed, including their structural relationship to more primitive assumptions. Numerical experiments are provided to corroborate the consistency of the derivation across multiple dimensions. This work focuses on finite-dimensional, orthonormal-basis-indexed measurements and pure states. Extensions to mixed states, generalized POVMs, and continuous observables are left for future investigation. Note: Parts of the manuscript were linguistically and structurally refined with the assistance of AI-based tools.All scientific content, analysis, and conclusions are the author's own. Note: This work represents Version 1.0 of an ongoing research program on the Order-Projection Principle (OPP). Minor typographical corrections and clarifications may appear in later versions. The core conceptual claims remain unchanged.
Part II of the SFIT Stochastic-Braid Substrate series asks which additional structure would be required for outcome records to occur with Born-rule frequencies ∣ψk∣2, and how much of that structure the substrate itself could plausibly supply. Part I established that persistent stochastic defects generate braid-group structure with orthogonal representations preserving ∥ψ∥2, but made no claim about outcome probabilities; pure braiding cannot produce definite records, since orthogonal invertible maps cannot drive the internal state to a basis state. This paper studies a classical absorber race. Each channel k has an environment oscillator driven at resonance by a force linear in the carrier amplitude ψk; a record is produced by the first channel whose absorbed drive work exceeds a random threshold. The quadratic dependence of absorption on ψk is derived rather than assumed: a harmonic absorber gives Pk=g2ψk2/(2γ), while an anharmonic (Duffing) absorber yields fitted exponents of 1.65 at weak drive and 0.74 at strong drive, showing that the quadratic law holds only in the linear-response regime. With exponentially distributed thresholds, record frequencies agree with ∣ψk∣2 within sampling error for all tested states in n=2,3 and 4 channels. With fixed, uniform, or gamma-distributed thresholds of shape k>1, frequencies depart from Born values toward the largest weight - already at a total-variation distance of 0.09 at k=1.5. This is the behaviour characterized by Yellott's theorem: within races with independent, identically distributed thresholds, choice probabilities proportional to rates for three or more alternatives require exponential thresholds. The paper distinguishes this n≥3 condition (number of competing alternatives) from the n≥3 condition in Gleason's theorem (state-space dimension). Oscillator simulations match the exact race integral throughout, and thermal noise up to kBT=0.1 leaves frequencies unchanged when records are triggered by drive work. The result is explicitly conditional. Linear coupling, steady drive, channel independence and symmetry, memoryless thresholds, and mutual exclusion of records are assumptions of the model, not consequences of Part I; Table 2 lists all conditions and their status. The paper identifies memoryless thresholds (potentially supplied by the exponentially timed velocity reversals of Part I) as the most promising substrate contribution, states a pre-registered decision rule for testing it, and proposes further tests (start-from-rest ramps, total-energy triggers, over-dispersed thresholds). No derivation of the Born rule from the substrate is claimed; the mechanism is presented as a candidate, with the task for SFIT made specific. Simulation code (stage_c_absorber.py) reproducing all numbers from fixed random seeds accompanies the preprint.
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.