zengo-x / bulletproofs Goto Github PK

right now the EC used is hard coded and needs to be changed manually.

-try to build with curv library feature ed25519

• correct errors and warning if such exist

No good reason to use Modulo {sub,add,mul,pow}. It is much cleaner to use directly operations from ECScalar, ECPoint.

prove that a pedersen commitment is to a value a<x<b.
If b-a is a power of 2 this can be done non interactively with only one range proof assuming the:

1. prover commits to a value a<x<b
2. prover generates a pedersen commitment to a value a
3. prover generates a range proof to commitment that is commitment from 1 minus commitment from 2
4. prover sends range proof together with the opening of the commitment from 2

• this mainly removes the need to use curve as feature

The code can be much cleaner if Vec<FE>,Vec<GE> would have defined arithmetic operators like Add and Mul.

This Bulletproofs implementation doesn't support inner-product argument generation and verification for inputs of sizes other than powers of 2. How do we use inner-product argument for input sizes not a power of 2? Also, how do we realise it in implementation?

I‘m reading the paper Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger, formular (7) in Page 5 is using z to combine the three contraints into one, but I don't think the expression is right for the following reason:

OR anything wrong for my comprehension?

following section 5 of bulletproof paper : https://eprint.iacr.org/2017/1066.pdf