C-D26-LABELED-ROOT

D26 labeled-root CRT campaign OPEN: instead of waiting to reconstruct all squared-speed coefficients past the 2H threshold (about B13 squared), maintain one correct GLOBAL labeling of the 13 speeds and CRT each V_i directly at a threshold based on B13, which is much lower. Labels, signs, permutation and scale are GLOBAL objects fixed ONCE at the tuple level, never re-canonicalized per prime or per denominator. D26 must prove the canonical labeled tuple, pin the exact direct-CRT threshold, build a label-preserving local oracle, use a prime-power factorized master, integrate the rational-time cuts, and measure the net state complexity exactly including the new variables; a full campaign runs only if the reachable state tree provably fits the caps

In plain language

The D26 route keeps one fixed global labeling of the 13 speeds and reconstructs each speed directly by CRT at a lower threshold, instead of reconstructing the symmetric coefficients at the high threshold. Labels, signs and scale are fixed once at the tuple level, not per prime.

Exact statement

D26 labeled-root CRT campaign OPEN: instead of waiting to reconstruct all squared-speed coefficients past the 2H threshold (about B13 squared), maintain one correct GLOBAL labeling of the 13 speeds and CRT each V_i directly at a threshold based on B13, which is much lower. Labels, signs, permutation and scale are GLOBAL objects fixed ONCE at the tuple level, never re-canonicalized per prime or per denominator. D26 must prove the canonical labeled tuple, pin the exact direct-CRT threshold, build a label-preserving local oracle, use a prime-power factorized master, integrate the rational-time cuts, and measure the net state complexity exactly including the new variables; a full campaign runs only if the reachable state tree provably fits the caps