Advancing mathematics research with AI-driven formal proof search

Large language models (LLMs) increasingly excel at mathematics tasks, but their unreliability limits their utility in mathematics research. A mitigation is to use LLMs to generate formal proofs in languages such as Lean, in which the compiler verifies every proof step. We present the first demonstration of this method’s value in solving open problems at scale. We built an artificial intelligence agent for formal proof search that autonomously resolved nine of 353 open Erdős problems, proved 44/492 On-Line Encyclopedia of Integer Sequences conjectures, and is being deployed in combinatorics, optimization, graph theory, algebraic geometry, and quantum optics research. Even a basic agent alternating LLM-based generation with Lean-based verification replicated the Erdős successes. These findings demonstrate the power of formal proof search as an enabler of autonomous mathematical discovery.

Authors

Institutions

Publication Details

Journal
Science
Published
2026-10-08
DOI
https://doi.org/10.1126/science.aej2213
Citations
3
Primary Topic
Mathematics, Computing, and Information Processing
Type
article
Field-Weighted Citation Impact
11.07
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Advancing mathematics research with AI-driven formal proof search

Aja Huang, Pushmeet Kohli, Henryk Michalewski, Miklós Z. Horváth et al.
3 citations
Science
Mathematics, Computing, and Information Processing
11.07
article

Advancing mathematics research with AI-driven formal proof search

Aja Huang, Pushmeet Kohli, Henryk Michalewski, Miklós Z. Horváth, Eric Wieser, Swarat Chaudhuri, Codruţ Grosu, Ascher Wagner, Matej Balog, Gergely Bérczi, Thomas Hubert, Francisco J. R. Ruiz, George Tsoukalas, Edward Lockhart, Sergey Shirobokov, Anton Kovsharov, Moritz Firsching, Andrew Ferrauiolo, Anja Surina, Lei Yu, Arun Suggala
article en
3 citations

Abstract

Large language models (LLMs) increasingly excel at mathematics tasks, but their unreliability limits their utility in mathematics research. A mitigation is to use LLMs to generate formal proofs in languages such as Lean, in which the compiler verifies every proof step. We present the first demonstration of this method’s value in solving open problems at scale. We built an artificial intelligence agent for formal proof search that autonomously resolved nine of 353 open Erdős problems, proved 44/492 On-Line Encyclopedia of Integer Sequences conjectures, and is being deployed in combinatorics, optimization, graph theory, algebraic geometry, and quantum optics research. Even a basic agent alternating LLM-based generation with Lean-based verification replicated the Erdős successes. These findings demonstrate the power of formal proof search as an enabler of autonomous mathematical discovery.

ScienceVol. 394(6820)
Google (United States) (US), Aarhus University (DK), Google DeepMind (United Kingdom) (GB)
Openalex Percentile: Top 2%
Mathematics, Computing, and Information Processing
11.07
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.