We describe a simple, but powerful local encoding technique, implying two surprising results: 1. We show how to represent a vector of n values from Σ using dn log2 Σe bits, such that reading or writing any entry takes O(1) time. This demonstrates, for instance, an “equivalence” between decimal and binary computers, and has been a central toy problem in the field of succinct data structures. Pre...