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§
Structs§
- Circuit
Impl - This struct implements traits that are defined by code generated by the circuit definition.
Constants§
- CHECKED_
COEFFS_ PER_ POLY - CIRCUIT
- GLOBAL_
MIX - GLOBAL_
OUT - REGISTER_
GROUP_ ACCUM - REGISTER_
GROUP_ CODE - REGISTER_
GROUP_ CTRL - REGISTER_
GROUP_ DATA