Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Confidential Transactions |
|---|---|
| What the text proposes | Hide the amounts on a Bitcoin-style transaction with Pedersen commitments, and use range proofs so a commitment cannot stand for a negative number. The graph of who paid whom stays visible. |
| Who may write | Gregory Maxwell |
| What is settled | Commit to each amount. Publish the commitment, not the amount. |
| Load-bearing assumption | Hiding amounts does not hide counterparties. |
| What this library says afterwards | Range proofs in the original form are large. Bulletproofs are a later compression. |
| Rights | Official external source only |