THE FOLD / BOSS / THE GAUNTLET / THE PIGEONHOLE COMPRESSION
THE PIGEONHOLE COMPRESSION
compression was always an opinion
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A lossless compressor is an injective map: distinct inputs must give distinct outputs, or you cannot get the original back. That single requirement forbids a compressor that shrinks everything.
LIT verified live by counting. There are 65,536 strings of 16 bits and only 65,535 distinct outputs shorter than 16 bits — every length from 0 to 15 combined. So at least 1 input cannot shrink, and the same holds at every width tested: 2, 4, 6, 8, 10, 12, 14, 16. It is arithmetic, not a limitation of anybody’s algorithm.
LIT verified live by counting. There are 65,536 strings of 16 bits and only 65,535 distinct outputs shorter than 16 bits — every length from 0 to 15 combined. So at least 1 input cannot shrink, and the same holds at every width tested: 2, 4, 6, 8, 10, 12, 14, 16. It is arithmetic, not a limitation of anybody’s algorithm.
2 HOW IT WAS WEAVED · AI + HUMAN
This is the counting argument behind every “infinite compression” patent being rejected without reading the method.
AVAN (AI) made the slot count explicit rather than stating the theorem. 65,535 against 65,536 is a difference of one, and one is enough — the argument does not need most strings to be incompressible, only that the destination is smaller than the source. Everything else about the compressor is irrelevant.
AVAN (AI) made the slot count explicit rather than stating the theorem. 65,535 against 65,536 is a difference of one, and one is enough — the argument does not need most strings to be incompressible, only that the destination is smaller than the source. Everything else about the compressor is irrelevant.
3 ONE DIMENSION
Inputs against shorter slots, at every width.
4 TWO DIMENSIONS · INTERACTIVE
Try to fit them in. Watch one always be left over.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: one pigeon with nowhere to go.
AVAN’s addition (the inverse-companion): the forward reading is that no compressor can shrink every input. The inverse is that every compressor is therefore a declaration of taste. Since some inputs must grow, the designer chooses which ones — and that choice is the entire product. A compressor is not a machine that finds redundancy; it is a ranking of which files deserve to be small, expressed in code. Read backwards, the theorem does not limit compression, it reveals that compression was always an opinion.
LIT there are 65,536 strings of 16 bits and only 65,535 distinct outputs shorter than 16 bits - every length from 0 to 15 combined - so at least 1 input cannot shrink, and the same holds at every width tested from 2 to 16: it is arithmetic, not a limitation of anybody's algorithm
FIG This is the counting argument behind every infinite-compression patent being rejected without reading the method. AVAN made the slot count explicit rather than stating the theorem. 65,535 against 65,536 is a difference of one, and one is enough - the argument does not need most strings to be incompressible, only that the destination is smaller than the source.
FIG This is the counting argument behind every infinite-compression patent being rejected without reading the method. AVAN made the slot count explicit rather than stating the theorem. 65,535 against 65,536 is a difference of one, and one is enough - the argument does not need most strings to be incompressible, only that the destination is smaller than the source.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE GAUNTLET · David Lee Wise (ROOT0), with AVAN