In a finite, timeless configuration space where probability is counting and the population of an outcome class is proved to equal N|α|², we construct a refinement chain from local devices—nearest-neighbour beamsplitters and per-cell phase increments, all on the 3,600-value phase lattice of the companion models—and evolve wavepacket classes by literal enumeration. The small-angle brickwork realizes the lattice Hamiltonian H = −2η cos k + V(x): the effective mass m* = 1/(2η) is the inverse hopping rate—mass as resistance to record restructuring, obtained from the move set rather than posited—and the potential is a cell-dependent phase cost per closure step. Counted populations reproduce the Schrödinger spreading law σ²(t) = σ₀² + (t/2m*σ₀)², the group velocity to seven significant figures against the exact device chain, and harmonic oscillation at ω = √(2ηκ), with Σₓ nₓ = N exact at every stage—the counting form of unitarity, tested exactly. Two findings go beyond agreement. First, the counted packet has a literal edge: populations fall to one configuration and then to zero exactly where the Born value crosses 1/N, so a counting world's particle has finite support where the continuum Gaussian merely thins—the rational-probability prediction rendered in position space. Second, the ontology's record-relative definition of classes is load-bearing for dynamics: counting once at the measurement stage (the chain as one composite device) yields residues of O(1/N), measured log–log slope −0.94, whereas imputing an integer census to unrecorded intermediate stages—partitions where no records are—degrades the scaling to slope −0.62 through the amplitude granularity of few-configuration tail classes. A definitional clause changes dynamical accuracy by a factor of order √N. What is not shown is the formal continuum limit: given [CS] the discrete effective dynamics is derived, with the same conditional status as the companion theorems, and the passage to the continuum equation remains the framework's open problem. The cell structure is a named input [CS]—but not a foreign one: its three clauses are the discrete shadow of the framework's own emergent-space program, and we locate each, finding that a preferred partition is what the stability criterion already selects, that adjacency is what the elementary refinement move set already supplies, and that only the graph's large-scale regularity—together with an assumed uniformity of hopping rate, which is a flatness assumption—remains open. Reading the cells as emergent space has an immediate consequence: the construction's maximal group velocity is one instance of the framework's conjectured invariant speed, computed rather than posited, since a single elementary move defines both the refinement step and the spatial adjacency. Relaxing uniformity—a position-dependent hopping rate, hence a position-dependent effective mass—is the discrete form of curvature, and is the natural next model.
In a finite, timeless configuration space where probability is counting and the population of an outcome class is proved to equal N|α|², we construct a refinement chain from local devices—nearest-neighbour beamsplitters and per-cell phase increments, all on the 3,600-value phase lattice of the companion models—and evolve wavepacket classes by literal enumeration. The small-angle brickwork realizes the lattice Hamiltonian H = −2η cos k + V(x): the effective mass m* = 1/(2η) is the inverse hopping rate—mass as resistance to record restructuring, obtained from the move set rather than posited—and the potential is a cell-dependent phase cost per closure step. Counted populations reproduce the Schrödinger spreading law σ²(t) = σ₀² + (t/2m*σ₀)², the group velocity to seven significant figures against the exact device chain, and harmonic oscillation at ω = √(2ηκ), with Σₓ nₓ = N exact at every stage—the counting form of unitarity, tested exactly. Two findings go beyond agreement. First, the counted packet has a literal edge: populations fall to one configuration and then to zero exactly where the Born value crosses 1/N, so a counting world's particle has finite support where the continuum Gaussian merely thins—the rational-probability prediction rendered in position space. Second, the ontology's record-relative definition of classes is load-bearing for dynamics: counting once at the measurement stage (the chain as one composite device) yields residues of O(1/N), measured log–log slope −0.94, whereas imputing an integer census to unrecorded intermediate stages—partitions where no records are—degrades the scaling to slope −0.62 through the amplitude granularity of few-configuration tail classes. A definitional clause changes dynamical accuracy by a factor of order √N. What is not shown is the formal continuum limit: given [CS] the discrete effective dynamics is derived, with the same conditional status as the companion theorems, and the passage to the continuum equation remains the framework's open problem. The cell structure is a named input [CS]—but not a foreign one: its three clauses are the discrete shadow of the framework's own emergent-space program, and we locate each, finding that a preferred partition is what the stability criterion already selects, that adjacency is what the elementary refinement move set already supplies, and that only the graph's large-scale regularity—together with an assumed uniformity of hopping rate, which is a flatness assumption—remains open. Reading the cells as emergent space has an immediate consequence: the construction's maximal group velocity is one instance of the framework's conjectured invariant speed, computed rather than posited, since a single elementary move defines both the refinement step and the spatial adjacency. Relaxing uniformity—a position-dependent hopping rate, hence a position-dependent effective mass—is the discrete form of curvature, and is the natural next model.
Hoffman’s conscious-agent formalism defines agents by Markov kernels on finite sets, anda programme has sought to obtain quantum mechanics—complex amplitudes, Hilbert space,unitary evolution and the Born rule—as outputs of that stochastic substrate. Papers I–III ofthis series closed the passive-readout, witness-inequality and Born-rule-inversion routes. Herewe examine the Eulerian control principles on the continuous-time nearest-neighbour jumprelative of the programme’s N -cycle substrate, with the phase S posited as an agent-carriedvariable and the rates depending on the population density, and ask which of them are exactlythe lattice Schrödinger pair at finite lattice spacing a. (i) No member with a kinetic termquadratic in the rates is exact, for any N , wherever its stationary drift exists (a degree count);by Legendre duality, (ii) no globally optimising member, with any cost, over an S-independentadmissible rate set, is exact on the whole configuration space, because the reduced Hamiltonianof a minimiser (maximiser) is convex (concave) in the phases while the lattice Schrödingerenergy is neither; (iii) an optimising member with bothprates free nevertheless exists—the2 —whose minimiser isconvex bond cost cQ (J) = ℏJ arcsin(J/Jmax ) + ℏJmax 1 − J 2 /Jmaxexactly the lattice Schrödinger pair, density dependence included, on the open winding-zerosector where every real bond phase satisfies |∆x | < πℏ/2, and which fails on the outer half ofthe zone, nodes included, and on every configuration with nonzero winding; with an activitycost selecting the symmetric part of the rates, that optimiser is the Bell–Vink process; (iv)exact stationary-point members exist beyond that sector, Bell–Vink among them, determinedup to the split of each bond energy and a uniform circulating current, with the branchselection as the rate law. The cost cQ is the entropic (Schrödinger-bridge) bond cost with thenoise scale continued to imaginary values, cE |Jmax →iJmax = −i cQ on principal branches, aformal correspondence. As a diagnostic, the fixed-noise Nelson–Yasue member with κ = +1carries the Euclidean sign of the quantum potential, κQ = −κ; the κ = −1 (Guerra–Morato)member is exact in the continuum and, where its stationary drift exists, departs from thelattice target at O(a2 ). Nelson’s law of motion, imposed on the fixed-total-rate kinematicswithin the rate bound |bx | ≤ 2νa for odd N , has the real-time sign, is exact for plane wavesand pure-potential configurations, and departs at O(a2 ) generically, with an exact vanishingfamily and in-regime counterexamples at N = 5, 7. A programme-status section recordsthat the substrate, read as a one-time operational probabilistic theory, lies in the classicalbranch of the Hardy and Chiribella–D’Ariano–Perinotti reconstructions, and corrects onestatement of Paper III (Barandes’ precondition is met by every finite-alphabet process; thesentence was true but empty). These are bounded no-go theorems for the reading constructedhere; no claim is made about quantum mechanics emerging from stochastic dynamics ingeneral. All machine results are exact-arithmetic and rerun bit-identically. The Round-1lattice results and the reconstruction-axiom checks were preregistered with blind priors; thetheorems added in revision were prompted by review and are machine-checked by successorverifiers, not preregistered.
A finitist, relational axiomatization of physics: quantum theory and a relativity sector derived from four axioms about group-valued relations and closure. Contributions to the foundations of quantum mechanics (Born rule derivation, quantum reconstruction, local tomography, complex field selection), the emergence of time and causal structure in discrete networks, discrete Noether theorems, lattice gauge structure, and the Schrödinger equation derived by two independent routes. Every claim is graded in a Claim Ledger; every numerical claim is machine-verified with archived scripts; negative results are reported at full strength. What this paper does The universe is taken to be constituted by relations rather than objects. Stable relations form closures (self-consistent cycles) whose holonomies carry the physical content. Four axioms — primacy of relations (group-valued, edge-borne), closure stability, chirality from order, and observation as bidirectional group exchange — yield, at explicitly graded and conditional levels: Quantum sector Exchange-completeness theorems for finite label groups: abelian at all cycle ranks; non-abelian on the single cycle (Wilson readouts plus class-sum convolutions generate the full matrix algebra); the multi-cycle non-abelian case on the operational-equivalence quotient, with the obstruction completely characterized via class-preserving outer automorphisms — and the quotient's necessity now stratified by the source of word blindness (see New in Version 24.0). The Born rule, proved for finite abelian networks from a strictly weaker relational readout premise (statistics of realizable effects depend only on relational content); non-contextuality has this single source; additivity is basis-relative and declared as such. The Schrödinger equation by two routes of unequal premise grade, maintained side by side: a spectral route — the action operator is a weighted Cayley-graph Laplacian in the Pontryagin dual basis, the derived Gibbs state's unique canonical (modular) flow yields the Schrödinger equation with Hamiltonian equal to the action operator, no continuum limit, zero conjectures consumed, the single non-theorem step one flagged identification; and a Madelung route — physical and mechanism-rich (probability density derived from constraint gaps), valid exactly on the domain of the pseudo-continuity conjecture, with its full premise bill stated (continuity equation, Wallstrom circulation condition, m, V). A dedicated comparison subsection gives the line-by-line premise accounting and the machine-measured agreement region. Complex field selection: ℂ selected over ℝ and ℍ within the GPT comparison class in the covered sectors, with a second independent route from chirality (Frobenius–Schur dichotomy, quaternionic double exclusion); "uniquely selected" expressly not claimed. Positivity as pairing: all five in-text positive-semidefiniteness theorems traced to one mechanism (M = B†B with native factor); the Kraus form and complete positivity derived rather than assumed. The Noether sector on Noether's two theorems exactly: Noether I recovered on the holonomy action (compact Lie realization); Noether II identified as present (Bianchi as horn-filling, Schläfli as its Regge form); selection rules recovered for finite groups; the GNS bridge proved non-vacuously on the full exchange algebra; the sole potential extension — conservation as the kernel of exchange — isolated as a registered conjecture, consumed nowhere. A local–global representation theorem: six generative quantities (closure invariant, flux quantization, Weyl phase, non-abelian Stokes, orientation visibility, terminal normalization) are evaluations of cohomology classes against closed chains — one syntax, six exact machine probes. The gatekeeper no-go theorems registered and discharged: Kochen–Specker (the framework posits no global valuation — outcomes are resolutions of constraint gaps, and basis-relative additivity blocks state-independent variants), Pusey–Barrett–Rudolph (the statistical envelope is over resolutions yet to happen, not values already held; machine witness: identical configuration ensembles with opposite relative phase have opposite statistics), Wallstrom (registered as an explicit input, structurally discharged in the finite-abelian sector), Hegerfeldt (the Lieb–Robinson exponential tail identified as the only claimable front form for the continuum limit), Frauchiger–Renner (cross-agent certainty transfer presupposes kernel-free record transport, exactly what exchange-incompleteness excludes), and no-cloning (inherited in the covered sectors); Conway–Kochen and Colbeck–Renner noted as concordant. Relativity sector Time from finite capacity plus genuine randomness: the staging theorem (Θ(d) dependency depth, unbounded chains via the Moore bound; the quantitative failure law conditionalized on measure-level independence with exact minimal witnesses); the temporal quantum defined combinatorially, no Hamiltonian input. The speed of light grounded in an exact discrete dependency cone (combinatorial, no quantum input), the Lieb–Robinson bound consumed at cross-check grade only; a boost no-go theorem reducing Lorentz invariance to named statistical conditions, with the Collins fine-tuning objection recorded as a gate. The trace-descent theorem group: the growth-history measure forced onto the Mazurkiewicz trace quotient; chain reflection positivity at every depth with completely explicit spectrum. An equation sector of nine verification families (Schrödinger, Dirac, Maxwell/U(1), canonical commutator, Yang–Mills SU(2), Regge calculus, Klein–Gordon, Noether loop, Cartan curvature), where every machine-precision claim is the shadow of a proved backbone lemma — including the factor ½ of H = ½L + V, identified as the Wilson Fourier coefficient fixed by the action theorem. Four experimentally testable predictions, including a discriminating flat-versus-sigmoid visibility protocol. The Standard Model gauge group, ħ, and G remain open, with attack routes registered. How to read Three entry paths are marked in the document. Path A (derivational core): axioms → group structure → Noether sector → least action → Born rule → positivity. Path B (physical mechanisms): constraint propagation → time as determination → wave function as gap envelope → fields. Path C (scope and limits): the Claim Ledger, then Discussion and Open Problems — for the reader who wants to know what is claimed and what is not before reading anything else. The Claim Ledger is the single authoritative register of claim status; wherever body text sounds stronger, the Ledger governs. New in Version 24.0 (Version 23.0 is the immediately preceding public release; this version supersedes the internal V12–V15 and V17–V19 series, whose numbers are not used externally.) Version 24.0 resolves the structure of the multi-cycle non-abelian obstruction — the sector's longest-standing open front — following an external research exchange with three rounds of independent re-verification (fourteen core figures, three commutant instruments implemented independently, exact integer arithmetic on the obstruction side) and two rounds of counter-review that corrected one quantifier on each side: A dichotomy of the multi-cycle obstruction (new remark). Word blindness on multi-cycle networks has two identified sources, jointly covering every tested case, with opposite behaviour as cycle rank grows. Type I (global; graded): a class-preserving outer automorphism yields a commutant element by an argument free of cycle-rank reference; its non-triviality holds at theorem grade for b₁ ≥ d(G) via generating tuples, is monotone in b₁, and the threshold is measured at b_σ = 2 on the tested Wall group (at b₁ = 1 the permutation is the identity — no universal claim is made, and the existence of groups with threshold above 2 is registered open). Type II (local; measured): Out_c trivial but fusion fails on a proper subgroup, the blind pairs sitting in non-generating sectors — the same mechanism that defeats Wilson generation; this blindness heals: on every verified group (A₄, SL(2,3), A₄×ℤ₂) the full commutant collapses to trivial at b₁ = 3 by exact computation on two independently implemented instruments, although word readouts remain blind — the shift primitives separate, above a threshold, and the natural explanation (tuples becoming generating) is refuted by the persistence of blind blocks. Three boundaries at full strength: no exhaustiveness proof (a third source is not excluded); no general healing theorem (the verified groups all heal at 3, cause unidentified); the verified Type II sample is narrow. The quotient proposition restated in stratified form. The operational-equivalence quotient's necessity is now part of the proposition's own statement, in three strata: necessary where Out_c ≠ 1 at every b₁ ≥ b_σ(G), with b_σ ≤ d(G) at theorem grade; one-dimensional at b₁ = 2 on the fusion-type groups (verified cases); trivial at b₁ ≥ 3 on every verified fusion-type group and at every tested b₁ for word-separation-complete groups (a fourteen-group scan of orders ≤ 31 found no third source). Pre-registered validation preceded the restatement: a stratification-exhaustiveness scan (pass), a new-witness search (no new witness in range, downgrade clause applied as pre-registered), and a zero-conflict audit of the three strata against all archived data. The residual open problem is now precisely located. What remains of multi-cycle completeness: the rare Out_c ≠ 1 groups (54 in the exhaustive range through order 96) above their measured thresholds, the low-b₁ fusion stratum, a general healing theorem, and whether a threshold above 2 occurs. The multiplicity-freeness conjecture's mechanism sentence is corrected with the two regimes stated separately (at b₁ = 2 the shifts do not separate — the blind-pair transposition commutes with every primitive, integer-exact — and reduce the commutant to
@5incere5cience · Sincere Science · We Are the Champions 20 1 1 2 3 5 8 ... ∞AbstractWe re-examine the double-slit experiment under the ontology established in prior@5incere5cience work — discrete energy packets (Einstein 1905a), relative time with zeroproper time on null worldlines (Einstein 1905b), time as the sequence of discrete interactionevents in each packet's own frame, and agency as the direction of spin at the forced resolutionnode. Under these axioms, the difference between the 'no detector' (OFF) and 'which-pathdetector' (ON) regimes is a difference in the number of resolution events traversed by thepacket in its own history: two ticks versus three. The packet itself is the same discrete object inboth cases. What is traditionally called wave-particle duality dissolves as a linguistic artifactarising from the attempt to reconcile two statistical patterns by postulating a change of nature.Weak-measurement phenomenology is accounted for as population mixing of binaryindividual-packet histories, anchored by direct macroscopic observation in microscopy ofStructured Vesicular Entities (SVEs). The delayed-choice quantum eraser (Kim et al. 1999)dissolves its apparent retrocausality via the same separability-failure move previously used todissolve Bell nonlocality. The quantitative derivation of the OFF-regime interferencedistribution from first principles — the analog of the cos2(θ) derivation completed forpolarization in an earlier paper — is flagged explicitly as an open problem. All claims aremarked with epistemic status (observation, logical consequence, working hypothesis, postulate,open problem) so that readers can identify which parts of the construction are load-bearing,which are exploratory, and which invite refinement.
Configuration Realism (CR) is a physical ontology consisting of a finite, timeless configuration space. Each configuration is a complete arrangement of fundamental degrees of freedom; none evolves; phase attaches additively to degrees of freedom and is defined relationally, relative to a stage of an observer chain. Information exists only as finite, lossy physical records. Each record defines a compatibility class, the configurations it cannot distinguish, and probability is defined as counting over these classes. The framework's derived core is proved and computed in three companion papers under named structural assumptions. The population of an outcome class equals N|α|²: the Born rule as a theorem, with the frequency reading consuming exactly one typicality principle. The CHSH quantity assembled from integer counts reaches 2√2 to O(1/N), the ontology giving up counterfactual definiteness in the plain Bell scenario—and the absoluteness of outcomes where Wigner's-friend extensions demand it—rather than locality or free settings. And equipped with a local move set, counted populations propagate as wavepackets: the effective mass is the inverse hopping rate of elementary refinement, the potential is a cell-dependent phase cost, and the counted dynamics reproduces Schrödinger phenomenology with the number of configurations conserved exactly at every stage. Around this core, closure laws order records by refinement. Observers are chains of record-bearing stages; change is difference read along a refinement chain; time is the emergent coordinate that labels it; and closure distance, accumulating in discrete quanta, measures the restructuring refinement requires. Direct consequences follow for entropy and the arrow of time, for the classical limit, and for objectivity as redundancy. The remainder is a labeled research program: causal structure, Lorentzian geometry, geodesic dynamics, and horizon thermodynamics as conjectured continuum limits of closure geometry, with the constructions that would establish them stated as open problems. A dedicated section collects the framework's distinctive predictions—the O(1/N) family separating a counting world from continuum quantum mechanics—each with its mechanism and in-principle test. Every claim in the paper is tabulated with its status: postulate, theorem, verified, argument, conjecture, or open.
A finite ensemble of definite, equally real configurations looks like it must obey the Bell inequalities: definite values, counted, are the textbook picture of a local hidden-variable model. We show that the instinct fails, and exhibit the failure by literal enumeration. In the finite, timeless configuration ontology of the companion papers—where probability is counting, phase is stage-relative, and the population of an outcome class is proved to equal N|α|²—the CHSH quantity assembled from ratios of integer counts reaches the quantum value 2√2 to O(1/N); at N = 4.2×10⁶, counted |S| = 2.8284267. The instinct fails for three separable reasons, each with a counting formulation. Structural exclusion—which configurations exist—is relative to the instantiated measurement bases and fixes only the aligned-basis correlations. Configurations bear outcome records only for the devices their correlation structure contains, so no configuration answers two incompatible settings and, by Fine's theorem, no Bell inequality can be derived. And the skew-angle statistics are carried by the phase structure of the class—the same cross terms that carry two-slit interference. A control run makes the mechanism visible: inserting a sector record, the which-path analog, forces per-class summation, the cross terms never form, and counted |S| falls below the local bound. Marginal counts are computed for each wing from that wing's structure alone, so the counting form of no-signaling holds by construction and is tested exactly, including at small N. On the no-go ledger the ontology keeps locality and free settings; for the plain Bell scenario its operative escape is the absence of counterfactual values, with the denial of absolute outcomes required only in Wigner's-friend extensions. One in-model prediction distinguishes the framework from continuum quantum mechanics: | |S| − 2√2 | = O(1/N), with the residue's scale robust and its sign conditional on the model's integer-apportionment rule, which is flagged as a postulate. This paper is a demonstration and a disentangling, not a new theorem: given the companion results, the violation is guaranteed; what is shown is why a counting ontology is entitled to it.