Motivation

AIXC is based on a compact premise: if both sides can run the same predictor, the archive does not need to store every next unit. It can store enough seed material to initialize context, then a decision stream saying whether the predictor was correct. On misses, the encoder stores the actual residual unit so decoding remains exact.

That premise turns compression into an explicit contract between a file and a predictor. The hard part is not packing bits. The hard part is making sure any conforming decoder can reproduce the same prediction sequence, tokenizer behavior, and residual interpretation without guessing.

This is not magic compression and it is not a claim that a language model makes arbitrary files free. The predictor must either be cheap enough to include, already installed at the decoder, or shared across many related archives. If every file has to carry a large model beside it, the model bytes can overwhelm the archive savings.

• Primary goal: exact round-trip text compression using a deterministic predictor contract.
• Reference mode: seed units, packed hit/miss bits, and literal residuals.
• Practical format property: entropy-coded decision streams and compact residual representations.