Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- generateProof :: (KnownNat p, MonadRandom m) => Integer -> [(PrimeField p, PrimeField p)] -> ExceptT (RangeProofError (PrimeField p)) m (RangeProof (PrimeField p))
- generateProofUnsafe :: forall p m. (KnownNat p, MonadRandom m) => Integer -> [(PrimeField p, PrimeField p)] -> m (RangeProof (PrimeField p))
Documentation
:: (KnownNat p, MonadRandom m) | |
=> Integer | Upper bound of the range we want to prove |
-> [(PrimeField p, PrimeField p)] | Values we want to prove in range and their blinding factors |
-> ExceptT (RangeProofError (PrimeField p)) m (RangeProof (PrimeField p)) |
Prove that a list of values lies in a specific range
:: (KnownNat p, MonadRandom m) | |
=> Integer | Upper bound of the range we want to prove |
-> [(PrimeField p, PrimeField p)] | Values we want to prove in range and their blinding factors |
-> m (RangeProof (PrimeField p)) |
Generate range proof from valid inputs