Curated developer articles, tutorials, and guides � auto-updated hourly


The series closes by restating the codes-as-priors thesis across all twelve instances and connecting...


Solomonoff induction, MDL, speed priors, and neural networks are all special cases of one Bayesian f...


Any length vector satisfying Kraft has a prefix-free code. Here is the construction.


Codecs are not ad-hoc bit formats. They are constructions on the algebraic structure of types.


VByte trades bit-level precision for byte-alignment, and that trade wins in practice. Most productio...


Unary and Elias gamma are the two simplest universal codes. Unary encodes n in n bits; gamma in 2 lo...


Given a finite distribution, Huffman's algorithm builds the prefix-free code with minimum expected l...


Rice and Golomb codes are parametric: a single parameter k (or m) tunes the code to a specific geome...


Cryptographic theory assumes random oracles with infinite output. We have 256 bits. This paper explo...


Fibonacci coding uses Zeckendorf's representation to produce self-synchronizing codewords. Every cod...


What if containers wasted zero bits? A C++ library for packing arbitrary value types at the bit leve...


Elias delta and omega extend Elias gamma by recursively encoding the length prefix. Each step yields...


Prefix-freeness is the property that lifts the free-monoid construction into bit space.


Every prefix-free code is a hypothesis about the source. The codeword lengths determine an implicit ...


The problem of predicting what comes next, from compression to language models


Which codeword-length vectors are achievable by prefix-free codes? Kraft's inequality is the answer.


Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.


A bit vector with O(1) rank and O(log n) select using only n + o(n) bits of space. The auxiliary ind...


Arithmetic coding closes the gap between Huffman's per-symbol integer lengths and true entropy. A si...