-
Notifications
You must be signed in to change notification settings - Fork 17
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
feat: range proof proving efficiency #106
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for the addition. I would add in the numbers as we have it.
b5c6ca8
to
054dd8c
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
One comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
ACK
Description --- Adds a brief note about range proof proving efficiency. Adds rough benchmarks against Bulletproofs. Motivation and Context --- It was [suggested](#103 (comment)) to add information about proving efficiency to range proof [RFC-0181](https://rfc.tari.com/RFC-0181_BulletproofsPlus.html). Quantifying proving efficiency is more subtle than verification efficiency, since proof generation doesn't reduce to a multiscalar multiplication operation and requires a variable number of rounds. Instead of bogging down the RFC with a long list of group element operation counts, this PR adds a more general note. Informal benchmark comparing the [Tari implementation](https://github.com/tari-project/bulletproofs-plus) to the [corresponding Bulletproofs fork](https://github.com/tari-project/bulletproofs) are included. How Has This Been Tested? --- The changes build and appear to render correctly.
Description
Adds a brief note about range proof proving efficiency. Adds rough benchmarks against Bulletproofs.
Motivation and Context
It was suggested to add information about proving efficiency to range proof RFC-0181.
Quantifying proving efficiency is more subtle than verification efficiency, since proof generation doesn't reduce to a multiscalar multiplication operation and requires a variable number of rounds. Instead of bogging down the RFC with a long list of group element operation counts, this PR adds a more general note.
Informal benchmark comparing the Tari implementation to the corresponding Bulletproofs fork are included.
How Has This Been Tested?
The changes build and appear to render correctly.