Claim: a Lean formalization 'proves' the Exponential Time Hypothesis is false
akbirthko · x · 2026-10-27
A circulating claim shows a Lean formalization scope statement asserting the Exponential Time Hypothesis is false: Lean allegedly proves a deterministic machine counts satisfying assignments of canonically encoded k-CNF in subexponential time 2^Ok(n·loglog n²/√logn), with a SubexponentialSAT.lean comparator. The poster jokes it would be funny if Knuth is wrong and P vs NP gets a constructive proof. Such claims have historically never held up — treat as a probable P vs NP stunt, though newsworthy amid the buzz.
More from Fun
- Model breeding begins: neuron combo makes Qwen believe it's Cookie Monster — yacineMTB · 2026-10-27
- Anthropic IPO talk reaches boomers: 84-year-old mom texts "Anthropic is going public" — geoffwolfe · 2026-10-27
- Founding-age list goes viral: Dario Amodei was 38, most tech founders were 30 — akbirthko · 2026-10-27
- AI circle joke: dismantling Mercury would be easier than building housing in the Bay Area — generativist · 2026-10-27
- davidfowl claps back at theo: too many hand-merged PRs means you work with people, not agents — rakyll · 2026-10-27
- "Living on-call with Codex and Claude": devs joke their agents pager them 24/7 — sloppenheimer · 2026-10-27