- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper is well-written in structure and clearly describe the training process and data used. The main contributions are:
- Develops 4B and 32B prover models that achieve good performance among open-source models.
- Proposes an efficient data augmentation pipeline, ALF.
- Introduces the first diffusion-based theorem prover, featuring tactic-level masking.
Critical strengths
- Tactic-level masking for the diffusion-based prover is a meaningful methodological innovation.
- The paper provides a detailed analysis of model performance.
Critical weaknesses
-
Limited novelty in the AR training pipeline. The training procedure for the autoregressive models is not particularly novel. Most of the methodological novelty lies in the ALF data augmentation pipeline. However, there is no clear ablation comparing training with ALF-generated data against training with general data under the same training procedure.
-
Potential reduction in training data difficulty. Using an existing prover to verify formalized problems may reduce the difficulty of the retained training data, potentially preventing the resulting model from surpassing existing provers.
-
Limited performance improvements. Pythagoras-Prover-32B achieves 89.8%, compared with 88.1% for Goedel-Prover-V2-32B. Furthermore, there is no performance difference in the "+Self Correction" setting.
Questions for authors
-
Ablation of ALF. As I understand it, the training pipeline consists of SFT → RL → ALF self-distillation. Therefore, the ALF ablation in Table 4 should compare the model after RL with the final model, rather than comparing the model after SFT with the final model. Could the authors clarify this experimental design?
-
Effectiveness of continued SFT through self-distillation. The continued SFT process is not entirely intuitive to me. Specifically, the post-RL Pythagoras-Prover generates one candidate proof per statement, and these generated proofs are then used for continued SFT. It seems that these generated problems are already within the model's capabilities, yet continued SFT still improves performance. Could the authors provide additional experiments or insights to explain this phenomenon?
-
Difficulty of the training data. In Section 2.1, the authors mention using Goedel-Prover-v2-32B to generate proofs and filter formalized statements based on proof correctness. Does this process reduce the difficulty of the retained training data?
-
Ablation of tactic-level masking. For the diffusion-based prover, what are the benefits of tactic-level masking compared with standard token-level masking? Is there an ablation study demonstrating the effectiveness of this design?
5 comments
Responses to Reviewer jHEu (Part 2)
[W3.] Limited performance improvements. Pythagoras-Prover-32B achieves 89.8%, compared with 88.1% for Goedel-Prover-V2-32B. Furthermore, there is no performance difference in the "+Self Correction" setting.
Thank you for bringing this to our attention. We would like to highlight that, as shown in Table 1, Pythagoras-Prover-32B consistently outperforms Goedel-Prover-V2-32B at every shared sampling budget without self-correction, achieving 89.8% versus 88.1% at pass@32.
Furthermore, although Pythagoras-Prover-32B matches the performance of Goedel-Prover-V2-32B with self-correction at pass@1024 (92.6% versus 92.6%), our model achieves this result using standard restart sampling alone, without requiring iterative inference-time repair. At pass@2048, Pythagoras-Prover-32B further reaches 93.0%, surpassing Goedel-Prover-V2-32B's best reported result of 92.2% at pass@8192, while using only one-quarter of the sampling budget. This advantage also extends to PutnamBench, where, at comparable estimated Effective Token Complexity (ETC), Pythagoras-Prover solves 88 problems at pass@1024, compared with 86 for Goedel-Prover-V2 with self-correction at pass@184, as detailed in Appendix F.
Importantly, as discussed in Section 5.2, MiniF2F-Test is approaching saturation, with 83.2% of problems solved by all four evaluated provers. Consequently, the remaining room for improvement is relatively limited, making these performance gains meaningful, particularly given that our model achieves them without additional inference-time self-correction.
[Q1.] Ablation of ALF. As I understand it, the training pipeline consists of SFT → RL → ALF self-distillation. Therefore, the ALF ablation in Table 4 should compare the model after RL with the final model, rather than comparing the model after SFT with the final model. Could the authors clarify this experimental design?
To our knowledge, no existing Lean corpus provides structured statement variants at ALF’s scale (~2M instances), hence no external dataset allows a direct comparison. Self-distillation on unchanged statements cannot match ALF’s data volume by construction. Unchanged statements are bounded by the Lean-verified seed corpus (~0.8M), and the additional instances exist only because ALF mutates each statement into formally distinct variants. Increasing volume without mutation would instead require repeatedly sampling proofs for the same statements, which the model has already been trained on during SFT. Hence, to address your concern, we ran the matched control in which we finetuned the base 4B model on the ~2M datapoints of the ALF dataset.
The Table below (similar to the table attached on addressing W1) compares the performance of SFT+finetuning on ALF data with that achieved at each stage of our original 4B training pipeline on the original MiniF2F-Test, whose statements are not mutated (thus they do not depend on ALF-style evaluation).
| Model variant | MiniF2F-Test (Pass@32) |
|---|---|
| SFT | 79.10 |
| SFT + fine-tuning on ALF data (new ablation) | 82.19 |
| SFT + RL | 81.69 |
| Full pipeline (original) | 86.07 |
As we can see, ALF contributes +4.38 points over the post-RL checkpoint, showing the strength of applying ALF after the conventional post-RL methodology and +3.09 over the SFT checkpoint without RL, yielding a better result than the post-RL checkpoint. Thus, the diversity introduced by ALF improves the model both with and without RL, and the two stages are complementary, with the full training pipeline gaining +6.97 over SFT, and thus showing that the diversity introduced by the dataset helps in further improving the model.
We have included these results in Table 5 and discuss them in Appendix C.4, marked in blue.
Responses to Reviewer jHEu (Part 3)
[Q2.] Effectiveness of continued SFT through self-distillation. The continued SFT process is not entirely intuitive to me. Specifically, the post-RL Pythagoras-Prover generates one candidate proof per statement, and these generated proofs are then used for continued SFT. It seems that these generated problems are already within the model's capabilities, yet continued SFT still improves performance. Could the authors provide additional experiments or insights to explain this phenomenon?
Thank you for raising this question. We would like to clarify that the final training stage is self-distillation rather than conventional SFT, where the model is trained on the ALF-augmented dataset instead of reusing the original RL training data.
As demonstrated by Zhang et al. (2026) [5], self-distillation can improve model performance even when the generated samples fall within the model's existing capabilities. This is because the improvement primarily comes from reshaping the model's output distribution rather than acquiring new knowledge. Specifically, self-distillation encourages the model to assign greater confidence to precise outputs, such as tactic syntax and lemma names, while preserving diversity where multiple proof strategies remain viable. Consequently, the model learns to express its existing proof-solving capabilities more reliably during inference, explaining why continued SFT can improve performance despite the absence of additional external supervision.
We have included the explanation in the Appendix C.5 of the revised manuscript.
[5] Zhang, Ruixiang, et al. "Embarrassingly simple self-distillation improves code generation." arXiv preprint arXiv:2604.01193 (2026).
[Q3.] Difficulty of the training data. In Section 2.1, the authors mention using Goedel-Prover-v2-32B to generate proofs and filter formalized statements based on proof correctness. Does this process reduce the difficulty of the retained training data?
We acknowledge that any generate-and-verify pipeline inherently retains only those instances that fall within the generating model's capabilities. However, this limitation applies equally to existing open-source theorem provers and approaches that distill training data from frontier models.
To mitigate this limitation, our data construction incorporates three complementary strategies:
- Hard-problem sourcing: We construct the hard tier from competition-level mathematical problems, which require more challenging and non-routine reasoning.
- Increased sampling budget: We increase the sampling budget to (n=4) for hard-tier problems, compared with (n=2) for easy and medium problems, to improve the coverage of difficult instances. We also reserve the original Big-Math hard problems for RL, rather than including them in SFT.
- ALF augmentation: We further expand the training distribution through ALF-generated statement variants, introducing additional structural diversity beyond the original Lean-verified corpus.
Importantly, as shown in Table 1, Pythagoras-Prover-32B surpasses Goedel-Prover-V2-32B, the model used for proof generation and filtering. This demonstrates that, although the initial data filtering is constrained by the generator's capabilities, it does not impose a corresponding upper bound on the performance of the final trained prover.
[Q4.] Ablation of tactic-level masking. For the diffusion-based prover, what are the benefits of tactic-level masking compared with standard token-level masking? Is there an ablation study demonstrating the effectiveness of this design?
Thank you for raising this question. The key distinction is that standard token-level masking allows masked tokens to be predicted from visible tokens within the same tactic, whereas our tactic-level masking requires the model to reconstruct complete proof steps. This aligns the denoising objective with the complete Lean tactics committed during inference, as described in Section 2.4.
Initial Observation: In our experiments, we observed that the diffusion model fails to generate Lean-valid proofs without tactic-level masking. As further discussed in Appendix C.8, diffusion-based theorem proving faces three primary challenges: (i) Sparse supervision under conventional random masking, (ii) Limited stable training-context lengths, (iii) Scarcity of diffusion-suitable Lean training data. Therefore, tactic-level masking is a necessary component for successful Lean proof generation in our setting, rather than merely providing an incremental performance improvement.
Our approach addresses the first challenge through tactic-level masking and the third through ALF self-distillation. Without these interventions, the diffusion model fails to produce valid Lean proofs in our experiments, while the context-length limitation remains an open challenge.
We are happy to address any further concerns. Thank you again for the insightful feedback.
Responses to Reviewer jHEu (Part 1)
We thank Reviewer jHEu for the constructive feedback, as well as for recognizing the strong performance of Pythagoras-Prover 4B and 32B among open-source models and our introduction of the first diffusion-based theorem-proving model.
Our contributions extend beyond ALF, which we address below with the synthetic data-generation pipeline, dynamic proof-reasoning filtering, and the extension of this recipe. Specifically:
To isolate the effect of the mutations themselves, we further fine-tuned the ALF dataset directly based on the base model, yielding 82.19% (as shown in Table 5, which we discuss in Appendix C.4). This shows the strength and high quality of our dataset. Thank you again for raising this concern. We have included the clarification in Appendix G.
Thank you for raising this concern. We acknowledge that using an existing prover for proof generation and verification may limit the difficulty of the retained training instances. However, distillation from existing provers is a common practice among open-source theorem provers and LLMs [1-4]. Furthermore, the terms of service of closed-source models often restrict their use for training competing models, while manual formalisation at this scale is prohibitively expensive, making distillation from existing open-source provers a practical approach.
Importantly, our experimental results demonstrate that this approach does not impose an upper bound on the resulting model's performance. As shown in Table 1, Pythagoras-Prover-32B surpasses Goedel-Prover-V2-32B, the very prover used for data generation, achieving 89.8% versus 88.1% at pass@32. At their respective best reported sampling budgets, Pythagoras-Prover-32B further achieves 93.0% at pass@2048, exceeding Goedel-Prover-V2-32B's 92.2% at pass@8192 with only one-quarter of the sampling budget. These results indicate that although the initial data generation is constrained by the existing prover's capabilities, this does not prevent the final model from surpassing its performance.
[1] Lin, Yong, et al. "Goedel-prover-v2: Scaling formal theorem proving with scaffolded data synthesis and self-correction." (2026).
[2] Lee, Sunbowen, et al. "Distillation quantification for large language models." (2025).
[3] Lin, Yong, et al. "Goedel-prover: A frontier model for open-source automated theorem proving." (2025).
[4] Ren, Z. Z., et al. "Deepseek-prover-v2: Advancing formal mathematical reasoning via reinforcement learning for subgoal decomposition." (2025).