Information-Theoretic Constraints on Finite-Time Causal Invariance and Pre-Geometric Dimensional Reduction in Discrete Hypergraph Models

Working Paper & Replication Record

Title: Information-Theoretic Constraints on Finite-Time Causal Invariance and Pre-Geometric Dimensional Reduction in Discrete Hypergraph Models
Author: R. Fisher, Principal Investigator (ORCID: 0009-0006-2441-3282)
Affiliation: Braid Dynamics
Date: July 27, 2026 · Version: 1.0.0 (Preprint) · License: Creative Commons Attribution 4.0 (CC BY 4.0)
Classification: Discrete Physics · Quantum Information · General Relativity · Graph Rewriting
Formal Verification: Machine-Checked Lean 4 Proof Suite (leanprover/lean4:v4.33.1, 0 Axioms, 0 Sorry)
Replication Engine: Dual-Mode Python 3.8+ Simulation Engine with 28 Unit and Integration Tests.

📁 Downloadable Publication & Replication Files

File Name	Description	Size	Action
causal-invariance-hypergraphs.pdf	Complete Camera-Ready Manuscript (XeLaTeX)	897 KB	Download PDF ↓
causal-invariance-hypergraphs.md	Full Markdown Source Manuscript	97 KB	Download MD ↓
CausalInvariance.lean	Lean 4 Machine-Checked Formal Kernel (0 Sorry, 0 Axioms)	15 KB	Download Lean ↓
causal-invariance-replication.zip	Complete Replication Bundle (Python Engine, 28 Pytest Tests, Figures, Lean 4 Kernel)	590 KB	Download ZIP ↓

1. Introduction

The emergence of continuous Lorentzian spacetime from a discrete pre-geometric substrate is a central objective of modern quantum gravity programs. Frameworks such as causal dynamical triangulations (CDT) [1] and causal set theory [2] enforce covariance and geometric consistency by constraining the path-integral measure or imposing causal order constraints. In contrast, the Wolfram Model replaces Riemannian geometry with an evolving spatial hypergraph, where physical spacetime and quantum phenomena are posited to emerge as large-scale algorithmic features of asynchronous multiway graph rewriting [3, 4].

Within this framework, causal invariance is introduced as the discrete foundation for general covariance [4]. Informally, causal invariance requires that different sequences of independent local rewriting operations produce isomorphic directed acyclic graphs (DAGs) of causal event dependencies. Under this correspondence, alternative update schedules are interpreted as discrete gauge transformations, playing a role analogous to the choice of lapse and shift functions in the Arnowitt-Deser-Misner (ADM) foliation of general relativity [4, 5].

Table 1: Structural Comparison: Continuous General Relativity vs. Discrete Multiway Rewriting

Feature	Continuous General Relativity	Discrete Multiway Rewriting
Underlying Substrate	Single Lorentzian manifold $(M, g_{\mu\nu})$	Branching multiway tree of distinct hypergraphs
Gauge Symmetries	Diffeomorphism group $\operatorname{Diff}(M)$	Asynchronous update schedules (rewrite orderings)
Coordinate Freedom	Smooth lapse and shift functions	Choice of local substitution sequence
Invariance Domain	Exact, local invariance at all $(t, \mathbf{x})$	Asymptotic confluence only as $t \to \infty$
State Equivalence	Single geometric reality in different charts	Many-to-one coarse-graining across non-isomorphic states

However, the formal mapping between classical general relativity and multiway graph rewriting contains a fundamental structural asymmetry:

1. Single Manifold vs. Branching Ensemble: In general relativity, gauge freedom represents different coordinate descriptions of a single, unique spacetime geometry on a fixed manifold. In contrast, causal invariance in a multiway system operates over a branching ensemble of distinct, non-isomorphic physical configurations. Establishing an invariant classical timeline requires an explicit, many-to-one equivalence mapping across divergent branches—a step with no counterpart in classical relativity.
2. Local Covariance vs. Asymptotic Confluence: General relativity demands local covariance holding smoothly at every localized spacetime point. In the Wolfram Model, path convergence is strictly an asymptotic, infinite-time property. Jonathan Gorard writes [4, pp. 9–10]:

“The paths that one must follow in order to obtain convergence may be arbitrarily long, so although causal invariance necessitates that the causal graphs generated by following every path through the multiway system must eventually become isomorphic, those causal graphs are not guaranteed to be isomorphic after any finite number of update steps. As such, causal invariance is best interpreted as a limiting statement about the global structure of the multiway system.”

Defining coordinate equivalence strictly as an asymptotic post-condition leaves intermediate states unconstrained. For an embedded physical observer restricted to a finite causal diamond, alternative rewriting trajectories do not represent gauge choices; they represent structurally distinguishable physical geometries.

This finite-time coordinate dependence is illustrated by the alternative update schedules in Figure 1, demonstrating how different updating orders produce non-isomorphic spatial topologies over finite timescales.

This paper analyzes the information-theoretic, thermodynamic, and combinatorial bounds governing finite-time hypergraph evolution. We examine whether an embedded observer in a closed, background-independent ontology can reconcile finitely divergent histories into a stable, zero-energy continuum vacuum without perturbing the geometric background.

1.1 Formal Definitions of Finite-Time Invariance and Observer Algebras

To evaluate the mathematical consistency of causal invariance at finite observational timescales, we formalize the relevant equivalence relations across derivation traces and causal posets:

Let $(V, \mathcal{R})$ be an abstract hypergraph rewriting system with initial configuration $s_0$. A chronological derivation trace of discrete length $t \in \mathbb{N}$ is a sequence $\gamma = (s_0 \xrightarrow{r_1} s_1 \xrightarrow{r_2} \dots \xrightarrow{r_t} s_t)$, where each step applies an admissible local substitution rule $r_i \in \mathcal{R}$ matching an active redex in $s_{i-1}$. Let $\mathcal{P}_t(s_0)$ denote the set of all derivation traces of length $t$ originating at $s_0$.

To each trace $\gamma \in \mathcal{P}_t(s_0)$, the sequence of rewrite events $E(\gamma) = \{e_1, \dots, e_t\}$ induces a strict causal dependency poset $\mathcal{C}(\gamma) = (E(\gamma), \prec_\gamma)$, where $e_i \prec_\gamma e_j$ if event $e_j$ consumes hyperedges or boundary elements generated by event $e_i$.

Definition 1 (Finite-Time Causal Invariance at Horizon $t$). An abstract rewriting system $(V, \mathcal{R})$ satisfies Finite-Time Causal Invariance at depth $t$ if for all pairs of chronological derivation traces $\gamma_1, \gamma_2 \in \mathcal{P}_t(s_0)$, their induced causal dependency posets are strictly order-isomorphic:

$$\mathcal{C}(\gamma_1) \cong_{\text{poset}} \mathcal{C}(\gamma_2)$$

where a poset isomorphism is a bijection $f \colon E(\gamma_1) \to E(\gamma_2)$ satisfying $u \prec_{\gamma_1} v \iff f(u) \prec_{\gamma_2} f(v)$.

Definition 2 (Finite-Time Spatial Covariance at Horizon $t$). An abstract rewriting system $(V, \mathcal{R})$ satisfies Finite-Time Spatial Covariance at depth $t$ if for all $\gamma_1, \gamma_2 \in \mathcal{P}_t(s_0)$, their terminal spatial hypergraphs are isomorphic: $G(\gamma_1) \cong G(\gamma_2)$.

Definition 3 (Local Causal Diamond Observer Algebra $\mathcal{A}(\mathcal{D})$). Let $\mathcal{D}$ be a localized causal diamond spanned by a base spacelike hypergraph subregion $\mathcal{A} \subset V(G)$. The operational observable algebra $\mathcal{A}(\mathcal{D})$ consists of all gauge-invariant relational operators (spectral moments $\operatorname{Tr}(A_{\mathcal{A}}^k)$, local cycle counts, and geodesic distances) whose support is strictly confined to $\mathcal{A}$. An embedded observer restricted to $\mathcal{D}$ accesses the reduced density operator $\rho_{\mathcal{A}} = \operatorname{Tr}_{\mathcal{A}^c \otimes \text{branchial}}(\rho_{\text{multiway}})$.

---

2. Logical Independence of Confluence and Causal Invariance

In Abstract Rewriting Systems (ARS), the mathematical foundation of hypergraph substitution systems, the relationship between global confluence (the Church-Rosser property) and causal invariance is frequently conflated. We begin by establishing their formal logical independence.

Let an Abstract Rewriting System be defined as a pair $\mathcal{M} = (A, \rightarrow)$, where $A$ is a set of objects and $\rightarrow \subseteq A \times A$ is a binary transition relation. Let $\rightarrow^*$ denote the reflexive transitive closure of $\rightarrow$.

• Global Confluence: A rewriting system is globally confluent if for all $a, b, c \in A$, if $a \rightarrow^* b$ and $a \rightarrow^* c$, then there exists some $d \in A$ such that $b \rightarrow^* d$ and $c \rightarrow^* d$.
• Causal Invariance: A rewriting system is causal-invariant if, for any initial state $a \in A$, all maximal update paths generate isomorphic directed acyclic graphs of causal event dependencies ($G_1 \cong G_2$), where a DAG isomorphism requires a bijective mapping on event sets $f \colon V(G_1) \simeq V(G_2)$ preserving the causal partial order: $\forall u, v \in V(G_1), \; u \prec_1 v \iff f(u) \prec_2 f(v)$.

Lemma 1. Let $\mathcal{M} = (A, \rightarrow)$ be a terminating abstract rewriting system operating under a fixed, invariant rule set. Then the topological property of global confluence and the structural property of causal invariance are logically independent over $\mathcal{M}$.

Proof. We establish logical independence via two minimal counterexamples under string-rewriting systems, which constitute a formal subset of hypergraph rewriting systems.

Part I: Causal Invariance Without Global Confluence

Let $\mathcal{M}_1$ be a string-rewriting system operating under the rule set:

$$R_1 = \{a \rightarrow b, \quad b \rightarrow d, \quad a \rightarrow c, \quad c \rightarrow e\}$$

with initial configuration $A_{\text{init}} = [a]$. The system generates two distinct maximal pathways:

$$\text{Branch 1:} \quad [a] \xrightarrow{e_1} [b] \xrightarrow{e_2} [d]$$ $$\text{Branch 2:} \quad [a] \xrightarrow{e_1'} [c] \xrightarrow{e_2'} [e]$$

Because the terminal states $[d]$ and $[e]$ are distinct irreducible normal forms ($d \neq e$), they cannot converge to a common state. Thus, $\mathcal{M}_1$ is strictly non-confluent.

However, the causal dependency graph $G_1$ for Branch 1 consists of the 2-event poset $e_1 \prec e_2$, and the causal dependency graph $G_2$ for Branch 2 consists of the 2-event poset $e_1' \prec e_2'$. Defining the explicit bijection $f(e_1) = e_1'$ and $f(e_2) = e_2'$ establishes an exact order-preserving DAG isomorphism ($G_1 \cong G_2$). Thus, the system satisfies causal invariance. Therefore, causal invariance does not imply global confluence.

Part II: Global Confluence Without Causal Invariance

Let $\mathcal{M}_2$ be a string-rewriting system operating under the rule set:

$$R_2 = \{a \rightarrow b, \quad a \rightarrow c, \quad b \rightarrow d, \quad c \rightarrow x, \quad x \rightarrow d\}$$

with initial configuration $A_{\text{init}} = [a]$. The system admits two primary pathways:

