You are here:
< All Topics

Bulletproofs are a specific zero-knowledge proof system invented by Benedikt Bünz et al. Bulletproofs are very short, i.e. only logarithmic in the size of the proven statement. Findora’s application of Bulletproofs are between 0.5 KB and 2 KB. Unlike pairing-based zk-SNARKs, Bulletproofs do not rely on a trusted and complex setup, but are slower to verify. Bulletproofs can also be combined with sigma protocols to enable proofs about algebraic statements. This is particularly useful for proofs of committed values.

Table of Contents
Scroll to Top