Back to all fields

Mathematics

Can AI discover useful mathematics and check its own reasoning?

33%

field summary estimate

6 outcomes · Assessed November 7, 2026 · Low confidence

The field estimate averages its outcome scores. It is a reading aid, not a measured fraction of the field that AI manages.

How the estimate built up.

Each band is one outcome's share of the field estimate, so the top line is the estimate itself. Every field starts at 0% on December 31, 2022. Dates before the latest are retrospective estimates. Point at a band to see that outcome's score on each date.

0%10%20%30%40%Time to a new proof. December 31, 2022: 0%; November 7, 2025: 15%; May 7, 2026: 20%; October 7, 2026: 30%; November 7, 2026: 30%Substantial novelty. December 31, 2022: 0%; November 7, 2025: 20%; May 7, 2026: 20%; October 7, 2026: 25%; November 7, 2026: 25%Research productivity. December 31, 2022: 0%; November 7, 2025: 10%; May 7, 2026: 15%; October 7, 2026: 20%; November 7, 2026: 20%Research problem success. December 31, 2022: 0%; November 7, 2025: 15%; May 7, 2026: 15%; October 7, 2026: 25%; November 7, 2026: 25%Formal verification. December 31, 2022: 0%; November 7, 2025: 25%; May 7, 2026: 30%; October 7, 2026: 40%; November 7, 2026: 45%Advanced examination performance. December 31, 2022: 0%; November 7, 2025: 25%; May 7, 2026: 30%; October 7, 2026: 40%; November 7, 2026: 50%0.0%December 31, 2022: field estimate 0.0%18.3%November 7, 2025: field estimate 18.3% (reconstructed)21.7%May 7, 2026: field estimate 21.7% (reconstructed)October 7, 2026: field estimate 30.0% (reconstructed)32.5%November 7, 2026: field estimate 32.5%Dec 31, 2022Nov 7, 2025May 7, 2026Nov 7, 2026
View exact historical values and reconstruction notes

What we measure

Each percentage is a judgment about progress toward independent advancement. Open the evidence to inspect the basis for it.

Advanced examination performance

50%estimated progress

What we track

Fully correct solutions / all assigned fresh graduate-level problems, plus rubric-based partial credit. Use timed, independently written qualifying or comprehensive exam sets; report algebra, analysis, geometry, probability, and other branches separately. Doctoral programs do not share a universal final exam.

Why this estimate?

Some supplied-statement proof benchmarks are saturated, supporting strong execution on bounded tasks. Fresh examination coverage, autonomous problem formulation and independent semantic checking remain incomplete; the baseline's 100% benchmark score is not 100% autonomy.

Advancements

Read the dated findings and sources

Status: a useful graduate-level formal-proof proxy exists; the exact fresh-examination measure is not yet established. Retrieval date for all sources below: November 7, 2026. A page's update date is not necessarily the date each model was tested.

Dated findings

Evidence dateResultScope and source
March 27, 2026, paper v1Claude Opus 4.5 Thinking: 33.5%, equivalent to 67/200; Gemini 3 Pro: 18.5%; GPT-5.2: 13.5%.Historical FormalProofBench evaluation: 200 advanced undergraduate/graduate problems, supplied Lean statements, up to 40 tool-assisted turns. Paper, Table 2.
October 29, 2026, leaderboard updateProofBench v1.1: Sonnet 5.5, Opus 5.5, Fable 5.1, and AlephProver each 100/100; GPT-6.1 Sol 99/100.Private test split; qualifying-exam/textbook material with supplied formal statements. General models get 40 turns; specialist systems have different harnesses. The provider explicitly disallows comparisons with earlier revisions. Vals AI methodology and results.

The current grader permits native_decide, broadening the trusted computing base. Scores therefore do not establish compliance with a stricter kernel-only audit. Vals AI.

Interpretation and tracking value

Record 100% on ProofBench v1.1 as a saturated benchmark observation, not “100% of PhD final exams.” The requested measure additionally requires fresh questions, timed examination conditions, per-branch reporting, and a matched human comparison. Those conditions were not established together by the reviewed evidence. Status for that exact measure: not measured, not zero.

Do not calculate a March-to-October percentage-point improvement: the benchmark changed. Nor does solving supplied formal statements measure the ability to formulate the right statement from scratch.

Next comparable measurement

Preserve the v1.1 label, private-test denominator, model configuration, permitted axioms, and tool budget. Obtain a fresh 100-question examination set across five branches with blinded grading and human controls. Record complete correctness, partial credit, time, and branch-level outcomes separately. When replacing a saturated benchmark, run overlapping models on both versions rather than splice their scores.

Open the full research note

Formal verification

45%estimated progress

What we track

