Verify Bulletproof

WHAT IT DOES

Verify Bulletproof enables you to cryptographically verify Bulletproof range proofs, a zero-knowledge proof system that proves that a secret value lies within a specified range without revealing the value itself. Bulletproofs are unique among zero-knowledge proof systems in that they require no trusted setup, have logarithmic proof size and verification time, and are efficient for range proofs on confidential transactions and private asset transfers. The tool takes a complete Bulletproof proof (including the proof tuple and commitment), a commitment (Pedersen commitment to the secret value), range parameters (minimum and maximum), and a proof variant selection (Bulletproofs or Bulletproofs+), and performs the full verification algorithm to confirm the proof's validity. If the verification succeeds, the tool returns a valid result, confirming that the committed value is within the specified range. This is essential for applications requiring confidential transactions, private asset transfers, and privacy-preserving financial applications without trusted setup.

HOW TO USE

Connect your wallet using the BGWallet connector (required for context). Select your proof variant: Bulletproofs (standard) or Bulletproofs+ (improved efficiency). Select the proof format: "JSON" for structured proof data (recommended) or "Hex" for raw hex-encoded proof components. Enter the Bulletproof proof as a JSON object containing the proof tuple (A, S, T1, T2, tau_x, mu, t_x). Enter the Pedersen commitment as a hex string with 0x prefix. Specify the range minimum and maximum values. Click "Verify Proof" to run the verification. The tool displays the proof variant, format, range, and the verification result: a green "Verified" checkmark if the proof is valid and a red "Invalid" X if it fails. The result includes a detailed explanation of the outcome and the verification status.

TECHNICAL MECHANISM

This tool implements Bulletproof range proof verification using the inner product argument (IPA) protocol. The verification process involves: (1) reconstructing the Pedersen commitment to the secret value from the provided commitment; (2) verifying the inner product argument using the proof tuple (A, S, T1, T2); (3) checking that the challenge points are correctly computed; (4) verifying that the final inner product argument confirms that the committed value is a valid n-bit integer; (5) confirming that the range constraints [min, max] are satisfied. The verification uses the standard Bulletproof verification algorithm with logarithmic-time verification. Bulletproofs+ provides improved verification efficiency with optimized verification equations. The tool uses the R1CS curve (typically secp256k1 or ed25519) for the cryptographic operations, with all computation performed locally in the browser. The verification process does not require a trusted setup and is completely transparent.

WHAT IT CANNOT SEE

This tool cannot verify that the proof corresponds to actual on-chain state or values without additional context—you must ensure the commitment matches the expected value. It does not support all zero-knowledge proof systems (only Bulletproofs). The tool cannot verify proofs without the commitment and range parameters; both are required for verification. It does not support hardware acceleration for verification; all computation is done in software in the browser. The tool cannot verify the correctness of the proof parameters without additional trust assumptions; you must trust the parameter generation. It does not support verification of proofs generated with non-standard curve configurations beyond the standard cryptographic curves. The tool cannot verify proofs for ranges with dynamic parameters; the range parameters must be fixed at proof generation time. It does not support proof aggregation or recursive verification; it only verifies a single range proof. The tool cannot recover the original value from the proof; zero-knowledge proofs reveal only what they are designed to reveal. It does not support all Bulletproofs variants or customized constraints beyond standard range proofs. The verification time scales logarithmically with range size but may be slow for very large ranges (e.g., 64-bit ranges verify in ~0.1-0.5 seconds).

PLEASE NOTE

This tool is designed for developers and users working with Bulletproof range proofs, which are widely used in confidential transactions, private asset transfers, and privacy-preserving financial applications. Bulletproofs require no trusted setup, eliminating the need for multi-party computation ceremonies. The proof size and verification time are logarithmic in the range size, making them practical for large ranges. Bulletproofs+ provides improved efficiency with smaller proof sizes and faster verification. The commitment must be a Pedersen commitment to the secret value using the same generators as the proof. The range parameters must match those used during proof generation—mismatches will cause verification to fail. Always verify proofs from trusted sources using a standard Bulletproof verification library before relying on them in production systems. The verification result proves that the committed value is within the specified range, but it does not prove that the commitment corresponds to any real-world data without additional context. The tool supports standard Bulletproof verification, which is the most widely adopted Bulletproof variant in blockchain applications.