Expose Pippenger multiplication for combining multiple sigs of same msg #178
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
In many use cases, there are multiple signatures of the same message, e.g., Ethereum attestations often share the signed `AttestationData`. For that situation, `blst` started exposing Pippenger multiplication to accelerate this use case. Multiscalar multiplication is much faster than individual scalar multiplication of each signature / pubkey. Further optimizations may be achieved with parallel tiling, see the Rust binding code in the `npoints >= 32` situation: - https://github.com/supranational/blst/blob/v0.3.13/bindings/rust/src/pippenger.rs Likewise, multiple pubkeys / signatures may be loaded simultaneously using the new `blst` APIs. We don't do either of these additional optimizations as our architecture does not readily support them. Pippenger multiplication alone already offers a significant speedup until prioritizing further optimizations. ``` ------------------------------------------------------------------------------------------------------------------------------------ BLS verif of 6 msgs by 6 pubkeys 117.232 ops/s 8530098 ns/op 20471994 cycles BLS verif of 6 sigs of same msg by 6 pubkeys (with blinding) 553.186 ops/s 1807711 ns/op 4338371 cycles BLS verif of 6 sigs of same msg by 6 pubkeys 724.279 ops/s 1380683 ns/op 3313617 cycles ------------------------------------------------------------------------------------------------------------------------------------ BLS verif of 60 msgs by 60 pubkeys 11.131 ops/s 89839743 ns/op 215615251 cycles BLS verif of 60 sigs of same msg by 60 pubkeys (with blinding) 238.059 ops/s 4200634 ns/op 10081380 cycles BLS verif of 60 sigs of same msg by 60 pubkeys 680.634 ops/s 1469219 ns/op 3526031 cycles ------------------------------------------------------------------------------------------------------------------------------------ BLS verif of 180 msgs by 180 pubkeys 3.887 ops/s 257298895 ns/op 617517127 cycles BLS verif of 180 sigs of same msg by 180 pubkeys (with blinding) 166.340 ops/s 6011785 ns/op 14428186 cycles BLS verif of 180 sigs of same msg by 180 pubkeys 536.938 ops/s 1862413 ns/op 4469689 cycles ------------------------------------------------------------------------------------------------------------------------------------ ```
etan-status
added a commit
to status-im/nim-kzg4844
that referenced
this pull request
Aug 16, 2024
When both `nim-kzg4844` and `nim-blscurve` are used, have to ensure that APIs related to Pippenger multiplication are patched consistently across both libraries. - status-im/nim-blscurve#178
etan-status
added a commit
to status-im/nim-kzg4844
that referenced
this pull request
Aug 16, 2024
When both `nim-kzg4844` and `nim-blscurve` are used, have to ensure that APIs related to Pippenger multiplication are patched consistently across both libraries. - status-im/nim-blscurve#178
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.
In many use cases, there are multiple signatures of the same message, e.g., Ethereum attestations often share the signed
AttestationData.For that situation,
blststarted exposing Pippenger multiplication to accelerate this use case. Multiscalar multiplication is much faster than individual scalar multiplication of each signature / pubkey.Further optimizations may be achieved with parallel tiling, see the Rust binding code in the
npoints >= 32situation:Likewise, multiple pubkeys / signatures may be loaded simultaneously using the new
blstAPIs.We don't do either of these additional optimizations as our architecture does not readily support them. Pippenger multiplication alone already offers a significant speedup until prioritizing further optimizations.