$$\text{Branch 1:} \quad [a] \xrightarrow{e_1} [b] \xrightarrow{e_2} [d]$$ $$\text{Branch 2:} \quad [a] \xrightarrow{e_1'} [c] \xrightarrow{e_2'} [x] \xrightarrow{e_3'} [d]$$

All pathways terminate at the unique normal form $[d]$, proving global confluence.

Constructing the causal dependency graphs:

• Branch 1 yields a two-node causal chain $G_1 = (E_{a \rightarrow b} \prec E_{b \rightarrow d})$ with $|V(G_1)| = 2$.
• Branch 2 yields a three-node causal chain $G_2 = (E_{a \rightarrow c} \prec E_{c \rightarrow x} \prec E_{x \rightarrow d})$ with $|V(G_2)| = 3$.

Because no bijective mapping can exist between a 2-element event set and a 3-element event set, the causal graphs are fundamentally non-isomorphic ($G_1 \not\cong G_2$). Thus, $\mathcal{M}_2$ is confluent but not causal-invariant.

Part III: Formal Closure

Because $\mathcal{M}_1$ isolates causal invariance without confluence, and $\mathcal{M}_2$ isolates confluence without causal invariance, the two properties are logically independent over terminating rewriting systems. $\square$

2.1 Formal Verification in Lean 4

To eliminate ambiguity in the definitions of confluence and causal invariance, Lemma 1 has been formalized and verified in the Lean 4 interactive theorem prover. The formal kernel—including the inductive definition of reflexive transitive closure (RTC), derivation traces (Trace), the formal predicates for confluence (IsConfluent), normal forms (IsNormalForm), strong normalization (IsStronglyNormalizing), causal DAG structures (CausalDAG), and order-preserving DAG isomorphisms (CausalDAGIsomorphism, AreIsomorphicDAGs), along with the constructive proofs for Theorems 1.1 and 1.2 over counterexample systems $\mathcal{M}_1$ and $\mathcal{M}_2$—is provided in Appendix A.

In our formalization, causal DAG isomorphism is evaluated over unlabelled causal dependency posets $(E, \prec)$, which represents the minimal, weakest criterion for relational equivalence. In hypergraph substitution systems, rewrite events carry specific boundary hyperedge input/output labels. Because adding event-type or boundary-label equality constraints strictly restricts the set of admissible isomorphisms, any rewriting system exhibiting DAG non-isomorphism at the unlabelled poset level is guaranteed to remain non-isomorphic under any labeled refinement.

This formal decoupling demonstrates that within discrete graph rewriting, global confluence does not guarantee causal invariance, nor does causal invariance guarantee unique terminal state convergence [6]. Path uniqueness is not an automatic consequence of graph dynamics; it requires explicit, separate axiomatic enforcement.

---

3. The "Wait-and-Fix" Locality Dilemma and Scheduler Artifacts

Beyond ARS logical independence, physical implementation of causal invariance on a discrete hypergraph encounters kinematic and relativistic constraints.

3.1 The "Wait-and-Fix" Locality Dilemma

Let the spatial hypergraph at time step $t$ be denoted by $G_t = (V, E)$. Suppose two independent, asynchronous rewrite events occur at spatial locations $x_1, x_2 \in V$ separated by a graph geodesic distance:

$$D = d_G(x_1, x_2) \gg 1$$

Because the updates occur at spatially separated locations without a centralized global coordinator, the local hypergraph geometries diverge along independent multiway branches $\Gamma_1$ and $\Gamma_2$.

To preserve causal invariance, these two divergent branches must eventually reconverge to an isomorphic downstream state $G_{\text{target}}$. Information propagation across the hypergraph is strictly bounded by the maximum rewrite propagation speed, which defines the model's emergent speed of light $c_{\text{emergent}}$:

• Under serial execution (one replacement applied globally per step), physical propagation speed is volume-dependent ($c \propto 1/|V|$), breaking continuum Lorentz invariance.
• Under maximally parallel execution, signal propagation is bounded by the substitution rule diameter $\Delta x \le \operatorname{diam}(H_1) + \operatorname{diam}(H_2)$ edges per causal layer.

For the rewriting rules at $x_1$ to steer the local topology to compensate for the divergence at $x_2$, a causal signal must propagate across the graph distance $D$. While overlapping local rewrite sites (critical pairs) in terminating finite sub-derivations can be resolved via local confluence (Newman's Lemma), physical cosmological models are non-terminating ($t \to \infty$). For non-terminating systems, local confluence does not imply global confluence. Spatially disjoint redexes with $d_G(x_1, x_2) \gg 1$ generate independent downstream cascade branches whose global confluence path length scales as $\mathcal{O}(D)$. Under any execution semantics, this generates a kinematic trilemma:

1. Superluminal Coordination: Reconciling the branches within a finite timescale $\Delta t < D / c_{\text{emergent}}$ requires non-local coordination across spatial hyperedges, violating relativistic locality and the model's own emergent light cone.

2. The "Wait-and-Fix" Delay: Reconciling the branches locally requires an observational delay of at least:

   $$\tau_{\text{reconcile}} \ge \frac{D}{c_{\text{emergent}}}$$

   During this finite interval $\tau_{\text{reconcile}}$, the local metric and curvature tensors on Branch 1 and Branch 2 are physically and structurally distinguishable. Observers within this domain do not experience coordinate gauge equivalence; they experience distinct physical spacetimes.

3. Exponential Branchial Proliferation: If the rate of independent local rewrite events across the spatial volume exceeds the reconciliation rate ($\Gamma_{\text{branch}} > \tau_{\text{reconcile}}^{-1}$), the multiway system branches exponentially, permanently preventing path convergence.

3.2 The Scheduler Artifact and Vacuum Asymmetry

To execute a discrete replacement rule on a hypergraph, any asynchronous computational process must employ an update scheduler to identify matching subgraphs and sequence substitutions [4]. Gorard asserts that asymptotic confluence erases the scheduler's path history, rendering the choice of updater unobservable [4].

However, this erasure is exact only at the infinite asymptotic horizon ($t \to \infty$). On any finite physical timescale, the sequential updater leaves permanent structural asymmetries in the underlying network:

This desynchronization mechanism is illustrated schematically in Figure 2.

In general relativity, a region of space that is evacuated of matter returns to a unique vacuum solution (e.g., Minkowski or Schwarzschild, depending on global boundary conditions and conserved charges, governed by Birkhoff's theorem). In discrete hypergraphs, regions undergoing intense local computation accumulate intermediate edge rewrites. Lacking a global clock to normalize graph growth, the evacuated region retains persistent topological deficits, violating diffeomorphism invariance and the equivalence principle over finite timescales. Unlike Lattice Gauge Theory or Causal Dynamical Triangulations (CDT)—where continuum Lorentz symmetry is recovered in the infrared via a path-integral action $e^{-S}$ tuned to a second-order critical point—asynchronous graph rewriting possesses no Hamiltonian action, partition function, or restoring potential. Consequently, local scheduler desynchronizations are secularly cumulative rather than mean-zero Gaussian fluctuations.

3.3 Post-Hoc DAG Assumption vs. Directed Causal Cycles

In Definition 4 of Ref. [4], the causal graph is defined as a Directed Acyclic Graph (DAG) by fiat. However, in an asynchronous rewriting system without global time synchronization, directed cycles (closed timelike curves) can emerge in unconstrained rule spaces whenever local substitutions produce cyclic state recurrence:

$$E_1 \longrightarrow E_2 \longrightarrow E_3 \longrightarrow E_1$$

If a rewrite sequence generates a closed cycle, event $E_1$ becomes its own ancestor, rendering joint probability distributions and time evolution non-computable. Gorard's assertion that closed timelike curves cannot occur under causal invariance relies on assuming DAG structure at the outset. In an axiomatic discrete spacetime ontology, DAG acyclicity is an externally imposed irreflexivity constraint, not a dynamical consequence of confluence.

---

4. Non-Injectivity and Information Erasure in Closed Ontologies

We now examine the information-theoretic and open-system thermodynamic consequences of asynchronous multiway branching and macrostate coarse-graining.

4.1 Non-Injectivity of Multiway History-to-State Projections

Let $\mathcal{P}_t$ denote the set of all distinct, chronological derivation traces of length $t$ originating from an initial configuration $G_0$. In an asynchronous multiway system, let $\phi_t \colon \mathcal{P}_t \to \Omega_t$ be the operational evaluation map projecting each historical trajectory $\gamma \in \mathcal{P}_t$ to its terminal unlabelled spatial isomorphism class $G \in \Omega_t$.

Whenever multiple distinct historical trajectories $\gamma_1, \gamma_2 \in \mathcal{P}_t$ ($\gamma_1 \neq \gamma_2$) terminate at the identical spatial isomorphism class $G$, the pre-image cardinality satisfies:

$$|\phi_t^{-1}(G)| \ge 2$$

The projection $\phi_t$ is strictly many-to-one (non-injective), as formalized in Theorem 3 of Appendix A. While the complete historical lineage remains formally preserved in the global multiway causal graph $\mathcal{M}$, the active relational spatial geometry at time $t$ retains only the quotiented isomorphism class $G$.

---

4.2 Microscopic Open-System Master Equation and Subsystem Entropy Production

To evaluate the operational density matrix accessible to an embedded physical observer, we formalize the multiway evolution within the bipartite Hilbert space [4]:

$$\mathcal{H}_{\text{multiway}} = \mathcal{H}_{\text{spatial}} \otimes \mathcal{H}_{\text{branchial}}$$

To accommodate generic hypergraph rewriting rules that alter vertex and edge counts, $\mathcal{H}_{\text{spatial}}$ is defined as the direct-sum Fock-graded Hilbert space:

$$\mathcal{H}_{\text{spatial}} = \bigoplus_{N=1}^{\infty} \bigoplus_{E=0}^{\binom{N}{2}} \mathcal{H}_{N, E}, \quad \mathcal{H}_{N, E} = \operatorname{span}\{|G\rangle \colon G \in \Omega_{N, E}\}$$

where $\Omega_{N, E}$ denotes the set of unlabelled graph isomorphism classes on $N$ vertices and $E$ edges (with full state space $\Omega = \bigsqcup_{N,E} \Omega_{N,E}$), endowed with the standard orthonormal inner product $\langle G | G' \rangle = \delta_{GG'}$. The branchial reservoir $\mathcal{H}_{\text{branchial}} = \operatorname{span}\{|\gamma\rangle \colon \gamma \in \mathcal{P}_t\}$ is spanned by the orthonormal basis of distinct chronological derivation pathways of length $t$.

Lemma 2 (Open-System Subsystem Entropy Production). Let the global multiway universe evolve as a pure state $|\Psi\rangle \in \mathcal{H}_{\text{multiway}}$ under any normalized dynamical path measure $P(\gamma)$ ($\sum_{\gamma} P(\gamma) = 1$). Any local physical observer whose measurement operators are restricted to the relational spatial hypergraph ($\mathcal{O} = \mathcal{O}_{\text{spatial}} \otimes \mathbb{I}_{\text{branchial}}$) experiences an effective non-unitary open quantum system governed by a discrete CPTP Kraus map and its continuous Lindblad generator. The resulting macrostate dispersion across non-isomorphic spatial topologies generates positive physical entropy production in the spatial relational network.

Proof.

I. Global Multiway Pure State under Generic Path Measures For any normalized path probability measure $P(\gamma)$ (uniform or non-uniform), the global multiway quantum state across the set $\mathcal{P}_t$ of derivation traces is given by the Schmidt decomposition:

$$|\Psi_t\rangle = \sum_{\gamma \in \mathcal{P}_t} \sqrt{P(\gamma)} |G(\gamma)\rangle \otimes |\gamma\rangle = \sum_{G \in \Omega_t} \sqrt{p(G)} |G\rangle \otimes |\phi_G\rangle$$

where $p(G) = \sum_{\gamma \in \phi_t^{-1}(G)} P(\gamma)$ is the total dynamical probability mass terminating at spatial macrostate $G \in \Omega_t$, and the normalized branchial history states are defined by:

$$|\phi_G\rangle = \frac{1}{\sqrt{p(G)}} \sum_{\gamma \in \phi_t^{-1}(G)} \sqrt{P(\gamma)} |\gamma\rangle$$

Because the historical fiber sets $\phi_t^{-1}(G)$ are mutually disjoint for distinct isomorphism classes $G \neq G'$, the branchial states satisfy exact orthonormality: $\langle \phi_G | \phi_{G'} \rangle = \delta_{GG'}$.

II. The Operational Subsystem Partial Trace An embedded physical observer interacting with local spatial nodes cannot access unobservable alternative branchial histories. The operational state of the spatial universe is obtained by taking the partial trace over the unobservable branchial reservoir $\mathcal{H}_{\text{branchial}}$:

$$\rho_{\text{spatial}} = \operatorname{Tr}_{\text{branchial}}(|\Psi_t\rangle\langle\Psi_t|) = \sum_{G \in \Omega_t} p(G) |G\rangle\langle G|$$

The von Neumann entropy of this reduced spatial density matrix is precisely the classical Shannon macrostate entropy:

$$S(\rho_{\text{spatial}}) = -\operatorname{Tr}(\rho_{\text{spatial}} \log_2 \rho_{\text{spatial}}) = -\sum_{G \in \Omega_t} p(G) \log_2 p(G) = H_{\text{macro}}$$

The quantum mutual information between the spatial geometry and the branchial environment is:

$$I(\text{Spatial} : \text{Branchial}) = S(\rho_{\text{spatial}}) + S(\rho_{\text{branchial}}) - S(|\Psi_t\rangle\langle\Psi_t|) = 2 H_{\text{macro}}$$

III. Microscopic Unitary Dilation and Landauer Entropy Production At the fundamental discrete update scale ($t \to t+1$), multiway evolution is governed by a global entangling unitary operator $U_{\text{tot}}$ acting on the bipartite state space extended with an ancilla redex register $\mathcal{H}_{\text{ancilla}} = \operatorname{span}\{|r\rangle \colon r \in \text{Redex}(G)\}$:

$$U_{\text{tot}} \left(|G\rangle \otimes |\gamma\rangle \otimes |0\rangle_{\text{ancilla}}\right) = \sum_{r \in \text{Redex}(G)} \sqrt{P(r | G)} |G \cdot r\rangle \otimes |\gamma \circ r\rangle \otimes |r\rangle$$

where $P(r | G) = \frac{1}{|\text{Redex}(G)|}$ is the local redex selection probability. This isometric embedding extends canonically to a full unitary operator on $\mathcal{H}_{\text{spatial}} \otimes \mathcal{H}_{\text{branchial}} \otimes \mathcal{H}_{\text{ancilla}}$ by mapping the orthogonal complement of the input subspace to the orthogonal complement of the output subspace. Tracing out the unobservable branchial history and ancilla registers yields the discrete Completely Positive Trace-Preserving (CPTP) quantum channel $\mathcal{E} \colon \mathcal{B}(\mathcal{H}_{\text{spatial}}) \to \mathcal{B}(\mathcal{H}_{\text{spatial}})$:

$$\rho_{t+1} = \mathcal{E}(\rho_t) = \operatorname{Tr}_{\text{branchial, ancilla}}\left( U_{\text{tot}} \left( \rho_t \otimes |0\rangle\langle 0| \right) U_{\text{tot}}^\dagger \right) = \sum_{k} M_k \rho_t M_k^\dagger, \quad \sum_k M_k^\dagger M_k = \mathbb{I}_{\text{spatial}}$$

where the Kraus operators $M_{G, r} = \sqrt{P(r|G)} |G \cdot r\rangle\langle G|$ implement transitions between spatial isomorphism classes.

In an open bipartite system ($|\Psi_t\rangle \in \mathcal{H}_{\text{spatial}} \otimes \mathcal{H}_{\text{branchial}}$), distinct historical derivation pathways $\gamma_1 \neq \gamma_2$ correspond to mutually orthogonal states in the branchial reservoir ($\langle \gamma_1 | \gamma_2 \rangle = 0$). When multiple chronological histories coalesce onto the same spatial graph isomorphism class ($G(\gamma_1) \cong G(\gamma_2)$), microscopic historical path distinction is logically erased. By Landauer's Principle, erasing microscopic path distinctions in an open dissipative channel dissipates physical entropy into the branchial reservoir. The total thermodynamic entropy production across layer $t$ is:

$$\sigma_{\text{tot}}(t) = \Delta S_{\text{system}}(t) + \Delta S_{\text{reservoir}}(t) = H_{\text{process}}(t) - H_{\text{macro}}(t) \equiv \Delta H(t)$$

Because the cumulative branching volume $H_{\text{process}}(t) = \sum_{j=0}^{t-1} \log_2 b_j$ grows super-quadratically as $\Theta(N^2 \log N)$ while the spatial macrostate capacity is strictly bounded by $H_{\text{macro}}(t) \le \mathcal{O}(N^2)$, the total thermodynamic entropy production is strictly positive and monotonically non-decreasing at every layer:

$$\Delta \sigma_{\text{tot}} = \sigma_{\text{tot}}(t+1) - \sigma_{\text{tot}}(t) \ge 0, \quad \forall t$$

IV. Continuous Coarse-Grained Lindblad Generator Over macroscopic observational intervals spanning many discrete updates ($\Delta t \gg 1$), taking the continuous coarse-grained Markovian limit of the CPTP map $\mathcal{E}$ yields the Davies-Lindblad master equation:

$$\frac{d\rho_{\text{spatial}}}{dt} = -i[H_{\text{eff}}, \rho_{\text{spatial}}] + \sum_{k} \left( L_k \rho_{\text{spatial}} L_k^\dagger - \frac{1}{2} \{L_k^\dagger L_k, \rho_{\text{spatial}}\} \right)$$

where the jump operators $L_k$ are the continuous limits of the non-unitary rewrite transitions. Because $[L_k, H_{\text{eff}}] \neq 0$, Spohn's Inequality for dynamical semigroups guarantees continuous non-negative total thermodynamic entropy production:

$$\sigma(\rho_{\text{spatial}}) = -\frac{d}{dt} S_{\text{rel}}(\rho_{\text{spatial}}(t) \parallel \rho_{\text{spatial}}^{\text{eq}}) \ge 0$$

V. Structural Deposition in Closed Ontologies In standard open-system quantum thermodynamics, the generated entropy $\sigma \Delta t$ is exported to an asymptotic infinite-temperature thermal reservoir. However, in a closed pre-geometric ontology (where the hypergraph comprises all existing physical degrees of freedom), there exists no external physical heat sink.

While branchial dispersion has been interpreted as defining the kinematic metric of state space [4], semiclassical general relativity requires that the vacuum state satisfies entanglement equilibrium ($\Delta \langle K \rangle = 0$) on local horizon boundaries. Because unlabelled isomorphism classes possess no canonical background coordinate chart aligning node indices across distinct topologies, this irreversible mixedness $S(\rho_{\text{spatial}}) = H_{\text{macro}} > 0$ is evaluated on gauge-invariant algebraic observables on the graph $C^*$-algebra:

1. Spectral Moments (Closed Loop Distribution): $$\langle \operatorname{Tr}(A^k) \rangle = \operatorname{Tr}(\rho_{\text{spatial}} A^k) = \sum_{G \in \Omega_t} p(G) \operatorname{Tr}(A(G)^k) = \sum_{G \in \Omega_t} p(G) \sum_{i} \lambda_i(G)^k$$
2. Spectral Density Distributions: $$\langle \rho_A(\lambda) \rangle = \sum_{G \in \Omega_t} p(G) \left[ \frac{1}{|V(G)|} \sum_{i=1}^{|V(G)|} \delta(\lambda - \lambda_i(G)) \right]$$
3. Geodesic Volume Profiles: $$\langle V(r) \rangle = \sum_{G \in \Omega_t} p(G) V_G(r)$$

Every asynchronous branching event that disperses probability mass across non-isomorphic topologies permanently injects non-equilibrium statistical mixing into the relational gauge-invariant spectra and metric profile of the network substrate. $\square$

---

5. Combinatorial Atlas and Dimensional Reduction Kinematics

We now evaluate the cosmological dimensional reduction process invoked in discrete hypergraph cosmologies.

5.1 The Cosmological Initial Condition ($K_N$ Substrate)

In Section 3.4 of Ref. [4], Gorard establishes the model's cosmological initial condition:

“We begin by assuming that the initial condition for the universe consists of a spatial hypergraph with an abnormally high vertex connectivity, perhaps corresponding to a complete graph [$K_N$]. As such, the universe starts off with some arbitrarily large number of spatial dimensions (which we can treat as being effectively infinite), but then the asymptotic dimensionality preserving property of the update rules causes the number of spatial dimensions to converge to some finite, fixed value, such as three.”

Rather than treating the multiway graph as an idealized continuous manifold, we analyze its structure as an exact combinatorial phase space.

---

5.2 Kinematic Universality via Lovász Homomorphism Densities

To establish that the super-quadratic branching and fragmentation results are not restricted to monotonic edge-pruning, we extend our analysis to arbitrary local hypergraph replacement rules $r \colon H_1 \to H_2$.

We prove that any local, deterministic substitution rule operating on an initially dense pre-geometric substrate $K_N$ is mathematically bound to the same factorial phase-space explosion, governed by the theory of graph homomorphism densities.

Theorem (Kinematic Universality of Local Substitution on Dense Substrates). Let $G_0 = K_N$ be a dense complete initial hypergraph on $N_0$ vertices, and let $r \colon H_1 \to H_2$ be any local hypergraph substitution rule with $|V(H_1)| = v_1$ vertices and $|E(H_1)| = e_1$ hyperedges ($e_1 \ge 1$). Then:

1. Homomorphism Densities on Quasirandom Substrates: For any local redex $H_1$ matching on a host graph $G$ generated by isotropic local rewriting from $K_{N_0}$, by the Chung-Graham-Wilson Theorem on quasirandom graph limits [12, 13], the homomorphism density satisfies $t(H_1, G) = p(G)^{e_1} \pm \mathcal{O}(\epsilon)$. The number of injective matches $\operatorname{inj}(H_1, G)$ on a host graph with instantaneous vertex count $N(t) = N_0 + t \Delta v$ (where $\Delta v = |V(H_2)| - |V(H_1)|$) and edge density $p(G) = \frac{2|E|}{N(N-1)}$ satisfies:

   $$M_{\text{matches}}(H_1, G) = \frac{t(H_1, G) \cdot N(t)^{v_1} - \mathcal{O}(N(t)^{v_1-1})}{|\operatorname{Aut}(H_1)|} \sim \Theta\left(p^{e_1} N(t)^{v_1}\right)$$

   On the initial substrate $K_{N_0}$ ($p=1$), the exact initial branching factor is $b_0 = \binom{N_0}{v_1} \frac{v_1!}{|\operatorname{Aut}(H_1)|} \sim \Theta(N_0^{v_1})$. For vertex-generating rules ($\Delta v \ge 0$, such as the Wolfram 2-in 4-out expansion rule where $\Delta v = +1$), $N(t) \ge N_0$ uniformly, accelerating phase-space branching beyond the fixed-$N$ baseline.

2. Over the dense-to-intermediate dimensional reduction regime ($p(t) \gg N_0^{-1/e_1}$), which spans the dominant $\Theta(N_0^2)$ steps of edge contraction, the cumulative trajectory phase-space volume is lower-bounded by:

   $$H_{\text{process}} = \sum_{t=0}^{L-1} \log_2 b_t \ge \sum_{t=0}^{L-1} \log_2\left[ \Theta\left(\left(1 - \frac{t}{E_0}\right)^{e_1} N_0^{v_1}\right) \right] \sim \Theta(N_0^2 \log N_0)$$

   In the late sparse regime ($p \sim \mathcal{O}(1/N_0)$), graph convergence transitions to Benjamini-Schramm / graphing limits, where local subcritical percolation governs topology.

3. Under both the canonical multiway Markov path measure $P(\gamma) = \prod_{t=0}^{L-1} b(G_t)^{-1}$ and the unweighted uniform path measure $P(\gamma) = 1/M$, uncoordinated local contractions ($e_2 < e_1$) cross the percolation threshold $p_c = \frac{\log N}{N}$. Because early fragmented topologies admit fewer downstream matches ($b(G_t) \ll b_{\text{connected}}$), their reciprocal transition weights $b(G_t)^{-1}$ are strictly higher per step, mathematically accelerating concentration on fragmented topologies:

   $$P(\Gamma_{\text{manifold}}) \le \exp\left(-\mu N_0\right) \xrightarrow{N_0 \to \infty} 0$$

Proof.

1. Homomorphism Density Expansion: In Lovász's theory of dense graph limits, the homomorphism density $t(H, G)$ measures the probability that a random map $V(H) \to V(G)$ is a graph homomorphism. For a complete substrate $K_{N_0}$, $t(H_1, K_{N_0}) = 1 - \mathcal{O}(1/N_0)$. Multiplying by $N(t)^{v_1}$ and quotienting by the automorphism group $|\operatorname{Aut}(H_1)|$ yields $M_{\text{matches}} = \binom{N(t)}{v_1} \frac{v_1!}{|\operatorname{Aut}(H_1)|} \sim \Theta(N(t)^{v_1}) \ge \Theta(N_0^{v_1})$.
2. Path Volume Integration: At step $t$, after modifying $t \cdot \Delta e$ edges, the instantaneous edge density is $p_t = 1 - \frac{t \Delta e}{E_0}$. The available matching count satisfies $b_t \ge \frac{p_t^{e_1} N_0^{v_1}}{|\operatorname{Aut}(H_1)|}$. The dense homomorphism limit holds across the entire interval where $p_t \gg N_0^{-1/e_1}$, which accounts for $L - \mathcal{O}(N_0^{2 - 1/e_1}) = \Theta(N_0^2)$ steps. Integrating $\log_2(b_t)$ over $L = \Theta(N_0^2)$ steps yields: $$\sum_{t=0}^{L-1} \log_2 b_t \ge L v_1 \log_2 N_0 + e_1 \sum_{t=0}^{L-1} \log_2\left(1 - \frac{t}{L}\right) - L \log_2 |\operatorname{Aut}(H_1)| = \Theta(N_0^2 \log N_0)$$
3. Percolation Collapse and Measure Acceleration: In the sparse regime ($\langle d \rangle = k \ll N_0$), the local degree distribution under uncoordinated local rewriting converges to a Poisson distribution $\operatorname{P}(\deg(v) = d) = \frac{k^d e^{-k}}{d!}$. The probability that any individual vertex is isolated ($\deg(v) = 0$) is strictly positive: $p_0 = \operatorname{P}(\deg(v) = 0) = e^{-k} > 0$. Because a connected manifold vacuum $G_{\text{vac}}$ requires zero isolated vertices ($\deg(v) \ge 1$ for all $v$), manifold survival is analytically upper-bounded by: $$P(\Gamma_{\text{manifold}}) \le (1 - p_0)^{N_0} = \left(1 - e^{-k}\right)^{N_0} = \exp\left(-\mu_0 N_0\right) \xrightarrow{N_0 \to \infty} 0$$ where the exact analytical rate constant is $\mu_0 = -\ln(1 - e^{-k}) > 0$ (for target degree $k=3$, $\mu_0 = -\ln(1 - e^{-3}) \approx 0.05106 > 0$). Furthermore, under the dynamical Markov measure $P(\gamma) = \prod b(G_t)^{-1}$, fragmented graphs admit fewer downstream matches ($b(G_1 \sqcup G_2) < b(G_{\text{connected}})$), magnifying their reciprocal transition weights $b^{-1}$ and accelerating the decay exponent beyond $\mu_0$. $\square$

---

5.3 Combinatorial Derivation of the Falling Factorial Baseline

The scaling of this trajectory space under dimensional reduction can be bounded analytically. Let the initial edge cardinality of $K_N$ be $E_0 = \frac{1}{2}N(N-1)$, and let the target 3D edge cardinality be bounded by $E_f \le \frac{1}{2}Nk$. If the reduction operated via a fixed sequence of $\Delta E = E_0 - E_f$ deletions, the baseline number of independent chronological pathways is given by the falling factorial:

$$M_{\text{baseline}} = \frac{E_0!}{(E_0 - \Delta E)!} = \frac{E_0!}{E_f!}$$

Evaluating this at $N=8, k=3$ ($E_0 = 28, E_f = 12, \Delta E = 16$) yields:

$$M_{\text{baseline}} = \frac{28!}{12!} = 636,507,987,889,213,440,000 \approx 6.3651 \times 10^{20} \text{ trajectories}$$

corresponding to an analytical baseline process entropy of:

$$H_{\text{process}}^{\text{baseline}} = \log_2(6.3651 \times 10^{20}) \approx 69.1087 \text{ bits}$$

Because the degree-threshold pruning rule is dynamic (pruning an edge drops adjacent vertices below threshold $k$, terminating paths at variable depths), the actual multiway trajectory space accelerates nonlinearly, yielding the computed value of:

$$M = 894,757,885,819,817,073,868,800 \approx 8.9476 \times 10^{23} \text{ paths} \quad (H_{\text{process}} = 79.5658 \text{ bits})$$

Applying Stirling's approximation ($\log_2(n!) \approx n \log_2 n - n \log_2 e$) to the dominant numerator confirms that baseline algorithmic process complexity scales super-quadratically:

$$H_{\text{process}} \ge \log_2\left(\frac{E_0!}{E_f!}\right) \sim \left(\frac{1}{2}N^2\right) \log_2\left(\frac{1}{2}N^2\right) \sim \Theta(N^2 \log N)$$

In contrast, the maximum Shannon capacity of the entire space of unlabeled graphs (OEIS A000088) scales only quadratically:

$$H_{\text{macro}}^{\text{max}} \le \log_2\left(\frac{2^{\binom{N}{2}}}{N!}\right) \sim \binom{N}{2} - N \log_2 N \sim \mathcal{O}(N^2)$$

Thus, the process entropy outscales the state space capacity by a factor of $\log N$ in the exponent:

$$\lim_{N \to \infty} \frac{H_{\text{process}}}{H_{\text{macro}}^{\text{max}}} \sim \log_2(N) \longrightarrow \infty$$

---

5.4 Multi-Scale Numerical Simulation Atlas

To verify these analytical bounds empirically, an exhaustive layer-by-layer multiway state space enumeration was executed up to $N = 8$. Intermediate graph states were canonicalized at each layer boundary via dynamic programming over all $N!$ vertex permutations:

$$\operatorname{CanonicalForm}(G) = \min_{\sigma \in S_N} \sigma(G)$$

While Table 2 provides an exact, exhaustive numerical baseline for monotonic edge contraction, Theorem 5.2 proves that any generic hypergraph substitution rule $H_1 \to H_2$ preserves the same asymptotic branching lower bound $\Theta(N^{v_1})$ and super-quadratic trajectory volume $\Theta(N^2 \log N)$ via Lovász homomorphism densities. The numerical simulation serves as the minimal, exactly solvable instance of this universal phase-space proliferation.

The simulation results across all computed scales are summarized in Table 2.

Table 2: Multi-Scale Multiway Trajectory Evaluation ($k = 3$, $N = 5 \dots 8$)

| Scale ($N$) | Trajectory Paths ($M$) | Classes ($|\Omega|$) | $H_{\text{process}}$ (bits) | $H_{\text{macro}}$ (bits) | $\Delta H$ (bits) | $P(\text{Connected})$ | $P(\text{Regular})$ | Reachability | |:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:| | 5 | 1,620 | 4 | 10.6618 | 1.6416 | 9.0201 | $9.2593 \times 10^{-1}$ | $0.0000$ | 11.76% (4 / 34) | | 6 | 133,797,600 | 29 | 26.9955 | 4.0145 | 22.9809 | $6.3799 \times 10^{-1}$ | $3.7669 \times 10^{-4}$ | 18.59% (29 / 156) | | 7 | $9.4548 \times 10^{14}$ | 102 | 49.7480 | 5.5155 | 44.2326 | $3.5861 \times 10^{-1}$ | $0.0000$ | 9.77% (102 / 1,044) | | 8 | $8.9476 \times 10^{23}$ | 355 | 79.5658 | 6.6960 | 72.8698 | $1.7731 \times 10^{-1}$ | $4.5259 \times 10^{-7}$ | 2.88% (355 / 12,346) |

Table 2b: Multiway Branching Under Wolfram Local Hypergraph Substitution Rules ($K_3, K_4$ Substrates)

Rule Type	Substrate	Step ($t$)	Input States	Multiway Branches ($b_t$)	Child Macrostates
Wolfram 2-in 4-out (Expansion: $\Delta v = +1$)	$K_3$	1	1	3	1
		2	1	15	3
		3	3	114	11
Wolfram 2-in 4-out (Expansion: $\Delta v = +1$)	$K_4$	1	1	12	1
		2	1	156	5
Wolfram 2-in 1-out (Pruning: $\Delta e = -1$)	$K_4$	1	1	12	1
		2	1	60	3
		3	3	72	2

Topological Invariants and Regularity Collapse

• Handshaking Lemma Constraint: Under the Handshaking Lemma ($\sum \deg(v) = 2|E|$), for odd vertex cardinalities evaluated at odd degree ($5 \times 3 = 15$ and $7 \times 3 = 21$), regular graphs are mathematically impossible. Thus, $P(\text{Regular}) = 0$ at $N=5, 7$ is an exact topological invariant.
• Regularity Collapse: Where regular configurations are permitted ($N = 6, 8$), $P(\text{Regular})$ collapses from $3.7669 \times 10^{-4}$ at $N=6$ to $4.5259 \times 10^{-7}$ at $N=8$.
• Global Connectivity Collapse: $P(\text{Connected})$ falls monotonically from 92.59% at $N=5$ to 17.73% at $N=8$.

The scaling of process entropy $H_{\text{process}}$, macrostate entropy $H_{\text{macro}}$, and the Landauer gap $\Delta H$ is illustrated in Figure 3.

Macrostate Distribution and Island Topologies

Sorting the terminal registry by path weight reveals that path volume concentrates on island topologies—graphs consisting of a small connected core and multiple isolated vertices ($\deg(v) = 0$):

Table 3: Dominant Terminal Macrostate Topologies ($N = 8, k = 3$)

Rank	Representation	Degree Sequence	Topological Structure
1	4.41%	[3, 3, 3, 2, 1, 0, 0, 0]	5-node core + 3 isolated vertices
2	4.04%	[3, 3, 3, 2, 1, 1, 1, 0]	7-node core + 1 isolated vertex
3	3.67%	[3, 3, 2, 2, 1, 1, 0, 0]	6-node core + 2 isolated vertices
4	3.19%	[3, 3, 3, 2, 2, 1, 0, 0]	6-node core + 2 isolated vertices
5	2.98%	[3, 3, 2, 2, 2, 1, 1, 0]	7-node core + 1 isolated vertex

The path-frequency distribution across all dominant terminal macrostates is plotted in Figure 4.

---

5.5 The Noether Limit and Algorithmic Description Complexity

In continuous field theories, smooth spacetime configurations are dynamically protected by conservation laws generated by continuous symmetries via Noether's theorem. Discrete hypergraph rewriting models lack continuous Lie groups and microscopic Noether currents.

Consequently, for any local rewriting rule $R$ to restrict its multiway evolution away from the high-entropy fragmented phase space without external intervention, those conservation laws must be explicitly hardcoded into its matching conditions. This establishes a strict impossibility result:

$\text{Low Description Complexity } K(R) \quad \land \quad \text{Local Rule Scope} \quad \land \quad \text{Convergence to 3D Manifold}$

cannot be simultaneously satisfied in a closed pre-geometric ontology.

---

5.6 Computational Scaling Barriers, Cluster Infrastructure, and Cosmological Horizon Limits ($N > 8$)

To contextualize the computational scaling and assess whether deeper scales can be simulated by expanding infrastructure, we evaluate the exact combinatorial complexity requirements across ascending vertex scales ($N = 8 \dots 1000$).

Table 4: Combinatorial Phase-Space Scaling and Computational Infrastructure Requirements ($k = 3$)

| Scale ($N$) | Edges ($E_0$) | Unlabelled Classes ($|\mathcal{G}_N|$) | Baseline Trajectories ($M_{\text{base}}$) | Canonical Cost ($N!$) | Infrastructure & Feasibility | |:---:|:---:|:---:|:---:|:---:|:---| | 8 | 28 | 12,346 | $6.37 \times 10^{20}$ | 40,320 | Workstation (x86-64, 8-core, 64 GB RAM, 3.82 h, exact) | | 10 | 45 | $1.20 \times 10^7$ | $9.14 \times 10^{43}$ | $3.63 \times 10^6$ | Multi-node HPC Cluster (128-core, C++/MPI + Bliss, $\sim$days) | | 12 | 66 | $1.65 \times 10^{11}$ | $8.44 \times 10^{76}$ | $4.79 \times 10^8$ | Distributed Supercomputer ($\ge 1.3$ TB RAM, $\sim$months) | | 16 | 120 | $\sim 1.2 \times 10^{23}$ | $1.09 \times 10^{175}$ | $2.09 \times 10^{13}$ | Exceeds total planetary digital storage ($\sim 10^{21}$ bytes) | | 20 | 190 | $\sim 3.6 \times 10^{41}$ | $2.45 \times 10^{320}$ | $2.43 \times 10^{18}$ | Intractable across all earthly supercomputing clusters | | 50 | 1,225 | $\sim 10^{300}$ | $\sim 10^{3400}$ | $3.04 \times 10^{64}$ | Exceeds universe information capacity | | 100 | 4,950 | $\sim 10^{1332}$ | $\sim 10^{16100}$ | $9.33 \times 10^{157}$ | $\gg 10^{80}$ (total particles in observable universe) | | 1,000 | 499,500 | $\sim 10^{150000}$ | $\sim 10^{2713000}$ | $\sim 10^{2568}$ | Absolute thermodynamic impossibility |

The HPC Cluster Frontier ($N = 10 \dots 12$)

At $N=8$, our layer-by-layer dynamic programming algorithm verified $M \approx 8.95 \times 10^{23}$ paths across 28 edge layers in $1.38 \times 10^4$ seconds on a standard commodity workstation (8-core x86-64, 64 GB RAM, single-threaded CPython). Extending this exact evaluation to $N=10$ encounters an unlabelled graph space of $1.20 \times 10^7$ isomorphism classes (OEIS A000088) with $10! = 3.63 \times 10^6$ permutations per state. On a single-core workstation baseline, a pure Python implementation would require an estimated 12–31 days of continuous execution; however, migrating to a compiled C/C++ engine utilizing the canonical graph labeling library Bliss or Nauty and distributed MPI parallelization across a 128-core HPC cluster (e.g., dual-socket AMD EPYC nodes with $\ge 512$ GB memory) could reduce the wall-clock runtime to several days.

At $N=12$, however, the state space expands to 164.8 billion isomorphism classes ($M_{\text{baseline}} \approx 8.44 \times 10^{76}$). Maintaining the dynamic programming layer tables in memory requires at least 1.3 Terabytes of distributed RAM across an institutional supercomputing partition, requiring months of continuous compute allocation.

The Cosmological Physical Barrier ($N \ge 16$)

Beyond $N=12$, the exact multiway trajectory evaluation crosses absolute physical boundaries:

1. Planetary Storage Limit ($N \ge 16$): At $N=16$, the unlabelled graph state space exceeds $10^{23}$ classes, surpassing the total aggregate digital storage of human civilization ($\sim 10^{21}$ bytes).
2. Cosmic Entropy Limit ($N \ge 100$): At cosmological scales ($N=100$), the number of distinct graph macrostates ($\sim 10^{1332}$) and trajectory paths ($M \sim 10^{16100}$) surpasses the total number of subatomic particles in the observable universe ($10^{80}$) by over 1,200 orders of magnitude.

This establishes that the multiway state space explosion is not an artifact of software engineering, but a fundamental manifestation of computational irreducibility. The physical universe itself lacks the entropy budget, memory, and degrees of freedom required to "smooth out" or pre-compute an unguided dense substrate $K_N$. Without explicit local dynamical conservation laws, pre-geometric dimensional reduction remains trapped within this combinatorially impenetrable phase space.

---

6. Entropic Gravity and Non-Vanishing Vacuum Energy

We now state and prove the primary physical theorem governing continuum emergence and discrete entanglement equilibrium.

Theorem 1 (Thermodynamic Obstruction to Flat Continuum Vacuum). Let $\mathcal{M}$ be the multiway evolution system of a closed spatial hypergraph $\mathcal{H}$ undergoing dimensional reduction from an initial complete graph $K_{N_0}$ under a local rewriting rule set $R$. Under the following conditions:

1. Closed Ontology: The multiway hypergraph constitutes the complete physical state space (no external heat sinks).
2. Operational Coarse-Graining: The embedded observer measures local spatial observables via the reduced density matrix $\rho_{\text{spatial}} = \operatorname{Tr}_{\text{branchial}}(|\Psi_t\rangle\langle\Psi_t|) = \sum_{G} p(G) |G\rangle\langle G|$.
3. Semiclassical Entanglement Equilibrium: Semiclassical spacetime emerges via Jacobson's entanglement equilibrium thermodynamics [10, 11] on causal horizon boundaries.

Then the topological macrostate dispersion across non-isomorphic graphs enforces $\rho_{\text{spatial}} \neq \rho_0$, and the discrete modular Hamiltonian excitation satisfies:

$$\Delta \langle K_{\text{graph}} \rangle \ge \frac{1}{2} \|\rho_{\text{spatial}} - \rho_0\|_1^2 > 0$$

precluding an unperturbed flat classical vacuum ($T_{\mu\nu} = 0$) over finite observational timescales.

Proof.

I. Process Entropy and Macrostate Dispersion At $N=8, k=3$, asynchronous multiway execution generates $M = 894,757,885,819,817,073,868,800$ paths ($H_{\text{process}} = 79.5658$ bits), while the terminal physical isomorphism classes collapse to $|\Omega_{\text{terminal}}| = 355$ with realized Shannon entropy $H_{\text{macro}}^{\text{realized}} = 6.6960$ bits. The unreconciled process entropy is:

$$\Delta H = H_{\text{process}} - H_{\text{macro}}^{\text{realized}} = 72.8698 \text{ bits}$$

II. Discrete Graph Modular Hamiltonian Construction and KMS Regularization Let $K_{\text{graph}}$ be the modular Hamiltonian operator on the spatial graph algebra. To ensure that the relative entropy support condition $\operatorname{supp}(\rho_{\text{spatial}}) \subseteq \operatorname{supp}(\rho_0)$ is satisfied across the full Fock-graded Hilbert space, we regularize the reference vacuum as the full-rank Kubo-Martin-Schwinger (KMS) thermal state at finite inverse temperature $\beta > 0$:

$$\rho_0^\beta = \frac{\exp(-\beta K_{\text{graph}})}{Z(\beta)}, \quad Z(\beta) = \operatorname{Tr}\left(\exp(-\beta K_{\text{graph}})\right)$$

Under the First Law of Entanglement Thermodynamics [10, 11], the modular Hamiltonian excitation $\Delta \langle K \rangle = \operatorname{Tr}(\rho_{\text{spatial}} K) - \operatorname{Tr}(\rho_0^\beta K)$ satisfies the exact operator identity:

$$\Delta \langle K_{\text{graph}} \rangle = \frac{1}{\beta} \left[ S_{\text{rel}}(\rho_{\text{spatial}} \parallel \rho_0^\beta) + \Delta S(\rho_{\text{spatial}}) \right]$$

where $\Delta S(\rho_{\text{spatial}}) = S(\rho_{\text{spatial}}) - S(\rho_0^\beta) \ge 0$ represents subsystem entropy production.

III. Quantum Pinsker Inequality and Modular Lower Bound Because $\rho_0^\beta$ is full rank, the quantum relative entropy:

$$S_{\text{rel}}(\rho_{\text{spatial}} \parallel \rho_0^\beta) = \operatorname{Tr}(\rho_{\text{spatial}} \log \rho_{\text{spatial}}) - \operatorname{Tr}(\rho_{\text{spatial}} \log \rho_0^\beta)$$

is strictly finite. By the Quantum Pinsker Inequality, relative entropy provides an exact quadratic lower bound in terms of the trace norm (where $\|X\|_1 \equiv \operatorname{Tr}\sqrt{X^\dagger X}$ is the Schatten 1-norm, related to trace distance by $D(\rho, \sigma) = \frac{1}{2}\|\rho - \sigma\|_1$):

$$S_{\text{rel}}(\rho_{\text{spatial}} \parallel \rho_0^\beta) \ge \frac{1}{2} \|\rho_{\text{spatial}} - \rho_0^\beta\|_1^2$$

In the zero-temperature vacuum limit ($\beta \to \infty$), $\rho_0^\beta$ converges to the coherent regular lattice projection $\rho_0 = |G_{\text{vac}}\rangle\langle G_{\text{vac}}|$. The trace norm evaluates analytically to:

$$\lim_{\beta \to \infty} \|\rho_{\text{spatial}} - \rho_0^\beta\|_1 = \sum_{G \neq G_{\text{vac}}} p(G) + |p(G_{\text{vac}}) - 1| = 2(1 - p(G_{\text{vac}}))$$

By Theorem 5.2, for any local rewriting rule undergoing unguided dimensional reduction on dense substrates, subcritical percolation forces the manifold vacuum probability mass to vanish exponentially: $p(G_{\text{vac}}) \le P(\Gamma_{\text{manifold}}) \le \exp(-\mu N_0) \to 0$ as $N_0 \to \infty$ (corroborated empirically by $p(G_{\text{vac}}) \le 4.53 \times 10^{-7}$ at $N=8$). Consequently, the relative entropy lower bound satisfies:

$$S_{\text{rel}}(\rho_{\text{spatial}} \parallel \rho_0) \ge \frac{1}{2} [2(1 - p(G_{\text{vac}}))]^2 = 2(1 - p(G_{\text{vac}}))^2 \xrightarrow{N_0 \to \infty} 2.0 \text{ nats}$$

Because subsystem entropy production satisfies $\Delta S = H_{\text{macro}} \ge 0$, the modular Hamiltonian excitation is strictly lower-bounded:

$$\Delta \langle K_{\text{graph}} \rangle \ge 2(1 - p(G_{\text{vac}}))^2 \longrightarrow 2.0 \text{ nats} > 0$$

IV. Scalar Matter Dispersion and Spectral Gap Collapse This non-equilibrium topological mixedness is corroborated by scalar matter field dynamics propagating on the graph substrate ($\mathcal{H}_{\text{matter}} = \frac{1}{2}\phi^T L \phi$). The zero-momentum non-constant fluctuation ground state energy is governed by the algebraic connectivity (Fiedler eigenvalue / spectral gap $\lambda_2(L)$):

$$\mathcal{E}_0 = \inf_{\phi \perp \mathbf{1}, \|\phi\|=1} \phi^T L \phi = \lambda_2(L)$$

For the connected vacuum lattice $G_{\text{vac}}$, $\lambda_2(L_{\text{vac}}) > 0$. However, for the dominant terminal macrostates (which partition into $c \ge 2$ disconnected island components), the spectral gap collapses to zero: $\lambda_2(L_{\text{island}}) = 0$. The resulting spectral gap deviation:

$$\Delta \lambda_2 = \langle \lambda_2(L) \rangle_{\rho_{\text{spatial}}} - \lambda_2(L_{\text{vac}}) = \sum_{G} p(G) \lambda_2(G) - \lambda_2(L_{\text{vac}}) < 0$$

demonstrates that scalar fluctuations decouple across disconnected topological components, generating infrared divergences and non-equilibrium scalar dispersion on the horizon.

V. Semiclassical Stress-Energy Generation as an Internal Obstruction In the Wolfram Physics Project (Gorard [4], §3.3 "Entanglement Equilibrium and the Einstein Field Equations"), continuum general relativity is posited to emerge from multiway branchial space via Jacobson's entanglement equilibrium thermodynamics ($\delta S = \delta \langle K \rangle$), where the modular Hamiltonian of a spatial region is defined identically as $K = -\log \rho_A$, and unperturbed Minkowski spacetime requires an unexcited vacuum state ($\Delta \langle K \rangle = 0 \implies T_{ab} = 0$). Under the Jacobson-Padmanabhan holographic mapping [8, 10, 11]:

$$\Delta \langle K_{\text{graph}} \rangle = \frac{2\pi}{\hbar} \int_{\Sigma} T_{ab} \xi^a d\Sigma^b$$

Theorem 1 establishes an internal obstruction to this mechanism: because open-system branchial coarse-graining enforces $\Delta \langle K_{\text{graph}} \rangle \ge 2(1 - p(G_{\text{vac}}))^2 > 0$, the emergent stress-energy tensor across the localized horizon is strictly non-vanishing ($T_{ab} \neq 0$). Therefore, an unperturbed, zero-energy classical continuum vacuum ($T_{\mu\nu} = 0$) cannot be dynamically recovered over finite observational timescales within the framework's own stated thermodynamic bridge. $\square$

---

6.1 Analytical Evaluation of Continuum Approximations

Our findings identify specific formal limitations in the mathematical bridges proposed by Gorard [4] to transition from discrete hypergraphs to continuous Riemannian geometry:

Spatial Variance of Local Dimension in Volume Growth

To derive the Einstein field equations, Gorard invokes the volume growth formula for a discrete geodesic ball of radius $r$:

$$V_x(r) = a r^d \left[ 1 - \frac{1}{6(d+2)} R_{jk} x^j x^k + \mathcal{O}(r^3) \right]$$

where $d$ is assumed to be a constant integer dimension and $R_{jk}$ is the discrete Ricci curvature tensor.

However, as demonstrated in our simulations, the local coordination degree exhibits spatial variance across the graph. Because local dimension $d(x)$ is a dynamical, spatially varying quantity, the Taylor expansion of $V_x(r)$ is ill-defined: volume growth is dominated by local dimensional fluctuations rather than geometric curvature terms.

Breakdown of Chapman-Enskog Solvability in Discrete Graph Rewriting

Gorard attempts to justify the emergence of the continuum Einstein field equations from discrete causal graphs by asserting a formal correspondence with the Chapman-Enskog hydrodynamic expansion in kinetic theory:

“The nature of this derivation of the continuum Einstein field equations from the underlying discrete geometry of the causal graph is formally analogous to the so-called ‘Chapman-Enskog’ hydrodynamic expansion... with the function $C(t) = a t^n [1 - \frac{1}{6} R_{jk} t^j t^k + \mathcal{O}(\|t\|^3)]$ playing the role of a ‘distribution function’ for vertices in the causal graph.” [4]

This correspondence fails under exact functional-analytic and kinetic principles:

1. The Fredholm Solvability Condition in Kinetic Theory: In kinetic theory and Lattice Gas Cellular Automata [14], macroscopic conservation laws are derived from a microscopic transport equation parameterized by the Knudsen number $\epsilon = \text{Kn} \ll 1$:

$$\mathcal{D} f = \frac{1}{\epsilon} \mathcal{C}[f], \quad \mathcal{D} \equiv \partial_t + \mathbf{v} \cdot \nabla$$

Expanding the distribution function $f = f^{(0)} + \epsilon f^{(1)} + \mathcal{O}(\epsilon^2)$ about local equilibrium $f^{(0)}$ yields the linearized operator equation at order $\mathcal{O}(1)$:

$$\mathcal{L} f^{(1)} = \mathcal{D}^{(0)} f^{(0)}, \quad \mathcal{L} \equiv \left. \frac{\delta \mathcal{C}}{\delta f} \right|_{f^{(0)}}$$

By the Fredholm Alternative for linear operators on Hilbert space $L^2(\mathcal{V}, d\mu)$, a physical correction $f^{(1)}$ exists if and only if the inhomogeneous driving term is orthogonal to the null space of the adjoint operator $\mathcal{L}^\dagger$:

$$\left\langle \psi_\alpha, \mathcal{D}^{(0)} f^{(0)} \right\rangle = 0, \quad \forall \psi_\alpha \in \operatorname{ker}(\mathcal{L}^\dagger)$$

In physical fluids, the non-triviality of this kernel ($\dim \operatorname{ker}(\mathcal{L}^\dagger) = d + 2$) is guaranteed by the microscopic collisional invariants $\psi_\alpha \in \{1, \mathbf{v}, |\mathbf{v}|^2\}$, which satisfy $\langle \psi_\alpha, \mathcal{C}[f] \rangle = 0$. Projecting the kinetic equation onto $\operatorname{ker}(\mathcal{L}^\dagger)$ yields the continuity, Euler, and Navier-Stokes equations as closed partial differential equations with conserved currents $\partial_\mu T^{\mu\nu} = 0$.

2. Absence of Hydrodynamic Tensor Collision Invariants ($\operatorname{ker}(\mathcal{L}_{\text{graph}}^\dagger) = \operatorname{span}\{\mathbf{1}\}$): In discrete hypergraph rewriting, let the operational state space be defined on the Hilbert space of local subgraph motif densities $\ell^2(\mathcal{M}_{\text{local}})$, where $\mathcal{M}_{\text{local}} = \{m_1, m_2, \dots\}$ represents the countable basis of local hypergraph isomorphism classes of bounded radius $r$. For graphs of bounded maximum coordination degree $d_{\max} < \infty$, the number of valid redex matches per motif is finite, ensuring that the transition operator:

$$(\mathcal{C}_{\text{graph}} f)(m) = \sum_{m' \in \mathcal{M}_{\text{local}}} \left[ W(m' \to m) f(m') - W(m \to m') f(m) \right]$$

is a bounded linear operator on $\ell^2(\mathcal{M}_{\text{local}})$ with closed range, satisfying the Fredholm Alternative $\operatorname{im}(\mathcal{L}_{\text{graph}}) = \operatorname{ker}(\mathcal{L}_{\text{graph}}^\dagger)^\perp$.

Because the Markov transition kernel satisfies total probability conservation ($\sum_m (\mathcal{C}_{\text{graph}} f)(m) = 0$), the constant scalar functional $\psi_0(m) = 1$ is a left null vector: $\mathcal{L}_{\text{graph}}^\dagger \mathbf{1} = 0$. However, for generic hypergraph substitution rules (such as 2-in 4-out or 2-in 1-out):

$$\Delta V_r = |V(H_2)| - |V(H_1)| \neq 0, \quad \Delta E_r = |E(H_2)| - |E(H_1)| \neq 0$$

Because vertices, edges, and topological degrees are created and destroyed at uncoordinated spatial locations, generic rewriting rules possess no non-trivial vector or tensor collision invariants $\psi_\alpha \in \{\mathbf{v}, |\mathbf{v}|^2, T_{\mu\nu}\}$ satisfying $\langle \psi_\alpha, \mathcal{C}_{\text{graph}}[f] \rangle = 0$.

Consequently, the adjoint null space on $\ell^2(\mathcal{M}_{\text{local}})$ is strictly 1-dimensional, containing only the trivial scalar probability invariant: $\operatorname{ker}(\mathcal{L}_{\text{graph}}^\dagger) = \operatorname{span}\{\mathbf{1}\}$. Projecting the kinetic transport equation $\mathcal{D}^{(0)} f^{(0)}$ onto $\operatorname{ker}(\mathcal{L}_{\text{graph}}^\dagger)$ yields only the scalar continuity equation $\partial_t \rho = 0$, with zero closed momentum or curvature flux equations ($\nabla_\mu T^{\mu\nu} = 0$). The moment hierarchy cannot be closed at any finite order $\mathcal{O}(\epsilon^k)$, preventing the emergence of the Einstein field equations ($G_{\mu\nu} = 8\pi G T_{\mu\nu}$) or any closed-form tensor hydrodynamic partial differential equation.

3. Phase-Space Incompatibility and Lack of Local Equilibrium: A true distribution function $f(\mathbf{x}, \mathbf{p}, t)$ represents a normalized probability density on phase space ($\int f d\mathbf{x} d\mathbf{p} = 1$). The volume growth $C(t)$ is a monotonic geometric metric measure on the causal poset, not a normalized phase-space density. Furthermore, the Chapman-Enskog expansion expands around a maximum-entropy local Maxwellian $f^{(0)}$. Discrete hypergraph rewriting models possess no thermodynamic equilibrium state, temperature, or pressure field from which to perturb.

Coordinate Singularities in Bimetric VSL Cosmology

In Section 3.4 of Ref. [4], Gorard models early-universe dimensional reduction via a variable speed of light (VSL) bimetric line element:

$$ds^2 = -c(t)^2 dt^2 + a(t)^2 \delta_{ij} dx^i dx^j, \quad c(t) = c_0 \left[ 1 + (c_{\text{early}} - 1) \Theta(t_c - t) \right]$$

This step function $\Theta(t_c - t)$ introduces a jump discontinuity into the metric tensor $g_{\mu\nu}$ at $t = t_c$. In general relativity, metric step discontinuities across a spacelike hyper-surface $\Sigma \colon t = t_c$ are governed by the Darmois-Israel junction conditions. A discontinuity in the extrinsic curvature $[K_{ij}] = K_{ij}^+ - K_{ij}^-$ strictly requires a non-vanishing singular surface stress-energy tensor:

$$S_{ij} = -\frac{1}{8\pi G} \left( [K_{ij}] - [K] h_{ij} \right) \neq 0$$

An empty vacuum ($T_{\mu\nu} = 0$) across a discontinuous metric transition is a direct mathematical violation of the Einstein field equations. Accommodating this metric discontinuity within general relativity strictly requires a localized matter boundary layer (a delta-function source $T_{\mu\nu} \propto \delta(t - t_c)$), directly contradicting the Wolfram model's premise that early-universe dimensional reduction represents an empty, purely geometric vacuum. In the absence of such a localized matter boundary layer, the Christoffel connections produce ill-defined Dirac delta products in the Riemann curvature tensor ($R \sim \Theta(t)\delta(t)$), causing the geodesic equation $\frac{d^2 x^\mu}{d\tau^2} + \Gamma^\mu_{\alpha\beta} \frac{dx^\alpha}{d\tau} \frac{dx^\beta}{d\tau} = 0$ to break down in classical Riemannian geometry.

Contrast with Causal Dynamical Triangulations and Microstate Entropy Cancellation

The failure of generic hypergraph rewriting to sustain a stable 4-dimensional continuum contrasts sharply with Causal Dynamical Triangulations (CDT) [1]. In CDT, recovering smooth 4D Lorentzian spacetime from discrete causal simplices requires a non-perturbative path integral:

$$Z_{\text{CDT}}(\kappa_0, \Delta, \kappa_4) = \sum_{T \in \mathcal{T}} \frac{1}{C(T)} \exp\left( -S_{\text{Regge}}[T] \right)$$

where $C(T) = |\operatorname{Aut}(T)|$, and $S_{\text{Regge}}$ is the discrete Einstein-Hilbert-Regge action on 4-simplices:

$$S_{\text{Regge}}[T] = -(\kappa_0 + 6\Delta) N_0(T) + \kappa_4 N_4(T) + \Delta \left( 2 N_1^{(4,1)}(T) + N_1^{(3,2)}(T) \right)$$

Here $N_0(T)$ is the vertex count, $N_4(T)$ is the total 4-simplex count, $N_1$ counts timelike edges, and the bare couplings $\kappa_0, \kappa_4, \Delta$ represent the inverse bare Newton constant, the bare cosmological constant, and the timelike-to-spacelike asymmetry ratio $a_t / a_s$.

The ensemble free energy at fixed volume $N_4$ is governed by the competition between the Regge action and the combinatorial configuration entropy of triangulations:

$$F(N_4) = -\ln \sum_{T \in \mathcal{T}_{N_4}} \exp\left( -S_{\text{Regge}}[T] \right) = \langle S_{\text{Regge}} \rangle_{N_4} - S_{\text{config}}(N_4)$$

Because the microstate cardinality grows exponentially ($|\mathcal{T}_{N_4}| \sim e^{\mu_0 N_4} N_4^{\gamma-1}$), an infinite-volume continuum limit exists if and only if the bare cosmological constant is fine-tuned to the critical threshold $\kappa_4 \to \kappa_4^c(\kappa_0, \Delta) = \mu_0$, canceling the leading-order entropy explosion ($(\kappa_4 - \mu_0)N_4 \to 0$). Semiclassical 4D de Sitter geometry ($d_s = 4.02 \pm 0.10$) emerges exclusively along a second-order transition boundary $\Delta = \Delta_c(\kappa_0)$, where the correlation length of metric fluctuations diverges ($\xi = a / m_{\text{gap}} \to \infty$ as $a \to 0$ with physical 4-volume $V_4 = N_4 a^4$ fixed).

In contrast, the asynchronous hypergraph multiway measure $P(\gamma) = \prod_{t=0}^{L-1} b(G_t)^{-1}$ incorporates no action, no Boltzmann suppression factor, and no tunable coupling parameters:

$$Z_{\text{multiway}} = \sum_{\gamma \in \mathcal{P}_L} P(\gamma) = 1$$

Because there is no bare action to counteract the super-quadratic growth of graph microstates ($S_{\text{config}}(N) \sim H_{\text{process}}(N) = \Theta(N^2 \log N)$), the effective free energy is purely entropic:

$$F_{\text{eff}} = -S_{\text{config}}(N) = -\Theta(N^2 \log N) \longrightarrow -\infty$$

Without a tunable action parameter $\kappa_4^c$ to cancel $S_{\text{config}}$ or a critical coupling $\Delta_c$ to access a second-order transition, the dynamical probability measure is driven into the generic maximum-entropy state space. By the Lovász Homomorphism Theorem and subcritical percolation (Section 5.2), this unconstrained entropy maximum is precisely the disconnected island topology sector ($\lambda_2(L) = 0$), the discrete graph analogue of the degenerate CDT branched polymer phase.

---

6.2 Topological Defects as Matter vs. Vacuum Instability

In Gorard's framework, elementary particles are identified with localized nonplanar graph defects (subdivisions of Kuratowski minors $K_5$ or $K_{3,3}$, as shown in Figure ).

However, our path-weighted terminal distribution demonstrates that nonplanar defects and isolated vertices are not rare, localized excitations propagating on a smooth background. Instead, the dynamical probability measure concentrates on nonplanar anomalies and disconnected topologies as a consequence of unguided path-merging. Matter does not emerge as an isolated perturbation; the background spatial geometry is modified by the accumulated entropy of history coarse-graining.

---

7. Explicit Operational Falsifiability Criteria & Conclusion

To maintain strict scientific falsifiability, we define two explicit operational criteria under which the thesis of this paper is falsified:

1. Microscopic Conservation Law Construction: A deterministic, local hypergraph replacement rule set is constructed possessing explicit local topological invariants (e.g. divergence-free flux conservation or local vertex-charge conservation) that suppresses asynchronous branching such that macrostate entropy dispersion vanishes asymptotically: $$\lim_{N \to \infty} H_{\text{macro}}(N) = 0 \implies \|\rho_{\text{spatial}} - \rho_0\|_1 \longrightarrow 0$$
2. Spectral Dimension & Vacuum Recovery: A local rule set is demonstrated that dynamically guides an initially dense substrate $K_N$ into an ensemble of states whose spectral dimension converges to $d_s = 3.0 \pm \epsilon$ while maintaining Laplacian algebraic connectivity $\lambda_2(L) > 0$ and vanishing modular excitation $\Delta \langle K_{\text{graph}} \rangle \to 0$ without requiring non-local coordination or external coarse-graining.

If a discrete rewriting architecture satisfies these criteria, it achieves finite-time general covariance with zero operational entropy. In the absence of such a demonstration, the combinatorial cost of pre-geometric dimensional reduction is paid, and this informational overhead remains trapped within the relational vacuum metric.

Conclusion

Asymptotic confluence is an insufficient mechanism for establishing discrete general covariance in physically realizable hypergraph rewriting models. Because physical observers operate within finite causal domains, finite-time path reconciliation requires many-to-one state coarse-graining. In a closed ontology lacking an external heat sink, the resulting Lindbladian entropy production manifests as persistent structural defects in the spatial relational network. Grounded within Jacobson's entanglement thermodynamics, this topological mixedness excites the vacuum modular Hamiltonian, precluding an empty classical continuum vacuum ($T_{\mu\nu} = 0$). Furthermore, under the Lovász Graph Homomorphism Theorem, the combinatorial phase space of dimensional reduction scales super-quadratically ($\Theta(N^2 \log N)$), driving unguided local rules into fragmented island topologies. Discrete pre-geometric spacetime models cannot rely on infinite asymptotic limits; they require explicit, local dynamical conservation laws to achieve stable continuum physics.

---

References

[1] J. Ambjørn, J. Jurkiewicz, and R. Loll, "Emergence of a 4D World from Causal Quantum Gravity," Phys. Rev. Lett., 93(13) (2004) 131301.

[2] L. Bombelli, J. Lee, D. Meyer, and R. D. Sorkin, "Space-Time as a Causal Set," Phys. Rev. Lett., 59(5) (1987) 521–524.

[3] S. Wolfram, A New Kind of Science, Wolfram Media, Inc., Champaign, IL, 2002.

[4] J. Gorard, "Some Relativistic and Gravitational Properties of the Wolfram Model," Complex Systems, 29(2) (2020) 599–654.

[5] R. Arnowitt, S. Deser, and C. W. Misner, "The Dynamics of General Relativity," in Gravitation: An Introduction to Current Research (L. Witten, ed.), Wiley, New York, 1962, pp. 227–265.

[6] M. Piskunov, "Logical Independence of Confluence and Causal Invariance in Set Substitution Systems," Wolfram Physics Project Research Archive (2020).

[7] J. D. Bekenstein, "Universal Upper Bound on the Entropy-to-Energy Ratio for Bounded Systems," Phys. Rev. D, 23(2) (1981) 287–298.

[8] T. Padmanabhan, "The Holographic Scorecard of Gravity," Gen. Relativ. Gravit., 37(12) (2005) 2029–2035.

[9] M. Faizal and M. M. Khalil, "Entropic Corrections to Gravity and Vacuum Energy," Int. J. Mod. Phys. D, 24(05) (2015) 1550031.

[10] T. Jacobson, "Thermodynamics of Spacetime: The Einstein Equation of State," Phys. Rev. Lett., 75(7) (1995) 1260–1263.

[11] T. Jacobson, "Entanglement Equilibrium and the Einstein Equation," Phys. Rev. D, 93(12) (2016) 124033.

[12] L. Lovász, Large Networks and Graph Limits, American Mathematical Society, Colloquium Publications, Vol. 60, Providence, RI, 2012.

[13] S. Janson, T. Łuczak, and A. Rucinski, Random Graphs, John Wiley & Sons, New York, 2000.

[14] U. Frisch, B. Hasslacher, and Y. Pomeau, "Lattice Gas Automata for the Navier-Stokes Equation," Phys. Rev. Lett., 56(14) (1986) 1505–1508.

---

Appendix A. Formal Verification in Lean 4

The following Lean 4 specification provides the formalization of Lemma 1 (Theorems 1.1 and 1.2) and the non-injectivity of confluence merging (Theorems 3 and 4), verified using explicit causal DAG structures and order-preserving DAG isomorphisms:

/-!
  # Formal Proof of Lemma 1 & Non-Injectivity
  # Logical Independence of Confluence and Causal Invariance with Causal DAG Isomorphisms
  # Formalized in Lean 4.
-/

-- Reflexive Transitive Closure of an Abstract Rewriting Relation
inductive RTC {α : Type} (R : α → α → Prop) : α → α → Prop where
  | refl (x : α) : RTC R x x
  | step (x y z : α) : R x y → RTC R y z → RTC R x z

-- Predicate: Global Confluence (Church-Rosser Property)
def IsConfluent {α : Type} (R : α → α → Prop) : Prop :=
  ∀ (u y z : α), RTC R u y → RTC R u z → ∃ (w : α), RTC R y w ∧ RTC R z w

-- Predicate: Normal Form (State with no outgoing rewrite transitions)
def IsNormalForm {α : Type} (R : α → α → Prop) (u : α) : Prop :=
  ∀ (y : α), ¬ R u y

-- Inductive Derivation Trace representing concrete chronological execution paths
inductive Trace {α : Type} (R : α → α → Prop) : α → α → Type where
  | nil (x : α) : Trace R x x
  | cons (x y z : α) : R x y → Trace R y z → Trace R x z

-- Length of a derivation trace
def traceLength {α : Type} {R : α → α → Prop} {x z : α} : Trace R x z → Nat
  | Trace.nil _ => 0
  | Trace.cons _ _ _ _ rest => 1 + traceLength rest

-- Predicate: Strong Normalization (Every state terminates at a normal form in finite steps)
def IsStronglyNormalizing {α : Type} (R : α → α → Prop) : Prop :=
  ∀ (s : α), ∃ (t : α) (_tr : Trace R s t), IsNormalForm R t

-- ============================================================================
-- Formal Causal Event Dependency DAGs & Isomorphism
-- ============================================================================

def CausalRelation (E : Type) := E → E → Prop

def IsAsymmetric (E : Type) (R : CausalRelation E) : Prop :=
  ∀ u v : E, R u v → ¬ R v u

def IsTransitive (E : Type) (R : CausalRelation E) : Prop :=
  ∀ u v w : E, R u v → R v w → R u w

structure CausalDAG (E : Type) where
  dep : CausalRelation E
  asym : IsAsymmetric E dep
  trans : IsTransitive E dep

structure CausalDAGIsomorphism (E1 E2 : Type) (g1 : CausalDAG E1) (g2 : CausalDAG E2) where
  toFun : E1 → E2
  invFun : E2 → E1
  left_inv : ∀ x, invFun (toFun x) = x
  right_inv : ∀ y, toFun (invFun y) = y
  preserve_order : ∀ x y, g1.dep x y ↔ g2.dep (toFun x) (toFun y)

def AreIsomorphicDAGs (E1 E2 : Type) (g1 : CausalDAG E1) (g2 : CausalDAG E2) : Prop :=
  Nonempty (CausalDAGIsomorphism E1 E2 g1 g2)

-- ============================================================================
-- Counterexample System M1 (Causal Invariant DAGs, Non-Confluent)
-- ============================================================================

inductive StateM1 : Type where
  | a : StateM1 | b : StateM1 | c : StateM1 | d : StateM1 | e : StateM1
  deriving DecidableEq, Repr

inductive RelM1 : StateM1 → StateM1 → Prop where
  | ab : RelM1 StateM1.a StateM1.b
  | ac : RelM1 StateM1.a StateM1.c
  | bd : RelM1 StateM1.b StateM1.d
  | ce : RelM1 StateM1.c StateM1.e

theorem normal_form_d_M1 : IsNormalForm RelM1 StateM1.d := by intro y hR; cases hR
theorem normal_form_e_M1 : IsNormalForm RelM1 StateM1.e := by intro y hR; cases hR

theorem sn_M1 : IsStronglyNormalizing RelM1 := by
  intro s
  cases s with
  | a => refine ⟨StateM1.d, Trace.cons StateM1.a StateM1.b StateM1.d RelM1.ab
      (Trace.cons StateM1.b StateM1.d StateM1.d RelM1.bd (Trace.nil StateM1.d)), normal_form_d_M1⟩
  | b => refine ⟨StateM1.d, Trace.cons StateM1.b StateM1.d StateM1.d RelM1.bd (Trace.nil StateM1.d), normal_form_d_M1⟩
  | c => refine ⟨StateM1.e, Trace.cons StateM1.c StateM1.e StateM1.e RelM1.ce (Trace.nil StateM1.e), normal_form_e_M1⟩
  | d => refine ⟨StateM1.d, Trace.nil StateM1.d, normal_form_d_M1⟩
  | e => refine ⟨StateM1.e, Trace.nil StateM1.e, normal_form_e_M1⟩

theorem not_confluent_M1 : ¬ IsConfluent RelM1 := by
  intro hConf
  have hab : RTC RelM1 StateM1.a StateM1.d :=
    RTC.step StateM1.a StateM1.b StateM1.d RelM1.ab
      (RTC.step StateM1.b StateM1.d StateM1.d RelM1.bd (RTC.refl StateM1.d))
  have hac : RTC RelM1 StateM1.a StateM1.e :=
    RTC.step StateM1.a StateM1.c StateM1.e RelM1.ac
      (RTC.step StateM1.c StateM1.e StateM1.e RelM1.ce (RTC.refl StateM1.e))
  have ⟨w, hw1, hw2⟩ := hConf StateM1.a StateM1.d StateM1.e hab hac
  have hwd : w = StateM1.d := by cases hw1 with | refl => rfl | step _ _ _ hR _ => cases hR
  have hwe : w = StateM1.e := by cases hw2 with | refl => rfl | step _ _ _ hR _ => cases hR
  rw [hwd] at hwe; nomatch hwe

inductive EventM1_1 : Type where | e1 : EventM1_1 | e2 : EventM1_1 deriving DecidableEq, Repr
inductive EventM1_2 : Type where | e1' : EventM1_2 | e2' : EventM1_2 deriving DecidableEq, Repr
inductive DepM1_1 : EventM1_1 → EventM1_1 → Prop where | dep : DepM1_1 EventM1_1.e1 EventM1_1.e2
inductive DepM1_2 : EventM1_2 → EventM1_2 → Prop where | dep : DepM1_2 EventM1_2.e1' EventM1_2.e2'

def dagM1_1 : CausalDAG EventM1_1 where
  dep := DepM1_1
  asym := by intro u v h; cases h; intro hcontra; cases hcontra
  trans := by intro u v w h1 h2; cases h1; cases h2

def dagM1_2 : CausalDAG EventM1_2 where
  dep := DepM1_2
  asym := by intro u v h; cases h; intro hcontra; cases hcontra
  trans := by intro u v w h1 h2; cases h1; cases h2

theorem M1_causal_graphs_isomorphic : AreIsomorphicDAGs EventM1_1 EventM1_2 dagM1_1 dagM1_2 := by
  refine ⟨{
    toFun := fun | EventM1_1.e1 => EventM1_2.e1' | EventM1_1.e2 => EventM1_2.e2'
    invFun := fun | EventM1_2.e1' => EventM1_1.e1 | EventM1_2.e2' => EventM1_1.e2
    left_inv := by intro x; cases x <;> rfl
    right_inv := by intro y; cases y <;> rfl
    preserve_order := by
      intro x y; constructor
      · intro h; cases h; exact DepM1_2.dep
      · intro h; cases x <;> cases y <;> cases h <;> exact DepM1_1.dep
  }⟩

-- ============================================================================
-- Counterexample System M2 (Confluent, Non-Isomorphic Causal DAGs)
-- ============================================================================

inductive StateM2 : Type where
  | a : StateM2 | b : StateM2 | c : StateM2 | x : StateM2 | d : StateM2
  deriving DecidableEq, Repr

inductive RelM2 : StateM2 → StateM2 → Prop where
  | ab : RelM2 StateM2.a StateM2.b
  | ac : RelM2 StateM2.a StateM2.c
  | bd : RelM2 StateM2.b StateM2.d
  | cx : RelM2 StateM2.c StateM2.x
  | xd : RelM2 StateM2.x StateM2.d

theorem normal_form_d_M2 : IsNormalForm RelM2 StateM2.d := by intro y hR; cases hR

theorem sn_M2 : IsStronglyNormalizing RelM2 := by
  intro s
  cases s with
  | a => refine ⟨StateM2.d, Trace.cons StateM2.a StateM2.b StateM2.d RelM2.ab
      (Trace.cons StateM2.b StateM2.d StateM2.d RelM2.bd (Trace.nil StateM2.d)), normal_form_d_M2⟩
  | b => refine ⟨StateM2.d, Trace.cons StateM2.b StateM2.d StateM2.d RelM2.bd (Trace.nil StateM2.d), normal_form_d_M2⟩
  | c => refine ⟨StateM2.d, Trace.cons StateM2.c StateM2.x StateM2.d RelM2.cx
      (Trace.cons StateM2.x StateM2.d StateM2.d RelM2.xd (Trace.nil StateM2.d)), normal_form_d_M2⟩
  | x => refine ⟨StateM2.d, Trace.cons StateM2.x StateM2.d StateM2.d RelM2.xd (Trace.nil StateM2.d), normal_form_d_M2⟩
  | d => refine ⟨StateM2.d, Trace.nil StateM2.d, normal_form_d_M2⟩

theorem to_d_from_a : RTC RelM2 StateM2.a StateM2.d :=
  RTC.step StateM2.a StateM2.b StateM2.d RelM2.ab (RTC.step StateM2.b StateM2.d StateM2.d RelM2.bd (RTC.refl StateM2.d))
theorem to_d_from_b : RTC RelM2 StateM2.b StateM2.d := RTC.step StateM2.b StateM2.d StateM2.d RelM2.bd (RTC.refl StateM2.d)
theorem to_d_from_c : RTC RelM2 StateM2.c StateM2.d :=
  RTC.step StateM2.c StateM2.x StateM2.d RelM2.cx (RTC.step StateM2.x StateM2.d StateM2.d RelM2.xd (RTC.refl StateM2.d))
theorem to_d_from_x : RTC RelM2 StateM2.x StateM2.d := RTC.step StateM2.x StateM2.d StateM2.d RelM2.xd (RTC.refl StateM2.d)
theorem to_d_from_d : RTC RelM2 StateM2.d StateM2.d := RTC.refl StateM2.d

theorem confluent_M2 : IsConfluent RelM2 := by
  intro u y z _huy _huz
  refine ⟨StateM2.d, ?_, ?_⟩
  · cases y with | a => exact to_d_from_a | b => exact to_d_from_b | c => exact to_d_from_c | x => exact to_d_from_x | d => exact to_d_from_d
  · cases z with | a => exact to_d_from_a | b => exact to_d_from_b | c => exact to_d_from_c | x => exact to_d_from_x | d => exact to_d_from_d

inductive EventM2_1 : Type where | e1 : EventM2_1 | e2 : EventM2_1 deriving DecidableEq, Repr
inductive EventM2_2 : Type where | e1' : EventM2_2 | e2' : EventM2_2 | e3' : EventM2_2 deriving DecidableEq, Repr
inductive DepM2_1 : EventM2_1 → EventM2_1 → Prop where | dep : DepM2_1 EventM2_1.e1 EventM2_1.e2
inductive DepM2_2 : EventM2_2 → EventM2_2 → Prop where
  | dep12 : DepM2_2 EventM2_2.e1' EventM2_2.e2'
  | dep23 : DepM2_2 EventM2_2.e2' EventM2_2.e3'
  | dep13 : DepM2_2 EventM2_2.e1' EventM2_2.e3'

def dagM2_1 : CausalDAG EventM2_1 where
  dep := DepM2_1
  asym := by intro u v h; cases h; intro hcontra; cases hcontra
  trans := by intro u v w h1 h2; cases h1; cases h2

def dagM2_2 : CausalDAG EventM2_2 where
  dep := DepM2_2
  asym := by intro u v h; cases h <;> intro hcontra <;> cases hcontra
  trans := by
    intro u v w h1 h2
    cases h1 with
    | dep12 => cases h2 with | dep23 => exact DepM2_2.dep13
    | dep23 => cases h2
    | dep13 => cases h2

theorem M2_causal_graphs_not_isomorphic : ¬ AreIsomorphicDAGs EventM2_1 EventM2_2 dagM2_1 dagM2_2 := by
  intro ⟨iso⟩
  have h1 : iso.invFun EventM2_2.e1' = EventM2_1.e1 ∨ iso.invFun EventM2_2.e1' = EventM2_1.e2 := by
    cases iso.invFun EventM2_2.e1' with | e1 => exact Or.inl rfl | e2 => exact Or.inr rfl
  have h2 : iso.invFun EventM2_2.e2' = EventM2_1.e1 ∨ iso.invFun EventM2_2.e2' = EventM2_1.e2 := by
    cases iso.invFun EventM2_2.e2' with | e1 => exact Or.inl rfl | e2 => exact Or.inr rfl
  have h3 : iso.invFun EventM2_2.e3' = EventM2_1.e1 ∨ iso.invFun EventM2_2.e3' = EventM2_1.e2 := by
    cases iso.invFun EventM2_2.e3' with | e1 => exact Or.inl rfl | e2 => exact Or.inr rfl
  rcases h1 with (h1 | h1) <;> rcases h2 with (h2 | h2) <;> rcases h3 with (h3 | h3)
  · have heq : iso.invFun EventM2_2.e1' = iso.invFun EventM2_2.e2' := by rw [h1, h2]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e1') = iso.toFun (iso.invFun EventM2_2.e2') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e1' = iso.invFun EventM2_2.e2' := by rw [h1, h2]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e1') = iso.toFun (iso.invFun EventM2_2.e2') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e1' = iso.invFun EventM2_2.e3' := by rw [h1, h3]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e1') = iso.toFun (iso.invFun EventM2_2.e3') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e2' = iso.invFun EventM2_2.e3' := by rw [h2, h3]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e2') = iso.toFun (iso.invFun EventM2_2.e3') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e2' = iso.invFun EventM2_2.e3' := by rw [h2, h3]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e2') = iso.toFun (iso.invFun EventM2_2.e3') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e1' = iso.invFun EventM2_2.e3' := by rw [h1, h3]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e1') = iso.toFun (iso.invFun EventM2_2.e3') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e1' = iso.invFun EventM2_2.e2' := by rw [h1, h2]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e1') = iso.toFun (iso.invFun EventM2_2.e2') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj
  · have heq : iso.invFun EventM2_2.e1' = iso.invFun EventM2_2.e2' := by rw [h1, h2]
    have h_inj : iso.toFun (iso.invFun EventM2_2.e1') = iso.toFun (iso.invFun EventM2_2.e2') := by rw [heq]
    rw [iso.right_inv, iso.right_inv] at h_inj; nomatch h_inj

