Arma: Byzantine Fault Tolerant consensus with Linear Scalability
Yacov Manevich

TL;DR
Arma is a scalable BFT consensus system that separates transaction dissemination from consensus, enabling linear scalability across hardware resources and achieving high throughput in WAN settings.
Contribution
Arma introduces a novel separation of dissemination and consensus in BFT protocols, enabling linear scalability and high throughput in distributed environments.
Findings
Achieves over 100,000 transactions per second in WAN settings
Separates transaction validation from consensus for scalability
Ensures censorship resistance with transaction inclusion time limits
Abstract
Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve linear scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the dissemination and validation of client transactions from the consensus process, restricting the latter to totally ordering only metadata of batches of transactions. This separation enables each party to distribute compute and storage resources for transaction validation, dissemination and disk I/O among multiple machines, resulting in linear scalability. Additionally, Arma ensures censorship resistance by imposing a maximum time limit for the inclusion of client transactions. We build a prototype implementation of Arma and evaluate its performance experimentally. Our results show that Arma totally orders over 100,000 transactions per second when deployed in a WAN…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Data Storage Technologies · Cloud Computing and Resource Management
