It is 1977, and a maddening gap sits between theory and practice: the entropy bound tells you how few bits a source needs only if you already know its statistics — and in the real world of arbitrary files, you never do. Build a compressor that needs no model handed to it, that learns the structure of the data as it reads, and provably approaches the true entropy rate for any stationary source without being told what that source is. The method must be one pass, adaptive, and simple enough for modest hardware. Get it wrong and compression stays a bespoke craft, a different scheme for text and images and code — instead, this universal idea becomes the engine inside nearly every general-purpose compressor the world uses.
Chose Markov's inequality — bound a tail probability from the mean alone — wrong. The Markov chain — model dependence as memory of only the present state was the one that fit.
Markov's early twentieth-century formalization of dependent, memory-limited random sequences gave the field its foundational model of a 'stationary source,' the exact object this problem's universal compressor must handle without being told its statistics in advance. His chains are the canonical mathematical description of the kind of structured but unknown source this problem addresses, making his framework directly load-bearing for stating the problem precisely. But Markov worked purely within classical probability theory, with no notion of adaptive estimation, dictionary-based compression, or entropy-rate convergence guarantees, concepts that emerged more than half a century later through Shannon and then Lempel and Ziv, leaving a foundational but indirect connection. His mathematics remains foundational vocabulary for this problem rather than a direct engagement with its adaptive-coding proof.
The professor attempts to explain why a compressor with no prior knowledge of the source can still, provably, approach the entropy rate, and gets tangled trying to distinguish LZ77 from LZ78 on the whiteboard while a student politely points out he has swapped which one uses a sliding window. Jacob Ziv, four seats away in this thought experiment, is not impressed. John's own filing system for lecture notes has achieved zero compression of any kind across fifteen years and several thousand redundant PDFs, which he insists is 'a deliberate lossless archival strategy.' It is not. It is entropy, uncompressed and unbounded, spread across a desktop that no algorithm, universal or otherwise, could ever meaningfully organize.
Battle #36 · 8/9/2026, 7:04:08 PM · this result is deterministic: the same two personas on this problem always resolve the same way.