-
Notifications
You must be signed in to change notification settings - Fork 496
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.
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
cost.rs for proving time? #749
Labels
A-dev-tooling
Area: Developer tooling
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Is it possible to formalize the knowledge about the number of FFTs and MSMs for each type of gate/lookup/permutation check etc as Ye explains into the cost.rs file for optimizing proving time (instead of proof size as it is right now), along with the breakdown of the # of FFTs, MSMs, and poly evaluations for each gate/lookup in my code so I can optimize that?
The text was updated successfully, but these errors were encountered: