Bullshark：实用的DAG BFT协议
Bullshark: DAG BFT Protocols Made Practical
摘要：
我们提出了Bullshark，第一个基于有向无环图（DAG）的异步拜占庭原子广播协议，该协议针对常见的同步情况进行了优化。与之前基于DAG的BFT协议一样，Bullshark不需要额外的通信就可以在构建DAG的基础上达成共识。也就是说，各方可以通过解释其DAG边的局部视图来完全排序DAG的顶点。与其他基于异步DAG的协议不同，Bullshark提供了一个实用的低延迟快速路径，该路径利用同步周期并不需要众所周知的复杂视图更改机制。Bullshark实现了这一目标，同时保持了其前身DAG Rider的所有理想特性。也就是说，它具有最优的分摊通信复杂性，它提供公平性和异步活性，并且即使在量子敌手下也能保证安全性。为了展示我们的方法的实用性和简单性，我们还介绍了一个独立的部分同步版本的Bullshark，我们对最先进的技术进行了评估。实现的协议非常简单（在现有的基于DAG的mempool实现（Narwhal & Tusk）的基础上增加了200个线程）。它非常高效，例如，对于50方的部署，每秒可实现125，000个事务，延迟为2秒。在相同的设置中，最先进的技术在优化延迟时会增加50%的延迟。
英文摘要：
We present Bullshark, the first directed acyclic graph (DAG) based asynchronous Byzantine Atomic Broadcast protocol that is optimized for the common synchronous case. Like previous DAG-based BFT protocols, Bullshark requires no extra communication to achieve consensus on top of building the DAG. That is, parties can totally order the vertices of the DAG by interpreting their local view of the DAG edges. Unlike other asynchronous DAG-based protocols, Bullshark provides a practical low latency fast-path that exploits synchronous periods and deprecates the need for notoriously complex view-change mechanisms. Bullshark achieves this while maintaining all the desired properties of its predecessor DAG-Rider. Namely, it has optimal amortized communication complexity, it provides fairness and asynchronous liveness, and safety is guaranteed even under a quantum adversary. In order to show the practicality and simplicity of our approach, we also introduce a standalone partially synchronous version of Bullshark which we evaluate against the state of the art. The implemented protocol is embarrassingly simple (200 LOC on top of an existing DAG-based mempool implementation (Narwhal & Tusk). It is highly efficient, achieving for example, 125,000 transaction per second with a 2 seconds latency for a deployment of 50 parties. In the same setting the state of the art pays a steep 50% latency increase as it optimizes for asynchrony.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
