Prime Blocks and Recursive Additive Ancestry

This version supersedes the earlier release and should be treated as the authoritative version of the paper. It develops the recursively defined canonical word E(n) over {1,2,3,5,7}, with prime-block replay E(p+r) = E(p)∥E(r), prime-word recursion, global scaffold-suffix factorization, and exact replay laws for ℓ and Δℓ. Relative to the previous release, this version is a foundational reconstruction: it makes the leaf-sum and injectivity structure explicit, corrects the block-extension formalism at prime-block boundaries, clarifies normalization and suffix reduction, and reorganizes the theory around exact structural theorems. A central new result is the exact trichotomy Δℓ(n) ∈ {−1, 0, 1}, together with a uniform recursive generation law for the sign strata M₊, M₀, M₋. And here is a concise changelog block in the same Unicode style: What is new in this version makes leaf-sum conservation explicit and derives injectivity of the canonical word map corrects the admissible block-extension formalism at prime-block boundaries clarifies the role of normalization, suffix reduction, and scaffold-suffix factorization reorganizes the complexity theory around exact replay laws for ℓ(n) and Δℓ(n) promotes the exact trichotomy Δℓ(n) ∈ {−1,0,1} and the recursive description of M₊, M₀, M₋ to headline results