Home > Resources > papers > KMN23-Sigmabus
Sigmabus: Binding Sigmas in Circuits for Fast Curve Operations (Kadianakis, Maller, Novakovic 2023)¶
Last modified: 2026-10-27
Summary¶
Moves expensive elliptic-curve scalar multiplications out of the SNARK circuit: a Sigma protocol proves the group operation outside the circuit, and a small in-circuit check binds it to the circuit's witness. This cuts constraint counts for statements that involve curve operations. Cited in BL26-SoK-AnonCreds as an example of tailoring proof systems by moving costly sub-proofs out of the circuit.
Related resources¶
- Beyond the Circuit: How to Minimize Foreign Arithmetic in ZKP Circuits (OrrĂ¹, Kadianakis, Maller, Zaverucha 2025) (paper, 2025)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
- SoK: Anonymous Credentials for Digital Identity Wallets (Bormann, Lehmann 2026) (paper, 2026)