Skip to main content
QUICK REVIEW

[论文解读] Shoal++: High Throughput DAG BFT Can Be Fast!

Balaji Arun, Zekun Li|arXiv (Cornell University)|May 30, 2024
Medical Imaging Techniques and ApplicationsMedicine被引用 3
一句话总结

Shoal++ 是一种高吞吐量的基于有向无环图(DAG)的拜占庭容错(BFT)共识协议,通过提高锚点频率、采用确定性声誉机制选择锚点,并支持并行DAG实例,将端到端交易延迟降低至4.5条消息延迟。该协议在吞吐量方面与最先进的DAG-BFT系统相当,同时与之前的工作相比,延迟降低了高达60%。

ABSTRACT

Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They require, in fault-free executions, only 3 message exchanges to commit, the optimum for BFT consensus. However, this class of protocols typically relies on a single leader, hampering throughput scalability. On the other end, a new class of so-called DAG-BFT protocols demonstrates how to achieve highly scalable throughput by separating data dissemination from consensus, and using every replica as proposer. Unfortunately, existing DAG-BFT protocols pay a steep latency premium, requiring on average 10.5 message exchanges to commit a transactions. This work aims to soften this tension and proposes Shoal++, a novel DAG-based BFT consensus system that offers the throughput of DAGs while reducing commit latency to an average of 4.5 message exchanges. Our empirical findings are encouraging, showing that Shoal++ achieves throughput comparable to state-of-the-art DAG BFT solutions while reducing latency by up to 60%.

研究动机与目标

  • 弥合高吞吐量DAG-BFT协议与低延迟传统BFT协议(如PBFT)之间的延迟差距。
  • 解决现有DAG-BFT协议尽管吞吐量高,但端到端延迟仍高达10.5条消息延迟的问题。
  • 在部分同步环境中,利用DAG结构实现快速、可扩展且具有弹性的共识。
  • 设计一种系统,在保持DAG-BFT吞吐量优势的同时,接近传统BFT协议的3条消息延迟最优值。
  • 通过消除关键路径上的数据获取依赖,提升实用性,增强对拜占庭和慢速副本的弹性。

提出的方法

  • 通过动态重新解释锚点调度,将锚点频率提高到每轮一次,减少达成共识所需的轮数。
  • 采用确定性声誉机制,仅选择最快且连接最稳定的副本作为锚点候选,提升可靠性和性能。
  • 为每个副本引入多个并行DAG实例,以提高提案频率并减少交易的排队延迟。
  • 利用Bullshark直接提交规则,基于DAG结构实现提案的早期提交,从而在无故障情况下最小化延迟。
  • 使用带认证的DAG确保持久性,并避免在关键路径上进行数据获取,从而增强对拜占庭和慢速副本的弹性。
  • 在正常操作中消除领导者/锚点超时机制,仅依赖确定性声誉和结构保证来维持活性。
Figure 1 . Narwhal’s round-based DAG from a validator’s local point of view. All nodes are certified.
Figure 1 . Narwhal’s round-based DAG from a validator’s local point of view. All nodes are certified.

实验结果

研究问题

  • RQ1基于DAG的BFT协议能否在保持高吞吐量的同时,将端到端延迟接近理论最小值3条消息延迟?
  • RQ2现有DAG-BFT协议中的主要延迟来源是什么,如何系统性地减少这些延迟?
  • RQ3每轮增加锚点频率对共识延迟和系统弹性有何影响?
  • RQ4确定性声誉系统在多大程度上能改善DAG-BFT中的锚点选择并降低延迟?
  • RQ5并行DAG实例能否有效减少排队延迟,同时不损害一致性或增加复杂度?

主要发现

  • Shoal++ 将平均端到端交易延迟从Shoal中的10.5条消息延迟降低至无故障情况下的4.5条消息延迟。
  • 该协议在吞吐量方面与最先进的DAG-BFT系统相当,同时延迟降低了高达60%。
  • 使用多个并行DAG实例能有效通过提高提案频率来减少排队延迟。
  • 确定性声誉机制确保仅高性能副本被选为锚点,从而提升可靠性和降低延迟。
  • 通过使用带认证的DAG,Shoal++ 避免了在关键路径上进行数据获取,使其对拜占庭和慢速副本具有弹性。
  • 该系统表明,在DAG-BFT中高吞吐量与低延迟并非相互排斥,能够接近传统BFT协议的3条消息延迟最优值。
Figure 2 . Bullshark Commit example. Replica 4 observes two ( $f+1$ ) votes for anchor A1, and thus directly commits it. Replica 1 observes only one ( $<f+1$ ) vote, and thus cannot directly commit A1. Upon committing A2, however, it observes that A1 is present in its causal history and indirectly c
Figure 2 . Bullshark Commit example. Replica 4 observes two ( $f+1$ ) votes for anchor A1, and thus directly commits it. Replica 1 observes only one ( $<f+1$ ) vote, and thus cannot directly commit A1. Upon committing A2, however, it observes that A1 is present in its causal history and indirectly c

更好的研究,从现在开始

从阅读论文到最终审阅,大幅缩短您的研究时间。

无需绑定信用卡

本解读由 AI 生成,并经人工编辑审核。