论文标题
太极拳：BFT快速确认的最长链可用性
TaiJi: Longest Chain Availability with BFT Fast Confirmation
论文作者
论文摘要
大多数状态机器复制方案要么基于40岁的拜占庭容错（BFT）理论，要么基于Nakamoto最新的最长链条设计。最初在工作验证（POW）设置中设计的最长链条协议可在动态参与下获得，但具有概率确认，依赖于安全参数的长期延迟。 BFT协议是为权限设置而设计的，具有快速的确定性确认，但始终在线固定数量的节点。我们提出了一种新的结构，该结构结合了最长的链条协议和BFT协议，以获得两全其美。使用这种结构，我们设计了Taiji，这是第一个动态可用的POW协议，该协议几乎具有确定性确认，而延迟独立于安全参数。与以前使用最长链来采样参与者运行BFT协议的混合方法相反，我们的原始POW Construction使用许多独立的最长链来对BFT协议进行采样建议和投票行动。该设计使太极可以继承比特币的全部动态可用性以及其完整的不可预测性，从而使其可抵抗具有多达50％在线哈希功率的完全适应对手。
Most state machine replication protocols are either based on the 40-years-old Byzantine Fault Tolerance (BFT) theory or the more recent Nakamoto's longest chain design. Longest chain protocols, designed originally in the Proof-of-Work (PoW) setting, are available under dynamic participation, but has probabilistic confirmation with long latency dependent on the security parameter. BFT protocols, designed for the permissioned setting, has fast deterministic confirmation, but assume a fixed number of nodes always online. We present a new construction which combines a longest chain protocol and a BFT protocol to get the best of both worlds. Using this construction, we design TaiJi, the first dynamically available PoW protocol which has almost deterministic confirmation with latency independent of the security parameter. In contrast to previous hybrid approaches which use a single longest chain to sample participants to run a BFT protocol, our native PoW construction uses many independent longest chains to sample propose actions and vote actions for the BFT protocol. This design enables TaiJi to inherit the full dynamic availability of Bitcoin, as well as its full unpredictability, making it secure against fully-adaptive adversaries with up to 50% of online hash power.
