Quantum and classical resource ledger

For the explicit $n$-segment benchmark:

The bits $M,N,H$ are part of the five-bit sender word, not extra uncharged buffers. Their initial permission bit is one. History and record copies are retained outputs, not clean work.

For an explicit conservative finite controller reserve, put

Allow one $b_n$-bit local instruction counter per station and at most $8n+32$ programme rows per station. An instruction row can be encoded with a four-bit opcode and three $b_n$-bit indices, so the programme-ROM reserve is

bits, in addition to $(n+1)b_n$ counter bits. All station times are evaluated from the fixed algebraic schedule formulas, not acquired as unknown real parameters. A single remote global counter is not used as a hidden instantaneous control wire.

The ledger is sufficient rather than optimal. It assumes parallel carriage of the stated finite packet capacity on each admitted link. Different bandwidth, gate, or reset permissions require a new ledger. External reference storage is not charged as laboratory storage. No energy, thermal-machine, or Landauer-cost claim follows.