Struct binius_core::poly_commit::ring_switch::RingSwitchPCS

pub struct RingSwitchPCS<F, FDomain, PE, DomainFactory, Inner> { /* private fields */ }

A polynomial commitment scheme constructed as a reduction to an inner PCS over a field extension.

This implements the Construction 4.1 in DP24. The polynomial is committed by committing its corresponding packed polynomial with the inner PCS. Evaluation proofs consist of a sumcheck reduction followed by a PCS evaluation proof for the packed polynomial using the inner PCS.

Type parameters

• F - the coefficient subfield
• FDomain - the field containing the sumcheck evaluation domains
• PE - a packed extension field of F that is cryptographically big
• DomainFactory - a domain factory for the sumcheck reduction
• Inner - the inner polynomial commitment scheme over the extension field

Implementations

impl<F, FDomain, PE, DomainFactory, Inner> RingSwitchPCS<F, FDomain, PE, DomainFactory, Inner>

where F: Field, PE: PackedField, PE::Scalar: ExtensionField<F>, Inner: PolyCommitScheme<PE, PE::Scalar>,

pub fn new(inner: Inner, domain_factory: DomainFactory) -> Result<Self, Error>

pub const fn kappa() -> usize

Returns $\kappa$, the base-2 logarithm of the extension degree.

Trait Implementations

impl<F: Debug, FDomain: Debug, PE: Debug, DomainFactory: Debug, Inner: Debug> Debug for RingSwitchPCS<F, FDomain, PE, DomainFactory, Inner>

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

Formats the value using the given formatter.

impl<F, FDomain, FE, P, PE, DomainFactory, Inner> PolyCommitScheme<P, FE> for RingSwitchPCS<F, FDomain, PE, DomainFactory, Inner>

where F: Field, FDomain: Field, FE: ExtensionField<F> + ExtensionField<FDomain> + PackedField<Scalar = FE> + PackedExtension<F>, P: PackedField<Scalar = F>, PE: PackedFieldIndexable<Scalar = FE> + PackedExtension<F, PackedSubfield = P> + PackedExtension<FDomain>, DomainFactory: EvaluationDomainFactory<FDomain>, Inner: PolyCommitScheme<PE, FE>,

type Commitment = <Inner as PolyCommitScheme<PE, FE>>::Commitment

type Committed = <Inner as PolyCommitScheme<PE, FE>>::Committed

type Proof = Proof<F, FE, <Inner as PolyCommitScheme<PE, FE>>::Proof>

type Error = Error

fn n_vars(&self) -> usize

fn commit<Data>( &self, polys: &[MultilinearExtension<P, Data>] ) -> Result<(Self::Commitment, Self::Committed), Self::Error>

where Data: Deref<Target = [P]> + Send + Sync,

Commit to a batch of polynomials

fn prove_evaluation<Data, CH, Backend>( &self, challenger: &mut CH, committed: &Self::Committed, polys: &[MultilinearExtension<P, Data>], query: &[PE::Scalar], backend: Backend ) -> Result<Self::Proof, Self::Error>

where Data: Deref<Target = [P]> + Send + Sync, CH: CanObserve<PE::Scalar> + CanObserve<Self::Commitment> + CanSample<PE::Scalar> + CanSampleBits<usize>, Backend: ComputationBackend,

Generate an evaluation proof at a random challenge point.

fn verify_evaluation<CH, Backend>( &self, challenger: &mut CH, commitment: &Self::Commitment, query: &[FE], proof: Self::Proof, values: &[FE], backend: Backend ) -> Result<(), Self::Error>

where CH: CanObserve<FE> + CanObserve<Self::Commitment> + CanSample<FE> + CanSampleBits<usize>, Backend: ComputationBackend,

Verify an evaluation proof at a random challenge point.

fn proof_size(&self, n_polys: usize) -> usize

Return the byte-size of a proof.