Skip to content
←Back to the radar

SOTA · language

Math

Competition math, proof assistance, numerical reasoning

Mathematics is the domain most easily both overrated and underrated in AGI discussion: overrated because competition scores are now near the human top end, underrated because the gap between "solves problems" and "does research" is far larger than the score suggests. Its relation to AGI is direct: mathematics is one of the few fields with formal ground truth, where a statement can be machine-verified as true or false, so it is simultaneously a ruler for capability and a candidate path for self-improvement (automated conjecturing, automated proving, automated formalisation). Proof assistance matters because it replaces "the model says it is correct" with "the checker says it is correct", which is the only evidence form that can naturally earn a grade A. The ladder now carries dedicated mathematics entries: AlphaEvolve (coding-agent-driven evolutionary search, the only result here validated by a year of production in Borg, recovering 0.7% of Google's global compute), DeepSeek-Prover-V2 (MiniF2F-test 88.9% at pass@8192) and Kimina-Prover (miniF2F 92.2% after TTRL search). The two provers are listed side by side without ranking: their protocols are not commensurable, and pass@8192 is not comparable with pass@1. All three readings need a discount - the prover numbers are vendor-reported and none has been recomputed in a Lean 4 + mathlib environment, while AlphaEvolve's "23% faster matmul kernel" is an empirical reading on specific hardware, not correctness in the sense a Lean check asserts. None of the 12 synced third-party boards is a standalone mathematics board (AIME, FrontierMath, MathArena not wired in), so read what is here as direction rather than as a water level.

RULERAIME, FrontierMath, MathArena

The ladder

3
MathResearchTopB

AlphaEvolve: pointing a model at problems that come with an objective scoring function

Google DeepMind's coding-agent-driven evolutionary search: Gemini Flash proposes candidates in volume and Gemini Pro in quality, automatic evaluators score them, and high scorers stay in the population as next-round context, i.e. evolutionary search with an LLM as the mutation operator; it applies only where an automatic evaluator exists, hence the math and agents filing. An evolved scheduling heuristic has run in production in Google data centres (Borg) for over a year, recovering 0.7% of Google's global compute (Google's compute, not all compute on earth), the card reading and the only result validated by long-running production. An evolved matmul kernel is 23% faster at specific sizes, and about 20% of 50+ open maths problems improved, including 4x4 complex matrix multiplication in 48 multiplications against Strassen's 1969 record of 49. Verification differs from the prover line: a Lean check is mathematical correctness, "23% faster" is an empirical reading on specific hardware. No public weights, Early Access is a waitlist, and the precondition is an evaluator you write yourself. Graded B (contested): a year of production behind the Borg result, nothing reproduced.

0.7%Google global compute recovered (production-verified)Contested · 2025-05
ProductionGoogle DeepMindSite
AlphaEvolve: pointing a model at problems that come with an objective scoring function
MathResearchTopC

DeepSeek-Prover-V2: making the Lean kernel, not the model, the judge of correctness

DeepSeek's formal theorem proving model: a 671B MoE base shared with DeepSeek-V3 and Lean 4 as target language, so formal alignment on a flagship base. The core move is recursive subgoal decomposition at cold start: one-shot proofs of competition statements succeed so rarely that RL has almost no positive samples, so DeepSeek-V3 splits a statement into subgoals, a 7B model proves each, and the composed proofs become training data, trading decomposability for data density; the RL reward is binary and comes from the Lean kernel. Vendor-reported: MiniF2F-test 88.9% at pass@8192, PutnamBench 49/658 (about 7.4%), own ProverBench 325 problems. Read them together: MiniF2F is near saturation at that budget while hard Putnam problems drop an order of magnitude, and ProverBench is self-built and self-run. The public repo (about 1304 stars) ships a ZIP of proofs you can run through Lean, putting verifiability a tier above closed models. Limits: pass@8192 means eight thousand-plus candidates per problem, not comparable with pass@1. Not commensurable with Kimina-Prover's 92.2%, so list both without ranking. Graded C (vendor-stated): nothing recomputed in a standard Lean 4 + mathlib environment.

88.9%MiniF2F-testVendor Claim · 2025-07
ResearchDeepSeekSiteRepo
DeepSeek-Prover-V2: making the Lean kernel, not the model, the judge of correctness
MathResearchTopC

Kimina-Prover: reaching 92.2% on miniF2F with whole-proof RL and no search tree

The Lean 4 theorem proving line from Moonshot AI with Numina, deliberately contrarian: no prover feedback in training or inference, no Monte Carlo tree search, value function or process reward model (arXiv:2504.11354), so search is internalised into a single whole-proof generation, and a custom Formal Reasoning Pattern writes a natural-language draft before Lean code, recasting a sparse binary reward as a language problem. The base is Qwen2.5-72B with up to 32K context. Keep two generations apart: Preview (2025-04) reached 80.7% on miniF2F-test at pass@8192, the first public result above 80%; the 72B model (2025-07-10) reached 92.2% after adding TTRL search and error repair, the highest public reading then and the number on the card, while pass@1 under the same protocol is only 63.9%. Equal-budget pass@1/32/1024 of 63.9/84.0/87.7 leads the 671B DeepSeek-Prover-V2 (61.9/82.4/86.6) at all three budgets. Discounts: that table is Kimina's own and its DeepSeek rows are their reruns, the repo declares no licence, and miniF2F holds 244 problems now past 92%, so its power to separate frontier models is decaying. No third-party board exists here, so read the numbers as direction. Graded C (vendor-stated): nothing recomputed on a pinned commit.

92.2%miniF2F (after TTRL search)Vendor Claim · 2025-07
ResearchMoonshot AI (Numina & Kimi)SiteRepo
Kimina-Prover: reaching 92.2% on miniF2F with whole-proof RL and no search tree

Assets you can use now

No installable skill wired to this domain yet.

Verticals using it

No content maps this capability to a vertical yet.

Boundaries & failure modes

The boundaries here start with the data gap: with no standalone mathematics board wired in, confirmed readings on the same ruler used elsewhere cannot be produced, so any claim of the form "model X aced AIME" can only carry vendor-claim or needs-reproduction in this domain. The industry-level failure modes are equally clear. One, the break between competition problems and research: a short statement, complete conditions and a unique answer cut the problem into an evaluable shape, whereas the hard part of real mathematics is deciding what the problem is - proposing a statement worth proving, finding a definition that does work - and there is no ruler and no reliable system for that yet. Two, numerical reasoning is still brittle: multi-digit arithmetic, unit conversion, dimensional consistency in finance and engineering calculations - large models fail quietly here, emitting no uncertainty and only being caught downstream. Three, the cost structure of formalisation has not changed: turning a proof into something a Lean or Isabelle checker accepts still depends heavily on human effort, automation covers the skeleton and routine steps, and boundary-crossing lemmas still need a person, so the share of mathematics that is actually machine-verified is far lower than outsiders assume. Four, contamination and problem-source exhaustion: AIME and olympiad archives are old and new problem supply cannot keep pace with model iteration, so how much of a score rise is capability and how much is prior exposure cannot currently be separated - which is exactly why no conclusion is drawn here without a board to stand on. Cost and latency: mathematics inference cost sits almost entirely in tokens, a problem requiring long-chain verification can consume tens of thousands of them and higher effort tiers cost more; the bottleneck in the formalisation step is not compute, it is people who know Lean.

As an Amazon Associate, we earn from qualifying purchases.