wire format#100
Merged
Merged
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
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.
wire format + eq_factored prover
switch to EvalsInfty wire format: prover sends
dvalues per round instead ofd+1.g(1)is derived from the consistency constraintg(0) + g(1) = claim— so consistency is now structural, not checked. ford ≥ 2thedth value is the leading coefficientg(∞)rather than an extra finite evaluation; this is typically the cheapest contribution to compute for product-structured summands (see BDDT25, ePrint 2025/1117).all provers updated. verifier reconstructs
g(r)from{g(0), g(1)=claim-g(0), g(2), ..., g(d-1)}+ leading coef.also adds a new
eq_factoredprover.docs: see docs/design.md §7a.