Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty
Sarisht Wadhwa, Aviv Yaish, Fan Zhang, Kartik Nayak

TL;DR
This paper analyzes how transaction fee mechanisms in parallel-executing blockchains face inherent trade-offs and vulnerabilities, especially under execution uncertainty and contingency, impacting fairness and performance.
Contribution
It introduces a formal framework and proves an impossibility result, establishing fundamental limits for fee mechanisms in parallel blockchain execution environments.
Findings
Adversarial manipulation can exploit parallelism to reduce fees or increase revenue.
Execution contingency leads to overpayment and reduced scheduler revenue.
Proposed fee mechanisms reach the theoretical boundaries of the identified trade-offs.
Abstract
Modern blockchains increasingly rely on parallel execution to improve throughput. We show several industry and academic transaction fee mechanisms (TFMs) struggle to simultaneously account for execution parallelism while remaining performant and fair. First, if parallelism affects fees, adversarial protocol manipulations that offset possible benefits to throughput by introducing fake transactions become rational: users can insert functionally useless parallel transactions solely to reduce fees, and schedulers can create useless sequential transactions to increase revenue. Execution contingency, a core feature of expressive programming languages, both exacerbates the aforementioned threats and introduces new ones: (1) users may overpay for unused resources, and (2) scheduler revenue is harmed when reserved scheduling slots go unused due to contingency. We introduce a framework for this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
