Neuruh · Millennium Problems Program

The Six Unsolved

The six open Clay Millennium Prize Problems, stated precisely, with the honest state of each and the computable ground Neuruh is mounting an attempt on. The atlas is build one of the program. The lab comes next.

Date
November 20, 2026
Audit date
November 20, 2026
Prize
$1,000,000 per problem
Status
6 open, 1 solved
Honesty block. Nothing on this page claims a solution. A problem is open until the Clay Mathematics Institute says otherwise, and this page follows that rule even when a 2026 claim looks strong. Claims are labeled CLAIMED, DISPUTED, or UNVERIFIED, with dates. Every number on this page was checked against a live source on November 20, 2026. A figure that could not be verified was left out. The Neuruh connections are real capabilities and real plans, not solutions.

01The prize

On May 24, 2000, at the Millennium Meeting at the College de France in Paris, the Clay Mathematics Institute named seven problems and pledged $1,000,000 for the first correct solution to each. John Tate and Michael Atiyah announced them. The seven span number theory, algebraic geometry, topology, partial differential equations, theoretical computer science, and mathematical physics. The Institute modeled the prize on David Hilbert's 23 problems of 1900, which drove a century of mathematics.

One of the seven is solved. Grigori Perelman proved the Poincare conjecture, completing Richard Hamilton's program, in papers released in 2002 and 2003. The Clay Institute awarded him the prize in 2010. He declined it, because it was not also offered to Hamilton, whose work the proof built on. He had already declined the Fields Medal in 2006. Six problems remain, and $6,000,000 of prize money is still unclaimed.

The Clay rule that matters most for this page: the Institute only considers a proposed solution after at least two years have passed since its publication. A claim made in 2026 cannot be an official solution in 2026, no matter how strong it looks. Verification is deliberately unhurried.

02The 2026 claim landscape

2026 is the year machine-assisted claims arrived in earnest. In September, OpenAI posted a claimed Navier-Stokes blowup with a Lean formalization. In October, OpenAI announced a claimed Yang-Mills existence proof, also formalized in Lean. In August, a report said an Anthropic research model raised the proven proportion of Riemann zeros on the critical line from about 41 percent to about 67 percent. A company called AIX Global claims its quantum system resolved all six problems in July 2026. None of these is an official solution. Each one is sorted where it belongs, in its own section and again in section 09.

6
Open problems
1
Solved (Poincare)
2
2026 claims with Lean formalizations
0
Officially solved in 2026
Figure 1. The state of the seven as of November 20, 2026. Two 2026 claims carry Lean formalizations. Zero have passed independent verification and the Clay two-year window.
ProblemPosedStatus2026 claim
Birch and Swinnerton-Dyer Early 1960s OPEN Formula proposal, Oct 7, 2026. Proposed, not accepted.
Hodge 1950 OPEN No credible 2026 claim.
Navier-Stokes 2000 (equations 1822) CLAIMED OpenAI blowup claim, Sep 8, 2026. Lean formalization. Awaiting independent validation.
P versus NP 1971 OPEN Unreviewed preprint, Jan 2026. Not accepted.
Riemann Hypothesis 1859 OPEN Proportion claim, Aug 2026, about 67 percent. Manuscript unreleased. Unverified.
Yang-Mills 2000 (theory 1954) DISPUTED Existence claimed Oct 26, 2026. Assessed Nov 10, disputed in November. Mass gap not claimed.

03Birch and Swinnerton-Dyer

For an elliptic curve E over the rational numbers, the rank of the group of rational points E(Q) equals the order of vanishing of the L-function L(E, s) at s = 1.

In plain words

An elliptic curve is a cubic equation with a group law on its solutions. The rank counts how many independent rational points the curve has. The L-function is an analytic object built from counting the curve's points modulo every prime. The conjecture says the algebra and the analysis agree exactly: the number of independent rational points is read off from how the L-function vanishes at s = 1. The stronger form of the conjecture also predicts the leading coefficient of the L-function at s = 1, in terms of the regulator, the Tate-Shafarevich group, the real period, the Tamagawa numbers, and the torsion.

What a solution unlocks

A complete bridge between the arithmetic of rational points and the analysis of L-functions. It would settle the oldest question about elliptic curves, which are the same objects that carry modern elliptic-curve cryptography, and it would complete the model case for the general Langlands program, which expects L-functions to control arithmetic everywhere.

Best-known results

Claim status

