Maximizing Miner Revenue in Transaction Fee Mechanism Design

Authors Ke Wu , Elaine Shi, Hao Chung



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.98.pdf
  • Filesize: 0.82 MB
  • 23 pages

Document Identifiers

Author Details

Ke Wu
  • CSD Department, Carnegie Mellon University, Pittsburgh, PA, USA
Elaine Shi
  • ECE and CSD Department, Carnegie Mellon University, Pittsburgh, PA, USA
Hao Chung
  • ECE Department, Carnegie Mellon University, Pittsburgh, PA, USA

Cite AsGet BibTex

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). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 98:1-98:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.98

Abstract

Transaction fee mechanism design is a new decentralized mechanism design problem where users bid for space on the blockchain. Several recent works showed that the transaction fee mechanism design fundamentally departs from classical mechanism design. They then systematically explored the mathematical landscape of this new decentralized mechanism design problem in two settings: in the plain setting where no cryptography is employed, and in a cryptography-assisted setting where the rules of the mechanism are enforced by a multi-party computation protocol. Unfortunately, in both settings, prior works showed that if we want the mechanism to incentivize honest behavior for both users as well as miners (possibly colluding with users), then the miner revenue has to be zero. Although adopting a relaxed, approximate notion of incentive compatibility gets around this zero miner-revenue limitation, the scaling of the miner revenue is nonetheless poor. In this paper, we show that if we make a mild reasonable-world assumption that there are sufficiently many honest users, we can circumvent the known limitations on miner revenue, and design auctions that generate asymptotically optimal miner revenue. We also systematically explore the mathematical landscape of transaction fee mechanism design under the new reasonable-world assumptions, and demonstrate how such assumptions can alter the feasibility and infeasibility landscape.

Subject Classification

ACM Subject Classification
  • Security and privacy → Cryptography
