First edition — October 13, 2026 · Updated weekly

Math Problems Solved by AI

Updated weekly · Edition: November 15, 2026 — What AI has actually claimed, what it has partly cracked, and what has been checked line-by-line. The distinction matters more than the headline count.

What the three categories mean

Completely Solved by AI
=
AI produced a complete claimed solution, not yet formally verified or independently confirmed.
Partially Solved by AI
=
Special cases, improved bounds, weakened versions, or AI contributions humans completed.
Proven and Confirmed
=
Formally machine-verified (Lean/Coq) or independently confirmed by mathematicians or peer review.

Completely Solved by AI — 131

AI produced a complete claimed solution. Not yet formally verified or independently confirmed.

Navier–Stokes finite-time blow-up — Millennium Prize problem

OpenAI internal model swarm + GPT-6 Astra · Sep 8, 2026 · Claimed complete

Claimed proof of finite-time blow-up for the forced Navier–Stokes variants (C)/(D) of the Clay formulation, produced in ~88 hours with a Lean formalization.

Heavily disputed This is not the unforced prize problem. Fields Medalist Charles Fefferman credits the key insight to human mathematicians Córdoba and Martínez-Zoroa (via Quanta); the formalization is self-assessed; the Clay Institute still lists the problem as unsolved; one report says the claim was withdrawn over a formal / informal statement mismatch.
Source: T-invariant — Read source →

IMO 2025 gold-medal claim

OpenAI experimental reasoning model · Jul 19, 2025 · 5 of 6 problems

Announced as solving 5 of 6 IMO 2025 problems in contest time for a gold-level score, graded by three former IMO medallists.

Flag — not certified Never officially entered or certified — the IMO confirmed OpenAI did not register under the official grading scheme.
Source: New Scientist — Read source →

“More than 100 open problems resolved” claim

OpenAI internal model · Sep 21, 2026 · No list published

OpenAI stated an internal model resolved 100+ open problems since late August 2026 but published no problem list and no proofs — unverifiable as stated, resting entirely on the lab's announcement.

Source: explainx.ai — Read source →

OpenAI October 6, 2026 release — problem families without Lean formalization (128)

Complete claimed solutions from the same release, not yet formally verified or independently confirmed. Source: github.com/openai/math

