ATOMiK: Empirical Validation of Delta-State Computationwith Hardware Verification

Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

Delta-state algebra was recently formalized and verified in the Lean4 proof assistant, establishing the theoretical foundations for computation based on composable state differences rather than persistent state. While 92 theorems proved the mathematical properties of this approach - including closure, commutativity, and Turing completeness - the practical performance implications remained empirical questions. We present a comprehensive validation of delta-state computation through two methodologies: (1) software benchmarks comparing ATOMiK against traditional state-centric architectures across 360 measurements spanning 9 workloads. (2) FPGA hardware implementation validating single-cycle operation and algebraic properties in silicon. Results demonstrate a 95-100% in memory traffic reduction across all workloads, with write-heavy operations achieving 22-55% execution time improvements. Critically, hardware implementation eliminates software observed reconstruction overhead, achieving uniform single-cycle latency (10.6 ns @ 94.5 MHz) for all operations - LOAD, ACCUMULATE, and READ. The commutative property enables 85% parallel efficiency, impossible in traditional architectures. All algebraic properties from the formal proofs are validated in silicon (10/10 hardware tests passing on Gowin GW1NR-9FPGA). To our knowledge, this represents the first delta-state architecture to demonstrate theory-to-silicon validation with uniform read/write performance, establishing that the software-observed read penalty is an implementation artifact, not a fundamental limitation.

Article activity feed