Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement
- Published
- Source
- arXiv
- Paper number
- 338
- Field
- AI / General
- arXiv ID
- 2606.06468
Key points
- It uses a strategy that generates and refines blueprints, which are dependency graphs of definitions and lemmas.
- Instead of recursive lemma decomposition, it avoids dead-end loops through parallel proofs and global refinement.
- It uses DeepSeek-V4-Flash, a 284B-A13B open model, as the backbone.
- It achieves 100 percent on MiniF2F-test, 88.8 percent on PutnamBench, 4 out of 6 on IMO 2025, and 11 out of 12 on Putnam 2025.
- It reaches state of the art at up to 500 times lower cost than similar open-source pipelines.
Paper links
External research summaries. These are not HDATF publications or measured product results.