Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

$Proo\varphi$: A ZKP Market Mechanism (2404.06495v5)

Published 9 Apr 2024 in cs.GT

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. “Credible Auctions: A Trilemma” In Econometrica 88.2 The Econometric Society, 2020, pp. 425–467 DOI: 10.3982/ecta15925
  2. 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
  3. “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
  4. “Towards a Functional Fee Market for Cryptocurrencies” arXiv, 2019 DOI: 10.48550/ARXIV.1901.06830
  5. “Auctions Versus Negotiations” In The American Economic Review 86.1 American Economic Association, 1996, pp. 180–194 URL: http://www.jstor.org/stable/2118262
  6. “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
  7. “The Power of Two-sided Recruitment in Two-sided Markets” arXiv, 2023 DOI: 10.48550/ARXIV.2307.03844
  8. Shuchi Chawla and Jason D Hartline “Auctions with unique equilibria” In Proceedings of the fourteenth ACM conference on Electronic commerce, 2013, pp. 181–196
  9. “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
  10. Hao Chung, Tim Roughgarden and Elaine Shi “Collusion-Resilience in Transaction Fee Mechanism Design”, 2024 arXiv:2402.09321 [cs.GT]
  11. “Foundations of transaction fee mechanism design” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, pp. 3856–3899 SIAM
  12. “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
  13. “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
  14. “Espresso Sequencer Architecture” Accessed: 2024-04-03, https://docs.espressosys.com/sequencer
  15. “Barriers to Collusion-resistant Transaction Fee Mechanisms”, 2024 DOI: 10.48550/arXiv.2402.08564
  16. “Greedy Transaction Fee Mechanisms for (Non-) myopic Miners” In arXiv preprint arXiv:2210.07793, 2022
  17. “Gas and transaction fees” Accessed: 2024-03-09, https://docs.starknet.io/documentation/architecture_and_concepts/Network_Architecture/fee-mechanism/
  18. “Gevulot Docs: Economics” Accessed: 2024-04-06, https://docs.gevulot.com/gevulot-docs/network/fees
  19. “Gevulot Docs: Network Actor” Accessed: 2024-04-06, https://docs.gevulot.com/gevulot-docs/network/provers
  20. 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
  21. “Introducing Gevulot” Accessed: 2024-04-06, https://gevulot.com/introducing-gevulot/
  22. 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
  23. “Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs” Publication info: Published elsewhere. S&P 2024, 2023 URL: https://eprint.iacr.org/2023/1271
  24. 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
  25. “Mina Whitepaper” Accessed: 2024-04-04, https://minaprotocol.com/wp-content/uploads/economicsWhitepaper.pdf
  26. 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
  27. “=nil; Proof Market” Accessed: 2023-10-09, https://docs.nil.foundation/proof-market/market/economics
  28. 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
  29. 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
  30. Robert S Pindyck “Microeconomics”, 2018
  31. “Polygon zkEVM Protocol” Accessed: 2023-10-09, https://wiki.polygon.technology/docs/zkevm/protocol/protocol-components/
  32. “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/
  33. “Request for Proposals: Decentralized Prover Coordination” Accessed: 2024-03-03, https://forum.aztec.network/t/request-for-proposals-decentralized-prover-coordination/2397
  34. 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
  35. Tim Roughgarden “Transaction fee mechanism design for the Ethereum blockchain: An economic analysis of EIP-1559” In arXiv preprint arXiv:2012.00854, 2020
  36. “Scroll Architecture” Accessed: 2023-10-09, https://docs.scroll.io/en/technology/
  37. 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
  38. “Sequencer-Prover Separation in Zero-Knowledge Rollups / Toghrul Maharramov” Accessed: 2024-03-09, https://www.youtube.com/watch?v=Y_7FfE_V9wU
  39. 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
  40. “Sidecar Proving Proposal” Accessed: 2024-04-01, https://forum.aztec.network/t/proposal-prover-coordination-sidecar/2428
  41. “Simple Decentralized Protocol Proposal” Accessed: 2024-03-09, https://community.starknet.io/t/simple-decentralized-protocol-proposal/99693
  42. “SNARK Workers” Accessed: 2024-03-03, https://docs.minaprotocol.com/mina-protocol/snark-workers
  43. “Staking Based Tokenomics” Accessed: 2024-03-05, https://github.com/taikoxyz/taiko-mono/blob/alpha-4/packages/protocol/docs/tokenomics_staking.md
  44. “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
  45. “Taiko Protocol Overview” Accessed: 2024-04-01, https://taiko.mirror.xyz/y_47kIOL5kavvBmG0zVujD2TRztMZt-xgM5d4oqp4_Y
  46. “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
  47. “Transaction Fees on Scroll” Accessed: 2024-04-01, https://docs.scroll.io/en/developers/transaction-fees-on-scroll/
  48. 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
  49. “Blockchain Censorship” In Proceedings of the ACM Web Conference 2024, WWW ’24 Singapore: Association for Computing Machinery, 2024 DOI: 10.1145/3589334.3645431
  50. “Workflow of a zkSync Era transaction: from generation to finalization” Accessed: 2024-03-09, https://blog.quarkslab.com/zksync-transaction-workflow.html
  51. 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
  52. Andrew Chi-Chih Yao “An Incentive Analysis of some Bitcoin Fee Designs” arXiv, 2018 DOI: 10.48550/ARXIV.1811.02351
  53. 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
  54. “zkSync Era Overview” Accessed: 2024-04-02, https://docs.zksync.io/build/developer-reference/zkSync.html
Citations (3)