Percentage of claimed completed proofs with a reproducible Lean project, pinned Lean and mathlib versions, and an independent clean rebuild and proof audit.

Why this estimate?

Large Lean formalizations show substantial execution capability. Artifact coverage is incomplete, and humans still choose statements, check meaning, review axiom use and supervise difficult formalization. Independent clean-rebuild coverage is unknown.

Advancements

Read the dated findings and sources

Status: large public Lean artifacts and verification protocols exist; the requested independently audited coverage percentage is not established. Sources accessed November 7, 2026. No Lean project was compiled or independently audited during this documentary review.

Dated findings

Evidence dateFindingVerification level
September 4, 2026Anthropic reports an end-to-end Lean formalization of Fermat's Last Theorem, using the three standard axioms and a Comparator match to Mathlib's statement. Kevin Buzzard is quoted as reviewing it.Developer report with named external review and public repository; this formalizes known mathematics. Technical report.
October 7, 2026 version historyOpenAI records 300/719 top-line results formalized, approximately 41.72%.Historical artifact-coverage figure, not a percentage independently re-audited here. Later entries record additional formalizations and configuration fixes, so retain the date and denominator. Release history.
November 7, 2026 repository observationOpenAI's README still describes approximately 42% formalization coverage.Rounded provider summary; do not multiply it by the current catalogue size to invent an exact count. Repository.
October 29, 2026 ledger updateEpoch's Erdős evaluation requires Comparator to check identical statements, permitted axioms, and Lean-kernel replay in an isolated environment.Benchmark evaluator's validation protocol, stronger than a bare compilation claim. Methodology.

Interpretation and tracking value

Maintain two distinct series: published formal-artifact coverage and independently audited coverage under this project's rule. The former has a dated 300/719 observation for one collection; the latter is unknown. Public repositories and successful compilation do not automatically establish clean rebuilds, semantic correspondence, or novelty.

Fermat's Last Theorem is a demonstration of formalization scale, not a newly discovered theorem. Do not count its intermediate lemmas as independently novel discoveries.

Next comparable measurement

Choose a frozen collection and commit. For every claimed completed proof, record whether source, pinned dependencies, reproducible build, axiom audit, statement review, and independent evaluator signoff are present. Report the numerator passing every check over all claims in that collection, with failure reasons. Retain original releases and corrections so verification coverage can be reconstructed over time.

Open the full research note

Research problem success

25%estimated progress

What we track

Independently accepted solutions / all preregistered research problems within a fixed time and compute budget. Separate known-answer problems from genuinely open ones.

Why this estimate?

The baseline contains accepted open-problem successes, including 3/68 in a fixed-budget evaluation. This is early research capability on selected problems; humans still set agendas and establish significance. The 25% estimate is not the measured problem-solving success rate.

Advancements

Read the dated findings and sources

Status: positive results on open problems, with measurable but highly benchmark-specific success rates. All sources were checked November 7, 2026; percentages calculated below are simple successes divided by the stated denominator.

Dated findings

Evidence dateResultScope and source
May 21, 2026 submission; June 8 revisionAlphaProof Nexus: 9/353 Erdős problems, or 2.55%; 44/492 OEIS conjectures, or 8.94%.Author-reported formal-proof search; the Erdős campaign allowed up to 3,000 episodes per problem. These are different corpora, not interchangeable difficulty levels. Research paper.
September 6, 2026 paperGPT-6 Astra approximately 3%; four other evaluated systems 0%.Initial FrontierMath Erdős release. Benchmark paper.
October 3 runs; ledger updated October 29, 2026GPT-6.1 Sol has three official solves, #1, #74, and #126: 3/68 = 4.41%, calculated from the ledger.One attempt per conjecture, at most $300 and 72 working hours. The same ledger lists 17 resolved entries across all sources, including human/outside work; 17/68 is not a model score. Epoch's dated solution ledger and methodology.
November 7, 2026 observationFrontierMath Open Problems displays 5 AI-only, 5 human-plus-AI, and 39 unsolved entries.49 listed entries; the heading still says 50. Its changelog records a removal and attribution-policy changes. Treat these as inventory counts, not a fixed-budget attempt success rate. Epoch Open Problems.

Interpretation and tracking value

Use 3/68 at the stated Epoch budget as the clearest recent, reproducible-protocol reference in this review. It remains evaluator-reported evidence, not a proof rebuild performed for this repository. Separate the earlier 353-problem campaign and the Open Problems inventory into different series.

These figures do not imply a 4.41% chance of solving an arbitrary research question. Problem selection, existing formal statements, budgets, and publication exposure matter. With only three successes, small count changes produce large relative changes.

Next comparable measurement

