# Will Anthropic announce Claude has solved Navier-Stokes before July 2027?

Canonical URL: https://preseen.com/reports/763f000b-22c2-40c8-ad52-d078097b729f/will-anthropic-announce-claude-has-solved-navier-stokes-before-july-2027
Markdown URL: https://preseen.com/reports/763f000b-22c2-40c8-ad52-d078097b729f/markdown

## Forecast

P(Yes): 4.8%; P(No): 95.2%.

Generated: September 6, 2026 at 11:51 AM UTC
Forecast model: gpt-5.6-sol
Research model: gpt-5.6-sol

## Analysis

## TL;DR
I assign a **5%** chance that Anthropic makes a qualifying announcement by June 30, 2027. The current rumor is one mutable, third-hand chain rather than several independent reports, and Terence Tao said his Navier–Stokes discussion was hypothetical ([rumor record](https://stanfordtechreview.com/articles/did-claude-solve-navier-stokes-anthropic-rumor), [Tao clarification capture](https://www.reddit.com/r/accelerate/comments/1w83fyg/navier_stokes_solved_time_will_tell_but_im_excited/)). ([stanfordtechreview.com](https://stanfordtechreview.com/articles/did-claude-solve-navier-stokes-anthropic-rumor)) Claude’s recent mathematics results make the event possible, but the jump from formalizing known proofs and solving verifier-friendly open problems to the full three-dimensional nonlinear-PDE problem remains large ([Anthropic’s mathematics report](https://www.anthropic.com/research/riemann-zeta), [FrontierMath Erdős](https://epoch.ai/latest/announcing-frontiermath-erdos)). ([anthropic.com](https://www.anthropic.com/research/riemann-zeta))

## Context
The [Clay Mathematics Institute](https://www.claymath.org/millennium-problems/) still lists Navier–Stokes among six unsolved Millennium Prize Problems. A qualifying claim must address one of the four alternatives in the [official formulation](https://www.claymath.org/library/monographs/MPPc.pdf): global smoothness on three-dimensional Euclidean or periodic space, or an allowed breakdown construction. Anthropic’s current [Science index](https://www.anthropic.com/science) contains no Navier–Stokes solution announcement. That establishes that no public claim exists yet, not that no private work exists. ([claymath.org](https://www.claymath.org/millennium-problems/))

The question is easier than forecasting a correct, accepted solution because a later-rejected Anthropic claim would still count. It is harder than forecasting another striking Claude mathematics result because partial progress, a candidate proof, a special case, or a formalization of known work would not qualify.

## Evidence
The historical base rate is tiny. Clay announced seven prize problems on [May 24, 2000](https://www.claymath.org/millennium-problems/); one has been solved and six remain open. Treating that as one resolution across roughly 160 aggregate problem-years gives a mechanical probability near 0.5% that a specified problem falls during the remaining 297-day window. This is a crude anchor: the sample is tiny, the problems differ, and the rise of AI makes the process nonstationary. ([claymath.org](https://www.claymath.org/millennium-problems/))

A broader calibration points in the same direction. A survey conducted in August–September 2025 put the median expert estimate at [10% for any AI to solve or substantially assist with any Millennium Problem by the end of 2027](https://leap.forecastingresearch.org/reports/wave2). That event allowed any lab, any of six problems, six extra months, and mere substantial assistance. Restricting it to Anthropic, Navier–Stokes, a full-solution claim, and June 2027 pushes sharply down. Claude’s later 2026 results then push back up. I use this only as a sanity check, not as a substitute for the bottom-up estimate. ([leap.forecastingresearch.org](https://leap.forecastingresearch.org/reports/wave2))

The positive evidence is real. In August 2026, Anthropic reported that an unreleased Claude model improved a Riemann-zeta bound from 41.6% to 67.2%, using 31 million output tokens and about 60 agents; Anthropic also stated plainly that Claude had not solved the Riemann hypothesis ([Anthropic](https://www.anthropic.com/research/riemann-zeta)). In September, Claude produced a computer-checked formalization of Fermat’s Last Theorem in 11 days, using about six billion output tokens and generating 13 million lines of Lean ([Anthropic](https://www.anthropic.com/research/formalizing-fermats-last-theorem)). Anthropic has also retrospectively said that Claude Fable 5 resolved the Jacobian conjecture ([Anthropic](https://www.anthropic.com/research/discovering-cryptographic-weaknesses)). These results show research search, coordination, proof engineering, and a willingness to use resolution-level language when the company thinks it is warranted. ([anthropic.com](https://www.anthropic.com/research/riemann-zeta))

The controlled benchmark evidence is less bullish. Claude Fable 5 scored 87.8% ± 5.2 percentage points on the 43-question [FrontierMath Tier 4 v2](https://epoch.ai/benchmarks/frontiermath-tier-4), but those problems have bounded, checkable answers. On [FrontierMath Erdős](https://epoch.ai/latest/announcing-frontiermath-erdos), where systems had to prove or disprove 68 genuinely open conjectures in Lean, both Fable 5 and Fable 5.1 scored 0/68 under one attempt, a $300 budget, and 72 hours per problem. The budget is small beside Anthropic’s flagship research runs, but the contrast shows that near-saturation on research-level benchmarks is not the same as routinely solving open problems. ([epoch.ai](https://epoch.ai/benchmarks/frontiermath-tier-4))

Navier–Stokes is also a poor match for Claude’s clearest successes. An explicit polynomial counterexample such as the Jacobian result can be checked through finite exact calculations. Fermat already had a proof architecture to formalize. Navier–Stokes needs a new global analytic argument or a rigorously controlled continuum blowup construction. In April 2026, researchers described their work on De Giorgi–Nash–Moser theory as the [first machine-checked formalization of a major theorem in modern PDE theory](https://arxiv.org/abs/2604.05984). A leading public AI-assisted Navier–Stokes effort at Brown was still finding candidates in simpler related equations in August 2026, with Javier Gómez-Serrano saying that validating a full candidate could take years ([Brown University](https://www.brown.edu/news/2026-08-26/javier-gomez-serrano-lab)). ([arxiv.org](https://arxiv.org/abs/2604.05984))

The rumor raises the forecast, but not by much. Andrew Curran’s specific Navier–Stokes statement began by calling itself a prediction and named no source, manuscript, reviewer, or proof direction ([contemporaneous record](https://stanfordtechreview.com/articles/did-claude-solve-navier-stokes-anthropic-rumor)). Elliot Glazer reported earlier third-hand chatter through OpenAI contacts, but also said Curran had no independent information, that the chain could not be traced to a non-OpenAI source, and that another version named Hodge rather than Navier–Stokes ([captured thread](https://zamantika.com/id/profile/ElliotGlazer)). Tao then said he knew of no significant development and that his earlier discussion was hypothetical ([clarification capture](https://www.reddit.com/r/accelerate/comments/1w83fyg/navier_stokes_solved_time_will_tell_but_im_excited/)). I read this as a weak leak signal mixed with a strong telephone-game signal. ([stanfordtechreview.com](https://stanfordtechreview.com/articles/did-claude-solve-navier-stokes-anthropic-rumor))

My scenario model assigns about a 4% chance that Anthropic currently has a serious Navier–Stokes candidate after updating on the rumor. I give such a candidate roughly even odds of surviving internal review strongly enough to produce qualifying language, contributing about two percentage points. I add about two points for a new result emerging during the remaining window, and less than one point for a full-solution claim made without a serious underlying result. The combined estimate is 4.8%.

## What's non-obvious
The announcement criterion adds less probability than it first appears to. Anthropic’s recent posts carefully separated an advance related to the Riemann hypothesis from solving it, and separated formalizing Fermat from discovering a new proof ([Riemann post](https://www.anthropic.com/research/riemann-zeta), [Fermat post](https://www.anthropic.com/research/formalizing-fermats-last-theorem)). A flawed claim can qualify, but Anthropic’s revealed behavior suggests it is more likely to publish candidate or progress language—which would resolve NO—than to declare victory casually. ([anthropic.com](https://www.anthropic.com/research/riemann-zeta))

There is one subtle upward factor. Clay’s breakdown alternatives permit smooth forcing, so a negative solution need not establish blowup for the commonly discussed unforced physical case ([official formulation](https://www.claymath.org/library/monographs/MPPc.pdf)). That leaves room for an exotic computer-assisted construction. It is still nothing like a finite algebraic witness: the forcing, solution behavior, and failure of global smoothness must all be proved within the exact continuum formulation. ([claymath.org](https://www.claymath.org/library/monographs/MPPc.pdf))

## Uncertainties
- Anthropic’s private research portfolio is unknown. Its [public Science page](https://www.anthropic.com/science) cannot rule out a confidential project or manuscript under review. ([anthropic.com](https://www.anthropic.com/science))
- The rumor’s original source remains unidentified. The visible trail is anonymous, third-hand, internally inconsistent, and possibly circular ([captured source-chain account](https://zamantika.com/id/profile/ElliotGlazer)). ([zamantika.com](https://zamantika.com/id/profile/ElliotGlazer))
- Another model or agent-system jump before June 2027 could make present benchmarks stale. The speed and transfer of future improvement into nonlinear PDE research cannot be measured from current results.
- Anthropic’s threshold for an official solved claim is uncertain. Its Riemann and Fermat publications show restraint, while its Jacobian wording shows it will make a strong claim when an exact result appears ([Anthropic](https://www.anthropic.com/research/discovering-cryptographic-weaknesses)). ([anthropic.com](https://www.anthropic.com/research/discovering-cryptographic-weaknesses))

My subjective 80% range is 2% to 12%. Most of that width comes from private-information risk and from uncertainty about how quickly Claude’s open-ended research ability will improve, not from the historical base rate.

## Sources

- Domain Expert Search (mcp)
  > Found 14 domain experts for 'AI mathematical research capabilities, Navier-Stokes PDE, proof verification, Anthropic Claude, rumor provenance and corporate scientific announcements':
- Epoch (mcp)
  > Benchmark 'frontiermath': 24 results (newest model first).
- [epoch.ai](https://epoch.ai/data/benchmark_data.zip) (tool)
- arXiv (mcp)
  > Found 837 total papers. Showing 20:
- Domain Expert Research Task (mcp)
  > Job domain_expert_research_task_1d04d4cf47 done after 191068ms.
- [Learning more about Claude's mathematical capabilities \\ Anthropic](https://www.anthropic.com/research/riemann-zeta?trk=public_post_comment-text) (openai)
- [\[2604.05984\] Formalization of De Giorgi--Nash--Moser Theory in Lean](https://arxiv.org/abs/2604.05984) (openai)
- [claymath.org](https://www.claymath.org/wp-content/uploads/2022/06/navierstokes.pdf) (tool)
- [The Millennium Prize Problems - Clay Mathematics Institute](https://www.claymath.org/millennium-problems) (openai)
- [Rules for the Millennium Prize Problems - Clay Mathematics Institute](https://www.claymath.org/millennium-problems/rules) (openai)
- [www-cdn.anthropic.com](https://www-cdn.anthropic.com/95c246936988e43127bc6b2ceb7077c1dad2d68e.pdf) (tool)
- [Formalizing Fermat's Last Theorem \\ Anthropic](https://www.anthropic.com/research/formalizing-fermats-last-theorem) (openai)
- [github.com](https://github.com/anthropics/fermats-last-theorem) (tool)
- [Discovering cryptographic weaknesses with Claude \\ Anthropic](https://www.anthropic.com/research/discovering-cryptographic-weaknesses) (openai)
- [github.com](https://github.com/jonburchel/jacobian-anatomy/blob/main/NOTE.md) (tool)
- [zenodo.org](https://zenodo.org/records/21514514) (tool)
- [anthropic.com](https://www.anthropic.com/claude/fable) (tool)
- [arxiv.org](https://arxiv.org/abs/2605.22763) (tool)
- [google-deepmind.github.io](https://google-deepmind.github.io/formal-conjectures) (tool)
- [epoch.ai](https://epoch.ai/frontiermath) (tool)
- [math-challenge.org](https://www.math-challenge.org/en) (tool)
- [www-cdn.anthropic.com](https://www-cdn.anthropic.com/7624816413e9b4d2e3ba620c5a5e091b98b190a5.pdf?939688b5_page=1&e45d281a_page=5) (tool)
- [openai.com](https://openai.com/index/model-disproves-discrete-geometry-conjecture) (tool)
- [github.com](https://github.com/anthropics/zeta-23-lean) (tool)
- [stage1st.com](https://stage1st.com/2b/thread-2289291-1-1.html) (tool)
- [reddit.com](https://www.reddit.com/r/accelerate/comments/1w83fyg/navier_stokes_solved_time_will_tell_but_im_excited) (tool)
- [eu.36kr.com](https://eu.36kr.com/en/p/3971371138855176) (tool)
- [en.rattibha.com](https://en.rattibha.com/thread/2096076054133952516) (tool)
- [teorth.github.io](https://teorth.github.io/tao-web/ai-views.html) (tool)
- [Did Claude Solve Navier–Stokes? Inside the Anthropic Rumor](https://stanfordtechreview.com/articles/did-claude-solve-navier-stokes-anthropic-rumor) (openai)
- [Learning more about Claude's mathematical capabilities \\ Anthropic](https://www.anthropic.com/research/riemann-zeta) (openai)
- [Longitudinal Expert AI Panel](https://leap.forecastingresearch.org/reports/wave2) (openai)
- [FrontierMath Tier 4 (v2) | Epoch AI](https://epoch.ai/benchmarks/frontiermath-tier-4) (openai)
- [claymath.org](https://www.claymath.org/library/monographs/MPPc.pdf) (openai)
- [Science \\ Anthropic](https://www.anthropic.com/science) (openai)
- [Elliot Glazer (@ElliotGlazer) - Profil Twitter | Zamantika](https://zamantika.com/id/profile/ElliotGlazer) (openai)
- [epoch.ai](https://epoch.ai/data/all_ai_models.csv) (tool)
- [web.atzberger.org](https://web.atzberger.org/) (tool)
- [epoch.ai](https://epoch.ai/frontiermath/open-problems?notability=Breakthrough) (tool)
- [epoch.ai](https://epoch.ai/frontiermath/tiers-1-4/about) (tool)
- [openai.com](https://openai.com/index/ten-advances-in-mathematics) (tool)
- [deepmind.google](https://deepmind.google/blog/accelerating-mathematical-and-scientific-discovery-with-gemini-deep-think) (tool)
- [About FrontierMath: Open Problems – Overview | Epoch AI](https://epoch.ai/frontiermath/open-problems/about/overview) (openai)
- [reddit.com](https://www.reddit.com/r/Physics/comments/1w84bj5/removed) (tool)
- [anthropic.com](https://www.anthropic.com/research) (tool)
- [anthropic.com](https://www.anthropic.com/news/claude-opus-4-6?939688b5_page=1&e45d281a_page=2&tblci=GiAtVWn1bM7LVR-ypKCwvLsv5ahngjNtza5DheNKch6ghiDwzEYoxciw_4nw1o_nAQ) (tool)
- [support.claude.com](https://support.claude.com/en/articles/15425695-covered-models) (tool)
- [arxiv.org](https://arxiv.org/abs/2608.28433) (tool)
- [github.com](https://github.com/anthropics/formal-math) (tool)
- [anthropic.com](https://www.anthropic.com/news/anthropic-amazon-compute) (tool)

## Question Details

This question asks whether Anthropic will publicly announce, before July 1, 2027, that Claude has solved the Clay Mathematics Institute's three-dimensional Navier–Stokes existence and smoothness Millennium Prize Problem. As of September 6, 2026, Clay continues to describe Navier–Stokes as unsolved; its official formulation permits a resolution by proving global existence and smoothness in the specified 3D settings or by establishing an allowed breakdown/counterexample. (claymath.org) The threshold here is an Anthropic announcement of a claimed solution, not acceptance by the Clay Mathematics Institute or the broader mathematical community. This distinction matters because Anthropic is already publicly reporting significant Claude-assisted mathematics: on August 10, 2026 it announced that a research version of Claude improved a longstanding bound related to the Riemann hypothesis while explicitly saying Claude had not solved the Riemann hypothesis itself, and on September 4, 2026 it announced a Claude-produced computer-checked formalization of Fermat's Last Theorem. (anthropic.com)

### Resolution Criteria

Resolve YES if, on or before June 30, 2027, Anthropic publishes an official public statement that substantively claims that Claude, including any research or unreleased version of Claude, has solved the Clay Mathematics Institute's Navier–Stokes existence and smoothness Millennium Prize Problem. The announcement may say Claude solved the problem autonomously, collaboratively with humans, or as a major contributor; it need not claim that Claude was the sole author of the solution. A qualifying statement must claim a solution to the full Millennium Prize Problem, rather than merely progress on Navier–Stokes, a solution to a restricted/special case, a numerical solution of particular Navier–Stokes equations, or a formalization of previously known mathematics. Either an existence-and-smoothness proof or a valid breakdown/counterexample of the kind permitted by the official Clay formulation counts as 'solved.' (claymath.org) For determining whether Anthropic made the announcement, use official Anthropic-controlled public channels, principally anthropic.com (including its Research/Science/News publications). An official Anthropic social-media post or other official Anthropic publication also qualifies if it unambiguously makes the claim. Third-party reporting, statements made solely by individual Anthropic employees in a personal capacity, leaked material, or a mathematical paper without an accompanying official Anthropic claim do not by themselves qualify. Resolve NO if no qualifying Anthropic announcement has been publicly made by the end of June 30, 2027. Subsequent rejection, retraction, discovery of an error, or failure to receive the Clay Millennium Prize does not change a YES resolution, because the question concerns whether Anthropic announces that Claude has solved the problem rather than whether the claimed solution is ultimately accepted as correct.

### Fine Print

The deadline is interpreted as 'before July 2027,' meaning publication no later than June 30, 2027, regardless of the precise time of day or timezone shown by the publication platform. The relevant Navier–Stokes problem is specifically the Clay Millennium Prize Problem, not the broader task of solving Navier–Stokes equations in practical or numerical settings. As of September 6, 2026, Clay's Millennium Prize Problems page still presents Navier–Stokes as unresolved. (claymath.org) If Anthropic uses language such as 'candidate solution' or reports that Claude has produced a proof that remains under evaluation without itself asserting that the problem has been solved, this does not qualify. Conversely, wording need not literally contain 'Claude has solved Navier–Stokes' if the announcement clearly and substantively makes that claim.