Summary

  • The paper introduces $Proo$, a novel transaction fee mechanism for ZK-Rollup prover markets that uses parallel user and prover auctions to achieve efficiency, incentive compatibility, collusion resistance, and off-chain agreement proofness.
  • The $Proo$ mechanism is designed with parallel first-price user auctions and capacity bid prover auctions, theoretically achieving Bayesian incentive compatibility and off-chain agreement proofness under certain assumptions.
  • Key challenges for implementing $Proo$ in practice include mitigating Sybil attacks and partial collusion among provers, and dynamically adjusting the transaction capacity parameter $C$.

Analysis of Mechanism Design for ZK-Rollup Prover Markets

The paper, "Mechanism Design for ZK-Rollup Prover Markets," introduces a transaction fee mechanism specifically adapted for ZK-Rollup systems, which address the computational challenges and economic incentives associated with generating zero-knowledge proofs (ZKPs). The authors tackle the problem of creating a sustainable prover market by examining existing transaction fee mechanisms (TFMs) and proposing a novel mechanism termed Proo.Thisessayexplorestheprimaryconsiderationsandimplicationsoftheirproposedmechanism,asinformedbythepaper.</p><h3class=paperheadingid=overviewoftheproposedmechanism>OverviewoftheProposedMechanism</h3><p>ZKRollupsystemsemployproverstogenerateZKPs,ensuringthevalidexecutionoftransactionswhilemaintainingprivacy.Theinherentcomputationalcomplexityandresourcedemandsnecessitateamarketwhereproversarefairlycompensated,distinctfromtheusualvalidatorfeemodelsseeninEthereumorBitcoin.TheauthorsproposeatwosidedmarketmechanisminProo. This essay explores the primary considerations and implications of their proposed mechanism, as informed by the paper.</p> <h3 class='paper-heading' id='overview-of-the-proposed-mechanism'>Overview of the Proposed Mechanism</h3> <p>ZK-Rollup systems employ provers to generate ZKPs, ensuring the valid execution of transactions while maintaining privacy. The inherent computational complexity and resource demands necessitate a market where provers are fairly compensated, distinct from the usual validator fee models seen in Ethereum or Bitcoin. The authors propose a two-sided market mechanism in Proo, where users and provers engage in separate auctions for proof capacity. They emphasize four key desiderata: efficiency, incentive compatibility, collusion resistance, and off-chain agreement proofness.

  1. Efficiency: The mechanism aims to maximize social welfare, ensuring that transactions with the highest user valuations and lowest proving costs are prioritized.
  2. Incentive Compatibility: The mechanism is designed to ensure that both users and provers have dominant strategies to reveal their true valuations and costs, discouraging Sybil attacks.
  3. Collusion Resistance: It addresses potential collusion among provers that could skew market dynamics.
  4. Off-chain Agreement Proofness (OCA-Proofness): The mechanism’s design curtails profit-sharing agreements that could occur outside the protocol between users and provers.

In essence, Prooisuniqueinitsuseoftwoparallelauctions:afirstpriceauctionamongusersandacapacitybidauctionamongprovers,withlotsofemphasisontheefficiencyoftheseauctionswithinthemarketcontext.</p><h3class=paperheadingid=keyfindingsandlimitations>KeyFindingsandLimitations</h3><p>TheauthorspresentsimulationsandtheoreticalargumentsindicatingthatProo is unique in its use of two parallel auctions: a first-price auction among users and a capacity bid auction among provers, with lots of emphasis on the efficiency of these auctions within the market context.</p> <h3 class='paper-heading' id='key-findings-and-limitations'>Key Findings and Limitations</h3> <p>The authors present simulations and theoretical arguments indicating that Proo achieves Bayesian incentive compatibility for users and off-chain agreement proofness under certain assumptions, such as having sufficient prover capacity to cover the batch process and that provers cannot conduct Sybil attacks. However, the mechanism faces challenges with partial collusion and adjusting the capacity parameter dynamically, thus leading to efficiency limitations in practice.

  1. Sybil Attacks: The presence of Sybil attacks, where a single prover might submit multiple fake bids, remains a concern, potentially necessitating additional layers of identity verification or staking protocols to mitigate such strategies.
  2. Collusion: The paper establishes $Proo&#39;s partial vulnerability to collusion among a subset of provers. Although it mitigates complete collusion risks, the interconnectedness among provers must be monitored for maintaining fairness and market efficiency.</li> <li><strong>Adaptive Capacity Adjustment</strong>: There remains an <a href="https://www.emergentmind.com/topics/learned-optimization-for-plasticity-exploration-and-non-stationarity-open" title="" rel="nofollow" data-turbo="false" class="assistant-link" x-data x-tooltip.raw="">open</a> challenge regarding the dynamic setting of the capacity parameter $C$, which dictates the batch size of user transactions. The difficulty lies in balancing between demand and supply variations without reliance on the participants&#39; private information.</li> </ol> <h3 class='paper-heading' id='future-work-and-implications'>Future Work and Implications</h3> <p>The development and refinement of ZK-Rollup mechanisms such as $Proo present a pivotal step towards a more open and decentralized prover ecosystem that sustains the cost of generating ZKPs while optimizing for effective proof market dynamics. Future work will need to address Sybil resistance, adaptive mechanisms for setting transaction or capacity constraints, and increased-order fairness in transaction handling. As blockchain applications continue to grow, scalable, efficient ZK systems will play a crucial role in meeting the demand for secure, private computations.

    This work ultimately extends the understanding of how specialized market mechanisms can be designed to accommodate unique computational contexts, such as ZKPs, where traditional economic frameworks fall short. It opens avenues for ongoing dialogue and research into sustainable economic models for blockchain ecosystems.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.