Every entanglement event in the universe writes into the same vacuum record, and the number of such events is enormous while the record is one object. Three questions follow: how simultaneous writes avoid disturbing one another, how the record stays globally consistent without a shared clock, and how the balance that defines it is maintained while every local fluctuation moves. We show that the parity–entanglement register answers all three structurally rather than dynamically, and we verify each on an exact 4×4 lattice of 16 cells. Non-interference is commutativity: the link generators are X-type Pauli strings, so every pair commutes exactly, joint and sequential evolution agree to 0.00 and reversing the order changes the state by 1.8×10⁻¹⁶ [P/N]. A write is confined to its own link, conserving the link's entanglement with the rest of the lattice and leaving every outside expectation unchanged, so an event at one place moves that place's row of the emergent distance matrix and nothing else [P/N]. Consistency needs no communication: the membrane is a single global check Z₁···Z_N which every write preserves, holding at +1.000 through fifteen consecutive events [P/N]. And the balance is not maintained at all — it is global purity. For any partition of the whole into any number of parts, Σᵢ[½I(Pᵢ;rest) + S(Pᵢ|rest)] = 0 identically, because S(P) = S(rest) for every part of a pure state; the sum is exactly zero for five different partitions before and after twenty-five events, and |S(A) − S(B)| vanishes across all 696 cuts [P/N]. The two terms of the balance are not two quantities meeting at zero but one quantity counted twice with opposite signs, which is why they move together and the sum cannot drift. Breaking it requires discarding information: tracing out one cell makes the global state mixed and the identity fails immediately. Counting the real register, the horizon holds 4.71×10¹²² bits with as many independent write channels, and the Margolus–Levitin bound puts the writes performed since t=0 at 2.6×10¹²¹, so the record is a few per cent full. Statements are labelled [P] proved, [K] known, [N] numerical.
Every entanglement event in the universe writes into the same vacuum record, and the number of such events is enormous while the record is one object. Three questions follow: how simultaneous writes avoid disturbing one another, how the record stays globally consistent without a shared clock, and how the balance that defines it is maintained while every local fluctuation moves. We show that the parity–entanglement register answers all three structurally rather than dynamically, and we verify each on an exact 4×4 lattice of 16 cells. Non-interference is commutativity: the link generators are X-type Pauli strings, so every pair commutes exactly, joint and sequential evolution agree to 0.00 and reversing the order changes the state by 1.8×10⁻¹⁶ [P/N]. A write is confined to its own link, conserving the link's entanglement with the rest of the lattice and leaving every outside expectation unchanged, so an event at one place moves that place's row of the emergent distance matrix and nothing else [P/N]. Consistency needs no communication: the membrane is a single global check Z₁···Z_N which every write preserves, holding at +1.000 through fifteen consecutive events [P/N]. And the balance is not maintained at all — it is global purity. For any partition of the whole into any number of parts, Σᵢ[½I(Pᵢ;rest) + S(Pᵢ|rest)] = 0 identically, because S(P) = S(rest) for every part of a pure state; the sum is exactly zero for five different partitions before and after twenty-five events, and |S(A) − S(B)| vanishes across all 696 cuts [P/N]. The two terms of the balance are not two quantities meeting at zero but one quantity counted twice with opposite signs, which is why they move together and the sum cannot drift. Breaking it requires discarding information: tracing out one cell makes the global state mixed and the identity fails immediately. Counting the real register, the horizon holds 4.71×10¹²² bits with as many independent write channels, and the Margolus–Levitin bound puts the writes performed since t=0 at 2.6×10¹²¹, so the record is a few per cent full. Statements are labelled [P] proved, [K] known, [N] numerical.
The parity–entanglement programme carries a single sector-exchange generator, X_A X_B, whose flow moves the vacuum bias while the membrane Z_A Z_B is conserved. Extending it from one link to a network of N excitations, and from ℤ₂ to an arbitrary abelian group, we obtain four results, all exact. (i) Every link generator X_i X_j commutes with the membrane — which is the single global check Z₁···Z_N, not one check per link — and all link generators commute with one another, so the network flow factorises identically and the state space of the network is a torus (ℤ₂)^(N−1) rather than a many-body problem [P]. (ii) The links are not independent: X_a X_v · X_v X_c = X_a X_c, so a cycle carries no new generator and the independent content of any network is a spanning tree, the same size-independence that fixes the crossing number at two bits [P]. (iii) On the saturated state every link acts as a pure phase, |⟨Ψ|e^(iθX_i X_j)|Ψ⟩| = 1 to twelve figures: at the bound the network is frozen, so the vacuum's strict even bias is not a blemish but the condition for a link to move at all [P/N]. (iv) The sector exchange and the product update are two different channels — the first conserves the membrane and moves the Schmidt spectrum, the second conserves the spectrum and is blind to the membrane — so one writes on the record and the other only carries it, and a link writes on exactly those cuts it crosses [P/N]; a write is moreover exactly internal to its link, conserving S₂ of the link with the rest of the network to 1.2×10⁻¹⁵ and leaving every outside expectation untouched. (v) Two links sharing a vertex are not additive, and the failure has a closed form with no free parameter, ⟨Z_v⟩(θ_A,θ_B) = cos2θ_A cos2θ_B ⟨Z_v⟩ − sin2θ_A sin2θ_B ⟨Z_v X_a X_c⟩, whose cross term is carried by the link closing the triangle — so (ii) and (iv) are one operator identity [P]. Disjoint links are additive to 1.9×10⁻¹⁶ at every N tested, and the closed form is exact to 10⁻¹⁶ for N = 3…6 over θ = 0.02…0.90 [N]. The triangle law is a law of the write channel, and the interaction is measured on ibm_marrakesh through the parity of the law in θ_A: the cross term is odd and the rest even, while any depolarising decay multiplies both, so the ratio of the antisymmetric to the symmetric combination cancels the decay identically. The measurement returns the interaction at 40σ against its absence and constant across six (θ_A,θ_B) points to within 12%, with an overall amplitude 36% high whose source is excluded by a dedicated run: a circuit-depth null and two gate-sign nulls, each exact for ideal circuits, return 0.6σ, 1.0σ and 0.1σ. The construction is carried out for a general ℤ_n: the membrane, the torus factorisation and the closing-link identity AB = X_a X_c† hold for every n, while the two-term closure is a ℤ₂ property, and we identify the reason — it requires the shift operator to be a real symmetric involution. For a non-abelian group the link generators cease to commute (‖[A,B]‖ = 1.0 in the regular representation of S₃) and the factorisation, hence the law, fails; the loop closure survives as a group identity. Statements are labelled [P] proved, [K] known, [N] numerical, [F] formal.
The parity–entanglement programme takes as primitive a stabiliser membrane: one conserved global check and a family of commuting two-local generators that write on it. A companion paper showed that this structure is the attractor of a survival dynamics defined on a population of candidate checks, and left as open the question of a selection dynamics defined intrinsically on the vacuum. We supply one. The reservoir is given three rules and nothing else: it attempts every operator at once, so that attempts which fail to commute cancel and contribute nothing; it is hot and dense and lowers its energy per degree of freedom, which for a horizon record means E/S = k_BT ∝ 1/ξ and so grows the record without bound; and what it retains must remain writable. No parity, no X, no Z, no membrane and no lattice enters the rules. Run blind, the three produce the structure. Cancellation alone does not: it accumulates constraints until the state is unique, reaching k = N in 100% of 1200 runs at N = 4, 6, 8, a frozen point with no record and no motion. Adding the cooling drive stops it exactly at one constraint — k = 1 in 100% of 1500 runs at N = 6, 8, 10 — because the energy per surviving cell, k/(N−k), is minimal there among structures that record anything at all. Requiring the result to remain writable then selects the weight: a constraint of weight N built from a single Pauli letter commutes with every two-local generator of the other two letters, 60/60 at N = 6 and 112/112 at N = 8, which no other weight achieves. What emerges is an [N, N−1] code with a global check and two-local commuting writes, which is the membrane. The remaining structure follows from results already proved: the independent content is a spanning tree of N−1 generators, and among candidate graphs the sparsest connected one wins because the crossing number is capped at two bits while every link costs a refresh — 92.8 for a spanning tree against 43.5 for a square lattice and 11.6 for the complete graph at N = 16. Statements are labelled [P] proved, [K] known, [N] numerical, [O] open.
Quantum mechanics is taught from five postulates: a state is a vector in a complex space; left alone it turns by a unitary step that an energy operator generates; a measurement returns an outcome with a probability equal to a squared length; the state afterwards is the part that matches the outcome; and two systems together live in the product of their spaces. The textbook does not say where the five come from. We read each of them as a statement about one object, the recognition ledger, a record of events that is written in postings and never erased, and we say for each how much of it is then a theorem. The guiding sentence is short: histories that leave no record add, and what is on the record is counted. The record's clock makes a complex unit. The tick of the eight-position register has no complete set of real stationary states, and on the states that four ticks reverse, two ticks square to minus one. For a law on a finite-dimensional space whose factors all lie above zero, the unitary step is fixed up to its unit: a linear rule for the step that uses only the law between two records, keeps every length, regroups and is continuous is exp(−icH) with H = −log T, where T is the law itself. The square follows, for reads of a register's positions, from two principal properties and three mild ones: a read that weighs each position by its own value and adds over positions, is silent on an empty position and is never less for a larger value, and whose total is blind to a common turn of the register, is the sum of squares. For reads along other splittings of a space the square is a hypothesis. Two acts can be read together exactly when they commute, and reading one first moves the other's weights by an amount we give in closed form, never more than one half. Where a crossing takes held states off the held part, a contact divides a held state into a part left exactly as it was and a part with one crossing applied, with squared lengths cos²θ and sin²θ; where it keeps them held, the contact reads one sign of the register and nothing else. Two blocks of one cube compose by the product, their acts commute, and their correlations have three ceilings, 2, 2√2 and 4, for acts that only read, acts that write, and tables that merely do not signal; the cube reaches 2√2 exactly. Each theorem is proved on the page from premises we name, and we say postulate by postulate what that gives. The second follows from four statements about a linear step. The third follows for reads of positions, given that a read is taken position by position, which is owed. For the first, the clock makes a complex unit with no premise, the one such unit that is a whole number of ticks; that states are complex rests on a premise about the clock that is close to the conclusion, that a held register is among the states the unit acts on is a working statement, and from the second postulate on the spaces are taken complex, as in the textbook. Of the fourth the algebra is proved; the weights and the state afterwards are the textbook's, and that one outcome occurs is owed. The fifth is proved for two blocks of one cube and owed for two laboratories, where published network experiments exclude a real product whose sources share nothing. Several of the theorems are known results of the textbook's own mathematics, and the ledger enters through what their objects are identified with. What is owed is named in four statements, and we say how exact each is. The paper closes with twelve paradoxes of quantum mechanics, from the double slit to Wigner's friend, each in three lines: the puzzle, what the record says, and what is owed. Eleven of the twelve wait on the same owed statement, and every number they return is the textbook's own.
Quantum mechanics is taught from five postulates: a state is a vector in a complex space; left alone it turns by a unitary step that an energy operator generates; a measurement returns an outcome with a probability equal to a squared length; the state afterwards is the part that matches the outcome; and two systems together live in the product of their spaces. The textbook does not say where the five come from. We read each of them as a statement about one object, the recognition ledger, a record of events that is written in postings and never erased, and we say for each how much of it is then a theorem. The guiding sentence is short: histories that leave no record add, and what is on the record is counted. The record's clock makes a complex unit. The tick of the eight-position register has no complete set of real stationary states, and on the states that four ticks reverse, two ticks square to minus one. For a law on a finite-dimensional space whose factors all lie above zero, the unitary step is fixed up to its unit: a linear rule for the step that uses only the law between two records, keeps every length, regroups and is continuous is exp(−icH) with H = −log T, where T is the law itself. The square follows, for reads of a register's positions, from two principal properties and three mild ones: a read that weighs each position by its own value and adds over positions, is silent on an empty position and is never less for a larger value, and whose total is blind to a common turn of the register, is the sum of squares. For reads along other splittings of a space the square is a hypothesis. Two acts can be read together exactly when they commute, and reading one first moves the other's weights by an amount we give in closed form, never more than one half. Where a crossing takes held states off the held part, a contact divides a held state into a part left exactly as it was and a part with one crossing applied, with squared lengths cos²θ and sin²θ; where it keeps them held, the contact reads one sign of the register and nothing else. Two blocks of one cube compose by the product, their acts commute, and their correlations have three ceilings, 2, 2√2 and 4, for acts that only read, acts that write, and tables that merely do not signal; the cube reaches 2√2 exactly. Each theorem is proved on the page from premises we name, and we say postulate by postulate what that gives. The second follows from four statements about a linear step. The third follows for reads of positions, given that a read is taken position by position, which is owed. For the first, the clock makes a complex unit with no premise, the one such unit that is a whole number of ticks; that states are complex rests on a premise about the clock that is close to the conclusion, that a held register is among the states the unit acts on is a working statement, and from the second postulate on the spaces are taken complex, as in the textbook. Of the fourth the algebra is proved; the weights and the state afterwards are the textbook's, and that one outcome occurs is owed. The fifth is proved for two blocks of one cube and owed for two laboratories, where published network experiments exclude a real product whose sources share nothing. Several of the theorems are known results of the textbook's own mathematics, and the ledger enters through what their objects are identified with. What is owed is named in four statements, and we say how exact each is. The paper closes with twelve paradoxes of quantum mechanics, from the double slit to Wigner's friend, each in three lines: the puzzle, what the record says, and what is owed. Eleven of the twelve wait on the same owed statement, and every number they return is the textbook's own.
We study physics from the standpoint of a recorder inside the system, with no global context: records and laws are global, completed totalities and samples are local, following a base theory of worlds without global gluing (p-ZFC) [1]. The only primitives are records, their causal order, worlds (causal pasts) and two kinds of extension (adding records above a world; refining it). Four principles are used: records are not disturbed by later recording, individuation carries no information, there is no finest level of resolution, and only ratios are observable. Locality is not assumed; its degree is a measured property of a law.The task is not to derive known physics but to classify: which statements are record facts, which are properties of the law, which are local completions; which features are forced and which are contingent. We show that the principles force the law to be a Cox-type sprinkling on an ordered measure space (conditionally, via Mecke’s characterisation and the Janson/Kallenberg representations), so that sequential-growth laws cannot be fundamental and the law itself does not run under coarse-graining. Relative clock rates are facts of the order exactly when the window ratio of the pair vanishes (in particular for bound pairs); cosmic time is a fact exactly in decelerating expansion; two observers agree on all cosmological frequencies iff their radar-window ratio vanishes, which is the same condition, and absence of event horizons is not enough. Under horizons, which events can be recorded together is governed by Helly and Wegner theorems, and horizon-induced contextuality needs two spatial dimensions; under changes of resolution, rate ratios do not run while content does. A count deficit of small intervals (records versus longest chain) defines content intrinsically; if empty regions do not distinguish directions, the vacuum is an Einstein space with Λ allowed and γ = β = 1, while every static measure-only (conformally flat) attracting law defocuses some fast free process. For quantum phenomena the principles give no-signalling and nothing more; a single contingent principle, that combinatorial relations among possible records are decided by pairs, covers Specker’s condition (hence Tsirelson-type bounds and the theta body) and the absence of third-order interference. Individuals are content families with bounded windows, and the framework yields universal bounds (for example, a static body’s surface clocks run at least 1/3 as fast as distant ones) rather than values. We state plainly what the framework does not do: it makes no new numerical prediction, and this is proved within it (Draft Version: Work in Progress)
The Parity–Entanglement Bound (PEB) program takes the two-bit parity stabilizer—the membrane—as its primitive: prior work derives relational time, an emergent metric, and a geometric field law once the membrane is assumed. Here we ask where the membrane itself comes from, and answer with a selection principle. We define a resource-bounded survival dynamics on random local check structures whose only currency is relational information retained per unit resource under noise, with every rule fixed a priori and no tuned weight. Across independent random histories the dynamics converges, 12/12, to a single structure: a crossing Z-type generator (the membrane) and a crossing X-type logical (the exchange), mutually commuting, of minimal weight—exactly the stabilizer pair {ZᵢZ_N, XᵢX_N} of the [N,N−1,2] parity code, with e_{C|S}=2 and I=2 bits. The membrane is thus not an assumption but an attractor: the most information-efficient survivor of a competition among structures. The convergence is stable under larger populations and longer runs, and identical under depolarizing, dephasing, and amplitude-damping retention—a property of the structure, not of the noise model. The commutativity that lets the exchange move sector weight without annihilating the membrane—"exchange without annihilation" in the vacuum-asymmetry analysis—emerges from selection rather than being imposed. We further map the framework's own viability: on the emergent-geometry side the metric axioms hold only on an interior window of the information axis, Π∈(0,Π_c), with a parameter-free coupling that diverges at both walls—a measured sensitivity diagram for the structure's constants. Statements are labelled [P] proved, [K] known, [N] numerical.