October 7, 2026: OpenAI proposed a full BSD formula at low Selmer corank. Proposed, not independently accepted. It is a proposal, not a verification.

The Neuruh connection. Elliptic curves are crypto-relevant, and rank computation is a computable frontier. The rank of a curve, the order of vanishing of its L-function, and the leading coefficient are all computable for any given curve. The Millennium Lab starts here: compute ranks and verify L-values for a chosen family of curves, with every computation receipted in the runtime's hash chain, so anyone can re-run it and check it.

04Hodge

On a smooth complex projective variety, every rational cohomology class of type (p, p) is a rational linear combination of the classes of algebraic subvarieties of codimension p.

In plain words

A variety is a geometric shape cut out by polynomial equations. Its topology has holes, and cohomology counts them. Some cohomology classes look like they could come from real geometric pieces sitting inside the shape. Those are the Hodge classes. The conjecture says every candidate is real: every Hodge class is built out of actual subvarieties. It is a claim that the topology of a variety is controlled by its geometry.

What a solution unlocks

The unification of algebraic topology and algebraic geometry. A proof would say that the continuous, topological description of a shape and the discrete, equation-based description agree at every level, and it would give a machine for turning topological information into geometric objects.

Best-known results

Claim status

No credible 2026 claim. Preprint servers carry unreviewed papers claiming proofs; none has been peer-reviewed or accepted.

The Neuruh connection. Formalization target. Hodge is the problem on this list where the machine-checkable statement is the cleanest: the cycle class map is surjective, or it is not. Lean 4 and its math library are the arena where that statement will eventually be tested, and the lab's formalization work starts with statements that can be written down exactly and checked by a kernel.

05Navier-Stokes existence and smoothness

In three dimensions, do smooth solutions to the incompressible Navier-Stokes equations, starting from smooth initial data, exist for all time and stay smooth? Or can a solution develop a finite-time singularity, a blowup?

In plain words

The Navier-Stokes equations describe how fluids move: water, air, blood. They are Newton's second law applied to a fluid. The question is whether a perfectly smooth flow can break down. Can the velocity at some point grow without bound in finite time, so the equations stop making sense? Or does every smooth start stay smooth forever?

What a solution unlocks

The mathematics of turbulence, weather, flight, and blood flow. A proof of global regularity would certify the equations that every simulation already trusts. A proof of blowup would show the equations themselves can fail, and would say exactly how a fluid breaks.

Best-known results

Claim status

September 8, 2026: OpenAI posted a claimed solution. The claim is a finite-time singularity, a blowup, with a smooth applied force. The fluid starts at rest, the force is smooth, the total energy stays finite, and the velocity grows without bound in finite time. The claim establishes statements (C) and (D) of the official Clay formulation, the blowup alternatives. The writeup is 166 pages with a Lean formalization, produced by about 10,000 coordinating agents in about 88 hours, reaching the resolution on September 5. OpenAI says it will not claim the million-dollar prize.

A priority dispute followed. Tristan Buckmaster and Levent Alpoge announced related forced-Euler results on September 7, 2026, and the question of who did the mathematics first is unresolved. The Clay Institute only considers proposed solutions after at least two years from publication, so the clock has not started. The Institute has said the problem has apparently been settled, but its review is deliberately unhurried. As of November 20, 2026, no independent verification of the OpenAI claim has been established.

What the claim does not do: prove that smooth solutions exist for all time. It claims the opposite direction, blowup, under a smooth applied force. The Clay problem is stated as a choice between those two outcomes, so a verified blowup would settle it. Verification is the open step.

The Neuruh connection. Blowup search is the organism pattern at scale. About 10,000 agents, 88 hours, a Lean receipt at the end: that is workers, verification, and a receipt chain, just bigger than ours. The sovereign runtime already does the same shape of work at small scale: generate candidates, check them, keep the receipt. The lab's first simulation target is a Navier-Stokes blowup search on a small grid, with every run receipted.

06P versus NP

Is P equal to NP? Does every problem whose solution can be verified in polynomial time also admit a solution in polynomial time?

In plain words

P is the set of problems a computer can solve quickly. NP is the set of problems whose solutions a computer can check quickly, given the answer. Every problem in P is in NP, because solving it is a way of checking it. The question is whether the reverse holds. Is finding an answer as easy as checking one? Every lock you can test a key in quickly: can you also find the key quickly?

What a solution unlocks

