Reality as a Consensus Protocol

Scope of physical interpretation

The fixed-cutoff consensus theorem supplies a finite observer-like self-reading system only on the declared recovery, record, feedback, selected-fiber, and implementation-invariance packet. It does not select the physical twelve-port carrier based on the alternating group \(A_5\) on five letters, attach a canonical rank-three screen band to matter, construct a chiral quantum field theory, or determine a W/Z pole. Those claims require separately typed physical producers. In the companion paper, complete reversible response and endogenous transport force the local Standard Model gauge Lie algebra. The declared matrix-current and rank-15 matter contracts, anomaly balance, and tensor descent give the conditional charge lattice and maximal faithful matter image. Physical source binding of those contracts, laboratory current identification, family attachment, scalar multiplicity and dynamics, and quantum field theory are separate. No OPH-native \(W/Z\) pole follows.

This boundary does not make consensus carrier-neutral. The repair theorem is invariant under hidden presentation changes preserving the complete visible observer contract. Port incidence, orientation, accessible algebra, response, repair law, record process, clock, and refinement lineage belong to that contract and may constrain physical conclusions. On the unified Echosahedral branch, microphysics supplies the candidate carrier, this paper supplies its public normal form, and the spacetime/Einstein and Standard Model gauge papers supply geometry and current projections under their own named premises.

One typed construction and its source assumptions

The finite carrier, accepted repair, support geometry, gravity, abstract compact current, and conditional matter belong to one typed construction. Accepted repair produces the quotient-visible normal form. A1’s complete twelve-port response and A2’s endogenous holonomy force the abstract local Standard Model gauge Lie algebra. A declared matrix current and matter packet provide conditional realizations, while the source producer derives only the inverse-port response. Each composition uses the objects and premises displayed here.

Three meanings of screen

The word “screen” is used for three related objects that must not be identified without a receipt.

1. The local carrier boundary is the twelve-port oriented interface of one Echosahedral carrier on the declared branch. Its incidence has \((V,E,F)=(12,30,20)\).

2. The federation screen is the routed system of interfaces, records, repairs, and checkpoints of many carriers at finite cutoff.

3. The support screen is the observer-facing geometric chart. On the spherical branch it is the refined conformal \(S^2\) used for caps, collars, modular flow, and Lorentz reconstruction.

Local icosahedral incidence does not determine the topology of the federation nerve. A federation of identical local carriers can be routed as a path, a cycle, a higher-genus complex, or a spherical complex. The map from routed carriers to a support-visible spherical nerve is therefore a physical bridge, not a change of notation.

Structure-sensitive, presentation-invariant physics

OPH is not neutral under arbitrary changes of substrate. It is invariant under changes of presentation that preserve the complete observer-visible carrier signature. On the Echosahedral branch that signature contains

\[\mathcal C_{i,r}= \bigl( \mathcal A_{i,r},\rho_{i,r},P_{i,r},I_{i,r}^{\rm or}, \mathcal R_{i,r},\mathcal U_{i,r},\mathsf{Chk}_{i,r}, \mathsf{Resp}_{i,r},c_{sr} \bigr),\]

where \(P_{i,r}\) is the port set, \(I_{i,r}^{\rm or}\) is oriented incidence, \(\mathcal R_{i,r}\) is the record algebra, \(\mathcal U_{i,r}\) is the repair or feedback interface, \(\mathsf{Resp}_{i,r}\) is the visible response law, and \(c_{sr}\) is the refinement lineage. Hidden coordinates, port names, worker partitions, materials, and wiring presentations are silent when an isomorphism preserves this whole tuple and its error model. A change in port number, incidence, orientation, accessible algebra, response, repair law, clock, or refinement lineage need not be silent. A cube and an icosahedron are therefore different carrier contracts even when both are built from the same material.

A carrier body is not automatically an observer. It realizes an observer only when it supplies bounded access, self-readback, durable records, record-conditioned feedback, boundary prediction against controls, and checkpoint continuation. One carrier may pass that test. A connected subfederation may pass it instead. No theorem fixes primitive observer size by counting carrier bodies.

The common finite computation

At cutoff \(r\), source-bound carrier data are routed into an observer-patch federation. Accepted repair then acts on the physical quotient:

\[\begin{aligned} \mathsf{SourceCarrierTower}_r &\xrightarrow{\;\mathsf{realize/route}\;} \mathsf{ObserverFederation}_r\\ &\xrightarrow{\;\pi_r\;} \mathsf{PhysicalQuotient}_r \xrightarrow{\;\operatorname{Rep}_r\;} \mathsf{PublicNormalForm}_r. \end{aligned}\]

The last arrow is the consensus result only under semantic-dependency-complete transactions, coherent union-collar payloads, repair completeness, local diamonds, protected records, and the stated endpoint conditions. A collection of oscillators with equal frequency does not supply those clauses.

Physical phase locking can instantiate one synchronization layer. For a routed edge \(e=((i,a),(j,b))\), a source-produced phase record may certify frequency entrainment and a stable relative phase,

\[\dot\theta_{i,a}-\dot\theta_{j,b}\longrightarrow0, \qquad d_{S^1}(\theta_{i,a}-\theta_{j,b},\delta_e)\le\varepsilon_e.\]

That certificate becomes a consensus parent only when the phase record fixes a commensurability map for the exposed packets and is tied to the accepted repair ledger, semantic records, an independently calibrated clock, and the confluence premises. Phase locking can synchronize an interface. It does not by itself make the interface an observer, settle semantic disagreement, or produce physical time.

Two projections of one source

The public normal form has two separately typed projections:

\[\begin{aligned} \mathsf{AuthenticatedSemanticHistory}_r &\longrightarrow \bigl(\mathsf{FiniteInformationalCauset}_r, \mathsf{CanonicalSourceHeight}_r\bigr),\\ \mathsf{ExactPortResponse}_r &\longrightarrow \bigl(\mathsf{RankThreeCarrier}_r,\, \mathsf{UnitDirections}_r\simeq S^2\simeq\mathsf{FutureNullRays}\bigr),\\ \mathsf{PublicNormalForm}_r &\xrightarrow{\;\mathsf{carrier\text{-}to\text{-}support}\;} \bigl(\mathsf{Support}_{S^2,r},\mathsf{FiniteCapBWCertificate}_r\bigr),\\ \left. \begin{gathered} \mathsf{FiniteCapBWCertificate}_r\\ \mathsf{CompatibleModularStateTower}_r \end{gathered} \right\}_{\text{same tower}} &\longrightarrow \mathsf{BW/KMS}_r \longrightarrow \mathsf{Lorentz/H^3Kinematics}_r . \end{aligned}\] \[\begin{aligned} \mathsf{FiniteStrictPoset}_r &\longrightarrow \mathsf{ExactAuthenticatedCausetLog}_r,\\ \left. \begin{gathered} \mathsf{FiniteInformationalCauset}_r\\ \mathsf{CanonicalSourceHeight}_r\\ \mathsf{RankThreeCarrier}_r \end{gathered} \right\} &\longrightarrow \mathsf{AmbientLorentzCarrier}_{1+3,r},\\ \left. \begin{gathered} \mathsf{FiniteInformationalCauset}_r\\ \mathsf{AmbientLorentzCarrier}_{1+3,r} \end{gathered} \right\} &\longrightarrow \mathsf{AuxiliarySeparatedForwardPlacement}_r,\\ \left. \begin{gathered} \mathsf{AmbientLorentzCarrier}_{1+3,r}\\ \mathsf{SuppliedSpatialReadback+EdgeSpeed}_r \end{gathered} \right\} &\longrightarrow \mathsf{ForwardConePlacement}_r,\\ \mathsf{ForwardConePlacement}_r &\xrightarrow{\;\substack{\mathsf{equal\mbox{-}height\ separation,}\\ \mathsf{incomparable\ spacelike}}\;} \mathsf{FaithfulFiniteCausalPlacement}_r,\\ \mathsf{FaithfulFiniteCausalPlacement}_r &\xrightarrow{\;\substack{\mathsf{physical\ signals+operational\ clocks,}\\ \mathsf{source\ refinement+count\text{-}volume,}\\ \mathsf{dimension+manifoldlikeness,}\\ \mathsf{topology+uniqueness}}\;} \mathsf{EffectiveSpacetime}_{3+1},\\[2pt] \left. \begin{gathered} \mathsf{NineSourceDirectionBalances}_r\\ \mathsf{SymmetricFields+Ward/Bianchi}_r\\ \mathsf{AlgebraicCoupling+Steps+Connectedness}_r \end{gathered} \right\} &\longrightarrow \mathsf{FiniteEinsteinForm}_r,\\[2pt] \left. \begin{gathered} \mathsf{EffectiveSpacetime}_{3+1}\\ \mathsf{FiniteEinsteinForm}_r\\ \mathsf{curvature+physical\ stress}\\ \mathsf{vacuum+8\pi G\ scale}\\ \mathsf{small\ ball+smooth\ convergence\ control} \end{gathered} \right\} &\xrightarrow{\;\mathsf{physical\ promotion}\;} \mathsf{SmoothPhysicalEinstein}_{3+1} . \end{aligned}\] \[\begin{aligned} \left. \begin{gathered} \mathsf{CompleteResponse}_{12}\\ \mathsf{EndogenousHolonomy}_{A_5} \end{gathered} \right\} &\longrightarrow \mathfrak u(1)\oplus\mathfrak{su}(2)\oplus\mathfrak{su}(3)\\ &\xrightarrow{\;\text{conditional matrix and matter packet}\;} \mathsf{MaximalFaithfulMatterImage}\\ &\dashrightarrow \mathsf{PhysicalGauge/QFT}. \end{aligned}\] The dashed arrow denotes source and laboratory maps not constructed here.

The finite carrier-to-support leg is constructed from one oriented icosahedral incidence nerve: twelve carrier charts, thirty seam algebras, and twenty nonvacuous triple restrictions. The same bound artifact supplies confluent seam repairs, an operational observer receipt, and a refinement-natural oriented \(S^2\) support limit. The separate geometric \(2\pi\)-KMS comparison and \(\mathsf{FiniteCapBWCertificate}\) are not outputs of that finite bridge. The state tower, common-comparison maps, compatible state/vector data, modular controls, and cofinal modulus form an independent compatible modular-state tower. The BW theorem consumes both inputs on the same refinement tower. Independently, authenticated read-from provenance supplies the finite event carrier and generated order. Every finite strict partial order also compiles exactly into an abstract authenticated log; the supplied relation and unthreaded snapshots make this grammar expressivity, not OPH dynamics or physical selection. Its canonical source height is zero at roots and one plus the maximum direct-parent height otherwise, equals the attained longest authenticated-parent-chain length, and strictly increases on generated ancestry. The exact source Gram quotient supplies a positive rank-three carrier. Its direct sum with an independent real axis, \[W_{\rm src}=\mathbb R\oplus V_{\rm src},\qquad Q(t,x)=t^2-g_{\rm src}(x,x),\] is a four-dimensional ambient target carrier with Lorentz inertia \((1,3)\), and source-unit directions are exactly its future-null rays. Canonical source height enters only through a scaled event placement. This finite construction removes the free event order, supplied placement rank, rank-four chart, and fitted signature. Once the support leg produces a conformal \(S^2\), the independent classical identity \(\operatorname{Conf}^+(S^2)\cong\operatorname{SO}^+(3,1)\) gives the same celestial Lorentz cone and the three-dimensional observer-frame fiber \(H^3=\operatorname{SO}^+(3,1)/\operatorname{SO}(3)\).

