Skip to the content
Aletheia

Collapse, Not Computation · source record · paper

Olympiad-level formal mathematical reasoning with reinforcement learning

Hubert, Thomas; Mehta, Rishi; Sartran, Laurent; Horváth, Miklós Z.; Žužić, Goran; Wieser, Eric; Huang, Aja; Schrittwieser, Julian; Schroecker, Yannick; Masoom, Hussain · 2025

AI-verified citationSRC-HUBERT-2025
identifier / locator
Nature 651(8106): 607–613. DOI: 10.1038/s41586-025-09833-y (AlphaProof; author list abridged)
url
https://doi.org/10.1038/s41586-025-09833-y
verification note
Verified via Crossref (2026-08-22 run) and by reading the published abstract: Nature volume 651, issue 8106, pages 607–613, published 12 November 2025. The abstract confirms AlphaProof solved three of the five non-geometry problems at the 2024 IMO including the hardest problem (P6), that combining with AlphaGeometry 2 reached a silver-medal-equivalent score, and that this took multi-day computation. The 28-of-42 score and the one-point-below-gold threshold are confirmed from Google DeepMind's own accompanying announcement.
reliability notes
  • Peer-reviewed in Nature, with proofs machine-checked in Lean — formal verification means the mathematical results are not in question, whatever one concludes about their significance.
  • Corporate-authored research about the authors' own system, but the Lean verification and the IMO's official framing substantially offset the usual self-report concern.
  • The relevant limitation for this case is conceptual rather than methodological: competition problems have known-solvable answers within an existing framework, which is precisely the distinction the Penrose-side response turns on.

Evidence drawn from this source

Undermines· moderateORCH-E023

AlphaProof: Lean-verified silver-medal IMO performance, peer-reviewed in Nature

what the source states
The abstract reports that AlphaProof, a reinforcement-learning system operating on formal mathematics in Lean, solved three of the five non-geometry problems at the 2024 International Mathematical Olympiad, including the competition's hardest problem (P6), and that combined with AlphaGeometry 2 the system achieved a score equivalent to a silver medal — reported by DeepMind as 28 of 42 points, one point below the gold threshold. Solutions were formally verified in Lean. Some problems required multi-day computation rather than the contest time limit.
what we infer
The most rigorously verified item in this evidence line: Lean machine-checking means the mathematical correctness is not a matter of opinion, and Nature peer review covers the methodology. As a challenge to Penrose the relevant limitation is conceptual rather than methodological, and it is substantial — competition problems are known to be solvable within an existing framework by construction, which is exactly the category the Penrose-side response says was never in dispute. Filed as undermining because the accumulation of formerly-human-only mathematical performance is what the critics' argument rests on, and graded moderate because that argument is contested at ORCH-E025.
limitations
  • IMO problems have known solutions within existing frameworks; not framework extension.
  • Multi-day computation rather than contest conditions for some problems.
  • Corporate-authored research about the authors' own system, though Lean verification substantially offsets this.
  • Bears on the motivation rung only.