Either answer remakes computing. If P = NP, modern cryptography collapses, because every code that is easy to verify and hard to break becomes easy to break, and optimization, search, and design become routine. If P is not NP, the fact the whole security economy already bets on is certified: verification is fundamentally cheaper than discovery. That gap is the foundation of every password, every signature, and every encrypted message.

A problem VERIFY the answer: cheap SOLVE from scratch: unknown Polynomial time Polynomial? Open.
Figure 2. The gap P versus NP names. Checking an answer is cheap. Finding one may not be. The question is whether the two costs are the same.

Best-known results

Three formal barriers have been proved, and each one rules out a whole family of techniques. A proof must evade all three at once.

Claim status

No accepted 2026 claim. A January 2026 arXiv preprint claims a technique called semi-relativization that evades all three barriers and separates P from NP. It is unreviewed and not accepted.

The Neuruh connection. This is the recipe engine's problem in pure form. Verification is cheap, solving is expensive, and governed execution is the practical answer: generate, authorize, execute, receipt. The recipe engine lives inside the gap P versus NP names. Every recipe is a search procedure whose outputs are cheap to verify and expensive to find, and the governance layer exists because the search cannot be trusted without the receipt. The lab's complexity work starts here: formalize recipe search as a complexity object, with the three barriers as the audit it must pass.

07Riemann Hypothesis

All non-trivial zeros of the Riemann zeta function lie on the critical line Re(s) = 1/2.

In plain words

The zeta function encodes the primes. Its zeros, the points where it equals zero, control how the primes are distributed. Riemann conjectured in 1859 that every interesting zero sits exactly on one vertical line, where the real part equals one half. If true, the primes are distributed as regularly as the analytic structure of zeta permits. If false, a single zero off the line breaks the pattern.

What a solution unlocks

The sharpest possible error term in the prime number theorem, and hundreds of theorems currently proved on the assumption that RH holds would become unconditional. Prime generation, cryptography, and everything built on the distribution of primes rests on the same structure.

Re(s) = 0 Re(s) = 1/2 Re(s) = 1 critical strip t = 14.13 t = 21.02 t = 25.01 t = 30.42 t = 32.94 Every zero found so far sits on the dashed line.
Figure 3. The critical strip, 0 < Re(s) < 1, with the critical line Re(s) = 1/2 dashed in brass. The first five non-trivial zeros, at heights t = 14.13, 21.02, 25.01, 30.42, and 32.94, all sit on the line. The first ten trillion zeros do too. That is evidence, not proof: a single zero off the line, at any height, would end the hypothesis.

Best-known results

Claim status

August 2026: a report says an unreleased Anthropic research model, about 60 coordinated subagents working for about a day and a half, produced a 35-page manuscript proving that at least 67.25 percent of non-trivial zeros lie on the critical line and are simple, and that at least 83.625 percent are distinct. Status: CLAIMED, UNVERIFIED. The manuscript is unreleased and no independent verification has been established as of November 20, 2026. The hypothesis itself is untouched either way.

The Neuruh connection. Zeta-zero verification is a computable frontier with provenance, built for the runtime's receipt chain. Verifying zeros to a height is a computation whose result is checkable by anyone who re-runs it, and the receipt chain is exactly the mechanism that makes a re-run trustworthy: who ran it, on what input, with what result, in what order. The lab's first computation is a verified zero count with hash-chained receipts.

08Yang-Mills existence and mass gap

Prove that for any compact simple gauge group G, a non-trivial quantum Yang-Mills theory exists on R4 and has a mass gap Delta > 0.

In plain words

Yang-Mills theory is the mathematics of the strong force, the force that holds atomic nuclei together. The problem asks for two things. First, build the quantum version of the theory rigorously, from the axioms up, in four-dimensional space. Second, prove it has a mass gap: the lightest particle it predicts has positive mass. The mass gap is why the strong force has a finite range and why protons have mass.

What a solution unlocks

The first rigorous interacting quantum field theory in four dimensions. It would put the mathematical foundation of the Standard Model of particle physics on solid ground, and it would explain, from first principles, why the strong force behaves the way it does.

Best-known results

Claim status

October 26, 2026: OpenAI announced an AI-generated existence proof for quantum chromodynamics, including pure Yang-Mills theory as a subproblem. The Lean formalization was submitted on October 28, 2026. The mass gap was explicitly not claimed.

