Formal analysis of invariant properties of the ASR token lookup pipeline. Proves four core theorems: token idempotence under cache hit, compression ratio monotonicity, coherence function boundedness, and lookup cost stability. Includes adversarial counterexamples and a deterministic C++ reference implementation with full test suite.
Elizeu Almeida Prudente (Mon,) studied this question.