What If P=NP Gets Solved? Clips From OpenAI Researchers and RSA's Ron Rivest
CedricMakes · x · 2026-09-12
A thread compiles podcast clips on P vs NP: OpenAI researchers on mathematical reasoning ("never solve something like P versus NP"), and Ron Rivest calling a P=NP resolution "a cryptographer's nightmare — cryptography is down the toilet," while noting a slow algorithm could render it irrelevant. The author used AI to build a playlist of podcasts explaining P=NP, framing the stakes: scalable secrets (SSL, crypto) could end, but many breakthroughs could be unlocked.
Related event: What If P=NP Is Proved: Crypto Collapse and a Science Singularity(2 posts)→
More from Fun
- Selling Prompts Gets Community-Noted: "Your LLM Rebuilds It in 5 Minutes" — jh3yy · 2026-09-12
- Designer uses GPT-Image to launch "OK, doomer" anti-AI-panic poster series — AIandDesign · 2026-09-12
- Open-source digital koi pond doubles as a voice recorder for under $60 — TinfoilTricorn · 2026-09-12
- Anthropic insider on the pile-on: 'there's an actual person behind every tweet' — reach_vb · 2026-09-12
- Dad lore: how a computer use AI model blasting 50k dating app messages found mom — signulll · 2026-09-12
- The cattle yearns for the Oracle machine: AI-twitter's beast-of-burden meme — ludwigABAP · 2026-09-12