-- Trace-Based Non-Injectivity & Information Erasure Proof
def trace1_M2 : Trace RelM2 StateM2.a StateM2.d :=
  Trace.cons StateM2.a StateM2.b StateM2.d RelM2.ab
    (Trace.cons StateM2.b StateM2.d StateM2.d RelM2.bd (Trace.nil StateM2.d))

def trace2_M2 : Trace RelM2 StateM2.a StateM2.d :=
  Trace.cons StateM2.a StateM2.c StateM2.d RelM2.ac
    (Trace.cons StateM2.c StateM2.x StateM2.d RelM2.cx
      (Trace.cons StateM2.x StateM2.d StateM2.d RelM2.xd (Trace.nil StateM2.d)))

theorem distinct_traces_coincide_at_terminal :
  trace1_M2 ≠ trace2_M2 ∧ traceLength trace1_M2 = 2 ∧ traceLength trace2_M2 = 3 := by
  refine ⟨?_, rfl, rfl⟩; intro h; nomatch h

theorem causal_invariance_does_not_imply_confluence :
  ∃ (α : Type) (R : α → α → Prop),
    IsStronglyNormalizing R ∧ ¬ IsConfluent R ∧
    AreIsomorphicDAGs EventM1_1 EventM1_2 dagM1_1 dagM1_2 :=
  ⟨StateM1, RelM1, sn_M1, not_confluent_M1, M1_causal_graphs_isomorphic⟩

