Beyond the circuit: How to Minimize Foreign Arithmetic in ZKP Circuits

ePrint Report: Beyond the circuit: How to Minimize Foreign Arithmetic in ZKP Circuits

Michele Orrù, George Kadianakis, Mary Maller, Greg Zaverucha

Zero-knowledge circuits are frequently required to prove gadgets that are not optimised for the constraint system in question. A particularly daunting task is to embed foreign arithmetic such as Boolean operations, field arithmetic, or public-key cryptography.


We construct techniques for offloading foreign arithmetic from a zero-knowledge circuit including:
(i) equality of discrete logarithms across different groups;
(ii) scalar multiplication …

beyond eprint report gadgets knowledge prove question report system task zkp