-
Notifications
You must be signed in to change notification settings - Fork 123
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: Implement KZG multiproof #406
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.
Looks pretty good. I have only cosmetic comments and questions.
(evals_cm.into_group() - commitment.0.into_group()) | ||
.into_affine() | ||
.into(), | ||
proof.proof.into(), | ||
]; | ||
let pairing_inputs_r: Vec<E::G2Prepared> = vec![srs.h.into(), vanish_cm.into()]; |
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.
Lots of conversion here back-and-forth between affine and projective forms. Is all this conversion necessary?
@ggutoski ready for review again, the diff is below: |
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.
👍
Description
closes: #387
Implement the KZG multiproof algorithm described in https://dankradfeist.de/ethereum/2020/06/16/kate-polynomial-commitments.html.
Since we assume that the number of opening points is small, we do not implement the fancy algorithm described in #387
Before we can merge this PR, please make sure that all the following items have been
checked off. If any of the checklist items are not applicable, please leave them but
write a little note why.
Pending
section inCHANGELOG.md
Files changed
in the GitHub PR explorer