Paged Context Memory: Runtime Systems for Evidence Blocks, Locality, Speculation, Linking, and Policy Preservation

Paper 1 of this series defined what compiled context is. This paper defines how compiled context lives over time. We argue that AI context systems should be treated as semantic runtimes, not passive stores, and that they require working sets, locality, paging, speculative preparation, lifecycle management, linking, causal provenance, and policy-preserving state transitions.

The paper introduces the evidence block as the fundamental runtime primitive, defines context working sets, semantic locality, and context fragmentation as formal runtime concepts, and extends the runtime with context branch prediction, speculative context execution, context garbage collection, and a context linker. It further formalizes provenance as a causality graph and argues that policy-preserving compilation must preserve policy semantics the way traditional compilers preserve program semantics.

This is Part 2 of the Context Compilation Trilogy, defining the runtime and lifecycle layer for enterprise AI context systems.