The formal record now marks Erdős Problem 44: Extending Sidon Sets as mixed, previously open.
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
The formal record now marks Erdős Problem 80 as mixed, previously open.
The formal record now marks Erdős Problem 331 as solved, previously mixed.
The formal record now marks Erdős Problem 1084 as solved, previously mixed.
The formal record now marks Erdős Problem 1099 as solved, previously mixed.
The formal record now marks Erdős Problem 1106 as mixed, previously open.
AxiomProver: Proved a bound of 212, building on Stadlmann's work, with a Lean certificate of the deduction. Autonomy A1, evidence V2.
GPT-6 Astra: Proved that infinitely many pairs of consecutive primes are at most 186 apart. Autonomy A3, evidence V2.
Claude, ChatGPT and Codex: Proved that infinitely many pairs of consecutive primes are at most 236 apart, improving Stadlmann's 240. Autonomy A1, evidence V2.
29 Sep 2026
The fidelity grade for Erdős Problem 789 moved from F0 to F2.
The fidelity grade for Particular values of the Riemann zeta function moved from F0 to F2.
The fidelity grade for Green's Open Problem 25 moved from F0 to F2.
Erdős Problem 67 is now machine-checked, by Palomar.
The fidelity grade for Erdős Problem 67 moved from F0 to F2.
Palomar registered a rebuild of Erdős Problem 67, attached here as a check.
28 Sep 2026
The formal record now marks Erdős Problem 3 as mixed, previously open.
The formal record now marks Erdős Problem 19 as mixed, previously unclassified.
The formal record now marks Erdős Problem 30 as mixed, previously open.
The formal record now marks Erdős Problem 78 as mixed, previously unclassified.
The formal record now marks Erdős Problem 102 as mixed, previously unclassified.
The formal record now marks Erdős Problem 103 as open, previously unclassified.
The formal record now marks Erdős Problem 148 as mixed, previously unclassified.
The fidelity grade for Erdős Problem 261 moved from F0 to F2.
The fidelity grade for Erdős Problem 302 moved from F0 to F2.
The formal record now marks Erdős Problem 482 as solved, previously unclassified.
The fidelity grade for Erdős Problem 482 moved from F0 to F2.
The formal record now marks Erdős Problem 522 as solved, previously mixed.
The fidelity grade for Erdős Problem 522 moved from F0 to F2.
The fidelity grade for Erdős 809 moved from F0 to F2.
The formal record now marks Erdős Problem 995 as mixed, previously unclassified.
The fidelity grade for Erdős Problem 1054 moved from F0 to F2.
The fidelity grade for Erdős 1219 moved from F0 to F2.
The formal record now marks Green's Open Problem 47 as mixed, previously open.
The fidelity grade for Green's Open Problem 47 moved from F0 to F2.
The fidelity grade for Conjectures in Complexity Theory moved from F0 to F2.
The fidelity grade for Pentanacci π sequence moved from F2 to F0.
The formal record now marks a(n) = 3a(n−1) + a(n−2) − 3a(n−3) as solved, previously open.
The fidelity grade for a(n) = 3a(n−1) + a(n−2) − 3a(n−3) moved from F0 to F2.
The formal record now marks Smallest power with base>1 and exponent n without digit 0 as mixed, previously open.
The formal record now marks Group structure via subgroup counts as solved, previously mixed.
The fidelity grade for Group structure via subgroup counts moved from F0 to F2.
27 Sep 2026
The fidelity grade for Erdős 1220 moved from F0 to F2.
Claude, GPT-5.6 Sol and GPT-6 Astra: 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. Autonomy A1, evidence V1.
Claude, GPT-5.6 Sol and GPT-6 Astra: A finite-time singularity for the incompressible Euler equations on ℝ³ with a force smooth in space and time up to and including the blowup time. Autonomy A1, evidence V1.
Claude, GPT-5.6 Sol and GPT-6 Astra: Finite-time blowup for the inviscid Boussinesq system on ℝ² with smooth forcing in both equations: the temperature stays bounded while its gradient and the vorticity blow up. Autonomy A1, evidence V1.
21 Sep 2026
0 of 100 results identified, 0 written up, 0 checkable. First-hour kit
9 Sep 2026
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
8 Sep 2026
2 of 2 results identified, 2 written up, 2 checkable. First-hour kit
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
7 Sep 2026
4 of 4 results identified, 3 written up, 0 checkable. First-hour kit
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
A finite-time singularity for the incompressible Euler equations on ℝ³ with a force smooth in space and time up to and including the blowup time.
Evidence: written up·stage 2 of 4
Finite-time blowup for the inviscid Boussinesq system on ℝ² with smooth forcing in both equations: the temperature stays bounded while its gradient and the vorticity blow up.
Evidence: written up·stage 2 of 4
4 Sep 2026
1 of 1 results identified, 1 written up, 1 checkable. First-hour kit
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
3 Sep 2026
Proved a bound of 212, building on Stadlmann's work, with a Lean certificate of the deduction.
Evidence: artifact published·stage 3 of 4
Proved that infinitely many pairs of consecutive primes are at most 186 apart.
Evidence: artifact published·stage 3 of 4
1 Sep 2026
Proved that infinitely many pairs of consecutive primes are at most 236 apart, improving Stadlmann's 240.
Evidence: artifact published·stage 3 of 4
23 Aug 2026
An elliptic curve over the rationals of rank at least 31, verified by ICARM's leaderboard.
Evidence: artifact published·stage 3 of 4
20 Aug 2026
An elliptic curve over the rationals of rank at least 30, the first above Elkies and Klagsbrun's 29.
Evidence: artifact published·stage 3 of 4
First-hour kits
6One 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
- Algorithms
- AlphaEvolve problems
- Analytic number theory
- Books
- Discrete geometry
- Erdős
- Extremal combinatorics
- Fluid dynamics
- Green's open problems
- Hilbert
- Kourovka notebook
- Litt's problems
- MathOverflow
- Mathlib
- Millennium
- Number theory
- OEIS
- Open quantum problems
- Optimization constants
- Other
- Papers
- Subsets
- Wikipedia
- Written on the Wall II
- arXiv