feat: prover optimization for factorizable sumcheck #218
Conversation
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
univariate skip will be handled in a follow up PR to do zerocheck and logup separately
jonathanpwang
force-pushed
the
feat/zerocheck-eq-optimization
branch
from
fac6ff6 to
7869dbc
Compare
jonathanpwang
changed the title
jonathanpwang
pushed a commit
that referenced
this pull request
Jan 13, 2026
jonathanpwang
added a commit
that referenced
this pull request
Jan 13, 2026
This is the `eq` optimization pointed out in Gruen Section 3.2, with small generalization to front-loaded batch sumcheck. This reduces the degree of the polynomial the prover evaluates by 1. The univariate skip round 0 is also handled, where zerocheck and logup are handled separately. We will make a separate optimization around the quotient polynomial for zerocheck in a follow up PR. towards INT-5804
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.
This is the
eqoptimization pointed out in Gruen Section 3.2, with small generalization to front-loaded batch sumcheck. This reduces the degree of the polynomial the prover evaluates by 1.The univariate skip round 0 is also handled, where zerocheck and logup are handled separately. We will make a separate optimization around the quotient polynomial for zerocheck in a follow up PR.
towards INT-5804