Capture task IDs, model release and training cutoff, exact harness, number of attempts, actual spend, timeouts, and accepted proof artifacts. Re-evaluate the same unresolved subset under the same budget; flag problems whose solutions became public before later models' training cutoffs. Preserve full-set historical scores alongside any contamination-filtered comparison.

Open the full research note

Research productivity

20%estimated progress

What we track

Accepted substantially new results per total research dollar and human hour, with difficulty and significance reviewed rather than inferred from raw theorem counts.

Why this estimate?

Low-cost benchmark proofs and growing research output suggest useful assistance. Full costs, human hours and independently accepted substantial results are not jointly measured, so autonomous sustained research productivity has the weakest evidence here.

Advancements

Read the dated findings and sources

Status: inference-cost and output-volume proxies are available; accepted novel results per total dollar or human hour remain unmeasured. Sources accessed November 7, 2026. Costs below are source-era figures, not current API price estimates.

Dated findings

Evidence dateObservationAccounting limitation
March 27, 2026FormalProofBench: Opus 4.5 Thinking averages $1.34 per test at 33.5% success. Dividing gives approximately $4.00 per successful benchmark proof.Derived inference-cost proxy; includes test failures through the average, but excludes labor and research novelty. Paper.
June 8, 2026 revisionAlphaProof Nexus reports per-problem inference costs of a few hundred dollars.Authors explicitly say these exclude the full discovery search across 353 problems; some comparisons omit AlphaProof cost, estimated at $60 per problem. Cost discussion.
October 6 release; repository observed November 7OpenAI describes approximately 4,000 posed problems and a catalogue of 721 manuscripts in 373 families.No one-to-one mapping from attempted problems to independent accepted discoveries; dividing catalogue counts by 4,000 would be misleading. Repository.
September 4, 2026Anthropic reports roughly six billion output tokens for its Fermat formalization.Resource-use disclosure, not a complete dollar or human-labor cost and not a novel-discovery numerator. Anthropic.

Interpretation and tracking value

Record approximately $4 per successful historical FormalProofBench task only as a narrow cost proxy. It does not measure research productivity, and price changes alone can improve it without a mathematical capability gain.

For the requested measures, record accepted novel results per total research dollar: unknown; per human hour: unknown; improvement against matched human research: unknown. Public evidence reviewed here does not supply a complete, comparable numerator and denominator. Discovery claims, candidate screening, formalization, and expert validation consume different resources.

Next comparable measurement

Follow a fixed prospective cohort. Count all failed searches, model and tool costs, hardware, preparation, formalization, specialist review, repair, and human time. Count each accepted substantial result once. Report total campaign cost divided by accepted results, accepted results per human hour, and quality/significance strata. If nothing qualifies, report zero accepted output and full expenditure rather than omit the campaign. Compare AI-assisted and human-only cohorts using matched problems and observation periods.

Open the full research note

Substantial novelty

25%estimated progress

What we track

Count proofs approved by at least two independent specialists after a documented literature search. Classify a new theorem separately from a substantially new proof of a known theorem. Renaming variables, rearranging steps, routine specialization, or translating a known proof into Lean does not qualify as substantial novelty.

Why this estimate?

Evidence supports some novel mathematical contributions, but catalogue counts contain related, revised and unverified claims. Establishing significance and prior art still depends heavily on specialists, and the project's fully qualified novelty count is unknown.

Advancements

  • FunSearch finds the largest cap sets in 20 yearsDecember 14, 2023. Google DeepMind's FunSearch wrote programs that found the largest cap sets ever found in some settings, the biggest size increase in about 20 years.
  • AlphaEvolve beats Strassen's 1969 method for 4x4 matrix multiplicationMay 14, 2025. AlphaEvolve found a way to multiply two 4x4 complex-valued matrices with 48 scalar multiplications, and set a new lower bound for the kissing number in 11 dimensions with 593 spheres.
  • DeepMind-led team finds new families of unstable fluid singularitiesSeptember 17, 2025. Using machine-learning architectures with a high-precision Gauss-Newton optimizer, the authors report the first systematic discovery of new families of unstable self-similar singularities, for the incompressible porous media equation and the 3D Euler equation with boundary, at accuracy that for some solutions approaches double-float machine precision.
  • OpenAI model disproves Erdős's unit distance conjectureMay 20, 2026. Nine mathematicians, including Noga Alon, Thomas Bloom, Tim Gowers and Will Sawin, posted a short, human-verified version of an OpenAI-generated counterexample to the Erdős unit distance conjecture, noting that the argument draws on ideas traceable to earlier work in number theory.
  • AlphaProof Nexus resolves open Erdős and OEIS questionsMay 21, 2026; revised June 8. AlphaProof Nexus authors report resolutions of open Erdős/OEIS questions and an improved convex-optimization bound using a new parameter schedule.
  • Hadamard matrix of order 668 reported by three humans working with ClaudeAugust 12, 2026 (changelog entry). Epoch AI's FrontierMath: Open Problems page records that a solution to its Hadamard matrix of order 668 problem was reported by a researcher from Anthropic, crediting a team of three humans and Claude; the problem is listed as Solved (human + AI).
