Travelers: A scalable fair ordering BFT system
CoRR(2024)
摘要
Many blockchain platform are subject to maximal value extraction (MEV), and
users on the platform are losing money while sending transactions because the
transaction order can be manipulated to extract value from them. Consensus
protocols have been augmented with different notion of fair ordering in order
to counter the problem. Out of all practical protocols, the most efficient BFT
consensus requires O(nTL + n^2T) communication complexity, where n is
number node, T is number of transactions and L is average transaction size.
In this work, we propose a new system of BFT fair ordering protocols,
Travelers, that substantially reduce the communication complexity. The proposed
system of protocols satisfy a new notion of fair ordering, called probabilistic
fair ordering, which is an extension to some existing notions of fairness. The
new notion allows a small probability of error ϵ, that adversary can
insert some transactions at any location in a block, but for the remaining
1-ϵ the a modified version of ordering linearizability holds. Our
mechanism neither require a dissemination network nor direct submissions to all
consensus nodes. The key innovation comes from a routing protocol, that is both
flexible and efficient. We construct a protocol with O(clog(n)TL + n^2)
communication complexity with ϵ = 1/n^c for some system parameter
c≥ 1.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要