bulletproofs-0.4.0

Safe HaskellNone
LanguageHaskell2010

Bulletproofs.Curve

Synopsis

Documentation

q :: Integer #

Order of the curve

g :: Point #

Generator of the curve

h :: Point #

H = aG where a is not known

gs :: [Point] #

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 :: [Point] #

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 :: ByteString -> Integer #

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