Provable Determinism for Agent State: The Machine-Checked Proof Behind Bide
Agents that share state usually rely on eventual consistency and hope. Bide’s shared state rests on a convergence theorem that is machine-checked axiom-free, re-checked on three proof-assistant toolchains, and wired into the engine so a bug in the Go code cannot pass a non-convergent machine. This is what is proven, how it is checked, and exactly where the proof stops.