OpenAI Announces Three Major AI-Driven Discoveries in Math, CS, and Physics

Around October 27, OpenAI published an update on its collaborative research with the academic community, headlined by a striking claim: an internal model produced an alleged refutation of the Exponential Time Hypothesis (ETH) in computational complexity theory — namely, that 3SAT requires exponential time. If valid, it would overturn a number of established results that presuppose ETH. A circulating screenshot (relayed by @felpix) further claims the proof has since been formally verified in the Lean proof assistant.

Confirmed

Not Yet Confirmed

Why It Matters

ETH is a long-standing core conjecture about the computational complexity of Boolean satisfiability (SAT), closely tied to P vs NP, and a large body of complexity results assumes it holds. A confirmed refutation would be a landmark achievement for AI-assisted mathematical research and would force the field to re-examine a host of theorems that rely on ETH. Meanwhile, the review team's arrangement — no NDAs, no compensation, full transparency throughout — offers a replicable model for how major scientific claims produced by AI can be subjected to human peer review.

2026-10-27 ~ 2026-10-27 · 36 related posts

Primary sources

6 near-duplicate retellings: morey56 · rohanpaul_ai · Dr_Singularity · Dr_Singularity · Dr_Singularity · ErnestRyu