Provides the pure mathematical foundation for all token-based proposals in the TNSC series. Formalizes token generation as a homomorphism from a computational domain into a token space. Proves six axioms: determinism, uniqueness, compositionality, semantic proximity preservation, redundancy elimination, and universal applicability. Includes four formal theorems, three counterexamples, and a deterministic C++ implementation.
Elizeu Almeida Prudente (Mon,) studied this question.