← Back to live feed1 story
Ryan Shea published a research draft proposing a computational approach for Fourier transforms that claims a 730 million fold increase in exponent saving over a previous OpenAI value. Following these findings, SolidSF released sfFFT, an open source library achieving 3.8x to 6.1x speedups on DGX Spark GB10 hardware by trading numerical precision for speed.
Sign in to suggest edits
Key sources
- SOURCEmarketbrief.now
- SOURCE@ryaneshea“T(n) = O(n(log n)^(1−δ)), with δ = 0.0007547360”x.com
- SOURCE@ryaneshea“No practical FFT speedup is claimed”x.com
- SOURCE@0xdoug“His Lean formalization verifies key finite identities and exact arithmetic”x.com
- SOURCE@ryaneshea“The finite checks pass; they do not establish the universal theorem”x.com
- SUPPORT@guimarin“They cross walked 109 and 130”x.com
- SUPPORT@solidsf“3.8x to 6.1x end-to-end* speedup on dgx spark GB10”x.com
- SOURCEhuggingnewshuggingnews.com