<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Anthemius: Efficient and modular block assembly for concurrent execution</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Ray</namePart>
  <namePart type="family">Neiheiser</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">f09651b9-fec0-11ec-b5d8-934aff0e52a4</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-7227-8309</description></name>
<name type="personal">
  <namePart type="given">Eleftherios</namePart>
  <namePart type="family">Kokoris Kogias</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">f5983044-d7ef-11ea-ac6d-fd1430a26d30</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-8827-3382</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">KrPi</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>FC: Financial Cryptography and Data Security</namePart>
</name>



<name type="corporate">
  <namePart>Interface Theory for Security and Privacy</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SeCure, privAte, and interoperabLe layEr 2</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">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.

However, 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.

In 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.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2026</dateIssued><place><placeTerm type="text">Miyakojima, Japan</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>29th International Conference on Financial Cryptography and Data Security</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="eIssn">1611-3349</identifier>
  <identifier type="isbn">9783032070234</identifier>
  <identifier type="arXiv">2502.10074</identifier><identifier type="doi">10.1007/978-3-032-07024-1_18</identifier>
<part><detail type="volume"><number>15751</number></detail><extent unit="pages">307-323</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<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.</ista>
<apa>Neiheiser, R., &amp;#38; Kokoris Kogias, E. (2026). Anthemius: Efficient and modular block assembly for concurrent execution. In &lt;i&gt;29th International Conference on Financial Cryptography and Data Security&lt;/i&gt; (Vol. 15751, pp. 307–323). Miyakojima, Japan: Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/978-3-032-07024-1_18&quot;&gt;https://doi.org/10.1007/978-3-032-07024-1_18&lt;/a&gt;</apa>
<ama>Neiheiser R, Kokoris Kogias E. Anthemius: Efficient and modular block assembly for concurrent execution. In: &lt;i&gt;29th International Conference on Financial Cryptography and Data Security&lt;/i&gt;. Vol 15751. Springer Nature; 2026:307-323. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-032-07024-1_18&quot;&gt;10.1007/978-3-032-07024-1_18&lt;/a&gt;</ama>
<chicago>Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular Block Assembly for Concurrent Execution.” In &lt;i&gt;29th International Conference on Financial Cryptography and Data Security&lt;/i&gt;, 15751:307–23. Springer Nature, 2026. &lt;a href=&quot;https://doi.org/10.1007/978-3-032-07024-1_18&quot;&gt;https://doi.org/10.1007/978-3-032-07024-1_18&lt;/a&gt;.</chicago>
<ieee>R. Neiheiser and E. Kokoris Kogias, “Anthemius: Efficient and modular block assembly for concurrent execution,” in &lt;i&gt;29th International Conference on Financial Cryptography and Data Security&lt;/i&gt;, Miyakojima, Japan, 2026, vol. 15751, pp. 307–323.</ieee>
<short>R. Neiheiser, E. Kokoris Kogias, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 307–323.</short>
<mla>Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular Block Assembly for Concurrent Execution.” &lt;i&gt;29th International Conference on Financial Cryptography and Data Security&lt;/i&gt;, vol. 15751, Springer Nature, 2026, pp. 307–23, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-032-07024-1_18&quot;&gt;10.1007/978-3-032-07024-1_18&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>21042</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-01-25T23:01:40Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-02-12T13:39:07Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
