Feat: bound ec sum in ecc quark prover #1130
Open
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
1 task
github-merge-queue bot
pushed a commit
that referenced
this pull request
Nov 13, 2025
# Summary We want to prove multiple instances of a circuit in a single shard. For example, in the case of `ShardRam` circuit, the 0-th shard often has ~2M records which is too large to fit in GPU memory. - [ ] #1130 --------- Co-authored-by: sm.wu <[email protected]>
3 tasks
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.
Issue
Our current quark-based ec summation protocol only ensures the sum of
Npoints encoded in 14 multivariate polynomials is stored at(xs[1,...,1,0], ys[1,...,1,0]).But we did not export it.
This implies the
sumfield in theEccQuarkProofcan be manipulated.Summary