Bulletproofs.MultiRangeProof

Documentation

data RangeProof f

Constructors

RangeProof

Fields

• tBlinding :: f

  Blinding factor of the T1 and T2 commitments, combined into the form required to make the committed version of the x-polynomial add up

• mu :: f

  Blinding factor required for the Verifier to verify commitments A, S

• t :: f

  Dot product of vectors l and r that prove knowledge of the value in range t = t(x) = l(x) · r(x)

• aCommit :: Point

  Commitment to aL and aR, where aL and aR are vectors of bits such that aL · 2^n = v and aR = aL − 1^n . A = α · H + aL · G + aR · H

• sCommit :: Point

  Commitment to new vectors sL, sR, created at random by the Prover

• t1Commit :: Point

  Pedersen commitment to coefficient t1

• t2Commit :: Point

  Pedersen commitment to coefficient t2

• productProof :: InnerProductProof f

  Inner product argument to prove that a commitment P has vectors l, r ∈ Z^n for which P = l · G + r · H + ( l, r ) · U

Instances

Eq f => Eq (RangeProof f)

Defined in Bulletproofs.RangeProof.Internal

Methods

(==) :: RangeProof f -> RangeProof f -> Bool

(/=) :: RangeProof f -> RangeProof f -> Bool

Show f => Show (RangeProof f)

Defined in Bulletproofs.RangeProof.Internal

Methods

showsPrec :: Int -> RangeProof f -> ShowS

show :: RangeProof f -> String

showList :: [RangeProof f] -> ShowS

data RangeProofError

Constructors

UpperBoundTooLarge Integer

The upper bound of the range is too large

ValueNotInRange Integer

Value is not within the range required

ValuesNotInRange [Integer]

Values are not within the range required

NNotPowerOf2 Integer

Dimension n is required to be a power of 2

Instances

Eq RangeProofError

Defined in Bulletproofs.RangeProof.Internal

Methods

(==) :: RangeProofError -> RangeProofError -> Bool

(/=) :: RangeProofError -> RangeProofError -> Bool

Show RangeProofError

Defined in Bulletproofs.RangeProof.Internal

Methods

showsPrec :: Int -> RangeProofError -> ShowS

show :: RangeProofError -> String

showList :: [RangeProofError] -> ShowS

generateProof

Arguments

:: (AsInteger f, Eq f, Field f, Show f, MonadRandom m, MonadFail m)

=> Integer

Upper bound of the range we want to prove

-> [(Integer, Integer)]

Values we want to prove in range and their blinding factors

-> ExceptT RangeProofError m (RangeProof f)

Prove that a list of values lies in a specific range

generateProofUnsafe

Arguments

:: (AsInteger f, Eq f, Field f, Show f, MonadRandom m, MonadFail m)

=> Integer

Upper bound of the range we want to prove

-> [(Integer, Integer)]

Values we want to prove in range and their blinding factors

-> m (RangeProof f)

Generate range proof from valid inputs

verifyProof

Arguments

:: (AsInteger f, Eq f, Field f, Show f)

=> Integer

Range upper bound

-> [Point]

Commitments of in-range values

-> RangeProof f

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