/// Create a Groth16 proof that is zero-knowledge.
/// This method samples randomness for zero knowledges via `rng`.
Create a Groth16 proof that is zero-knowledge.
This method samples randomness for zero knowledges via `rng`.
Create a Groth16 proof that is zero - knowledge . This method samples randomness for zero knowledges via ` rng ` .
pub fn create_random_proof<E, C, R>(
    circuit: C,
    pk: &ProvingKey<E>,
    rng: &mut R,
) -> R1CSResult<Proof<E>>
where
    E: PairingEngine,
    C: ConstraintSynthesizer<E::Fr>,
    R: Rng,
{
    create_random_proof_with_reduction::<E, C, R, LibsnarkReduction>(circuit, pk, rng)
}
pub fn create_random_proof < E , C , R > ( circuit : C , pk : & ProvingKey < E > , rng : & mut R , ) -> R1CSResult < Proof < E > > where E : PairingEngine , C : ConstraintSynthesizer < E :: Fr > , R : Rng , { create_random_proof_with_reduction :: < E , C , R , LibsnarkReduction > ( circuit , pk , rng ) }
Create a Groth16 proof that is zero-knowledge.
Create a Groth16 proof that is zero - knowledge .
circuit
C
pk
&ProvingKey<E>
rng
&mut R