Struct risc0_zkp::prove::adapter::ProveAdapter
source · pub struct ProveAdapter<'a, F, C, S>where
F: Field,
C: 'static + CircuitDef<F>,
S: CircuitStepHandler<F::Elem>,{ /* private fields */ }
Implementations§
source§impl<'a, F, C, CS> ProveAdapter<'a, F, C, CS>where
F: Field,
C: CircuitDef<F>,
CS: CircuitStepHandler<F::Elem>,
impl<'a, F, C, CS> ProveAdapter<'a, F, C, CS>where
F: Field,
C: CircuitDef<F>,
CS: CircuitStepHandler<F::Elem>,
pub fn new(exec: &'a mut Executor<F, C, CS>) -> Self
pub fn get_taps(&self) -> &'static TapSet<'static>
sourcepub fn execute<S: Sha>(&mut self, iop: &mut WriteIOP<S>)
pub fn execute<S: Sha>(&mut self, iop: &mut WriteIOP<S>)
Perform initial ‘execution’ setting code + data. Additionally, write any ‘results’ as needed.
sourcepub fn accumulate<S: Sha>(&mut self, iop: &mut WriteIOP<S>)
pub fn accumulate<S: Sha>(&mut self, iop: &mut WriteIOP<S>)
Perform ‘accumulate’ stage, using the iop for any RNG state.