Bullshark: The Partially Synchronous Version
read the original abstract
The purpose of this manuscript is to describe the deterministic partially synchronous version of Bullshark in a simple and clean way. This result is published in CCS 2022, however, the description there is less clear because it uses the terminology of the full asynchronous Bullshark. The CCS version ties the description of the asynchronous and partially synchronous versions of Bullshark since it targets an academic audience. Due to the recent interest in DAG-based BFT protocols, we provide a separate and simple description of the partially synchronous version that targets a more general audience. We focus here on the DAG ordering logic. For more details about the asynchronous version, garbage collection, fairness, proofs, related work, evaluation, and efficient DAG implementation please refer to the fullpaper. An intuitive extended summary can be found in the "DAG meets BFT" blogpost.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Finding Nemo-Nemo: CFT DAG-based Consensus in the WAN
Nemo-Nemo is the first DAG-based CFT consensus protocol that claims to match existing latency while delivering significantly higher throughput and better resilience in wide-area networks through multi-leader architect...
-
Lemonshark: Asynchronous DAG-BFT With Early Finality
Lemonshark enables early finality for transactions in asynchronous DAG-BFT by identifying conditions where commitment is sufficient but not necessary for safe results, cutting latency by up to 65%.
-
Ambulance: saving BFT through racing
Ambulance uses protocol-rigged races among replicas to achieve high throughput and low latency comparable to timeout-based BFT while matching the robustness of cooperative approaches.
-
Clownfish: Scaling DAG-based BFT Consensus via Sparse Edges
Clownfish reduces communication complexity in DAG-based BFT to quadratic per round via selective sparse edges, supports multiple leaders, and improves failure-case latency.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.