REVIEW 3 cited by
Shoal: Improving DAG-BFT Latency And Robustness
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The Narwhal system is a state-of-the-art Byzantine fault-tolerant scalable architecture that involves constructing a directed acyclic graph (DAG) of messages among a set of validators in a Blockchain network. Bullshark is a zero-overhead consensus protocol on top of the Narwhal's DAG that can order over 100k transactions per second. Unfortunately, the high throughput of Bullshark comes with a latency price due to the DAG construction, increasing the latency compared to the state-of-the-art leader-based BFT consensus protocols. We introduce Shoal, a protocol-agnostic framework for enhancing Narwhal-based consensus. By incorporating leader reputation and pipelining support for the first time, Shoal significantly reduces latency. Moreover, the combination of properties of the DAG construction and the leader reputation mechanism enables the elimination of timeouts in all but extremely uncommon scenarios in practice, a property we name Prevalent Responsiveness" (it strictly subsumes the established and often desired Optimistic Responsiveness property for BFT protocols). We integrated Shoal instantiated with Bullshark, the fastest existing Narwhal-based consensus protocol, in an open-source Blockchain project and provide experimental evaluations demonstrating up to 40% latency reduction in the failure-free executions, and up-to 80% reduction in executions with failures against the vanilla Bullshark implementation.
Forward citations
Cited by 3 Pith papers
-
DAG-based Consensus with Asymmetric Trust [Extended Version]
The authors present the first asymmetric-trust DAG-based consensus protocol, a new constant-round asymmetric gather primitive, and a counterexample showing simple quorum replacement fails.
-
Transaction Fee Mechanism Design for Leaderless Blockchain Protocols
The paper introduces a game-theoretic model and the FPA-EQ fee mechanism for multi-proposer blockchains, with a tight 63.2% welfare guarantee and matching impossibility results.
-
BlueBottle: Fast and Robust Blockchains through Subsystem Specialization
A two-layer consensus architecture uses a faster n=5f+1 DAG core plus a synchronous guard layer to reach sub-second finality with accountable recovery.
Discussion (0). Continue with ORCID to comment.