A nonempty target-adapted regular protocol

Choose two stations $A,B$ on an axial segment of developed spatial length $L>0$, with $L<R/4$, inside the regular laboratory. Place $n+1$ stations along that segment. Choose $H>T_0+3L+4$, enlarging the temporal support presentation before the experiment if needed.

Install a $p$-qubit payload at $A$, blank equal-sized payload registers at the other $n$ stations, the catalogue register, the single clock, and all table/programme data. The payload may be entangled with an untouched reference.

Read the clock after $t=T_0+1$ and complete the local finite table instrument by $t=T_0+2$. Every elementary operation is assigned a positive subinterval. Let $k=m+g+1+s$ be the bit length of the complete record, where $s$ is the report-word length.

Starting at $T_0+2$, use $n$ stages of duration $3L/n$:

1. in the first $L/n$, copy the already classical $k$-bit record into a fresh outgoing buffer, using $k$ local positive subintervals;

2. in the remaining $2L/n$, carry that buffer forward and exchange the two adjacent payload contents along opposite regular paths.

The carriage speed is $1/2$ in developed units. All old classical copies are retained. A separated exchange is implemented by carriage, not by an instantaneous spatially nonlocal SWAP.