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
While exploring prover-side performance in zkEVM, I’ve noticed potential bottlenecks in handling large proof sizes, particularly when multiple commitments are required. I suggest exploring incremental SNARK generation techniques or parallelizing certain components of the circuit to improve the overall efficiency. Additionally, incorporating a dynamic memory allocation approach could significantly reduce prover time. Would love to collaborate on exploring these potential optimizations further.
The text was updated successfully, but these errors were encountered:
While exploring prover-side performance in zkEVM, I’ve noticed potential bottlenecks in handling large proof sizes, particularly when multiple commitments are required. I suggest exploring incremental SNARK generation techniques or parallelizing certain components of the circuit to improve the overall efficiency. Additionally, incorporating a dynamic memory allocation approach could significantly reduce prover time. Would love to collaborate on exploring these potential optimizations further.
The text was updated successfully, but these errors were encountered: