Struct FRIFoldVerifier 

pub struct FRIFoldVerifier<'a, F, C>
where
    F: BinaryField,
{ /* private fields */ }

Receives the prover’s fold-phase commitments in the order the protocol sends them.

The fold phase spends one round per variable of the committed message. Most rounds only absorb a folding challenge and carry no message from the prover.

A round that completes a fold shrinks the codeword. The prover commits to that new codeword, and this type reads it off the channel.

Implementations

impl<'a, F, C> FRIFoldVerifier<'a, F, C>

where F: BinaryField, C: Clone,

pub fn new(params: &'a FRIParams<F>) -> Self

Derives the schedule of expected commitments from the protocol parameters.

pub fn process_round<Channel>( &mut self, channel: &mut Channel, ) -> Result<Option<C>, Error>

where Channel: MerkleIPVerifierChannel<F, Commitment = C>,

Advances one fold round, reading a commitment off the channel if this round carries one.

Returns

The commitment received, or nothing when this round carries none.

Panics

Panics once the fold phase has already run all of its rounds.

pub const fn is_complete(&self) -> bool

Reports whether every fold round has been processed.

pub fn finalize(self) -> Vec<C>

Consumes the verifier and yields the commitments it collected, in arrival order.

Panics

Panics unless every fold round has been processed. Stopping early would drop commitments the query phase needs to open.

pub const fn n_rounds(&self) -> usize

Number of rounds the fold phase runs.