Theorem: Exact causal and accurate event benchmark

For this declared target and architecture:

1. every route and every elementary gate is causally admissible in the independently supplied cone;

2. the implemented endpoint channel equals

   $${\mathrm{Ad}}_{U_{\mathrm{code}}}\otimes {\mathrm{Ad}}_{\mathrm{SWAP}},$$

   with histories retained and work returned on the canonical forward domain;

3. accuracy is exact, including with every untouched entangled reference;

4. the two cross-port matter signalling strengths are one;

5. the model-time computation is compatible with the geometric event at $s=0$, without assigning a geometric meaning to intermediate compiler code states.

Proof. The incoming and outgoing radial trajectories obey $|\dot{x}|\le \dot{T}$. Storage is along the fixed timelike axis or the fixed ray station. Every elementary gate is local at the apex with positive duration. Thus Target B holds.

Transport carries the same tensor factors without measurement. At the rendezvous, the three CNOT gates give the SWAP exactly, while the independent code gates give $U_{\mathrm{code}}$. The two operations act on distinct factors, so the endpoint channel is their tensor product. Unitary identities remain identities with every reference.

For signalling from the apex input to the ray output, compare replacement interventions preparing $|0⟩$ and $|1⟩$. SWAP gives orthogonal ray outputs, with trace distance one. The reverse direction is identical. These signals follow causal routes, rather than exceeding physical possibility.

The code describes the event germ at timestamp zero and becomes available after its finite computation. The supplied slicing passes continuously through zero during the bracket. Its metric and holonomy do not depend on the compiler states. The decoder statement concerns the canonical completed code, exactly as in VII-F.