2026: The Year Machines Began Solving Open Problems
September 8: Navier–Stokes. October 6: 722 manuscripts. October 26: ETH. A place to look back, claim by claim, at what was asserted, what has been checked, how mathematicians answered, and what 'solved' means in mathematics.
16 claims10 Lean public2 disputed or withdrawn
No problem status on this site has changed on the strength of a claim alone.
Headlines use one word; mathematics has at least five layers. How far each claim has climbed is the unit of record on this page.
1
A company announced it
Blog post, manuscript, reasoning summary. The fastest and loudest layer.
2
The Lean code compiles
A formal statement is mechanically checked. What the statement says is still open.
3
The Lean statement matches the paper
People must compare code and prose. Navier–Stokes was challenged here.
4
People read and explain it again
Workshops, seminars, rewrites. The layer where a manuscript becomes mathematicians’ language.
5
The community accepts it as a theorem
Peer review, textbooks, two years of scrutiny. Clay prizes are discussed only here.
Timeline
Claim
OpenAI disproves the grid intuition for Erdős unit distances
An internal model produced a construction with more unit-distance pairs than the grid, checked by outside mathematicians. MathVoyage recorded it in content 4.19.
A proof plus Lean formalization that a fluid at rest under smooth forcing develops a singularity in finite time; about 10,000 agents over 88 hours. OpenAI said it would not claim the prize.
Twenty-eight Fields Medalists sign 'A Severe Misalignment of AI in Mathematics'
Argues that using open problems as benchmarks harms the field and its community, while not rejecting AI; it objects to announcements lacking write-ups, isolated methods, and citations.
AGMAI publishes guidelines for responsible release of AI-generated mathematics
Based on 600+ survey responses, proposes pathway 2A (scholarly articles) and 2B (unfinished output) requiring external repositories, disclosed prompts and reasoning, attempt counts and costs, Lean, and workshop funding.
OpenAI releases 722 manuscripts in 372 families on GitHub
Unreleased internal model, about three hours of compute per result, about 4,000 problems attempted; includes quasi-Riemann, Hilbert's tenth over ℚ, non-five-colorability of the plane, and Kakeya in 3 and 4 dimensions.
Cambridge and KCL researchers report Lean–paper mismatches in the Navier–Stokes proof
Points to at least two places, including one where the code proves a weaker estimate than the paper states; it does not call the result wrong and argues machine checks cannot replace peer review.
'Mathocalypse'? — the question of who will do the reading
Public commentary from mathematicians asks first about intelligibility, who bears verification labor, early-career researchers, and credit for prior work. Korean coverage described people checking the list before the proofs.
OpenAI announces local smoothing, an ETH refutation, and Yang–Mills existence
The math output was released directly; the ETH result is being examined by a group led by Impagliazzo, Paturi, and Williams with public artifacts; the physics group led by Gross is withholding artifacts to write it up.
Claims that touch the 16 expedition problems and 25 workshop problems, plus a few landmark cases that show the verification layers. The status label is what this site currently assigns to the problem.
AIF-2026-01·OpenAI·Announced 2026-09-08
Navier–Stokes: finite-time singularity under smooth forcing
Lean public · mismatch reportedDisputed
Claim
A three-dimensional incompressible fluid starting from rest under a smooth external force can develop unbounded velocity in finite time, establishing alternatives C (and D) of the official Clay statement.
Not claimed
The unforced case (the main problem behind alternatives A and B) is not claimed. OpenAI said it will not claim the prize, and Clay rules on solutions only after publication and two years of scrutiny. An October 6 audit reported at least two divergences between the Lean code and the paper. This does not disprove the original result; the audit itself is not yet peer reviewed.
MathVoyage's call
The problem stays `open`. The story gains a 2026 scene separating forced from unforced, and shows the priority dispute and the Lean-mismatch report alongside.
Euler equations: finite-time blow-up under smooth forcing (human–AI collaboration)
Lean publicCommunity review
Claim
Finite-time singularity for the inviscid three-dimensional Euler equations with smooth forcing, released with porous-medium and 2D Boussinesq results and Lean verification. The porous-medium result is joint also with Matei P. Coiculescu.
Not claimed
This is Euler (no viscosity), not Navier–Stokes. How much the two teams' methods overlap is contested; on September 10 OpenAI added an investigation finding that Codex prompts could not have influenced its system.
MathVoyage's call
Recorded only as adjacent context for the Navier–Stokes problem. Adjudicating priority is not MathVoyage's role.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-03·OpenAI·Announced 2026-10-06·openai/math family 003
Quasi-Riemann hypothesis: zero-free half-plane Re s > 7/8
Lean publicCommunity review
Claim
Every Dirichlet L-function, including zeta, is zero-free in Re s > 7/8, as are finite-order Hecke L-functions over ℚ(√−3); a companion proves Re s > 11/12 by a different route.
Not claimed
Not the Riemann hypothesis (Re s = 1/2). Extending a zero-free region to 1/2 is a different matter, and the repository notes that the 11/12 write-up was human-edited for readability.
MathVoyage's call
The Riemann puzzle remains `open`. The story now distinguishes a fourth kind of statement, zero-free regions, from the evidence ladder of ten trillion, 67.25%, and 100%.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-04·OpenAI·Announced 2026-10-06·openai/math family 158
Hadwiger–Nelson: the plane cannot be five-colored
Lean publicCommunity review
Claim
Every five-coloring of the plane has a monochromatic pair at distance one, with no measurability restriction on color classes. With the classical seven-coloring, only χ(ℝ²) ∈ {6, 7} would remain. Manuscript dated 2026-09-23; Lean formalization public.
Not claimed
It does not determine χ(ℝ²). Unlike de Grey's 2018 lower bound, which was checked through finite witness graphs, this is an AI manuscript still under human review.
MathVoyage's call
Both surfaces stay `partial`. The former sentence 'one of 5, 6, or 7' now reads 'established bounds 5 ≤ χ ≤ 7; an October 2026 AI manuscript claims to eliminate 5'.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-05·OpenAI·Announced 2026-10-06·openai/math family 074
Kakeya: the 3D maximal conjecture and 4D Hausdorff dimension
No public formalizationLab claim
Claim
In three dimensions the δ-tube maximal operator is bounded L³(ℝ³)→L³(S²) with norm O_ε(δ^−ε) for every ε>0, and every four-dimensional Kakeya set has Hausdorff dimension four. Manuscripts dated 2026-09-23 and 24.
Not claimed
No Lean marker for this family on the access date. It concerns the maximal-conjecture form, distinct from Wang–Zahl's 2025 three-dimensional dimension result, and precedes human review.
MathVoyage's call
The problem stays `partial`. Progress now lists the two 2026 AI claims after Wang–Zahl with dates and Lean status.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-06·OpenAI·Announced 2026-10-26·openai/math family 079
Local smoothing → Kakeya in every dimension
Lean publicLab claim
Claim
Proves Sogge's local smoothing conjecture in every spatial dimension n ≥ 2 with arbitrarily small loss above the sharp Sobolev threshold, from which Bochner–Riesz, restriction (sphere, compact paraboloid and truncated cone, interior of the conjectured range), and the Kakeya and Nikodym maximal conjectures follow; in particular every Euclidean Kakeya set has full Hausdorff dimension. AI output 2026-10-18, Lean 10-19.
Not claimed
OpenAI released this as raw research data without a steward group. Whether the new auxiliary-PDE method is legible to mathematicians is the crux of verification.
MathVoyage's call
The problem stays `partial`. A full-resolution claim is not promoted to status without human understanding and journal peer review.
For fixed d ≥ 3, any n ≥ 2 distinct points in ℝ^d determine at least c_d·n^{2/d} distinct distances, matching the integer-grid order and resolving the higher-dimensional conjecture up to constants. Manuscript 2026-09-23.
Not claimed
The remaining √log n gap in the plane (d = 2) is untouched. No Lean marker on the access date.
MathVoyage's call
This problem concerns the plane and stays `partial`; the higher-dimensional claim is recorded as adjacent progress.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-08·OpenAI·Announced 2026-10-06·openai/math family 167
Planar pinned distances n^{1−ε} and a unit-distance bound O(n^{4/3−δ})
Lean publicCommunity review
Claim
Proves the weak pinned conjecture (for every ε > 0, all but o(n) points of an n-point planar set determine at least n^{1−ε} distinct distances) and bounds unit-distance pairs by O(n^{4/3−δ}) for an absolute δ > 0. Manuscript 2026-09-23; Lean public.
Not claimed
The exact logarithmic order for distinct distances and the exact growth of unit distances remain open. How much the 1984 Spencer–Szemerédi–Trotter n^{4/3} bound improves depends on δ and should be read only as the manuscript states it.
MathVoyage's call
Both problems stay `partial`. The unit-distance entry now says that in 2026 both the lower bound (May disproof) and the upper bound (October claim) moved.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-09·OpenAI·Announced 2026-10-06·openai/math family 002
BSD: the full formula at low Selmer corank
No public formalizationLab claim
Claim
Proves the BSD leading-term formula and finiteness of the Tate–Shafarevich group for every elliptic curve over ℚ whose q-power Selmer group has corank 0 or 1 for some prime q; combined with family 006 (Goldfeld's conjecture) this would give full BSD for a density-one set of quadratic twists. Manuscripts 2026-10-06 and 07.
Not claimed
The general statement, including all curves of rank ≥ 2, is not claimed. No Lean marker on the access date, and the October 7 fix list includes an obsolete-citation correction in this family's own manuscript (Exact BSD Formula from Low Selmer Corank).
MathVoyage's call
The puzzle stays `partial`. The story's 'rank 0 and 1 proved, rank ≥ 2 open' now carries the 2026 claim with its conditions.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-10·OpenAI·Announced 2026-10-26·openai/math family 378
Refuting the Exponential Time Hypothesis — a neighbor of P vs NP
Lean publicCommunity review
Claim
A deterministic algorithm counting satisfying assignments of a k-CNF with n variables and m clauses in time (n+m)^{O_k(1)}·2^{n/(log n)^{1/2+o(1)}} for fixed k ≥ 2; the 3-SAT case would refute ETH. AI output 2026-10-16, Lean 10-17.
Not claimed
Not P = NP. A false ETH does not yield polynomial-time algorithms and does not by itself establish any cryptographic break; how the formalized scope (fixed k, encoding, machine model) connects to the general ETH statement is being examined by the Impagliazzo–Paturi–Williams group.
MathVoyage's call
P vs NP stays `open`. The story adds the logical relation 'ETH ⇒ P ≠ NP, but ¬ETH ⇏ P = NP'.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-11·OpenAI·Announced 2026-10-06·openai/math family 025
Short Egyptian fractions: a/b as O(log log b) unit fractions
Lean publicCommunity review
Claim
Proves Erdős's conjecture that for sufficiently large b every rational a/b with 1 ≤ a < b is a sum of O(log log b) distinct positive unit fractions, with worst-case minimum of the same order. Lean public; manuscript 2026-09-25.
Not claimed
The Erdős–Straus conjecture (4/n as exactly three unit fractions) is not addressed; order-of-magnitude term counts and 'exactly three' are different questions.
MathVoyage's call
Erdős–Straus stays `open`; progress gains a one-line adjacent note only.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-12·OpenAI·Announced 2026-10-06·openai/math family 013
Ostmann's inverse Goldbach conjecture
Lean publicCommunity review
Claim
Proves additive indecomposability: no set differing from the primes by finitely many elements is a sumset A + B of subsets of the nonnegative integers with both parts of size at least two. Lean public.
Not claimed
Not Goldbach's conjecture itself. Whether the primes decompose as a sumset and whether even numbers decompose into two primes are questions in opposite directions.
MathVoyage's call
Both Goldbach surfaces keep their status; recorded as adjacent only.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-13·OpenAI·Announced 2026-10-06·openai/math family 026
Positive lower density of large prime gaps
Lean publicCommunity review
Claim
For every fixed C > 0 a positive proportion of consecutive prime gaps exceed C·log pn, and the indices where pn/n increases have positive lower density, answering Erdős and Prachar. Lean public; manuscript 2026-09-25.
Not claimed
Neither twin primes (infinitely many gaps of 2) nor Andrica (gaps below 2√p_n + 1) is addressed; density of large gaps, small gaps, and worst-case gaps are different questions.
MathVoyage's call
Twin primes and Andrica keep their status; recorded as adjacent only.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-14·OpenAI·Announced 2026-10-07
Withdrawn: Weil classes, Kuga–Satake, and Hodge for K3 products (3 papers)
No public formalizationWithdrawn
Claim
The October 6 manuscript on algebraicity of Weil classes on split abelian eightfolds failed through a sign error in a stabilization-trace cancellation; the dependent Kuga–Satake and Hodge-for-K3-products manuscripts were withdrawn with it.
Not claimed
Withdrawn papers remain archived with notices. This is the repository's own warning that unformalized results may be wrong, operating in practice.
MathVoyage's call
Not tied to a MathVoyage problem, but kept in the ledger as the clearest record of the distance between a lab announcement and a verified theorem.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-15·OpenAI·Announced 2026-10-26
Pure Yang–Mills existence (part of a Millennium problem) — artifacts withheld
Lean done · artifacts withheldLab claim
Claim
Claims rigorous existence proofs for four-dimensional interacting quantum field theories with gauge fields and fermions (QCD and a grand-unified completion of the Standard Model), including pure Yang–Mills existence as a sub-problem. Natural-language proof 2026-09-09, Lean 10-16.
Not claimed
The Clay problem requires existence and a mass gap; the mass gap is not claimed. The group led by David Gross chose to withhold artifacts and write it up, so outside verification is not yet possible; AGMAI called for immediate release on October 26.
MathVoyage's call
The new Yang–Mills page starts at open, separating the existence announcement from the full Millennium requirements without promoting it to a mass-gap solution.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
AIF-2026-16·OpenAI·Announced 2026-10-06·openai/math family 004
Hilbert’s tenth over ℚ: a claimed absence of a rational-solvability algorithm
No public formalizationCommunity review
Claim
Claims that no always-terminating algorithm decides rational solvability of integer-coefficient polynomials, with the variable count part of the input. This is the main theorem of the October 6 manuscript; Sun’s follow-up claims the 86-variable case.
Not claimed
Do not conflate this with the 1970 result over ℤ or the full first-order theory of ℚ. The family 004 listing checked on October 28 has no Lean link. Sun’s paper uses height and Selmer inputs from the original; its existence does not establish independent verification of the whole proof or completed peer review.
MathVoyage's call
The new rational-version page starts at open and marks the 2026 resolution claim as under review. This editorial boundary separates an announcement from established acceptance; it is not a verdict that the proof is false.
Keep my understanding and question · private draft
Either field is enough, up to 280 characters each. Save in this browser without signing in. It is not shared with other devices.
0/280
0/280
Kept only in this browser. Nothing is sent to a server.
Problems not addressed
Problems on this site not found in openai/math family titles or summaries as of 2026-10-27. "Not addressed" is not evidence that machines cannot solve them.
The autumn's headlines use 'solved' as one word, but in mathematics it splits into at least five layers. A company announced it.The Lean code compiles.The statement Lean proved matches the paper's statement.A person can read the proof and explain it again.The community accepts it as a theorem and writes it into textbooks. The Navier–Stokes episode stalled at the third layer: the code passed, yet an outside audit found places where it proves a weaker estimate than the paper states.
The Clay Institute's rules institutionalize the fifth layer: a prize is discussed only after publication and two years of scrutiny. 'Apparently settled' and 'settled' are therefore different sentences, and that is why no problem status on this site has changed.
The three withdrawals within a day on October 7 show these layers are not decoration. One sign error in an unformalized manuscript brought down the two manuscripts built on it. Calling the repository 'raw research data' is not modesty; it is the right classification.
How the mathematical community responded
There is no single reaction. The September 11 declaration by 28 Fields Medalists did not reject AI; it rejected using open problems as benchmarks. A famous problem's value lies not in the answer but in what follows it—scrutiny, simplification, textbooks, students—and mass announcements without write-ups or citations cut that chain.
The nine-member advisory group hosted at the Institute for Advanced Study wrote procedure instead of protest: external repositories, disclosed prompts and reasoning, attempt counts and costs, Lean where possible, workshop funding. Its October 6 statement called the release the beginning of understanding, not its completion; on October 25 it opposed handing output to designated mathematicians first because that creates unequal access.
Sharper voices exist. The Association for Human Mathematics called the 700-file release a demonstration of power and urged mathematicians to stop collaborating. Buckmaster, who had been working on Navier–Stokes, raised priority and leak concerns, which OpenAI contested with an investigation. In Korea, mathematicians at KAIST and IBS conveyed the tension between 'enormous if verified' and 'people are checking the list before the proofs'.
And there is the quiet reaction: people reading a result in class, people rewriting a manuscript from scratch. It makes no headlines, but the fifth layer is built by exactly these people.
What changes, and what does not
What changes: the scarcity of proofs may vanish. When hundreds of candidate proofs arrive in a week, the bottleneck is reading, not production. Who reads, how that labor is credited, and whether an unread proof is a theorem at all become live questions. When an early-career researcher's problem is 'finished' overnight, the rules of a career shake with it.
What changes: the grammar of credit. OpenAI wrote that it seeks no academic credit, yet manuscripts that omit prior work can erase credit in practice. People had to point out that the core Navier–Stokes idea rests on the 2023 non-smooth-forcing construction of Córdoba and Martínez-Zoroa.
What does not change: Lean proves formal statements; it does not translate problems. Forced versus unforced fluids, ETH versus P ≠ NP, zero-free regions versus the Riemann hypothesis—these distinctions are made by people, not machines. So is deciding why mathematics asks a question and which question deserves to come next.
What does not change: mathematics' clock. Someone rereading the September 2026 announcement in autumn 2028 will be the one to say what it was. Until then this page records each status as a claim.
What MathVoyage can do
A map of verification status. News peaks on announcement day and fades; mathematics runs the other way. This ledger records, per claim, Lean status, outside audits, withdrawals, and peer review with dates, and changes status only when it changes. It extends to every problem the evidence ladder that showed ten trillion, 67.25%, and 100% as different scales for Riemann.
A map of what people understand. Linking each claim to the human work and method lineages it stands on—de Grey's 1,581-vertex graph, Wang–Zahl in three dimensions, Guth–Katz polynomial partitioning, Córdoba–Martínez-Zoroa forcing—gives a machine's result a place in human history.
Traces without accounts. True to this site's principles, a place to leave 'one sentence I understood' and 'one question I still have' per claim, without login, would gather the quiet reactions that build the fifth layer. Reading what a claim does not claim is practice anyone can do.
New questions for the workshop. Workshop problems absent from OpenAI's list—Collatz, odd perfect numbers, perfect cuboids, Brocard—are not problems machines failed at; they are problems not yet on the attempt list. What 2026 changed is not the difficulty of problems but the human role of choosing which to ask, and why.
Questions to carry
Q1If alternative C of the Clay statement holds, would you say 'the Navier–Stokes problem is solved'?
Hint
Which fluid—forced or unforced—is closer to an airplane wing or the weather?
Q2If a Lean-checked proof can be explained by no one, is it a theorem?
Hint
Decide for yourself at which of the five layers you would start using the word 'theorem'.
Q3If the plane truly cannot be five-colored, is the only remaining question 'six or seven'?
Hint
Consider why the answer might depend on whether color classes must be measurable.
Q4If ETH is false, what happens to cryptography—nothing, or everything?
Hint
Compare subexponential and polynomial time using 2^{√n} and n^3.
Q5If you were an early-career mathematician and your three-year problem appeared on a list one morning, what would you ask next?
Hint
Recall where the declaration says the resources 'students and ideas' grow.
Sources and access dates
Positions are summarized rather than quoted. Secondary sources were used only to cross-check dates.
Reports the October 6 preprint on October 27. A Lean–paper mismatch is not a disproof of the original result; the audit itself is not yet peer reviewed.
Confirms claim scope (statements C and D with forcing), the 10,000-agent 88-hour run, the no-prize-claim stance, and the September 10 investigation update.
Nine unpaid independent members. Recommends release pathways 2A/2B, disclosure of prompts, attempts and cost, Lean formalization, and workshop funding.
Announces the GitHub release, ten reasoning summaries, about three hours of ChatGPT Pro compute per result, workshop funding, and plans to release the model.
721 manuscripts in 373 families on the access date, about 42% of top-line results formalized, about 4,000 problems attempted; framed as raw research data.
Announces local smoothing (hence Kakeya in all dimensions), the ETH refutation, Yang–Mills existence, three release strategies, and a no-academic-credit principle.