Endpoint successor checklist

A successor attempting Stage D should provide a reproducible certificate organized as follows.

and preparation. State the code algebra, its dimension, preparation map, complete purification, and allowed external-reference inputs. A code selected only after seeing favorable outputs does not certify the declared unknown code.

dynamics. State the Hamiltonian or microscopic evolution, its operator domains if unbounded, the preparation assumptions, and the theorem establishing complete unitary evolution. A regulated finite propagator is not an unregulated gravitational evolution unless their comparison is proved.

. Name the outgoing factors or accessible observable algebra. Identify the complete complement and the physical field-to-memory receiver, if a laboratory quantum return is claimed. State all factorization, gauge, and superselection assumptions.

. Construct the endpoint map and its convergence topology. Give the access-preserving comparison maps and their implementation meaning. Account for modes, sectors, and purifiers that do not appear in the observer's description.

certificate. For exact recovery, prove every complementary matrix-unit identity or the equivalent complete Choi product identity. For approximate recovery, state the replacement state and a valid channel-distance upper bound. Choi or state-based bounds must retain their dimension factors.

. Declare a deterministic CPTP map, including the unused output subspace and failure branches. If an efficient or streaming implementation is claimed, supply the additional execution and memory certificate.

and costs. Separate the quantum return from any later record, and attach any cost claim to Appendix app:thermal's implementation package.

protection. Identify the exact physical and analytic claims proved. Do not treat a transport template, entropy curve, finite bath, catalogue label, or partial analytic reference as the missing same-model construction.