Persistent memory must retain history without revisiting it at every transition. Bounded Local Generator Classes (BLGC) formalize carried numerical state, selected context and ordered local updates. The $\ell^\infty$ formulation permits countably many uniformly bounded coordinates without square summability. Projected maps preserve admissibility, Lipschitz estimates control finite-horizon sensitivity, and bounded acquisition and evaluation give a cardinality-independent transition-work contract. OPAL supplies a working persistent-state engine and controlled production measurements. After six successful million-node workloads, 18 matched fresh Release processes compared original and incremental receipt indexing at 10,000, 100,000 and 1,000,000 nodes. Degree, record shape, state dimension, active-target count and event schedule were fixed. Repaired resident-update P50 remained 0.083-0.084 microseconds; subsequent receipt-event P50 ranged from 4.458 to 6.459 microseconds across all scales. The original receipt path took 177.700-182.297 milliseconds at one million nodes. Reliability was tested alongside performance. Baseline and repaired engines produced byte-identical checkpoints, including continuation after fresh-process recovery. Replay, conflict, rejection, concurrent-event and allocation-failure checks passed; all 18 matched scaling processes passed their correctness gates. The repair preserves the state law and durable receipt format. These results connect the mathematical construction to a traced production transition with verified state continuity and measured scaling. Capacity-growth costs and formal scope are reported separately.
翻译:暂无翻译