Struct PlonkKzgSnark

pub struct PlonkKzgSnark<E: Pairing>(/* private fields */);

A Plonk instantiated with KZG PCS

Implementations

impl<E, F, P> PlonkKzgSnark<E>

where E: Pairing<BaseField = F, G1Affine = Affine<P>>, F: RescueParameter + SWToTEConParam, P: SWCurveConfig<BaseField = F>,

pub fn new() -> Self

A new Plonk KZG SNARK

pub fn batch_prove<C, R, T>( prng: &mut R, circuits: &[&C], prove_keys: &[&ProvingKey<E>], ) -> Result<BatchProof<E>, PlonkError>

where C: Arithmetization<E::ScalarField>, R: CryptoRng + RngCore, T: PlonkTranscript<F>,

Generate an aggregated Plonk proof for multiple instances.

pub fn verify_batch_proof<T>( verify_keys: &[&VerifyingKey<E>], public_inputs: &[&[E::ScalarField]], batch_proof: &BatchProof<E>, ) -> Result<(), PlonkError>

where T: PlonkTranscript<F>,

Verify a single aggregated Plonk proof.

pub fn batch_verify<T>( verify_keys: &[&VerifyingKey<E>], public_inputs: &[&[E::ScalarField]], proofs: &[&Proof<E>], extra_transcript_init_msgs: &[Option<Vec<u8>>], ) -> Result<(), PlonkError>

where T: PlonkTranscript<F>,

Batch verify multiple SNARK proofs (w.r.t. different verifying keys).

Trait Implementations

impl<E, F, P> UniversalSNARK<E> for PlonkKzgSnark<E>

where E: Pairing<BaseField = F, G1Affine = Affine<P>>, F: RescueParameter + SWToTEConParam, P: SWCurveConfig<BaseField = F>,

fn preprocess<C: Arithmetization<E::ScalarField>>( srs: &Self::UniversalSRS, circuit: &C, ) -> Result<(Self::ProvingKey, Self::VerifyingKey), Self::Error>

Input a circuit and the SRS, precompute the proving key and verification key.

fn prove<C, R, T>( rng: &mut R, circuit: &C, prove_key: &Self::ProvingKey, extra_transcript_init_msg: Option<Vec<u8>>, ) -> Result<Self::Proof, Self::Error>

where C: Arithmetization<E::ScalarField>, R: CryptoRng + RngCore, T: PlonkTranscript<F>,

Compute a Plonk proof. Refer to Sec 8.4 of https://eprint.iacr.org/2019/953.pdf

circuit and prove_key has to be consistent (with the same evaluation domain etc.), otherwise return error.

type Proof = Proof<E>

The SNARK proof computed by the prover.

type ProvingKey = ProvingKey<E>

The parameters required by the prover to compute a proof for a specific circuit.

type VerifyingKey = VerifyingKey<E>

The parameters required by the verifier to validate a proof for a specific circuit.

type UniversalSRS = UnivariateUniversalParams<E>

Universal Structured Reference String from universal_setup, used for all subsequent circuit-specific preprocessing

type Error = PlonkError

SNARK related error

fn verify<T>( verify_key: &Self::VerifyingKey, public_input: &[E::ScalarField], proof: &Self::Proof, extra_transcript_init_msg: Option<Vec<u8>>, ) -> Result<(), Self::Error>

where T: PlonkTranscript<F>,

Verify a SNARK proof proof of the circuit circuit, with respect to the public input pub_input.

fn universal_setup<R: RngCore + CryptoRng>( _max_degree: usize, _rng: &mut R, ) -> Result<Self::UniversalSRS, Self::Error>

Generate the universal SRS for the argument system. This setup is for trusted party to run, and mostly only used for testing purpose. In practice, a MPC flavor of the setup will be carried out to have higher assurance on the “toxic waste”/trapdoor being thrown away to ensure soundness of the argument system.