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
The current proving process in scroll-prover appears to handle transactions sequentially, which may be a bottleneck for more complex proofs. I suggest exploring parallelization techniques, particularly by offloading certain proof-generation steps, such as FFTs or polynomial commitments, to multiple cores or even GPUs. Implementing this could significantly reduce proving time for batch transactions. I’d be happy to assist with initial benchmarking or testing parallelization methods to assess potential performance gains.
The text was updated successfully, but these errors were encountered:
The current proving process in scroll-prover appears to handle transactions sequentially, which may be a bottleneck for more complex proofs. I suggest exploring parallelization techniques, particularly by offloading certain proof-generation steps, such as FFTs or polynomial commitments, to multiple cores or even GPUs. Implementing this could significantly reduce proving time for batch transactions. I’d be happy to assist with initial benchmarking or testing parallelization methods to assess potential performance gains.
The text was updated successfully, but these errors were encountered: