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
- Malthus Saw It in 1798: Wealthy Avoiding Kids, Delayed Marriage Repeats Today — SydSteyerhart · 2026-11-16
- Runway CEO Predicts Fully AI-Generated Cultural Phenomenon by 2027 — c_valenzuelab · 2026-11-16
- '5% worse and 10% cheaper': the button with no vote is already everywhere — eigenrobot · 2026-11-16
- Effective Altruism is top-down and hierarchical, not a grassroots movement — ctjlewis · 2026-11-16
- Lawyers say clients' AI use creates unrealistic expectations and fake case law in settlements — hoofnagle · 2026-11-16
- Dev debunks 'rogue AI' hype: subsidized subscriptions can't fund expensive swarms — gerardsans · 2026-11-16