https://pedulli.io/blog/ Byte-exact lossless compression, the best-of-N racing dispatcher, and the +1 byte no-expansion floor. Reproducible numbers, openly conceded losses. en Mon, 25 May 2026 00:00:00 GMT Thu, 18 Jun 2026 00:00:00 GMT Pedulli https://pedulli.io/blog/no_expansion.html https://pedulli.io/blog/no_expansion.html Measured on 1 MiB of random bytes: gzip adds about 341 B of framing, brotli about 5 B, xz about 424 B, 7-Zip about 658 B. Pedulli adds 1 byte - a guarantee about Pedulli's own output, never worse than input + 1 byte, and the design choice behind it. Mon, 25 May 2026 00:00:00 GMT https://pedulli.io/blog/methodology.html https://pedulli.io/blog/methodology.html Inside the router: routing by magic bytes, extension and an entropy probe; the parallel codec race that picks the smallest output (xz, zstd and brotli included as candidates); and the 1-byte container format that guarantees no expansion. Mon, 25 May 2026 00:00:00 GMT https://pedulli.io/blog/records.html https://pedulli.io/blog/records.html Entropy coding versus structure-aware compression. On data with discoverable structure the win can be large; on incompressible data Pedulli falls back to identity with a +1 byte floor. Every restore is byte-exact and reproducible on request. No past-Shannon framing. Mon, 25 May 2026 00:00:00 GMT