-
Notifications
You must be signed in to change notification settings - Fork 46
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
mm_pure_arith takes about 30 seconds to prove #50
Comments
You may be running in to a known issue in which the setup step for the database required by computations which make use of the merkle-tree based storage primitives takes an unusually long time. As a workaround, for computations like matrix multiplication, which don't require these primitives, you can try commenting out these lines and re-compiling the prover and verifier: pequin/pepper/libv/computation_p.cpp Line 36 in b0fb3ec
pequin/pepper/libv/computation_p.cpp Lines 80 to 83 in b0fb3ec
Of course, long term, it would be preferable to detect whether the computation requires this setup step and only execute these lines conditionally. For reference, on the latest commit (
Note that the actual call to |
It sounds unreasonably long time. Can you please share your benchmarks so I will know if there's something wrong with my machine?
The text was updated successfully, but these errors were encountered: