[perf] KZG verify #220
Merged
[perf] KZG verify #220
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
On gnark side Consensys/gnark#342 |
|
Q: why the refactor |
|
I added on gnark-crypto a function ScalarMulUnconverted that takes an affine point and outputs a Jacobian to get rid of an unnecessary conversion (inverse) in KZG verifier. So ScalarMultiplicationUnconverted is too long ^^ and also in std/ we use ScalarMul so that is coherent. |
ThomasPiellard
approved these changes
Jul 21, 2022
|
Mmhh accidentally merged too fast I think, not that the name change is big, but it impacts user of the lib for no big reasons. |
Merged
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
KZG verification algorithm consists in some scalar multiplications and then a pairing computation. The scalar multiplications are best implemented using Jacobian coordinates while the pairing is best implemented using mixed affine and projective coordinates. The
ScalarMul()API makes unnecessary conversions between affine and Jacobians which costs some unnecessary inverses. Few solutions:ScalarMul()functions that takes an affine point and returns a Jacobian.[ ] Implementing the pairing with only projective coordinates and implementing theScalarMul()in projective too (no conversions at all). This is implemented inperf/kzg-verify-projbranch but it is worth it only if the Hamming weight of the Miller loop size is less than 6 (perf threshold for mixed add/dbl vs. proj add/dbl). This is not the case for the curve in gnark-crypto. Also it duplicates the pairing code.BatchFromJacobian()functions that takes elements from both G1 (Fp) and G2 (Fp2 or Fp4).