Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus

Danezis, George; Kogias, Eleftherios Kokoris; Sonnino, Alberto; Spiegelman, Alexander

doi:10.48550/arxiv.2105.11827

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Baxos, Proposers have to broadcast a message to Acceptors, both in the Prepare-Promise phase and in the Propose-Accept phase, which results in a major I/O scalability bottleneck. We plan to address this issue in the future by exploring two approaches: (1) dynamic broadcast trees and (2) separating the total ordering from message broadcasting [53] by employing a peer to peer overlay to disseminate requests and using hash of requests for total ordering.…”

Section: Limitations and Future Workmentioning

confidence: 99%

Baxos: Backing off for Robust and Efficient Consensus

Tennage¹,

Băsescu²,

Kogias³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Leader-based consensus algorithms are vulnerable to liveness and performance downgrade attacks. We explore the possibility of replacing leader election in Multi-Paxos with random exponential backoff (REB), a simpler approach that requires minimum modifications to the two phase Synod Paxos and achieves better resiliency under attacks.We propose Baxos, a new resilient consensus protocol that leverages a random exponential backoff scheme as a replacement for leader election in consensus algorithms. Our backoff scheme addresses the common challenges of random exponential backoff such as scalability and robustness to changing wide area latency. We extensively evaluate Baxos to illustrate its performance and robustness against two liveness and performance downgrade attacks using an implementation running on Amazon EC2 in a wide area network and a combination of a micro benchmark and YCSB-A workload on Redis. Our results show that Baxos offers more robustness to liveness and performance downgrade attacks than leader-based consensus protocols. Baxos outperforms Multi-Paxos and Raft up to 185% in throughput under liveness and performance downgrade attacks under worst case contention scenarios where each replica proposes requests concurrently while only incurring a 7% reduction on the maximum throughput in the synchronous attack-free scenario.

show abstract

Section: Limitations and Future Workmentioning

confidence: 99%

Baxos: Backing off for Robust and Efficient Consensus

Tennage¹,

Băsescu²,

Kogias³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…DAG-Rider has an expected amortized linear message complexity, and expected constant latency. Tusk [16] is an implementation based on DAG-Rider. Bullshark [22] is the current state-of-the-art dual consensus protocol based on DAG-Rider that offers a fast-track to commit nodes every two rounds in case the network is synchronous.…”

Section: Overview and Related Workmentioning

confidence: 99%

Cordial Miners: A Family of Simple, Efficient and Self-Contained Consensus Protocols for Every Eventuality

Keidar¹,

Naor²,

Shapiro³

2022

Preprint

View full text Add to dashboard Cite

Cordial Miners is a family of simple, efficient, self-contained, Byzantine Atomic Broadcast protocols, with optimal instances for asynchrony and eventual synchrony. Its simplicity-cum-efficiency stems from using the blocklace-a partially-ordered generalization of the totally-ordered blockchain-for all key algorithmic tasks, including block dissemination, equivocation exclusion, leader finality, block ordering, and for the identification and exclusion of faulty miners. The algorithm employs piecemeal topological sort of the partially-ordered blocklace into a totally-ordered sequence of blocks, excluding equivocations as well as the Byzantine miners perpetrating them along the way. The conversion process is monotonic in that the output sequence only extends as the input blocklace increases, which implies (i) safety -the outputs of two correct miners are consistent (one is a prefix of the other), and (ii) finality -any output of a correct miner is final.The Cordial Miners protocols are self-contained, using simple all-to-all block communication to realize blocklace-based dissemination and equivocation exclusion. They promptly excommunicate equivocating Byzantine miners, and thus can reduce the supermajority required for finality and eventually enjoy equivocation-free execution. In contrast, state-of-the-art protocols such as DAG-Rider and its successor Bullshark employ reliable broadcast as a black box and thus allow Byzantine miners to participate and equivocate indefinitely.We present two instances of the protocol family: One for the eventual synchrony model, employing deterministic/predicted leader selection and 3 rounds of communication to leader finality in the good case, which is three-quarters of the latency of state-of-the-art protocols. The second for the asynchrony model, employing retroactive random leader selection, 6 rounds to leader finality in the good case, and 9 rounds in the expected case, which is half the latency of state-of-the-art protocols in the good case and three-quarters of their latency in the expected case. In both protocols, message complexity is the same as the state-of-the-art.

show abstract

Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus

Cited by 2 publications

References 0 publications

Baxos: Backing off for Robust and Efficient Consensus

Baxos: Backing off for Robust and Efficient Consensus

Cordial Miners: A Family of Simple, Efficient and Self-Contained Consensus Protocols for Every Eventuality

Contact Info

Product

Resources

About