---
OA_place: repository
OA_type: green
_id: '21042'
abstract:
- lang: eng
  text: "Many blockchains such as Ethereum execute all incoming transactions sequentially
    significantly limiting the potential throughput. A common approach to scale execution
    is parallel execution engines that fully utilize modern multi-core architectures.
    Parallel execution is then either done optimistically, by executing transactions
    in parallel and detecting conflicts on the fly, or guided, by requiring exhaustive
    client transaction hints and scheduling transactions accordingly.\r\n\r\nHowever,
    recent studies have shown that the performance of parallel execution engines depends
    on the nature of the underlying workload. In fact, in some cases, only a 60% speed-up
    compared to sequential execution could be obtained. This is the case, as transactions
    that access the same resources must be executed sequentially. For example, if
    10% of the transactions in a block access the same resource, the execution cannot
    meaningfully scale beyond 10 cores. Therefore, a single popular application can
    bottleneck the execution and limit the potential throughput.\r\n\r\nIn this paper,
    we introduce Anthemius, a block construction algorithm that optimizes parallel
    transaction execution throughput. We evaluate Anthemius exhaustively under a range
    of workloads, and show that Anthemius enables the underlying parallel execution
    engine to process over twice as many transactions."
acknowledgement: This work was supported by the Austrian Science Fund (FWF) SFB project
  SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Ray
  full_name: Neiheiser, Ray
  id: f09651b9-fec0-11ec-b5d8-934aff0e52a4
  last_name: Neiheiser
  orcid: 0000-0001-7227-8309
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
  orcid: 0000-0002-8827-3382
citation:
  ama: 'Neiheiser R, Kokoris Kogias E. Anthemius: Efficient and modular block assembly
    for concurrent execution. In: <i>29th International Conference on Financial Cryptography
    and Data Security</i>. Vol 15751. Springer Nature; 2026:307-323. doi:<a href="https://doi.org/10.1007/978-3-032-07024-1_18">10.1007/978-3-032-07024-1_18</a>'
  apa: 'Neiheiser, R., &#38; Kokoris Kogias, E. (2026). Anthemius: Efficient and modular
    block assembly for concurrent execution. In <i>29th International Conference on
    Financial Cryptography and Data Security</i> (Vol. 15751, pp. 307–323). Miyakojima,
    Japan: Springer Nature. <a href="https://doi.org/10.1007/978-3-032-07024-1_18">https://doi.org/10.1007/978-3-032-07024-1_18</a>'
  chicago: 'Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient
    and Modular Block Assembly for Concurrent Execution.” In <i>29th International
    Conference on Financial Cryptography and Data Security</i>, 15751:307–23. Springer
    Nature, 2026. <a href="https://doi.org/10.1007/978-3-032-07024-1_18">https://doi.org/10.1007/978-3-032-07024-1_18</a>.'
  ieee: 'R. Neiheiser and E. Kokoris Kogias, “Anthemius: Efficient and modular block
    assembly for concurrent execution,” in <i>29th International Conference on Financial
    Cryptography and Data Security</i>, Miyakojima, Japan, 2026, vol. 15751, pp. 307–323.'
  ista: 'Neiheiser R, Kokoris Kogias E. 2026. Anthemius: Efficient and modular block
    assembly for concurrent execution. 29th International Conference on Financial
    Cryptography and Data Security. FC: Financial Cryptography and Data Security,
    LNCS, vol. 15751, 307–323.'
  mla: 'Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular
    Block Assembly for Concurrent Execution.” <i>29th International Conference on
    Financial Cryptography and Data Security</i>, vol. 15751, Springer Nature, 2026,
    pp. 307–23, doi:<a href="https://doi.org/10.1007/978-3-032-07024-1_18">10.1007/978-3-032-07024-1_18</a>.'
  short: R. Neiheiser, E. Kokoris Kogias, in:, 29th International Conference on Financial
    Cryptography and Data Security, Springer Nature, 2026, pp. 307–323.
conference:
  end_date: 2025-04-18
  location: Miyakojima, Japan
  name: 'FC: Financial Cryptography and Data Security'
  start_date: 2025-04-14
corr_author: '1'
date_created: 2026-01-25T23:01:40Z
date_published: 2026-01-01T00:00:00Z
date_updated: 2026-02-12T13:39:07Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-032-07024-1_18
external_id:
  arxiv:
  - '2502.10074'
intvolume: '     15751'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2502.10074
month: '01'
oa: 1
oa_version: Preprint
page: 307-323
project:
- _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e
  grant_number: F8502
  name: Interface Theory for Security and Privacy
- _id: 7bdd2f70-9f16-11ee-852c-b7950bc6d277
  grant_number: ICT22-045
  name: SeCure, privAte, and interoperabLe layEr 2
publication: 29th International Conference on Financial Cryptography and Data Security
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783032070234'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Anthemius: Efficient and modular block assembly for concurrent execution'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15751
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21017'
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.
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
article_number: '3769423'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Ray
  full_name: Neiheiser, Ray
  id: f09651b9-fec0-11ec-b5d8-934aff0e52a4
  last_name: Neiheiser
  orcid: 0000-0001-7227-8309
- first_name: Miguel
  full_name: Matos, Miguel
  last_name: Matos
- first_name: Luis
  full_name: Rodrigues, Luis
  last_name: Rodrigues
citation:
  ama: 'Neiheiser R, Matos M, Rodrigues L. Kauri: BFT consensus with pipelined tree-based
    dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. 2025.
    doi:<a href="https://doi.org/10.1145/3769423">10.1145/3769423</a>'
  apa: 'Neiheiser, R., Matos, M., &#38; Rodrigues, L. (2025). 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>'
  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, 2025. <a href="https://doi.org/10.1145/3769423">https://doi.org/10.1145/3769423</a>.'
  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>.
    Association for Computing Machinery, 2025.'
  ista: 'Neiheiser R, Matos M, Rodrigues L. 2025. Kauri: BFT consensus with pipelined
    tree-based dissemination and aggregation. ACM Transactions on Computer Systems.,
    3769423.'
  mla: 'Neiheiser, Ray, et al. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination
    and Aggregation.” <i>ACM Transactions on Computer Systems</i>, 3769423, Association
    for Computing Machinery, 2025, doi:<a href="https://doi.org/10.1145/3769423">10.1145/3769423</a>.'
  short: R. Neiheiser, M. Matos, L. Rodrigues, ACM Transactions on Computer Systems
    (2025).
corr_author: '1'
date_created: 2026-01-20T10:14:23Z
date_published: 2025-09-05T00:00:00Z
date_updated: 2026-01-21T08:11:23Z
day: '05'
department:
- _id: KrPi
doi: 10.1145/3769423
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1145/3769423
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e
  grant_number: F8502
  name: Interface Theory for Security and Privacy
- _id: 7bdd2f70-9f16-11ee-852c-b7950bc6d277
  grant_number: ICT22-045
  name: SeCure, privAte, and interoperabLe layEr 2
publication: ACM Transactions on Computer Systems
publication_identifier:
  eissn:
  - 1557-7333
  issn:
  - 0734-2071
publication_status: epub_ahead
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Kauri: BFT consensus with pipelined tree-based dissemination and aggregation'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...