OpenAI system disproves Exponential Time Hypothesis, result verified in Lean
FlorianGallwitz · x · 2026-10-27
Quoting OpenAI's research statement: their system proved the Exponential Time Hypothesis (ETH) false, with the result subsequently verified in Lean. ETH is a longstanding conjecture about the computational complexity of Boolean formula satisfiability, deeply related to P vs. NP.
The refutation reopens questions about how much faster these tasks could become and may guide the search for better algorithms, though turning theory into practical speedups requires significant further research. The author notes this is the second AI-solved problem he recognized, after Navier-Stokes.
More from Research
- FSPO Beats GRPO and SDPO on Reasoning With Fewer Tokens via Temporal Self-Distillation — IITK · 2026-10-27
- DiscoDemo Uses RL to Generate Diverse Robot Demos, Boosting Real-World Success from 39% to 78% — DAVIAN-Robotics · 2026-10-27
- AI Evaluator Forum Releases AEF-1: Minimum Operating Conditions for Independent AI Evaluations — RishiBommasani · 2026-10-27
- Model breeding begins: neuron combo makes Qwen believe it's Cookie Monster — yacineMTB · 2026-10-27
- EMNLP paper uses sparse autoencoders for text-based causal confounding adjustment — anjalie_f · 2026-10-27
- Volta releases Blackwell kernel verifier letting LLMs generate PTX directly, skipping compiler layers — Azaliamirh · 2026-10-27