#001Milne’s rationality conjecture and algebraic specialization
#002The full BSD formula from low Selmer corank
#004Hilbert’s tenth problem over ℚ
#006Goldfeld’s conjecture: densities and mean analytic rank
#010Unrestricted pro-modularity at the prime two
#011Prime-factor statistics of p-1
#014Restricted geometric Langlands, global Arthur enhancements, and generic Ramanujan
#016Zilber–Pink in abelian varieties and the Siegel threefold
#018The Margulis–Platonov conjecture over global fields
#019The local p-adic section conjecture and global consequences
#022The weak inhomogeneous Duffin–Schaeffer conjecture
#029Primitive roots for every admissible integer base
#030Modularity of elliptic curves over imaginary quadratic fields
#031Uchida’s conjecture for open homomorphisms of Galois groups
#034Log abundance for compact Kähler spaces under logarithmic Iitaka subadditivity
#035Log-canonical threefold abundance in numerical dimension one
#036Numerical semiampleness and generalized minimal models
#037The ordinary-double-point volume gap
#038Fujita’s freeness conjecture
#040Bloch’s conjecture for complex surfaces
#041Hyperkähler SYZ and projective-space bases
#042Oka classification for minimal compact complex surfaces: Kodaira dimension zero and class VII
#043P = W for fixed-determinant SL_n moduli spaces
#044The equivariant cohomological Hikita conjecture
#046Shafarevich counterexamples in dimension two and with large fundamental group
#048A characteristic-zero counterexample to Lipman–Zariski
#051Kobayashi’s canonical-ampleness conjecture
#053A counterexample to Pixton completeness in Chow
#054Irrational cubic fourfolds with Hodge-theoretic and categorical K3 associations
#055Gepner symmetry and large-volume stability on threefolds
#056Termination of projective and Kähler fourfold minimal model programs
#057Fundamental groups of special complex varieties and root orbifolds
#059Counterexamples to Zariski’s multiplicity conjecture
#060The Global Spherical Shell conjecture
#062Projective contact classification and the LeBrun–Salamon conjecture
#063The generalized Mukai conjecture
#064Topological triviality of μ-constant surface singularities
#065Virasoro constraints for complete intersections and projective-bundle towers
#067The Campana–Peternell conjecture in dimension six
#068Anticanonical nonvanishing in every dimension
#069Global quantum geometric Langlands at irrational level
#074Kakeya in three and four dimensions
#077Fourier restriction for positively curved surfaces
#078The three-dimensional Bochner–Riesz conjecture
#080The exact Sobolev endpoint for Schrödinger convergence
#086An L^3 bound for the trilinear Hilbert transform
#093Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures
#101The sharp simplex conjecture for isotropic constants
#109Integer multiplication below n log n
#120Almost-linear-time exact matching and prescribed-degree factors in general graphs
#136A quasilinear PCP theorem for PPAD
#138Subset Sum in O(2^0.49n) time
#141Existential–universal real sentences in the counting hierarchy
#142Deterministic polynomial factorization over prime fields
#147The near-boundary Birkhoff conjecture
#153Arithmetic classification and non-Pisot singularity for Bernoulli convolutions
#154Pointwise multiple ergodic averages for mixing transformations
#164Hindman’s finite sums and products conjecture
#166The higher-dimensional Erdős distinct-distances conjecture
#171The hypercube Ramsey conjecture
#178Deterministic nonbipartite Ramanujan graphs in every fixed degree
#193Serre’s intersection-multiplicity conjecture
#200Eisenbud–Green–Harris and lex-plus-powers
#201A counterexample to Kurosh’s division-ring problem
#202The blockwise Alperin weight conjecture
#203Donovan's conjecture over fields and complete mixed-characteristic DVRs
#204Tensor saturation for even spin groups
#208Finite symmetric tensor categories and the Verlinde tower
#209Integral counterexamples to Gersten’s conjecture
#216Critical and near-critical XY scaling and BKT universality
#217The low-temperature Sherrington–Kirkpatrick fluctuation law
#219GOE bulk universality for regular graphs with weak Anderson disorder
#223Random-cluster interfaces: critical, disordered, thermal, and natural-time scaling
#224Critical and quenched near-critical universality for Poisson–Voronoi percolation
#225Gaussian free field limits throughout the balanced six-vertex regime
#226The double-dimer loop ensemble converges to CLE_4
#232Gaussian fields and interfaces for triangular-lattice Lipschitz heights
#233The joint critical Ashkin–Teller current limit
#239Sharp singularity rates for symmetric random sign matrices
#258Gersten’s conjecture and virtual compact specialness of one-relator groups
#259A group without fixed price
#264Strong cosmic censorship near two-ended Kerr data
#265Area laws and tensor networks for two-dimensional gapped systems
#268The spin-one Haldane gap
#270Threshold and positive-energy bound states of the BFSS matrix model
#278Failure of Kohn–Sham ensemble representation
#282From scale symmetry to local conformal symmetry in four-dimensional QFT
#283Polynomial-time unitary synthesis from a Boolean oracle
#284The optimal quartic separation between randomized and quantum queries
#285Counterexamples to Baum–Connes and Kadison–Kaplansky
#286Rigidity and arithmetic of lattice von Neumann algebras
#300Approximation and quadratic strong-operator paving
#302Radius of comparison equals half the mean dimension
#304The Hilbert–Smith conjecture in every dimension
#305Four-dimensional disk embedding and Wall's conjecture
#306The purely cosmetic surgery conjecture
#308Finite Smith–Toda complexes at every height
#309The Kervaire invariant problem at the prime three
#310Quillen's conjecture in rational homology
#311The Hovey–Strickland and Chai conjectures
#313Finite generation for the K(n)-local sphere
#314Cyclic length and chromatic fixed-point loss
#315The four-dimensional Singer conjecture
#316Curtis’s conjecture
#318Chromatic splitting: filtrations and counterexamples
#319Counterexamples to finite generation at chromatic height two
#320Nonhomeomorphic closed aspherical four-manifolds
#321A counterexample to Wall's finite D(2) problem
#332Metric Markov cotype of ℓ_1 and Hilbert-space Lipschitz extension
#335Gromov’s integral scalar-curvature bound for simplicial volume
#336Spectral scalar curvature, Urysohn width, and macroscopic dimension
#338Yau's uniformization conjecture
#339Katok's entropy rigidity conjecture
#340A counterexample to the nearby Lagrangian conjecture
#341Donaldson's hypersymplectic deformation conjecture
#344The metric Blaschke conjecture
#345Infinitely many closed geodesics on Riemannian spheres and closed three-manifolds
#346Sharp singular-set bounds for stationary integral varifolds
#349The Solomon–Yau least-volume conjecture
#351Scalar curvature and finite-time Ricci-flow singularities
#352A finite-time singularity of Calabi flow
#355Unique tangent flows at the first surface singularity
#357Bi-Lipschitz coordinates at every regular RCD point
#364Kinetic limits and fluctuations over the Boltzmann lifespan
#366The planar Mumford–Shah regularity conjecture and local weak-L^4 gradient bounds
#368The three-dimensional Ball–Evans approximation problem
#375De Giorgi's conjecture in dimension eight
#377Interior C^(1,α) regularity for infinity-harmonic functions

Partially Solved by AI — 8

Special cases, improved bounds, weakened versions, or AI contributions that humans completed.

Kissing number problem — 11 dimensions

AlphaEvolve · Google DeepMind · May 2025 · Nature Nov 2025 · Bound improved

