Bulletproofs are short non-interactive zero-knowledge proofs that require no trusted setup
-
Updated
Dec 25, 2022 - Haskell
Bulletproofs are short non-interactive zero-knowledge proofs that require no trusted setup
Zero Knowledge (ZK) toolkit for generating and verifying IETF VRF, Pedersen VRF and Ring Proofs
Go collection of zero knowledge proofs of equality using elliptic curve cryptography
This example generates a random secret key and ordinal value, creates a Pedersen commitment using secp256k1, generates a Bulletproof using secp256k1_bulletproofs, encodes the data as a hex string, adds it as an output to a Bitcoin transaction, and broadcasts it to the network. Note that this is a simplified example and should not be used without ad
Pedersen's Protocol - Demo
The LostAtom Protocol is a zero-knowledge anonymous ATOMic payment system built on Solana that provides complete transaction privacy without requiring a trusted setup. The protocol uses Pedersen commitments, Bulletproofs, and Schnorr signatures to enable anonymous transfers while maintaining the performance characteristics of the Solana
Browser-based zero-knowledge range proofs using Bulletproofs on ristretto255 — 64-bit commitments, aggregate proofs, inner-product argument, and tamper-rejection demo. Part of crypto-lab.
Sharp: Short Relaxed Range Proofs
Continuum Ghost — Zero-Knowledge Proof Authentication for APIs (Apache 2.0)
A zero-knowledge and transparent proximity marketing platform using Hyperledger Fabric.
Pedersen commitment range proofs on secp256k1 — prove a value is in range without revealing it
Build a complete AI agent workflow from idea to production with a clear system for planning, coding, and delivery
Add a description, image, and links to the pedersen-commitment topic page so that developers can more easily learn about it.
To associate your repository with the pedersen-commitment topic, visit your repo's landing page and select "manage topics."