Proposition: Target-adapted reference-preserving transport

Let a developed segment of length $L_0>0$ remain in a convex regular chart. Install $m+1$ equal finite payload registers along it and initialize all but the source in a fixed blank. Successive content exchanges over intervals $L_0/(mc)$ implement the logical identity at the null-related target, including every reference, using $m$ exchanges.

An already available classical record and finite location/history payload may be included in the transported packet. Nontrivial preparation, copying, or decoding time is additional.

Proof. At each hop the complete source factor replaces the next blank, and the previous site becomes blank. Induction proves the complete identity. Each communication path is the regular straight segment traversed at speed $c$. The same argument applies to a joint quantum–classical packet.