Found a configuration of 593 spheres kissing a central sphere, improving the long-standing 592 lower bound. The exact number is still open (upper bound 868). Autonomous agents later raised the bound further, to 604.

Source: Nature — Read source →

4×4 matrix multiplication in 48 multiplications

AlphaEvolve · Google DeepMind · May 2025 · Nature Nov 2025 · Record since 1969 broken

Improved the 49-multiplication record that had stood since Strassen (1969). The general exponent problem remains open.

Source: Nature — Read source →

Erdős Problems #1196, #1217, #164

GPT-5.4 Pro · OpenAI + 8 human co-authors incl. Terence Tao · 2026 · AI-assisted

A Markov-chain method suggested by the model unlocked all three problems, but the proofs were constructed and verified by the human co-authors — AI-assisted, not autonomous.

Source: awesome-ai-proofs archive — Read source →

Erdős Problem #124

Aristotle · Harmonic · Nov 2025 · Weaker version

Produced a Lean proof in ~6 hours, but Tao and Bloom noted Erdős had omitted a key hypothesis from the statement, so the solved version is substantially weaker than the intended problem.

Source: Aristotle analysis — Read source →

First Proof benchmark

Aletheia / Gemini 3 Deep Think · Google DeepMind + other LLMs · Feb 2026 · Contested

On ten unpublished research-level problems, DeepMind claims 6 of 10 solved autonomously; the organizers judged only 2 of 10 definitively solved, and one duplicated an existing proof sketch. Lab and organizer assessments conflict — contested partial progress.

Source: First Proof notes — Read source →

Ghys conjecture — codimension-one case (covers complex dimension three)

Intern-S2 (Shusheng-S2) · Shanghai AI Lab · assisting Jiesong Zhang (KTH) · Announced Oct 15, 2026 · Special case · AI-assisted

Jiesong Zhang's paper proves the codimension-one case of Étienne Ghys's 1995 conjecture on holomorphic Anosov diffeomorphisms, which includes the full complex-dimension-three case; the general conjecture in higher codimensions remains open. Zhang disclosed in the paper's October 13 revision (arXiv 2609.37695, first posted September 29) that he developed ideas and arguments over multiple rounds with Shanghai AI Lab's internal Intern-S2 model and independently checked the mathematics himself. A separate Peking University team (Dong Bin and Liu Ruochuan, using their SHEAF framework) formalized the paper's central results in Lean — over 550,000 lines — with human verification. It sits in Partially Solved because only a special case is proved and the AI's role was assistive, not autonomous; headlines claiming the full 31-year-old conjecture was solved overstate the result.

Sources: Tech Times, Oct 16, 2026 — Read source → · Ground Truth, Oct 19, 2026 — Read source →

Erdős–Szemerédi sunflower conjecture

Matija Bucić · Fankang He · Hyunwoo Lee · Oct 19, 2026 · AI-found key step · Not peer-reviewed

The paper proves that for every k ≥ 3, any family of subsets of [n] with no k-sunflower has size at most ckn for some ck < 2, settling the Erdős–Szemerédi sunflower conjecture from the 1970s. In the authors' own statement on the use of AI, the proof of the key step, Theorem 2, was found by ChatGPT 6 Astra Pro after a short discussion generalizing the k=3 argument; the authors rewrote it in polynomial-method language and verified all results themselves. Honest note: the authors also state the proof has been verified in Lean 4.35, but that verification is not yet publicly available (to be released on the Palomar repository), so it is not counted here as proven and confirmed.

Source: arXiv:2610.26686 — Read source →

Kannan–Lovász–Simonovits (KLS) conjecture

Zhao Song · Xinzhi Zhang · First posted Oct 1, 2026 · Revised to full O(1) bound Oct 4, 2026 · Announced by Microsoft Research Oct 21, 2026 · AI-assisted · Not peer-reviewed

The 1995 conjecture asks whether every isotropic log-concave probability measure has a Cheeger constant bounded below by a universal positive constant; the paper proves ψn ≤ C for a universal constant, removing all dimension dependence. It was produced by a human-directed agentic AI process in which AI agents explored directions and humans directed, pruned, and completed the proof. Honest notes: the paper is not peer-reviewed; two parallel proofs appeared the same day (Bizeul, Klartag and Lehec, who disclose most proofs and ideas were found by ChatGPT; and Balasubramanian and Kasiviswanathan on the dimension-free Poincaré constant); and a Lean formalization of a dimension-free Poincaré bound (KLS500) exists, but it is not a full published Lean check of the Song–Zhang paper.

Sources: arXiv:2610.01447 — Read source → · arXiv:2610.05474 — Read source →

Proven and Confirmed — 257

Formally machine-verified (Lean / Coq) or independently confirmed by mathematicians or peer review.

Yang–Mills existence — 4D quantum field theory (Millennium Prize problem)

