O(n²) matrix multiplication is almost certainly false even if ω = 2, says basedjensen
basedjensen · x · 2026-10-06
Amid the buzz over the KLS conjecture proof, one researcher predicted that given the authors involved, a proof that matrix multiplication is O(n²) could arrive by end of year. basedjensen pushed back: even if ω = 2, O(n²) is almost certainly false — the realistic target is n^(2+o(1)), and even that would be the algorithms result of the century.
He added that he'd expect this to be part of what OpenAI has been sitting on, judging from how Greg Brockman has been moving lately.
More from Companies & People
- Ex-DeepMind researcher testifies Google, including Demis Hassabis, backed off AI safety commitments — BlackHC · 2026-10-06
- Debate swirls over OpenAI's unreleased math proofs as attitudes flip in two weeks — basedjensen · 2026-10-06
- NotebookLM lands at No. 9 in a16z consumer AI rankings as Google takes 4 of top 20 — stevenbjohnson · 2026-10-06
- Kevin Mandia: AI attacks run at machine speed, defense must go autonomous — a16z Podcast · 2026-10-06
- Jobs Called Touchscreen Macs 'Terrible' — 16 Years Later, Apple May Ship One — Kiteaton · 2026-10-06
- Redditor Publishes Free, Independently Researched Deep-Dive Breakdown of OpenAI — Roadtochessmaster · 2026-10-06