Bulletproofs.InnerProductProof.Internal

Documentation

data InnerProductProof f p

Constructors

InnerProductProof

Fields

• lCommits :: [p]

  Vector of commitments of the elements in the original vector l whose size is the logarithm of base 2 of the size of vector l

• rCommits :: [p]

  Vector of commitments of the elements in the original vector r whose size is the logarithm of base 2 of the size of vector r

• l :: f

  Remaining element of vector l at the end of the recursive algorithm that generates the inner-product proof

• r :: f

  Remaining element of vector r at the end of the recursive algorithm that generates the inner-product proof

Instances

(Eq p, Eq f) => Eq (InnerProductProof f p)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

(==) :: InnerProductProof f p -> InnerProductProof f p -> Bool

(/=) :: InnerProductProof f p -> InnerProductProof f p -> Bool

(Show p, Show f) => Show (InnerProductProof f p)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

showsPrec :: Int -> InnerProductProof f p -> ShowS

show :: InnerProductProof f p -> String

showList :: [InnerProductProof f p] -> ShowS

Generic (InnerProductProof f p)

Defined in Bulletproofs.InnerProductProof.Internal

Associated Types

type Rep (InnerProductProof f p) :: Type -> Type

Methods

from :: InnerProductProof f p -> Rep (InnerProductProof f p) x

to :: Rep (InnerProductProof f p) x -> InnerProductProof f p

(NFData p, NFData f) => NFData (InnerProductProof f p)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

rnf :: InnerProductProof f p -> ()

type Rep (InnerProductProof f p)

Defined in Bulletproofs.InnerProductProof.Internal

type Rep (InnerProductProof f p) = D1 (MetaData "InnerProductProof" "Bulletproofs.InnerProductProof.Internal" "bulletproofs-1.1.0-FP4S76deUzfBfGRiiGUv0Q" False) (C1 (MetaCons "InnerProductProof" PrefixI True) ((S1 (MetaSel (Just "lCommits") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [p]) :*: S1 (MetaSel (Just "rCommits") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [p])) :*: (S1 (MetaSel (Just "l") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 f) :*: S1 (MetaSel (Just "r") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 f))))

data InnerProductWitness f

Constructors

InnerProductWitness

Fields

• ls :: [f]

  Vector of values l that the prover uses to compute lCommits in the recursive inner product algorithm

• rs :: [f]

  Vector of values r that the prover uses to compute rCommits in the recursive inner product algorithm

Instances

Eq f => Eq (InnerProductWitness f)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

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

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

Show f => Show (InnerProductWitness f)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

showsPrec :: Int -> InnerProductWitness f -> ShowS

show :: InnerProductWitness f -> String

showList :: [InnerProductWitness f] -> ShowS

data InnerProductBase p

Constructors

InnerProductBase

Fields

• bGs :: [p]

  Independent generator Gs ∈ G^n

• bHs :: [p]

  Independent generator Hs ∈ G^n

• bH :: p

  Internally fixed group element H ∈ G for which there is no known discrete-log relation among Gs, Hs, bG

Instances

Eq p => Eq (InnerProductBase p)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

(==) :: InnerProductBase p -> InnerProductBase p -> Bool

(/=) :: InnerProductBase p -> InnerProductBase p -> Bool

Show p => Show (InnerProductBase p)

Defined in Bulletproofs.InnerProductProof.Internal

Methods

showsPrec :: Int -> InnerProductBase p -> ShowS

show :: InnerProductBase p -> String

showList :: [InnerProductBase p] -> ShowS