Try to prove the simplest possible piece of tx verifier with RISC Zero ZKVM

https://github.com/risc0/risc0

That'd probably be an input box guarding script verification. Try the simplest script that reduces to `true` (without sigmaprops) with an empty context.

Start by reviewing the tx verifier and the input-box guarding script verification, then examine the linked RISC Zero ZKVM project. Determine how the simplest script reducing to true can be represented with an empty context and what is required to prove it. Done means a minimal proof path is demonstrated without sigmaprops.

Written by the indexing model from the issue text.