Wes Roth · 2026-10-27 · notable
Wes Roth — 'OpenAI just broke physics...'
Wes Roth explains OpenAI's claim that its AI disproved the Exponential Time Hypothesis, how that links to P versus NP, and what shortcuts to 'hard' problems could mean for encryption and AI.
Wes Roth walks through OpenAI's Exponential Time Hypothesis result and why computer scientists care.
What is it?
Wes Roth's video 'OpenAI just broke physics...' covers OpenAI's announcement that its AI disproved the Exponential Time Hypothesis, a long-standing assumption in computer science about how hard some problems are to solve.
How does it work?
The chapters start with OpenAI's announcement, then explain P versus NP and the Exponential Time Hypothesis, look at how AI is changing mathematicians' work, and use a mountain analogy and a 'cheat code' framing. Roth cites OpenAI's post, Lean proof notes in the openai/math repo, Scott Aaronson's P vs NP survey and Emanuele Viola's 'I believe P=NP' post.
Why does it matter?
If problems assumed to need exponential time have faster shortcuts, ideas about what is safe to rely on, from encryption to algorithm design, may need a second look. The video gives non-specialists the background to follow the debate.
Who is it for?
anyone curious about AI-driven math results