Target-adapted finite route

Fix a straight developed spatial segment of length $\ell >0$ in a regular convex tube. All processing and transport events below are chosen inside the retained regular laboratory.

After clock extraction and local lookup, allow a positive buffer before departure at developed time $t_{\mathrm{d}}$. Install $n+1$ stations

with payload registers $A_j\cong {\mathbb{C}}^{2^p}$, $p\ge 1$. Put

Initialize $A_1,\dots ,A_n$ in a fixed blank $\omega$, independently of $A_0$ and all references. At tick $j$, exchange $A_{j-1}$ and $A_j$.

This route adopts an explicit ideal permission: a finite two-register SWAP is available on the declared tick-boundary ports when their dependencies have these regular causal paths. Each cross-port dependency is null, and every same-station dependency is timelike. The permission is an operational input, not a derived continuous-time Hamiltonian implementation.

The finite classical report is forwarded on separately declared causal classical wires. Copying applies only to its diagonal classical algebra.