[{"OA_type":"hybrid","volume":44,"scopus_import":"1","_id":"21017","author":[{"first_name":"Ray","last_name":"Neiheiser","full_name":"Neiheiser, Ray","orcid":"0000-0001-7227-8309","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4"},{"full_name":"Matos, Miguel","first_name":"Miguel","last_name":"Matos"},{"full_name":"Rodrigues, Luis","last_name":"Rodrigues","first_name":"Luis"}],"ddc":["000"],"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"Yes (via OA deal)","title":"Kauri: BFT consensus with pipelined tree-based dissemination and aggregation","date_updated":"2026-07-23T10:07:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-07-23T10:04:06Z","month":"05","publication":"ACM Transactions on Computer Systems","status":"public","doi":"10.1145/3769423","quality_controlled":"1","keyword":["Distributed systems","byzantine fault tolerance","blockchain","vote aggregation","pipelining"],"PlanS_conform":"1","researchdata_availability":"no","article_type":"original","date_published":"2026-05-01T00:00:00Z","department":[{"_id":"KrPi"}],"acknowledgement":"We thank the ACM TOCS Editors and the reviewers for their help in improving the manuscript. This work was partially supported by CAPES - Brazil (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior) and byFundação para a Ciência e Tecnologia (FCT) under project UIDB/50021/2020 and grant 2020.05270.BD, and via project COSMOS (via the OE with ref. PTDC/EEI-COM/29271/2017, via the łPrograma Operacional Regional de Lisboa na sua componente FEDER” with ref. Lisboa-01-0145-FEDER-029271) and project Angainor with reference LISBOA-01-0145-FEDER-031456, grant agreement number 952226, and project GLOG, with reference LISBOA2030-FEDER-00771200, and project BIG (Enhancing the research and innovation potential of Tecnico through blockchain technologies and design Innovation for social Good), and project ScalableCosmosConsensus, and the Austrian Science Fund (FWF) SFB project SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045","publication_status":"published","citation":{"ieee":"R. Neiheiser, M. Matos, and L. Rodrigues, “Kauri: BFT consensus with pipelined tree-based dissemination and aggregation,” <i>ACM Transactions on Computer Systems</i>, vol. 44, no. 2. Association for Computing Machinery, 2026.","ista":"Neiheiser R, Matos M, Rodrigues L. 2026. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. ACM Transactions on Computer Systems. 44(2), 12.","apa":"Neiheiser, R., Matos, M., &#38; Rodrigues, L. (2026). Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3769423\">https://doi.org/10.1145/3769423</a>","short":"R. Neiheiser, M. Matos, L. Rodrigues, ACM Transactions on Computer Systems 44 (2026).","chicago":"Neiheiser, Ray, Miguel Matos, and Luis Rodrigues. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3769423\">https://doi.org/10.1145/3769423</a>.","mla":"Neiheiser, Ray, et al. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” <i>ACM Transactions on Computer Systems</i>, vol. 44, no. 2, 12, Association for Computing Machinery, 2026, doi:<a href=\"https://doi.org/10.1145/3769423\">10.1145/3769423</a>.","ama":"Neiheiser R, Matos M, Rodrigues L. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. 2026;44(2). doi:<a href=\"https://doi.org/10.1145/3769423\">10.1145/3769423</a>"},"project":[{"name":"Interface Theory for Security and Privacy","grant_number":"F8502","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"name":"SeCure, privAte, and interoperabLe layEr 2","grant_number":"ICT22-045","_id":"7bdd2f70-9f16-11ee-852c-b7950bc6d277"}],"issue":"2","date_created":"2026-01-20T10:14:23Z","type":"journal_article","oa_version":"Published Version","oa":1,"intvolume":"        44","fulldoi":"https://doi.org/10.1145/3769423","publication_identifier":{"issn":["0734-2071"],"eissn":["1557-7333"]},"day":"01","corr_author":"1","year":"2026","file":[{"relation":"main_file","date_updated":"2026-07-23T10:04:06Z","date_created":"2026-07-23T10:04:06Z","access_level":"open_access","file_id":"22392","creator":"dernst","checksum":"b64822f3d2bcac3c68c887ced45a6008","success":1,"file_size":676867,"content_type":"application/pdf","file_name":"2026_TransCompSyst_Neiheiser.pdf"}],"OA_place":"publisher","article_number":"12","abstract":[{"lang":"eng","text":"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."}],"das_tickbox":"0","publisher":"Association for Computing Machinery","supplementarymaterial":"no","language":[{"iso":"eng"}]}]