You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am wondering where I can find benchmarks on the performance of libSTARK? For example, what is the prover and verifier time under various constraint sizes from 2^10 ~ 2^20?
Some profiling like the following picture would be highly appreciated.
Thanks,
Boyuan
The text was updated successfully, but these errors were encountered:
Hi,
libSTARK is not really under maintenance any longer. Moreover, in the
context of STARKs gate sizes are not quite the right measure, though the
STARK whitepaper does attempt to do a back-of-envelope comparison of STARK
based computation size and gate count in other systems (like R1CS based
systems).
Best
Eli
Thanks for this great work!
I am wondering where I can find benchmarks on the performance of libSTARK? For example, what is the prover and verifier time under various constraint sizes from 2^10 ~ 2^20?
Some profiling like the following picture would be highly appreciated.
![image](https://user-images.githubusercontent.com/23176869/153933824-803da35c-be43-497e-ae7e-aec15670eb3c.png)
Thanks,
Boyuan
The text was updated successfully, but these errors were encountered: