Dev tools · alternatives · 2026

24 alternatives to LoopMix128 – Fast C PRNG (.46ns), 2^128 Period, BigCrush/PractRand Pass

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.

LoopMix128 is a fast C pseudorandom number generator for non-cryptographic applications. It generates values at approximately 0.37 nanoseconds per output, passes statistical tests including TestU01 BigCrush and… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.

1
DualMix128 – A fast, simple PRNG passing PractRand (32TB) and BigCrush▲5
Hi HN, I'd like to share DualMix128, a pseudo-random number generator I developed. It's written in C and achieves very high speed while maintaining strong statistical properties for non-cryptographic use. GitHub (MIT License): https://github.com/the-othernet/DualMix128 Key points: * *Fast:* Benchmarked at ~0.36 ns per 64-bit generation on GCC 11.4 (-O3 -march=native). This was over 2x faster than `xoroshiro128++` (~0.74 ns) and competitive with `wyrand` (~0.36 ns) in the same tests. (Benchmark code/results in repo). * *Robust:* Passes the full TestU01 BigCrush suite…
2025 · github.com · its alternatives →
2
10-40% faster LZMA decoder using x86 CMOVcc▲205
Faster LZMA decoder for x86 CPUs (patch for XZ Utils). - faster_lzma_decoder_x86.patch
2021 · gist.github.com · its alternatives →
3
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 →
4
Xcc700: Self-hosting mini C compiler for ESP32 (Xtensa) in 700 lines▲154
Repo: https://github.com/valdanylchuk/xcc700 Hi Everyone! I just wrote my first compiler! - single pass, recursive descent, direct emission - generates REL ELF binaries, runnable using ESP-IDF elf_loader - very basic features only, just enough for self-hosting - treats the Xtensa CPU as a stack machine for simplicity, no register allocation / window usage - compilable on Mac, probably also Linux, can cross-compile for esp32 there - wrote for fun / cyberdeck project Sample output from esp32: xcc700.elf xcc700.c -o /d/cc.elf [ xcc700 ] BUILD COMPLETED >…
Dec 2025 · github.com · its alternatives →
5MW
My weekend project, QR-codes for everybody▲203
I wanted QR codes to be really simple to implement everywhere and for everyone. So I spent some time on my weekends trying to write a fast QR generator module for Apache, and here are the results: ab -n 5000 -c 100 http://lilqr.com/qr Requests per second: 4301.78 [#/sec] (mean)
2011 · lilqr.com · its alternatives →
6
A hash array-mapped trie implementation in C▲171
Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · its alternatives →
7NC
Nanosecond C message logger▲131
Hello, Some time ago I did a data logger for fun, just to check if I could beat the performance of an old C++ project of mine (mini-async-log) and to avoid letting my multithreading-C skills rust when on a non-programming gig (using Yocto/OE, very little programming). This project is a BSD licensed, producer-wait-free (when using thread-local storage) generic message logger with high performance, decent test coverage, and type-safe C strings (requires C11 or C++ compiler). It was a shame to let this project to die unknown, as I think that it has potential to be used on some niches as…
2019 · its alternatives →
8
GPT‑5.3‑Codex‑Spark▲277
An ultra-fast model for real-time coding in Codex
Feb 2026 · openai.com · its alternatives →
9
Forkrun – NUMA-aware shell parallelizer (50×–400× faster than parallel)▲151
forkrun is the culmination of a 10-year-long journey focused on "how to make shell parallelization fast". What started as a standard "fork jobs in a loop" has turned into a lock-free, CAS-retry-loop-free, SIMD-accelerated, self-tuning, NUMA aware shell-based stream parallelization engine that is (mostly) a drop-in replacement for xargs -P and GNU parallel. On my 14-core/28-thread i9-7940x, forkrun achieves: * 200,000+ batch dispatches/sec (vs ~500 for GNU Parallel) * ~95–99% CPU utilization across all 28 logical cores, even when the workload is non-existant (bash no-ops / `:`)…
Mar 2026 · github.com · its alternatives →
10
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 →
11
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 →
12
A pure C89 implementation of Go channels, with blocking selects▲271
A pure C (-std=c89) implementation of Go channels, including blocking and non-blocking selects. - GitHub - rochus-keller/CspChan: A pure C (-std=c89) implementation of Go channels, including blocking and non-blocking selects.
2023 · github.com · its alternatives →
13
Compile C to Not Gates▲145
Hi! I've been working on the flipjump project, a programming language with 1 opcode: flip (invert) a bit, then jump (unconditionally). So a bit-flip followed by more bit-flips. It's effectively a bunch of NOT gates. This language, as poor as it sounds, is RICH. Today I completed my compiler from C to FlipJump. It takes C files, and compiles them into flipjump. I finished testing it all today, and it works! My key interest in this project is to stretch what we know of computing and to prove that anything can be done even with minimal power. I appreciate you reading my announcement, and be…
2025 · github.com · its alternatives →
14
BinaryRPC – Lightweight WebSocket-based RPC framework in modern C++▲78
Hi HN, I’m a recent CS graduate. During the past few months I wrote BinaryRPC, an open-source RPC framework in modern C++20 focused on low-latency, binary WebSocket messaging. Why I built it * Wanted first-class session support, pluggable QoS levels and a simple middleware chain (global, specific, multi handler) without extra JSON/XML parsing. * Easy developer experience A quick feature list * Binary WebSocket frames – minimal overhead * Built-in session layer (login / reconnect / heartbeat) * QoS1 / QoS2 with automatic ACK & retry * Plugin system – rooms, msgpack, etc.…
2025 · github.com · its alternatives →
15
SuperString – A fast and memory-optimized string library for C++▲52
A fast and memory-optimized string library for C++ - btwael/SuperString
2018 · github.com · its alternatives →
16
A tiny and platform-agnostic true random number generator for FPGA/ASIC▲27
It is based on phase noise, consumes less than 60 LUT4s/FFs and achieves up to 7.99 bits of entropy per byte. Feel free to comment if you have any questions, ideas or thoughts :)
2023 · github.com · its alternatives →
17
Rapidgzip – Truly Parallel Gzip Decompression with 10 GB/s▲35
I have posted a much earlier version of this over a year ago [0]. Since then a lot has changed. Obviously, the name has changed. This happened for the paper publication [1]. I have also optimized the speed, integrated ISA-L for special cases, limited the compression-ratio-dependent maximum memory consumption, and finally added parallelized CRC32 computation, which adds ~5% overhead no matter the number of cores used. At this point, I am leaning towards calling it production-ready although there are still many ideas for improvements. Redoing the benchmarks of the older Show HN, would look…
2023 · github.com · its alternatives →
18
StringZilla v3 with C++, Rust, and Swift bindings, and AVX-512 and NEON▲15
Hi HN! I've spent the last few weeks optimizing the string operations in StringZilla. You'd be surprised how much performance GLibc and the Standard Templates Library of C++ are leaving on the table, especially on Arm and, likely, on RISC-V. I've significantly increased the number of implemented algorithms for different workloads. Searching across English texts on Arm, for example: - is 4.4x faster than STL, - and 16.8x faster in reverse order. The new version of the library now includes a C++ binding largely compatible with the C++ Standard, featuring all 17 overloads of the `replace`…
2024 · github.com · its alternatives →
19
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 →
20
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 →
21
(bits) of a Libc, Optimized for Wasm▲78
I make a no-CGO Go SQLite driver, by compiling the amalgamation to Wasm, then loading the result with wazero (a CGO-free Wasm runtime). To compile SQLite, I use wasi-sdk, which uses wasi-libc, which is based on musl. It's been said that musl is slow(er than glibc), which is true, to a point. musl uses SWAR on a size_t to implement various functions in string.h. This is fine, except size_t is just 32-bit on Wasm. I found that implementing a few of those functions with Wasm SIMD128 can make them go around 4x faster. Other functions don't even use SWAR; redoing those can make them 16x faster.…
2025 · github.com · its alternatives →
22
A weekend replication of STOKE, a stochastic superoptimiser▲58
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
23
Outperforming VByte for Large Integers Using Phi-Encoding▲15
Properties of a Novel Binary Representation of Integers using Base-𝜙 - irradix/paper.md at main · DOSAYGO-STUDIO/irradix
2024 · github.com · its alternatives →
24
MCP-stama – An ultra-fast Rust MCP server with no dependencies▲73
An ultra-fast, single-binary MCP server written in Rust as a lightweight alternative to Node.js/Python. - StamManif/mcp-stama
Aug 2026 · github.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 →