Paper release: r1577 Released: July 23, 2026

Downstream physical boundary

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 \(A_5\) carrier, 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. The A5 result is a conditional finite recognition criterion, and the W/Z sufficiency stack has no OPH-native pole promotion.

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 downstream physics. On the unified Echosahedral branch, microphysics supplies the candidate carrier, this paper supplies its public normal form, and the compact paper supplies separately gated geometry and current projections.

One carrier stack, three paper surfaces

The microphysics, consensus, and compact SM/GR papers describe one typed construction. The microphysics paper owns the finite carrier and its public interfaces. The consensus paper owns accepted repair and the quotient public normal form. The compact paper owns the conditional maps from that public normal form into support geometry, gravity, compact currents, and matter. A claim may cross from one paper to another only through the exported object and premises named 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 downstream projections of one source

The public normal form has two separately typed projections:

\[ \begin{aligned} \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{MGNS\text{-}1}_r\ \text{independently complete} \end{gathered} \right\}_{\text{same tower}} &\longrightarrow \mathsf{BW/KMS}_r \longrightarrow \mathsf{Lorentz/H^3}_r\\ &\longrightarrow \mathsf{Events}_{3+1,r} \longrightarrow \mathsf{Einstein}_r , \end{aligned} \] \[ \begin{aligned} \mathsf{PublicNormalForm}_r &\xrightarrow{\;\mathsf{port\text{-}response}\;} (\mathsf{A5Carrier}_r,J_r)\\ &\longrightarrow \mathsf{CompactCurrent}_r \longrightarrow \mathsf{SM}_{Q0,r}\\ &\longrightarrow \mathsf{Matter/QFT}_r . \end{aligned} \]

The carrier-to-support leg requires full interface algebra homomorphisms, higher-overlap coherence, spherical incidence, refinement-natural mesh and cross-ratio data, and an independently normalized geometric \(2\pi\)-KMS comparison. It emits the support \(S^2\) and \(\mathsf{FiniteCapBWCertificate}\). The state tower, common-comparison maps, compatible state/vector data, modular controls, and cofinal modulus belong to the independently produced \(\mathsf{MGNS\text{-}1}\) package. The BW theorem consumes both inputs on the same tower. Once the support leg produces a conformal \(S^2\), \(\operatorname{Conf}^+(S^2)\cong\operatorname{SO}^+(3,1)\) and \(H^3=\operatorname{SO}^+(3,1)/\operatorname{SO}(3)\) is exactly three-dimensional. \(H^3\) is the observer-frame fiber. A \(3{+}1\)-dimensional event manifold requires the population/realization, separation, rank-four affine-chart, overlap-cocycle, held-out quadratic-cone, and causal-reachability receipts \(\mathsf{(E1)}\)–\(\mathsf{(E6)}\), together with the \(\mathsf{MI}\)/assembly premise. Operational-clock gluing separately requires observer-readable transitions, event correspondence, affine calibration, cycle identity, and normal-form invariance. The Einstein relation additionally requires the common-domain stress, entropy, vacuum, coupling, scale, and remainder packet. Hidden Cartesian coordinates of a finite carrier are ineligible as support-screen, event, or Lorentz data.

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 source selector derives the twelve unit lines, antipodal pairing, proper \(A_5\) action, and rank-three Gram frame. On a declared charged-double-triplet response representation with four signed nonzero coefficients, an exact finite certificate constructs a full-rank, compact, skew-adjoint, commutator-closed algebra with inner \(A_5\) action and algebraic refinement naturality. The representation, coefficients, and physical refinement maps require source binding before these register and algebra facts become gauge facts. Noncentral action of the five-dimensional block then selects the Standard-Model Lie type from the compact classification. Trace balance, Spin and deck descent, matter selection, exclusion of extra sectors, family attachment, and quantum-field construction remain separate maps.

The compact sector-category and Minimal Admissible Realization route conditionally reconstructs an abstract Standard Model quotient of the same type by a logically independent route. 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/MAR}. \end{array} \]

On those premises the abstract Lie-type agreement is exact. The physical vertical maps and the source identity of the two group actions are open. In the same way, the rank-three face band is a canonical candidate family carrier, while three physical generations require the complex rank-45 attachment and complement-complete refinement receipts. The value \(N_g=3\) in the compact paper is the minimum of the declared economy class, not a consequence of the icosahedral graph alone.

Finite controls and status boundaries

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, geometry/gravity, and gauge/matter are composable branches of one source-bound self-reading carrier tower. Its full quotient-visible architecture can constrain both branches; local icosahedral incidence by itself constrains only the local carrier route. The physical maps that turn those constraints into one inhabited universe are named premises. 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 proves when finite patch repair terminates, when the terminal public state is schedule-independent, how boundary data control uniqueness, and how cycle holonomy records the exact obstruction to global agreement. Its finite results support the stack’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. Physical-clock status 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 70 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/clock closure. Theorem 71 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 112). The same firewall blocks semantic promotion by relabeling: a finite constraint, archive, repair spectrum, or reconstruction threshold remains a finite diagnostic until a source-separated physical bridge supplies the relevant readout, residual ledger, controls, and frozen validation target.

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 27, and Theorems 15 and 29).

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 32). The parity triangle gives the minimal frustrated example, and Theorem 35 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 37, 39, 42, 44, Corollaries 38, 43, 46, and Theorem 52).

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 59).

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 66).

