Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

ZeroOverK: compute F_prime polynomial in the evaluation domain #16

Open
nmohnblatt opened this issue Aug 25, 2022 · 0 comments
Open

ZeroOverK: compute F_prime polynomial in the evaluation domain #16

nmohnblatt opened this issue Aug 25, 2022 · 0 comments
Labels
enhancement New feature or request

Comments

@nmohnblatt
Copy link
Collaborator

zero_over_k/piop/prover.rs: line 237: this function currently computes F_prime from polynomials in coefficient form and performs an FFT/iFFT pair each time we multiply polynomials. Instead we would like a similar function that computes everything in the evaluation domain and computes only one iFFT at the end
@nmohnblatt nmohnblatt added the enhancement New feature or request label Aug 25, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@nmohnblatt