Debugging audit

{@{}p{.36}p{.59}@{}} Potential overstatement & Correction
Potential overstatement & Correction

Finite adaptive composition is first proved here & X-I-ST already gives the skeleton. The present claim is the assembled typed, routed, resource-fitting certificate.

A new clock name is an independent random clock & Freshness is a type/provenance condition. Joint preparations may be correlated.

A consumed name can be restored by relabelling & A new output factor and its actual preparation or restoration map are required.

The record universally restores the clock & Two different clock superpositions have identical destructive outputs.

One path operator exists for every public history & General instruments require a Kraus refinement inside each public history.

Hidden Kraus labels may control later commands & Only declared accessible outcomes can select a continuation.

Single-clock marginals determine a multi-clock law & The correlated and anticorrelated examples have the same marginals and disjoint joint laws.

A successful branch is a deterministic process & Every failure continuation and terminal output is retained.

A joint state formula delivers the record & Remote control requires a causal record wire and arrival before use.

Identity of the reference marginal proves identity transport & Even replacement channels leave an untouched reference marginal unchanged. The route proves the full payload–reference identity.

A release removes the register from every cost & Returned and supplier storage remain in their own ledgers.

Every finite protocol fits a fixed reserve & Capacity, duration, permissions, and location fit are explicit additional checks.

Cumulative clock supply equals simultaneous peak & They are different counts. Every actual holding is charged at the cut where it occurs.

One tested trace error gives a diamond estimate & The identity/Pauli example disproves this. State-specific and uniform bounds are separated.

Per-stage marginals price correlated device memory & The memory and history must be in the step interfaces.

All branches should be added in the adaptive budget & The proved worst-path recursion charges only one root-to-leaf chain in the uniform bound.

A favorable branch probability discounts any node error & Such weighting needs a separate justified estimate; it is not assumed.

A small complete error controls normalized rare branches uniformly & Conditioning requires a positive event-probability margin.

A logical-only bound certifies arrival & The arrival or timeout flag must be included in the complete compared output.

A complete-channel bound validates an enclosure & The enclosure needs its own independent mathematical or numerical justification.

A telescope is a sampling confidence theorem & No sampling model or finite-shot theorem is introduced.