-
Notifications
You must be signed in to change notification settings - Fork 11
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
Document optimizations #43
Comments
This was referenced Jul 20, 2023
The sum optimization is now added via an RFC PR. |
CjS77
pushed a commit
that referenced
this issue
Jul 21, 2023
Several of the optimizations used in this implementation are documented in [Tari RFC-0181](https://rfc.tari.com/RFC-0181_BulletproofsPlus.html). This PR adds a documentation link to this RFC to make it easier to find. Closes [issue 43](#43).
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The codebase includes optimizations from the Bulletproofs+ preprint that may not be obvious to a reviewer. These should be better documented.
One optimization is batch verification, which is described only informally in the preprint. This is described in more detail in RFC-0181, which should be linked.
Another optimization is to the vector
d
, whose entries and sum are computed efficiently. This should also be documented.The text was updated successfully, but these errors were encountered: