Don't decompress 50 GB to read 16 KB. Any tile decodes in 0.27 ms — from the start, middle, or end of the archive. One file, both CPU and GPU. Back-references are absolute output positions, so every block stands alone.
| Property | lz4 | zstd | Oodle | GDeflate | nvCOMP+DE | DietGPU | DFloat11 | ACEAPEX |
|---|---|---|---|---|---|---|---|---|
| O(1) seek into compressed | — | frame | — | — | chunk | — | — | ✓ |
| One format, CPU + GPU decode | CPU | CPU | — | ✓ | GPU | GPU | GPU | ✓ |
| Bounded tail (depth M ≤ L) | — | — | — | — | — | — | — | ✓ |
| Position-invariant access | — | — | — | — | — | — | seq | ✓ |
| Open source | ✓ | ✓ | — | ✓ | — | ✓ | ✓ | ✓ |
| Peak decode throughput | fast | fast | fast | ~600 GB/s | ~600 GB/s | 592 GB/s | — | 200 GB/s |
| Compression ratio | low | high | high | mid | mid | 1.3× | 1.4× | 4.0×* |
Read the top rows, not the bottom. On peak throughput and ratio the checkmarks belong to others — specialized decoders and fixed-function hardware are faster in isolation. The point is the shape of the ACEAPEX column: it is the only one filled across seek + one-format + bounded-tail + position-invariance at once. That combination — random access into GPU-resident compressed data without decompressing the whole file — is the class. *ratio is data-dependent; 4.0× on genome, competitive on text, lower on vectors — see Research.
chr1:5000000-5016000 out of a 254 MB archive — a genomic coordinate, not a byte offset. Against bgzip with a fai index, the standard for compressed references: 1.73× faster on median, 2.03× at p99, and 11.8% denser. Verified against samtools faidx.A comparison built only from wins invites the reviewer to fill the gaps in public. These are ours to name.