While this submission is a draft, it cannot be used by other submissions.

Proof of `Randomized computations as NP certificates` (1st statement)

groundedproofs/Lax253009Proofs/RandomizedContainments.lean · lax-253009

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The certificate is a complete random tape. Its verifier parses the registered pair encoding, checks the tape length, and simulates the registered procedure.