Evaluating Compiler Optimization Impacts on zkVM Performance
Thomas Gassmann, Stefanos Chaliasos, Thodoris Sotiropoulos, Zhendong Su

TL;DR
This paper systematically evaluates how compiler optimizations affect zero-knowledge virtual machine performance, revealing that tailored compiler passes can significantly improve proof generation efficiency.
Contribution
First comprehensive analysis of compiler optimization impacts on zkVMs, leading to refined passes that enhance zkVM execution and proof times.
Findings
Standard LLVM optimizations improve zkVM performance by over 40%.
zkVM-aware pass refinements can boost execution time by up to 45%.
Optimizations yield consistent proof-time improvements.
Abstract
Zero-knowledge proofs (ZKPs) are the cornerstone of programmable cryptography. They enable (1) privacy-preserving and verifiable computation across blockchains, and (2) an expanding range of off-chain applications such as credential schemes. Zero-knowledge virtual machines (zkVMs) lower the barrier by turning ZKPs into a drop-in backend for standard compilation pipelines. This lets developers write proof-generating programs in conventional languages (e.g., Rust or C++) instead of hand-crafting arithmetic circuits. However, these VMs inherit compiler infrastructures tuned for traditional architectures rather than for proof systems. In particular, standard compiler optimizations assume features that are absent in zkVMs, including cache locality, branch prediction, or instruction-level parallelism. Therefore, their impact on proof generation is questionable. We present the first…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
