Resource and error ledger

For two simultaneously reserved clocks, payloads, report buffers, and lookup workspace, a conservative preallocated reserve is

Sequential reuse can lower the peak only if its actual schedule and reset permissions are supplied. Descriptions, tables, supplier holdings, external references, and returned factors are separately charged when present.

The route uses $n$ register SWAPs. Clock basis changes, readouts, lookup, record forwarding, buffers, and durations are also charged. Table generation is not an unpriced field-acquisition step.

For compatible ideal and implemented complete channels,

Replace one channel factor at a time and use diamond-norm contraction and the triangle inequality Watrous. The comparison includes references. A probability of receiving a particular status changes by at most this complete-channel allowance.

The error bound does not verify an invalid enclosure, construct a missing analytic value, or prove exact causal containment of a faulty implementation.