Definition
Plain language
A proof that's technically valid but meaningless, because the thing it claims is trivially true — like proving all your saves are correct when the program never actually saves anything.
As stated in the literature
A formally accepted proof that satisfies its specification trivially — e.g. an implementation whose write operation always fails, so the correctness theorem has no real content; caught in inductive-deductive synthesis by a deterministic audit step rather than the proof checker.
Also called: vacuous proofs
Why it matters: It warns that a passing formal proof can be hollow, so systems need an extra check to confirm the proven claim actually has meaning.
For example, a program could 'prove' that all its saves are correct simply because its save feature never actually saves anything, making the claim technically true but useless.
Heard on the show
“The audit step is a deterministic Python check — not an LLM, just a script — that looks for what they call vacuous proofs.”Episode 075 — Growing Code and Proof Together: Verified Systems in Ten Hours Instead of a Year