论文标题
linsbft：公共区块链的线性通信一步BFT协议
LinSBFT: Linear-Communication One-Step BFT Protocol for Public Blockchains
论文作者
论文摘要
本文介绍了Linsbft，这是一种拜占庭式容错（BFT）协议，具有处理2000多种智能合约交易的能力。 Linsbft适用于无许可的公共区块链系统，在该系统中没有公开基础设施，基于经典的PBFT，具有4个改进：（\ romannumeral1）Linsbft实现$ O（N）$ o（n）$最差的通信量，与PBFT的合同合同o（n^4）$; （\ romannumeral2）linsbft随机旋转协议领导者，以降低拒绝对领导者的服务攻击的风险； （\ romannumeral3）每次运行linsbft最终确定了一个块，这对参与者在协议的一项运行中是诚实的，而在另一个协议中是不诚实的，而一组参与者是动态的，这是定期更新的。 （\ romannumeral4）linsbft有助于延迟的节点通过同步机制赶上，以承诺能力。此外，在普通情况下，林斯布夫特仅涉及一轮投票，而不是在PBFT中进行的两轮投票，这减少了沟通的开销和确认时间，并采用了\ emph {earve ofist ofise}方案来奖励所有参与者。使用从以太坊获得的数据进行的广泛实验表明，Linsbft始终如一，显着优于现有的区块链中现有的BFT方案。
This paper presents LinSBFT, a Byzantine Fault Tolerance (BFT) protocol with the capacity of processing over 2000 smart contract transactions per second in production. LinSBFT applies to a permissionless, public blockchain system, in which there is no public-key infrastructure, based on the classic PBFT with 4 improvements: (\romannumeral1) LinSBFT achieves $O(n)$ worst-case communication volume, in contract to PBFT's $O(n^4)$; (\romannumeral2) LinSBFT rotates the leader of protocol randomly to reduce the risk of denial-of-service attacks on leader; and (\romannumeral3) each run of LinSBFT finalizes one block, which is robust against participants that are honest in one run of the protocol, and dishonest in another, and the set of participants is dynamic, which is update periodically. (\romannumeral4) LinSBFT helps the delayed nodes to catch up via a synchronization mechanism to promise the liveness. Further, in the ordinary case, LinSBFT involves only a single round of voting instead of two in PBFT, which reduces both communication overhead and confirmation time, and employs the \emph{proof-of-stake} scheme to reward all participants. Extensive experiments using data obtained from the Ethereum demonstrate that LinSBFT consistently and significantly outperforms existing in-production BFT protocols for blockchains.
