The CAP theorem says that no blockchain can be live under dynamic participation and safe under temporary network partitions. To resolve this availability-finality dilemma, we formulate a new class of flexible consensus protocols, ebb-and-flow protocols, which support a full dynamically available ledger in conjunction with a finalized prefix ledger. The finalized ledger falls behind the full ledger when the network partitions but catches up when the network heals. Gasper, the current candidate protocol for Ethereum 2.0's beacon chain, combines the finality gadget Casper FFG with the LMD GHOST fork choice rule and aims to achieve this property. However, we discovered an attack in the standard synchronous network model, highlighting a general difficulty with existing finality-gadget-based designs. We present a construction of provably secure ebb-and-flow protocols with optimal resilience. Nodes run an off-the-shelf dynamically available protocol, take snapshots of the growing available ledger, and input them into a separate off-the-shelf BFT protocol to finalize a prefix. We explore connections with flexible BFT and improve upon the state-of-the-art for that problem.
翻译:CAP 的理论认为,在临时网络分割区下,任何链条都无法生活在动态参与和安全的状态下。为了解决这一供应-最终的难题,我们制定了一个新的灵活的共识协议类别,即ebb-和流量协议,这些协议支持一个完全动态的可用分类账,同时加上一个最终的预缀分类账。当网络分割区在网络愈合时,最终的分类账就落在了完整分类账的后面,但当网络愈合时会赶上。Etheimum 2.0 的灯塔链的当前候选协议Gasper,Gasper FFG将最终的装置与LMD GHOST 选择规则结合起来,目的是实现这一属性。然而,我们在标准同步网络模型中发现了一次袭击,凸显了现有最终性盖特设计的一般困难。我们展示了一种可稳妥可靠的电子-流量协议的构造,并且具有最佳的复原力。Nodes运行一个现成的动态可用的协议,对可获取的分类账号进行截图片,并把它们输入到一个单独的脱壳的BFT-FT协议中,以便最终确定前的状态问题。我们探索与灵活BFTFT的连接。