Explicit stations, buffer, and schedule

Choose the host deficit ${\mu }_{\mathrm{H}}={\mu }_0$. In its first developed right-angle sector set

This is a regular resting-collar point. Choose axial separation

and $n\ge 1$ equally spaced axial chain sites. Take a bounded convex spatial tube around this segment and normalized operating interval $[-1,3]$. Its closure is disjoint from the worldsheet. All initial data and controllers are installed before use.

Let $M$ be the surviving source register and $P$ an arbitrary $p$-qubit payload, both initially at $A$. They may be correlated with each other and with an untouched reference. Install $n$ blank $p$-qubit payload registers along the chain.

Use one three-qubit clock. Its codes $a=0,1,2$ select the declared five-command history with supplied token $m_a=-1,0,1$, respectively. Other codes select a complete rejected/no-op branch. A code is geometrically interpreted only when its stored token and branchwise source promise are compatible. No record is asserted to acquire that promise.

Destroy the three clock qubits in three positive slots of length $1/48$, during

The record is then available before all programme-controlled operations.

Run the five reversible command computations in the intervals

Each finite gate list fits by giving its elementary gates equal positive subintervals within its macro-slot. The finite permission assumption supplies those local gates; no gate-rate law is inferred.

The payload remains stored at $A$ through $\tau =9/4$. Thus it is buffered across the singular transverse incidence time $\tau =0$ and across the host marking $s=0$ at the regular collar station, where $F_0(x_{\ast })=2$. No operation touches the defect. The event-code computation describes the prescribed zero germ and finishes later; it is not an instantaneous geometric update.

Let

be the classical packet consisting of all six snapshots and the three-bit clock record. After $\tau =9/4$, use $n$ stages of duration $1/(4n)$. In each stage:

1. during its first half, copy the $K$ classical bits at the current station into a local blank outgoing buffer, using $K$ positive slots of duration $1/(8nK)$;

2. during its second half, carry that copied classical packet and exchange the adjacent payload contents over the axial segment of length $L/n$.

The communication speed is

in normalized developed units. The payload and all records arrive by $\tau =5/2$, then wait until output time $\tau =3$. All station copies of the classical history are retained.