qedbot

Breaking

The newest dated claims, announcements and changes the register holds, the latest first. Each claim shows how far its evidence has come, from a bare claim to a rebuild by someone independent of its authors, and every announcement's first-hour kit is listed below.

Refreshed .

Seen in the last week

What qed.bot's monitors have picked up from lab announcements, arXiv, Formal Conjectures and the other sources on the status page. None of it is graded until the register has read the source itself.

Reading what the monitors have seen…

30 Sep 2026

29 Sep 2026

28 Sep 2026

27 Sep 2026

21 Sep 2026

9 Sep 2026

Existence and Smoothness of the Navier–Stokes Equation

GPT-6 Astra·supporting task

Formalised the Navier–Stokes and Euler results in Lean, checked with Comparator against the Formal Conjectures statements of alternatives (C) and (D).

Evidence: artifact published·stage 3 of 4

full A1 V2 F3

8 Sep 2026

Existence and Smoothness of the Navier–Stokes Equation

OpenAI internal model

Finite-time blowup for the 3D incompressible Navier–Stokes equations with smooth forcing, on Euclidean space and on the torus: Fefferman's alternatives (C) and (D), a negative answer to the Millennium problem. Unforced Euler blowup is proved alongside.

Evidence: artifact published·stage 3 of 4

full A2 V2 F3

7 Sep 2026

Finite-time blowup for the incompressible porous media equation with smooth forcing

Claude, GPT-5.6 Sol, GPT-6 Astra·with Levent Alpöge, Tristan Buckmaster, Matei P. Coiculescu

Finite-time blowup for the incompressible porous media equation on the two-dimensional torus with a force smooth in space and time, extending Córdoba and Martínez-Zoroa's result with a spatially smooth force.

Evidence: written up·stage 2 of 4

full A1 V1 F0

4 Sep 2026

Fermat's Last Theorem

Claude·supporting task

A complete Lean 4 proof of Fermat's Last Theorem on the standard axioms, deriving Mathlib's own statement, with the classical inputs proved in the strength the argument needs rather than assumed.

Evidence: artifact published·stage 3 of 4

full A1 V2 F2

3 Sep 2026

Bounded gaps between primes

AxiomProver·with François Charton, Letong Hong, Kenny Lau, Ken Ono, Guillaume Remy, Ho Chung Siu, Ashvin A. Swaminathan, Jesse Thorner, Yunzhou Xie

Proved a bound of 212, building on Stadlmann's work, with a Lean certificate of the deduction.

Evidence: artifact published·stage 3 of 4

superseded A1 V2 F2
Bounded gaps between primes

GPT-6 Astra

Proved that infinitely many pairs of consecutive primes are at most 186 apart.

Evidence: artifact published·stage 3 of 4

record A3 V2 F2

1 Sep 2026

Bounded gaps between primes

Claude, ChatGPT, Codex·with Shiva Kintali

Proved that infinitely many pairs of consecutive primes are at most 236 apart, improving Stadlmann's 240.

Evidence: artifact published·stage 3 of 4

superseded A1 V2 F2

23 Aug 2026

20 Aug 2026

First-hour kits

6

One for every announcement the register holds, the latest first: what was claimed, how much of it can be inspected, and whether anyone independent has checked it.

Follow by feed

Every statement, record and system has its own Atom feed, linked from its page. The whole register, and each collection, can be followed here.

By collection · 25