Predict ⇄ compress
A good next-symbol predictor is a good compressor, and vice versa.
two faces
The mechanism
Arithmetic coding turns predictions directly into short codes.
the bridge
The benchmark
The Hutter Prize: compress Wikipedia as a test of intelligence.
the wager
The hypothesis
Maybe intelligence itself is deeply about compression.
the claim
01Two faces of one skill
If you can predict what comes next, you can encode it in few bits — and a good compressor must predict well to do its job.
link prediction quality = compression rate
so the two are mathematically interchangeable.
+1 it follows straight from pamphlet 6: bits of surprise per symbol is the compressed size.
02Arithmetic coding is the bridge
Feed a predictor's probabilities into arithmetic coding and you get near-optimal compression automatically.
mechanism probabilities → code lengths
so any predictor can be turned into a compressor directly.
+1 this is the concrete machine behind the slogan — Book 1's arithmetic coding, driven by a model.
03Back to Kolmogorov
Book 2's idea — the shortest program that generates the data — is the deepest form of this equivalence.
link compression ≈ finding the shortest description
so understanding data and shrinking it converge.
+1 Solomonoff built a theory of prediction on exactly this: predict by favoring the simplest explanation.
04LLMs are compressors
A language model trained to predict text is, by this logic, a powerful lossless compressor of text.
result "language modeling is compression"
so the model writing this is, in a precise sense, an entropy estimator.
+1 recent work showed large models can out-compress purpose-built tools — prediction skill cashing out as bits saved.
05The Hutter Prize
A standing contest to compress a fixed slice of Wikipedia as small as possible — framed as an intelligence test.
premise better compression = better understanding
so "compress this text" becomes a benchmark for AI.
+1 the bet is explicit: Marcus Hutter argues compressing well requires understanding the content.
06"Intelligence is compression"
Some researchers propose that finding compact patterns is the core of intelligence itself.
idea learning = building a shorter description of the world
so Shannon's bits reach all the way to a theory of mind.
+1 it's a beautiful, suggestive idea — and, importantly, a hypothesis, not a settled fact (see the footer).
07The series, in a knot
Bit → entropy → surprise → cross-entropy → compression → prediction — one thread, tied off here.
through-line every pamphlet meets in this one
so Shannon's 1948 idea reaches the heart of modern AI.
+1 the last pamphlet (8) closes the loop: the AI built on these ideas is named for the man who began them.
information theory · intelligence frontier · pamphlet 7 of 8 · prediction is compression — the knot that ties the series