论文标题
尽管费用市场混乱,但最佳性
Optimality Despite Chaos in Fee Markets
论文作者
论文摘要
交易费市场是区块链经济体的重要组成部分,因为它们可以解决可以添加到每个区块的交易数量中固有的稀缺性。在早期的区块链协议中,通过首价拍卖解决了这种稀缺性,在该拍卖中,用户被迫从最近的区块链数据中猜出适当的出价。以太坊的EIP-1559费用市场改革通过使用基本费用(或减少)超过(或未能满足)指定的目标块大小时会增加(或减少)的基本费用来简化此过程。先前的工作发现,EIP-1559机制可能会导致基本费用固有的混乱过程,在这种情况下,即使在理想条件下,基本费用也不会汇合到固定点。但是,这种混乱行为对费用市场的主要设计目标的影响(长期平均规模等于目标的块)以前尚未探索。作为我们的主要贡献,我们在EIP-1559机构中的时间平均值大小可能会发生混乱,但在EIP-1559机构中,我们得出了几乎最佳的上限和下限。我们的下限等于目标利用水平,而我们的上限比最佳高约6%。经验证据与这些理论预测非常一致。具体而言,历史平均水平比工作证明的目标愤怒大约2.9%,在以太坊过渡到有验证验证验证后,历史平均水平降至约2.0%。我们还发现,即使没有收敛性,EIP-1559的大概版本也达到了最佳性。
Transaction fee markets are essential components of blockchain economies, as they resolve the inherent scarcity in the number of transactions that can be added to each block. In early blockchain protocols, this scarcity was resolved through a first-price auction in which users were forced to guess appropriate bids from recent blockchain data. Ethereum's EIP-1559 fee market reform streamlines this process through the use of a base fee that is increased (or decreased) whenever a block exceeds (or fails to meet) a specified target block size. Previous work has found that the EIP-1559 mechanism may lead to a base fee process that is inherently chaotic, in which case the base fee does not converge to a fixed point even under ideal conditions. However, the impact of this chaotic behavior on the fee market's main design goal -- blocks whose long-term average size equals the target -- has not previously been explored. As our main contribution, we derive near-optimal upper and lower bounds for the time-average block size in the EIP-1559 mechanism despite its possibly chaotic evolution. Our lower bound is equal to the target utilization level whereas our upper bound is approximately 6% higher than optimal. Empirical evidence is shown in great agreement with these theoretical predictions. Specifically, the historical average was approximately 2.9% larger than the target rage under Proof-of-Work and decreased to approximately 2.0% after Ethereum's transition to Proof-of-Stake. We also find that an approximate version of EIP-1559 achieves optimality even in the absence of convergence.