Paper 2023/283

Maximizing Miner Revenue in Transaction Fee Mechanism Design

Ke Wu, Carnegie Mellon University
Elaine Shi, Carnegie Mellon University
Hao Chung, Carnegie Mellon University

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 mildly stronger reasonable-world assumption than prior works, we can circumvent the known limitations on miner revenue, and design auctions that generate optimal miner revenue. We also systematically explore the mathematical landscape of transaction fee mechanism design under the new reasonable-world and demonstrate how such assumptions can alter the feasibility and infeasibility landscape.

Available format(s)
Cryptographic protocols
Publication info
Mechanism DesignMulti-party computation
Contact author(s)
kew2 @ andrew cmu edu
runting @ gmail com
haochung @ andrew cmu edu
2023-02-27: approved
2023-02-24: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ke Wu and Elaine Shi and Hao Chung},
      title = {Maximizing Miner Revenue in Transaction Fee Mechanism Design},
      howpublished = {Cryptology ePrint Archive, Paper 2023/283},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.