DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition
FreeAdvancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition
About DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition
DeepSeek-Prover-V2 is an open-source large language model designed for formal theorem proving in Lean 4. It leverages reinforcement learning and subgoal decomposition, initialized with data from a recursive theorem proving pipeline powered by DeepSeek-V3. The model synthesizes cold-start reasoning data by prompting DeepSeek-V3 to decompose complex problems into subgoals, then combines successful subgoal proofs with chain-of-thought reasoning to train a 7B prover model. After fine-tuning, reinforcement learning with binary correct/incorrect feedback further enhances the model's ability to bridge informal reasoning and formal proof construction. The resulting DeepSeek-Prover-V2-671B achieves state-of-the-art performance with an 88.9% pass ratio on the MiniF2F-test and solves 49 out of 658 problems from PutnamBench. The project also introduces ProverBench, a benchmark dataset of 325 problems (including 15 from AIME) to evaluate formalization and proof capabilities.
Key Features
Pros & Cons
- Achieves state-of-the-art results on MiniF2F and PutnamBench
- Open-source and freely available for research and development
- Integrates informal mathematical reasoning with formal proof construction
- Uses reinforcement learning to improve model performance beyond supervised fine-tuning
- Provides a new benchmark (ProverBench) for further research
- Requires significant computational resources (671B parameter model)
- Currently focused on Lean 4, limiting applicability to other proof assistants
- Performance on real-world, non-competition mathematics not fully evaluated
- Cold-start data generation depends on the proprietary DeepSeek-V3 model