Proof, not sampling
Formal verification
Model checking establishes properties over all inputs in a bounded space. A test tells you about the cases you thought of.
- Kani proof harnesses over the numeric kernels of a statistical computing library — index bounds, totality, structural invariants like bijectivity and partitioning.
- Miri as the dynamic undefined-behaviour backstop for what model checking cannot reach.
- Quality gates that lock invariants mechanically rather than by convention: a test that requires a written SAFETY justification for any future `unsafe`, in a codebase that currently contains none.
- Reading and tracking the wider ecosystem — Creusot, Verus, Charon, Aeneas, Dafny, and the verified Rust standard library effort.
