Fractal Data Compression
Every piece of data has a shape. Fractal data compression makes that shape visible, and in doing so, makes the data smaller.
The system works by splitting a message into fixed-size chunks and scanning for repetition. Each unique chunk becomes an affine transform in an Iterated Function System (IFS), the mathematical engine behind fractal geometry. An IFS defines a fractal through a small set of geometric operations, rotations, scalings, and translations, that are applied recursively to generate infinitely detailed structure from a finite description. When the message's byte patterns are mapped to these transforms, the resulting fractal is not an arbitrary visualization. It is the data itself, rendered as geometry. Every curve, cluster, and tendril in the image corresponds to a specific byte pattern from the original message.
Compression emerges naturally from this process. When data contains repeated patterns, and most real-world data does, those patterns map to the same transform. The word "the" appearing fifty times in a document does not require fifty entries in the fractal's definition. It requires one transform, referenced fifty times by a compact index. The fractal's dictionary stores each unique pattern once, and a sequence of small indices records the order in which they appear. The dictionary plus the index sequence is the seed: a compact representation that is often significantly smaller than the original data, yet sufficient to reconstruct it exactly.
The visual result is telling. Highly compressible data, text with repeated phrases, images with uniform regions, produces regular, self-similar fractals with clear symmetry and recognizable structure. This is because fewer unique transforms mean the IFS reuses the same geometric operations at every scale, which is precisely what makes a fractal self-similar. Random or incompressible data, by contrast, produces chaotic, asymmetric shapes with no discernible pattern. You can literally see the compressibility of data in the geometry of its fractal. Regularity is redundancy. Symmetry is compression.
The encoding is lossless. The seed contains every byte of the original data, packed into the dictionary entries and their index sequence. Decoding is deterministic: unpack the dictionary, replay the index sequence, and the original message is recovered bit for bit. No information is lost, approximated, or discarded. The fractal is simply a different representation of the same data, one that happens to be visual, self-similar, and often smaller than the original.
This approach inverts the usual relationship between data and visualization. Typically, compression is invisible, a smaller file that looks the same when decompressed. Here, the compression is the visualization. The fractal does not illustrate the data; it is the data, and its structure directly encodes the redundancy that makes compression possible. The medium is the message, and the message is the fractal.