Struct ark_marlin::Marlin [−][src]
pub struct Marlin<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>, D: Digest>(_, _, _);
Expand description
The compiled argument system.
Implementations
impl<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>, D: Digest> Marlin<F, PC, D>
[src]
impl<F: PrimeField, PC: PolynomialCommitment<F, DensePolynomial<F>>, D: Digest> Marlin<F, PC, D>
[src]The personalization string for this protocol. Used to personalize the Fiat-Shamir rng.
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>>
[src]
pub fn index<C: ConstraintSynthesizer<F>>(
srs: &UniversalSRS<F, PC>,
c: C
) -> Result<(IndexProverKey<F, PC>, IndexVerifierKey<F, PC>), Error<PC::Error>>
[src]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>>
[src]
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>>
[src]Create a zkSNARK asserting that the constraint system is satisfied.
Auto Trait Implementations
impl<F, PC, D> RefUnwindSafe for Marlin<F, PC, D> where
D: RefUnwindSafe,
F: RefUnwindSafe,
PC: RefUnwindSafe,
impl<F, PC, D> UnwindSafe for Marlin<F, PC, D> where
D: UnwindSafe,
F: UnwindSafe,
PC: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
pub fn vzip(self) -> V