Expand description
The recursion VM is a non-Turing-complete virtual machine (VM) optimized for algebraic constraint checking. In particular, it is well-tuned for verifying STARKs.
The recursion VM runs “recursion programs”, which define the
functionality it will implement. As examples, the lift, join,
and resolve programs are used by the risc0 ZkVM to compress a
collection of STARK receipts for a composition into a single
succinct receipt.
This is a low-level interface; users should prefer to use the
risc0_zkvm crate.
Modules§
- control_
id - layout
- prove
- Prover implementation for the recursion VM.
- testutil
Structs§
- Circuit
Impl - This struct implements traits that are defined by code generated by the circuit definition.