November 10, 2026: an independent assessment, prepared by Michael R. Douglas, Arthur Jaffe, Ron Nissim, and Fred Rajasekaran and approved by the Yang-Mills group, with consultative review from David Gross, Igor Klebanov, and Nikita Nekrasov, judged that the submission proves a relativistic quantum field theory satisfying the Wightman axioms can be constructed as a scaling limit of four-dimensional Wilson lattice gauge theory for any simple compact gauge group. The same assessment says the submission does not prove uniqueness of the infinite-volume limit and does not prove a mass gap. Jaffe co-authored the official Clay problem statement with Edward Witten.

A November 2026 critique by Jenny Lorraine Nielsen argues the formalization does not establish existence in the Clay sense at all: the non-triviality test does not exclude generalized free fields, the contact terms are uncontrolled, and the identification of the constructed object as Yang-Mills theory, rather than some other lattice-originating theory, has not been verified by a human mathematician. Status: existence contested, mass gap open, Clay problem open.

The Neuruh connection. Lattice gauge theory is computable approximation, and formalization is the test. The lab's lattice work starts small: a Wilson lattice computation with receipts, and a reading of the OpenAI formalization against the Clay criteria, so the program knows exactly which gaps remain instead of taking any side's word for it.

092026 claims, sorted

Every claim from 2026, with its verdict as of November 20, 2026. The rule for the whole page: officially unsolved until Clay says otherwise. A Lean check proves that the encoded statement follows from its stated assumptions. It does not by itself prove the Clay statement. Independent human verification is the gate.

ClaimDateVerdict
OpenAI: Navier-Stokes blowup
Finite-time singularity with smooth forcing, statements (C) and (D), 166-page writeup, Lean formalization, about 10,000 agents in about 88 hours.
Sep 8, 2026 CLAIMED
Awaiting independent validation. Priority dispute open. Clay two-year window not started.
OpenAI: Yang-Mills existence
Existence of quantum Yang-Mills as a Wightman QFT, Lean formalization submitted Oct 28, 2026. Mass gap not claimed.
Oct 26, 2026 DISPUTED
Independent assessment Nov 10 judged the Wightman construction proved. A November critique says it fails the Clay criteria. Mass gap open.
Anthropic: Riemann proportion, about 67 percent
About 60 subagents, about a day and a half, 35-page manuscript, at least 67.25 percent of zeros on the line and simple.
Aug 2026 UNVERIFIED
Manuscript unreleased. No independent verification established.
OpenAI: BSD formula at low Selmer corank
Full BSD formula proposed for curves of low Selmer corank.
Oct 7, 2026 UNVERIFIED
Proposed, not independently accepted.
AIX Global: all six solved by quantum computation
Claims formal resolutions of all six via Seed IQ governed fault-tolerant quantum computation, released Aug 30, 2026.
Jul to Aug 2026 UNVERIFIED
Self-published on Medium and Zenodo. No independent confirmation. Not presented as solved anywhere on this page.
Preprint: P versus NP by semi-relativization
Claims a technique evading all three barriers and separating P from NP.
Jan 2026 UNVERIFIED
Unreviewed preprint. Not accepted.

10The program

This atlas is build one. It does what an atlas does: it says what is open, what is known, what is claimed, and where the computable ground is. Build two is the Millennium Lab, and it is a real program, not a claim.

The lab points the sovereign runtime at the computable frontiers this atlas names. The runtime already exists and is proven: 117 pytest tests passed, 61 receipts in an end-to-end run, hash chain valid after restart, gates that dispatch once and resume on a signed founder token. The lab adds Millennium computations to that runtime.

ProblemComputable frontierLab first move
Riemann Verify zeta zeros to a height A verified zero count with hash-chained receipts, re-runnable by anyone.
Birch and Swinnerton-Dyer Compute ranks and L-values for a curve family Rank and L-value computation for a chosen family, receipted per curve.
Navier-Stokes Numerical blowup search on a small grid A small-grid blowup search with every run receipted, and a reading of the OpenAI formalization against the Clay criteria.
P versus NP Formalize recipe search as a complexity object Recipe search written as a complexity object, audited against the three barriers.
Yang-Mills Wilson lattice computation A small Wilson lattice computation with receipts, plus a gap audit of the OpenAI formalization.
Hodge Machine-checkable statements in Lean Formalization of the cycle class map statement, starting with the cases already proved.

No solution claims. A real program with receipts. The lab page comes next, and it will carry the first computation, not the first promise.