---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Ray
      foaf_name: Neiheiser, Ray
      foaf_surname: Neiheiser
      foaf_workInfoHomepage: http://www.librecat.org/personId=f09651b9-fec0-11ec-b5d8-934aff0e52a4
    orcid: 0000-0001-7227-8309
  - foaf_Person:
      foaf_givenName: Miguel
      foaf_name: Matos, Miguel
      foaf_surname: Matos
  - foaf_Person:
      foaf_givenName: Luis
      foaf_name: Rodrigues, Luis
      foaf_surname: Rodrigues
  bibo_doi: 10.1145/3769423
  bibo_issue: '2'
  bibo_volume: 44
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0734-2071
  - http://id.crossref.org/issn/1557-7333
  dct_language: eng
  dct_publisher: Association for Computing Machinery@
  dct_subject:
  - Distributed systems
  - byzantine fault tolerance
  - blockchain
  - vote aggregation
  - pipelining
  dct_title: 'Kauri: BFT consensus with pipelined tree-based dissemination and aggregation@'
...