bench: add sum-of-40 sumcheck benchmark#85
Open
albert-garreta wants to merge 5 commits intomainfrom
Open
Conversation
Forward the simd feature from zinc-piop to zinc-poly, enabling SIMD-optimized binary polynomial operations (NEON/AVX512) when building the PIOP crate with --features simd.
Add a new benchmark that measures prover and verifier performance for the
relation sum_x eq(x,r) * sum_{i=1}^{40} a_i(x) = 0, where the a_i's are
randomly sampled MLEs over BinaryPoly<32>.
This complements the existing simple product benchmark with a more
realistic multi-polynomial linear combination sumcheck.
albert-garreta
requested review from
NiDimi,
cupicmarko and
frozenspider
as code owners
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
1 participant
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.
Summary
Add a new sumcheck benchmark that measures prover and verifier performance for the relation:
35331\sum_x \text{eq}(x, r) \cdot \sum_{i=1}^{40} a_i(x) = 035331
where the$a_i$ 's are 40 randomly sampled MLEs over
BinaryPoly<32>.Details
Sum-of-40 Sumcheck Prover): timesRFSumcheck::prove_as_subprotocolwith 40 input polynomials and a linear combination function.Sum-of-40 Sumcheck Verifier): timesRFSumcheck::verify_as_subprotocolon the resulting proof.MontyField<3>(192-bit) andMontyField<4>(256-bit) with witness sizes from