Deterministic Integer Topologies
Bypassing the Matrix-Multiplication Bottleneck via Cache-Resident Graph Traversal
Matt Gibson · Crimson Symphony Media · Apache 2.0 companions on GitHub / HF
Cite
Concept DOI (stable cite): 10.5281/zenodo.22406009
Latest version: 10.5281/zenodo.22431987
Zenodo latest: zenodo.org/records/22431987
ORCID: 0009-0001-4167-201X
Code: github.com/ultranetcommand-neo/t112-l2-lattice
Dataset: huggingface.co/datasets/UltranetCommand/t112-l2-lattice
Concept DOI (stable cite): 10.5281/zenodo.22406009
Latest version: 10.5281/zenodo.22431987
Zenodo latest: zenodo.org/records/22431987
ORCID: 0009-0001-4167-201X
Code: github.com/ultranetcommand-neo/t112-l2-lattice
Dataset: huggingface.co/datasets/UltranetCommand/t112-l2-lattice
What this is
A public receipt for cache-resident graph traversal on the T112 L2 lattice — integer topology work that aims at the GEMM bottleneck without claiming a finished OS, a live node count, or a retail install path.
Not MASTER. Not retail. Not a “12 nodes / 17 agents” live inventory. Companion code and LUT telemetry are for reproduce-and-check.
Concept figure
Related figures
Related public anchors
Page prepared 2026-09-05 for Pages bundle. Live only after operator yes on Direct Upload.