Keywords
  • Blockchain
  • Mechanism Design
  • Transaction Fee

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Encrypted mempools. talk by Justin Drake, Ethereum Foundation, URL: https://www.youtube.com/watch?v=XRM0CpGY3sw.
  2. Ittai Abraham, Danny Dolev, Rica Gonen, and Joseph Halpern. Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In PODC, 2006. Google Scholar
  3. Noga Alon and Joel H Spencer. The probabilistic method. John Wiley & Sons, 2016. Google Scholar
  4. Gilad Asharov, Ran Canetti, and Carmit Hazay. Towards a game theoretic view of secure computation. In Eurocrypt, 2011. Google Scholar
  5. Gilad Asharov and Yehuda Lindell. Utility dependence in correct and fair rational secret sharing. Journal of Cryptology, 24(1), 2011. Google Scholar
  6. Soumya Basu, David A. Easley, Maureen O'Hara, and Emin Gün Sirer. Towards a functional fee market for cryptocurrencies. CoRR, abs/1901.06830, 2019. URL: https://arxiv.org/abs/1901.06830.
  7. Vitalik Buterin, Eric Conner, Rick Dudley, Matthew Slipper, and Ian Norden. Ethereum improvement proposal 1559: Fee market change for eth 1.0 chain. URL: https://github.com/ethereum/EIPs/blob/master/EIPS/eip-1559.md.
  8. Hao Chung and Elaine Shi. Foundations of transaction fee mechanism design. In SODA, 2023. Google Scholar
  9. Kai-Min Chung, T-H. Hubert Chan, Ting Wen, and Elaine Shi. Game-theoretic fairness meets multi-party protocols: The case of leader election. In CRYPTO. Springer-Verlag, 2021. Google Scholar
  10. Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, and Elaine Shi. Game theoretic notions of fairness in multi-party coin toss. In TCC, volume 11239, pages 563-596, 2018. Google Scholar
  11. Yevgeniy Dodis and Tal Rabin. Cryptography and game theory. In AGT, 2007. Google Scholar
  12. Meryem Essaidi, Matheus V. X. Ferreira, and S. Matthew Weinberg. Credible, strategyproof, optimal, and bounded expected-round single-item auctions for all distributions. In Mark Braverman, editor, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, volume 215 of LIPIcs, pages 66:1-66:19, 2022. Google Scholar
  13. Matheus V. X. Ferreira, Daniel J. Moroz, David C. Parkes, and Mitchell Stern. Dynamic posted-price mechanisms for the blockchain transaction-fee market. CoRR, abs/2103.14144, 2021. URL: https://arxiv.org/abs/2103.14144.
  14. Matheus V. X. Ferreira and S. Matthew Weinberg. Credible, truthful, and two-round (optimal) auctions via cryptographic commitments. In Péter Biró, Jason D. Hartline, Michael Ostrovsky, and Ariel D. Procaccia, editors, EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020, pages 683-712. ACM, 2020. Google Scholar
  15. Yotam Gafni and Aviv Yaish. Greedy transaction fee mechanisms for (non-)myopic miners, 2022. URL: https://doi.org/10.48550/arXiv.2210.07793.
  16. Juan Garay, Jonathan Katz, Björn Tackmann, and Vassilis Zikas. How fair is your protocol? a utility-based approach to protocol optimality. In PODC, 2015. Google Scholar
  17. Juan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas. Rational protocol design: Cryptography against incentive-driven adversaries. In FOCS, 2013. Google Scholar
  18. Juan A. Garay, Björn Tackmann, and Vassilis Zikas. Fair distributed computation of reactive functions. In DISC, volume 9363, pages 497-512, 2015. Google Scholar
  19. Andrew V. Goldberg and Jason D. Hartline. Collusion-resistant mechanisms for single-parameter agents. In SODA 2005, pages 620-629, 2005. Google Scholar
  20. Ronen Gradwohl, Noam Livne, and Alon Rosen. Sequential rationality in cryptographic protocols. In FOCS, 2010. Google Scholar
  21. Joseph Halpern and Vanessa Teague. Rational secret sharing and multiparty computation. In STOC, 2004. Google Scholar
  22. Sergei Izmalkov, Silvio Micali, and Matt Lepinski. Rational secure computation and ideal mechanism design. In FOCS, 2005. Google Scholar
  23. Jonathan Katz. Bridging game theory and cryptography: Recent results and future directions. In TCC, 2008. Google Scholar
  24. Gillat Kol and Moni Naor. Cryptography and game theory: Designing protocols for exchanging information. In TCC, 2008. Google Scholar
  25. Ilan Komargodski, Shin’ichiro Matsuo, Elaine Shi, and Ke Wu. log*-round game-theoretically-fair leader election. In CRYPTO, 2022. Google Scholar
  26. Ron Lavi, Or Sattath, and Aviv Zohar. Redesigning bitcoin’s fee market. In The World Wide Web Conference, WWW 2019, pages 2950-2956, 2019. Google Scholar
  27. Shien Jin Ong, David C. Parkes, Alon Rosen, and Salil P. Vadhan. Fairness with an honest minority and a rational majority. In TCC, 2009. Google Scholar
  28. Rafael Pass and Elaine Shi. Fruitchains: A fair blockchain. In PODC, 2017. Google Scholar
  29. Tim Roughgarden. Transaction fee mechanism design for the Ethereum blockchain: An economic analysis of EIP-1559. Manuscript, https://timroughgarden.org/papers/eip1559.pdf, 2020.
  30. Tim Roughgarden. Transaction fee mechanism design. In EC, 2021. Google Scholar
  31. Elaine Shi, Hao Chung, and Ke Wu. What can cryptography do for decentralized mechanism design. In ITCS, 2023. Google Scholar
  32. William Vickrey. Counterspeculation, auctions, and competitive sealed tenders. The Journal of finance, 16(1):8-37, 1961. Google Scholar
  33. Ke Wu, Gilad Asharov, and Elaine Shi. A complete characterization of game-theoretically fair, multi-party coin toss. In Eurocrypt, 2022. Google Scholar
  34. Ke Wu, Elaine Shi, and Hao Chung. Maximizing miner revenue in transaction fee mechanism design. Cryptology ePrint Archive, Paper 2023/283, 2023. URL: https://eprint.iacr.org/2023/283.
  35. Andrew Chi-Chih Yao. An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). In ICALP 2020, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.1.
  36. Yi-Sheng Yu and Dun-He Gu. A note on a lower bound for the smallest singular value. Linear algebra and its Applications, 253(1-3):25-38, 1997. Google Scholar
  37. Zishuo Zhao, Xi Chen, and Yuan Zhou. Bayesian-nash-incentive-compatible mechanism for blockchain transaction fee allocation, 2022. URL: https://arxiv.org/abs/2209.13099.