README
¶
Back-Maxwell range proof for Pedersen Commitments on Go
Example implementation of Back-Maxwell Rangeproof on Go
for creating the Pedersen commitment with corresponding proof that committed value lies in [0..2^n-1] range.
The implementation uses Ethereum bn128 G1 curve to produce commitments and proofs.
Use only for educational reasons.
DO NOT USE IN PRODUCTION.
Usage
Explore main_test.go TestPedersenCommitment with example of usage.
Note, that there are the following values defined in global space to be changed on your choice:
var G *bn256.G1
var H *bn256.G1
// Hash function that should return the value in Curve.N field
var Hash func(...[]byte) *big.Int = defaultHash
Signature (Proof of ownership)
Explore main_test.go TestSignatureForCommitments with example of signing the Pederssn commitment.
It uses the scheme from Simple Schnorr Signature with Pedersen Commitment as Key article.
For the decentralized systems hash message expected to be the hash of transaction outputs.
Schnorr Signature
Explore main_test.go TestSchnorrSignatureAggregation with an example of Schnorr signature.
It can be useful to sign the resulting C=C1-C2 commitment in transactions.
It uses the scheme from Schnorr Signature article.
Documentation
¶
Index ¶
- Variables
- func Add(a, b *bn256.G1) *bn256.G1
- func PedersenCommitment(a, r *big.Int) *bn256.G1
- func ScalarMul(p *bn256.G1, k *big.Int) *bn256.G1
- func Sub(a, b *bn256.G1) *bn256.G1
- func Verify(signature Signature, C *bn256.G1) error
- func VerifyPedersenCommitment(C *bn256.G1, proof Proof) error
- func VerifySchnorr(sig SchnorrSignature, publicKey *bn256.G1, m *big.Int) error
- func X(p *bn256.G1) *big.Int
- func Y(p *bn256.G1) *big.Int
- type Proof
- type SchnorrSignature
- type Signature
Constants ¶
This section is empty.
Variables ¶
var G *bn256.G1
var H *bn256.G1
var Hash func(...[]byte) *big.Int = defaultHash
Hash function that should return the value in Curve.N field
Functions ¶
func PedersenCommitment ¶
PedersenCommitment creates *bn256.G1 with pedersen commitment aH + rG
func VerifyPedersenCommitment ¶
VerifyPedersenCommitment - verifies proof that C commitment commits the value in [0..2^n-1]
func VerifySchnorr ¶
Types ¶
type Proof ¶
func CreatePedersenCommitment ¶
CreatePedersenCommitment - creates Pedersen commitment for given val, and generates proof that given val lies in [0..2^n-1]. Returns Proof, generated commitment and private key in case of success generation.
Source Files