A supplied schedule bounds influence

Let a finite site system have, at each tick $j$, a partition ${\mathcal{P}}_j$ and a product of block channels. For terminal region $Y$, define

An adjoint channel on a disjoint block preserves the identity. Backward induction therefore proves

If a supplied metric gives every block diameter at most $\Delta$, the triangle inequality gives

These statements require no initially unentangled state CheungEn05.

A supplied tick duration $\tau$ gives an envelope $c_{\mathrm{sched}}=\Delta /\tau$. The value is an input to the architecture, not a speed derived from entanglement. A payload-independent routed circuit can preserve complete instruments while retaining this independently declared schedule CheungEn06B.

Even with fixed block sizes, a larger payload can require more packets, more parallel wires, or longer serialization. “The schedule speed is unchanged” is not a theorem that total latency or throughput is independent of payload size.

Rescaling the supplied distances and tick durations leaves the channel diagram unchanged. Scheduler consistency consequently does not select a Lorentz metric or a proper travel time CheungEn08A.