Every finite event log admits an auxiliary injective one-way realization: enumerate its events along one source axis and take a height scale larger than the enumeration diameter. Distinct same-height events are then spacelike. The enumeration is arbitrary and generally creates unsupported cone comparisons, so it supplies neither source selection nor faithful physical coordinates. A supplied event-local spatial readback and edge speed bound send generated precedence into the future cone. Equal-height spatial separation and a strict spacelike inequality for every increasing-height pair unsupported by ancestry derive converse cone support and exact two-way order–cone equivalence. Event separation follows from antisymmetry, and the two-way equivalence gives exact interval preservation. The exact-embedding route requires one source-selected refinement family preserving order, placement, and source directions, with dense and isotropic physical links on \(S^2\), calibrated \(\#I/\rho\to\operatorname{Vol}(I)\), independent dimension and manifoldlikeness tests, stable thickened-antichain topology, and convergence to a unique distinguishing Lorentzian limit. Event count is not public capacity \(N\).

A controlled effective route uses vanishing causal discrepancy and compatible count-volume convergence. Conservative Fibonacci-record populations with a specified complete-neighbour read law have such a flat \(1+3\) limit when their fill error is small relative to the shrinking read radius. Equal-mass assignments with vanishing displacement error give normalized event counts converging to volume. On fixed interior timelike diamonds, fourth roots of interval-count ratios recover proper-time ratios, with a reference interval fixing the unit and complete ancestry access supplying the readout. Within the class of nonzero closed convex pointed displacement cones, operational invariance under source rotations and every boost along one axis forces the Lorentz cone up to time orientation. The covariance is an assumption about actual influences and readouts. Physical selection of the population, read law and common matter realization is separate from these conditional results.

On the same finite event type, the source-order Einstein theorem replaces all-null balance by nine supplied balances on fixed algebraic source-direction representatives and, with symmetric fields, an algebraic coupling, four step maps, Ward/Bianchi identities, and connectedness, derives the all-null and Einstein-form tensor relations. The directions are algebraic rather than observed signals; the informational order does not select a field, step, or balance. The matrix fields and steps remain supplied. Reading them as smooth curvature and physical stress requires a same-family tensor-curvature reconstruction converging to the smooth Einstein tensor, or the separately stated continuum small-ball/null-balance identification, together with same-source stress, Ward/Bianchi, coupling, scale, and remainder data on the physical continuum family. Scalar-curvature convergence is only a diagnostic. The separate composedEinsteinBranch returns the conditional Einstein-form composition under those typed inputs; it does not supply them. Any admitted continuum spacetime is an emergent effective description, not a fundamental object inserted into the finite carrier.

The second projection begins with an exact finite result on the certified Echosahedral lineage. The twelve-port module decomposes as

\[P_{12}\cong_{A_5}\mathbf1\oplus\mathbf3\oplus\mathbf3'\oplus\mathbf5.\]

The declared integer counting and normalized central-readback cost realization gives the twelve unit lines and exact gap. An append-only signed-event machine generates those integer loads. Conservative whole-unit seam repairs preserve total load and strictly decrease \(V(N)=\sum_iN_i^2\); minimum move count is natural under every carrier rotation and the declared refinements. Divisibility of total load by twelve is necessary for consensus, while an explicit eighteen-move path settles the declared full-pile packet. A half-unit display rescales event values and the repair threshold together, so it is a units convention on the same move graph. Oriented incidence independently gives the antipodal pairing, proper \(A_5\) action, and rank-three Gram frame, and determines the antipode \(J\). Complete reversible response and endogenous overlap transport force the abstract local Standard Model gauge Lie algebra. Under the explicit inverse-port contract, the signed central involutive responses are exactly \(\pm J\), with common sign conventional. Conditional also on the matrix current and rank-15 matter contract with its unique charge-conjugate projector pair, anomaly and tensor-descent certificates give the hypercharge lattice, common \(\mathbb Z_6\) kernel, and maximal faithful matter image. The scalar scan fixes compatible charges and Yukawa channels, not scalar multiplicity. The target-blind producer derives the inverse-port response, without selecting the matrix current. Separate band premises select the rank-three response. Tensoring it with the declared generation table gives a conditional rank-\(45\) candidate whose chirality and diagonal \(\mathbb Z_6\) action come from that table. A distinct local-domain receipt checks the declared tensor-identity operator and conditional gap inheritance without source-selecting the matter action or transporting the twelve-port Spin packet. Laboratory identification of the finite matter carriers, current, and line sectors, exclusion of extra light sectors, physical matter-pole and continuum family identification, scalar attachment and dynamics, and quantum-field construction require separate maps.

The compact sector-category/Tannaka route conditionally reconstructs a compact group by a logically independent route. Physical family identification and extra-sector exclusion require separate identifications; they do not enter the contract-conditional finite gauge implication. Physical family identification requires an additional map on the charged-lepton and quantitative selector/gap branches. Physical unification requires a source-bound commuting square identifying its reconstructed compact group with the group acting through the Echosahedral current response:

\[\begin{array}{ccc} \mathsf{A5PortResponse}_r & \longrightarrow & G_r^{\rm screen}\\ \downarrow & & \downarrow\scriptstyle{\simeq}\\ \mathsf{TransportableSectorCategory}_r & \longrightarrow & G_r^{\rm DR}. \end{array}\]

On those premises the abstract Lie-type agreement is exact. The construction supplies neither the physical vertical maps nor an identification of the two group actions. In the same way, the rank-three response band and declared generation table form a conditional complex rank-\(45\) candidate, while three physical generations require matter-pole, continuum, seam-selection, persistence, and complement-complete refinement receipts. The rank-three result depends on the complete-band and cost-order premises; it is not a consequence of the icosahedral graph alone.

Finite controls and scope

The finite \(A_5\) evaluator control has \(60\) reachable correctable public records on \(\mathcal H_k=\ell^2(A_5)\otimes\mathbb C^k\):

\[M_0=60,\qquad D_{\rm raw}=60k,\qquad \Delta_{\rm raw}=60(k-1).\]

Raw equality occurs only at \(k=1\). Publicly inert multiplicity makes \(D_{\rm raw}\) implementation-dependent, so the result is an evaluator control rather than physical capacity closure.

The unified claim has a precise scope. Consensus and geometry/gravity are composable branches of one source-bound self-reading carrier tower. The finite gauge branch uses the same carrier architecture, and A1–A2 force its abstract local Standard Model gauge Lie algebra. The matrix current and matter action are conditional realizations and are not joined to that tower by a common source construction. Local icosahedral incidence by itself constrains only the carrier module. The physical maps that turn these constraints into one inhabited universe are additional assumptions. Matching dimensions or symmetry labels does not supply them.

What This Paper Contributes

The mathematics of repair is old in the right places. Constraint satisfaction, rewriting systems, well-founded descent, local-diamond confluence, inverse limits, and recovery channels all enter this paper with their standard meanings. OPH adds the physical reading: each variable is an observer patch, each constraint is an overlap-visible record check, and each accepted rewrite is a local repair move that must descend to the quotient seen by neighboring observers.

That turns consensus into the implementation layer of the theory. The paper distinguishes accepted-step termination from scheduler attempts that may stutter, proves that every canonical adaptive attempt stream is eventually constant, isolates pathwise weak fairness as sufficient for normality, proves that no single mismatch-only finite attempt horizon uniformly bounds all normalizing schedulers, gives a \((q+1)\)-scaled upper horizon under bounded waste with exact sharpness in the work-conserving case, and identifies completeness and confluence as the remaining hypotheses for one canonical public endpoint. It derives event precedence from versioned mismatch provenance: certified read-from parenthood generates the strict informational order, any exact precedence adapter reduces to a verifier of that order, and a writer-blind static mismatch score determines no causal arrow. It also proves how boundary data control uniqueness and how cycle holonomy records the exact obstruction to global agreement. Its finite results support the framework’s mathematical core. The paper also explains why a bare overlap graph is only a finite constraint code. Stronger language such as quantum error correction, min-cut distance, BFT liveness, or hardware speedup needs its own certificate.

Synchronization and consensus are distinct. A physical phase-lock process may establish a stable relative phase and a commensurability map between two exposed ports. It enters this theorem only after its phase records are tied to the accepted transaction ledger, an independent clock, the semantic record surface, and the confluence premises. Frequency entrainment alone can coexist with conflicting records.

Introduction

This paper writes the OPH consensus picture in the simplest concrete form. A universe is represented as a finite graph of observer patches. Each patch carries local state data, neighboring patches compare those data on overlaps, and local repair moves try to reconcile any mismatch. The central mathematical question is whether this repair dynamics converges to one shared world and how the unavoidable obstructions are encoded when it does not.

The word “dynamics” is used here in the rewriting-system sense. The repair schedule selects terminal normal forms and proves schedule independence under the stated hypotheses. The selected observer-facing structure can carry an internal record order, which is read as history. A conventional simulation computes a surrogate history. OPH computes the fixed point and its quotient-visible records. A physical-clock interpretation additionally requires an observer-readable transition process, event correspondence, and affine clock calibration. The patch-net algorithm is a theorem device for fixed-point selection. The fundamental description contains no global timeline on which spacetime contents are rendered.

A bare fixed point is not called an OPH simulation below. Definition 76 requires recovery-derived endogenous update, nontrivial quotient-readable records, overlap repair with schedule-independent normal form, elimination of a proper candidate basin in the selected boundary/sector fiber, and implementation-projection identities separating quotient-record order from any physical clock. Theorem 77 proves those clauses on the named finite branch and supplies a generic fixed-point and variational counterexample.

The resulting theorem package has two layers, bounded by the constraint-code firewall stated once in the summary list below. The first core consensus layer concerns convergence: primitive recovery proposals are eligible only when they satisfy the touched-overlap local-fit contract, but a proposal becomes physical only through transactional acceptance with snapshot validation, protected-boundary preservation, and exact well-founded descent. This accepted finite relation induces a total, idempotent, boundary-preserving quotient normal-form map \[\operatorname{Rep}_\lambda:Q\to Q.\] Connected conflict components commit atomically through coherent canonical union-collar payloads. Semantic-dependency-complete read sets, conflict components, snapshot-determined payloads, and revalidation prove the local diamond on the physical quotient. A schedule-independent normal form follows when these premises and repair completeness hold. The concrete receipt checks those premises and the resulting finite peaks. The stronger claim that all interiors with the same boundary data settle to the same state requires preservation of that boundary data plus a unique consistent extension in the corresponding fiber; the layered functional carrier proves a finite multi-edge witness for this condition, and the functional selected-fiber branch gives the rooted obstruction-check form. The second concerns obstructions: pairwise overlap agreement does not ensure a global solution, and the obstruction is holonomic. On the abelian branch it is the cycle sum of edge data; on the genuinely noncentral branch it is a crossed-module Čech class.

Gauge symmetry enters as invariance under changes of hidden local representation that preserve overlap data. When the repair step is read only on that overlap-invariant quotient, the normal-form map descends to the gauge quotient, so physical uniqueness is a quotient statement. On the quantum lift, the same quotient-local carrier determines a unique terminal state on every declared physical observable algebra, even when microscopic representative lifts differ by gauge or sector relabelings inside one quotient-local glued state. The observation layer is carried by finite observer-accessible record algebras generated by central or quantitatively stable approximately commuting projectors. These results form the patch-net formulation used in the broader OPH literature, including the fixed-cutoff Bell/CHSH package on the companion microphysics surface.

This paper proves a constraint-code firewall and nine core consensus results:

1. Constraint-code firewall. A finite overlap net defines a finite constraint code: its codewords are exactly the globally consistent states, and \(C=\Phi^{-1}(0)\) (Proposition 3). This is the default meaning of “the overlap network is a code.” It is not, by itself, a quantum error-correcting code and does not imply a graph min-cut formula for distance (Theorem 118). The same firewall blocks semantic upgrade by relabeling: a finite constraint, archive, repair spectrum, or reconstruction threshold is a finite diagnostic; only a source-separated physical bridge supplying the relevant readout, residual ledger, controls, and frozen validation target changes that type.

2. Asynchronous confluence. For the declared accepted repair law, primitive recovery proposals pass through transactional snapshot/read/write validation, semantic-dependency-complete boundary, sector, history, and checkpoint preservation, and exact descent. The accepted relation induces a total local quotient repair map \(\operatorname{locRep}_\lambda:Q\to Q\) and a total idempotent global repair map \(\operatorname{Rep}_\lambda=\overline{\operatorname{nf}}_\lambda:Q\to Q\). A coherent canonical aggregate per conflict component and semantic-complete revalidation prove the quotient local diamond. The implementation receipt checks these premises and the concrete finite peaks. With repair completeness, every fixed initial quotient state has a unique normal form, independent of update schedule (Proposition 13, Proposition 29, and Theorems 15 and 31).

3. Cycle obstruction. For affine overlap constraints over an abelian group, global consistency holds if and only if the holonomy vanishes on every cycle (Theorem 38). The parity triangle gives the minimal frustrated example, and Theorem 41 extends the same logic to the crossed-module higher-gauge defect hierarchy used later in the framework.

4. Gauge quotient, selected fibers, and observable-level confluence. When local repair is induced on the overlap-invariant quotient, the normal-form map descends to that quotient, \(\operatorname{Rep}_\lambda\circ q\) is invariant under gauge/implementation hiding, and the induced terminal state on every declared physical observable algebra is unique there even when microscopic representatives differ by gauge or sector relabelings inside one quotient-local glued state. If a boundary/sector map is preserved and each consistent boundary fiber has at most one quotient extension, then all initial states with that boundary value settle to the same quotient normal form; the layered functional carrier proves \(H_B\wedge H_{\mathrm{fib}}\) on a finite multi-edge, multi-step carrier, while the functional selected-fiber branch proves a nontrivial rooted case where multiple same-boundary interiors exist, inconsistent candidates are eliminated, and surviving candidates share one quotient normal form (Theorems 43, 45, 48, 50, Corollaries 44, 49, 52, and Theorem 57).

5. Refinement-limit consensus classes. On a separated cofinal refinement system whose restriction maps commute with the finite-stage normal-form and holonomy maps, the quotient normal forms and holonomy obstructions assemble into unique inverse-limit classes with finite-stage visibility (Theorem 64).

6. Coarse-graining compatibility. On any refinement system whose coarse-graining maps shadow finite-stage normal forms and holonomy maps with declared errors, reconciling first and then coarse-graining gives the same macroscopic law data as coarse-graining first and then reconciling, up to those errors; in the exact natural case the error is zero (Theorem 71).

7. Record algebra and stability. On the fixed-cutoff observer-accessible surface, a supplied density-state valuation and a declared Lüders instrument give Born/Lüders formulas on the central record projectors; the projectors alone do not select the instrument. Approximate record projectors inherit explicit \((\varepsilon,\delta_{\mathrm{rec}})\) stability bounds on the same event surface (Theorem 74).

8. OPH simulation firewall. On a selected boundary/sector fiber, “simulation” requires recovery-derived endogenous update, nontrivial quotient-readable records, strict overlap-repair descent with a schedule-independent normal form, collapse of a proper candidate basin to one consistent quotient state, and implementation-projection identities separating quotient-record order from any physical clock. Under the stated selected-fiber and record hypotheses, the finite OPH packet has this certificate; a generic identity fixed point or constant variational functional does not (Definition 76, Theorem 77, and Remark 78).

9. Distributed one-universe realization. A worker implementation is a presentation of one finite OPH universe only when the run starts from one global carrier and every distributed event projects to a legal monolithic repair path, a physical stutter, or a certified rollback to an earlier committed projection. Under those hypotheses, partition, worker count, schedule, restart history, and repartition metadata do not change quotient observables or observer readouts that factor through the monolithic normal form (Theorem 84 and Corollary 85).

10. Conditional noisy fair-block consensus. If a noisy asynchronous implementation admits fair repair blocks, a uniform expected contraction toward the exact quotient normal-form set, and controlled within-block excursions, then all long runs stay in a controlled expected tube around that exact normal-form set. In singleton boundary/sector fibers, Lipschitz observer readouts are approximately schedule-independent, and a finite Markov-kernel certificate checks the block contraction on finite exported nets (Theorem 90, Corollaries 91–92, and Proposition 93).

The repair step itself is a concrete recovery move, not a free rewrite primitive. On the fixed-cutoff collar branch, a local update is obtained from exact Markov splice or from a declared Petz/Fawzi–Renner recovery channel and then read on overlap-invariant physical data. The fixed-point theorem below isolates the separate branch conditions cleanly: the declared repair law includes the touched-overlap local-fit contract for primitive proposals, while transactional acceptance validates snapshots, protected data, unchanged registers, and exact descent. The fixed-cutoff gluing package carries a parenthesization-independent union-collar payload only on a branch with an exact aligned Markov construction, a coherent canonical recovery construction, or a primitive aggregate-payload receipt. Repair completeness, the quotient-level local diamond, and, on the Petz branch, the support/CPTP clause are separate conditions stated in Proposition 113. A nontrivial exported rooted-tree packet domain where these clauses are proved is recorded in Definition 19 and Theorem 20; the separate layered functional carrier records the finite multi-edge boundary-reconstruction witness.

We also define a fitness functional over a finite candidate space of reconciliation laws and prove that replicator dynamics monotonically increases mean fitness (Theorem 97). This gives a clean mathematical model for finite-candidate law selection, not a universality theorem or a literal cosmological dynamics claim.

The results here are exact theorems about a computational model. The companion OPH manuscript uses separate support levels for structural theorems, scaling limits, quantitative particle outputs, and phenomenological continuations [source].

Patch Nets, Overlaps, and Global Consistency

For exposition we use a finite pairwise-overlap graph. The hypergraph version is straightforward: replace edges by hyperedges and pairwise equality by a common interface label on each hyperedge. Nothing in the proofs depends on the pairwise restriction.

The picture: each observer holds a local state, and neighboring observers share an interface through which they can compare notes. A universe-state is physically admissible exactly when all neighbors agree on their shared data. This is a constraint satisfaction problem (CSP), and the consistent states are the codewords.

The theorem excludes definability of the Einstein equation from free decorations of \(\mathsf{Cons}_r\): the two extensions attach geometry with no arrow from the quotient. The machine-checked form (bare_consensus_not_einstein_complete in ) covers the integer scalar Einstein identity on a constant demonstration tower; the metric, stress, coupling, area-operator, entropy, and modular-flow clauses rest on the prose model extension above. Extensions whose geometry is a computable function of the quotient normal forms, such as the support-visible incidence complex of the geometry-producer packet, are the object of the producer and composition theorems and are outside this exclusion.

\[\boxed{ \mathsf{Cons}_r\Rightarrow\text{quotient normal forms and computable functions of them.} }\] The gravity theorem used elsewhere in OPH has a separate typed dependency spine: \[\boxed{ \begin{gathered} \mathsf{RecoveredCore}_{5\mathrm{ax}}+\mathsf{GeomRead} +\mathrm{BW}^{\mathrm{sv}}_{S^2} +\mathsf{NullStress}\\ +\mathsf{BoundedInterval} +\mathsf{FixedCapStat} +\mathsf{SmallBallArea}\\ +\mathsf{RemainderControl} +\mathsf{TimelikeCoverage}\\ +\mathsf{CommonSource} +\mathsf{PhysicalIDs}\\ +\mathsf{TensorUpgrade} \Rightarrow \mathsf{Einstein}. \end{gathered} }\] The implication requires one source-derived common-domain tower, certified asymptotic tails, universal coupling, a source-derived vacuum reference, and independent physical scale readouts. Such a tower enters as a premise; this paper does not construct it. That branch is carried by the spacetime/Einstein and microphysics papers, not by the bare constraint-code theorem above.

So \(\Phi\) is the total disagreement energy of the universe. Consistent states have zero energy. Everything else is frustrated.

Asynchronous Reconciliation and the Main Fixed-Point Theorem

The quotient repair operator

The transactional layer above defines the physically accepted one-step relation. The object used as law is the induced finite normal-form map on the physical quotient, not a hidden-representative rewrite.

The theorem package separates the imported repair-law data from the theorem-local inputs cleanly:

Normal forms are exactly the globally consistent states. The dynamics is neither too weak (missing some inconsistencies) nor too strong (repairing things that were fine).

The premise in (ii) is a bounded stutter allowance. It is stronger than eventual fairness and weaker than work conservation when \(q>0\). The cumulative unit is only a count of chosen-site attempts; it is not a physical clock, rate, energy, bandwidth allocation, hardware quota, or fee.

Finite premise receipt.

The executable check enumerates all states and one-step peaks of a finite conflict-component reference engine and recomputes separate countermodels for semantic closure, atomic component commits, canonical aggregate coherence, aggregate-support reclosure, surviving prepared components, snapshot-determined payloads, strict descent, repair completeness, and protected-record preservation. It verifies a concrete realization of the proposition’s premises; it does not infer those premises for an arbitrary engine.

Here objectivity is identified with schedule-independent convergence on the physical quotient; Theorem 57 lifts this to the physical observable algebra while explicitly allowing distinct microscopic terminal representatives.

Finite support propagation and algebraic no-signalling

The concrete single-site record repair has a finite support theorem that is independent of termination and confluence. For a patch \(i\), let \(\mathcal N[i]\) be \(i\) together with every endpoint of an edge incident to \(i\), and define \[\operatorname{Grow}(S)=S\cup\bigcup_{i\in S}\mathcal N[i], \qquad B_0(S)=S, \qquad B_{n+1}(S)=\operatorname{Grow}(B_n(S)).\]

This fixed-word bound has an exact conditional adaptive extension. If the next-site scheduler is supplied together with a region \(R\) on which its choice depends, then agreement on \(B_n(S\cup R)\) forces the two \(n\)-step runs to agree on \(S\cup R\); equivalently, a change outside both \(B_n(S)\) and \(B_n(R)\) cannot alter the probe readout. Fixed words embed as record-blind schedulers, while a two-cell countermodel proves that the consultation-region term cannot be dropped. Naturality also follows under the laws of a separately declared refinement structure. These results do not produce the scheduler, consultation region, channel, or refinement maps from the source. Neither theorem supplies a converse, minimal cone, physical graph metric, propagation speed, or claim that influence reaches the cone boundary.

These marginal identities are standard finite algebra. Their bipartite split and local lift are supplied inputs. Positivity and unit mass are additional premises when the classical arrays are read as probabilities. No physical spacelike separation, observer-region factorization, density-state realization, or laboratory operation follows. A local observable-net construction must attach disjoint observer regions to the declared factors.

The quotient normal-form theorems of this section state that the public world is the quotient normal form that survives agreement on overlaps. Two failure shapes would break the claim: an OPH-admissible overlap presentation on which no quotient normal form exists under the declared descent, local-diamond, and repair-completeness conditions, or two inequivalent quotient normal forms surviving from the same declared boundary data where the fiber-uniqueness hypothesis of Theorem 45 holds. Either exhibit defeats the claim on its declared branch.

Why Local Agreement Is Not Enough: Cycle Holonomy and Frustration

Pairwise neighbor agreement does not by itself imply global consistency.

This example shows that pairwise consistency does not imply a global solution. The obstruction is carried by the cycle.

Residual inconsistencies of this type cannot be removed by local repair moves. In the OPH interpretation they are stable topological defects of the reconciliation dynamics.

Gauge Symmetry as Implementation Hiding

Gauge transformations change hidden local representations while leaving overlap data fixed. Write \[q:\Sigma\to \Sigma/\Gamma, \qquad q(s)=[s],\] for the gauge-orbit map. A physical repair law is the family of quotient-local maps \[\overline T_i^\lambda:\Sigma/\Gamma\to \Sigma/\Gamma\] induced by the recovery-derived collar updates of Definition 7. A representative repair family is any choice of lifts \[T_i^\lambda:\Sigma\to\Sigma\] such that \[q\circ T_i^\lambda = \overline T_i^\lambda\circ q.\] This is the finite patch-net form of saying that the repair step is defined first on overlap-invariant physical data and only then lifted to hidden representatives. The rooted-tree packet domain of Theorem 20 proves repair completeness and quotient descent on a nontrivial exported packet net, while Proposition 22 proves the classical full-support Petz clause used by that domain. A broader fixed-cutoff branch requires repair completeness for the chosen exported packet net and the support/CPTP clause on the Petz branch where that channel is used. The touched-overlap local-fit contract gives scalar \(\Phi\)-descent for primitive proposals on the corresponding branch, while the transaction layer supplies exact accepted-step descent. Proposition 106 together with Definition 9 supplies the quotient-local compatibility package used to build canonical aggregate payloads. Proposition 29 derives the local diamond from semantic-dependency-complete read sets, canonical conflict components, snapshot-determined payloads, and revalidation. The implementation receipt checks those premises and the concrete finite peaks. Stability under refinement or branch change is a separate question. The point here is also that no extra gauge-covariance axiom is needed once repair is formulated on the quotient.

A multi-edge finite carrier for boundary reconstruction

Finite binary audit fixture: a sharp reconstruction carrier

The layered carrier above proves boundary reconstruction for a feed-forward finite class. A useful stress test for the same logic is a two-neighbor linear binary update on a finite cylinder. A row is a function \[x_t:\mathbb Z_n\to\mathbb F_2,\] and the update rule is \[x_{t+1}(j)=x_t(j-1)+x_t(j+1)\pmod 2.\] This update is not a proposed microscopic physics law. It is a minimal finite-consensus fixture: the local rule is linear, all records are exact finite objects, and boundary reconstruction can be tested without continuum or geometric assumptions.

For the time slab \(0,\ldots,t\), a two-column timelike tube \[\{j_0,j_0+g\}\times\{0,\ldots,t\}\] is an information set when its values determine the whole finite spacetime record. The sharp two-column classification: \[\text{tube}(g)\text{ is an information set} \quad\Longleftrightarrow\quad \gcd(g,n)=1\ \text{ and }\ n\le 2(t+1).\] Thus adjacent columns (\(g=1\)) achieve the full capacity threshold, while a non-coprime stride loses information at every horizon. The same fixture also separates realizable from unrealizable boundary readings: if a tube reading is not carried by any consistent record, no boundary-preserving repair operator can make it consistent without changing the boundary.

The audit then assembles a Route-A repair on this same carrier. The positive operator is a local transactional decoder: each transaction writes one non-tube cell using a bounded edge-local window, the declared rank schedule terminates in one finite pass, and the tube reading is preserved at every accepted step. At the sharp threshold \(n\le2(t+1)\), any two records with the same tube reading settle to the same normal form; the settled world is consistent exactly when the tube fiber is realizable.

The same formal fixture supplies the important negative controls. On this binary cylinder there is no single-patch frustration-free local repair satisfying the strongest \(H_1\wedge H_2\wedge H_3\) binder form. The canonical single-patch repair can also stall on the smallest audit witness \((n,t)=(3,2)\), leaving a broken edge in normal form. This is not a failure of the positive decoder; the stalled record has an unrealizable tube fiber. The lesson for OPH is structural: boundary reconstruction is theorem-grade only after the preserved boundary, realizable-fiber condition, and declared repair roster are specified. A bare local-update slogan is too weak.

The layered functional carrier of Theorem 48 is the finite multi-edge, multi-step witness that the boundary-fiber hypothesis is non-vacuous beyond one-dimensional propagation intuition.

Physical uniqueness therefore holds on the quotient by gauge or implementation hiding. The same statement is unchanged under inert ancillary stabilization.

Refinement-Limit Consensus Classes

The finite consensus theorem is the operational object used by the continuum branches. To pass from one finite patch net to a refining family, the paper uses an explicit inverse-limit package with named compatibility clauses.

Record Algebras and the Operator Observation Layer

Inputs used here.

From the fixed-cutoff collar package we use only the observer-accessible finite-dimensional algebra on one completed compare/write/verify slice, the declared pointer and overlap-sector projectors read on that same slice, and the trace-distance control on restored accessible states when restoration is invoked. No continuum lift and no broader observer-metaphysical assumption is used here.

Fixed-cutoff observation boundary.

The theorem supplies a fixed-cutoff operator-algebraic observation surface: a central record algebra on the exact readout slice, a supplied Born valuation and declared Lüders instrument on its event projectors, exact repeated-read stability under the untouched-support hypothesis, and explicit \((\varepsilon,\delta_{\mathrm{rec}})\) control when practical readout projectors are only close to that central surface. It does not show that richer branches keep physically relevant pointer surfaces close to one such central record algebra or that the same control survives refinement and continuation.

Operational observers, event worlds, and coexisting regional algebras

The record-algebra layer extends upward, in the accompanying Lean development [source], to a machine-checked interface family in which the observer itself is a typed object. The base object is a consensus tower: a regulator-indexed family of finite matrix models carrying observer and record fibres, observer-indexed record orders, commutative public record subalgebras of the private matrix algebra, selected states and generators, and functorial refinement maps with compatibility laws. Seven Lean modules carry the layer:

The operational observerhood receipt.

An operational observer over a consensus tower carries six complete clause groups and the own-observer half of a seventh, each a finite statement about declared tower data:

1. a bounded accessible interface: a declared accessible star subalgebra of the private algebra at each regulator, containing the observer’s own public record algebra;

2. self-readback: a map on the private algebra sending each accessible element into the observer’s public record algebra and fixing every element of that algebra;

3. durable records: the observer’s declared generator annihilates every record element;

4. record-conditioned control: a record-indexed family of linear interventions preserving the accessible interface;

5. no-regress prediction: a record-to-record map whose output never strictly precedes its input in the observer’s own record order;

6. continuation: the observer label family and the prediction map commute with the declared refinement maps;

7. own-observer readable evidence: a declared readout equal to the trace pairing of each record element against the observer’s state, with every record element fixed by every declared intervention.

The missing cross-observer half is supplied by a separate fixed-regulator receipt over two such observers and one access cut. Their labels are distinct, their accessible algebras agree with the cut, every committed record restricts to the same element through the two typed maps to the owner-region meet, the two own readouts agree, and at least one common restriction is nonzero. The common section is then accessible to both observers. A proper-meet witness uses diagonal algebras on two distinct owner regions, a scalar algebra on their bottom meet, and corner-evaluation restriction maps: the two local record representatives differ before restriction but agree nontrivially after it. Mutating one shared corner proves failure of the full overlap receipt. An event-world consumer additionally shows that one packet record visible in two owned charts restricts identically from the two owner regions and is fixed by both self-readbacks. This supplies the seven-clause operational contract at one regulator; refinement-natural cross-observer evidence and higher-overlap coherence are not supplied. Readback idempotence on the interface and refinement stability of the own readout are derived. The base witness data are exact and small: over a one-regulator tower with private algebra \(M_2(\mathbb C)\), the public algebra is the span of the two diagonal coordinate projectors, three records carry the strict chain order, the state is the first coordinate projector, the readback is the partition average, the generator is the \(i\)-scaled commutator with the Hamiltonian \(\operatorname{diag}(1,2)\), each intervention is conjugation by the involution \(\operatorname{diag}(1,-1)\), and the prediction advances records while holding the final record fixed. The generator annihilates every diagonal record element and moves the raising matrix unit, so durability is a computed fixed-point fact for a nonzero generator; the control fixes every record element and negates the raising matrix unit, so evidence invariance is computed against a map distinct from the identity. A nontriviality conjunction separates the witness from the constant adaptor: strict record precedence, a nonconstant non-identity prediction, a record element distinct from the zero and identity matrices, a nonzero generator, and a non-identity control. Four negative controls violate one attained field each on the same data: an erasing readback breaks the self-readback law, the identity generator breaks durability, a resetting prediction breaks no-regress, and a constant readout breaks the own-evidence pairing. The bounded receipt selects no unique observer, attaches no instrument, makes no consciousness claim, and supplies no source realization of the tower data.

Access cuts and the common-origin theorem.

A finite regional observer net enriches one consensus tower with a finite region order, per-region local star subalgebras, declared contravariant restrictions, elementwise commutation on declared-disjoint regions, regional expectations, and idempotent local repair. An access cut over such a net assigns each observer one declared support region and one accessible star subalgebra squeezed between the observer’s public record algebra and the regional algebra of the declared region, with the declared restrictions below that region preserving accessibility; stability under the local repair idempotents is a separate strengthening receipt. The observer-local algebra at a region is the meet of the regional local algebra with the accessible algebra, and the regional receipts (isotony, elementwise commutation on declared-disjoint regions, restriction stability, selected-state expectation compatibility, regional-repair fixed points, and remote nondisturbance) transport to this meet. Unique descent into the observer-local algebra is conditional on a separate accessible-glue receipt; ambient unique descent alone does not place a glued section in the accessible algebra, and the universal singleton-family packet keeps the receipt type inhabited without a nontrivial gluing claim.

A finite event world binds one packet to each event, with fixed finite event, chart, and packet carriers, declared active masks, chart ownership tying chart supports to observer regions, packet-derived support, record, and coordinate readouts, and the visibility law that an active visible event has support inside the seeing chart’s region. The common-origin theorem returns, for every active visible chart/event pair \((i,e)\), three conjuncts from one packet \(\mathsf p_e\): \[\operatorname{supp}(\mathsf p_e)\preceq R_{O(i)},\qquad \operatorname{rec}(\mathsf p_e)\in \mathcal L_{O(i)}\!\bigl(\operatorname{supp}(\mathsf p_e)\bigr)\cap \mathcal P_{O(i)},\qquad x_i(e)=\operatorname{geo}_i(\mathsf p_e),\] with \(O(i)\) the declared chart owner, \(R_{O(i)}\) its observer region, \(\mathcal L_{O(i)}\) its observer-local algebra, and \(\mathcal P_{O(i)}\) its public record algebra: event support below the owner’s region, record observable in the meet of the observer-local algebra at that support with the owner’s public algebra, and the soldering chart coordinate as a readout of the same packet. An event precedence adapter carries strict order data on event slots, tied to the owner’s record order on labeled events and identified with no repair schedule, modular parameter, clock reading, proper time, or global time function; where the events carry certified commit provenance, the source-derived construction below generates that order, and an exact adapter is its verifier rather than a choice of it. A selected coarse-to-fine refinement (slot maps for events, charts, and packets, with naturality for masks, ownership, regions, supports, packets, records, and visibility, plus a declared recharting map) transports the full common-origin conclusion, and raw event candidates with a declared semantic-coincidence setoid descend to the event quotient; a reflexive symmetric relation without transitivity admits no such setoid and is closed to the quotient constructor. The witness world reuses the dimension-two cut, whose interposition chain is strict (scalar public algebra inside the diagonal accessible algebra inside the private matrix algebra), and its record readout separates the two packets.

Source-derived event precedence from mismatch provenance.

Event precedence need not be declared where the source supplies provenance. In the companion machine-checked package, every quotient-visible register version carries the identifier of its last semantic writer, and each commit certifies the register versions on which its acceptance genuinely depends, with frame and stamp laws fixing unwritten registers and recording written ones. The causalSupp field is supplied semantic data: Lean checks that it lies inside the read set, while producer and independent-verifier receipts must establish that it is sound and complete for genuine dependence. It is not inferred by a kernel-checked dependence analysis. One commit is a direct semantic parent of another exactly when the child certifies a register that the parent wrote, the child’s pre-commit snapshot names the parent as that register’s writer, and the child’s pre-commit value equals the parent’s post-commit value. A writer label without the write and value witnesses does not create an edge. The generated informational order is the transitive closure of these edges. Under one abstract ancestry-rank witness that increases across every edge, the generated order is irreflexive, transitive, and asymmetric, and it inhabits the same strict-order interface the event precedence adapter consumes. It is the least strict transitive relation containing the direct parent edges, so an adapter that contains every edge and asserts no comparability beyond the generated order carries exactly the generated order. Geometry does not use the numerical values of this acyclicity witness; it recomputes canonical source height from authenticated parenthood. On the committed chain witness world, a two-commit log generates the declared adapter order in full, so the declaration there is a verifier rather than a choice.

An overlap’s mismatch score reads only the committed values on its support, so the score is writer-blind: two snapshots with identical values carry identical scores on every overlap, and a two-register countermodel realizes both parent attributions on value-identical snapshots. A static residual therefore determines no causal arrow; provenance is load-bearing for direction. A commit whose write set misses the support leaves the score unchanged, and a repair whose certified support does not cite the injected version acquires no injection-to-response edge. Under dependency-complete read sets, any two proposals able to move one seam score overlap read-against-write in both directions and land in one aggregate conflict component. Any aggregation map that is constant on conflict components assigns them one aggregate label; an empty-read countermodel shows the completeness clause is load-bearing. A four-commit log realizes the minimal branching interval: one injection, two responses each certifying exactly the injected register, and one answer certifying both outputs generate the four-element Boolean diamond with incomparable responses, while a parent-child pair alone spans the two-element interval. The serialization of the two responses is invisible to this order, because the second response’s snapshot contains the first response’s output without certifying it. Executed histories carry three further machine-checked controls. One adjacent independent swap preserves the authenticated direct-parent relation and its transitive closure when the two executions both satisfy fresh-ID and duplicate-free hypotheses and the commits’ write sets avoid each other and each other’s certified supports. The general equivalence-generated swap chain preserves only raw writer citation, not arbitrary labeled payloads. Executor stutters are removed before commits are formed. A dependent pair marks the boundary: swapping a writer past a reader that certifies the written register changes the edge set. On such histories the append-only acyclicity rank is derived from the execution position rather than declared. Independently of that witness, the geometry layer computes canonical source height from authenticated parenthood alone—zero at roots and one plus the maximum direct-parent height otherwise—proves that it is the attained longest authenticated-parent-chain length, and proves strict increase on every parent edge and generated ancestry. Under fresh identifiers, duplicate-free execution, and visible-support hypotheses, a commit writing only outside the visible register carrier changes no visible mismatch and supplies no outgoing direct raw or authenticated parent edge to a visibly supported child; incoming edges into the hidden commit are not excluded. A freshly injected mismatch persists at full strength through a continuation whose commits never write its overlap support. A refinement receipt assumes that its map carries every direct parent edge into the coarse reflexive precedence; under that assumption it transports the generated order and its causal intervals through coincidence merges. The reversed assignment on the committed diamond-to-chain witness inhabits no such receipt. The generated order is informational. No theorem here supplies invariance over the full admissible implementation class, event separation, physical causal faithfulness, or a Lorentzian continuum.

The generated structure meets two established programs. In causal set theory, a locally finite partial order represents proto-causality [sources]. The OPH order is finite and therefore locally finite, but its proved interpretation is semantic read-from dependence. It is thus causal-set-like rather than a physically attached causal set. The exact-embedding continuum route requires an order embedding whose image has the approximately Poisson count density needed for a causal-set faithful embedding, together with manifoldlikeness and dimension [sources]. In a past- and future-distinguishing continuum, causal order fixes conformal geometry [sources]; the volume datum fixes the conformal factor. The standard Lorentz-invariant continuum approximation uses Poisson sprinkling [source]; the OPH commit log is not a Poisson sprinkling, and its cardinality is not a spacetime volume. Neither continuum existence nor the causal-set Hauptvermutung follows from a finite order. In distributed computing the generated relation is an authenticated read-from dependence suborder and analogue of happened-before [source]; record or program order contributes only when a later commit genuinely consumes the earlier record. Its OPH-specific content is the binding to quotient-visible mismatch, certified read supports, writer-blind static scores, and the strict-order interface of the finite event world.

This gives a precise exact-to-conditional chain. Authenticated semantic provenance fixes the finite event carrier and generated order and computes that order’s exact longest authenticated-parent-chain height. Independently, the exact rank-three positive source Gram quotient supplies the spatial carrier. Its direct sum with a real axis, \[W_{\rm src}=\mathbb R\oplus V_{\rm src},\qquad Q(t,x)=t^2-g_{\rm src}(x,x),\] is a four-dimensional ambient target carrier with Lorentz inertia \((1,3)\), while source-unit directions are exactly its future-null rays. Canonical source height supplies only the temporal coordinate of an event placement after positive scaling. Every finite strict partial order compiles exactly into an abstract authenticated log, with rank derived from predecessor cardinality. Its generic authenticated-parent relation is the whole supplied order rather than its Hasse reduction alone. This is an expressivity theorem for the grammar, not a dynamics or execution-history selection theorem. An enumeration-dependent placement along one source axis gives every finite log an injective one-way forward-causal realization, without order reflection or physical coordinate selection. A supplied source-selected spatial readback and edge speed bound then give one-way cone compatibility. Equal-height spatial separation plus strict spacelikeness of unsupported increasing-height pairs imply converse support and exact order–cone equivalence. Antisymmetry derives injectivity, while the two-way equivalence preserves every source interval on the placed image. No rank-four event chart, fitted signature, or independently declared precedence relation enters this precursor theorem; its dimension is not an intrinsic poset-dimension estimate. The exact Boolean-diamond inhabitant has null parent edges and spacelike independent branches, so the interface is not restricted to chains; this finite witness is not a physical continuum.

The source-direction Einstein theorem shares that finite event type but works in a separately supplied \(3+1\) tensor interface. Nine fixed algebraic source directions, together with supplied symmetric fields, an algebraic coupling, four step maps, Ward/Bianchi identities, and connectedness, imply all-null balance and the finite Einstein-form tensor relation. The directions are not observed provenance links, signals, or sky samples, and the order does not select a field, step, or balance or identify tensor-coordinate differences with those of the constructed carrier. The ambient target-carrier dimension and signature are constructed by the carrier theorem; the poset dimension remains an independent observable. Interpreting the supplied fields as smooth curvature and physical stress requires a source-causal continuum certificate with two-way placement, count–volume calibration, independent dimension/manifoldlikeness tests, stable topology, refinement convergence, and a tensor-curvature reconstruction converging to the smooth Einstein tensor or the separately stated continuum small-ball/null-balance identification, together with stress convergence on one family. Scalar-curvature convergence is only a diagnostic.

A separate conservative source-record family has a controlled causal limit. Fibonacci residues generate \(q^3\) distinct sites in the rank-three metric carrier. Complete preceding-layer reads inside a shrinking radius, including waiting, and a declared model clock produce a flat \(1+3\) causal-order limit. Equal-volume cell assignments give normalized raw count convergence and an interior-interval ordering fraction tending to \(1/10\) [source]. This result uses the stated population and update law; it does not select physical events, a laboratory clock or a common matter-action cone. The same histories admit a retrospective clock. For intervals approaching fixed interior timelike diamonds, the fourth root of their inclusive count ratio converges to their proper-time ratio. A reference interval fixes the unit, and complete ancestry access supplies the count. This readout needs no oscillator or numerical timestamps. Operational covariance gives a separate cone criterion: a nonzero closed convex pointed cone invariant under the source icosahedral rotations and all boosts along one axis must be one of the two Lorentz cones. A time orientation selects the future cone. The covariance must act on possible influences and readouts. Algebraic direction maps alone do not establish that operational premise[source].

Character-block coexistence of regional algebras.

For every \(n\ge 2\) the full matrix algebra \(M_n(\mathbb C)\) admits no unital complex-algebra homomorphism into the scalars: the matrix ring is simple, so such a homomorphism is injective, while the off-diagonal matrix unit is a nonzero element whose square is zero. No unital complex-algebra homomorphism into the scalars accepts an anticommuting pair of units. On this interface, at any regulator of nonzero dimension, a region above a commutative-algebra region carries no anticommuting pair, and every full matrix factor of dimension at least two above a scalar overlap region is excluded: the tensor-factor local-algebra picture with trivial overlap is impossible. The inhabitant locating the boundary is a dimension-four net with three regions: a bottom overlap region carrying the scalar algebra and two declared-disjoint maximal regions carrying the block algebras \(\operatorname{diag}(a,a,A)\) and \(\operatorname{diag}(B,b,b)\) with arbitrary two-by-two blocks. Both regional algebras are noncommutative, neither contains the other, their elements commute pairwise, and each admits a character onto the scalars through its one-dimensional corner block, which supplies the star-homomorphic restriction retractions the interface demands. The block shape is forced: a noncommutative regional algebra compatible with a scalar drop must carry a one-dimensional block, and the witness realizes that minimal shape. The declared overlap algebra is a proper subalgebra of the set intersection of the two block algebras; the regional repair maps are identities. The construction provides no genuine coverage semantics for a source-produced net.

Hamiltonian rigidity of the private block.

The private dynamics behind these interfaces is forced from continuity alone, in the machine-checked modules , , , and . On one full finite matrix block, every complex-linear Leibniz endomorphism is an inner derivation, with an explicit matrix-unit witness proved from scratch, and every star-compatible Leibniz endomorphism is the von Neumann commutator action \(x\mapsto(-i)(Hx-xH)\) of one self-adjoint generator, unique up to one additive real scalar multiple of the identity. A real-parameter group of star automorphisms of the block whose orbit maps are pointwise continuous is conjugation by the coherent unitary family \(\exp(t(-i)H)\) of one time-independent self-adjoint Hamiltonian: continuity upgrades to differentiability at parameter zero because the group acts on the matrix-unit basis as a norm-continuous matrix family whose short-interval average is invertible, and the fundamental theorem of calculus recovers the family from its primitive. Time evolution on the finite private block therefore has no choice except Hamiltonian form. The converse extends to the general finite private algebra through its central structure: the center of any unital star subalgebra of a finite complex matrix algebra, containing the ambient identity, is the span of a minimal orthogonal central resolution of the identity, unique up to permutation; every such unital subalgebra is star-isomorphic to a finite direct sum of full matrix blocks; every central idempotent of the block model is the indicator of a set of blocks; and a pointwise-continuous star-automorphism group keeps each block projection inside that finite indicator set, hence fixes every block and is blockwise conjugation by the unitary family of one time-independent self-adjoint Hamiltonian per block, with block fixing derived rather than assumed and the block swap realized on the square two-block algebra. The parameter is a real number; no physical clock, source-selected Hamiltonian, or physical time identification is claimed [source].

Finite covariant-net consequences and limitations.

The finite observer net determines a category of event regions and causal embeddings together with a covariant observable functor (). Its causal embeddings are proof-only order data, so the category is thin and carries no Lorentzian geometry. In particular, these carriers provide no region reflection, antiunitary conjugation, distinguished vacuum, spin structure, symmetry-group action, Lorentzian Cauchy-embedding class, translation action, or spectrum condition. Consequently they lack the data needed to formulate CPT, spin–statistics, relative-Cauchy stress response, or Haag–Ruelle scattering. These are limitations of the mathematical carrier, not negative theorems about QFTs built from richer data ().

The same module encodes seven structural questions and kernel-checks their partition by mathematical conclusion. Four of them (CPT, spin–statistics, relative-Cauchy stress response, and particle scattering) lack defining geometric or spectral data on this carrier. Full field/action reconstruction likewise cannot be inferred from the finite static identities alone. Of the two remaining questions, the restricted endomorphism surrogate collapses as described next, while the finite KMS identity coexists with the net- and public-algebra counterexamples below. Thus the seven-way classification is a statement about what follows from the specified carrier.

The finite sector theorem has a narrower exact content. Every bijective localized endomorphism of the witness net is inner and hence equivalent to the identity under the declared finite equivalence relation (). This does not constitute DHR reconstruction: the carrier supplies no source-selected vacuum representation, quasi-local net, transportability structure, or reconstructed gauge group. The selected tower states nevertheless induce mathematical GNS representations of the completed colimit, as described below. Innerness of this restricted class supplies no charge or flavor quantum number.

Two further finite results delimit thermality and field reconstruction. The oriented-face curvature has kernel exactly the port gradients, and its five-neighbor seam action is gauge invariant exactly for conserved seam currents. This is a static finite action identity; it supplies no temporal dynamics, charge–current continuity map, source-selected physical current, physical matter or Spin action, spacetime carrier, or continuum limit. On a private finite block, the normalized Gibbs state satisfies the algebraic KMS identity. On the constructed example net, however, every functional is KMS for every grading-preserving flow at every complex time, while every pointwise-continuous group of star automorphisms of the public record algebra is the identity, a statement that leaves continuous row-stochastic public semigroups untouched (). The finite Gibbs identity therefore does not establish thermality of the observer net.

The one-step transport interface and the common triple-observer carrier below recover exact finite evolution and marginal identities, but they carry no Cauchy geometry, multi-step cocycle, physical time, or source-selected dynamics (; ). They therefore imply neither a relative-Cauchy stress response nor a physical time-slice theorem.

Natural powers give one exact constraint on a fixed-cutoff scattering construction: in every Hausdorff topological group, \(g^n\to a\) forces \(g=1\) (). Hence a nontrivial exact unitary update at fixed finite cutoff cannot itself settle to an ordinary matrix-topology large-time limit. The same module proves \((g^n)^{-1}g^n=1\), so relative evolution can converge even when the individual powers do not. Any fixed-cutoff direct-power construction that uses \(U^n\) itself as its asymptotic carrier cannot use full convergence of that sequence; it must change the asymptotic carrier or dynamics, or use a projected or weaker convergence notion. At fixed finite dimension, full weak-operator convergence does not evade the obstruction because the standard finite-dimensional operator topologies coincide. Comparison dynamics, selected projected scalar or observable readouts, an infinite-dimensional weak limit after a continuum or infinite-volume passage, open-system evolution, and finite-time or recurrence-aware readouts lie outside this no-go. The theorem constructs no S-matrix, asymptotic state, optical theorem, cross section, or interacting continuum limit.

Restriction naturality on authenticated event regions.

Let a finite regional net have local algebras \(\mathcal A_r(U)\), contravariant restrictions \(R^r_{V,U}\) for \(V\subseteq U\), algebra refinements \(j_{rs}\), and regional repair maps \(P^r_V\). Restriction is additional algebraic data; isotony alone does not supply it. Suppose repair is natural, \[j_{rs}P^r_V=P^s_{V_s}j_{rs},\] where \(V_s\) is the refined region. The following compatibility is a separate hypothesis on the restricted domain: \[\begin{equation} R^r_{V,U}X=P^r_VX\qquad(X\in\mathcal A_r(U)). \label{eq:source-restriction-repair-compatibility} \end{equation}\]

An inhabited example decorates the committed four-event Boolean diamond and three-event chain by a two-dimensional diagonal algebra. The injection event has the scalar algebra, and every response and answer has the full diagonal algebra. Restriction to the root sends \(\operatorname{diag}(x_0,x_1)\) to \(x_0I\); in particular, \(\operatorname{diag}(1,0)\) is changed. The authenticated coarsening maps the diamond labels \((0,1,2,3)\) to \((0,1,1,2)\) and merges two distinct responses. Its region decorations agree, and the restriction square is inhabited. The reversed assignment \((2,1,1,0)\) violates authenticated precedence. The finite identity, composition, compatibility, and coarsening statements are proved in QFT/LimitRestriction.lean.

The algebra regulator in this example is constant. Region decoration and edge preservation are explicit data; neither physical regions nor a source-selected refinement family are inferred. These are restrictions of commutative finite algebras, without an assertion of homomorphic scalar restriction for matrix factors. No normed limit restriction, physical locality, spacetime identification, or physical time-slice property follows.

Tower-anchored joint carriers and the typed time-slice interface.

Two regional diamonds carry source-counted correlation data of retained observer pairs from one bounded companion run: a two-slot conditional-expectation net for the pair 86/88 on a joint carrier of dimension 182, and one for the fully support-disjoint pair 86/247 on a joint carrier of dimension 169. In , the 86/247 diamond transports onto the private algebra of one constant consensus-tower stage by the same specified transport pattern as the 86/88 witness, with the same checkpoint family of observer 86 as commutative public layer, the uniform selected state, and the template nontriviality receipts: every partition member lies in the anchored left region, every member is proper, and the anchored left region is a proper subalgebra. Both carriers therefore have parallel tower anchorings of the same declared form (bothCarriers_common_anchoring). An exact shared-observer theorem (towerCarriers_share_obs86_marginal) relates the two carriers through their common left observer: the two source-derived joint paths have equal left label components at every step, equal left occupation counts, and equal induced diagonal hinge states, each equal to the source marginal state of observer 86, and the left partial trace of the counted correlation state equals the 86/88 hinge state. At the anchored-net level the carriers are not identified: the ambient dimensions 169 and 182 differ, and no map between the two anchored nets is constructed.

That carrier-level obstruction can nevertheless be removed below the net level. The module uses the common finite carrier \[(\mathrm{obs86},\mathrm{obs88},\mathrm{obs247}) \in \operatorname{Fin}(13)\times\operatorname{Fin}(14) \times\operatorname{Fin}(13).\] Its two coordinate projections recover both complete 32-row source paths and their occupation tables. The diagonal triple counted state is positive and trace one; explicit linear positive trace-preserving marginals recover both counted pair states. Four triple checkpoint projectors have normalized partial traces recovering both anchored checkpoint partition members. On each of the 31 actual adjacent source transitions, a triple reindexing transports the source projector and intertwines with both pair marginals. The endpoint is not wrapped to the first row: all three final-to-initial source counts are exactly zero.

This is a common state/path/checkpoint coupling, not a canonical gluing theorem. The pair of marginals is provably noninjective on triple matrices, so the full row alignment selects the displayed coupling and the pair states alone do not. The marginal maps are not used as multiplicative algebra maps, no completely-positive interface is claimed, and neither regional net nor independently declared uniform tower state is transported by this theorem.

The structure TimeIndexedNetEvolution in is a finite one-step interface. It carries a finite index and successor, a region family, per-step ambient star-automorphisms mapping each regional algebra to its successor, and admitted data in the regional algebra at the current index. The generation clause evolves those data before requiring their generated algebra to equal the successor regional algebra.

A full finite inhabitant exists over the 86/247 net. Its cyclic \(\operatorname{Fin}(32)\) witness follows the 31 actual adjacent source-row pairs and adds one terminal-to-initial bookkeeping automorphism; all three corresponding source counts are zero, so that closing automorphism is not a source transition. The admitted data are observer 86’s lifted source generators, and the region is the left region at every step. The evolved generators again generate that region (evolvedLiftedSourceGenerators_generate_left). Constancy here is a property of this chosen witness, not a theorem about every possible inhabitant. The natural single-projector walk candidate is a negative control: its evolved singleton is the next diagonal walk projector and cannot generate the top regional algebra (walkSlice_evolved_generation_fails).

The interface has no multi-step cocycle or group-action law, Cauchy geometry, clock, physical time, or source-selected dynamics and therefore implies no time-slice theorem. The common carrier joins the source state, path, and checkpoint data but supplies no regional-net or tower morphism. The \(\mathbb Z/2\) slot swap is an internal finite symmetry. The diagonal-layer join below carries typed embeddings of both carriers but no physical time, causal interpretation, spacetime attachment, regional-net join, or tower join.

Finite carrier join.

The module joins the two finite carriers at their diagonal layer, the layer on which every source-counted state lives. The observer-86 hinge is the 13-dimensional function space on the shared label alphabet; it maps into the 182-dimensional 86/88 layer and the 169-dimensional 86/247 layer by fiber-uniform sections of slot marginalization, and the join is the pushout of the two carriers over the hinge. Both embeddings are injective typed linear maps and agree exactly on the hinge (embed_agree_on_hinge); the join has dimension \(338 = 182 + 169 - 13\) (joinCarrier_finrank), strictly below the direct-sum dimension \(351\); and the intersection of the two embedded images is exactly the embedded hinge (embed_range_inter), so the construction glues along the shared observer rather than placing the carriers side by side. A hinge restriction retracts the join onto the hinge; under it the two transported counted states restrict to the same source-derived observer-86 occupation law (joinStates_marginal_compatible). The specified ambient anchoring equivalences act on the diagonal layer as the corresponding basis reindexings, and the join transports along them with commuting squares on both embeddings; the walk-step transports over the 31 actual adjacent source transitions restrict to the diagonal layer, share the observer-86 hinge action, and descend to one join evolution intertwined by both embeddings and by the hinge restriction. The join is a finite linear object with declared fiber-uniform sections: no star-algebra amalgamation, order structure on the quotient, net morphism, tower morphism, or uniqueness claim accompanies it.

Record-layer net morphisms for the join.

The module equips the join with the regional structure of the two finite carriers at the layer on which the join exists. For each region of either diamond, the record layer is the typed function subspace of the carrier (constants at the bottom, the two coordinate pullbacks on the slots, everything at the top), and a machine-checked characterization proves that these subspaces are exactly the diagonal restrictions of the specified regional algebras (diagonal_mem_twoSlotAlgebra_iff), with dimensions \(1\), \(13\), \(14\), \(182\) on the 86/88 side and \(1\), \(13\), \(13\), \(169\) on the 86/247 side. The induced net on the join carries one region per specified region of each side plus the 13-dimensional hinge, ordered by a kernel-checked partial order; the net is isotone, both embeddings are region-by-region morphisms preserving inclusions and dimensions, the hinge image is the same subspace through either embedding, the associated conditional expectations restrict to the record layer on every region (landing in it and fixing it), the matched left-slot pair descends to one hinge projection on the join that commutes with both embeddings, is idempotent, and preserves the hinge restriction, and the join evolution carries every induced region onto itself (joinStep_maps_joinRegionLayer). Two negatives delimit the layer exactly: the gluing submodule is not multiplicatively closed, so the quotient multiplication is ill-defined and the join carries no algebra structure through this pushout (join_quotient_mul_ill_defined), and the record layer is commutative while the left regional algebra is not, so the commutant distinctions of the operator layer collapse under the diagonal restriction. The construction defines no operator-layer net morphism, tower morphism, physical time, causal interpretation, or spacetime attachment.

Operator-layer boundary.

For the 86/247 carrier, the record function carrier enters the joint matrix algebra as an injective unital star algebra homomorphism, the diagonal embedding; its image lies in the specified regional algebra of a region exactly when the record function lies in the record layer of that region (diagonalStarHom_mem_regionMap_iff), and it intertwines the specified conditional expectations with the record-layer expectations on every region. In the projection direction the left-slot conditional expectation is positive, trace preserving, and unital, and restricts to the record-layer expectation on diagonals; a specified right-slot projector witnesses that it is not multiplicative (leftSlotExpectation_not_multiplicative). No map from the joint algebra to the record carrier is multiplicative on the left regional algebra while restricting to the record-layer morphism on diagonals: the noncommuting witness pair has both of its products diagonal, and any multiplicative map into a commutative target identifies them (no_multiplicative_record_projection247). No unital algebra homomorphism carries the left regional algebra, or the ambient joint algebra, into the record carrier at all (twoSlot247_left_no_record_algHom), through the matrix-factor scalar obstruction. The boundary is an asymmetry for the declared expectation-versus-multiplicative projection grades: embedding is a star homomorphism, while the projection is a positive unital trace-preserving expectation and is not multiplicative. The theorem does not classify complete positivity, idempotence, bimodularity, nonlinear maps, different targets, or enriched categorical structures. It defines no net-to-net or tower morphism at the operator layer ().

The normed completion of the colimit.

The consensus tower supplies a directed family of finite matrix observable algebras whose connecting maps are star algebra homomorphisms, and its filtered colimit carries an inductive-limit seminorm: the value at a class is the infimum, over the declared refinements of one representative, of the stage norm of the refined representative. Contractivity of the connecting maps makes that value independent of the chosen representative. The stage norms of one representative form a subset of a finite set determined by the spectrum of the product of the representative with its adjoint, so the infimum is attained at a declared refinement and every class has a representative whose stage norm no declared refinement changes. Attainment converts the seminorm into an exact kernel statement: a class has seminorm zero exactly when some declared refinement annihilates its representative, which is the refinement-null kernel of the colimit itself. The seminorm is therefore a norm, the colimit is a normed star algebra satisfying the C*-identity for it, and its uniform completion is a C*-algebra: it carries a star ring structure extended from the dense image together with an isometric star and the C*-identity. The regional structure transports to the completion: the closures of the images of the limit local algebras are isotone, independent of the regulator at which a region is presented, elementwise commuting for declared-disjoint regions, and equal along the order-theoretic Cauchy embeddings of the tower, and each of those four statements is instantiated on a finite witness net whose top region carries an element of norm one. Two controls fix the boundary of the construction: a tower whose connecting map annihilates the unit carries a nonzero stage element of stage norm one whose limit seminorm is zero, and a conjugation of the two-by-two stage by a diagonal scaling increases the norm of a matrix unit, so the star clause of the connecting maps is the clause the contractivity step consumes. The construction is algebraic and order-theoretic throughout. The equality it transports along Cauchy embeddings is the order-theoretic equality of the tower; it supplies neither time-indexed physical evolution nor a physical attachment. ().

A selected-state Hilbert-space representation of the completed net.

Equip the completed colimit with the canonical C*-spectral order. For every positive complex-linear functional \(\omega\) normalized by \(\omega(1)=1\), the GNS construction gives a complex Hilbert space \(\mathcal H_\omega\) and a unital star representation \(\pi_\omega\) of the completed colimit by bounded operators. The completion image \(\Omega_\omega\) of the algebra unit is explicit and obeys \[\|\Omega_\omega\|=1, \qquad \langle\Omega_\omega,\pi_\omega(a)\Omega_\omega\rangle =\omega(a), \qquad \overline{\{\pi_\omega(a)\Omega_\omega:a\}}=\mathcal H_\omega.\] Sending every completed regional algebra to its image under the same representation preserves isotony, refinement independence, elementwise locality for the declared-disjoint regions, and the order-theoretic Cauchy-embedding equality. Images are used rather than identified with their sources because normalization does not imply that the representation is faithful.

For the specified tower interface, the functional need not be added as an unrelated input. Let \(\xi_r\) be an explicitly supplied observer family compatible with every regulator refinement, and let \(\rho_{r,\xi_r}\) be the selected density state carried by the tower. State naturality makes \[\omega_\xi(\iota_r(X)) :=\operatorname{Tr}(\rho_{r,\xi_r}X)\] well defined on the algebraic colimit. The finite state-expectation bound extends it continuously to the completed colimit, where it is positive for the spectral order and normalized. Hence \(\omega_\xi\) supplies the GNS Hilbert space and representation above. The one-regulator witness instantiates this construction, and its GNS unit class is nonzero with norm one. This yields a mathematical Hilbert-space representation of the selected-state completed net.

Taken alone, this construction’s coherent observer family and finite density states are declared structural data, not a state selected by an experimental source. Neither they nor \(\Omega_{\omega_\xi}\) are identified as a physical vacuum. No Hamiltonian or physical dynamics, energy–momentum, field content, Lorentzian attachment, continuum or infinite-volume limit, interacting theory, or physical time-slice theorem follows. (; ).

An exact finite two-site Hamiltonian benchmark.

As a separate finite-dimensional test of Hamiltonian structures outside the completed-net attachment, take \[\mathcal H_{\mathrm I} = \mathbb C^2\otimes\mathbb C^2 \cong \mathbb C^4, \qquad H_{\mathrm I}=\frac12\bigl(1-Z\otimes Z\bigr).\] The full matrix algebra acts faithfully by bounded operators on \(\mathcal H_{\mathrm I}\). Exact matrix proofs give \(H_{\mathrm I}^{*}=H_{\mathrm I}\), \(H_{\mathrm I}\geq0\), and \(H_{\mathrm I}^{2}=H_{\mathrm I}\). The explicit unit vector \(\lvert00\rangle\) and density \(\rho_{00}=\lvert00\rangle\langle00\rvert\) obey \[\|\lvert00\rangle\|=1,\qquad H_{\mathrm I}\lvert00\rangle=0,\qquad H_{\mathrm I}\rho_{00}=\rho_{00}H_{\mathrm I}=0, \qquad \operatorname{Tr}(\rho_{00})=1.\] Thus \(\rho_{00}\) is a normalized stationary ground-state density; the orthogonal unit state \(\lvert11\rangle\) also has zero energy, so the ground space is degenerate and no unique vacuum is selected. The propagator \(U(t)=\exp(-itH_{\mathrm I})\) is unitary and obeys \(U(s+t)=U(s)U(t)\); its conjugation flow \(\alpha_t(X)=U(t)XU(-t)\) is multiplicative, fixes \(\rho_{00}\), and preserves commutation between jointly evolved left- and right-slot observables. The bond is genuinely interacting in the exact finite sense that \(H_{\mathrm I}\) is not any sum \(H_L\otimes1+1\otimes H_R\) of one-site Hamiltonians; in particular it belongs to neither one-site matrix-algebra image. The evolution is nontrivial: for \(X_L=X\otimes1\), \[\left.\frac{d}{dt}\right|_{t=0}\alpha_t(X_L) =-i[H_{\mathrm I},X_L]\ne0,\] with the displayed matrix entry equal to \(i\). Deleting only the \(Z\otimes Z\) interaction leaves the scalar Hamiltonian \(H_{\mathrm{del}}=\tfrac12 1\), makes the full conjugation flow static, and makes the same infinitesimal generator zero. These are zero-residual identities on the declared four-dimensional carrier.

Taken alone, this is an exact coupled two-spin lattice benchmark, not an interacting quantum field theory and not a Hamiltonian attachment to \((\mathcal H_{\omega_\xi},\pi_{\omega_\xi})\) above. Its tensor factors are declared sites rather than Lorentzian regions; \(H_{\mathrm I}\), its normalization, and the state are supplied rather than selected by an OPH source; and \(t\) has no physical clock or energy calibration. Equal-time commutation here preserves one finite tensor-product commutator and is not a microcausality theorem. No continuum or infinite-volume limit, field algebra, Lorentz covariance, spectrum condition, renormalization flow, particle interpretation, scattering construction, detector readout, or physical time-slice theorem follows. ().

The finite Hamiltonian, regional diamond, and selected GNS on one carrier.

The two preceding constructions compose in one typed finite model. Use the canonical basis equivalence \(\operatorname{Fin}(2)\times\operatorname{Fin}(2)\simeq \operatorname{Fin}(4)\) to place the two-spin algebra on a one-regulator consensus tower \(T_{\mathrm I}\). Its selected density is exactly \(\rho_{00}\), and its stored generator is not the constant tower adaptor’s zero map but \[\delta_{\mathrm I}(X)=-i[H_{\mathrm I},X].\] On the same carrier, the scalar/left/right/top conditional-expectation diamond has commuting declared-disjoint slot algebras, and its left and right algebras jointly generate \(M_4(\mathbb C)\). Let \(\omega_{\mathrm I}\) be the tower-selected functional, let \((\mathcal H_{\mathrm I}^{\mathrm{GNS}},\pi_{\mathrm I}, \Omega_{\mathrm I})\) be its GNS triple, and define \[h_{\mathrm I}=\iota(H_{\mathrm I}),\qquad \widehat H_{\mathrm I}=\pi_{\mathrm I}(h_{\mathrm I}),\qquad \widehat U_{\mathrm I}(t)= \pi_{\mathrm I}\!\left(\iota(U(t))\right).\] The exact composite representation from \(M_4(\mathbb C)\) through the colimit completion to bounded GNS operators is injective. Consequently the ground-vector equations do not arise from a collapsed quotient: \[\|\Omega_{\mathrm I}\|=1, \qquad \widehat H_{\mathrm I}\ne0, \qquad \widehat H_{\mathrm I}^{*}=\widehat H_{\mathrm I}, \qquad \widehat H_{\mathrm I}\Omega_{\mathrm I}=0.\] The Hamiltonian belongs to the represented top region, while the represented left and right Pauli observables retain their regional memberships and commute. The mapped propagators are unitary, form an additive one-parameter group, and obey the exact intertwining identity \[\pi_{\mathrm I}\!\left(\iota(\alpha_t(X))\right) =\widehat U_{\mathrm I}(t) \pi_{\mathrm I}\!\left(\iota(X)\right) \widehat U_{\mathrm I}(-t).\] Interaction remains load bearing after representation: \(\pi_{\mathrm I}(\iota(-i[H_{\mathrm I},X_L]))\ne0\), and this first-order response is outside the represented left algebra, whereas the same represented response is zero after deleting the coupling.

The left conditional expectation \(E_L\) is trace preserving but does not preserve the selected pure state: \[E_L(1\otimes Z)=0, \qquad \operatorname{Tr}(\rho_{00}(1\otimes Z))=1.\] Thus the construction is a finite regional diamond together with co-located interacting C*-dynamics on its ambient algebra, represented on the tower-selected GNS Hilbert space. The dynamics need not preserve each regional algebra: indeed, the nonzero first-order response above leaves the represented left algebra. The failure of state preservation is a property of that particular trace-preserving expectation, not a failure of a global state to restrict to the regional algebras. It therefore supplies a useful incompatibility diagnostic but is not itself the criterion separating a finite net from a physical QFT. The regulator, factorization, density, Hamiltonian, and flow parameter are declared rather than source produced or calibrated; the ground sector is degenerate; and Lorentzian localization, a spectrum condition, continuum or infinite-volume control, renormalization flow, field and particle content, scattering, detector readback, and a physical time-slice theorem are absent. ().

A source-counted finite history Hamiltonian on the selected GNS space.

The retained eight-history packet supplies a separate finite attachment in which the state and diagonal action entries are source counted rather than freely chosen. For each binary path \(g=(s_0,s_1,s_2)\), let \(n_g>0\) be its exact window count among the 1754 retained windows and let \[S_g=\mathbf 1_{s_0\ne s_1}+\mathbf 1_{s_1\ne s_2}.\] On \(M_8(\mathbb C)\), define \[\rho_{\rm hist}=\operatorname{diag}\!\left(\frac{n_g}{1754}\right), \qquad H_{\rm hist}=\operatorname{diag}(S_g).\] The source receipts prove every \(n_g\) positive and prove the displayed state-change formula for \(S_g\). Exact matrix proofs then give \[\rho_{\rm hist}\geq0,\quad \operatorname{Tr}\rho_{\rm hist}=1,\quad H_{\rm hist}\geq0,\quad H_{\rm hist}^{*}=H_{\rm hist},\quad [\rho_{\rm hist},H_{\rm hist}]=0,\] with \(H_{\rm hist}\) nonzero and non-scalar. The selected energy retains the counted source value \[\operatorname{Tr}(\rho_{\rm hist}H_{\rm hist}) =\frac{197}{1754}.\]

Place this pair in one consensus-tower stage with stored generator \(\delta_{\rm hist}(X)=-i[H_{\rm hist},X]\). The selected density constructs a normalized GNS triple \((\mathcal H_{\rm hist},\pi_{\rm hist},\Omega_{\rm hist})\), and the composite representation of \(M_8(\mathbb C)\) is injective. Thus the represented Hamiltonian is nonzero and self-adjoint. Its cyclic matrix coefficient is exactly \(197/1754\), which also proves \[\pi_{\rm hist}(H_{\rm hist})\Omega_{\rm hist}\ne0.\] The matrix unit \(E_{01}\) supplies a nonclassical control: \[\bigl(-i[H_{\rm hist},E_{01}]\bigr)_{01}=i,\] so the represented commutator response is nonzero. The exponential propagators are unitary, obey the additive group law, intertwine exactly with the represented Heisenberg flow, and leave \(\rho_{\rm hist}\) stationary.

The same carrier has an exact tensor-local history decomposition. The source encoding identifies its basis with \(((s_0,s_1),s_2)\in(\mathbb Z/2)^3\). Tensor-factor embeddings define the one-slot algebras \(\mathcal A_0,\mathcal A_1,\mathcal A_2\), the generated adjacent interval algebras \(\mathcal A_{01}=\mathcal A_0\vee\mathcal A_1\) and \(\mathcal A_{12}=\mathcal A_1\vee\mathcal A_2\), and \(\mathcal A_{012}=M_8(\mathbb C)\). The inclusions are isotone and the separated endpoint algebras obey exact locality, \[[\mathcal A_0,\mathcal A_2]=0.\] Writing the two adjacent domain-wall projectors as \[H_{01}=\operatorname{diag}(\mathbf 1_{s_0\ne s_1}),\qquad H_{12}=\operatorname{diag}(\mathbf 1_{s_1\ne s_2}),\] gives the residual-free local decomposition \[H_{\rm hist}=H_{01}+H_{12},\qquad H_{01}\in\mathcal A_{01},\qquad H_{12}\in\mathcal A_{12}.\] Both bonds are positive, and their separately counted source energies are \[\operatorname{Tr}(\rho_{\rm hist}H_{01})=\frac{94}{1754},\qquad \operatorname{Tr}(\rho_{\rm hist}H_{12})=\frac{103}{1754}.\] For \(\delta_{\rm hist}(X)=-i[H_{\rm hist},X]\), locality removes the remote bond exactly, so \[\delta_{\rm hist}(\mathcal A_0)\subseteq\mathcal A_{01},\qquad \delta_{\rm hist}(\mathcal A_2)\subseteq\mathcal A_{12}.\] These are first-commutator finite-support statements, not a continuum finite-speed theorem. The single source functional \(\omega(X)=\operatorname{Tr}(\rho_{\rm hist}X)\) restricts to compatible states on every displayed algebra: for each inclusion \(\mathcal A_U\subseteq\mathcal A_V\), \(\omega_V|_{\mathcal A_U}=\omega_U\). The injective selected-GNS representation transports the endpoint locality, the two bond memberships, the Hamiltonian decomposition, and the generator-support statements without collapse. This compatible restriction is the state compatibility required of the finite net; it does not assert a source-state-preserving conditional expectation from the full algebra onto every region.

This is a source-counted finite three-history-slot local dynamical system on its selected GNS Hilbert space, not a physical QFT. The retained run was hash-pinned, but the empirical law and repair-count postprocessing were not jointly preregistered. The packet fixes the diagonal density and the two repair-change contributions; the full \(M_8(\mathbb C)\) quantum extension, tensor-factor locality reading, off-diagonal coherence probe, one-regulator tower, and real flow parameter are mathematical adapters. The nonzero energy of \(\Omega_{\rm hist}\) prevents its promotion to a vacuum or ground vector. The three successive history coordinates are not calibrated physical times or Lorentzian regions, and there is no physical clock or energy calibration, spectrum condition, continuum or infinite-volume control, renormalization flow, field/particle interpretation, scattering, detector readback, or physical time-slice theorem. (; ).

The rational record layer carries a finite slot-indexed conditioning family. For every slot region \(S\subseteq\{0,1,2\}\), conditioning the committed window law on the slots in \(S\) defines a map \(E_S\) on \(\mathbb Q\)-valued record observables that is rational-linear, unital, pointwise positive, localized, idempotent, and tower-compatible, \(E_S\circ E_T=E_S\) for \(S\subseteq T\). The full-region map is the identity because the three slots separate the eight histories, the empty-region map is the constant empirical mean, and every \(E_S\) preserves that mean. The domain walls are fixed points of their own interval maps, every regional map preserves the bond means \(94/1754\) and \(103/1754\) and the action mean \(197/1754\), and the late-slot conditional weights are \(383/415\) in the \((s_0,s_1)=(0,0)\) cell and \(2/89\) in the \((0,1)\) cell.

The matrix obstruction has a fixed target and hypotheses. No complex-linear map from \(M_8(\mathbb C)\) into this particular \(\mathcal A_{01}\) can both satisfy the \(\mathcal A_{01}\)-bimodule law and preserve the committed state \(\omega\): such a map would assign the slot-two projector a single conditional weight over \(\mathcal A_{01}\), whereas the two cells demand \(383/415\) and \(2/89\). This does not rule out ordinary AQFT nets of inclusions with state restriction, other or enlarged target algebras, ancillary boundary memory, generalized expectations, or non-bimodule positive or completely positive channels. The finite-probability conditioning identities and wall coefficients transport to represented diagonal elements on the selected GNS carrier ().

Region families of the one-step interface.

The module settles the region-family freedom of TimeIndexedNetEvolution over the finite 86/247 diamond in both directions. Any evolution family that maps each regional algebra onto itself forces a step-invariant region family, and every net-compatible slice family over the specified walk-step evolution on cyclic \(\operatorname{Fin}(32)\) is constant (stepEvolve_slice_constant); the scalar bottom and full top regions are rigid under every evolution family, so a one-step region change of any inhabitant exchanges the two slot regions (slice_change_forces_slot_exchange). Conversely a slot-alternating inhabitant exists (slotAlternatingEvolution): the slice alternates between the left and right slot regions, the per-step automorphism composes the specified walk-step evolution with the internal slot exchange, the admitted data are the source generators of observer 86 at even steps and of observer 247 at odd steps, and the evolved data generate the next regional algebra at every step; the region family is provably not step-invariant. The exchange factor is a constructed internal symmetry rather than a source transition, and the walk factor carries the declared index-31 bookkeeping closure. The construction supplies no physical time, causal interpretation, or source-derived time-slice content.

Boundary-fibre circularity control.

Over the bare consensus tower of the gravitational branch (finite presentation and quotient states, a mismatch functional, a strictly descending step relation, an idempotent normal form, a protected boundary map, and physical coarse maps), a signature family that factors through the protected boundary on consistent states and is complete on consistent states forces the boundary fibre: equal boundary values imply equal consistent states. Instantiating the signature as the protected boundary itself makes the factoring hypothesis trivial and makes the completeness hypothesis definitionally identical to the conclusion; the degeneration is recorded as a definitional equivalence, so the circularity is itself a theorem, and the result is substantive only for a signature constructed independently of the boundary and proved complete on its own grounds. A selected settled branch (one normal-form-fixed, coherent quotient point per regulator) is an explicit premise with a concrete inhabitant and an explicit failing candidate, and an event and geometry readout fragment carries normal-form-invariant, coarsely natural packet readouts that separate two consistent states on the same concrete tower. Every statement in this subsection is a finite conditional structure over declared data: no physical region, coverage, instrument, spacetime, causal cone, event actualization, probability law, or continuum object follows [source].

OPH Simulation Criterion and Fixed-Point Firewall

A fixed-point equation is necessary for a selected finite OPH packet, but it is not the definition of an OPH simulation. The additional clauses below are the nontrivial content.

A finite source-bound witness.

A bounded companion run supplies one finite instance from source data to kernel-checked literals. Its locally pre-specified, hash-pinned contract has no independent public preregistration because contract and result entered the repository together. The contract specifies a nonconstant protected record, separate state and transition tables, an exact recognizer, stationarity, and contraction. The transition stationary law and the empirical state-side reference are distinct objects: their exact denominator mismatch and the nonprojector transition eigenmode rule out both a deterministic pushforward and a nondegenerate intertwiner with the idempotent state-side resampling action. The finite payload integers are mirrored verbatim in as kernel-decided literals that inhabit a payload-attached observer access-cut interface. On three of the four mirrored observer supports the public and accessible algebras coincide; exactly one support separates a record class by its companion class. The literals are counts and class labels from one run under a declared binning and observer-selection rule. They establish no physical claim or probability law beyond the realized frequencies [source].

Distributed Presentations of One Finite Universe

The implementation closure clause in Definition 76 has a distributed form. A worker partition is allowed to accelerate or package the computation, but it is not a new physical ingredient. The physical question is whether the worker run presents the same finite quotient repair system as the monolithic carrier.

Public certificate contract.

A run pack that claims Theorem 84 must emit enough evidence for a verifier to reconstruct the premises without trusting worker narration. The required fields are: a global carrier manifest and hash, the monolithic graph \(G_r\), the global initial quotient state \(q_0\), a partition map \(\kappa\), cut-interface records \(E_\kappa^{\mathrm{cut}}\) with restriction maps, a global observer registry, code/config/run hashes, a committed event log with a linearization witness for each physical commit, stutter records for noncommitting worker events, rollback records naming earlier committed projection roots, repartition records preserving the physical projection root, a final monolithic normal-form certificate, and a final readout recomputed from the projected state. Missing, stale, shard-local, or synthetic replacements for these fields fail closed. The exact branch uses this contract; noisy branches additionally need the fair-block constants of Theorem 90.

Quotient Chart Transport and Neutral Geometry

The distributed certificate above proves that a worker presentation is one finite quotient system. A separate step is needed before observer rows from different shards may be read as a common neutral geometry.

Certificate boundary.

Pairwise available-channel comparison is not a metric policy: different pairs can share different channels and violate the triangle inequality. A neutral-geometry run must therefore use complete cases, a fixed missing symbol whose mask is quotient-visible, or train-only imputation labelled as an imputed-representation metric. The run also records a finite channel list or a pairwise weighted-\(\ell^p\) summability certificate. Presentation invariance requires a bijection of \(Q_{\mathrm{vis}}\) and channel isometries, so gauge changes, port relabelings, observer order, repair schedule, and shard partition changes are checked on distance matrices, not on displayed coordinates. Refinement requires a cofinally vanishing tail modulus for the finite-stage distances. Euclidean claims require the double-centered Gram test \[B=-\frac12H(D^{\circ2})H\succeq0\] and noisy runs report negative spectral mass, rank/effective rank, held-out stress, and positive and negative controls. Before preprocessing, statistical certificates split independent generative batches. Chart alignment, scaling, imputation, weights, graph construction, dimension selection, and thresholds are train/validation objects. Any shared shard batch, seed, boundary condition, trajectory family, duplicate, descendant, or repeated test-set inspection blocks the held-out theorem. This section certifies a common quotient metric or pseudometric only; physical Riemannian or Lorentzian spacetime identification belongs to the separate modular/geometric branch.

Noisy Fair-Block Approximate Consensus

The exact consensus theorem supplies the quotient normal-form target. A noisy implementation needs one more quantitative certificate: complete fair blocks must contract expected distance to that target. This section records the conditional bridge from local noisy repair to long-run observer-facing approximate consensus.

Finite audit route and constants.

For a finite exported packet net, Proposition 93 gives the practical certificate path: \[\begin{gathered} \text{finite quotient }Q \Rightarrow \text{exact normal forms }\mathcal N \Rightarrow \text{distance table }D(q)\\ \Rightarrow \text{noisy fair-block kernels }K_B \Rightarrow (\lambda,\varepsilon)\text{ certificate}. \end{gathered}\] Here \(\mathcal N\) is the exact quotient normal-form set, \(D(q)\) is observer-facing residual distance to that set, \(\lambda\) is the net contraction produced by one completed fair block, \(\varepsilon\) is the per-block irreducible local recovery / record / readout / calibration / environmental noise, \(A\) bounds transient within-block expansion, \(\beta\) is the within-block noise floor, and \(L\) is the fairness horizon before all required active mismatch classes are serviced. In quantum/collar implementations, \(\varepsilon\) may absorb Petz-domain truncation, Fawzi–Renner recovery error, approximate central-record error, detector/readout noise, and coarse-graining defect.

Claim boundary.

Theorem 90 is a conditional global noisy-consensus theorem. It does not follow from the exact finite repair theorem alone. The exact OPH theorem supplies the quotient normal-form target \(\mathcal N\); the noisy theorem requires a separate fair-block contraction certificate \((\lambda,\varepsilon,A,\beta,L)\) for the chosen implementation. Without that certificate, OPH retains exact fixed-cutoff convergence and the collar-local splice and record-stability estimates above. With that certificate, arbitrarily long asynchronous noisy repair sequences converge to a controlled observer-facing tube around the exact quotient normal-form set.

Law-Space Selection and Observer Emergence

This section studies a simple meta-selection model on law space. The aim is to formalize one criterion for favoring schedule-stable, observer-supporting, and simple laws; the replicator dynamics below is part of the model, not a claim about literal cosmological dynamics.

We begin by defining what it means for a law to support observers. An observer is treated operationally as a persistent predictive module: a subgraph that maintains a stable record algebra and uses its output law to predict its boundary’s future behavior.

This theorem records the monotonicity property of the meta-selection model.

Connection to Observer-Patch Holography

The formalism above is the computational skeleton of Observer-Patch Holography (OPH). The observer patches carry von Neumann algebras on support-visible holographic cuts. In symmetric regulator charts those cuts may be represented by patches on a screen \(S^2\). The fixed-cutoff microphysics carrier is a federated patch system with echosahedral local interfaces. The \(S^2\) chart supplies cap and collar geometry, and in the companion relativity branch its conformal group supplies the Lorentz bridge. The carrier supplies finite ports, records, and repair interfaces. The overlap projections are restrictions to shared subalgebras, and the consistency condition is algebraic state agreement on overlaps.

The local carrier boundary, finite federation screen, and support \(S^2\) are different typed objects. Identical local Icosahedral carriers can be routed into federation nerves of different topology. A spherical physical branch therefore requires the microphysics paper’s carrier-to-support bridge: full interface-algebra maps, higher-overlap coherence, a quotient-visible spherical nerve, and refinement-natural support data. The consensus theorem neither supplies nor replaces that bridge. The two-carrier reference fixture has no composable seam triangle, so its higher-overlap Čech condition is vacuous. Its seam/hash, phase-to-repair, and structural support checks do not certify a physical federation, a source-bound spherical support, or the \(S^2\) bridge.

The bridge to physics works as follows in the companion papers:

• The patch net becomes a net of support-visible subregion algebras; \(S^2\) is the standard observer-facing support chart, not a required literal material shell. Its quotient-visible topology and conformal data are physical on the spherical branch even though hidden carrier coordinates are not.

• Observer Agreement, Axiom 2, is the naturality condition on the operational meanings attached to accepted data in Definition 1.

• The explicit collar-recovery, exact-Markov, and Markov-split alignment interfaces provide the controlled recovery data used by the gravity branch. The exact collar factorization \(\rho_{ABD} = \bigoplus_\alpha p_\alpha\,\rho^{(\alpha)}_{Ab_L^\alpha}\otimes\rho^{(\alpha)}_{b_R^\alpha D}\) is used only at exact Markovity together with alignment of the HJPW factors with the preselected edge split. Exact Markovity alone yields the normal form only over a state-dependent split. The alternative route uses the fixed-collar replacement limit with EC-aligned comparison states, while the declared Petz/Fawzi–Renner recovery channels supply recovered comparison states from which the local repair moves are built (see Appendix 15 and Definition 111).

• Gauge symmetry as implementation hiding (Theorem 43) becomes the fixed-cutoff edge-sector seed package. On the Standard Model gauge paper’s branch carrying the explicit compact-gauge refinement receipt, coherent surjective pullback functors and compatible forgetful fibers reconstruct a compact group from the tensor-generated combined-zero-obstruction sectors. Here zero obstruction means central or higher-associator strictifiability together with at least one allowed strict \(1\)-cocycle representative having trivial represented holonomy. This supplies receipt-conditional transport across cutoffs and classification. Separately, complete reversible response and endogenous overlap transport force the local Standard Model gauge Lie algebra. Incidence and target-blind port readback derive the signed response. Under the conditional matrix current and declared fermionic Spin category, anomaly-forced determinant balance and exhaustive tensor descent imply the exact hypercharge lattice, \(N_c=3\), a common \(\mathbb Z_6\) kernel, and the maximal faithful matter image from those premises alone. On this branch, the CKM and weak-sector clauses give the window \(3\le N_g\le5\). Separate complete-band and cost-order premises select rank three. Physical family identification and extra-sector exclusion require additional maps. The construction does not source-select the matrix current, matter action, or physical global quotient and does not identify laboratory current or flux, equality with the independently reconstructed Tannaka current, four-dimensional topological normalization, or scalar multiplicity. The selected rank-three response and declared generation table give a conditional rank-\(45\) candidate. Chirality and the diagonal \(\mathbb Z_6\) action are table properties. A separate finite local-domain receipt checks the declared operator \(D_\sigma\otimes I_{45}\) and conditional gap inheritance without source-selecting the matter action or transporting the twelve-port Spin packet to that domain. It supplies no physical matter-pole identification, continuum Spin/locality limit, physical seam selection, refinement persistence, or laboratory attachment.

• On the declared support-visible compact-gauge branch, the Standard Model gauge paper obtains the four-dimensional Euclidean Yang–Mills form from compact-gauge holonomy data and the local MaxEnt/Gibbs continuum limit only with the branch’s renormalized four-dimensional identification receipt. The Standard Model gauge paper separately proves projective weak-* / GNS extraction from its finite cylinder system. On a finite support quotient, weighted resampling inside observation fibers is the orthogonal conditional-expectation projector. A concrete active repair kernel qualifies only when its independently extracted transition matrix satisfies the support, equal-fiber-row, and weighted detailed-balance receipt of Ref. [source]; constructing the tested matrix from the target projector formula is not a verification. Identification with Euclidean transfer, vacuum persistence, OS reconstruction, noncollapse, and passage of the uniform repair gap require their separately named finite and continuum receipts. On that certified branch the Yang–Mills gap equals the repair gap; coherent cylinder extraction alone does not make that identification or supply a Clay-admissible theory.

• The coarse-graining compatibility theorem (Theorem 71) is the link between the finite reconciliation protocol and the refinement/RG language used by the OPH branches: the macroscopic law space is stable when the selected coarse-graining channel shadows the normal-form and obstruction maps with controlled defects.

• Stable defects (Corollary 40) become the topologically protected excitations identified with particles on the declared branch.

• The record-algebra theorem (Theorem 74) provides the formal basis for the fixed-cutoff observation layer, where records are carried by central or quantitatively stable approximately commuting projectors in overlap centers.

The companion manuscripts develop a derived gravity branch from entanglement equilibrium and modular geometry, the exact finite Standard Model gauge implication under explicit response and matter contracts with a distinct conditional Tannaka reconstruction route, the declared completions for generation count and extra light sectors, a conditional support-visible compact-gauge Yang–Mills form and repair-gap theorem under the separately named continuum-identification, transfer, OS/noncollapse, and uniform-gap receipts, and a controlled large-\(N_{\mathrm{edge}}\) worldsheet effective-description branch above the heat-kernel edge-sector identity. The cosmological capacity branch defines direct readback by the correctable code of reachable public records, \(M_0(q)=\alpha(G_q)\). A source-derived fixed-cutoff simulator packet at \(D=24\) scalarizes its complete declared terminal fiber and supplies reversible extension/refinement receipts inside its declared source category. When the whole capacity-indexed terminal fiber scalarizes, \(M_0(\mathfrak U_N)=\widehat F_{r,0}(e^N)\) and the universe-level equation is \(N=\log M_0(\mathfrak U_N)\); its stable finite form is \(\mathfrak F_{r,0}(D_\star)=\{D_\star\}\). A target-clean all-rung counterfamily has incompatible exact fixed sets under shared base agreement, positivity, the carrier bound, and executable finite controls. This proves nonidentifiability for the bounded completion class. Universal all-rung membership in the complete A1–A3 capacity-source contract and an executable-to-Lean bridge are absent. The incomplete source antecedent does not determine \(N\), and no theorem extends the bounded nonidentifiability result to the complete source class. A direct positive theorem would require a complete source antecedent, one physical zero, the physical-universe carrier attachment, the horizon–record identification, and the common screen/electroweak load-carrier identification. These inputs are not supplied by the consensus theorem.

This paper provides the finite patch-net foundation for the companion constructions.

Discussion and Scope Boundaries

The fixed-point consensus spine of OPH consists of a total, idempotent, boundary-preserving quotient repair operator on the declared finite branch; schedule-independent normal forms from fixed initial quotient states; boundary-conditioned uniqueness when a preserved boundary/sector fiber has a unique consistent extension; a finite layered carrier proving \(H_B\wedge H_{\mathrm{fib}}\); nontrivial functional selected-fiber branch elimination; holonomy obstructions; gauge-quotient invariance, separated cofinal refinement-limit consensus classes, controlled coarse-graining compatibility, the fixed-cutoff operator-record theorem, distributed one-universe realization for admissible worker presentations of a single global carrier, and conditional noisy fair-block convergence once a separate contraction certificate is supplied. For the repository’s canonical single-site attempt semantics, every adaptive run is eventually constant. Pathwise weak fairness is the exact additional condition used here to exclude a reducible constant tail; work conservation is stronger and is used only for the initial-mismatch horizon. Completeness and confluence remain separate requirements for one consistent canonical public endpoint. It also proves the full repair-completeness, Petz-domain, and quotient-compatibility package on the rooted-tree packet-net domain of Theorem 20, and gives a clean law-selection meta-model. Separate companion constructions give the relativity chain, the realized Standard Model structural chain, and the capacity relation with universe-level equation \(N=\log M_0(\mathfrak U_N)\), stable whole-fiber target \(\mathfrak F_{r,0}(D_\star)=\{D_\star\}\), and an independent EW/Higgs comparison bridge. Phenomenological conclusions require assumptions not supplied by the consensus theorems.

Under the unified carrier hypothesis, consensus turns a routed, self-reading carrier federation into a quotient-visible normal form. Separate maps read support geometry and compact charge response from that normal form. Confluence does not create either readout. Their physical composition requires one source manifest and refinement tower so that geometry, current, records, and clocks refer to the same system rather than to isomorphic fixtures assembled after the fact.

Complexity boundary.

On a fixed finite patch net, the accepted reconciliation dynamics is a finite-state asynchronous rewrite system on \(\Sigma\). Under Theorem 31, every accepted repair run has at most the number of distinct reachable \(\mu\)-values below its start value minus one, because each accepted transaction strictly lowers the declared exact measure. On the scalar \(\Phi\)-branch this specializes to the \(|\Phi(\Sigma)|-1\le |\Sigma|-1\) bound. Exact normal-form computation is therefore decidable by direct iteration of accepted aggregate transactions. This step bound counts accepted nontrivial repairs rather than scheduler attempts, which may stutter. Theorem 26 separately shows eventual constancy for every canonical adaptive attempt stream and normality under pathwise weak fairness. Theorem 27 shows that no single mismatch-only finite attempt horizon uniformly bounds all normalizing schedulers; bounded waste supplies the \((q+1)\)-scaled upper horizon, with exact sharpness at \(q=0\), and Corollary 34 consumes a sufficient budget. The schedule-independent answer depends on the atomic conflict-component local diamond and repair-completeness clauses of Theorem 31. What this paper does not prove is a uniform polynomial-time bound, a sharper complexity-class placement for families of growing patch nets, or any hardness lower bound.

Approximate-stability boundary.

The theorem-grade consensus statement is exact on the declared fixed-cutoff branch. Approximate control begins collar-locally: Theorem 98 gives the exact-Markov modulus \(\delta^{\mathrm M}_{A:B:D}(\varepsilon)\to0\) on one fixed finite-dimensional collar model and the one-shot recovery comparison bound \(2\sqrt{1-e^{-\varepsilon}}\le 2\sqrt{\varepsilon}\), while Theorem 74 gives the \((\varepsilon,\delta_{\mathrm{rec}})\) repeated-read stability bound for approximate record projectors. The long-run noisy statement is conditional: Theorem 90 upgrades those local noisy controls to a global expected tube around the exact quotient normal-form set only after a fair-block contraction certificate \((\lambda,\varepsilon,A,\beta,L)\) is supplied for the chosen implementation. It does not follow from finite descent or fairness alone, and it gives a unique approximate readout only inside singleton boundary/sector fibers. Ref. [source] supplies a complementary receipt-only endpoint estimate from a residual error-bound modulus and an inverse-observation modulus, together with refinement comparison bounds. Those results do not manufacture the fair-block contraction used here and do not imply pathwise long-run confinement under persistent noise.

Expressive-power boundary.

The law-selection model of Theorem 97 is a finite-candidate monotonicity result. For each fixed patch net the theorem package proves a finite-state exact reconciliation mechanism. The computation modules separate three exact results. The historical theorem constructs an input-specialized federation and one ordered sweep; its weak RepairStep permits stutter and remains a straight-line satisfiability precursor. The fixed-federation continuation instead uses the generated formula nodes, which are independent of the input, and reads immutable input ports from the initial state. Its canonical accepted step performs the selected failing node’s declared write. A superincreasing dependency rank strictly descends on every genuine step; arbitrary attempts stabilize, and pathwise weak fairness promotes the stable state to consensus. Same-input normal endpoints have one output. A one-member fair-stuttering control shows why the historical weak relation itself cannot support that conclusion. The execution continuation makes the remaining mathematical scheduler and cost boundary exact. Tail-relative pathwise weak fairness is equivalent to eventual stable consensus on a fixed run; the reverse is vacuous after stable consensus and supplies no recurrence. Member and register-site recurrence coincide at the generated-node granularity because output registers are unique, while an actual stable-consensus schedule proves recurrence remains strictly stronger than tail fairness. A state-blind round-robin function is recurrent, pathwise weak-fair, and bounded-waste, so at least one explicit mathematical scheduler reaches the correct same-input output. Its first \(n\) attempts are exactly the emission-order compiler sweep, the order in which the compiler emits nodes, so this explicit scheduler reaches stable consensus and the correct output within \(n\) attempts for \(n\) emitted nodes.

The actual go compiler has at most one downstream consumer per generated register. Linear defect weights therefore bound every canonical accepted path by \(n(n+1)/2\) for \(n\) emitted nodes. A recursively nested NAND family from that compiler has a consensus-reaching path with \(8m+1=n^2+8n\), making the same-metric classification order-sharp \(\Theta(n^2)\), not constant-sharp. Well-formedness alone admits fewer than \(2^n\) accepted steps and an explicit fanout chain attains \(2^n-1\), so the single-consumer structure is load-bearing for the quadratic bound. Arbitrarily long finite stuttering prefixes remain pathwise weak-fair, so weak fairness gives no uniform attempt horizon. A separately supplied fixed-node bounded-waste value \(q\) gives a stable horizon of \((q+1)n(n+1)/2\); round robin supplies \(q=n-1\). The bounded-waste counting proof is shared with the adaptive route through a neutral ranked-attempt theorem, while the two domain adapters and scientific claims remain distinct. The general bounded-waste formula is deliberately retained for other schedulers; the direct one-cycle theorem is the sharper linear bound for emission-order round robin. Separately, a width-five permutation word program is fixed independently of the input and evaluates the formula under the stated encoding; the formal carrier is the ambient permutation group on five points, and membership of every instruction in the alternating subgroup is not a typed theorem. These results establish a fixed finite repair device with accepted nontrivial repairs and fair asynchronous convergence. They prove a mathematical round-robin function and conditional attempt counts, but no physical scheduler source, wall-clock horizon, rate, energy, bandwidth, fee, hardware resource, noise stability, physical device realization, finite PublicWorld, or identity with the width-five engine.

Refinement and observable boundaries.

Theorem 71 gives an abstract reconciliation square under coarse-graining once its normal-form and obstruction defects are supplied. Model-specific or uniform bounds for \(\varepsilon^n_{sr}\) and \(\varepsilon^h_{sr}\) are not derived from concrete coarse-graining channels and recovery decoders. The fixed-cutoff defect hierarchy extends from abelian frustrations to crossed-module classes \(q\in\check H^2(N,H\to G)\), without an identification theorem relating those classes to the refinement-stable transportable sector category. Theorem 57 applies when microscopic representatives differ by gauge relabelings globally or by sector or higher-gauge relabelings on the same declared quotient-local glued state. It does not cover approximate union-collar compatibility or a physical observable algebra that changes under refinement.

Distributed and noisy implementations.

Theorem 84 proves worker-presentation invariance only when the implementation supplies one global carrier, authoritative ownership, cut interfaces, projection-preserving events, rollback roots, and final monolithic normal-form and readout certificates. Shard-local seeds, missing cut artifacts, stale manifests, synthetic seam trajectories, or worker-identifier histories do not certify a one-universe realization. Theorems 98 and 74 give collar-local perturbative controls, while the rooted-tree packet domain gives an exact finite repair package on one nontrivial domain. Theorem 90 gives long-run noisy control only under a fair-block contraction certificate. Arbitrary approximate recovery moves do not inherit repair completeness, transactional validation, a quotient local diamond, the support/completely-positive trace-preserving clause on every Petz branch, or fair-block contraction.

Universality and applications.

The fixed computation-federation theorem gives one finite generated-node repair device for every input of a selected Boolean function, with ranked accepted-step termination and fairness-qualified attempt convergence. It is not an encoding-overhead, rate, hardware, or physical uniform-simulation theorem, and it does not make the historical weak step convergent. The separate fixed width-five word-program result remains a different engine. The fixed-point theorem classifies quotient normal forms and obstructions once a physical quotient and repair law are declared. It does not select a Hall sector, material order, confinement regime, nuclear yield, or hardware performance number without a quotient-intrinsic ensemble, source action, repair ledger, and evidence receipts.

Gravity and gauge interfaces.

The support-visible Bisognano–Wichmann scaling theorem on the geometric cap subnet supplies the gravity interface. The finite-state and refinement-consensus results supply its consensus input. The finite-quotient baryogenesis theorem uses the same input to define an oriented repair current and proves that quotient settlement with an oriented register selects no charge-parity sign. The natural \(\mathbb Z_6\) gauge/deck attachment has zero electroweak anomaly coefficient. A nonzero baryogenesis result, dark-sector model, spectroscopy result, or string/worldsheet construction requires separate physical inputs. These are interfaces rather than extra consensus premises.

Assumption-Dependent BFT and QECC Extensions

The consensus formalism of OPH has natural analogies to classical and quantum distributed Byzantine agreement. Observer patches correspond to protocol nodes, overlap repair corresponds to a quorum vote, and the repair fixed-point corresponds to a consensus state. Under explicit structural assumptions (partial synchrony with an effective phase bound, one-value-per-view and monotone-view participation, finalisation only on a valid prepared-backed decision certificate, authenticated prepared-certificate locks, highest-certificate new-view selection, post-stabilisation nonfaulty proposal/prepare/commit/relay progress, and quorum overlap: either the classical exact sizing \(n=3f+1,q=2f+1\) or a general threshold \(q\) with \(2q\ge n+f+1\); liveness additionally requires \(q\le n-f\)), a QBFT-style interpretation of OPH repair satisfies safety and liveness (Appendix 17, Theorem 110). On the fixed-cutoff collar branch used here, the repair map is written in exact-splice / Petz form; the assumption-dependent item is the CPTP property on all inputs, which requires either full-rank \(\mathcal{N}(\sigma)\) or an explicit domain restriction, and trace-preserving completion is not automatic when \(\mathcal{N}(\sigma)\) has a non-trivial kernel (Proposition 113). A quantum error-correcting interpretation is possible only after a genuine code subspace, logical dictionary, error family, and recovery map are supplied. The graph-min-cut equality for distance is not a property of a bare overlap graph: the same graph can realize distance \(1\) or distance \(|V|\) under different interface maps (Theorem 118). Distance/min-cut statements require the topological-code certificate of Definition 119 and Theorem 120; resilience requires the Knill–Laflamme certificate of Theorem 122. All of these extensions are assumption-dependent or conjectural and are not part of the core theorem package of Paper 4.

Quantum/Algebraic Lift: Markov-Collar Splice Theorem

This appendix records the algebraic splice statement relating the finite patch-net model to the OPH collar formalism.

For this collar lemma, write the support-local algebra-state-record reduct of an observer patch as \[O_{\mathrm{red}}=(P,\mathcal{A}(P),\rho,R),\] where \(P\) is the support-screen patch, \(\mathcal{A}(P)\) the local von Neumann algebra, \(\rho\) the local state, and \(R\) the record algebra. The full operational observer also carries overlap interface algebras and restriction maps, allowed update and repair instruments, and checkpoint data used for continuation.

This appendix therefore uses exact splice identities in only two regimes: literal EC-aligned exact Markovity, or a controlled collar family on one fixed finite-dimensional model for which the separately declared \(\delta^{\mathrm{M,EC}}_{\mathcal F;A:B:D}(\varepsilon)\to0\). Fawzi–Renner recovery supplies the constructive recovered comparison state; the generic fixed-collar modulus supplies only an exact-Markov comparison on a possibly different split. Small one-shot conditional mutual information is not silently upgraded to an EC-aligned normal form.

For later dark-sector continuations, the exact finite identity is only an expectation identity. For a faithful finite state \(\rho_{ABD}\), with \(K_X=-\log\rho_X\), \[\operatorname{Tr}\rho_{ABD}(K_{AB}+K_{BD}-K_B-K_{ABD}) = I_\rho(A:D\mid B).\] This does not identify raw conditional mutual information with a state-independent local stress source. Near a full-rank exact Markov state \(\sigma\), a perturbation \(\rho(t)=\sigma+tX+O(t^2)\) has \[\left.\frac{\mathrm d}{\mathrm d t}I_{\rho(t)}(A:D\mid B)\right|_{t=0}=0,\] while a fixed-reference modular-energy variation is generically linear in \(t\). Recovery bounds therefore do not by themselves prove a local stress-source theorem; source-specific coarse graining, collar localization, cover independence, and finite-model proof receipts are separate continuation data.

Fixed-Cutoff Realization, Quotient Repair, and Edge Centers

This appendix carries the fixed-cutoff realization and edge-center items for the consensus paper. They sharpen the quotient-first repair interpretation used throughout the consensus paper and make the collar boundary data explicit at the same finite patch-net level. On the declared fixed-cutoff collar branch, the local repair step is read from exact Markov splice or a declared Petz/Fawzi–Renner recovery move on that same collar data; the recovery move gives a recovered comparison state, while exact splice requires exact Markovity or a controlled fixed-collar replacement modulus. Representative repair maps are only lifts of the resulting quotient-local update.

Quotient Repair and UV Underdetermination

At fixed cutoff, each regulator cell \(x\) carries a finite-dimensional factor \(\mathfrak h_x\), patch algebras are finite type-I algebras, and gauge-as-gluing is realized as a compact boundary redundancy action on cut data. The physical repair law therefore belongs on the overlap-invariant quotient rather than on hidden representatives. If \(q:\Sigma\to\Sigma/\Gamma\) is the quotient by boundary redundancy and \(\overline T_i\) is the physical quotient update, a representative-level map \(T_i\) is only required to be a lift satisfying \[q\circ T_i=\overline T_i\circ q.\] Hence \[q(T_i(\gamma\cdot s))=q(T_i(s))\] for gauge-equivalent inputs. Quotient descent is therefore structural, while strict representative-level covariance is only implementation bookkeeping. The burden is to prove that the accepted recovery-derived local moves satisfy the stated repair-completeness, support-local disjoint-commutation, nested-collar restriction-compatibility, and Petz-domain control clauses on the declared branch. The touched-overlap acceptance contract yields finite Lyapunov descent and derived termination for accepted moves, while the fixed-cutoff gluing package carries the parenthesization-invariant union-collar state used for the local diamond.

Derived Boundary Data and Ordinary EC

Higher-Gauge Replacement on the Genuinely Noncentral Branch

Assumption-Dependent Distributed-Systems and QECC Extensions of the Consensus Formalism

Support labels.

[Established]

Follows from cited prior work or a complete argument given here.

[Assumption-dependent]

True under additional assumptions not derived from OPH first principles.

[Conjecture]

A plausible open direction, not a settled result.

B.1Theorem 1: QBFT Safety Bound

Assumptions A1–A6.

1. Partial synchrony (DLS). Fixed but initially unknown bounds \(\Delta\) (per-edge message delay) and \(\Phi\) (local processing time) hold after GST. Together with the certified routes of (A4), they supply an effective end-to-end protocol-phase bound \(\Theta\) that includes route length, processing, and the fixed number of message steps in one phase. Pacemaker timeouts eventually exceed the corresponding per-view bound. Safety holds without extra timing assumptions; liveness holds after the Global Stabilisation Time (GST).

2. Byzantine fault model. At most \(f\) observers behave arbitrarily; the remaining \(n-f\) are nonfaulty.

3. Classical exact sizing for this fixed-quorum theorem. \(n = 3f+1\), so that \(q=2f+1\) certificates have a nonfaulty overlap witness. The usual resilience condition \(n\ge 3f+1\) is necessary for the fault model, but when \(n>3f+1\) a fixed \(q=2f+1\) quorum is insufficient for the overlap used in the safety proof; one must either impose (A6) directly or choose a threshold \(q\) with \(2q\ge n+f+1\).

4. Strong quorum connectivity. Every quorum \(Q\) with \(|Q|=q\) is strongly connected within \(G\): for any \(u,v\in Q\) there is a directed path in \(G\) contained entirely in \(Q\). This is strictly stronger than requiring the overlap graph of quorums to be connected, and is needed to propagate signed votes within a quorum.

5. Message authentication. All messages carry unforgeable digital signatures.

6. OPH quorum overlap. Any two quorums \(Q_a, Q_b\) of size \(q\) satisfy \(|Q_a\cap Q_b|\geq f+1\). For \(q=2f+1\) this is guaranteed by the exact sizing \(n=3f+1\) in (A3); for general \(n\) it is the separate threshold condition \(2q\ge n+f+1\), not a consequence of \(n\ge3f+1\) alone. The liveness clause additionally requires \(q\le n-f\), so a certificate can be formed without Byzantine participation.

D. Matscheko’s review of this appendix covers the finite quorum-overlap core and records the same boundary caveat: at fixed \(q=2f+1\), the overlap step is exact-size \(n=3f+1\) logic unless (A6) is imposed separately.

Sizing and scope boundary.

Assumption (A3) is the classical exact-size way to discharge (A6), not an additional independent premise: when \(n=3f+1\) and \(q=2f+1\), the required overlap is automatic. For general \(n\), (A6) must instead be checked directly. The prepared-lock rule proves safety only for the protocol just defined; it is not inferred from the word “QBFT.” On those stated assumptions the theorem gives record permanence: no two nonfaulty observers finalise conflicting patch states. Record permanence enters as a consistency requirement on the observer net, not as an added postulate.

Executable receipt and negative controls.

The finite executable check exhausts all certificate and new-view quorum pairs for \((n,f,q)=(1,0,1),(4,1,3),(6,1,4),(7,2,5)\). The first, second, and fourth are exact-size points; the third checks the general threshold with \(q<n-f\). It checks both the nonfaulty certificate-overlap witness, independent prepare-signer, provisional-acceptor, and committer quorums, the \(q-f\) lower bound on actual nonfaulty commit locks in a decision certificate, and transfer of at least one such lock into every new-view quorum. It also executes the next-view lock transition against every candidate prepare quorum at those parameter points, derives local validator states from lock-certificate delivery and partial commits, constructs the new-view reports, selects the proposal, computes the eligible voters, and determines recovery or deadlock. These traces include an omitted higher orphan lock at the general-threshold point. The receipt also runs finite post-GST proposal/prepare/acceptance/commit/relay traces for every nonfaulty reference leader. The arbitrary-view induction and wall-clock proof remain the mathematical argument above; the receipt is not a general protocol-model checker.

Separate finite traces remove one-vote, monotone-view participation, finalise-only-on-valid-certificate semantics, quorum overlap, the fault bound, authentication, prepared locking, quorum-certified prepared-certificate acceptance and dissemination, provisional pre-certificate acknowledgements, new-view supersession of local partial-commit locks, highest-certificate leader selection, partial synchrony, quorum availability, quorum connectivity, terminating view change, nonfaulty-leader proposal progress, and nonfaulty-validator prepare/commit/relay progress. Validator justification checking has a separate malformed-proof conformance witness; with the retained lock rule it is defence in depth rather than an independent safety premise. The lock-free \(n=4,f=1,q=3\) trace decides \(x\) from \(\{B,N_1,N_2\}\) in view zero and \(y\ne x\) from \(\{B,N_2,N_3\}\) in view one while respecting one-value-per-validator in each individual view.

B.2Theorem 2: Convergence of the OPH Repair Map

B.3Theorem 3: QECC Correspondence

Notation.

\(N=\dim(\mathcal{H})=2^n\) for \(n\) physical qubits. Standard notation: \([[n,k,d]]\) stabilizer code; \(K=2^k\); quantum Singleton bound: \(k\leq n-2(d-1)\).

B.4Theorem 4: Asynchronous Convergence

Why fairness alone does not give a probability-1, spectral, or wall-clock statement.

Standard strong fairness guarantees that every enabled action fires infinitely often along any fair schedule; it does not impose a probability space on schedules, a transfer-operator spectral gap, or a message-delay bound. A convergence statement of the form “converges with probability 1” requires a measure on schedules. Exponential convergence requires the spectral-gap certificate of Theorem 117. Bounded wall-clock liveness requires partial synchrony and quorum assumptions. The FLP impossibility result [source] confirms that fairness is insufficient for bounded-time consensus in a fully asynchronous system.

A commonly used shorthand is insufficient.

1. Finite known bound \(\Delta\) on message delay after GST.

2. Finite bound \(\Phi\) on processing rates.

3. \(f < n/3\).

These three facts alone do not define a protocol that proposes, votes, forms certificates, changes views, or relays a decision. Consequently they do not imply a wall-clock consensus bound.

B.5Extension Boundaries

• A bare OPH overlap graph is a finite constraint-code presentation only. Its graph does not determine code distance, correctable error weight, or min-cut resilience.

• Analytic spectral-gap and full-rank estimates for a chosen stochastic or channel-level BFT/QECC realization are model-specific refinements. They are separate from the finite OPH repair theorem, where the accepted repair law supplies Lyapunov descent directly.

• Long-run noisy approximate consensus is available only on the fair-block contraction branch of Theorem 90: the chosen implementation must certify fair blocks, expected contraction toward the exact quotient normal-form set, and controlled within-block excursions. Fairness alone does not supply that certificate.

• Topological-code distance equals graph min-cut only after a concrete chain complex, boundary condition, logical-operator dictionary, error family, and systole/min-cut identification are supplied for the chosen code realization.

• Communication-complexity bounds require a concrete quantum communication encoding and implementation cost model. They are not consequences of finite normal-form termination alone.

• The core OPH consensus paper supplies observable-level confluence and refinement-limit normal-form/holonomy classes under their declared premises; the BFT/QECC statements above are separate protocol-style extensions.

AI Assistance Disclosure

This research project used research-grade commercial models, including Anthropic’s Fable and OpenAI’s GPT-5.6-Sol, for research support, software development, editing, and synthesis. The authors are responsible for the paper’s claims, methods, and final text.