Struct TrivialPcs

pub struct TrivialPcs<Val: TwoAdicField, Dft: TwoAdicSubgroupDft<Val>> {
    pub dft: Dft,
    pub log_n: usize,
    pub _phantom: PhantomData<Val>,
}

A trivial PCS: its commitment is simply the coefficients of each poly.

Fields

dft: Dft

log_n: usize

_phantom: PhantomData<Val>

Trait Implementations

impl<Val: Debug + TwoAdicField, Dft: Debug + TwoAdicSubgroupDft<Val>> Debug for TrivialPcs<Val, Dft>

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

Formats the value using the given formatter.

impl<Val, Dft, Challenge, Challenger> Pcs<Challenge, Challenger> for TrivialPcs<Val, Dft>

where Val: TwoAdicField, Challenge: ExtensionField<Val>, Challenger: CanSample<Challenge>, Dft: TwoAdicSubgroupDft<Val>, Vec<Vec<Val>>: Serialize + for<'de> Deserialize<'de>,

type Domain = TwoAdicMultiplicativeCoset<Val>

type Commitment = Vec<Vec<Val>>

The commitment that’s sent to the verifier.

type ProverData = Vec<DenseMatrix<Val>>

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

type EvaluationsOnDomain<'a> = <Dft as TwoAdicSubgroupDft<Val>>::Evaluations

Type of the output of get_evaluations_on_domain.

type Proof = ()

The opening argument.

type 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>