OpenAI · Oct 26, 2026 claim · Verified Nov 10, 2026 · Lean kernel-checked

OpenAI’s Oct 26 claim that its models produced rigorous existence proofs for interacting four-dimensional quantum field theories — including pure Yang–Mills theory — is now verified: a committee led by Nobel laureate David Gross released the Lean formalization on Nov 10, 2026, and Scientific American confirms the proof checks out. The existence half of the Yang–Mills Millennium Prize problem is now proven by AI; the mass-gap half is separate and is not claimed here.

Source: Scientific American — Read source →

Cycle Double Cover Conjecture — open since 1973 / 79

GPT-5.6 Sol Ultra · OpenAI · Jul 10, 2026 · Lean kernel-checked

Complete proof produced with 64 subagents in under an hour; kernel-checked in a public Lean repository; two senior graph theorists (Geelen, Oum) independently published expositions within a week. Not yet journal peer-reviewed.

Source: Conjecture Bench — Read source →

Erdős Unit Distance Conjecture — disproved (posed 1946)

OpenAI unnamed internal model · May 20, 2026 · Independently verified

Constructed point sets with polynomially more unit-distance pairs than the square grids long believed optimal; nine external mathematicians independently verified it and published a companion paper the same day.

Note — priority dispute Andreas Thom accuses OpenAI of using his unpublished research; the verification itself is not in question.
Source: arXiv:2605.20695 — Read source →

Erdős Problems #728, #729, and #397

GPT-5.2 Pro + Aristotle · OpenAI / Harmonic · Jan 2026 · Lean-formalized

GPT-5.2 Pro produced the proofs, Harmonic's Aristotle formalized them in Lean; #728 is regarded as the first Erdős problem fully resolved autonomously by AI, and Terence Tao accepted the #397 proof as an original result (while cautioning these are “lowest-hanging fruit”).

Source: arXiv:2601.07421 — Read source →

Nine open Erdős problems + 44 OEIS conjectures

AlphaProof Nexus · Google DeepMind · Oct 2026 · Science Oct 8, 2026 · Peer-reviewed in Science

Solved 9 of 353 formalized open Erdős problems (two unsolved for 56 years) and proved 44 OEIS conjectures, plus an algebraic-geometry problem and a minimax bound — all Lean-checked and published through peer review in Science.

Source: The Decoder — Read source →

Ten long-standing open problems, incl. Connes's Rigidity Conjecture (disproved)

Astra · OpenAI internal model · Aug 1, 2026 · Lean 4 · zero sorry

