OpenAI proves matrix multiplication solvable in O(n^2.25) operations — but no algorithm yet
Pascallisch · x · 2026-10-07
OpenAI has proven matrix multiplication can be done in O(n^2.25) operations, a massive leap past the previous record of O(n^2.37), which had barely moved from O(n^2.4) since 1990. Notably consequential since AI itself runs on matrix algebra. The catch: the proof is nonconstructive — it shows a faster algorithm must exist but doesn't provide one. As Pascallisch puts it, it's all matmul in the end, so any advance in shaving matmul time — via hardware, software, or algorithms — is highly consequential.
More from Research
- OpenAI's one-tape TM simulation implies RAM time t is in SPACE[t^4/5], says Williams — rrwilliams · 2026-10-07
- What If AI Agents Remembered Like Living Systems? A Mycelial Framework for Agent Memory — repligate · 2026-10-07
- U. Tokyo's Kavli IPMU Hires Postdocs to Build Agentic AI for Theoretical Physics — fatihdin4en · 2026-10-07
- ACL 2027 launches special theme track on LLM homogenization and knowledge collapse — TuhinChakr · 2026-10-07
- Microsoft's PrisMem evolves agent memory per-capability, beats baselines by 10.5 points on BEAM-1M — microsoft · 2026-10-07
- Google's SEER adds self-evolving event reasoning to time-series forecasting, beats SOTA on six benchmarks — google · 2026-10-07