Original labels and exact unbounded domain
Abstract
Original exponent hypotheses discharge the construction
For every natural tuple 2<=a<b<=d<c with a+2<=d and c<=b+d-2, the dyadic identities prove m=2^(c-d), 2<=m<=y/4 and w=2^(b-a-1). Exact nonnegative integer division gives the natural h used by the physical decoder and proves h<2^(d-1).
The original base and enlarged base vectors are identified with A,B,L,K and 2A,SU,SV,SW. All four old and all four new windows are discharged, including both possible fresh-ear branches and the final zero endpoint. This yields the physical certificate, the exact original permutation, both strip predicates and the strict cut bound.
These private helpers are consumed by the public endpoint. The new construction is the physical high-V allocation and unbounded arithmetic, rather than a renamed application of an existing existence theorem. The current source library supplies the source formulas, packet interpretation, dyadic power identities and zero-period transport.