Struct Prover 

pub struct Prover { /* private fields */ }

Available on non-target_os="zkvm" and crate feature prove only.

Prover for zkVM use of the recursion circuit.

Implementations

impl Prover

pub fn control_id(&self) -> &Digest

Returns the control id of the recursion VM program being proven.

pub fn control_inclusion_proof(&self) -> Result<MerkleProof>

Returns a Merkle inclusion proof of this prover’s control ID in the set of allowed IDs.

pub fn new_test_recursion_circuit( digests: [&Digest; 2], opts: ProverOpts, ) -> Result<Self>

Initialize a recursion prover with the test recursion program. This program is used in testing the basic correctness of the recursion circuit.

pub fn new_lift(segment: &SegmentReceipt, opts: ProverOpts) -> Result<Self>

Initialize a recursion prover with the lift program to transform an rv32im segment receipt into a recursion receipt.

The lift program is verifies the rv32im circuit STARK proof inside the recursion circuit, resulting in a recursion circuit STARK proof. This recursion proof has a single constant-time verification procedure, with respect to the original segment length, and is then used as the input to all other recursion programs (e.g. join, resolve, and identity_p254).

pub fn new_lift_povw(segment: &SegmentReceipt, opts: ProverOpts) -> Result<Self>

Create a prover job for the lift program that produces a work claim receipt.

Similar to Self::new_lift, but produces a work claim receipt that tracks verifiable work by computing the work value from the segment proof.

pub fn new_union( a: &SuccinctReceipt<Unknown>, b: &SuccinctReceipt<Unknown>, opts: ProverOpts, ) -> Result<Self>

Initialize a recursion prover with the union program to compress two succinct receipts into one.

By repeated application of the union program, any number of succinct receipts can be compressed into a single receipt.

pub fn new_join( a: &SuccinctReceipt<ReceiptClaim>, b: &SuccinctReceipt<ReceiptClaim>, opts: ProverOpts, ) -> Result<Self>

Initialize a recursion prover with the join program to compress two receipts of the same session into one.

By repeated application of the join program, any number of receipts for execution spans within the same session can be compressed into a single receipt for the entire session.

pub fn new_join_povw( a: &SuccinctReceipt<WorkClaim<ReceiptClaim>>, b: &SuccinctReceipt<WorkClaim<ReceiptClaim>>, unwrap: bool, opts: ProverOpts, ) -> Result<Self>

Create a prover job for the join program that operates on work claim receipts.

Similar to Self::new_join, but operates on work claim receipts and combines their work values while ensuring the consumed nonce ranges are disjoint. The unwrap parameter determines whether the result is unwrapped to a regular receipt claim.

pub fn new_resolve<Claim>( cond: &SuccinctReceipt<ReceiptClaim>, assum: &SuccinctReceipt<Claim>, opts: ProverOpts, ) -> Result<Self>

where Claim: Digestible + Debug,

Initialize a recursion prover with the resolve program to remove an assumption from a conditional receipt upon verifying a receipt proving the validity of the assumption.

By applying the resolve program, a conditional receipt (i.e. a receipt for an execution using the env::verify API to logically verify a receipt) can be made into an unconditional receipt.

pub fn new_resolve_povw<Claim>( cond: &SuccinctReceipt<WorkClaim<ReceiptClaim>>, assum: &SuccinctReceipt<Claim>, unwrap: bool, opts: ProverOpts, ) -> Result<Self>

where Claim: Digestible + Debug,

Create a prover job for the resolve program that operates on work claim receipts.

Similar to Self::new_resolve, but operates on work claim receipts while preserving the work value from the conditional receipt. The unwrap parameter determines whether the result is unwrapped to a regular receipt claim.

pub fn new_identity( a: &SuccinctReceipt<ReceiptClaim>, opts: ProverOpts, ) -> Result<Self>

Prove the verification of a recursion receipt, applying no changes to ReceiptClaim.

The primary use for this program is to transform the receipt itself, e.g. using a different hash function for FRI. See identity_p254 for more information.

pub fn new_unwrap_povw( a: &SuccinctReceipt<WorkClaim<ReceiptClaim>>, opts: ProverOpts, ) -> Result<Self>

Create a prover job for the unwrap program that converts a work claim receipt to a regular receipt.

This removes the work tracking wrapper from a receipt, producing a standard receipt that can be sent to verifiers of the underlying claim.

pub fn add_seal( &mut self, seal: &[u32], control_id: &Digest, control_inclusion_proof: &MerkleProof, ) -> Result<()>

Add a recursion seal (i.e. STARK proof) to input tape of the recursion program.

pub fn run(&mut self) -> Result<RecursionReceipt>

Run the prover, producing a receipt of execution for the recursion circuit over the loaded program and input.