Pith. sign in

REVIEW 1 cited by

DuoBFT: Resilience vs. Performance Trade-off in Byzantine Fault Tolerance

Not yet reviewed by Pith; the record is open.

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 2010.01387 v2 pith:3JPC6P2F submitted 2020-10-03 cs.DC

classification cs.DC
keywords hybridduobftfaultcommitsmodelquorumbyzantinemodels
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper presents DuoBFT, a Byzantine fault-tolerant protocol that uses trusted components to provide commit decisions in the Hybrid fault model in addition to commit decisions in the BFT model. By doing so, it enables the clients to choose the response fault model for its commands. Internally, DuoBFT commits each client command under both the hybrid and Byzantine models, but since hybrid commits take fewer communication steps and use smaller quorums than BFT commits, clients can benefit from the low-latency commits in the hybrid model. DuoBFT uses a common view-change change protocol to handle both fault models. To achieve this, we enable a notion called Flexible Quorums in the hybrid fault model by revisiting the quorum intersection requirements in hybrid protocols. The flexible quorum technique enables having a hybrid view change quorum that is of the same size as a BFT view-change quorum. This paves a path for efficiently combining both the fault models within a single unified protocol. Our evaluation on a wide-area deployment reveal that DuoBFT can provide hybrid commits with 30% lower latency to existing protocols without sacrificing throughput. In absolute terms, DuoBFT provides sub-200-millisecond latency in a geographically replicated deployment.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Raptr: Prefix Consensus for Robust High-Performance BFT

    cs.DC 2025-04 conditional novelty 7.0 of 10

    Raptr is a BFT consensus protocol whose prefix-voting mechanism commits nested prefixes of proposed blocks, delivering high throughput, near-optimal latency, and robustness to message loss in a 100-replica deployment.

Pith tools