How file compression actually works today (and how I beat zlib by 2.86% with graph theory)

Name: How file compression actually works today (and how I beat zlib by 2.86% with graph theory)
Uploaded: 2026-09-22T00:00:00.000Z
Duration: 1 min 18 s
Description: In 78 seconds, narrated: DEFLATE's parse as a shortest path in a graph (44 bits from zlib's real output vs 36 bits from the brute-force-verified optimum in the example), the Huffman tree that iterates (-8.5% on a real file), and the real result across 29 files: -2.86% against zlib, verified byte for byte. Muted by default: turn sound on in the controls.

In 78 seconds, narrated: DEFLATE's parse as a shortest path in a graph (44 bits from zlib's real output vs 36 bits from the brute-force-verified optimum in the example), the Huffman tree that iterates (-8.5% on a real file), and the real result across 29 files: -2.86% against zlib, verified byte for byte. Muted by default: turn sound on in the controls.

Length: 1:18
Published: 21 September 2026

CompresiónRustCAlgoritmoszlib

This reel sums up How file compression actually works today (and how I beat zlib by 2.86% with graph theory), where the method, the tables and what did not work are.

Read the article Open in the viewer