Conversation
jordanschalm
approved these changes
Mar 20, 2025
peterargue
approved these changes
Mar 20, 2025
This file contains hidden or 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
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.
closes #17
Use Pippenger multi scalar multiplication for E1 points for a faster threshold signature reconstruction (40-50% faster depending on the threshold value).
Example of
BenchmarkSignatureReconstructionwith a threshold of 40 (on an apple M3 arm64):Naive MSM:
Pippenger MSM:
Note: computing E2 public keys from the verification vector in Feldman VSS was not updated to use Pippenger MSM in E2. The current method was compared in timing against Pippenger and turns out to be faster. The current method leverages the polynomial particular case where the degree can be incrementally computed. It also takes advantage of the polynomial input being a small scalar (less than 8 bits).