NP235/Goedel-Prover-V2-32B
Goedel-Prover-V2-32B by Goedel-LM is a 32 billion parameter language model designed for automated formal proof generation, achieving state-of-the-art performance in theorem proving. It utilizes scaffolded data synthesis, verifier-guided self-correction, and model averaging to master complex mathematical theorems. This model excels at formal mathematics tasks, outperforming larger models on benchmarks like MiniF2F and PutnamBench, making it ideal for advanced mathematical reasoning and proof automation.
Loading preview...
Goedel-Prover-V2-32B: State-of-the-Art Formal Theorem Proving
Goedel-Prover-V2-32B is a 32 billion parameter language model developed by Goedel-LM, setting a new benchmark in automated formal proof generation. This model is distinguished by its innovative training methodology, which includes scaffolded data synthesis for progressive learning, verifier-guided self-correction using Lean's compiler feedback, and model averaging for enhanced robustness.
Key Capabilities and Performance
- Superior Proof Generation: Achieves 88.0% on the MiniF2F test set at Pass@32 in standard mode, and 90.4% with self-correction, significantly outperforming prior state-of-the-art models like DeepSeek-Prover-V2-671B and Kimina-Prover-72B.
- Efficient Self-Correction: Leverages Lean compiler feedback to iteratively refine proofs, improving quality with a modest increase in computational cost (total output length from 32K to 40K tokens).
- Exceptional Mathematical Reasoning: Solved 64 problems on PutnamBench at Pass@64, surpassing DeepSeek-Prover-V2-671B's record of 47 problems at Pass@1024, demonstrating strong performance with significantly less compute.
- Compelling Scaling: Consistently outperforms previous state-of-the-art models across various inference-time compute budgets.
- New Benchmark Release: Accompanied by the release of MathOlympiadBench, a dataset of 360 human-verified formalizations of Olympiad-level mathematical problems, including IMO problems.
Why Goedel-Prover-V2-32B is Different
Unlike many general-purpose LLMs, Goedel-Prover-V2-32B is specifically engineered and optimized for the highly specialized domain of formal theorem proving. Its unique training innovations enable it to tackle complex mathematical proofs with unprecedented accuracy and efficiency for its size. The model's ability to self-correct and its strong performance on challenging benchmarks like MiniF2F and PutnamBench, often matching or exceeding much larger models, highlight its specialized prowess.
Should You Use This Model?
- Ideal for: Researchers and developers focused on automated theorem proving, formal verification, mathematical AI, and educational tools for advanced mathematics. If your use case involves generating or verifying formal proofs in environments like Lean 4, this model offers state-of-the-art capabilities.
- Consider alternatives if: Your primary need is for general-purpose text generation, creative writing, conversational AI, or tasks outside the realm of formal mathematical reasoning. While powerful in its niche, it is not designed for broad language tasks.