GPT-6 Astra reportedly proves weak Goldbach case unconditionally in 2 pages
yshan2u · x · 2026-09-27
An unverified but widely shared math breakthrough: GPT-6 Astra has reportedly solved a weaker form of Goldbach's conjecture unconditionally, with the proof verified by computer — potentially as significant as the recent Navier–Stokes proof, minus the drama.
- The quoted tweet comes from a math researcher: Astra proved the unconditional conjecture for multiples of 4 in just a 2-page proof;
- It combines a result from Mangerel's paper with the team's earlier work on normality of special constants;
- A previously GRH-conditional weaker case now has an unconditional two-page proof using little more than high-school mathematics.
The poster frames it as a turning point: AI pushing discovery beyond the human frontier while democratizing frontier mathematics. Caveat: social media claim only — no formal paper or official confirmation yet.
More from AGI Musings
- DHH: hand-writing code is no longer economically productive for most programmers — AccBalanced · 2026-09-27
- No autobiographical memory, no consciousness: a new theory of the subject of experience — yeastsplainer · 2026-09-27
- tszzl bets neural nets will be shown to decompose into evolved symbolic systems before superintelligence — tszzl · 2026-09-27
- Dev bets top games in 20 years won't be made by AI — FanaHOVA · 2026-09-27
- Terry Tao on working with o1: like advising a mediocre but not incompetent grad student — burny_tech · 2026-09-27
- Developer who never liked coding welcomes AI taking over more of his job — 4310sy · 2026-09-27