Report: OpenAI's Internal Model Solves 10+ Open Math Problems, AI-Assisted Proofs Gain Traction
jiaxinwen22 · x · 2026-08-09
Theoretical computer scientist Scott Aaronson revealed on his blog that an internal OpenAI model has solved ten significant open problems in math and theoretical computer science. These include parallel repetition for arbitrary quantum games and polynomial-factor hardness of approximation for the Closest Vector Problem (CVP).
Separately, Frederic Koehler and Pui Kuen Leung announced a proof for the Permanent Anti-Concentration Conjecture proposed by Aaronson 16 years ago, acknowledging that they discussed ideas with ChatGPT. Aaronson highlighted that multiple AIs are now breaking through barriers in solving complex mathematical problems.
More from AGI Musings
- Beff Jezos declares 'civilizational inflection point' in the acceleration of technological progress — beffjezos · 2026-10-16
- Data scientist: pivoting to AI engineering is the safest career bet for the next 5 years — mdancho84 · 2026-10-16
- AI will be superhuman at science regardless, and Europe can't opt out — teortaxesTex · 2026-10-16
- beffjezos to Aaron Levie: techno-optimism is hyperstitious — basedjensen · 2026-10-16
- AI demos haven't changed since 2023, only gotten better — same scenarios — yangyi · 2026-10-16
- CFR experts: the autonomous weapons debate still has a definition problem — mchorowitz · 2026-10-16