What must be added to the event-code theorem

Fix any one finite forward-domain event circuit $U_{\mathrm{code}}$ from VII-F. Its input, history, work, and code registers are finite; work is returned to zero on the forward domain, and history is retained CheungVIIF (thm:implementation).

Two additional choices are essential:

1. all code and location-descriptor bits are placed at a declared controller station;

2. a model-time interval is assigned to their actual finite computation.

A location descriptor stored at the station is not a remote quantum register. No instantaneous acquisition of unknown remote location data is implied.

For Target A, one may interpret $U_{\mathrm{code}}$ as a macro event on local code data with identity matter channel. For Target B, positive-duration gates require a time buffer.

The code's germ timestamp $s=0$ is data describing the geometric event. It is not the time at which every computed code bit becomes physically available. A computation announced after the event is not an instantaneous global geometric update.