AIXC / docsProject documentation

Reference

Entropy-Coded Sections

Look up syntax, contracts, layouts, algorithms, and exact behavior.

Packed one-bit decisions are easy to inspect but not always economical. Decision streams are often biased and clustered; residual streams are often highly nonuniform. AIXC therefore treats section coding as an independent layer: after semantic streams are generated, each section can be encoded by a configured entropy backend.

C(X)≥H(X),H(X)=−∑xp(x)log⁡2p(x)C(X) \ge H(X),\quad H(X) = -\sum_x p(x)\log_2 p(x)
Section coding objective. A practical section coder attempts to approach the entropy of the symbols in that section.

Huffman coding is attractive in the reference implementation because it is deterministic, inspectable, and simple to decode. zstd-style section compression is useful for comparing predictor-specific savings against mature generic compression. The archive manifest records the selected coding mode so decoders do not infer it from bytes.

  • Decision bits can be packed raw or entropy-coded as a binary stream.
  • Residual units can be literal bytes, varint token IDs, rank codes, or compressed byte sections.
  • Metadata remains separately parseable so integrity and predictor checks run before decode.
  • The coding layer must be deterministic; adaptive decoders cannot depend on unstored model state.

Continue exploring

Tutorials →How-to guides →Explanation →Source repository →