Formal Conjectures: An Open and Evolving Benchmark for Verified Discovery in Mathematics
Not on the map. Why?
Abstract (arXiv)
As automated reasoning systems advance rapidly, there is a growing need for research-level formal mathematical problems to accurately evaluate their capabilities. To address this, we present Formal Conjectures, an evolving benchmark of currently 2615 mathematical problem statements formalized in Lean 4. Sourced from areas of active mathematical research, the dataset features 1029 open research conjectures providing a zero-contamination benchmark for mathematical proof discovery, and 836 solved problems for proof autoformalization. Notably, the repository provides a structured interface connecting mathematicians who formalize and clarify problems with the AI systems and humans attempting to solve them. Demonstrating its immediate utility, the benchmark has already been leveraged to make new mathematical discoveries, including the resolution of open research conjectures. We describe our approach to ensuring the correctness of these formalizations in a collaborative open-source project where contributions stem from an active community. In this framework, AI-generated proofs and disproofs serve as a valuable auditing mechanism to iteratively improve the fidelity of the benchmark. Finally, we provide a standardized evaluation setup and report baseline results on frozen evaluation subsets, demonstrating a climbable signal that measures the current frontier of automated reasoning on research-level mathematics.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 14 of its 26 references that are in the map. First posted on arXiv 13 May 2026.
Builds on
14 of 26 references.
References · 14
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2025Humanity's Last Examcited by 467
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
- 2025MathArena: Evaluating LLMs on Uncontaminated Math Competitionscited by 275
- 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 153
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 140
- 2019The Lean mathematical librarycited by 127
- 2025Seed-Prover: Deep and Broad Reasoning for Automated Theorem Provingcited by 96
- 2025Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2cited by 95
- 2025Aristotle: IMO-level Automated Theorem Provingcited by 47
- 2025FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Modelscited by 45
- 2026Numina-Lean-Agent: An Open and General Agentic Reasoning System for Formal Mathematicscited by 43
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026RMA: an Agentic System for Research-Level Mathematical Problemscited by 6
- 2026A Case Study on Emergent Cheating and Whistleblowing in Autonomous Research Swarmscited by 3
- 2026OEIS Open: How many conjectures can language models turn into theorems?cited by 2
- 2026AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanicscited by 0
- 2026FrontierMath ErdHoscited by 0
- 2026FrontierMath ErdHos6 Sep 2026
- 2026AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanics4 Sep 2026
- 2026A Case Study on Emergent Cheating and Whistleblowing in Autonomous Research Swarms3 Sep 2026
- 2026OEIS Open: How many conjectures can language models turn into theorems?12 Aug 2026
- 2026RMA: an Agentic System for Research-Level Mathematical Problems20 May 2026