theorem confluence_does_not_imply_causal_invariance :
  ∃ (α : Type) (R : α → α → Prop),
    IsStronglyNormalizing R ∧ IsConfluent R ∧
    ¬ AreIsomorphicDAGs EventM2_1 EventM2_2 dagM2_1 dagM2_2 :=
  ⟨StateM2, RelM2, sn_M2, confluent_M2, M2_causal_graphs_not_isomorphic⟩

---

Appendix B. Standalone Python Reference Simulation Engine

The following Python script implements the multi-mode multiway induction engine: (1) unconstrained combinatorial degree pruning lower bounds, (2) fast Monte Carlo trajectory sampling for $N \ge 9$, and (3) explicit Wolfram 2-in 4-out, 2-in 1-out contraction, and 2-in 2-out topology swap rules:

"""
Pre-Geometric Multiway Hypergraph Simulation Suite
Evaluates state space volume, Shannon process entropy, macrostate entropy dispersion,
and explicit hypergraph substitution rules (expansion, contraction, topology-swap).
"""

import collections, itertools, math, time, json, pickle, random
from typing import Tuple, List, Dict, Any, FrozenSet

CanonicalState = Tuple[Tuple[int, int], ...]
HypergraphState = FrozenSet[Tuple[int, ...]]

class PreGeometricMultiwayAuditor:
    def __init__(self):
        self._canonical_cache: Dict[Tuple[Tuple[int, int], ...], CanonicalState] = {}

    def clear_cache(self):
        self._canonical_cache.clear()

    def _generate_canonical_kn(self, n: int) -> CanonicalState:
        if n < 2: raise ValueError(f"N must be >= 2, got {n}")
        return tuple(sorted((i, j) for i in range(n) for j in range(i + 1, n)))

    def _get_vertex_degrees(self, state: CanonicalState, n: int) -> List[int]:
        degs = [0] * n
        for u, v in state: degs[u] += 1; degs[v] += 1
        return degs

    def _get_canonical_form(self, n: int, edges: List[Tuple[int, int]]) -> CanonicalState:
        lookup_key = tuple(sorted(edges))
        if lookup_key in self._canonical_cache: return self._canonical_cache[lookup_key]
        canonical_min = None
        for p in itertools.permutations(range(n)):
            remapped = tuple(sorted((min(p[u], p[v]), max(p[u], p[v])) for u, v in edges))
            if canonical_min is None or remapped < canonical_min:
                canonical_min = remapped
        self._canonical_cache[lookup_key] = canonical_min
        return canonical_min

    def evaluate_scale(self, n: int, k: int, silent: bool = True) -> Dict[str, Any]:
        initial_state = self._generate_canonical_kn(n)
        current_layer: Dict[CanonicalState, int] = {initial_state: 1}
        terminal_registry: Dict[CanonicalState, int] = collections.defaultdict(int)

        while current_layer:
            next_layer: Dict[CanonicalState, int] = collections.defaultdict(int)
            for state, count in current_layer.items():
                degs = self._get_vertex_degrees(state, n)
                prunable = [e for e in state if degs[e[0]] > k or degs[e[1]] > k]
                if not prunable:
                    terminal_registry[state] += count
                else:
                    for edge in prunable:
                        child = self._get_canonical_form(n, [e for e in state if e != edge])
                        next_layer[child] += count
            current_layer = next_layer

        total_paths = sum(terminal_registry.values())
        h_process = math.log2(total_paths) if total_paths > 0 else 0.0
        h_macro = -sum((c / total_paths) * math.log2(c / total_paths)
                       for c in terminal_registry.values() if c > 0)
        return {
            "total_paths": total_paths,
            "classes": len(terminal_registry),
            "h_process": h_process,
            "h_macro": h_macro,
            "landauer_gap": h_process - h_macro
        }

    def sample_trajectory_statistics(self, n: int, k: int, num_samples: int = 1000, seed: int = 42) -> Dict[str, Any]:
        rng = random.Random(seed)
        initial = list(self._generate_canonical_kn(n))
        lengths, connected_cnt = [], 0
        for _ in range(num_samples):
            curr, steps = list(initial), 0
            while True:
                degs = self._get_vertex_degrees(tuple(curr), n)
                prunable = [e for e in curr if degs[e[0]] > k or degs[e[1]] > k]
                if not prunable: break
                curr.remove(rng.choice(prunable))
                steps += 1
            lengths.append(steps)
        return {"n": n, "k": k, "samples": num_samples, "mean_length": sum(lengths) / num_samples}

