Paper 2025/2247
Beyond Incentive Compatibility: Rational Harm-Proof Transaction Fee Mechanisms
Abstract
On a blockchain, users compete for scarce block space in an auction run by the miner to get their transactions confirmed in the block. This auction is called transaction fee mechanism (TFM). Recent work [Rou21, CS23, SCW23] has been focused on incentive compatibility (IC), requiring that honest behavior maximizes the payoff for each type of strategic player: users, the miner, or miner–user coalitions. In this work, we introduce rational-harm proofness (RHP), which rules out any deviation that harms honest parties without also reducing the deviator’s own utility. RHP closes a gap left by IC: IC does not forbid utility neutral yet externally harmful deviations. For example, in a second-price auction, the second-highest bidder can increase the winner’s payment without affecting their own payoff. Such deviation is eliminated by RHP. We characterize TFMs satisfying RHP alongside incentive compatibility for users (UIC) and miners (MIC). For finite block size, we develop a complete characterization in two models: - In the plain model —where a single miner unilaterally implements the auction—we prove a tetrilemma (3-out-of-4 impossibility): among the four desired properties positive miner revenue, UIC, MIC, RHP against miner–user coalitions, no mechanism achieves all four simultaneously. Meanwhile, any three are jointly achievable in the plain model. - In the MPC-assisted model —where a committee of miners jointly implement the auction via multi-party computation (MPC)—we construct a randomized TFM with a positive miner revenue that achieves UIC, MIC, and RHP against all three types of strategic players. We further show that randomness is necessary: any deterministic TFM satisfying UIC and RHP in this model must confirm no transactions when the number of users exceeds the block size. Finally, we show that IC and RHP are incomparable: for each strategic role, there are mechanisms satisfying one but not the other in both models. Our results broaden the design objectives for TFMs: beyond incentive compatibility, mechanisms should also preclude costless harm to honest participants
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Transaction fee mechanism
- Contact author(s)
-
forestz @ umich edu
elainpk @ umich edu
kewucse @ umich edu - History
- 2025-12-18: approved
- 2025-12-14: received
- See all versions
- Short URL
- https://ia.cr/2025/2247
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/2247,
author = {Forest Zhang and Elain Park and Ke Wu},
title = {Beyond Incentive Compatibility: Rational Harm-Proof Transaction Fee Mechanisms},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/2247},
year = {2025},
url = {https://eprint.iacr.org/2025/2247}
}
