Over the preceding chapters we built a rigorous, quantitative universe from a strict 184-bit budget. We watched empty space self-assemble from a zero-entropy initial state. We proved that matter ties knots in the information fabric, and that gravity is the geometric reading of those knots. The large-scale structure of spacetime — its expansion history, its black hole entropy, its cosmological constant — all followed from a single counting principle without a single hardcoded physical law.
One feature of the observed universe remains unexplained. The microcosm waves. Particles exist in superposition, interfere like ripples on water, and snap into discrete outcomes upon measurement. The wavefunction is complex-valued. Dynamics are unitary. Why?
Standard quantum mechanics answers: this is how things are. Accept the axioms and calculate. This chapter offers a different answer. The quantum world waves because we are observing compressed information from the inside.
Consider an ordinary MPEG-compressed digital movie. An outside software engineer sees raw binary data, encoded by a Discrete Cosine Transform that converts blocks of spatial pixels into a compact set of frequency coefficients. No individual pixel is stored directly. What is stored is the spectral decomposition of the scene — the amplitudes, frequencies, and phases of the wave modes that, combined, reproduce the original image.
Now imagine that an intelligent observer exists inside that movie. This observer is made of compressed pixels. Their brain processes the compressed data stream. They build a microscopic laboratory and study their world.
What do they find? Not hard, discrete blocks. They find that their constituent elements follow mysterious, deterministic, wave-like patterns. A single pixel, when tracked, appears to smear across a superposition of positions. When two regions of the movie overlap, they produce interference fringes. The pixel-physicist writes down equations governing these wave dynamics and concludes they are the fundamental laws of nature.
To us on the outside, the explanation is immediate: the compression codec is the physics. The wave equations are the mathematical signature of the DCT basis perceived from within a compressed representation.
The hypothesis of this chapter is that quantum mechanics stands in exactly this relationship to the universe’s information structure. The wavefunction distributes probability amplitudes across basis states in Hilbert space exactly as a spatial Fourier transform distributes image data across frequency coefficients. The microcosm waves because we are pixel-physicists, and the universe is an MPEG.
The Born rule — the identification of measurement probabilities with squared wavefunction amplitudes, P = |α|2 — has resisted derivation from more primitive principles for a century. Under the compression hypothesis, it has a natural interpretation.
Consider a rendering engine producing a sphere with intended shading intensity 0.85, on hardware that can only output values of 0.8 or 0.9. The engine uses dithering: scattering 0.8 and 0.9 outputs across adjacent pixels in proportions 0.15 and 0.85, so that the perceived average matches the target. The discrete output statistics are determined by the continuous target value.
A quantum superposition
is the universe’s implementation of this same principle. The complex-valued amplitudes α, β are the compressed description. The discrete measurement outcomes are the hardware outputs. The Born rule P = |α|2 is the probability rule of an optimally compressed continuous description rendered through a discrete measurement apparatus. The squaring arises because amplitudes are complex-valued: the information-theoretic weight of a spectral mode is proportional to the power in that mode, which is the squared amplitude.
This is not a derivation of the Born rule from scratch. It is a motivation: the Born rule is precisely what optimal compression looks like when a continuous description meets a discrete measurement. A rigorous derivation from the spectral complexity axioms is an open problem stated at the end of this chapter.
The compression picture resolves a question that the standard framework leaves open: why are fermions and bosons so fundamentally different?
Fermions are pixels. They are the actual physical outputs — the discrete configurations sampled from the wavefunction through the Born rule. Because two distinct pixels cannot occupy the same screen coordinate without overwriting each other, fermions naturally obey the Pauli exclusion principle. Exclusion is not an imposed rule. It is what it means to be a localised, discrete sample from a compressed description.
Bosons, by contrast, are not fundamental objects at all. They are the compression residuals promoted to the status of particles. An observer who sees only the decoded pixel frames — the fermion configurations — and has no knowledge of the underlying codec notices that the pixels move in correlated ways that seem to require explanation. They invent a story: particles are exchanging virtual messenger particles. These messenger particles are bosons.
But no detector ever registers a boson as a localised pixel. Detectors register fermion events — track ionisations, photoelectric hits, Cherenkov rings. What Standard Model language calls a photon or a gluon is the name we give to a correlation between fermion events. The codec already contains that correlation in its off-diagonal structure. No separate boson particle is required. The causal chain is:
The boson is the codec’s internal record of a fermion transition, made into a noun by an observer who cannot see the codec. This is not a new claim — it echoes the S-matrix programme and the modern amplitudes approach — but the compression picture makes it precise.
To render the compression hypothesis quantitative, we require a metric that assigns an informational cost to physical states. While Kolmogorov complexity provides the necessary theoretical foundation, it is inherently uncomputable and non-continuous.
This limitation becomes clearer when evaluating Kolmogorov complexity in the context of complex-valued sinusoidal functions. Crucially, the cosine function represents the simplest continuous periodic function. Furthermore, because it only needs to be implemented once—functioning effectively as a per-class resource—the intrinsic algorithmic complexity of any real-world wavefunction is vanishingly small. The true informational overhead resides not in the foundational function, but in the specific modes themselves.
To address this, we replace Kolmogorov complexity with a continuous, computable alternative.
Spectral Complexity. The spectral complexity Cs(Ψ) of a state Ψ is the total bit cost required to specify the amplitudes, frequencies, and phases of its spectral modes:
where Cbase is the fixed overhead of the trigonometric basis, C(ϕi) and C(Ai) are the encoding costs of phase and amplitude, and ωi∕Δω is the dominant term: the linear resource cost of tracking frequency ωi at resolution Δω.
Three properties of Cs are essential.
Computability. Unlike Kolmogorov complexity, Cs is directly computable from the spectral decomposition of any state.
Continuity. Small perturbations in frequency or amplitude produce small changes in Cs. The cost landscape is smooth.
Linear frequency scaling. The dominant cost ωi∕Δω scales linearly with frequency. This mirrors the physical relation E = ℏω. Under Solomonoff suppression P ∝ 2−Cs, this linear cost produces exponential suppression of high-frequency modes:
This is a Boltzmann distribution. The identification ℏ = Δω∕ln2 connects the minimum frequency resolution of the 184-bit universe to Planck’s constant. Whether this identification can be made quantitatively exact is an open problem.
Under Cs-weighted Solomonoff induction, the probability of a configuration is exponentially suppressed by its spectral cost. Chaotic, disordered configurations — random fluctuations, Boltzmann brains, disembodied observers fluctuating into existence from thermal noise — have high spectral complexity. They require many high-frequency modes with large amplitudes to describe. Their probability under Cs is therefore exponentially small relative to smooth, compressible, law-like configurations.
The Boltzmann brain problem asks: why do we find ourselves in an ordered universe rather than as isolated brains in a sea of chaos, when chaos is statistically more probable? Under Cs-weighted sampling, the answer is that chaos is too expensive. Chaotic configurations require exponentially more bits to describe than smooth ones. The universe does not render them because it cannot afford to.
This resolves the problem without fine-tuning and without modifying cosmology. Structured observers in law-governed universes dominate the Cs measure not because they were selected by some anthropic argument but because they compress better.
When we apply Cs-weighted sampling to the bitstring evolution of Chapter 3 — replacing uniform sampling with spectral-complexity-weighted sampling — two specifically quantum-mechanical phenomena emerge from the simulations without any imposed equations of motion.
Inertia. A localised wave packet moving through the grid maintains its velocity without external forcing. The minimum-Cs continuation of a moving packet is the packet continuing to move: any deflection introduces new frequency components, increasing the spectral cost. Resistance to deflection — inertia — is the geometric consequence of data economy. An object in motion is cheaper to keep in motion than to redirect.
Interference. When two wave packets overlap, the minimum-Cs description of the combined state is not two independent descriptions added together. It is a single spectral decomposition of the superposition, with shared modes between the two packets. The cross-terms — interference fringes — are cheaper to encode than two fully separate descriptions. Interference emerges as the compression-optimal treatment of overlapping structures.
Neither of these results was imposed. Both are consequences of one principle: the universe prefers descriptions with low spectral complexity, and the most compressible descriptions of physical configurations are wave-like ones.
This leads to the central conjecture of the chapter.
In classical and quantum physics, particles find their trajectories by minimising the Euclidean action SEuclidean. This variational principle underlies both classical mechanics and the path-integral formulation of quantum field theory. Where does it come from?
Conjecture (Informational Action Principle). Cs ∝ SEuclidean, with proportionality constant determined by n and Δω.
If this conjecture holds — analytically or to arbitrary numerical precision — then the action principle of physics is not a postulate. It is Solomonoff induction operating over compressed geometric descriptions. Particles follow minimum-action trajectories because minimum-action trajectories have minimum spectral complexity, and the universe exponentially suppresses everything else.
The conjecture would also complete two open identifications from earlier chapters. Planck’s constant ℏ would be the minimum spectral resolution Δω∕ln2 of a 184-bit universe. Newton’s constant G would be expressible as a function of n alone, completing the derivation that Chapter 4 left at the factor 4π.
Neither identification is proved here. Both are stated as open problems.
Three results and one conjecture follow from the compression hypothesis.
First, the Wavefunction Compression Principle provides a coherent hypothesis for why the microcosm waves: internal observers composed of compressed structures perceive their world as wave-governed because the compression codec is the physics. The MPEG analogy makes this precise.
Second, spectral complexity — continuous, computable, with linear frequency cost — exponentially suppresses chaotic configurations under Solomonoff-like induction. Structured, law-like, compressible configurations dominate the measure. The Boltzmann brain problem is resolved as a direct consequence.
Third, numerical simulation demonstrates that inertia and interference emerge from spectral compression alone, without imposed equations of motion.
The conjecture — Cs ∝ SEuclidean — would, if proved, identify quantum gravity with Solomonoff induction over compressed geometric descriptions, derive ℏ from n, and close the bridge between the informational framework and a full theory of quantum mechanics and gravity. That proof is the primary open problem of the series.
The next chapter applies the compression picture to the detailed structure of fermions and asks what the codec geometry implies about the particle spectrum.
![N∑ [ ω ]
Cs(Ψ ) = Cbase + C (ϕi) + C(Ai) + --i- ,
i=1 Δ ω](book26x.svg)