Documentation

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 :: p

  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 :: p

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

• t1Commit :: p

  Pedersen commitment to coefficient t1

• t2Commit :: p

  Pedersen commitment to coefficient t2

• productProof :: InnerProductProof f p

  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