Proof + simulation: 20,138 command sequences verify a bank model with zero violations

samgoodwin89 · x · 2026-11-19

samgoodwin89 shows an Alchemy verification report for a Bank model: 6 invariants mathematically proved for all states and inputs, exhaustive checking of 20,138 sequences (9,725 states, up to 2 commands with duplicated events, reordered reactions, twice-run saga steps) covering money-loss and pending-transfer rules, plus 200 randomly sampled sequences up to 12 commands long — none breaks a rule. Mixing proof checking and simulation yields a high baseline of confidence without hand-written tests.

Related event: Alchemy lands formal verification: invariants as code, automated proofs and counterexamples(6 posts)→

Original post →

More from coding & agent

coding & agent channel →