Paper 2025/065
Morgana: a laconic circuit builder
Abstract
We construct a novel SNARK proof system, Morgana. The main property of our system is its small circuit keys, which are proportional in size to the description of the circuit, rather than to the number of constraints. Previously, a common approach to this problem was to first construct a universal circuit (colloquially known as a zk-VM), and then simulate an application circuit within it. However, this approach introduces significant overhead. Our system, on the other hand, results in a direct speedup compared to Spartan, the state-of-the-art SNARK for R1CS. Additionally, small circuit keys enable the construction of zk-VMs from our system through a novel approach: first, outputting a commitment to the circuit key, and second, executing our circuit argument for this circuit key.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- zero-knowledge proofszero-knowledge virtual machinesumcheck protocol
- Contact author(s)
-
0xdeadfae @ gmail com
yarebenko @ gmail com - History
- 2025-01-17: approved
- 2025-01-16: received
- See all versions
- Short URL
- https://ia.cr/2025/065
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/065,
author = {Lev Soukhanov and Yaroslav Rebenko},
title = {Morgana: a laconic circuit builder},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/065},
year = {2025},
url = {https://eprint.iacr.org/2025/065}
}
