Home > Resources > papers > OKMZ25-Beyond-Circuit
Beyond the Circuit: How to Minimize Foreign Arithmetic in ZKP Circuits (OrrĂ¹, Kadianakis, Maller, Zaverucha 2025)¶
Last modified: 2026-10-27
Summary¶
Gives techniques for embedding "foreign" arithmetic (operations modulo a different prime than the constraint system's field, such as Boolean operations, non-native fields or public-key operations) in zero-knowledge efficiently. It covers equality of discrete logs across groups, scalar multiplication without in-circuit elliptic-curve operations, and proofs of AES encryption, combining rejection sampling, Sigma protocols and lookups. Directly relevant to ECDSA-P256 holder binding, where non-native curve arithmetic dominates circuit cost. Published in IACR Communications in Cryptology 2025.
Related resources¶
- Proofs of discrete logarithm equality across groups (Chase, OrrĂ¹, Perrin, Zaverucha 2022) (paper, 2022)
- Sigmabus: Binding Sigmas in Circuits for Fast Curve Operations (Kadianakis, Maller, Novakovic 2023) (paper, 2023)
- SoK: Anonymous Credentials for Digital Identity Wallets (Bormann, Lehmann 2026) (paper, 2026)