Pith. sign in

REVIEW 1 cited by

A Byzantine Fault-Tolerant Consensus Library for Hyperledger Fabric

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 2107.06922 v1 pith:NHSUOGRH submitted 2021-07-14 cs.DC cs.CR

Artem Barger , Yacov Manevich , Hagar Meir , Yoav Tock This is my paper · ORCID
classification cs.DCcs.CR
keywords fabricorderingserviceconsensushyperledgerlibrarybyzantinefault-tolerant
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Hyperledger Fabric is an enterprise grade permissioned distributed ledger platform that offers modularity for a broad set of industry use cases. One modular component is a pluggable ordering service that establishes consensus on the order of transactions and batches them into blocks. However, as of the time of this writing, there is no production grade Byzantine Fault-Tolerant (BFT) ordering service for Fabric, with the latest version (v2.1) supporting only Crash Fault-Tolerance (CFT). In our work, we address crucial aspects of BFT integration into Fabric that were left unsolved in all prior works, making them unfit for production use. In this work we describe the design and implementation of a BFT ordering service for Fabric, employing a new BFT consensus library. The new library, based on the BFT-Smart protocol and written in Go, is tailored to the blockchain use-case, yet is general enough to cater to a wide variety of other uses. We evaluate the new BFT ordering service by comparing it with the currently supported Raft-based CFT ordering service in Hyperledger Fabric.

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. Setchain Algorithms for Blockchain Scalability

    cs.DC 2025-09 conditional novelty 5.0 of 10

    Three Setchain implementations, especially Hashchain, show orders-of-magnitude higher throughput than the underlying CometBFT ledger while adding light-client epoch proofs.

Pith tools