Struct HidingFriPcs

pub struct HidingFriPcs<Val, Dft, InputMmcs, FriMmcs, R> { /* private fields */ }

A hiding FRI PCS. Both MMCSs must also be hiding; this is not enforced at compile time so it’s the user’s responsibility to configure.

Implementations

impl<Val, Dft, InputMmcs, FriMmcs, R> HidingFriPcs<Val, Dft, InputMmcs, FriMmcs, R>

pub fn new( dft: Dft, mmcs: InputMmcs, fri: FriConfig<FriMmcs>, num_random_codewords: usize, rng: R, ) -> Self

Trait Implementations

impl<Val: Debug, Dft: Debug, InputMmcs: Debug, FriMmcs: Debug, R: Debug> Debug for HidingFriPcs<Val, Dft, InputMmcs, FriMmcs, R>

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

Formats the value using the given formatter.

impl<Val, Dft, InputMmcs, FriMmcs, Challenge, Challenger, R> Pcs<Challenge, Challenger> for HidingFriPcs<Val, Dft, InputMmcs, FriMmcs, R>

where Val: TwoAdicField, Standard: Distribution<Val>, Dft: TwoAdicSubgroupDft<Val>, InputMmcs: Mmcs<Val>, FriMmcs: Mmcs<Challenge>, Challenge: TwoAdicField + ExtensionField<Val>, Challenger: FieldChallenger<Val> + CanObserve<FriMmcs::Commitment> + GrindingChallenger<Witness = Val>, R: Rng + Send + Sync,

type Proof = (Vec<Vec<Vec<Vec<Challenge>>>>, FriProof<Challenge, FriMmcs, Val, Vec<BatchOpening<Val, InputMmcs>>>)

The first item contains the openings of the random polynomials added by this wrapper. The second item is the usual FRI proof.

type Domain = TwoAdicMultiplicativeCoset<Val>

type Commitment = <InputMmcs as Mmcs<Val>>::Commitment

The commitment that’s sent to the verifier.

type ProverData = <InputMmcs as Mmcs<Val>>::ProverData<DenseMatrix<Val>>

Data that the prover stores for committed polynomials, to help the prover with opening.

type EvaluationsOnDomain<'a> = HorizontallyTruncated<Val, RowIndexMappedView<BitReversalPerm, DenseMatrix<Val, &'a [Val]>>>

Type of the output of get_evaluations_on_domain.

type Error = FriError<<FriMmcs as Mmcs<Challenge>>::Error, <InputMmcs as Mmcs<Val>>::Error>

fn natural_domain_for_degree(&self, degree: usize) -> Self::Domain

This should return a coset domain (s.t. Domain::next_point returns Some)

fn commit( &self, evaluations: Vec<(Self::Domain, RowMajorMatrix<Val>)>, ) -> (Self::Commitment, Self::ProverData)

fn get_evaluations_on_domain<'a>( &self, prover_data: &'a Self::ProverData, idx: usize, domain: Self::Domain, ) -> Self::EvaluationsOnDomain<'a>

fn open( &self, rounds: Vec<(&Self::ProverData, Vec<Vec<Challenge>>)>, challenger: &mut Challenger, ) -> (OpenedValues<Challenge>, Self::Proof)

fn verify( &self, rounds: Vec<(Self::Commitment, Vec<(Self::Domain, Vec<(Challenge, Vec<Challenge>)>)>)>, proof: &Self::Proof, challenger: &mut Challenger, ) -> Result<(), Self::Error>