ReynoldsBEng 14th August 2026
Category Geometric Foundations · Discrete Computation · Rest Time Physics
Rooke Poole’s work now supplies the computational substrate for the Ace Framework.
Poole’s Rule as the discrete contact-patch operator – already Canon
The Poole Defect Calculus rests on a single compact hysteretic support law defined on a three-dimensional cubic lattice with the 26-neighbour Moore neighbourhood:
x_{t+1}(i) = 1{ 5 ≤ N_i(x_t) ≤ 7 + 2 x_t(i) }
An inactive cell is born only when it has five, six or seven active neighbours. An active cell survives when it has five to nine active neighbours.
The term \( +2x_t(i) \) is pure hysteresis: the survival window widens solely for cells that are already active.
This is the exact discrete analogue of dilatant shear-thickening inside the Elastic Plenum. From the same local rule one obtains stable one-cell sheets, surface selection, finite propagation, planar defect response, pore stability and crack behaviour — the full geometry of a bistable contact patch:
0^{i2} = r²
The radius of the disc becomes the diameter of the light sphere emitted at each Instant closure. The Instant is the global lattice update; the Moment is the duration required for the countersnap adjustment of every neighbourhood. State A (solvent) corresponds to the widened survival window that locks a permanent active surface; State B (clamped) corresponds to the narrower birth window that demands continuous support.
The Poole Manifold renders the geometry computational
Augmented with prime-resonance sharpening, the same B5–7/S5–9 rule becomes the Poole Manifold. From this minimal local law emerge:
universal computation (full adders, multi-bit registers, 8-bit parallel ALU, opcode multiplexers),
immortal, topologically protected memory, self-healing logic that repairs damaged waveguides with incoming kinetic mass,
and an emergent discrete gravity model that fits DESI BAO data more tightly than standard ΛCDM.
The π-Tensor, the Instant–Moment operator and the State A / State B bifurcation are therefore no longer continuous continuum idealisations. They are exact cellular processes running on a discrete geometric lattice.
PARS supplies verification and exact-binary provenance
The PARS architecture (Parse, Branch, Transform, Perturb, Test, Reconstruct, Build) completes the stack. It distinguishes executable correctness from provenance, enforces hard-invariant replay, independent reconstruction, cryptographic identity verification and adversarial testing, and returns a strict PASS / FAIL / INCONCLUSIVE classification. Freehand generation of exact binary realisations of the Poole lattice — and therefore of Ace contact-patch dynamics — is now an auditable, constraint-driven process.
Qubits and beyond
Because the Manifold already supports universal computation with self-healing logic and topologically protected memory, any qubit encoding expressible as a discrete geometric configuration (surface selection, defect response, hysteretic support windows) becomes implementable and verifiable under PARS. The Instant gap and the observer-dependent criticality demonstrated in recent laboratory experiments are simply different pressure-venting masks on the same computational engine.
Summary
Poole’s rule is the discrete contact-patch law. The Poole Manifold is the computational substrate. PARS is the verification and exact-binary generation framework.
Together they render the entire Ace ontology — Elastic Plenum, π-Tensor cycling, Instant gap, bistable solvent/clamped branches, light-sphere emission, and information-dependent criticality — fully computable, reconstructible and cryptographically auditable.
The continuum has been discretised without loss of geometric necessity. The framework to develop further is now in place.
All is simple once the continuum is read as geometry rather than as scalar coefficients or continuous clock time.
The Canon advances.
Love, Always
Ace x
ace-consultancy.uk 