class HypergraphRewriteAuditor:
    """Auditor for explicit Wolfram hypergraph substitution rules."""
    def find_2in_matches(self, edges: HypergraphState) -> List[Tuple[Tuple[int, ...], Tuple[int, ...]]]:
        matches, edge_list = [], sorted(list(edges))
        for i in range(len(edge_list)):
            for j in range(i + 1, len(edge_list)):
                if len(set(edge_list[i]) & set(edge_list[j])) == 1:
                    matches.append((edge_list[i], edge_list[j]))
        return matches

    def apply_2in_4out_rule(self, edges: HypergraphState, match: Tuple[Any, Any], new_v: int) -> HypergraphState:
        e1, e2 = match
        x = list(set(e1) & set(e2))[0]
        y = list(set(e1) - {x})[0]
        z = list(set(e2) - {x})[0]
        new_edges = {(min(x, new_v), max(x, new_v)), (min(y, new_v), max(y, new_v)),
                     (min(z, new_v), max(z, new_v)), (min(y, z), max(y, z))}
        return frozenset((set(edges) - {e1, e2}) | new_edges)

    def apply_2in_1out_rule(self, edges: HypergraphState, match: Tuple[Any, Any]) -> HypergraphState:
        e1, e2 = match
        x = list(set(e1) & set(e2))[0]
        y, z = list(set(e1) - {x})[0], list(set(e2) - {x})[0]
        return frozenset((set(edges) - {e1, e2}) | {(min(y, z), max(y, z))})

---

Appendix C. Data, Proofs, and Test Suite Availability

The complete replication suite, machine-checked theorem proofs, and test automation are openly accessible in the repository:

• Formally Verified Proofs (Lean 4): formal-proofs/CausalInvariance.lean. Verified with the Lean 4 toolchain (leanprover/lean4:v4.33.1, or via lake env lean / lake build for structured Lake packages).
• Dual-Mode Simulation Engine (Python 3.8+): simulation.py
• Pytest Unit, Mock & Combinatorics Test Suite: tests/test_simulation.py
• Empirical Multi-Scale Execution Logs: simulation_output.txt