Claimed proof would solve 3-SAT in sub-exponential time, breaking all NP-complete problems
IgorCarron · x · 2026-10-27
A circulating proof, if correct, would solve 3-SAT in sub-exponential time. Since 3-SAT is NP-complete, every other NP-complete problem reduces to it, meaning nothing would remain exponential. IgorCarron notes the correctness is unverified, but the claim, if true, would be a landmark result in complexity theory with implications for cryptography and search.
More from Research
- OffensiveCon Tokyo demo: finding iOS 0-days with Muse Spark — dyn___ · 2026-10-27
- Michigan's KIDBench finds LLM child safety varies sharply with age awareness, language, culture — radamihalcea · 2026-10-27
- EdgeRock architecture keeps KV cache at 72 MiB for 256K context, 99.1% smaller than Qwen3.5-4B — alifcoder · 2026-10-27
- 'It's just next-token prediction' is dead: a breakdown of 10 interpretability & AI wellbeing studies — Scorpios22 · 2026-10-27
- Equivariant Music Transformer accepted to ISMIR 2026 with Best Paper Award nomination — umpedronosapato · 2026-10-27
- Deedy shares links to the OpenAI and Claude ETH-refutation documents — deedydas · 2026-10-27