Dev tools · alternatives · 2026

24 alternatives to FFTN, faster than FFTW in 700 lines of C

I am playing around with using arrays of arbitrary dimension as framework for designing FFT implementations, as opposed to the more classical approach of tensor products and butterflies (too complicated in my opinion). It turns out, that with a modern compiler, you do not need much complexity to make a really fast implementation. This implementation is for powers of 2, and optimized for arrays that do not fit in cache. I do think it would be better to use a higher-level language to implement other cases (e.g. n = 2^a * 3^b * 5^c, multiple small FFTs, higher-dimensional), so I am currently…

Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.

1
Speeding up LLM inference 2x times (possibly)▲419
Here's a project I've been working on for the last few months. It's a new (I think) algorithm, that allows to adjust smoothly - and in real time - how many calculations you'd like to do during inference of an LLM model. It seems that it's possible to do just 20-25% of weight multiplications instead of all of them, and still get good inference results. I implemented it to run on M1/M2/M3 GPU. The mmul approximation itself can be pushed to run 2x fast before the quality of output collapses. The inference speed is just a bit faster than Llama.cpp's, because the rest of implementation…
2024 · asciinema.org · its alternatives →
2
Fast.js – faster reimplementations of native JavaScript functions▲323
Faster user-land reimplementations for several common builtin native JavaScript functions. - codemix/fast.js
2014 · github.com · its alternatives →
3
A minimal FFT code▲100
2018 · lambdaway.free.fr · its alternatives →
4
Array with Constant Time Access and Fast Insertion and Deletion▲300
Contribute to igushev/IgushArray development by creating an account on GitHub.
2019 · github.com · its alternatives →
5
A work-in-progress C compiler from scratch▲159
Programming language that compiles into a x86 ELF executable. - riicchhaarrd/ocean
2021 · github.com · its alternatives →
6
Finite Field Assembly:Emulate GPU on CPU▲25
A new programming language rooted in Pure Mathematics
2025 · leetarxiv.substack.com · its alternatives →
7
Faking SIMD to Search and Sort Strings 5x Faster▲29
I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…
2023 · ashvardanian.com · its alternatives →
8
Faster.js – a micro-optimizing JavaScript compiler▲89
faster.js is a Babel plugin that compiles idiomatic Javascript to faster, micro-optimized Javascript. - vzhou842/faster.js
2018 · github.com · its alternatives →
9
Fast integer compression library in C▲45
A very fast scalar implementation for Frame Of Reference integer compression. - cruppstahl/libfor
2015 · github.com · its alternatives →
10
less than 650 LOC trainable GPT only using NumPy▲90
Absolute minimalistic implementation of a GPT-like transformer using only numpy (<650 lines). - joennlae/tensorli
2023 · github.com · its alternatives →
11
A Fast, Malloc-Free C++14 Json Parser and Encoder▲98
Meta programming utilities for C++14. Merged in matt-42/lithium - matt-42/iod
2014 · github.com · its alternatives →
12
LoopMix128 – Fast C PRNG (.46ns), 2^128 Period, BigCrush/PractRand Pass▲76
LoopMix128 is a fast C PRNG I wrote for non-cryptographic tasks. GitHub (MIT): https://github.com/danielcota/LoopMix128 Highlights: * ~0.37 ns/value (GCC 11.4, -O3 -march=native), 98% faster than xoroshiro128++ and PCG64. * Passes TestU01 BigCrush & PractRand (32TB). * Guaranteed 2^128 period. * Proven injective (192-bit state) via Z3 SMT solver; allows parallel streams. * Core requires only stdint.h. Seeking feedback on design, use cases, or further testing.
2025 · github.com · its alternatives →
13
ffjson: faster json serialization in Go▲83
2014 · journal.paul.querna.org · its alternatives →
14SA
Sparser – A Multilanguage Parser▲65
* https://sparser.io * https://github.com/Unibeautify/sparser This is my attempt at creating a universal language parser. It attempts to solve a couple of problems: * Support multiple languages * Recursively extend support to languages embedded within other languages * Output a uniform format for all supported languages This is a personal project so any feedback would be helpful. Something interesting I found after I built it is that this parser is not as fast to write output as many other JavaScript parsers, but its output is much faster to read from due to the…
2019 · its alternatives →
15LR
Linear RNN/Reservoir hybrid generative model, one C file (no deps.)▲7
I just noticed it takes literally ~5 minutes to train millions parameters on slow CPU...but before you call Yudkowsky that "it's over", an important note: the main bottleneck is the corpus size, params are just 'cleverness' but given limited info it's powerless. Anyway, here is the project: https://github.com/bggb7781-collab/lrnnsmdds/tree/main couple of notes: 1. single C file, no dependencies. Below are literally all the "dependencies", not even custom header (copy paste from the top of the single c file): #define _POSIX_C_SOURCE 200809L #include #include…
Apr 2026 · raw.githubusercontent.com · its alternatives →
16
Coderive – Iterating through 1 Quintillion Inside a Loop in just 50ms▲8
Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…
Dec 2025 · github.com · its alternatives →
17
Fast Random Library for C++17▲52
Morning HN. Random number generation feels is a somewhat underrepresented topic in the C++ realm. There is a lot of questionable info about it found online and even the standard library is quite behind the times in terms of it's algorithms. It suffers from trying to accommodate sometimes impractical standard requirements and has several ways of getting significantly bad statistical results. This leaves a lot easily achievable performance & quality on the table. So, being a mathematician who mostly works with stochastic models and wants these models to run fast and well, I embarked on a…
2025 · github.com · its alternatives →
18
Less Slow C++▲6
Earlier this year, I took a month to reexamine my coding habits and rethink some past design choices. I hope to rewrite and improve my FOSS libraries this year, and I needed answers to a few questions first. Perhaps some of these questions will resonate with others in the community, too. - Are coroutines viable for high-performance work? - Should I use SIMD intrinsics for clarity or drop to assembly for easier library distribution? - Has hardware caught up with vectorized scatter/gather in AVX-512 & SVE? - How do secure enclaves & pointer tagging differ on Intel, Arm, & AMD? - What's…
2025 · github.com · its alternatives →
19
Fast Monte Carlo Permutation Simulator in C▲28
Contribute to monetate/monte-carlo-simulator development by creating an account on GitHub.
2013 · github.com · its alternatives →
20AS
A stab at building my own string diffing library▲29
Took a stab at building my own string diffing JS package. I built an interactive demo for TypeIt’s website (https://typeitjs.com/build-your-own) a while back. The approach I took to handle user input necessitated a way to calculate the difference between the versions of a user’s text input. I searched around for a package to help me out and found a couple of good ones (like fast-diff), but I either didn’t really like their API or didn’t want to take on a huge new dependency. Instead, I thought I’d give it a shot myself (famous last words). I dove into it having no real formal…
2022 · its alternatives →
21
33% Memory Reduction by Reordering Struct Fields▲19
Learn Go (Golang) by writing real code in this interactive course. Practice structs, interfaces, errors, concurrency, and idiomatic backend patterns.
2020 · qvault.io · its alternatives →
22
Faster Than CGAL Delaunay in Julia▲7
GitHub Gist: instantly share code, notes, and snippets.
2014 · gist.github.com · its alternatives →
23
2x-4x faster strlen() in C▲19
GitHub Gist: instantly share code, notes, and snippets.
2023 · gist.github.com · its alternatives →
24AA
An animated graphing calculator implemented in a pixel shader▲30
Find information, resources and relevant links for fofpx.com. This domain may be for sale.
2020 · fofpx.com · its alternatives →

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →