Dankrad: Proving P=NP Would Likely Have Zero Implications for Cryptography
soumitrashukla9 · x · 2026-09-11
Ethereum researcher Dankrad Feist echoes Donald Knuth: even if P=NP is proved, it will almost surely be nonconstructive and unhelpful. He argues it would most likely mean zero implications for cryptography and instead expose bad mathematical axioms — like Banach-Tarski, interesting to mathematicians but with no real-world implications.
Related event: Knuth and Researchers Say a P=NP Proof Would Likely Be Useless in Practice(2 posts)→
More from Research
- Real-SWE benchmark tests coding agents on private codebases from real companies, with error bars — daveholtz · 2026-09-11
- Jessica Hullman: Transparency chaos may push venues to fix peer review policy — JessicaHullman · 2026-09-11
- Free Systems Lab Turns 476,000 Words of Model Cards Into 28 Comparable Frontier Cards — soumitrashukla9 · 2026-09-11
- Free Systems Lab Shrinks Model Cards to Pokémon-Card Size and Wants Your Feedback — soumitrashukla9 · 2026-09-11
- Bullshit Benchmark: 55 Nonsense Questions Trip Up Most LLMs That Refuse to Push Back — luisdans · 2026-09-11
- OSU Professor Hai-Jun Su Wins Three ASME Awards for AI-Assisted Machine and Robot Design — AndrewDai · 2026-09-11