Struct FRIVerifier

pub struct FRIVerifier<'a, F, FA, VCS>
where
    F: BinaryField + ExtensionField<FA>,
    FA: BinaryField,
    VCS: MerkleTreeScheme<F>,
{ /* private fields */ }

A verifier for the FRI query phase.

The verifier is instantiated after the folding rounds and is used to test consistency of the round messages and the original purported codeword.

Implementations

impl<'a, F, FA, VCS> FRIVerifier<'a, F, FA, VCS>

where F: TowerField + ExtensionField<FA>, FA: BinaryField, VCS: MerkleTreeScheme<F, Digest: DeserializeBytes>,

pub fn new( params: &'a FRIParams<F, FA>, vcs: &'a VCS, codeword_commitment: &'a VCS::Digest, round_commitments: &'a [VCS::Digest], challenges: &'a [F], ) -> Result<Self, Error>

pub fn n_oracles(&self) -> usize

Number of oracles sent during the fold rounds.

pub fn verify<Challenger_>( &self, transcript: &mut VerifierTranscript<Challenger_>, ) -> Result<F, Error>

where Challenger_: Challenger,

pub fn verify_last_oracle(&self, terminate_codeword: &[F]) -> Result<F, Error>

Verifies that the last oracle sent is a codeword.

Returns the fully-folded message value.

pub fn verify_query<B: Buf>( &self, index: usize, terminate_codeword: &[F], layers: &[Vec<VCS::Digest>], advice: &mut TranscriptReader<'_, B>, ) -> Result<(), Error>

Verifies a FRI challenge query.

A FRI challenge query tests for consistency between all consecutive oracles sent by the prover. The verifier has full access to the last oracle sent, and this is probabilistically verified to be a codeword by Self::verify_last_oracle.

Arguments

• index - an index into the original codeword domain
• proof - a query proof

Trait Implementations

impl<'a, F, FA, VCS> Debug for FRIVerifier<'a, F, FA, VCS>

where F: BinaryField + ExtensionField<FA> + Debug, FA: BinaryField + Debug, VCS: MerkleTreeScheme<F> + Debug, VCS::Digest: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.