$Proo\varphi$: A ZKP Market Mechanism (2404.06495v5)
Abstract: Zero-knowledge proofs (ZKPs) are computationally demanding to generate. Their importance for applications like ZK-Rollups has prompted some to outsource ZKP generation to a market of specialized provers. However, existing market designs either do not fit the ZKP setting or lack formal description and analysis. In this work, we propose a formal ZKP market model that captures the interactions between users submitting ZKP tasks and provers competing to generate proofs. Building on this model, we introduce $Proo\varphi$, an auction-based ZKP market mechanism. We prove that $Proo\varphi$ is incentive compatible for users and provers, and budget balanced. We augment $Proo\varphi$ with system-level designs to address the practical challenges of our setting, such as Sybil attacks, misreporting of prover capacity, and collusion. We analyze our system-level designs and show how they can mitigate the various security concerns.
- “Credible Auctions: A Trilemma” In Econometrica 88.2 The Econometric Society, 2020, pp. 425–467 DOI: 10.3982/ecta15925
- Moshe Babaioff, Kira Goldner and Yannai A. Gonczarowski “Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets” In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for IndustrialApplied Mathematics, 2020, pp. 2452–2471 DOI: 10.1137/1.9781611975994.150
- “The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade” In Proceedings of the 2018 ACM Conference on Economics and Computation, EC ’18 New York, NY, USA: Association for Computing Machinery, 2018, pp. 373 DOI: 10.1145/3219166.3219203
- “Towards a Functional Fee Market for Cryptocurrencies” arXiv, 2019 DOI: 10.48550/ARXIV.1901.06830
- “Auctions Versus Negotiations” In The American Economic Review 86.1 American Economic Association, 1996, pp. 180–194 URL: http://www.jstor.org/stable/2118262
- “Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols” In International Conference on the Theory and Application of Cryptology and Information Security, 2023, pp. 77–110 Springer
- “The Power of Two-sided Recruitment in Two-sided Markets” arXiv, 2023 DOI: 10.48550/ARXIV.2307.03844
- Shuchi Chawla and Jason D Hartline “Auctions with unique equilibria” In Proceedings of the fourteenth ACM conference on Electronic commerce, 2013, pp. 181–196
- “Hyperplonk: Plonk with linear-time prover and high-degree custom gates” In Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2023, pp. 499–530 Springer
- Hao Chung, Tim Roughgarden and Elaine Shi “Collusion-Resilience in Transaction Fee Mechanism Design”, 2024 arXiv:2402.09321 [cs.GT]
- “Foundations of transaction fee mechanism design” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, pp. 3856–3899 SIAM
- “Approximately efficient double auctions with strong budget balance” In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’16 USA: Society for IndustrialApplied Mathematics, 2016, pp. 1424–1443
- “zk-Bench: A Toolset for Comparative Evaluation and Performance Benchmarking of SNARKs”, Cryptology ePrint Archive, Paper 2023/1503, 2023 URL: https://ia.cr/2023/1503
- “Espresso Sequencer Architecture” Accessed: 2024-04-03, https://docs.espressosys.com/sequencer
- “Barriers to Collusion-resistant Transaction Fee Mechanisms”, 2024 DOI: 10.48550/arXiv.2402.08564
- “Greedy Transaction Fee Mechanisms for (Non-) myopic Miners” In arXiv preprint arXiv:2210.07793, 2022
- “Gas and transaction fees” Accessed: 2024-03-09, https://docs.starknet.io/documentation/architecture_and_concepts/Network_Architecture/fee-mechanism/
- “Gevulot Docs: Economics” Accessed: 2024-04-06, https://docs.gevulot.com/gevulot-docs/network/fees
- “Gevulot Docs: Network Actor” Accessed: 2024-04-06, https://docs.gevulot.com/gevulot-docs/network/provers
- Gur Huberman, Jacob D Leshno and Ciamac Moallemi “Monopoly without a Monopolist: An Economic Analysis of the Bitcoin Payment System” In The Review of Economic Studies 88.6, 2021, pp. 3011–3040 DOI: 10.1093/restud/rdab014
- “Introducing Gevulot” Accessed: 2024-04-06, https://gevulot.com/introducing-gevulot/
- Ron Lavi, Or Sattath and Aviv Zohar “Redesigning Bitcoin’s Fee Market” In The World Wide Web Conference, WWW ’19 New York, NY, USA: Association for Computing Machinery, 2019, pp. 2950–2956 DOI: 10.1145/3308558.3313454
- “Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs” Publication info: Published elsewhere. S&P 2024, 2023 URL: https://eprint.iacr.org/2023/1271
- R.Preston McAfee “A dominant strategy double auction” In Journal of Economic Theory 56.2 Elsevier BV, 1992, pp. 434–450 DOI: 10.1016/0022-0531(92)90091-u
- “Mina Whitepaper” Accessed: 2024-04-04, https://minaprotocol.com/wp-content/uploads/economicsWhitepaper.pdf
- Roger B Myerson and Mark A Satterthwaite “Efficient mechanisms for bilateral trading” In Journal of Economic Theory 29.2 Elsevier BV, 1983, pp. 265–281 DOI: 10.1016/0022-0531(83)90048-0
- “=nil; Proof Market” Accessed: 2023-10-09, https://docs.nil.foundation/proof-market/market/economics
- David C. Parkes, Jayant Kalagnanam and Marta Eso “Achieving budget-balance with Vickrey-based payment schemes in exchanges” In Proceedings of the 17th International Joint Conference on Artificial Intelligence - Volume 2, IJCAI’01 San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2001, pp. 1161–1168 DOI: 10.5555/1642194.1642250
- Simon Parsons, Juan A. Rodriguez-Aguilar and Mark Klein “Auctions and bidding: A guide for computer scientists” In ACM Comput. Surv. 43.2 New York, NY, USA: Association for Computing Machinery, 2011 DOI: 10.1145/1883612.1883617
- Robert S Pindyck “Microeconomics”, 2018
- “Polygon zkEVM Protocol” Accessed: 2023-10-09, https://wiki.polygon.technology/docs/zkevm/protocol/protocol-components/
- “Request for Comments: Aztec Sequencer Selection and Prover Coordination Protocols” Accessed: 2024-03-09, https://aztec.network/blog/request-for-comments-aztec-sequencer-selection-and-prover-coordination-protocols/
- “Request for Proposals: Decentralized Prover Coordination” Accessed: 2024-03-03, https://forum.aztec.network/t/request-for-proposals-decentralized-prover-coordination/2397
- Tim Roughgarden “Transaction fee mechanism design” In ACM SIGecom Exchanges 19.1 ACM New York, NY, USA, 2021, pp. 52–55 eprint: https://doi.org/10.48550/arXiv.2106.01340
- Tim Roughgarden “Transaction fee mechanism design for the Ethereum blockchain: An economic analysis of EIP-1559” In arXiv preprint arXiv:2012.00854, 2020
- “Scroll Architecture” Accessed: 2023-10-09, https://docs.scroll.io/en/technology/
- Erel Segal-Halevi, Avinatan Hassidim and Yonatan Aumann “SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism” In Lecture Notes in Computer Science Springer Berlin Heidelberg, 2016, pp. 260–272 DOI: 10.1007/978-3-662-53354-3˙21
- “Sequencer-Prover Separation in Zero-Knowledge Rollups / Toghrul Maharramov” Accessed: 2024-03-09, https://www.youtube.com/watch?v=Y_7FfE_V9wU
- Elaine Shi, Hao Chung and Ke Wu “What Can Cryptography Do for Decentralized Mechanism Design?” In 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA 251, LIPIcs Saarbrücken/Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 97:1–97:22 DOI: 10.4230/LIPIcs.ITCS.2023.97
- “Sidecar Proving Proposal” Accessed: 2024-04-01, https://forum.aztec.network/t/proposal-prover-coordination-sidecar/2428
- “Simple Decentralized Protocol Proposal” Accessed: 2024-03-09, https://community.starknet.io/t/simple-decentralized-protocol-proposal/99693
- “SNARK Workers” Accessed: 2024-03-03, https://docs.minaprotocol.com/mina-protocol/snark-workers
- “Staking Based Tokenomics” Accessed: 2024-03-05, https://github.com/taikoxyz/taiko-mono/blob/alpha-4/packages/protocol/docs/tokenomics_staking.md
- “Starknet Decentralized Protocol IV - Proofs in the Protocol” Accessed: 2024-03-09, https://community.starknet.io/t/starknet-decentralized-protocol-iv-proofs-in-the-protocol/6030
- “Taiko Protocol Overview” Accessed: 2024-04-01, https://taiko.mirror.xyz/y_47kIOL5kavvBmG0zVujD2TRztMZt-xgM5d4oqp4_Y
- “Taiko Proving Design overview: Grímsvötn and Eldfell cases” Accessed: 2024-04-04, https://community.taiko.xyz/t/taiko-proving-design-overview-grimsvotn-and-eldfell-cases/1014
- “Transaction Fees on Scroll” Accessed: 2024-04-01, https://docs.scroll.io/en/developers/transaction-fees-on-scroll/
- William Vickrey “Counterspeculation, Auctions, and Competitive Sealed Tenders” In The Journal of Finance 16.1 [American Finance Association, Wiley], 1961, pp. 8–37 DOI: 10.2307/2977633
- “Blockchain Censorship” In Proceedings of the ACM Web Conference 2024, WWW ’24 Singapore: Association for Computing Machinery, 2024 DOI: 10.1145/3589334.3645431
- “Workflow of a zkSync Era transaction: from generation to finalization” Accessed: 2024-03-09, https://blog.quarkslab.com/zksync-transaction-workflow.html
- Ke Wu, Elaine Shi and Hao Chung “Maximizing Miner Revenue in Transaction Fee Mechanism Design” In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) 287, Leibniz International Proceedings in Informatics (LIPIcs) Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024, pp. 98:1–98:23 DOI: 10.4230/LIPIcs.ITCS.2024.98
- Andrew Chi-Chih Yao “An Incentive Analysis of some Bitcoin Fee Designs” arXiv, 2018 DOI: 10.48550/ARXIV.1811.02351
- M. Yokoo, Y. Sakurai and S. Matsubara “Robust double auction protocol against false-name bids” In Proceedings 21st International Conference on Distributed Computing Systems, 2001, pp. 137–145 DOI: 10.1109/ICDSC.2001.918942
- “zkSync Era Overview” Accessed: 2024-04-02, https://docs.zksync.io/build/developer-reference/zkSync.html