7. Record algebra and stability. On the fixed-cutoff observer-accessible surface, central record projectors carry Born/Lüders measurement directly, and approximate record projectors inherit explicit \((\varepsilon,\delta_{\mathrm{rec}})\) stability bounds on the same event surface (Theorem 69).

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/clock closure. 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 70, Theorem 71, and Remark 72).

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 78 and Corollary 79).

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 84, Corollaries 85–86, and Proposition 87).

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 remain separate conditions stated in Proposition 107. 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 91). 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 .

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.

\[ \boxed{ \mathsf{Cons}_r\Rightarrow\text{quotient normal forms only.} } \] 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. Construction and certification of such a tower are work in progress. That branch is carried by the compact SM/GR 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).

Here objectivity is identified with schedule-independent convergence of the repair dynamics; Theorem 52 sharpens this to schedule-independent convergence of the physical observable algebra even when microscopic representatives are not unique.

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 39 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 \mathrel{=} \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 100 together with Definition 9 supplies the quotient-local compatibility package used to build canonical aggregate payloads. Proposition 27 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 42 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.

Merge boundary.

What is closed here is the fixed-cutoff operator-algebraic observation surface: a central record algebra on the exact readout slice, Born/Lüders measurement 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. The broader export problem asks whether richer branches keep physically relevant pointer surfaces close to one such central record algebra and whether the same control survives refinement and continuation.

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.

Distributed Presentations of One Finite Universe

The implementation closure clause in Definition 70 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 78 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 84.

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. 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/negative controls. Statistical certificates split independent generative batches before preprocessing; 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 87 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 84 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 bridge to physics works as follows in the broader companion corpus:

• 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.

• Overlap Consistency, one of the canonical framework axioms, is the algebraic version of Definition 1.

• The recoverability clause of the canonical Recoverable Generalized Entropy axiom provides controlled collar recovery data. 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 the Markov-split alignment of the HJPW factors with the preselected edge split (the compact paper’s alignment hypothesis; exact Markovity alone yields the normal form only over a state-dependent split), or along 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 105).

• Gauge symmetry as implementation hiding (Theorem 37) becomes the fixed-cutoff edge-sector seed package. On the companion compact 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. The cofinal witness uses the same receipt, and the Minimal Admissible Realization rule (MAR) plus the explicit one-Higgs matter packet conditionally selects the Standard Model quotient \(\mathrm{SU}(3)\times\mathrm{SU}(2)\times\mathrm{U}(1)/\mathbb{Z}_6\), the exact hypercharge lattice, \(N_c=3\), and the economy minimum \(N_g=3\) inside the window \(3\le N_g\le5\). This does not attach the canonical rank-three screen band to three physical families; the complex rank-45 attachment and complement-complete refinement receipts remain separate.

• On the declared support-visible compact-gauge branch, the companion compact 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 compact 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 has that status only when its independently extracted transition matrix satisfies the support, equal-fiber-row, and weighted detailed-balance receipt of Ref. ; 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 66) 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 34) become the topologically protected excitations identified with particles on the declared branch.

• The record-algebra theorem (Theorem 69) 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 SM gauge-group and count closure from edge-sector reconstruction plus the realized MAR branch, 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\}\). Physical-universe attachment, the capacity-indexed family, unique finite-size slack zero, horizon–record identification, and common screen/electroweak load-carrier identification are kept explicitly separate from that recovered-core claim set.

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

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. 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. The relativity chain and the realized Standard Model structural chain are the recovered core. The capacity relation is a separate implemented branch 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. Downstream phenomenology requires additional assumptions beyond the consensus results proved here.

The unified carrier hypothesis assigns this paper one exact role. Consensus turns a routed, self-reading carrier federation into a public quotient normal form. The support-screen producer may then read geometry from that normal form, and the physical-current producer may read compact charge response from it. Neither readout is created by confluence. 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 29, 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 is a termination statement; the schedule-independent answer depends on the atomic conflict-component local diamond and repair-completeness clauses of Theorem 29. 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 92 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 69 gives the \((\varepsilon,\delta_{\mathrm{rec}})\) repeated-read stability bound for approximate record projectors. The long-run noisy statement is conditional: Theorem 84 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.  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 91 is a finite-candidate monotonicity result. For each fixed patch net the theorem package proves a finite-state exact reconciliation mechanism. A universality claim would require an explicit uniform family of patch nets and repair laws that simulates arbitrary circuits or machines with stated encoding overhead and stability under asynchronous schedules. No such theorem is supplied here.

