Proof of `Randomized computations as NP certificates` (1st statement)
groundedproofs/Lax253009Proofs/RandomizedContainments.lean · lax-253009
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The certificate is a complete random tape. Its verifier parses the registered pair encoding, checks the tape length, and simulates the registered procedure.