PoSME: Proof of Sequential Memory Execution via Latency-Bound Pointer Chasing with Causal Hash Binding
Provides a foundation for verifiable delay, authorship attestation, and Sybil resistance without trusted setup, addressing the need for proof of sequential work in decentralized systems.
PoSME enforces sustained sequential computation via latency-bound pointer chasing with causal hash binding, achieving strict linear memory-step enforcement, high time-memory trade-off resistance (tenfold penalty at write density 4), and tight ASIC advantage bound by DRAM latency. Benchmarks show hash computation under 3.5% of step cost and GPUs 14-19x slower than CPUs.
We introduce PoSME (Proof of Sequential Memory Execution), a cryptographic primitive that enforces sustained sequential computation via latency-bound pointer chasing over a mutable arena. Each step reads data-dependent addresses, writes a block whose value and causal hash are mutually dependent (symbiotic binding), and chains the result into a global transcript. This yields three properties: (1) strict linear sequential memory-step enforcement, (2) high time-memory trade-off resistance (a tenfold penalty at a write density of 4, with a formal space-time lower bound that scales quadratically with the number of steps), and (3) a tight ASIC advantage bound by DRAM random-access latency rather than bandwidth. Benchmarks across 17 CPU platforms and 4 GPU architectures demonstrate that hash computation is under 3.5 percent of step cost and GPU hardware is 14 to 19 times slower than a consumer CPU. POSME requires no trusted setup and provides a foundation for verifiable delay, authorship attestation, and Sybil resistance.