Optimize polynomial out of domain evaluation #32
Conversation
This file contains 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
jarnesino
force-pushed
the
optimize-poly-eval-out-of-domain
branch
from
a3b7103 to
a32acb1
Compare
- This iteration of the optimization assumes all polynomials are of equal size and will be evaluated in the same list of points. It has an assertion to avoid its accidental misuse. - It has the corresponding tests. - It has the corresponding benchmark.
jarnesino
force-pushed
the
optimize-poly-eval-out-of-domain
branch
from
a32acb1 to
6459241
Compare
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.
Parallelize the evaluations of many polynomials at an out of domain points.
Assuming all polys will be evaluated at one unique point in particular.
It's especially useful for wide traces. For instance, it performs ~75% faster for wide Fibonacci of 2^10 columns, each of size 2^16.