Paperlane

no. 17 · Wednesday 18 November 2026

blaris: Windowless Random-Access LZSS for Constrained Microcontrollers

Ihor Lukianov

math.IT · via cs.AR · code · 4 pp

Abstract

Embedded LZ77 decompressors (such as heatshrink and tamp) require an in-RAM sliding window that couples memory usage to compression ratio and incurs high latency on random-access reads. We present blaris, a lightweight, windowless LZSS decompressor for execute-in-place (XIP) random access on constrained microcontrollers. By partitioning tokens into bidirectionally traversable streams with power-of-two checkpoints, blaris resolves back-references directly in the compressed payload, achieving compression ratios comparable to high-window heatshrink and tamp configurations without allocating a RAM window. Targeting compress-on-host, decompress-on-device workflows, blaris assumes trusted build-time payloads and omits runtime error and bounds checks. On RV32IMC, it requires just 548-784 B of Flash and 104-112 B of total RAM, achieving orders-of-magnitude faster small-slice random reads than ratio-matched, block-indexed heatshrink and tamp.

code
github.com/lis05/blaris
comments
4 pages, 1 figure, 2 tables. Source code and benchmark suite available at https://github.com/lis05/blaris
fields
Information Theory
pdf ↗ page arXiv:2611.22900 ↗