With those boundaries explicit, the consensus-paper boundaries and companion interfaces are:

1. Sharper RG-shadowing estimates. Theorem 66 closes the abstract reconciliation/coarse-graining square once its normal-form and obstruction defects are supplied. The quantitative task is to derive model-specific or uniform bounds for \(\varepsilon^n_{sr}\) and \(\varepsilon^h_{sr}\) from concrete OPH coarse-graining channels and recovery decoders.

2. Defect classification and refinement-limit transportability. The fixed-cutoff hierarchy extends from abelian frustrations to crossed-module classes \(q\in \check H^2(N,H\to G)\). The continuation task is to connect those higher-gauge defect sectors to the refinement-stable transportable sector category used in the broader compact-gauge reconstruction lane.

3. Observable-level confluence beyond the declared fixed-cutoff physical algebra. Theorem 52 closes the fixed-cutoff quantum-lift statement when microscopic representatives differ by gauge relabelings globally or by sector/higher-gauge relabelings on the same declared quotient-local glued state. The continuation question is whether an analogous observable theorem survives on broader refinement-stable branches where the union-collar compatibility is only approximate or where the physical observable algebra itself changes under refinement.

4. Distributed implementation certificates. Theorem 78 proves invariance for a worker presentation only after the implementation supplies one global carrier, authoritative ownership, cut interfaces, projection-preserving events, rollback roots, and final monolithic normal-form/readout certificates. Shard-local seeds, missing cut artifacts, stale manifests, synthetic seam trajectories, or worker-id histories do not certify a one-universe realization.

5. Global approximate-consensus stability. Theorem 92 and Theorem 69 supply the collar-local perturbative controls carried by this paper. The rooted-tree packet domain proves the exact finite repair package on one nontrivial exported domain. Theorem 84 closes the long-run noisy branch only after a fair-block contraction certificate is supplied. No automatic theorem is supplied showing that arbitrary approximate recovery moves on arbitrary packet-closed exported overlap nets are repair-complete, preserve transactional validation, satisfy an independent quotient local diamond, satisfy the support/CPTP clause on every Petz branch used there, and meet that fair-block contraction certificate.

6. Expressive power / universality. The paper supplies no uniform simulation construction, so universality is outside the theorem-grade output.

7. Applied material, plasma, and device branches. 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 for that branch.

8. Interface to the companion gravity/gauge stack. The companion compact paper derives the gravity chain through the support-visible BW scaling theorem on the geometric cap subnet. This consensus paper supplies the finite-state and refinement-consensus spine used by that bridge. The finite-quotient baryogenesis theorem uses that spine to define an oriented repair current, while also proving that quotient settlement and an oriented register select no CP sign. The natural \(\mathbb Z_6\) gauge/deck attachment has zero electroweak anomaly coefficient. A nonzero baryogenesis branch, dark-sector proposals, spectroscopy, and string/worldsheet topics require their own declared physical inputs beyond what this paper proves.

The last item is an interface statement instead of an extra consensus premise. The fixed-point theorems proved here stand on their stated finite and refinement-consensus hypotheses, while companion gravity, gauge, and continuation sectors add their own theorem surfaces and declared inputs.

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, one-vote-per-view, certificate semantics, authentication, 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\)), a QBFT-style interpretation of OPH repair satisfies safety and liveness (Appendix 17, Theorem 104). 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 107). 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 112). Distance/min-cut statements require the topological-code certificate of Definition 113 and Theorem 114; resilience requires the Knill–Laflamme certificate of Theorem 116. 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 \(\delta^{\mathrm M}_{A:B:D}(\varepsilon)\to0\) and EC-aligned replacements exist. Fawzi–Renner recovery supplies the constructive recovered comparison state; the fixed-collar modulus supplies the exact-Markov comparison. Small one-shot conditional mutual information is not silently upgraded to an exact 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}) \mathrel{=} 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\) (message delay) and \(\Phi\) (processing rates). 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.

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.

Cross-view boundary.

Clause (i) is stated for same-view finalisation because the argument below covers exactly that case. Cross-view safety in the IBFT/QBFT protocol family uses an additional prepared-certificate locking property, an explicit (P4) hypothesis under which a nonfaulty node votes in a later view only for a value carried by the highest prepared certificate it has received. (P1)–(P3) alone do not exclude finalisation of conflicting values across views; a cross-view extension of this theorem requires (P4) and its accompanying view-change justification argument. On its stated assumptions, this finalisation 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.

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 111. Bounded wall-clock liveness requires partial synchrony and quorum assumptions. The FLP impossibility result  confirms that fairness is insufficient for bounded-time consensus in a fully asynchronous system.

Additional assumptions for a quantitative bound.

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

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

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

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 84: 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 on their declared theorem surfaces; the BFT/QECC statements above are separate protocol-style extensions.