Lattice Physics · Neuromorphic Architecture

The geometry
determines the answer.

Calera Computing derives cognitive architecture from mathematical first principles — not statistical approximation. We build systems where every output is provable, traceable, and deterministic.

Read the Papers Learn More
About

Truth first.
Always.

Calera Computing, Inc. is a Delaware C-Corporation building the next generation of deterministic cognitive systems. Our architecture is organized around algebraic constants that emerge from lattice geometry — the same constants that govern energy propagation in simplicial structures across dimensions.

We don't approximate. We don't predict. We derive. Every architectural decision traces back to a mathematical proof. That's not a philosophy — it's a structural constraint.

σ
Lattice Physics
Architecture organized around the xd = x + 1 polynomial hierarchy — including the 4D σ-constant (σ ≈ 1.22074) — representing geometry-native decay bases across dimensions.

Our architecture utilizes the polynomial family xd = x + 1, which generates geometry-native organizing constants for simplicial lattices across dimensions.

This includes the 4D σ-constant (σ ≈ 1.22074), which governs energy propagation on the A₄ root lattice, alongside φ (2D) and ρ (3D).

Our newest paper B-02 provides cross-dimensional spectral validation on Ad root lattices, proving that these constants are uniquely derived from Laplacian spectral properties across dimensions with zero free parameters.

Key Insight: B-02 proves that the d-dimensional hyperbox subdivides into exactly C(2d−1, d−1) proportional types, extending Dom Hans van der Laan's architectural system to four dimensions and beyond.
∅
Deterministic Recall
Generation is recall, not prediction. If the system lacks a confident pathway, it returns nothing — by construction.

Traditional generative systems are trained to always produce output — even when uncertain, leading to hallucinations.

Our architecture treats generation as geometric recall: the system navigates a lattice of stored patterns and retrieves the nearest match.

If no pattern exists within the confidence threshold defined by σ-decay, the system returns ∅ (null) — silence is a valid, designed output. Hallucination is architecturally impossible because there is no generation pathway without a geometric address.

Key Insight: The ∅-return property is not a safety feature bolted on — it's an inherent mathematical consequence of recall-based architecture.
⟨⟩
Geometric Provenance
Every output traces to a specific geometric coordinate. The address is the audit trail.

Every stored pattern lives at a specific coordinate in the simplicial lattice — a geometric address expressed as a tuple ⟨layer, simplex, vertex⟩.

When the system recalls a pattern, it returns both the content and its lattice address. This address is immutable and deterministic: the same input always maps to the same coordinate.

Unlike attention-based systems where the "reasoning path" is a statistical artifact, geometric provenance is a mathematical proof of origin.

Key Insight: Auditability is not a feature we added — it's a consequence of the geometry. The lattice is the audit trail.
Research

Published Work

Our published research establishes the mathematical foundations of the xd = x + 1 hierarchy — the family of algebraic constants that organize energy propagation on simplicial lattices across dimensions.

B-02 · Zenodo · Open Access NEW

The xd = x + 1 Hierarchy: Cross-Dimensional Spectral Validation on Ad Root Lattices

Casey Lee Race
June 14, 2026
DOI: 10.5281/zenodo.20692936
Read Abstract

We prove that the polynomial family xd = x + 1 generates geometry-native organizing constants for Ad root lattices across dimensions — unifying the golden ratio (2D), plastic constant (3D), and σ-constant (4D) into a single hierarchy. Four independent lines of evidence: infinite-lattice Fourier analysis, algebraic recurrence, higher-order asymptotics with exact coefficients via Lagrange inversion, and a proof that the d-dimensional hyperbox subdivides into exactly C(2d−1, d−1) proportional types — extending Van der Laan's architectural system to four dimensions and beyond.

Read on Zenodo Verify Independently
B-01 · Zenodo · Open Access

The σ-Constant: A Universal Algebraic Invariant for Energy Propagation in d-Dimensional Simplicial Lattices

Casey Lee Race
May 22, 2026
DOI: 10.5281/zenodo.20350425
Read Abstract

We derive σ ≈ 1.22074, the unique positive real root of x⁴ − x − 1 = 0, and demonstrate that it is the geometry-native organizing constant for energy propagation on the A₄ root lattice. The result is validated through two independent methods: Hopfield recall optimization and spectral Laplacian analysis. Zero free parameters. The lattice geometry determines the constant.

Read on Zenodo Verify Independently

The Dimensional Hierarchy

Dimension Equation Constant Name Geometry
2 x² = x + 1 φ ≈ 1.618 Golden Ratio Triangle, Pentagon
3 x³ = x + 1 ρ ≈ 1.325 Plastic Constant Tetrahedron
4 x⁴ = x + 1 σ ≈ 1.221 σ-Constant Pentatope, A₄ Lattice
5 x⁵ = x + 1 ≈ 1.167 — 5-Simplex
∞ — → 1.0 Isotropic Limit —