Trace one complete file
AAAAAAA → literal A, match(distance1,length6), EOF.
Symbols: literal/length 65,259,272; distance 0 between length and EOF.
1 / 5
AAAAAAA → literal A, match(distance1,length6), EOF.
Symbols: literal/length 65,259,272; distance 0 between length and EOF.
A=001000001 length6=100000011 distance1=0000000 EOF=100010000
34 payload bits → 20 c0 c0 44 00.
Fixed header: 44 4c 01 00, four bytes.
Total fixed file: nine bytes.
Dynamic payload uses six bits, but its 405-byte header makes 406 total bytes. A shorter payload can be a much larger file.
Three one-bit words exceed binary prefix capacity.
A 33-bit word exceeds uint32 storage.
Require EOF, validate both alphabets, and reject backward distance beyond existing output. Incomplete prefix trees remain valid.
Length18 maps to 271; distance128 maps to 127.
An initial match is invalid because no output exists yet.
DL uses a custom header and MSB-first packing; it is not RFC 1951 DEFLATE. EOF ends this block; no checksum authenticates it.