Manuscript X-K-ST@1 · X-K-ST.tex · theorem · 93c39c0f
Theorem: Complete regular route
Regular transport and record readiness · lines 638–672 · proof included or linked
X-K-ST@1#thm:route, X-K-ST@1#eq:route, X-K-ST@1#eq:arrival
For every input , after hop the complete route state is
The logical payload channel is the identity, including all reference correlations. All non-output route registers are fixed independent blanks.
With departure at , arrival is
For , the cross-port paths are null. For , they are timelike.
Proof. A SWAP moves the entire current payload, including its reference correlations, into the next independent blank and leaves the old factor blank. Induction proves (eq:route). Each spatial displacement has length and duration , so its developed slope is at most one. The supplied calibration (eq:signature) converts the duration into host units, giving (eq:arrival).
Displayed formulas in this passage
X-K-ST@1#eq:route · line 642
X-K-ST@1#eq:arrival · line 652