Pith. sign in

REVIEW 5 cited by

Shoal++: High Throughput DAG BFT Can Be Fast!

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2405.20488 v2 pith:3IIAYXHC submitted 2024-05-30 cs.DC

Balaji Arun , Zekun Li , Florian Suri-Payer , Sourav Das , Alexander Spiegelman This is my paper · ORCID
classification cs.DC
keywords throughputlatencyprotocolsconsensuscommitexchangesmessageshoal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They require, in fault-free executions, only 3 message exchanges to commit, the optimum for BFT consensus. However, this class of protocols typically relies on a single leader, hampering throughput scalability. On the other end, a new class of so-called DAG-BFT protocols demonstrates how to achieve highly scalable throughput by separating data dissemination from consensus, and using every replica as proposer. Unfortunately, existing DAG-BFT protocols pay a steep latency premium, requiring on average 10.5 message exchanges to commit a transactions. This work aims to soften this tension and proposes Shoal++, a novel DAG-based BFT consensus system that offers the throughput of DAGs while reducing commit latency to an average of 4.5 message exchanges. Our empirical findings are encouraging, showing that Shoal++ achieves throughput comparable to state-of-the-art DAG BFT solutions while reducing latency by up to 60%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Prefix Consensus For Censorship Resistant BFT

    cs.DC 2026-02 conditional novelty 8.0 of 10

    Prefix Consensus, a new primitive where parties output consistent low/high prefixes, is solvable asynchronously in exactly three rounds, and yields leaderless BFT consensus with at most f censored slots after GST.

  2. Transaction Fee Mechanism Design for Leaderless Blockchain Protocols

    cs.GT 2025-05 conditional novelty 8.0 of 10

    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.

  3. Multimmit: Extending Blocks for Faster Finality

    cs.DC 2026-07 conditional novelty 7.0 of 10

    Multimmit finalises transaction blocks in one voting round with roughly 3δ average latency from dissemination, confining a faulty producer's damage to its own chain.

  4. Beluga: Block Synchronization for BFT Consensus Protocols

    cs.CR 2025-11 conditional novelty 6.0 of 10

    Beluga gives BFT consensus a principled block synchronizer with admission control and implicit availability proofs, preserving optimistic latency and bounding pull-based attacks.

  5. BlueBottle: Fast and Robust Blockchains through Subsystem Specialization

    cs.DC 2025-11 reject novelty 6.0 of 10

    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.

Pith tools