English

Transaction fee mechanism for Proof-of-Stake protocol

Computer Science and Game Theory 2023-08-30 v2 General Finance

Abstract

We study a mechanism design problem in the blockchain proof-of-stake (PoS) protocol. Our main objective is to extend the transaction fee mechanism (TFM) recently proposed in Chung and Shi (SODA, p.3856-3899, 2023), so as to incorporate a long-run utility model for the miner into the burning second-price auction mechanism BSP(γ)\texttt{BSP}(\gamma) proposed in Chung and Shi (where γ\gamma is a key parameter in the strict γ\gamma-utility model that is applied to both miners and users). First, we derive an explicit functional form for the long-run utility of the miner using a martingale approach, and reveal a critical discontinuity of the utility function, namely a small deviation from being truthful will yield a discrete jump (up or down) in the miner's utility. We show that because of this discontinuity the BSP(γ)\texttt{BSP}(\gamma) mechanism will fail a key desired property in TFM, cc-side contract proofness (cc-SCP). As a remedy, we introduce another parameter θ\theta, and propose a new BSP(θ)\texttt{BSP}(\theta) mechanism, and prove that it satisfies all three desired properties of TFM: user- and miner-incentive compatibility (UIC and MIC) as well as cc-SCP, provided the parameter θ\theta falls into a specific range, along with a proper tick size imposed on user bids.

Cite

@article{arxiv.2308.13881,
  title  = {Transaction fee mechanism for Proof-of-Stake protocol},
  author = {Wenpin Tang and David D. Yao},
  journal= {arXiv preprint arXiv:2308.13881},
  year   = {2023}
}

Comments

18 pages, 3 figures