
1 Introduction
The constructive generation of three-dimensional macroscopic spaces from discrete, fun-
damental components is a central problem in statistical mechanics, network theory, and
discrete models of quantum gravity [1, 4]. A persistent obstacle is geometric frustration.
When discrete nodes are assembled via purely randomized three-dimensional probabilis-
tic rules, the resulting structures typically resemble diffusion-limited aggregation [2] or
kinematically jammed, fractal-like foams. These porous configurations fail to achieve the
dense, uniform coordination required to mimic a continuous, isotropic spatial bulk. For
a discrete spatial model to be physically viable, it must demonstrate a natural kinematic
pathway to structural saturation. In three dimensions, optimal spatial saturation is for-
mally defined by the Kepler conjecture, which dictates a maximum coordination number
of K = 12 [3]. Achieving this state purely through local, bottom-up assembly rules with-
out imposing a global background coordinate system remains a significant computational
challenge. In this paper, we explore a resolution to this geometric bottleneck by altering
the dimensional probabilities of the generative kinematics. Motivated by holographic mod-
els of boundary-volume correspondence [4, 5], we hypothesize that saturated 3D volumes
can be deterministically generated if the underlying assembly process is overwhelmingly
two-dimensional. We introduce a discrete simulation based on the Selection-Stitch Model
(SSM), seeded by a Bell-pair triangle (three unit-distance bonds joining three nodes, the
minimal closed simplicial unit) and grown through two primary topological operators: a
2D lateral expansion (the “Stitch”) and a rare, out-of-plane 3D projection (the “Lift”).
The relative amplitude of these operators is fixed at P
lift
= e
−3
≈ 4.98% by the codi-
mension difference between their solution manifolds (Section 2.2), and is independently
determined to the same value by the survival threshold of the [[192, 130, 3]] CSS code that
the emergent lattice supports (Sections 2.3 and 4). Under these constraints, the system
traces a kinematic cascade K = 1 → K = 6 → K = 4 → K = 12, escaping the geometri-
cally frustrated K = 4 tetrahedral foam [7] and crystallizing into a polycrystalline FCC
lattice that saturates the Kepler bound. We computationally verify that this kinematic
regime naturally drives the network through the cascade, bypassing geometric frustration
to yield a highly ordered, polycrystalline FCC geometry.
Interactive 3D Visualization. A 31-frame animated WebGL application
showing step-by-step lattice growth—from the seed triangle through 2D sheet
expansion to e
−3
out-of-plane lift events—is available at:
https://raghu91302.github.io/ssmtheory/qec_spacetime_3d.html
Nodes are color-coded by coordination (K = 12 green, K = 10–11 orange, K <
10 red), matching the convention used in Figures 3–6. Controls: play/pause,
frame stepping, drag to orbit, scroll to zoom.
2 Methodology
The simulation algorithm is fully specified in this section; a reference implementation
is available at the URLs in the Data Availability statement. All simulations use open
boundary conditions: the lattice grows freely from the seed triangle without periodic
2