Frozen before new translated-interval arithmetic experiments.
Extend yesterday's dyadic JOINT proof to positive odd intervals at any
index offsetb>=0. Uniform residue permutations survive translation;
absolute source exceptions remain disjoint. Conditional laws require
nonempty actual selection. Sufficient conditionN>=2^(4n) comes from
the repeated canonical type(3,1), exponentword(1,1,2)^n.

Implement an independent modulo-precision stopped decoder, reading
individual odd valuation steps and retaining terminal reserve/charges.
Compare it with the accepted prior decoder on all odd residues at
H8,10,12,14 and n1,2,3, with inherited proof attribution. Check literal
positive trajectories and rational pin valuations separately.

Construct the finite joint coupling explicitly using referenceH14
residues. Per translated dyadic block every reference residue must
occur once across the source/lift pairs. Any mismatch must lie in its
exact unknown set or an actual first-crossing exception. Test fixed
N17,31,64,127,511; b0,1,10^6,10^30+17; n1,2. Bound total<=5million
pair traversals and180CPU-seconds. Include tiny blocks and the empty
selected interval{3}, not just convenient nonempty cases.

No unconditioned/individual trajectory conclusion. The purpose is to
validate the new translated joint interface before a separate coherent
paper, as current publication rules reserve substantive new results
for new papers. Do not duplicate the accepted stationary-law paper.
