Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: range proof proving efficiency #106

Merged
merged 3 commits into from
Sep 14, 2023
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions src/RFC-0181_BulletproofsPlus.md
Original file line number Diff line number Diff line change
Expand Up @@ -253,6 +253,12 @@ This means single-proof verification has $b = 1$.

Verification in Bulletproofs+ is slightly faster than in Bulletproofs.

### Proving efficiency

It is more challenging to compare proving efficiency, since generation of a range proof does not reduce cleanly to a single multiscalar multiplication evaluation for either Bulletproofs or Bulletproofs+ range proofs.
However, we note that the overall complexity between the inner-product arguments in the proving systems is similar in terms of group operations; outside of these inner-product arguments, Bulletproofs+ requires fewer group operations.
Overall efficiency is likely to depend on specific optimizations.

AaronFeickert marked this conversation as resolved.
Show resolved Hide resolved
## Changelog

| Date | Change | Author |
Expand All @@ -261,3 +267,4 @@ Verification in Bulletproofs+ is slightly faster than in Bulletproofs.
| 13 Jan 2022 | Performance updates | brianp |
| 20 Jul 2023 | Sum optimization | Aaron |
| 31 Jul 2023 | Notation and efficiency | Aaron |
| 3 Aug 2023 | Proving efficiency note | Aaron |
Loading