test: sample-ext cycles #8
Closed
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
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.
TLDR
To optimise the number of cycles in sumcheck verification.
Background
In sumcheck verification, we are sampling several extension field elements (
sample_ext). The existing approach is to sample 4 field elements, then construct aSymbolicExtusing them and evaluate this expression. This results in 43 cycles for each call toext_from_base_slice.Approach
We introduce a new variant in the DSL IR instructions
ExtFromBaseVecthat bypasses the expression evaluation approach and instead directly usesAsmInstruction::CopyFto an uninitialised extension field element using the 4 sampled field elements.Dependency
https://github.com/scroll-tech/openvm/tree/ceno-recursion
Bench
TODO