Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- verifyProof :: Integer -> Point -> RangeProof -> Bool
- verifyTPoly :: Integer -> Point -> RangeProof -> Fq -> Fq -> Fq -> Bool
- verifyLRCommitment :: Integer -> RangeProof -> Fq -> Fq -> Fq -> Bool
Documentation
:: Integer | Range upper bound |
-> Point | Commitment of an in-range value |
-> RangeProof | 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 |
-> Point | Commitment of an in-range value |
-> RangeProof | Proof that a secret committed value lies in a certain interval |
-> Fq | Challenge x |
-> Fq | Challenge y |
-> Fq | 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