Complete schedule locality

Use a finite reserved site set in the developing patch. At each tick, a partition ${\mathcal{P}}_s$ specifies complete block channels. Include classical flags, records, and auxiliary names in the dependency network.

Every block dependency between times $T_s,T_{s+1}$ must satisfy

or have an explicitly supplied causal endpoint route. Adaptive instruction trees may be unrolled into such a finite network using declared local classical flags and identity maps on inactive branches.

For a terminal register set $Y$, define the backward sets