By verification grade
12 of 22 carry an independent check. Open the review queue.
Open longest before falling
- 331 yrImproved lower bound for the 11-dimensional kissing numberposed 1694 · AlphaEvolve (Gemini-based)
- 87 yrCounterexample to the Jacobian conjecture in dimension threeposed 1939 · Claude Fable 5
- 80 yrDisproof of the Erdős unit-distance conjectureposed 1946 · GPT-5 series reasoning model
- 70 yrImproved bound for the Erdős minimum-overlap problemposed 1955 · AlphaEvolve (Gemini-based)
From the 7 of 22 entries recording a posed year. Add a missing one.
| Date | Finding | Lab | Model | Verification | Autonomy | Field |
|---|---|---|---|---|---|---|
| 2026-07-20 | Counterexamples to the Gaussian moments conjecture | Independent | GPT-5.6 Sol Pro + Claude Fable 5 | AI-led | mathematics | |
| 2026-07-19 | Counterexample to the Jacobian conjecture in dimension three | Anthropic | Claude Fable 5 | Formally verified | Collaborative | mathematics |
| 2026-07-14 | Near-quadratic lower bound for derivative-free convex optimization | Independent | GPT-5.6 Sol Pro | Formally verified | AI-led | mathematics |
| 2026-07-11 | Counterexample to Grothendieck's question on finite flat group schemes | Independent | OpenAI Sol (construction); Claude Fable (Lean formalisation) | Formally verified | Collaborative | mathematics |
| 2026-05-21 | Nine Erdős problems and 44 OEIS conjectures proved with machine-checked proofs | Google DeepMind | AlphaProof Nexus (LLM + Lean) | Formally verified | Search scaffold | mathematics |
| 2026-05-20 | Disproof of the Erdős unit-distance conjecture | OpenAI | GPT-5 series reasoning model | Independently checked | AI-led | mathematics |
| 2026-01-15 | Structure in Bruhat intervals of permutation groups | Google DeepMind | AlphaEvolve (Gemini-based) | Independently checked | Search scaffold | mathematics |
| 2026-01-13 | Erdős problem #728 resolved and formalized in Lean | OpenAI / Harmonic | GPT-5.2 Pro + Aristotle | Formally verified | Autonomous | mathematics |
| 2025-11-03 | AlphaEvolve across 67 problems: 20 improvements, 8 regressions | Google DeepMind | AlphaEvolve (Gemini-based) | Independently checked | Search scaffold | mathematics |
| 2025-10-19 | GPT-5 "solved 10 Erdős problems": it located existing solutions | OpenAI | GPT-5 | Already known | Retrieval | mathematics |
| 2025-09-17 | New families of unstable singularities in fluid equations | Google DeepMind (with Brown, NYU and Stanford) | Physics-informed neural networks with Gauss–Newton optimisation | Search scaffold | mathematics | |
| 2025-09-11 | Strong prime number theorem formalized in Lean by an autoformalization agent | Math, Inc. | Gauss (autoformalization agent) | AI-assisted | mathematics | |
| 2025-08-01 | Improved step-size bound in smooth convex optimization | OpenAI | GPT-5 Pro | Already known | AI-assisted | mathematics |
| 2025-07-28 | Machine-checked Lean proofs for five of six 2025 IMO problems | Harmonic | Aristotle | Formally verified | AI-led | mathematics |
| 2025-07-21 | Gold-medal standard at the 2025 International Mathematical Olympiad | Google DeepMind | Gemini Deep Think (advanced version) | Independently checked | AI-led | mathematics |
| 2025-05-14 | Improved lower bound for the 11-dimensional kissing number | Google DeepMind | AlphaEvolve (Gemini-based) | Independently checked | Search scaffold | mathematics |
| 2025-05-14 | Improved bound for the Erdős minimum-overlap problem | Google DeepMind | AlphaEvolve (Gemini-based) | Independently checked | Search scaffold | mathematics |
| 2024-07-25 | Silver-medal standard at the 2024 International Mathematical Olympiad | Google DeepMind | AlphaProof + AlphaGeometry 2 | Independently checked | AI-led | mathematics |
| 2024-01-17 | Olympiad geometry solved without human demonstrations | Google DeepMind | AlphaGeometry | Peer reviewed | Search scaffold | mathematics |
| 2023-12-14 | New lower bound constructions for the cap set problem | Google DeepMind | FunSearch (PaLM 2 / Codey) | Peer reviewed | Search scaffold | mathematics |
| 2021-12-01 | Two theorems found by machine pattern-spotting in knot theory and representation theory | Google DeepMind (with Oxford and Sydney) | Supervised networks with gradient-based attribution | Peer reviewed | AI-assisted | mathematics |
| 2021-04-29 | Reinforcement learning refutes several conjectures in extremal combinatorics | Tel Aviv University | Deep cross-entropy method (custom network) | Independently checked | Search scaffold | mathematics |