Abstract:Distributed ledgers rely on consensus protocols to commit messages in an agreed order. In practice, this order is often chosen for profit, which raises fairness concerns. For example, in decentralized finance, nodes exploit transaction order to extract Maximal Extractable Value (MEV). This paper systematizes the mechanisms at the consensus layer that constrain message ordering in Byzantine fault tolerant systems. We decompose adversarial behavior into three capabilities that affect ordering and analyze each ordering family against them. We organize existing work into FIFO, random, and blind ordering, and compare the metadata and assumptions each requires. We also introduce a new formalization, the $f$-Robust Median Order, which exposes a gap in existing fairness definitions based on timestamps. Finally, we describe a reusable pattern for adding fair ordering to existing BFT consensus protocols. For the protocols we analyze, fair ordering costs 1.5 to 18 times the communication of vanilla consensus, and ordering computation varies by up to five orders of magnitude across families.
From: Zhuolun Li [view email]
[v1]
Fri, 15 Nov 2024 06:33:30 UTC (503 KB)
[v2]
Sat, 25 Jan 2025 14:57:05 UTC (542 KB)
[v3]
Fri, 6 Jun 2025 12:09:39 UTC (1,088 KB)
[v4]
Mon, 24 Aug 2026 08:02:24 UTC (555 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。