rp

type IPA struct {
	// Left is the result of the reduction protocol of the left vector
	Left *mathlib.Zr
	// Right is the result of the reduction protocol of the right vector
	Right *mathlib.Zr
	// L is an array that contains commitments to the intermediary values
	// of the reduction protocol. The size of L is logarithmic in the size
	// of the left/right vector
	L []*mathlib.G1
	// R is an array that contains commitments to the intermediary values
	// of the reduction protocol. The size of R is logarithmic in the size
	// of the left/right vector
	R []*mathlib.G1
}

type RangeCorrectness struct {
	Proofs []*RangeProof
}

type RangeCorrectnessProver struct {
	Commitments        []*math.G1
	Values             []uint64
	BlindingFactors    []*math.Zr
	PedersenParameters []*math.G1
	LeftGenerators     []*math.G1
	RightGenerators    []*math.G1
	BitLength          uint64
	NumberOfRounds     uint64
	P                  *math.G1
	Q                  *math.G1
	Curve              *math.Curve
}

type RangeCorrectnessVerifier struct {
	Commitments        []*math.G1
	PedersenParameters []*math.G1
	LeftGenerators     []*math.G1
	RightGenerators    []*math.G1
	BitLength          uint64
	NumberOfRounds     uint64
	P                  *math.G1
	Q                  *math.G1
	Curve              *math.Curve
}

type RangeProof struct {
	// Data contains all the elements of the range proof that are not in IPA
	Data *RangeProofData
	// IPA is the proof that shows that InnerProduct is correct
	IPA *IPA
}

type RangeProofData struct {
	// T1 is a Pedersen commitment to a random tau1
	T1 *math.G1
	// T2 is a Pedersen commitment a random tau2
	T2 *math.G1
	// Tau = tau1x + tau2x^2 for a random challenge x
	Tau *math.Zr
	// C is a hiding Pedersen commitment to vectors left = (b_0, ...,b_{n-1})
	// and right = (b_0 - 1, ..., b_{n-1}-1) with randomness rho, where
	// v = \sum_{i=0}^{n-1} b_i 2^i, and n = BitLength
	C *math.G1
	// D is a hiding Pedersen commitment to two random vectors
	// with randomness eta
	D *math.G1
	// Delta = rho + x eta
	Delta *math.Zr
	// InnerProduct is the value of the inner product of the vectors committed in the non-hiding
	// commitment C*D^x/P^Delta
	InnerProduct *math.Zr
}