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

cost.rs for proving time? #749

Open
Divide-By-0 opened this issue Mar 16, 2023 · 0 comments · May be fixed by #753
Open

cost.rs for proving time? #749

Divide-By-0 opened this issue Mar 16, 2023 · 0 comments · May be fixed by #753
Assignees
@therealyingtong
Labels
A-dev-tooling Area: Developer tooling

Comments

@Divide-By-0
Copy link

Divide-By-0 commented Mar 16, 2023 •
edited
Loading

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?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@therealyingtong therealyingtong

Labels
A-dev-tooling Area: Developer tooling
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

dev::cost: Estimate prover work for a given circuit zcash/halo2
2 participants
@Divide-By-0 @therealyingtong