Proposition: A physically causal buffered execution exists

The clock, reversible metadata circuit, storage, table probe, record forwarding, and target-adapted route admit one complete finite causal schedule in the regular tube. Its decoded geometric zero-germ update remains the exact update of Theorem thm:reversible.

Proof. All local gate input and output ports are on the same static worldline and separated by positive time. The source table, exact guard word, and history reserves are preinstalled. Choose the departure time after the finite local gate list. The route uses the causal hops already proved. The decoder depends on the exact stored geometric parameter, not on the later physical execution time.