Read the dated findings and sources

Status: documented research advances and large claim collections exist; a count satisfying this project's full novelty-and-verification rule is not yet established. Sources accessed November 7, 2026.

Dated findings

Evidence dateFindingNovelty classification for this baseline
May 21, 2026; revised June 8AlphaProof Nexus authors report resolutions of open Erdős/OEIS questions and an improved convex-optimization bound using a new parameter schedule.Research-discovery evidence, author reported. Do not automatically treat every formalized conjecture as a separately significant new theorem. Paper.
September 4, 2026Fermat's Last Theorem formalization follows existing mathematics.Formalization achievement; excluded from the count of substantially new theorems or proof strategies. Anthropic.
November 7, 2026 observationOpenAI's catalogue lists 721 manuscripts in 373 related-result families and describes the material as research data at differing verification stages.Candidate claims, not 721 independently accepted discoveries; related papers can share one result. Repository README.
October 7, 2026 correction recordThree manuscripts withdrawn; 14 others revised.Track withdrawals and repairs explicitly. A release count cannot stand in for a vetted novelty count. Release history.
November 7, 2026 observationEpoch's Open Problems inventory classifies one AI-associated solution as a breakthrough and one as a major advance; both are human-plus-AI entries.Editorial significance assessments, distinct from this project's required two-specialist novelty approval and Lean audit. Epoch inventory.

Interpretation and tracking value

The baseline is positive evidence of novel research, with an unestablished qualifying count. Do not record zero: this review did not perform a comprehensive adjudication of all candidates. Conversely, neither proof compilation nor a publisher's claim establishes that all required novelty checks have passed.

Separate new theorems, substantially new proofs of known theorems, improved bounds, routine consequences, rediscoveries, and formalizations. Assign one stable discovery ID across related manuscripts and research areas.

Next comparable measurement

Create a candidate ledger containing exact theorem, earliest public date, prior-art search, AI/human contribution, two independent specialist decisions, Lean artifact and audit, and acceptance date. Promote only fully documented candidates into the qualifying count. Preserve withdrawn, disputed, and pending records. Reassess credit and priority when new prior work appears rather than silently rewriting the historical total.

Open the full research note

Time to a new proof

30%estimated progress

What we track

Wall-clock hours from frozen problem statement to accepted proof; separately report time to informal argument, Lean formalization, and independent review. Include failed attempts and human hours. Report unresolved problems at the cutoff instead of dropping them from timing results.

Why this estimate?

Generation and known-theorem formalization can be rapid. The end-to-end time from a new question to a verified substantial result, including failed searches and human work, is still unmeasured. Fast selected demonstrations therefore receive only partial credit.

Advancements

Read the dated findings and sources

Status: public generation and formalization timings exist, but no comparable end-to-end time-to-accepted-new-proof baseline was established. Sources accessed November 7, 2026.

Dated findings

Evidence dateTimingWhat the clock actually measures
March 27, 2026FormalProofBench reports mean latency of 4,036.78 seconds, approximately 67.28 minutes, per test for Claude Opus 4.5 Thinking.Query execution including retries across the benchmark, not time to a successful novel theorem. Paper, Table 2 and section 5.2.
September 4, 2026Anthropic reports 11 days for Fermat formalization and three days for a Vinogradov three-primes formalization.Known-theorem formalization demonstrations; the Fermat effort used parallel agents and human guidance. These are not novel-discovery or independent-acceptance times. Anthropic.
October 6, 2026 releaseOpenAI reports roughly three hours of ChatGPT Pro thinking-equivalent compute per average result.A compute-equivalence estimate, not observed elapsed time from problem assignment through specialist acceptance. Release announcement.

Interpretation and tracking value

Baseline for median end-to-end hours to an independently accepted, substantially new, Lean-audited proof: not measured. This is a missing measurement, not evidence that no new proofs exist.

Keep generation, formalization, automated checking, and human review clocks separate. Parallel execution can reduce wall time while increasing aggregate compute. An average over selected successes also omits unsuccessful research, so it cannot predict time to a new accepted result in a prospective campaign.

Next comparable measurement

For each prospectively assigned problem, record assignment time, first correct informal proof, completed Lean artifact, independent rebuild, and final novelty/acceptance decision. Log active human hours and all parallel compute separately. Retain unresolved cases with their observation cutoff. Report success fraction at fixed horizons, then time distributions with unresolved cases appropriately censored; do not compute a success-only average and label it the campaign's completion time.

Open the full research note