Struct ark_marlin::Marlin

pub struct Marlin<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>, D: Digest>(_, _, _);

The compiled argument system.

Implementations

impl<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>, D: Digest> Marlin<F, PC, D>

pub const PROTOCOL_NAME: &'static [u8]

The personalization string for this protocol. Used to personalize the Fiat-Shamir rng.

pub fn universal_setup<R: RngCore>(
    num_constraints: usize,
    num_variables: usize,
    num_non_zero: usize,
    rng: &mut R
) -> Result<UniversalSRS<F, PC>, Error<PC::Error>>

Generate the universal prover and verifier keys for the argument system.

pub fn index<C: ConstraintSynthesizer<F>>(
    srs: &UniversalSRS<F, PC>,
    c: C
) -> Result<(IndexProverKey<F, PC>, IndexVerifierKey<F, PC>), Error<PC::Error>>

Generate the index-specific (i.e., circuit-specific) prover and verifier keys. This is a deterministic algorithm that anyone can rerun.

pub fn prove<C: ConstraintSynthesizer<F>, R: RngCore>(
    index_pk: &IndexProverKey<F, PC>,
    c: C,
    zk_rng: &mut R
) -> Result<Proof<F, PC>, Error<PC::Error>>

Create a zkSNARK asserting that the constraint system is satisfied.

pub fn verify<R: RngCore>(
    index_vk: &IndexVerifierKey<F, PC>,
    public_input: &[F],
    proof: &Proof<F, PC>,
    rng: &mut R
) -> Result<bool, Error<PC::Error>>

Verify that a proof for the constrain system defined by C asserts that all constraints are satisfied.