Bulletproofs.Utils

Documentation

h :: PA

H = aG where a is not known

gs :: [PA]

Generate vector of generators in a deterministic way from the curve generator g by applying H(encode(g) || i) where H is a secure hash function

hs :: [PA]

Generate vector of generators in a deterministic way from the curve generator h by applying H(encode(h) || i) where H is a secure hash function

oracle :: PrimeField f => ByteString -> f

A random oracle. In the Fiat-Shamir heuristic, its input is specifically the transcript of the interaction up to that point.

pointToBS :: PA -> ByteString

generateH :: [Char] -> PA

Iterative algorithm to generate H. The important thing about the H value is that nobody gets to know its discrete logarithm "k" such that H = kG

powerVector :: (Eq f, Num f) => f -> Integer -> [f]

Return a vector containing the first n powers of a

hadamard :: Num a => [a] -> [a] -> [a]

Hadamard product or entry wise multiplication of two vectors

dot :: Num a => [a] -> [a] -> a

Dot product

(^+^) :: Num a => [a] -> [a] -> [a]

Entry wise sum

(^-^) :: Num a => [a] -> [a] -> [a]

Entry wise subtraction

addTwoMulP :: Fr -> PA -> Fr -> PA -> PA

Double exponentiation (Shamir's trick): g0^x0 + g1^x1

sumExps :: [Fr] -> [PA] -> PA

Raise every point to the corresponding exponent, sum up results

commit :: Fr -> Fr -> PA

Create a Pedersen commitment to a value given a value and a blinding factor

isLogBase2 :: Integer -> Bool

logBase2 :: Integer -> Integer

logBase2M :: Integer -> Maybe Integer

slice :: Integer -> Integer -> [a] -> [a]

padToNearestPowerOfTwo :: Num f => [f] -> [f]

Append minimal amount of zeroes until the list has a length which is a power of two.

padToNearestPowerOfTwoOf

Arguments

:: Num f

=> Int

n

-> [f]

list which should have length <= 2^n

-> [f]

list which will have length 2^n

Given n, append zeroes until the list has length 2^n.

log2Ceil :: Int -> Int

Calculate ceiling of log base 2 of an integer.

randomN :: MonadRandom m => Integer -> m Integer

chooseBlindingVectors :: (Num f, MonadRandom m) => Integer -> m ([f], [f])

shamirY :: PA -> PA -> Fr

shamirZ :: PA -> PA -> Fr -> Fr

shamirX :: PA -> PA -> PA -> PA -> Fr -> Fr -> Fr

shamirX' :: PA -> PA -> PA -> Fr

shamirU :: Fr -> Fr -> Fr -> Fr