@article{21017,
  abstract     = {With the growing interest in blockchains, permissioned approaches to consensus have received increasing attention. Unfortunately, the BFT consensus algorithms that are the backbone of most of these blockchains scale poorly and offer limited throughput. In fact, many state-of-the-art BFT consensus 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 limits the throughput for deeper trees. In this paper we propose Kauri, a BFT communication abstraction that sustains high throughput as the system size grows by leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees. Furthermore, when the number of faults is moderate (arguably the most common case in practice), our construction is able to recover from faults in an optimal number of reconfiguration steps. We implemented and experimentally evaluated Kauri with up to 800 processes. Our results show that Kauri outperforms the throughput of state-of-the-art permissioned blockchain protocols, by up to 58x without compromising latency. Interestingly, in some cases, the parallelization provided by Kauri can also decrease the latency.},
  author       = {Neiheiser, Ray and Matos, Miguel and Rodrigues, Luis},
  issn         = {1557-7333},
  journal      = {ACM Transactions on Computer Systems},
  keywords     = {Distributed systems, byzantine fault tolerance, blockchain, vote aggregation, pipelining},
  number       = {2},
  publisher    = {Association for Computing Machinery},
  title        = {{Kauri: BFT consensus with pipelined tree-based dissemination and aggregation}},
  doi          = {10.1145/3769423},
  volume       = {44},
  year         = {2026},
}