A finite implementation ledger for the cone benchmark

Fix one VII-F code instance with report precision $b$, clock precision $d$, permission width $r$, and $n$ original location descriptors. Its displayed bound is

including retained history and clean work. Let $G_{\mathrm{code}}$ be any finite elementary gate count furnished by that instance.

The additional transport benchmark uses:

• two quantum matter registers;

• three CNOT gates for SWAP;

• causal carriage and storage of those two tensor factors, without measurement;

• no auxiliary matter register.

Thus $L=G_{\mathrm{code}}+3$ is a finite sufficient count for the local apex stage.

All code wires are at the apex station. The two matter wires are gathered there before $T=0$. With

the local stage ends before $T=1/8$, since $h_{\ast }=1/4$. The output deadline is $T=1/2$. The radial route of length $1/64$ then leaves strict positive slack.

The event code is decoded only at the completed forward boundary, with history omitted from the geometric observation but retained physically. No name descriptor is used to change the matter routing; the two-ray transport script is fixed in advance. If a later script reads code-dependent routing, the corresponding record wires and their arrival times must be added to the network.