Developer releases LZ0, an LZ compressor with a zero-allocation decoder
A developer published LZ0, an experimental lossless compression format and C implementation that shifts computational complexity to the encoder so the decoder can stay extremely small. The decoder requires no dynamic memory allocation, runs with minimal state using only stack registers and an optional bitreader struct, and is aimed at small-to-medium binary blobs from a few hundred kilobytes to several megabytes.
GoKawiil's interpretation of the reporting above, not reported fact.
By deliberately trading heavier encoding work for a tiny, auditable decoder, LZ0 could appeal to constrained environments like bootloaders, microcontrollers, retro computing, or kernel space where memory and code size are tightly limited. Its asymmetric design highlights a broader tension in compression engineering between ratio, speed, and implementation footprint, though its real-world adoption will depend on how it performs against established formats in practice.
- LZ0 moves compression complexity to the encoder, keeping the decoder minimal and allocation-free.
- Decoder uses only stack registers and an optional bitreader struct, avoiding complex entropy coding.
- Targeted at small-to-medium binary blobs, suited for embedded or resource-constrained systems.
Source: github.com, 2026-11-19
Published there as: “Show HN: LZ0 -An asymmetric LZ compressor with ultra minimal, 0-alloc decoder”
Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.