• Computer Science > Operating Systems [Submitted on 17 Feb 2026] Title:The Compute ICE-AGE: Invariant Compute Envelope under Addressable Graph Evolution View PDFAbstract:This paper presents empirical results from a production-grade C++ implementation of a deterministic semantic state substrate derived from prior formal work on Bounded Local Generator Classes (Martin, 2026). • The system was mathematically specified prior to implementation and realized as a CPU-resident graph engine operating under bounded local state evolution. • Contemporary inference-driven AI architectures reconstruct semantic state through probabilistic recomposition, producing compute cost that scales with token volume and context horizon. • In contrast, the substrate described here represents semantic continuity as a persistent, addressable memory graph evolved under a time-modulated local operator g(t). • Work is bounded by local semantic change Delta s, independent of total memory cardinality M. • Empirical measurements on Apple M2-class silicon demonstrate invariant traversal latency (approximately 0.25 to 0.32 ms), stable CPU utilization (approximately 17.2 percent baseline with Delta CPU approximately 0 to 0.2 percent), and no scale-correlated thermal signature across 1M to 25M node regimes under sustained operation.
Article Summaries:
- Computer Science > Operating Systems [Submitted on 17 Feb 2026] Title:The Compute ICE-AGE: Invariant Compute Envelope under Addressable Graph Evolution View PDFAbstract:This paper presents empirical results from a production-grade C++ implementation of a deterministic semantic state substrate derived from prior formal work on Bounded Local Generator Classes (Martin, 2026). The system was mathematically specified prior to implementation and realized as a CPU-resident graph engine operating under bounded local state evolution. Contemporary inference-driven AI architectures reconstruct semantic s
Sources: