Herring is the first parallel γ-batch-order-fairness DAG BFT protocol that achieves higher saturation throughput than FairDAG-RL and DoD-W by parallelizing graph construction and piggybacking missing edge resolution on reliable broadcast.
URL:https://filscan.io/ en/statistics/charts/
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
cs.DC 4representative citing papers
A dynamic algorithm allows Filecoin to reach a 2^{-30} finality error probability in roughly 30 rounds rather than the current fixed 900 rounds.
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
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.
citing papers explorer
-
Herring: Parallel Batch-Order-Fairness on DAG-based Blockchain Consensus
Herring is the first parallel γ-batch-order-fairness DAG BFT protocol that achieves higher saturation throughput than FairDAG-RL and DoD-W by parallelizing graph construction and piggybacking missing edge resolution on reliable broadcast.
-
The Finality Calculator: Analyzing and Quantifying Filecoin's Finality Guarantees
A dynamic algorithm allows Filecoin to reach a 2^{-30} finality error probability in roughly 30 rounds rather than the current fixed 900 rounds.
-
Fast Byzantine Total Order Broadcast
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
-
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.