Project Genesis: A Cache-Resident Continuous Geometric Co-Processor for Efficient Language Model Inference

This paper introduces Project Genesis, a 0.51 MB continuous geometric co-processor designed to operate inline alongside standard pretrained language models with O(1) memory overhead and zero discrete token lookup tables.Motivated by biomimetic principles of metabolic constraint and sparse geometric regularity, ProjectGenesis applies orthogonality-constrained manifold projections and isometric state evolution in nativeIEEE-754 double precision (FP64) to condition latent residual trajectories prior to token resolution.We detail the systems engineering required to transition the co-processor from an interpreted Pythonprototype—where host-device synchronization and kernel launch overhead imposed a 15.58 ms/tokenpenalty—to a fused, symbol-stripped C++/CUDA shared library (libgenesis_core.so) executingin 0.46–0.57 ms/token within physical L2 cache on consumer NVIDIA Blackwell silicon. Undercompiled kernel execution, coupled host models demonstrated 16% to 30% reductions in inferencelatency alongside commensurate gains in token throughput, while reducing wasted generation stepson structured reasoning prompts.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24234016
Primary Topic
Parallel Computing and Optimization Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Project Genesis: A Cache-Resident Continuous Geometric Co-Processor for Efficient Language Model Inference

Christopher Wiley
Zenodo (CERN European Organization for Nuclear Research)
Parallel Computing and Optimization Techniques
preprint

Project Genesis: A Cache-Resident Continuous Geometric Co-Processor for Efficient Language Model Inference

Christopher Wiley
preprint en

Abstract

This paper introduces Project Genesis, a 0.51 MB continuous geometric co-processor designed to operate inline alongside standard pretrained language models with O(1) memory overhead and zero discrete token lookup tables.Motivated by biomimetic principles of metabolic constraint and sparse geometric regularity, ProjectGenesis applies orthogonality-constrained manifold projections and isometric state evolution in nativeIEEE-754 double precision (FP64) to condition latent residual trajectories prior to token resolution.We detail the systems engineering required to transition the co-processor from an interpreted Pythonprototype—where host-device synchronization and kernel launch overhead imposed a 15.58 ms/tokenpenalty—to a fused, symbol-stripped C++/CUDA shared library (libgenesis_core.so) executingin 0.46–0.57 ms/token within physical L2 cache on consumer NVIDIA Blackwell silicon. Undercompiled kernel execution, coupled host models demonstrated 16% to 30% reductions in inferencelatency alongside commensurate gains in token throughput, while reducing wasted generation stepson structured reasoning prompts.

Zenodo (CERN European Organization for Nuclear Research)
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon