Recognition Science describes one ledger of recognition events, yet experience arrives from inside separate perspectives. We ask what in the ledger's own dynamics makes a perspective, for one explicit operation: the native recognition step, in which two eight-state clock channels exchange occupation, post a three-component current and move an integer loop flux. Boundaries. For the algebra of native events, every closed invariant subspace of histories is a join of atoms, the atoms are exact superselection sectors with no environment involved, and the atoms an actual history occupies are fixed at its beginning. Neither a symmetric rule nor an element of that algebra selects among them, although a larger read algebra crosses these walls. Participants. Inside a boundary the postings select. Exactly a four-dimensional subspace of the 64-dimensional cell never acquires neutral weight under any record: two persistent loop currents and an occupation oscillation. Three postings expose every other state, and the selected states are exactly those that pass the eight-tick window on the loop edge with certainty. On every network of contacts in its round order the kept states obey a parity law, the kept projection commutes with every round word, so composition creates no kept weight, and participation on a connected network is joint. Other timings act through one token mechanism, which decides births, fair and gated participation, random timing and what a participant's own record reads of its world. Records. A participant's own record decides its status; the conditional present purifies; its long-run motion is a classical chain that is reversible exactly on the participant classes and carries a stationary circulation elsewhere. Every record reads each site only within the same twelve directions, and composites of participants add only crossed products of their members' reads. What is supplied. The book locates every stated premise and identification: the step and its loop-edge routing, the window's account and tick, the genesis state, contact locality, orientation and posting order, the gate and the independence of attempts, the relay's extra terms, least-cost booking of postings, the capture apparatus, the photon dictionary, the present and the experiential reading of a sure subject. On the ledger's torus, locality, symmetry and the existence of a contact place the contacts on nearest-neighbour pairs, and the native posting is the product of eighth-turns of the relay's photon-free terms. It gives the case for the experiential reading and states every open problem exactly. Full manuscript, 402 pages. Preliminary manuscript shared for discussion. It has not been peer reviewed.
Recognition Science describes one ledger of recognition events, yet experience arrives from inside separate perspectives. We ask what in the ledger's own dynamics makes a perspective, for one explicit operation: the native recognition step, in which two eight-state clock channels exchange occupation, post a three-component current and move an integer loop flux. Boundaries. For the algebra of native events, every closed invariant subspace of histories is a join of atoms, the atoms are exact superselection sectors with no environment involved, and the atoms an actual history occupies are fixed at its beginning. Neither a symmetric rule nor an element of that algebra selects among them, although a larger read algebra crosses these walls. Participants. Inside a boundary the postings select. Exactly a four-dimensional subspace of the 64-dimensional cell never acquires neutral weight under any record: two persistent loop currents and an occupation oscillation. Three postings expose every other state, and the selected states are exactly those that pass the eight-tick window on the loop edge with certainty. On every network of contacts in its round order the kept states obey a parity law, the kept projection commutes with every round word, so composition creates no kept weight, and participation on a connected network is joint. Other timings act through one token mechanism, which decides births, fair and gated participation, random timing and what a participant's own record reads of its world. Records. A participant's own record decides its status; the conditional present purifies; its long-run motion is a classical chain that is reversible exactly on the participant classes and carries a stationary circulation elsewhere. Every record reads each site only within the same twelve directions, and composites of participants add only crossed products of their members' reads. What is supplied. The book locates every stated premise and identification: the step and its loop-edge routing, the window's account and tick, the genesis state, contact locality, orientation and posting order, the gate and the independence of attempts, the relay's extra terms, least-cost booking of postings, the capture apparatus, the photon dictionary, the present and the experiential reading of a sure subject. On the ledger's torus, locality, symmetry and the existence of a contact place the contacts on nearest-neighbour pairs, and the native posting is the product of eighth-turns of the relay's photon-free terms. It gives the case for the experiential reading and states every open problem exactly. Full manuscript, 402 pages. Preliminary manuscript shared for discussion. It has not been peer reviewed.
What physical structure makes an acting, remembering system a person, and what makes its later experience belong to the same subject? Recognition Science connects this question to retained comparisons and the relationships an action changes. We derive exact constraints on that connection. A fixed reversible update stores and rereads a finite history; its main-state trajectory through one tape cycle determines the entire encoded initial state. Linearity excludes exact readout of every encoded pure state when the apparatus must also leave it unchanged and uncorrelated with the record. Exact universal duplication of a native signal is incompatible with linear evolution, while reversible transfer is possible. Participant consent survives grouping of subjects precisely when authorship is constant within each group. A unique fixed-total ledger extension retains native account updates and the external bond’s participant effects. At a common native operand product, endpoint pulse-energy changes equal the corresponding scaled cost and signed-harm changes. These results constrain physical history, transfer and authority. Identifying that history with an experiencing subject still requires an occurrence-level experiential identification and a sound and complete law of subject composition. We state those obligations on the same physical objects.
A physical description must preserve distinguishable occurrences, the information needed to compare them, and records available to later interactions. We examine what these requirements force within Recognition Science, keeping the premises of each implication explicit. Finite record constructions give arithmetic with a ledger of logical commitments. A specified comparison apparatus, continuous reporting and reference calibration fix the reciprocal cost, while a positive additive reading and a first costly join force golden scaling. A linking requirement selects three dimensions within the stated spherical spatial class; a complete one-bit cyclic pass through three binary coordinates then has minimum length eight. Factorization, order and calibration determine the corresponding recognition weight. In a finite quantum carrier, preservation of calibrated sharp-decision optima forces exact state recovery, including correlations with a retained reference. We also identify what these mathematical results require of a physical realization: acquisition of the supplier state, complete resource accounting, attachment of controller and record dynamics, turnoff, and record retention. Ethical and economic effects act on the same physical bond ledger. The experiential interpretation requires a further admissibility law and a distinct subject-composition condition. The result is a connected account of forced structure and its physical premises, with explicit boundaries between a uniqueness theorem, a constructed representation and an enacted process.
Version 3 (2026-08). One correction, chair-directed after an independent text-only rebuild: the setting's conventions dictionary is regenerated from the code of record. The pointer packet is an ENERGY-basis Gaussian launched at tick zero (v1/v2 described it as a tick-space packet of tick-width sigma_n; the temporal width is in fact the inverse, NC/(4 pi sigma_n) ticks); the tick-state sign convention, the second geometry's sigma_n = 3, the twin/control definitions, and the post-selection probabilities are now printed; a standing text-only rebuild gate (fresh implementation from the setting paragraph alone, matching the exact conditioned state at 3.5e-14) guards the dictionary. Every published number stands (the independent rebuild reproduced the NC = 24 physics cold, the lane's first exterior verification, recorded in the data-and-code paragraph); the dictionary was broken. The methods law is minted program-wide: a geometry prints its dictionary, generated from the code, never transcribed. Version 2 (2026-08). Changes from v1: the clock-width profile is completed end to end: v1's spike-plus-plateau is the interior of a measured disturbance VALLEY with an optimal clock width (minimum at sigma_n* = 2.5; the broad side rises 93x by sigma_n = 24, tracked by the value law against exact evolution at ratios 0.985 and 0.995), so the least-disturbing clock is neither time-sharp nor energy-sharp; a pre-registered identification of the plateau with the sharp-clock limit was killed by a factor of 160 and is ledgered; the open problems are re-posed at the valley's optimum. When a finite quantum clock gates a register's interactions and the run is conditioned on the clock's final reading, the register's conditioned dynamics is derived at two orders and machine-verified against exact evolution. First order: the drive is the complex Aharonov-Albert-Vaidman weak value of the gating window projector (real part = Hermitian envelope, imaginary part = post-selection reweighting); a twin evolved under this envelope removes the entire first-order mismatch a mean-envelope control retains (state-metric deficits g^1.1 vs g^2.1, factor 56 at g = 0.1). Second order: the deficit is governed by the connected two-time window correlator under post-selection, resolved along the interaction picture; the resulting parameter-free value law matches measured deficits at ratios 0.92-1.05 across the clock-width grid and at a second geometry (1.03-1.07). The when/what trade-off of a participating clock is promoted from confounded excess to derived law: the disturbance is the connected fluctuation of the clock's timing answer, its clock-width profile is a predicted spike-plus-plateau (not a power law), and two earlier exponent claims are superseded with the reconciliation recorded. Two honest derivation failures (equal-time invisibility resurrected by the interaction picture; the kernel belonging inside the integral) are ledgered as the steps that located the law.
Can distinct subjects belong to one experiencing whole? Within Recognition Science’s shared physical architecture, we derive an exact criterion: every finite collection of felt occurrences belongs jointly to a subject if and only if the all-occurrences profile lies in the closure of existing subjects’ profiles. For a nonempty felt domain, closedness yields an existing whole; nested membership preserves distinct participants. The physical derivations establish matter–photon correlation under the complete atomic source, a fixed observable with an absolute correlation margin, and all-time record retention under a specified holding interaction. Signed operators give exact coherent code capture. A complete finite receiving Hamiltonian captures coherent input with error at most C_v/√N for N bank cells and any normalized initial stock, while retaining the native stock clock and every finite passive reference. A normalized product partner evolving under its independent native clock preserves the same bound. With injectively matched contacts covering the bank, the full receiving and contact Hamiltonian also gives a bank-size-independent constant, including coherent inputs and every finite passive reference. These results assume supplied stock and contacts. The remaining connections are physical realization and completeness, recognition’s experiential identity, actual finite subject composition, and realization of the whole-subject limit. These conditions distinguish the positive account from its unfinished universal derivation. AI-use disclosure: OpenAI Codex assisted with source analysis, Lean formalization, manuscript drafting, and independent critique within the author’s Recognition Science research.
Two walls stand at the edge of the two-ring instrument, and this paper is the map of both. Many qubits first. One setting reads two amplitudes and N qubits carry 2^N, and that wall is the only thing between the instrument and many-body quantum mechanics. Part I is the map of the attempt to scale through it, chains of certified rings in lockstep, each qubit a setting with its digit certificate, entanglement between neighbours as the shared-radius coupling of the companion paper, local turn laws carrying the gates, a geometric form of the tensor networks that are classical physics' own escape from the same wall. What carries over is stated exactly and verified. Across every cut of a chain the two sides share one spectrum, so the cut's radius is its certificate. An eight-link chain built by one layer of levers holds at most one bit per cut and is held by a chain of bond two to a fidelity of 1.000, and a random eight-qubit state has rank 16 at the middle cut and is held to 0.162, the wall exhibited. The move past it is the nesting of the companion repair paper, a ring inside every cell, done here as a setting inside every share. A setting whose two shares are themselves settings, applied down to single qubits, holds any pure state of N qubits exactly, 2^N − 1 settings for 2^N amplitudes, the standard's own count, verified on random states at every size to eight qubits and on the same random state the chain held to 0.162, with every setting on the ladder. At a node the entanglement of that qubit with the rest is sin θ √(1 − |⟨ψ₀|ψ₁⟩|²), the Wootters concurrence for a pair, largest at equal shares over mirror branches. A Z turn on qubit k turns the azimuths at depth k and nothing else, and a measurement reads the root's shares and leaves its branch. On ibm_kingston a random three-qubit state was prepared from its seven settings as the machine's own gate angles and its populations read within 0.048 of the tower's shares. The contraction that turns the chain into a reading is classical arithmetic, and the ladder guard of the companion paper stands on it, 112 fixed-point words carrying their base-60 digit pairs, 200 random corruptions of one to six bits, every one caught from the shadow alone and every word recomputed, while the unguarded contraction returned a wrong energy in 155 of the 200. The five problems of the chain program are each settled where they stand: the tower is the canonical form, a gate on any qubit needs no route through its neighbours, the contraction's cost is measured, the classes the tower compresses are counted, and the width a chain needs to follow the dynamics is the entanglement across its cuts, measured. Three levels second. A pure qutrit carries four real parameters and one setting reads two lengths. The populations are read by two levers, one inside the other, the tower of Part I at its smallest: the first splits level 0 from the rest and the second splits the rest between levels 1 and 2, so every split is reachable, a state fully in one level included. Two certificates ride them, the sum to one and the product law, the coherence between two levels at most the product of their two amplitudes and equal to it for a pure state, and on a thousand random qutrits every one-percent misread of the populations is caught by one of the two, 1,000 of 1,000, 992 of them by the sum alone. The threefold turn a qutrit wants is not a single-digit multiplier, and that is a theorem, not bad luck. The Pisano period over the rank of apparition is 1, 2 or 4 (Vinson 1963), confirmed by enumeration to modulus 250. But the sixty-ring carries the threefold turn as a two-term law, F(n + 20) ≡ 5F(n + 1) + F(n) (mod 10) at all sixty positions, and 178 moduli below 250 carry the same law at a third of their period. The two relative phases are read as well, by three two-level settings, one for each pair of levels, whose azimuths obey the addition law exactly, the third certified by the other two, so that three populations and two certified phases rebuild every pure qutrit, verified on a thousand. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.
An observer is a map q: X → Y from states to records, and its boundary is the set of merged pairs: two distinct states with one record. The Observation-Boundary Principle gives four equivalent descriptions of a merged pair: one record, a record-preserving permutation exchanging the two states, zero triangular discrimination under every record-determined reading, and, for a fair label and an initial seed independent of it, zero acquired information under every adaptive protocol of record-determined readings, at every horizon and in the limit. The boundary is thus the zero set of Le Cam's discrimination over the readings the record determines. One binary side symbol separates the pair, and once each fiber has an alphabet of its own of the same size, the coordinates that are bijective from each fiber onto its alphabet form one free orbit under the invisible permutation group of the observer, the symmetry change of a phase transition in Landau's sense. At the boundary the resolution cost has a pole of order one: if each conditional reading has discrimination at most Δ > 0 and costs at least one, acquiring c bits costs at least c ln 2 / Δ in expectation, and independent repetition of a fixed finite-output reading attains the same order for each target 0 < c < 1. The least zero-error side alphabet is the chromatic number of the support-conflict graph. A merged pair carrying a law (κ, ρ) with both weights positive is an entangled pair: no record-determined reading and no protocol of such readings separates its two states, and only a side symbol the record does not carry resolves it. Its entanglement is the product κρ. The observer-conditioned quantity ℰq(p) equals κρ on a merged pair and zero on a separated pair, and it is defined from the observation and conditional probabilities alone, before any Hilbert space or tensor product. Quantum entanglement is its purified case: with a second two-state quantum system as the side symbol, the joint pure state √κ|00⟩ + √ρ|11⟩ is entangled in Werner's sense, its concurrence satisfies C2 = 4κρ and (κ − ρ)2 + C2 = 1, it is separable if and only if κρ = 0, and its largest CHSH score is 2√(1 + 4κρ). An entangled mixed state without CHSH violation marks the limit of the score as a test. The purification of the uniform law on an n-state fiber has entanglement entropy log2 n bits, and each pass of the counted recursion adds one state to the fiber, raising it from log2 n to log2(n + 1). For a finite system in a product state with a finite Gibbs reservoir at inverse temperature β > 0, a joint unitary gives βQ = ΔS + I + D, with I the correlation formed and D the relative entropy of the reservoir from its Gibbs state. The heat bound Q ≥ ΔS/β is attained if and only if the reservoir returns to its Gibbs state and the system entropy is unchanged, so every strict entropy decrease costs Q > ΔS/β, while finite reset sequences approach the Landauer value. A reservoir in state γ resets ρ to a pure state if and only if rank ρ · rank γ is at most the reservoir dimension. The forty-clause principle and its forty-two-clause quantum and thermodynamic form are formalized in Lean 4 with Mathlib.