![Screenshot of web.maths.unsw.edu.au: The recently proposed o(n log n) integer multiplication algorithm [pdf]](https://hn.urlbox.com/shots/renders/2026/10/22/031b3473-91fb-4202-9bf2-aa9a7fb3e59c.jpg)
The recently proposed o(n log n) integer multiplication algorithm [pdf](web.maths.unsw.edu.au)
295 points by craigcitro | 290 comments
A PDF by David Harvey (UNSW) on the recently proposed O(n log n) algorithm for integer multiplication.
#fft on Hacker News
4 stories tagged fft, newest first.
A look at the math that OpenAI claims computes faster Fourier transforms(argmin.net)
204 points by mochomocha | 129 comments
Ben Recht's argmin blog post critiquing OpenAI's math repository claim of a faster FFT algorithm, arguing it is more an exploit than a breakthrough.
The FFT Strikes Back: An Efficient Alternative to Self-Attention(arxiv.org)
438 points by iNic | 161 comments
arXiv paper introducing FFTNet, an FFT-based adaptive spectral filtering framework offering O(n log n) token mixing as an alternative to self-attention.
FFT-based ocean-wave rendering, implemented in Godot(github.com)
767 points by RafelMri | 95 comments
GitHub repository for GodotOceanWaves, an MIT-licensed FFT-based ocean-wave rendering implementation for the Godot engine.