Definition: X-K finite composition certificate

A certificate consists of:

1. a finite rooted tree of public outcomes and a finite quantum-name context at every node;

2. each node instrument of Definition def:node, with all allocations, memory, routes, releases, and classical controls included;

3. the provenance of each clock under Definition def:fresh;

4. every input, returned output, stored register, failure flag, and declared discard;

5. a timed port graph satisfying Definition def:readiness;

6. the branchwise occupancy, storage, operation-count, and duration ledgers;

7. any ideal–implemented comparisons on explicitly matching interfaces.

Every leaf has a complete output convention.