Struct FRIFolder

pub struct FRIFolder<'a, F, FA, MerkleProver, VCS>
where
    FA: BinaryField,
    F: BinaryField,
    MerkleProver: MerkleTreeProver<F, Scheme = VCS>,
    VCS: MerkleTreeScheme<F>,
{ /* private fields */ }

A stateful prover for the FRI fold phase.

Implementations

impl<'a, F, FA, MerkleProver, VCS> FRIFolder<'a, F, FA, MerkleProver, VCS>

where F: TowerField + ExtensionField<FA>, FA: BinaryField, MerkleProver: MerkleTreeProver<F, Scheme = VCS>, VCS: MerkleTreeScheme<F, Digest: SerializeBytes>,

pub fn new( params: &'a FRIParams<F, FA>, merkle_prover: &'a MerkleProver, committed_codeword: &'a [F], committed: &'a MerkleProver::Committed, ) -> Result<Self, Error>

Constructs a new folder.

pub const fn n_rounds(&self) -> usize

Number of fold rounds, including the final fold.

pub const fn curr_round(&self) -> usize

Number of times execute_fold_round has been called.

pub fn execute_fold_round( &mut self, challenge: F, ) -> Result<FoldRoundOutput<VCS::Digest>, Error>

Executes the next fold round and returns the folded codeword commitment.

As a memory efficient optimization, this method may not actually do the folding, but instead accumulate the folding challenge for processing at a later time. This saves us from storing intermediate folded codewords.

pub fn finalize( self, ) -> Result<(TerminateCodeword<F>, FRIQueryProver<'a, F, FA, MerkleProver, VCS>), Error>

Finalizes the FRI folding process.

This step will process any unprocessed folding challenges to produce the final folded codeword. Then it will decode this final folded codeword to get the final message. The result is the final message and a query prover instance.

This returns the final message and a query prover instance.

pub fn finish_proof<Challenger_>( self, transcript: &mut ProverTranscript<Challenger_>, ) -> Result<(), Error>

where Challenger_: Challenger,