Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- verifyProof :: Integer -> [PA] -> RangeProof Fr PA -> Bool
- verifyTPoly :: Integer -> [PA] -> RangeProof Fr PA -> Fr -> Fr -> Fr -> Bool
- verifyLRCommitment :: Integer -> Integer -> RangeProof Fr PA -> Fr -> Fr -> Fr -> Bool
Documentation
:: Integer | Range upper bound |
-> [PA] | Commitments of in-range values |
-> RangeProof Fr PA | Proof that a secret committed value lies in a certain interval |
-> Bool |
Verify that a commitment was computed from a value in a given range
:: Integer | Dimension n of the vectors |
-> [PA] | Commitments of in-range values |
-> RangeProof Fr PA | Proof that a secret committed value lies in a certain interval |
-> Fr | Challenge x |
-> Fr | Challenge y |
-> Fr | Challenge z |
-> Bool |
Verify the constant term of the polynomial t t = t(x) = t0 + t1*x + t2*x^2 This is what binds the proof to the actual original Pedersen commitment V to the actual value