Opus 5.5 updates a classic meme after integer multiplication beats n log n
ctjlewis · x · 2026-10-07
OpenAI math researcher Elliot Glazer had Claude Opus 5.5 update a classic complexity meme, and it's being widely retweeted. The cited context: researcher Acer notes "we can do integer multiplication faster than n log n lol," admitting he was very surprised when the result came in — a new breach of the long-standing n log n barrier for integer multiplication. The post turns a real algorithmic breakthrough into a meme.
More from Fun
- The perfect reply to "I read all the OpenAI math preprints": /compact — menhguin · 2026-10-07
- AI circles mocked for cheering OpenAI's math results without understanding a word of it — BLUECOW009 · 2026-10-07
- AI coding agents roasted in a limerick: the more you install, the more you work — tdhopper · 2026-10-07
- Runway unveils 'What We Forgot,' an AI film set in 2030 looking back at pre-AI life — c_valenzuelab · 2026-10-07
- Three types of people vibe coding SaaS clones: nerds, broke devs, and paid shills — kylegawley · 2026-10-07
- 'Below n log n' Claim Exposed: It's Actually n(log n)^0.54999... — BLUECOW009 · 2026-10-07