Pedersen Commitment
Definition
A Pedersen commitment is a cryptographic scheme that hides a value while binding the committer to it. The commitment reveals nothing about the value, but once opened, the committer cannot claim a different value. It enables confidential transactions with verifiable mathematics.
Technical Explanation
Commitment: C = vG + rH where v is the value, r is a random blinding factor, and G/H are elliptic curve generators with unknown discrete log relationship. Hiding: C reveals nothing about v. Binding: finding different (v', r') producing the same C requires breaking discrete log.
Key property for cryptocurrencies: commitments are additively homomorphic. C(v1) + C(v2) = C(v1 + v2). This enables verifying that transaction inputs equal outputs without revealing amounts—fundamental to RingCT and similar confidential transaction schemes.
SynX Relevance
SynX uses Pedersen commitments to hide transaction amounts while proving correctness. Network validators verify inputs equal outputs plus fees without seeing values. Amount privacy with mathematical certainty of no inflation.
Frequently Asked Questions
- How can you verify hidden amounts?
- Homomorphic properties let you verify equations on commitments without knowing values.
- Are Pedersen commitments quantum-resistant?
- Standard Pedersen relies on discrete log—quantum vulnerable. Post-quantum alternatives exist.
- Can I ever see the amounts?
- Only with the blinding factors—which only transaction participants know.
Hidden values, proven correctness. Private with SynX