Optimize composition polynomial commitment to remove extra clones #1051
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.
Refactor crates/provers/stark/src/prover.rs commit_composition_polynomial to construct final Merkle leaf rows in a single pass using reverse_index(2i) and reverse_index(2i+1) for each part, removing the previous transpose + bit-reverse + merge pipeline and eliminating redundant allocations and clones; this preserves the exact leaf ordering and the opening contract used by open_composition_poly and the verifier so commitments, proofs, and outputs remain unchanged while reducing memory traffic and improving performance for large LDE domains.