Benchmarking ZK-Circuits in Circom

ePrint Report: Benchmarking ZK-Circuits in Circom

Colin Steidtmann, Sanjay Gollapudi

Zero-knowledge proofs and arithmetic circuits are essential building blocks in modern cryptography, but comparing their efficiency across different implementations can be challenging. In this paper, we address this issue by presenting comprehensive benchmarking results for a range of signature schemes and hash functions implemented in Circom, a popular circuit language that has not been extensively benchmarked before. Our benchmarking statistics include prover time, verifier time, and proof size, and cover …

address cryptography efficiency eprint report functions hash hash functions issue knowledge report results signature