Kauri
Open Access
- 26 October 2021
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
With the growing commercial interest in blockchains, permissioned implementations have received increasing attention. Unfortunately, the BFT consensus algorithms that are the backbone of most of these blockchains scale poorly and offer limited throughput. Many state-of-the-art algorithms require a single leader process to receive and validate votes from a quorum of processes and then broadcast the result, which is inherently non-scalable. Recent approaches avoid this bottleneck by using dissemination/aggregation trees to propagate values and collect and validate votes. However, the use of trees increases the round latency, which ultimately limits the throughput for deeper trees. In this paper we propose Kauri, a BFT communication abstraction that can sustain high throughput as the system size grows, leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees. Our evaluation shows that Kauri outperforms the throughput of state-of-the-art permissioned blockchain protocols, such as HotStuff, by up to 28x. Interestingly, in many scenarios, the parallelization provided by Kauri can also decrease the latency.Keywords
Funding Information
- CAPES - Brazil. (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior)
- Fundação para a Ciência e Tecnologia (FCT) (UIDB/50021/2020; 2020.05270.BD; COSMOS (PTDC/EEI-COM/29271/2017; Lisboa-01-0145-FEDER-029271); Angainor ( LISBOA-01-0145-FEDER-031456))
This publication has 14 references indexed in Scilit:
- Latency-Aware Leader Selection for Geo-Replicated Byzantine Fault-Tolerant SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2018
- AlgorandPublished by Association for Computing Machinery (ACM) ,2017
- State Machine Replication for the Masses with BFT-SMARTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Introduction to Reliable and Secure Distributed ProgrammingPublished by Springer Science and Business Media LLC ,2011
- Spin One's Wheels? Byzantine Fault Tolerance with a Spinning PrimaryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key AttacksLecture Notes in Computer Science, 2007
- Short Signatures from the Weil PairingLecture Notes in Computer Science, 2001
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982