| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Bulletproofs.ArithmeticCircuit.Prover
Synopsis
- generateProof :: forall p m. (MonadRandom m, KnownNat p) => ArithCircuit (PrimeField p) -> ArithWitness (PrimeField p) -> m (ArithCircuitProof (PrimeField p))
Documentation
generateProof :: forall p m. (MonadRandom m, KnownNat p) => ArithCircuit (PrimeField p) -> ArithWitness (PrimeField p) -> m (ArithCircuitProof (PrimeField p)) Source #
Generate a zero-knowledge proof of computation for an arithmetic circuit with a valid witness