Pith. sign in

REVIEW 2 cited by

BBCA-CHAIN: Low Latency, High Throughput BFT Consensus on a DAG

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 2310.06335 v2 pith:I3QVE6CE submitted 2023-10-10 cs.DC

Dahlia Malkhi , Chrysoula Stathakopoulou , Maofan Yin This is my paper · ORCID
classification cs.DC
keywords bbca-chainadditionalbbcablocksbroadcastcomplete-adoptconsensusconsistent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a partially synchronous BFT consensus protocol powered by BBCA, a lightly modified Byzantine Consistent Broadcast (BCB) primitive. BBCA provides a Complete-Adopt semantic through an added probing interface to allow either aborting the broadcast by correct nodes or exclusively, adopting the message consistently in case of a potential delivery. It does not introduce any extra types of messages or additional communication costs to BCB. BBCA is harnessed into BBCA-CHAIN to make direct commits on a chained backbone of a causally ordered graph of blocks, without any additional voting blocks or artificial layering. With the help of Complete-Adopt, the additional knowledge gained from the underlying BCB completely removes the voting latency in popular DAG-based protocols. At the same time, causal ordering allows nodes to propose blocks in parallel and achieve high throughput. BBCA-CHAIN thus closes up the gap between protocols built by consistent broadcasts (e.g., Bullshark) to those without such an abstraction (e.g., PBFT/HotStuff), emphasizing their shared fundamental principles. Using a Bracha-style BCB as an example, we fully specify BBCA-CHAIN with simplicity, serving as a solid basis for high-performance replication systems (and blockchains).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. 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.

  2. 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.

Pith tools