OpenAI's faster FFT survives the arbitrary-precision critique in finite fields
mgostIH · x · 2026-10-13
- A debate questioned whether OpenAI's faster Fourier Transform is a theory hack relying on arbitrary-precision real arithmetic.
- nicodoettling shows it isn't: savings persist when transferred to the finite odd-characteristic setting, where no o(n log n) algorithm was known either.
- mgostIH adds that even if the precision critique held, the theoretical work would still be groundbreaking.
Related event: OpenAI's Faster FFT Claim Sparks Academic Debate(9 posts)→
More from Research
- Anthropic-linked research shows 9B models can now self-replicate across networks — JeffLadish · 2026-10-13
- Cohere's JEPA learns physics on Earth, generalizes zero-shot to outer space — Cohere_Labs · 2026-10-13
- RoboARCade launches: agents directly control robots, best GPT-6 setup tops out at 49.8% success — leto__jean · 2026-10-13
- Two papers outline 'Agentic Economics' for managing AI agent R&D resources — dotey · 2026-10-13
- One-line decorator turns any combinatorial solver into a differentiable NN layer — PMinervini · 2026-10-13
- Tyler Chen's free monograph demystifies the Lanczos algorithm for matrix functions — tak3sh8 · 2026-10-13