Life & fun · alternatives · 2026
24 alternatives to FastLanes based integer compression in Zig
integer compression library for Zig based on FastLanes - steelcake/zint
FastLanes is an integer compression library written in Zig that implements the FastLanes compression algorithm. It is designed for developers who need to compress integer data efficiently in their applications. The… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
I believe the best way to learn a language is by doing an in-depth project. This is my first Zig project intended for learning the ropes on publishing a Zig package. It turns out to be quite solid and performant. It might be a bit over-engineered. This little library is packed with the following features: - Building dependency graph from dependency data. - Performing topological sort on the dependency graph. - Generating dependence-free subsets for parallel processing. - Cycle detection and cycle reporting.
2025 · github.com · its alternatives →
- 2
Zig library for HyperLogLog estimation. Contribute to axiomhq/zig-hyperloglog development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 3
Minimalist, dependency-free virtual machine sandbox for microcontrollers and other resource-constrained devices. Single C file, no dynamic memory allocations, asynchronous design, pure C99 - ringtailsoftware/uvm32
Dec 2025 · github.com · its alternatives →
- 4
A very fast scalar implementation for Frame Of Reference integer compression. - cruppstahl/libfor
2015 · github.com · its alternatives →
- 5
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 6
Cool trick to store 4 5-bit values in one 16-bit value. - jaamesd/BucketCompressionTrick
2018 · github.com · its alternatives →
- 7
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · its alternatives →
- 8
Geometry library for C - Fast point-in-polygon. Contribute to tidwall/tg development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 9
Faster LZMA decoder for x86 CPUs (patch for XZ Utils). - faster_lzma_decoder_x86.patch
2021 · gist.github.com · its alternatives →
- 10
Properties of a Novel Binary Representation of Integers using Base-𝜙 - irradix/paper.md at main · DOSAYGO-STUDIO/irradix
2024 · github.com · its alternatives →
- 11
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
- 12
Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier. However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field. Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized. Over the last months, we have been experimenting with writing formal specifications instead and letting LLMs produce the circuits: as long as…
Jul 2026 · zk.golf · its alternatives →
- 13
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 14ZD
Hi everyone, I've made an open-source library for using design by contract (DbC) principles in the Zig programming language. It's called Zig-DbC, and it currently provides the following features: - A simple API to define preconditions, postconditions, and invariants. - Contracts are active in `Debug`, `ReleaseSafe`, and `ReleaseSmall` modes to catch bugs early. - All checks are removed at compile time in `ReleaseFast` mode for zero performance cost. - An optional mode to handle partial state changes in functions that return errors. - Transparent error handling that propagates errors from…
2025 · its alternatives →
- 15
The core question: how did HP's scientific calculators actually work at the gate level? That rabbit hole led to building one from scratch. The architectural decision everything else follows from: a decimal calculator should store numbers as BCD — one decimal digit per 4-bit nibble. A standard byte-oriented CPU (Z80, 6502) fights that layout constantly. So I designed a small custom CPU in Verilog where 4 bits is the natural data width and memory is nibble addressable. What the project covers: - Custom CPU: Harvard architecture, 12-bit ISA, 8-state execution FSM, hardware stack guard with a…
May 2026 · github.com · its alternatives →
- 16OA
I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches. The library is available on GitHub: https://github.com/CogitatorTech/ordered
Oct 2025 · its alternatives →
- 17
Hey HN, this is a small project myself and closer friends have been building on our free time (https://github.com/Dr-Nekoma/lyceum), it finally reached 0.1.0, we are open to feedback! The original idea was to experiment with Zig + Raylib, eventually we wrote a small server in Erlang as well. We started by first interacting with Erlang via its C bindings, but this eventually led to some of us to prototyping our own tooling to better integrate Zig types with Erlang, we called such tool "zerl" as its avaliable here…
2024 · github.com · its alternatives →
- 18
Fastest Integer Compression. Contribute to powturbo/TurboPFor-Integer-Compression development by creating an account on GitHub.
2015 · github.com · its alternatives →
- 19OA
I built an experiment that uses an overfitted transformer and arithmetic coding to compress individual files. Instead of training the model to generalize, I train a 900KB transformer to memorize a single file and predict the next byte. Those predictions are fed into an arithmetic coder to produce the compressed output. On a 100MB NYC taxi CSV, it compresses to about 7MB (~0.5 bits/byte). On a 100MB slice of enwik9, it compresses to about 21MB (~1.68 bits/byte). It's pretty slow right now (roughly 20–30 minutes of training and 45 minutes each for compression and decompression on my…
Jun 2026 · its alternatives →
- 20
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 →
- 21
Hello HN, author here. I built ZXC, a lossless compression library designed specifically for "Write Once, Read Many" scenarios (Game assets, Firmware, App bundles). The Concept: Standard real-time codecs (LZ4, Snappy) are designed for symmetry. ZXC explores an asymmetric approach: it spends significantly more CPU cycles at compression time to generate a bitstream specifically structured for modern, wide-issue execution pipelines (maximizing Instruction Level Parallelism). Performance (Verified via lzbench integration): ZXC was merged into the official lzbench repository monday. ARM64 (Apple…
Dec 2025 · github.com · its alternatives →
- 22
A collection of high-performance data structures for Zig.
Dec 2025 · github.com · its alternatives →
- 23
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 →
- 24IP
2017 · strandmark.net · its alternatives →
Also compare
- Zig Topological Sort Library for Parallel Processing alternatives
- HyperLogLog in Zig alternatives
- Tiny VM sandbox in C with apps in Rust, C and Zig alternatives
- Fast integer compression library in C alternatives
- HyperZig – A Hypergraph Implementation in Zig alternatives
- How to store a set of four 5-bit values in one 16-bit value alternatives
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 →