Arguments for ten problems open a decade or more (also non-sofic groups, Ehrhart's Volume Conjecture, sphere-packing and coding bounds, others), all formalized as Lean 4 certificates with zero “sorry” placeholders, in a 249-page manuscript. Journal peer review still pending.

Source: Mint — Read source →

Anderson's Quasi-Completeness Problem

Rethlas and Archon AI agents · 2026 · ~19,000-line Lean proof

Settled the problem in the negative with essentially no human mathematical input, backed by a ~19,000-line Lean formalization that builds cleanly and passes a statement-matching check; human experts verified eight Rethlas results including this one.

Source: awesome-ai-proofs archive — Read source →

Chen–Gendron Parity Conjecture for k-differentials

AxiomProver · Axiom Math · 2026 · Proved unconditionally

Proved the conjecture unconditionally via a Jacobi-symbol reformulation.

Flag — partial formalization Only the key combinatorial identity is Lean-formalized; the remaining parts were checked by the human co-authors.
Source: awesome-ai-proofs archive — Read source →

IMO 2025 problems — landmark

Gemini Deep Think · Google DeepMind & Aristotle · Harmonic · Jul 2025 · IMO-certified gold

Deep Think scored 35/42, a gold-medal performance officially certified by the IMO, solving 5 of 6 problems; Aristotle independently produced Lean-verified proofs for 5 of 6.

Source: New Scientist — Read source →

Anthropic's independent ETH refutation (Claude)

Anthropic · Claude (internal research model) · Oct 26, 2026 · Lean 4 formalization · Anthropic's claim

On Oct 26, 2026 Anthropic posted “A 2^o(n) Time Algorithm for 3-SAT”, credited to “Claude (Anthropic)”: an internal research Claude model found the core deterministic 3-SAT algorithm on Oct 16 (the same day OpenAI reports) using 14 million output tokens with no human input; it takes a different route (tensor-network contraction, an 1840s eight-square identity from the octonions); the Lean 4 formalization was written by AI models; the paper cites OpenAI's preprint as independent and concurrent work. No practical speedup (it beats brute force only at enormous problem sizes) and it does not settle P vs NP. No human has fully confirmed it — Anthropic's claim.

Source: R&D World — Read source →

Axiom's computer-checked proof of the Classification of Finite Simple Groups

Axiom · AxiomProver · Oct 26, 2026 · Lean · Sorry-free · Not yet independently rebuilt

On Oct 26, 2026 the startup Axiom announced the first complete computer-checked proof of the Classification of Finite Simple Groups (the “Enormous Theorem”) in Lean: about 43.1 million lines, sorry-free, using only Lean's standard axioms, produced in 24 days by swarms of AI agents directed by engineers and mathematicians. The formalization exposed 34 noteworthy deviations in the published literature, including a counterexample (PSL₂(49)) to a step in Walter's 1986 Unbalanced Group Theorem proof; Axiom's AxiomProver system proved a new group-theory result (“Preservation of simple tops”, Theorem 2.3, with Colin Defant and Ken Ono) to patch it. The code is released for independent reproduction but has not yet been independently rebuilt. Caveat: this is a formalization of the long-established human proof (some 15,000 pages by about 100 mathematicians), not a newly discovered solution — Axiom's claim.

Source: The AI Pin — Read source →

Aaronson–Ambainis conjecture — open since 2008

PSI (Physical Superintelligence) · unreleased Anthropic model · Nov 6, 2026 · Lean 4 formalization · Not peer-reviewed

On Nov 6, 2026 PSI announced its internal research system, running instances of a non-public Anthropic model, produced a complete proof of the Aaronson–Ambainis conjecture on quantum speedups by the third day of a run, then improved the bound twice; the Lean 4 formalization (four main theorems, no placeholders, no added axioms, re-checked with two independent Lean kernel implementations) and the paper are public on GitHub. The conjecture, posed by Scott Aaronson and Andris Ambainis, says every bounded low-degree polynomial on the Boolean cube with non-trivial variance has an influential variable — ruling out exponential quantum speedups on random inputs. Not peer-reviewed; experts must still confirm the formal statement matches the conjecture as intended. Co-proposer Scott Aaronson blogged Nov 8, 2026 that he believes the proof is correct (Lean certificate plus expert review, including a Stanford exposition by Blanc, Docter, Strassle and Tan), while noting he has not yet checked it himself.

Source: PSI — Read source →

OpenAI October 6, 2026 release — problem families with Lean formalization (245)

Source: the release repo, github.com/openai/math; ‡ = in the repo's stricter formalized-main-result catalogue — 176 papers with a formalized main result, spanning 139 families; a “Lean” link points to the family's formalization notes in the repo; includes formalized bound results such as the unit-distance power-saving bound, where the underlying problem can remain open even though the stated result is machine-checked.

#003The quasi-Riemann hypothesis ‡Oct 19, 2026 update (Quanta Magazine): number theorists including Jared Duker Lichtman, Maksym Radziwiłł and Alexander Dunn have unpacked the proof and largely agree the result is correct; experts are focusing on the shorter human-edited 11/12 version, which is not yet formally verified, while the Lean-verified 7/8 version has been set aside for its exposition. Peter Sarnak says he won't call it a Theorem until humans check every detail. Source: Quanta Magazine →
#005Irrationality of Catalan’s constant
#007Ordinary two-point correlations and the corrected Elliott conjecture
#008The Deligne–Drinfeld conjecture ‡
#009Function-field reconstruction from Milnor K-theory and Galois data
#012Independent largest prime factors of consecutive integers
#013Ostmann’s inverse Goldbach conjecture
#015Torus-packet equidistribution in prime, quartic, and sextic degrees
#017The irrationality exponent of π is 2
#020Squarefree quartics and power-free polynomial values ‡
#021A quadratic bound for Jacobsthal’s function ‡
#023Patterson's first moment for cubic Gauss sums
#024An asymptotic formula for the number of totients
#025Short Egyptian fractions ‡
#026Positive lower density of large prime gaps
#027Potential integral density on curve character varieties ‡
#028Uniformly bounded components of Gaussian-prime graphs ‡
#032The rational Hodge conjecture for CM abelian varieties ‡ Lean ↗Oct 26, 2026: Lean formalization added (namespace fix Oct 29).
#033Iitaka subadditivity, variation, and logarithmic additivity
#039Nagata’s conjecture and maximal Seshadri constants ‡
#047Zariski cancellation and affine fibrations over the complex numbers ‡
#049A stable-coordinate counterexample in four variables ‡
#050A counterexample to Griffiths’ positivity conjecture ‡
#052Tangent splittings and product decompositions ‡
#058Semialgebraic universal covers and bounded domains ‡
#066Bounded klt complements for Fano contractions ‡
#071Koebe’s circle-domain conjecture
#072Brennan's conjecture and the integral-means spectrum ‡
#073The Falconer distance conjecture ‡
#075The L log L Fourier-convergence conjecture ‡
#076Real ultraflat Littlewood polynomials and unbounded binary merit factors ‡
#079Local smoothing for the Euclidean wave equation ‡ Lean ↗Oct 26, 2026: new manuscript proves Sogge's local smoothing conjecture in every spatial dimension n≥2, yielding the Kakeya and Stein restriction conjectures in all dimensions; Lean formalization added; independent examination pending. Source: New Scientist →
#081Riesz transforms and rectifiability in higher codimension ‡
#082Annular variation and dyadic absolute bounds for the triangular Hilbert transform ‡
#083Hilbert transforms along Lipschitz directions
#084The geometric case of the Erdős similarity conjecture
#085Endpoint Sobolev regularity of centered disk averages ‡
#087The Mahler conjectures, functional inequalities and polar-product symplectic width ‡
#088Sharp projection-body inequalities and a counterexample to simplex maximization ‡
#089Bounded-distortion L_1 embeddings of planar and bounded-treewidth graphs ‡
#090Triangular-lattice optimality, long-range Riesz and Coulomb energies, and spherical logarithmic energy
#091Logarithmic and L_p Brunn–Minkowski inequalities and the B-conjecture ‡
#092The optimal order of convex-body covering density ‡
#094Subpolynomial dimension reduction in L_p ‡
#095Hyperbolicity cones without semidefinite lifts ‡
#096The Gaussian propeller conjecture in every dimension ‡
#097The Euclidean Steinitz–Bergström bound ‡
#098Compact counterexamples to bi-Lipschitz dimension reduction ‡
#099The sharp exponential scale of edit-distance distortion
#100Cylinder coverings below the half-area bound
#102The Unique Games Conjecture and optimal approximation thresholds ‡
#103Exact derandomization of logarithmic space: L=RL=BPL ‡
#104Quasipolynomial algorithms for mean-payoff, stochastic and parity games ‡
#105Perfect completeness for 2-to-1 games ‡
#106Hardness of coloring three-colorable graphs ‡
#107Matrix multiplication with exponent at most 9/4 ‡
#108A cubic permanent–determinant lower bound
#110Optimal-order randomized k-server on arbitrary metrics
#111One-sample matroid prophet inequalities against an almighty adversary
#112Beyond the square-root exponent for depth-three circuits ‡
#113Approximate counting and entropy of perfect matchings ‡
#114Approximate counting of common integer polymatroid bases ‡
#115Sampling and counting contingency tables with arbitrary margins
#116Uniform black-box noncommutative identity testing across characteristics ‡
#117Uniform sparsest cut: hardness and semidefinite gaps ‡
#118Bin packing and unbounded configuration-LP gaps ‡
#119The Courtade–Kumar and Hellinger conjectures ‡
#121Almost-linear approximation of edit distance
#122Quantitative trace-reconstruction bounds with a uniform decoder
#124Polynomial-time scheduling on three identical machines
#125The metric k-median approximation threshold and recovery ‡
#126Exponential semidefinite complexity of perfect matching
#127Average sensitivity of polynomial threshold functions ‡
#128A factor-two approximation for shortest common superstring ‡
#129Exponential state costs for two-way automata ‡
#130Exact Fourier transforms below n log n ‡
#131Rapid mixing of graph switches for every degree sequence
#132A superquadratic separation of sensitivity and block sensitivity ‡
#133The computational complexity of Weisfeiler–Leman refinement
#134Generalized star height at most three
#135Homogeneous depth-five lower bounds for iterated matrix multiplication
#137One-tape time simulation in two-fifths-power space ‡
#139Subpolynomial query complexity for log-concave sampling ‡
#140Memory–sample lower bounds for noiseless Gaussian regression ‡
#143Hilbert's sixteenth problem: uniform bounds for limit cycles ‡
#144Banach’s simple Lebesgue-spectrum problem
#145Rokhlin’s multiple-mixing problem
#146Positive metric entropy for the standard map
#148The entropy-rate dimension formula for self-similar measures ‡
#149Classwise permanence for weakly reversible mass-action systems
#150Weak mixing of triangular billiards with an irrational angle
#151A C^1 counterexample to the entropy conjecture
#152Zero entropy does not guarantee a smooth positive-volume model
#155A counterexample to periodic tiling in dimension three ‡
#156Borsuk's conjecture fails in dimension nine ‡
#157Graph coloring, clique minors, and Colin de Verdière invariants ‡
#158The Euclidean plane cannot be colored with five colors ‡
#159Erdős’s reciprocal-sum conjecture and quasipolynomial Szemerédi bounds
#160Superexponential van der Waerden numbers ‡
#161Counterexamples to Sidorenko’s conjecture and the forcing conjecture
#162Counterexamples to Ryser’s covering conjecture ‡
#165The Harary–Hill and Zarankiewicz crossing-number formulas ‡
#167Planar distinct distances and unit-distance bounds ‡
#168Combinatorial invariance of Kazhdan–Lusztig polynomials
#169Shareshian–Wachs elementary positivity
#170Sharp logarithmic exponents for off-diagonal Ramsey numbers
#172Classification of finite Euclidean Ramsey configurations ‡
#173Seymour’s second-neighborhood conjecture ‡
#174Deterministic construction of strong thin spanning trees ‡
#175Talagrand’s expectation thresholds, discrete convexity, and graph decompositions ‡
#176The second Kahn–Kalai conjecture with an edge-count bound ‡
#177Bounded-degree coboundary expanders
#179The circulant Hadamard and Barker-sequence conjectures ‡
#180Barnette’s Hamiltonian-cycle conjecture
#181The Erdős–Gallai cycle-decomposition conjecture ‡
#182Power savings for intersective polynomial differences and prime arguments
#183Power savings for planar halving lines and k-sets
#184Correspondence coloring with a fixed forbidden subgraph ‡
#185Counterexamples to infinite matroid intersection and packing/covering ‡
#186Uniform influence and sharp thresholds for graph and hypergraph properties
#187Snaky in 21 Maker moves
#188The sharp terminal leave in random triangle removal
#189Cycle–clique Ramsey numbers
#190Polynomial removal fails for ordered binary matrices ‡
#191A power improvement in the Heilbronn triangle lower bound
#192Boolean functions violate the square-root degree bound by arbitrary factors
#194Lech’s multiplicity conjecture
#195A counterexample to the small Cohen–Macaulay module conjecture ‡
#196A counterexample to Kaplansky’s zero-divisor conjecture ‡
#197A torsion-free group algebra that is not directly finite ‡
#198A counterexample to finitistic-dimension finiteness ‡
#199Counterexamples to Auslander–Reiten, Tachikawa and related homological conjectures ‡
#205Saxl’s conjecture and universal tensor squares ‡
#206Finite lattice representation and undecidability
#207The ℓ¹-Bass conjecture for all discrete groups ‡
#210Foulkes' conjecture for sixth powers and quadratic stabilization ‡
#211The geometric phase diagram, diffusion, and spectra of random planar maps
#212Planar first-passage geometry and the absence of bigeodesics ‡
#213Critical percolation on every quasi-transitive graph ‡
#214The Benjamini–Schramm nonuniqueness conjecture
#215Canonical O(3) continuum limit and exact O(4) mass asymptotics ‡
#218Conformal universality for weakly interacting and random-bond Ising models
#220Directional zero–one laws beyond iid environments and iid ballisticity ‡
#221The Mézard–Parisi formula for diluted spin glasses
#222Perceptron free energies and microscopic jamming exponents
#227Critical SK autocorrelation processes and dynamics across the temperature transition ‡
#228Continuum phase transitions for radial pair potentials ‡
#229Exact three- and four-state reconstruction thresholds and four-state tree capacity
#230Exact Hausdorff gauges for SLE
#231The free uniform spanning forest is a factor of IID
#234All-temperature pressure of orthogonally invariant Ising spin glasses
#235Limiting random SAT thresholds, sharp variance and computability
#236The exact factor-of-IID threshold for free Ising spins on trees ‡
#237The three-quarter exponent for honeycomb self-avoiding walk ‡
#238Optimal logarithmic mixing of the Thorp shuffle ‡
#240Shelah's eventual categoricity and the prescribed-threshold obstruction ‡
#241Rigidity of the Turing degrees ‡
#242Single-fold Diophantine representations and undecidability under an at-most-one-solution promise ‡
#243Separating choiceless counting from polynomial time and witnessed choice ‡
#244The Partition Principle does not imply Choice ‡
#245Weak normalization implies strong normalization in pure type systems
#246Cannon's conjecture
#247An infinite finitely presented residually finite 2-group and a finitely presented nil algebra
#248Thompson's group F is nonamenable ‡
#249A finitely generated Eilenberg–Ganea counterexample
#250Boone–Higman embeddings with higher finiteness ‡
#251Amenability, unitarizability, and strong Ulam stability ‡
#252A torsion-free hyperbolic group that is neither residually finite nor linear over any field ‡
#253An infinite finitely presented simple amenable group ‡
#254Classifying spaces and geometric obstructions for Artin groups ‡
#255Quasi-isometric recognition of virtually polycyclic groups
#256Nonsingular systems of equations over arbitrary groups
#257A hyperbolic group without a geometric CAT(0) action ‡
#260Spacetime Penrose inequalities: enclosing area, charge, rotation, and anti-de Sitter extensions
#261Localization and delocalization in the Anderson model
#262Sharp finite-matrix Lieb–Thirring inequalities and all equality cases ‡
#263The ionization and generalized ionization conjectures ‡
#266Exactly three mutually unbiased bases in dimension six
#267Positive-temperature Bose–Einstein condensation and exact quantum depletion
#269Uniform Laughlin gap and stability under bounded scalar disorder ‡
#271Bloch's law, its lattice correction, and the spherical magnetization law
#272Entanglement without distillable secret key
#273The entropy photon-number inequality
#274Parity is not in QAC^0 ‡
#275QMA-hardness of continuum Coulomb energy
#276Classical capacity of generalized amplitude damping ‡
#277Threshold repetition for entangled games ‡
#279Exact quantum factoring over a fixed finite gate set
#280Unitary vertex operator algebras and conformal nets
#281QAOA attains the SK optimum in the thermodynamic-first limit
#287Isomorphism of the free group factors
#288Kadison's similarity conjecture
#289Strong Kadison–Kastler stability and its spatial boundaries
#290Relative bicentralizers and modular spectral recovery ‡
#291Cuntz comparison, nuclear dimension, and equivariant Jiang–Su stability ‡
#292Kirchberg's O₂ norm-ultrapower embedding problem
#293Invariant projections, hyperinvariant subspaces, and transitive algebras ‡
#294Kaplansky's quasitrace conjecture and failure of tensor-product stable finiteness ‡
#295The Kadison–Ringrose cohomology conjecture
#296The generator problem for finite factors ‡
#297A ZFC counterexample to Naimark's problem
#298Two notions of free entropy differ even when both are finite
#299The Kirchberg–Rørdam character criterion and infinite tensor-power Jiang–Su stability ‡
#301Trace cones and Razak–Jacelon stabilization ‡
#303Weak pure infiniteness and Cuntz-algebra absorption
#307Failure of rational injectivity for maximal coarse assembly
#312The Grothendieck homotopy hypothesis ‡
#317Thomason model structures in all strict higher dimensions
#322Tingley’s sphere-isometry problem ‡
#323Independence of the separable quotient problem
#324Lipschitz equivalent Banach spaces need not be linearly isomorphic ‡
#325The complete Crouzeix conjecture ‡
#326The cotype–cotype conjecture under the approximation property ‡
#327Markov type characterizes superreflexivity ‡
#328Nonexpansive fixed points in reflexive Banach spaces ‡
#329A counterexample to metric-entropy duality ‡
#330A uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces
#331Reflexive midpoint convexity and diamond distortion ‡
#333Smooth isometric immersions of surfaces into ℝ^4
#334A smooth surface metric with no local isometric immersion in ℝ^3 ‡
#337Sharp Cartan–Hadamard isoperimetry and rigidity
#342Donaldson's tamed-to-compatible conjecture ‡
#343Symplectic ball packing in higher dimensions
#347Counterexamples to stable-Morse and strong Arnold fixed-point bounds ‡
#348Nonnegative-curvature Einstein classification and an L^2 topological gap
#350Yau’s nodal bounds: surfaces and higher dimensions ‡
#353Affine Bernstein rigidity through dimension nine and a smooth dimension-ten counterexample
#354The isoperimetric profile of the cubic three-torus
#356Gigli’s characterization of Alexandrov curvature ‡
#358A three-manifold without conjugate points or nonpositive curvature ‡
#359Negative Kähler curvature without bounded holomorphic coordinates ‡
#360Weak MTW curvature gives convexity and regular optimal transport ‡
#361Failure of integer-degree harmonic dimension comparison ‡
#362Global smoothness for relativistic Vlasov–Maxwell ‡
#363Nonuniqueness with local conservation for the hard-sphere Boltzmann equation
#365Joint metric and connection recovery from one boundary patch ‡
#367The critical dimension for the one-phase Bernoulli problem
#369The hot spots conjecture for simply connected planar domains
#370The Lane–Emden and Hénon–Lane–Emden conjectures ‡
#371Stable blowup for the defocusing Schrödinger equation
#372Global uniqueness in smooth isotropic elasticity
#373Nonattainment of the three-marginal Coulomb Monge problem
#374Sharp one-third stability of Brenier maps
#376Universal computation in forced Navier–Stokes flows
#378Disproof of the Exponential Time Hypothesis ‡ Lean ↗For every fixed k≥2, a deterministic algorithm counts the satisfying assignments of a k-CNF formula in subexponential time and polynomial space; the 3-SAT case refutes the Exponential Time Hypothesis.Announced Oct 26, 2026 (OpenAI's claim): algorithm found Oct 16, Lean formalization Oct 17; independent examination by Russell Impagliazzo, Ramamohan Paturi and Ryan Williams is underway — their involvement is not an endorsement; Anthropic posted an independent concurrent refutation (see separate entry). Nov 2: researchers reported prose-vs-Lean discrepancies (e.g., altered bounds in Lemma 8.6) in the new Oct 26 materials — under examination. Sources: New Scientist → · A Enigma Institute →Nov 6: The New York Times reports ETH co-proposer Russell Impagliazzo called the disproof 'very shocking news'; the independent examination by Impagliazzo, Paturi and Williams continues.

Handle with care

Why this tracker splits claims from checks — four cautions that apply across the whole page.

Release notes

First edition · October 13, 2026 · Sources linked on every entry — check the source before citing a result as settled.
Next weekly update will re-check verification status and move entries between categories as proofs are confirmed or withdrawn.