Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Compression level 1

Benchmark index · Median overview · ← Level -1 · Level 2 →

Recorded run: long-20261109 (2026-11-09). Raw results · Environment · Run analysis.

Median across all datasets

Each of the 8 datasets has equal weight, including empty and tiny input. Speed / C = C mean latency / implementation mean latency; output / C = implementation bytes / C bytes. We take the median of these 8 per-dataset ratios separately for speed and size. 1× matches C; higher speed and lower output are better. These are medians across datasets, not median sample latencies, and do not imply statistical significance.

ImplementationMedian speed / C ↑Median output / C ↓Datasets
zstd C1.000×1.000×8
mzstd1.380×1.000×8
Measurement setup and interpretation

zstd 1.5.7 (the C library built by zstd-ffi) and mzstd at the recorded working tree compress identical bytes at this level. Every frame was checked byte-identical to zstd’s and decoded back to its input before any timing.

These are cold native API measurements: construction, allocation, compression, and disposal. Complete known input; 50 samples, 3 s warmup, at least 6 s measurement. Host: AMD Ryzen 9 7950X, Linux KVM guest with two vCPUs: the encoder suite, then the decoder suite, each in one Criterion process pinned to vCPU 1; nothing else ran in the guest. Other tenants loaded the host: a fixed C decode varied by 8-43% (p10-p90 wall time) through the day, so sampling was lengthened to average over the noise. unset; Cargo release defaults (bench profile), runtime SIMD dispatch (AVX-512 level on this host; the decoder runs its block loops at the AVX2 level).

Chart whiskers and table intervals describe 95% confidence bounds on mean timing. They do not capture all host or allocator variation. Throughput bounds are transformed latency bounds. Output / input is compressed bytes divided by input bytes; smaller is better, and values above 100% mean expansion. For empty input, throughput and output / input are undefined (—). See the run analysis for measurement limitations.

Dataset details

Ordered by mzstd speed / C, highest first; all 8 datasets are shown. This order uses recorded mean latency, not statistical significance. Bars start at zero.

empty · tiny-text · repeated-1m · binary-64k · random-64k · text-1m · random-1m · alice29

empty

Empty input; measures API overhead. Input: 0 bytes.

mzstd speed / C: 11.256×; output: 9 / 9 bytes.

Exact measurements and confidence bounds
ImplementationMean, ns95% mean interval, nsMiB/sOutput bytesOutput / inputSpeed / C
zstd C2,2162,169–2,271—9—1.000×
mzstd196.9191.8–202.7—9—11.256×

tiny-text

44-byte quick-brown-fox sentence. Input: 44 bytes.

mzstd speed / C: 7.708×; output: 53 / 53 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C2.412.366–2.46517.4153120.455%1.000×
mzstd0.31270.2992–0.3274134.2053120.455%7.708×

repeated-1m

1 MiB of repeated a bytes. Input: 1,048,576 bytes.

mzstd speed / C: 2.871×; output: 51 / 51 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C83.379.45–87.7512,004.13510.005%1.000×
mzstd29.0228.67–29.4334,461.55510.005%2.871×

binary-64k

64 KiB of structured binary bytes: ((i / 16) XOR i) modulo 256. Input: 65,536 bytes.

mzstd speed / C: 1.501×; output: 2,537 / 2,537 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C10.7210.61–10.865,829.122,5373.871%1.000×
mzstd7.1436.886–7.4388,750.082,5373.871%1.501×

random-64k

64 KiB prefix of the deterministic pseudorandom corpus. Input: 65,536 bytes.

mzstd speed / C: 1.259×; output: 65,546 / 65,546 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C8.7848.64–8.9647,115.3765,546100.015%1.000×
mzstd6.9796.796–7.188,955.3765,546100.015%1.259×

text-1m

Alice text repeated cyclically to 1 MiB. Input: 1,048,576 bytes.

mzstd speed / C: 1.153×; output: 61,206 / 61,206 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C465.5456.7–474.62,148.3461,2065.837%1.000×
mzstd403.6390.3–417.62,477.6361,2065.837%1.153×

random-1m

1 MiB of deterministic xorshift64 pseudorandom bytes. Input: 1,048,576 bytes.

mzstd speed / C: 1.094×; output: 1,048,610 / 1,048,610 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C85.1784.34–86.0511,741.621,048,610100.003%1.000×
mzstd77.8677.01–78.8112,843.851,048,610100.003%1.094×

alice29

Alice in Wonderland text from the Canterbury corpus (testdata/alice29.txt). Input: 152,089 bytes.

mzstd speed / C: 0.993×; output: 59,657 / 59,657 bytes.

Exact measurements and confidence bounds
ImplementationMean, µs95% mean interval, µsMiB/sOutput bytesOutput / inputSpeed / C
zstd C366.9360.8–375.2395.3159,65739.225%1.000×
mzstd369.4360.6–380.4392.6259,65739.225%0.993×