Definition
Plain language
An open AI system that writes machine-checked math proofs cheaply by sketching the whole proof as a flowchart first, then filling in and repairing the pieces.
As stated in the literature
A formal theorem-proving framework that generates a global proof blueprint (a dependency graph of sub-lemmas), proves nodes in parallel, and iteratively refines the graph using compiler-verified counterexamples and structured forfeit diagnoses; verified a full benchmark on open-weight models for under $300.
Also called: Gödel-Architect
Why it matters: It shows that rigorous, machine-checked math proofs can be produced cheaply on openly available models rather than only with expensive proprietary ones.
For example, faced with a hard theorem, it first sketches the whole proof as a flowchart of smaller lemmas, then proves each piece in parallel and repairs any that fail.
Heard on the show
“The paper is called "Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement.”Episode 117 — How an Open AI System Verified 672 Hard Math Proofs for Under $300