Struct IPACommitmentScheme

pub struct IPACommitmentScheme<C: CurveAffine> { /* private fields */ }

Concrete IPA commitment scheme

Trait Implementations

impl<C: CurveAffine> CommitmentScheme for IPACommitmentScheme<C>

type Scalar = <C as CurveAffine>::ScalarExt

Application field of this commitment scheme

type Curve = C

Elliptic curve used to commit the application and witnesses

type ParamsProver = ParamsIPA<C>

Constant prover parameters

type ParamsVerifier = ParamsIPA<C>

Constant verifier parameters

fn new_params(k: u32) -> Self::ParamsProver

Wrapper for parameter generator

fn read_params<R: Read>(reader: &mut R) -> Result<Self::ParamsProver>

Wrapper for parameter reader

impl<C: Debug + CurveAffine> Debug for IPACommitmentScheme<C>

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

Formats the value using the given formatter.

impl<'params, C: CurveAffine> Guard<IPACommitmentScheme<C>> for GuardIPA<'params, C>

Define accumulator type as MSMIPA

type MSMAccumulator = MSMIPA<'params, C>

Multi scalar engine which is not evaluated yet.

impl<'params, C: CurveAffine> Prover<'params, IPACommitmentScheme<C>> for ProverIPA<'params, C>

fn create_proof<'com, Z: EncodedChallenge<C>, T: TranscriptWrite<C, Z>, R, I>( &self, rng: R, transcript: &mut T, queries: I, ) -> Result<()>

where I: IntoIterator<Item = ProverQuery<'com, C>> + Clone, R: RngCore,

Create a multi-opening proof

const QUERY_INSTANCE: bool = true

Query instance or not

fn new(params: &'params ParamsIPA<C>) -> Self

Creates new prover instance

impl<'params, C: CurveAffine> VerificationStrategy<'params, IPACommitmentScheme<C>, VerifierIPA<'params, C>> for AccumulatorStrategy<'params, C>

fn finalize(self) -> bool

Finalizes the batch and checks its validity.

Returns false if some proof was invalid. If the caller needs to identify specific failing proofs, it must re-process the proofs separately.

type Output = AccumulatorStrategy<'params, C>

The output type of this verification strategy after processing a proof.

fn new(params: &'params ParamsIPA<C>) -> Self

Creates new verification strategy instance

fn process( self, f: impl FnOnce(MSMIPA<'params, C>) -> Result<GuardIPA<'params, C>, Error>, ) -> Result<Self::Output, Error>

Obtains an MSM from the verifier strategy and yields back the strategy’s output.

impl<'params, C: CurveAffine> VerificationStrategy<'params, IPACommitmentScheme<C>, VerifierIPA<'params, C>> for SingleStrategy<'params, C>

fn finalize(self) -> bool

Finalizes the batch and checks its validity.

Returns false if some proof was invalid. If the caller needs to identify specific failing proofs, it must re-process the proofs separately.

type Output = ()

The output type of this verification strategy after processing a proof.

fn new(params: &'params ParamsIPA<C>) -> Self

Creates new verification strategy instance

fn process( self, f: impl FnOnce(MSMIPA<'params, C>) -> Result<GuardIPA<'params, C>, Error>, ) -> Result<Self::Output, Error>

Obtains an MSM from the verifier strategy and yields back the strategy’s output.

impl<'params, C: CurveAffine> Verifier<'params, IPACommitmentScheme<C>> for VerifierIPA<'params, C>

const QUERY_INSTANCE: bool = true

Query instance or not

type Guard = GuardIPA<'params, C>

Unfinalized verification result. This is returned in verification to allow developer to compress or combined verification results

type MSMAccumulator = MSMIPA<'params, C>

Accumulator fot comressed verification

fn new(params: &'params ParamsVerifierIPA<C>) -> Self

Creates new verifier instance

fn verify_proof<'com, E: EncodedChallenge<C>, T: TranscriptRead<C, E>, I>( &self, transcript: &mut T, queries: I, msm: MSMIPA<'params, C>, ) -> Result<Self::Guard, Error>

where I: IntoIterator<Item = VerifierQuery<'com, C, MSMIPA<'params, C>>> + Clone, 'params: 'com,

Process the proof and returns unfinished result named Guard