about
Seed-Prover: Deep and Broad Reasoning for Automated Theorem Proving (arxiv.org)
3 points by jonbaer on Aug 3, 2025 | hide | past | pdf | discuss on HN

In plain words: Seed-Prover writes a full proof in a language a computer can check, then repeatedly fixes it using the checker's feedback, already-proved lemmas, and its own notes. It fully solved 5 of 6 problems at the 2025 math olympiad, far ahead of the best earlier system.

Abstract

LLMs have demonstrated strong mathematical reasoning abilities by leveraging reinforcement learning with long chain-of-thought, yet they continue to struggle with theorem proving due to the lack of clear supervision signals when solely using natural language. Dedicated domain-specific languages like Lean provide clear supervision via formal verification of proofs, enabling effective training through reinforcement learning. In this work, we propose \textbf{Seed-Prover}, a lemma-style whole-proof reasoning model. Seed-Prover can iteratively refine its proof based on Lean feedback, proved lemmas, and self-summarization. To solve IMO-level contest problems, we design three test-time inference strategies that enable both deep and broad reasoning. Seed-Prover proves $78.1\%$ of formalized past IMO problems, saturates MiniF2F, and achieves over 50\% on PutnamBench, outperforming the previous state-of-the-art by a large margin. To address the lack of geometry support in Lean, we introduce a geometry reasoning engine \textbf{Seed-Geometry}, which outperforms previous formal geometry engines. We use these two systems to participate in IMO 2025 and fully prove 5 out of 6 problems. This work represents a significant advancement in automated mathematical reasoning, demonstrating the effectiveness of formal verification with long chain-of-thought reasoning.

Luoxin Chen, Jinming Gu, Liankai Huang, Wenhao Huang, Zhicheng Jiang, Allan Jie, Xiaoran Jin, Xing Jin, Chenggang Li, Kaijing Ma, Cheng Ren, Jiawei Shen, et al.
arXiv:2507.23726 · cs.AI, cs.CL · submitted Jul 31, 2025 · updated Aug 1, 2025
abstract · pdf

add comment on HN