FRI uses barycentric formula to evaluate poly #140
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
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.
This PR optimizes the polynomial evaluation in FRI using the Barycentric formula (in coset) with linear complexity without Lagrange interpolation. The performance of generating a proof in python is twice that of the Lagrange one. Below is the perf number on my machine (MacBook):
Degree = 4096, Values = 16384
Before: 0.2776
After: 0.1437s
Degree = 4096, Values = 65536
Before: 1.0076s
After: 0.5226s
The performance gain may be larger if we reduce g(x, x^n) = f(x) with n = 8 or larger.