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 architecture and deferred proposals.
Bullshark: The partially synchronous version.ArXiv abs/2209.05633(2022)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 4years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
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 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 reduces communication complexity in DAG-based BFT to quadratic per round via selective sparse edges, supports multiple leaders, and improves failure-case latency.
citing papers explorer
-
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 architecture and deferred proposals.
-
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.