Bulletproofs: Short Proofs for Confidential Transactions and More introduced compact zero-knowledge proofs without a trusted setup. The preprint appeared in 2017 and the paper was published at IEEE Security and Privacy in 2018. Its central application is proving bounds on hidden transaction amounts. [1]
Overview
A zero-knowledge proof can establish a fact about a secret without revealing it. In confidential transactions, range proofs establish that hidden amounts satisfy an allowed numerical bound. They form one part of a transaction’s validity checks; amount privacy also needs commitments and other protocol components. Monero uses range proofs within RingCT. [5]
Key Contributions
Range proofs without a setup ceremony
Write a Pedersen commitment as C = vG + rH. A range proof establishes 0 ≤ v < 2n without disclosing the committed amount v. Bulletproofs uses an inner-product argument, the discrete-logarithm assumption, and Fiat–Shamir challenges. The paper also extends its construction to arithmetic circuits. [2]
Small proofs with real computational costs
For one n-bit range proof, the paper gives 2 log₂(n) + 9 group and field elements. Proving and verification take linear work in n; a logarithmic proof length does not make verification logarithmic. Aggregation adds logarithmic proof-size overhead for additional commitments. Batch verification instead checks multiple proofs together. [8]
Dalek’s documented encoding uses 32 × (9 + 2 log₂(nm)) bytes for m aggregated values, with n and m powers of two. At n = 64, this gives 672 bytes for one value or 736 for two. These are proof-data sizes, excluding the value commitments and other transaction data, rather than universal Monero transaction sizes. [4]
Authors
The authors are Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. Stanford’s project page lists Bünz and Boneh at Stanford, Bootle at University College London, and Poelstra and Wuille at Blockstream. These affiliations describe the research context, not necessarily their current employers. [3]
Historical Context
- November 10, 2017: IACR received the preprint. Its latest listed revision, April 14, 2022, notes a Fiat–Shamir correction. [1]
- October 18, 2018: Monero’s network update enabled Bulletproofs, following the v0.13.0 release announcement on October 11. [6]
- December 24, 2020: Monero discussed Bulletproofs+, a later construction with smaller range proofs. That announcement describes implementation work, not the original paper or an activation date. [7]
Common Misconceptions
- “Bulletproofs replaced Monero’s transaction ring signatures.” Its deployment replaced earlier range proofs within RingCT; other mechanisms address sender privacy. [5]
- “No trusted setup means no security assumptions.” The construction still depends on cryptographic assumptions and correct implementation. A range proof alone is not a complete exchange solvency audit. [2]
- “The paper is public domain.” The current IACR record specifies CC BY 4.0. The author-hosted PDF does not state an explicit reuse license; software licenses must be checked separately. [1]
Last updated: October 8, 2026.
Related Terms
- Zero-Knowledge Proof — proving facts without revealing the underlying secret.
- Monero (XMR) — a cryptocurrency that adopted Bulletproofs range proofs.
See Also
- Ring Confidential Transactions — the broader transaction construction.
- Zerocash paper — a different approach to private payments.
Sources
- Bünz et al. IACR ePrint 2017/1066 — publication record, abstract, revision history, and listed license.
- Bünz et al. Author-hosted research PDF — commitment construction, assumptions, and applications; consult IACR for later revisions.
- Stanford Applied Crypto Group. Bulletproofs project page — researchers and historical affiliations.
- Dalek Cryptography. Aggregated range-proof protocol documentation — encoding and proof-size formula.
- Monero Project. Moneropedia: Bulletproofs — range proofs and RingCT context.
- Riccardo Spagni, October 11, 2018. Monero v0.13.0 release — the October 18 network update.
- Sarang Noether, December 24, 2020. Bulletproofs+ in Monero — later range-proof research and implementation context.
- Dan Boneh. Stanford publication abstract — proof complexity, aggregation, and batch verification.