HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
openai
NavierStokesAndEuler
Lean2026–2026
openai / NavierStokesAndEuler

NavierStokesAndEuler

Lean certificates accompanying Navier-Stokes and Euler results

15Distinct people
20Mentions
0Explicit recommenders
2.1KGitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Lean certificates accompanying Navier-Stokes and Euler results

GitHub

Where it is used

The last source check was inconclusive. This does not establish whether a product uses it.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 4:59:52 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day20 dated mentions

Observed mentions: 2026-09-08 17:19:07 UTC to 2026-10-08 09:25:15 UTC.

02462026-09-08 00:00:00 UTC to 2026-09-09 00:00:00 UTC (exclusive): 4 mentions; 0 submissions, 4 commentsSep 82026-09-09 00:00:00 UTC to 2026-09-10 00:00:00 UTC (exclusive): 7 mentions; 1 submissions, 6 comments2026-09-10 00:00:00 UTC to 2026-09-11 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-09-11 00:00:00 UTC to 2026-09-12 00:00:00 UTC (exclusive): 3 mentions; 1 submissions, 2 comments2026-09-12 00:00:00 UTC to 2026-09-13 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-09-13 00:00:00 UTC to 2026-09-14 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2026-09-14 00:00:00 UTC to 2026-09-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-15 00:00:00 UTC to 2026-09-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-16 00:00:00 UTC to 2026-09-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-17 00:00:00 UTC to 2026-09-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-18 00:00:00 UTC to 2026-09-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-19 00:00:00 UTC to 2026-09-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-20 00:00:00 UTC to 2026-09-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-21 00:00:00 UTC to 2026-09-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-22 00:00:00 UTC to 2026-09-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-23 00:00:00 UTC to 2026-09-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsSep 232026-09-24 00:00:00 UTC to 2026-09-25 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-25 00:00:00 UTC to 2026-09-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-26 00:00:00 UTC to 2026-09-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-27 00:00:00 UTC to 2026-09-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-28 00:00:00 UTC to 2026-09-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-29 00:00:00 UTC to 2026-09-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-09-30 00:00:00 UTC to 2026-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-01 00:00:00 UTC to 2026-10-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-02 00:00:00 UTC to 2026-10-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-03 00:00:00 UTC to 2026-10-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-04 00:00:00 UTC to 2026-10-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-05 00:00:00 UTC to 2026-10-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-06 00:00:00 UTC to 2026-10-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-10-07 00:00:00 UTC to 2026-10-08 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2026-10-08 00:00:00 UTC to 2026-10-09 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsOct 8

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Sep 82026-09-08 00:00:00 UTC2026-09-09 00:00:00 UTC404
Sep 92026-09-09 00:00:00 UTC2026-09-10 00:00:00 UTC716
Sep 102026-09-10 00:00:00 UTC2026-09-11 00:00:00 UTC101
Sep 112026-09-11 00:00:00 UTC2026-09-12 00:00:00 UTC312
Sep 122026-09-12 00:00:00 UTC2026-09-13 00:00:00 UTC101
Sep 132026-09-13 00:00:00 UTC2026-09-14 00:00:00 UTC101
Sep 142026-09-14 00:00:00 UTC2026-09-15 00:00:00 UTC000
Sep 152026-09-15 00:00:00 UTC2026-09-16 00:00:00 UTC000
Sep 162026-09-16 00:00:00 UTC2026-09-17 00:00:00 UTC000
Sep 172026-09-17 00:00:00 UTC2026-09-18 00:00:00 UTC000
Sep 182026-09-18 00:00:00 UTC2026-09-19 00:00:00 UTC000
Sep 192026-09-19 00:00:00 UTC2026-09-20 00:00:00 UTC000
Sep 202026-09-20 00:00:00 UTC2026-09-21 00:00:00 UTC000
Sep 212026-09-21 00:00:00 UTC2026-09-22 00:00:00 UTC000
Sep 222026-09-22 00:00:00 UTC2026-09-23 00:00:00 UTC000
Sep 232026-09-23 00:00:00 UTC2026-09-24 00:00:00 UTC000
Sep 242026-09-24 00:00:00 UTC2026-09-25 00:00:00 UTC000
Sep 252026-09-25 00:00:00 UTC2026-09-26 00:00:00 UTC000
Sep 262026-09-26 00:00:00 UTC2026-09-27 00:00:00 UTC000
Sep 272026-09-27 00:00:00 UTC2026-09-28 00:00:00 UTC000
Sep 282026-09-28 00:00:00 UTC2026-09-29 00:00:00 UTC000
Sep 292026-09-29 00:00:00 UTC2026-09-30 00:00:00 UTC000
Sep 302026-09-30 00:00:00 UTC2026-10-01 00:00:00 UTC000
Oct 12026-10-01 00:00:00 UTC2026-10-02 00:00:00 UTC000
Oct 22026-10-02 00:00:00 UTC2026-10-03 00:00:00 UTC000
Oct 32026-10-03 00:00:00 UTC2026-10-04 00:00:00 UTC000
Oct 42026-10-04 00:00:00 UTC2026-10-05 00:00:00 UTC000
Oct 52026-10-05 00:00:00 UTC2026-10-06 00:00:00 UTC000
Oct 62026-10-06 00:00:00 UTC2026-10-07 00:00:00 UTC000
Oct 72026-10-07 00:00:00 UTC2026-10-08 00:00:00 UTC202
Oct 82026-10-08 00:00:00 UTC2026-10-09 00:00:00 UTC101

What Hacker News says

7 sources
"Blowup for the Euler equations with smooth forcing" (2026) https://cims.nyu.edu/~tristanb/euler.pdf "Blowup for the Boussinesq equations with smooth forcing" (2026) https://cims.nyu.edu/~tristanb/boussinesq.pdf "Extending the Córdoba–Martínez-Zoroa IPM Blow-Up to Uniformly Spacetime Smooth Forcing" (2026) https://cims.nyu.edu/~tristanb/ipm.pdf "Finite Time Blowup for the Euler equation" (2026) https://cdn.openai.com/pdf/315b36cd-ec98-4023-8342-93345194e... Lean proof: openai/NavierStokesAndEuler: https://github.com/openai/NavierStokesAndEuler
In Navier-Stokes – Tristan Buckmaster [pdf]
Prompting them yes, suggesting potentially fruitful research directions and so on, but the actual research was conducted by hundreds of agents swapping millions of messages and using billions of output tokens over 88 hours. The result being a huge Lean proof: https://github.com/openai/NavierStokesAndEuler. It's not just possible for humans to manually guide such a process in a meaningful way. They can set the direction and attempt to understand the result, but they solution itself must emerge (or not) from the agent swarm. So yes, the models do seem to be "solving" the problems themselves, but not necessarily in the way we think of mathematical discoveries happening. Academic mathematics has historically been resource constrained: There are a limited number of top-level mathematicians, and they only have so much time and brain power to sp
Read the rest
end. So when approaching a problem, they are essentially forced to be as efficient as possible, not just searching for a solution, but for one that can be achieved within their cognitive budget. This induces them to develop novel techniques and abstractions, and it is actually those techniques and abstractions that tend to be the valuable part for further research, not the proof itself. An agentic swarm is like getting a single skilled mathematician, cloning them a hundred times, then locking them in a room with the single objective of solving a problem. No longer constrained by time or brain power, they can approach it differently, using pre-existing techniques to gradually build their way to a solution. This process might not require a single intuitive leap or new discovery, and the solution will not be simple or elegant, but they will probably get there. It is more like a process of intelligently guided search than invention.
In How An AI math breakthrough ignited a controversy

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.