After sub-n log n FFT and subquadratic 3SUM, researchers joke: maybe P = NP via a GPT-8 SAT algorithm

aran_nayebi · x · 2026-10-08

• Researcher Aran Nayebi says recent algorithmic breakthroughs — sub-n log n FFT, subcubic APSP, and subquadratic 3SUM — have shaken his belief that humans were ever good at algorithms, half-jokingly updating to "maybe P = NP" via a clever SAT algorithm GPT-8 discovers running in n^c time with c 10^6.
• Theoretical computer scientist TaliaRinger quote-retweets admitting she has semi-secretly believed P = NP with wildly impractical constant factors since undergrad (2008-2012).
• A humorous algorithm-community reaction to the steady erosion of complexity-class barriers.

Original post →

More from Fun

• 80% of My Net Worth Is Digital Cash GPT 6.7 Could Trace in Real Time — menhguin · 2026-10-08
• 'Money Is All You Need': the OpenAI paper parody meme going around — shauseth · 2026-10-08
• ChatGPT builds an interactive piano in-chat via new GenUI feature — flowersslop · 2026-10-08
• repligate: People Who Gained Real Power From Posting Are All Extraordinarily Capable — repligate · 2026-10-08
• Dropping out of CS on November 30, 2022 — the day ChatGPT launched — haydendevs · 2026-10-08
• Gemini Omni turns a noble dad joke into a classical oil painting animation — carinkemo · 2026-10-08

Fun channel →