pith. sign in

arxiv: 2604.27659 · v1 · submitted 2026-04-30 · 💻 cs.DC

Back to the Future: Rethinking Endorsement in Order-Execute Blockchains

Rongji Huang , Yifeng Ye , Gerui Wang , Mingchao Wan , Yuxing Duan , Jingjing Zhang , Guangtao Xue , Shengyun Liu This is my paper

Pith reviewed 2026-05-07 06:33 UTC · model grok-4.3

classification 💻 cs.DC
keywords blockchainendorsementorder-executeconsensusTendermintflexible policythroughputDeFi workload
0
0 comments X

The pith

By embedding endorsement checks into consensus rounds, order-execute blockchains can support flexible per-contract policies without extra messages or high abort rates.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper seeks to show that flexible endorsement, where each contract or state object can have its own policy, can be added to classical order-execute blockchains instead of requiring a shift to the execute-order-validate model. It does so by folding the endorsement checks directly into the existing consensus process so that transactions failing their policy can be removed deterministically after ordering but before execution. This matters for systems that already run order-execute architectures and must handle regulatory or governance rules without introducing the high abort rates seen in contended workloads such as decentralized finance. If the approach holds, it would let these platforms keep their simpler structure while delivering substantially higher transaction throughput on realistic financial data.

Core claim

The central claim is that endorsements can be integrated into an order-execute blockchain by embedding them directly into the Byzantine fault-tolerant consensus process. This allows deterministic identification and removal of transactions that fail their endorsement policy from the ordered list, without compromising censorship resistance or decentralization for the remaining transactions. Implemented as FlexTender on Tendermint, the approach adds no extra messaging in the normal case and yields up to 10.6 times higher throughput than an execute-order-validate simulation when tested on an Ethereum USDT workload.

What carries the argument

Embedding endorsement verification into the consensus protocol rounds, which enables post-order but pre-execution filtering of transactions that fail their per-contract or per-object policy.

If this is right

  • Order-execute blockchains can now define individual endorsement policies per contract or state object without switching architectures.
  • Throughput rises substantially in high-contention workloads while normal-case messaging overhead stays unchanged.
  • Removal of non-endorsed transactions occurs deterministically after ordering yet before execution.
  • Censorship resistance and decentralization properties remain intact for the transactions that pass endorsement.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same embedding technique could be adapted to other order-execute consensus protocols to achieve similar efficiency gains.
  • This integration may reduce the architectural complexity of adding regulatory or governance rules to permissioned chains.
  • Real-world deployments would benefit from measuring whether the deterministic removal step introduces any new latency under varying endorsement failure rates.

Load-bearing premise

Problematic transactions can be deterministically identified and removed from the ordered list after consensus while still preserving censorship resistance and decentralization for the accepted ones.

What would settle it

A direct comparison of FlexTender against a production execute-order-validate implementation on identical hardware and the same Ethereum USDT workload, checking whether the reported throughput advantage and abort-rate reduction hold.

Figures

Figures reproduced from arXiv: 2604.27659 by Gerui Wang, Guangtao Xue, Jingjing Zhang, Mingchao Wan, Rongji Huang, Shengyun Liu, Yifeng Ye, Yuxing Duan.

Figure 1
Figure 1. Figure 1: Existing frameworks. 2.2 Existing frameworks Blockchain systems, either permissioned [7, 16, 59, 63] or permissionless [29, 32, 46, 67], widely adopt a classical order￾execute architecture (see Figure 1a). This paradigm is typi￾cally embedded within a full-fledged state machine replica￾tion (SMR) protocol [77], in which a proposer or primary establishes an order that other nodes validate and agree upon, co… view at source ↗
Figure 3
Figure 3. Figure 3: The message pattern of Tendermint. either broadcasts a nil message (PREVOTE nil or PRECOMMIT nil, when tmrP,r or tmrV,r expires), which helps nodes to move to the next phase, or directly transitions to the next round (when tmrC,r expires). Upon entering a new round r +1, the new primary of round r +1 should propose the most recent QC value it is aware of, updated whenever a more recent QC value is received… view at source ↗
Figure 5
Figure 5. Figure 5: The problem of trivially combining flexible endorse￾ment and a consensus protocol. Consider the message pattern of Tendermint. Node 3 serves as the sole endorser for trans￾action tx. It has endorsed tx but encountered a network issue. Other nodes proceed and eventually remove tx (presuming that node 3 is faulty), even though, from the perspective of node 3, tx would have been committed under the standard T… view at source ↗
Figure 6
Figure 6. Figure 6: The order-execute-endorse framework (FlexTender). The order-execute-endorse framework can be instantiated with any consensus protocol. However, to address the chal￾lenges discussed above (and shown in view at source ↗
Figure 7
Figure 7. Figure 7: An example for FlexTender. The proposal in round r contains three transactions: tx1, tx2, and tx3. Since the endorser of tx1 (node 1) opposes it, other nodes suggest its removal during the PRECOMMIT phase of round r, and the proposer of round r +1 (node 1) issues a proposal excluding tx1. Due to network issues or processing delays, the endorser of tx2 (node 3) fails to disseminate its endorsement in time, … view at source ↗
Figure 8
Figure 8. Figure 8: An example for potential censorship attacks. En view at source ↗
Figure 10
Figure 10. Figure 10: Performance under the USDT workload with n = 4. 0 2000 4000 6000 8000 0 100 200 300 400 14000 Throughput (tps) Latency (ms) FlexTender conflict-free EOV-Sim-nosig conflict-free EOV-Sim-sig conflict-free FlexTender all-conflict EOV-Sim-nosig all-conflict EOV-Sim-sig all-conflict view at source ↗
Figure 13
Figure 13. Figure 13: Abort rates and instantaneous throughput of view at source ↗
Figure 14
Figure 14. Figure 14: Performance of FlexTender with rapid removal (n = 4). 0 1500 3000 4500 Throughput (tps) 1 node crash 0 5 10 15 20 Time (s) 0 1500 3000 4500 Throughput (tps) 1 endorser crash view at source ↗
read the original abstract

Due to regulatory compliance and governance management, modern (permissioned) blockchains require flexible endorsement, which allows the endorsement policy for each contract or state object to be individually defined. To enable flexible endorsement, Hyperledger Fabric employs an execute-order-validate (EOV) paradigm, in which transactions first undergo speculative execution and endorsement, and are only then ordered and validated. Meanwhile, most blockchain systems, including the platform targeted in this work (i.e., ChainMaker), still follow a conflict-free order-execute framework. We argue that the EOV paradigm still faces several limitations, notably high abort rates in high-contention workloads such as those in Decentralized Finance (DeFi). To avoid refactoring our system and better suit DeFi applications, we try to integrate flexible endorsement into the classical order-execute architecture and accordingly propose a new framework. The key challenge is to deterministically remove problematic transactions from an ordered list, while preserving censorship resistance and decentralization for the remaining ones. We instantiate this framework on top of Tendermint, a seminal Byzantine fault-tolerant (BFT) protocol adopted in our system, and thereby propose FlexTender. By elegantly embedding endorsements into consensus, FlexTender incurs no additional messaging overhead in the normal case. Empirical evaluation using an Ethereum USDT workload demonstrates that FlexTender achieves up to $10.6\times$ speedup in throughput over an EOV simulation on the same platform.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 3 minor

Summary. The paper proposes FlexTender, a framework that integrates flexible per-contract endorsement policies into order-execute blockchains (targeting ChainMaker) by embedding endorsement verification directly into Tendermint consensus. This embedding is claimed to enable deterministic removal of non-compliant transactions from an already-ordered block without extra messaging rounds or overhead in the common case, while preserving censorship resistance and decentralization. Empirical results on an Ethereum USDT workload report up to 10.6× throughput improvement versus an EOV simulation running on the same platform.

Significance. If the embedding technique and removal mechanism are shown to be sound, the work could meaningfully narrow the performance gap between order-execute and execute-order-validate paradigms for permissioned blockchains. It would allow systems that already use Tendermint-style consensus to support regulatory or governance-driven flexible endorsements without refactoring to EOV, which is particularly relevant for high-contention DeFi workloads where abort rates are a known pain point.

major comments (3)
  1. [§3 and §4] §3 (FlexTender Construction) and §4 (Deterministic Removal): the description of embedding endorsement checks into Tendermint proposal and pre-commit phases provides no invariant or proof that every honest validator reaches identical conclusions about policy compliance using only data already present in the normal message flow. Without this, the zero-overhead claim and safety of the removal step are not established.
  2. [§4.1] §4.1 (Censorship Resistance Argument): the claim that a minority of faulty nodes cannot force removal of a compliant transaction is presented informally. A reduction to Tendermint's existing safety properties or an explicit argument against selective censorship is required, as this is load-bearing for the decentralization guarantee.
  3. [§5.2–5.3] §5.2–5.3 (Evaluation): the 10.6× speedup is measured against an EOV simulation whose abort rates, endorsement-collection latency, and validation overhead are not quantitatively compared to production EOV systems (e.g., Fabric). Any mismatch directly scales the reported gain and must be justified.
minor comments (3)
  1. [Abstract] Abstract: the phrase 'up to 10.6× speedup' should be accompanied by the precise workload parameters and baseline configuration that produce this number.
  2. [§2] §2 (Related Work): the discussion of EOV limitations would benefit from explicit comparison to recent hybrid or policy-aware ordering proposals.
  3. [Figure 4] Figure 4 (throughput curves): error bars or variance measures are missing, making it difficult to assess statistical significance of the reported gains.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive and detailed feedback. The comments highlight important areas where our formal arguments and evaluation context can be strengthened. We address each major comment below and commit to revisions that will improve the manuscript without altering its core contributions.

read point-by-point responses

  1. Referee: [§3 and §4] §3 (FlexTender Construction) and §4 (Deterministic Removal): the description of embedding endorsement checks into Tendermint proposal and pre-commit phases provides no invariant or proof that every honest validator reaches identical conclusions about policy compliance using only data already present in the normal message flow. Without this, the zero-overhead claim and safety of the removal step are not established.

    Authors: We agree that an explicit invariant is required to rigorously establish that the embedding preserves determinism and safety. In the revised manuscript we will add a dedicated subsection to §3 that states the following invariant: given identical proposal and pre-commit messages (which already contain the block and the per-transaction endorsement sets), every honest validator computes exactly the same set of policy-compliant transactions. Because endorsement policies are deterministic functions of transaction content and the received endorsements, and because Tendermint already ensures all honest validators see the same messages, the removal decision in §4 is identical across honest nodes. We will include a short proof sketch showing that this invariant holds under the standard Tendermint assumptions and does not introduce extra communication rounds in the common case. revision: yes

  2. Referee: [§4.1] §4.1 (Censorship Resistance Argument): the claim that a minority of faulty nodes cannot force removal of a compliant transaction is presented informally. A reduction to Tendermint's existing safety properties or an explicit argument against selective censorship is required, as this is load-bearing for the decentralization guarantee.

    Authors: We accept that the current argument is informal. We will revise §4.1 to provide an explicit reduction to Tendermint's safety and agreement properties. The revised text will argue as follows: (1) Tendermint guarantees that all honest validators agree on the identical ordered block and the endorsements embedded within it; (2) removal is a deterministic, local function of that block; therefore (3) a minority of faulty validators cannot cause a compliant transaction to be removed, because they cannot alter the proposal content observed by honest validators nor fabricate endorsements that would violate a policy without being outvoted during consensus. This reduction shows that censorship resistance inherits directly from Tendermint without additional assumptions. revision: yes

  3. Referee: [§5.2–5.3] §5.2–5.3 (Evaluation): the 10.6× speedup is measured against an EOV simulation whose abort rates, endorsement-collection latency, and validation overhead are not quantitatively compared to production EOV systems (e.g., Fabric). Any mismatch directly scales the reported gain and must be justified.

    Authors: We agree that situating the simulation against production EOV systems strengthens the claims. In the revised §5.3 we will add a new paragraph and a small comparison table that references published Fabric benchmarks for high-contention workloads (e.g., abort rates and endorsement latencies reported in prior DeFi studies on Fabric). Our simulation parameters were chosen to be conservative relative to those numbers; we will explicitly state the sources and argue that any unaccounted production overhead would only increase the relative advantage of FlexTender. While we cannot rerun the entire experimental campaign, the added discussion will make the 10.6× figure interpretable in the context of real EOV deployments. revision: yes

Circularity Check

0 steps flagged

No circularity: design and empirical results are self-contained

full rationale

The paper describes a systems architecture (FlexTender) that embeds endorsement checks inside Tendermint's existing proposal and pre-commit phases to enable deterministic excision of non-compliant transactions from an ordered block. The zero-overhead claim follows directly from the embedding using only messages already present in Tendermint; the 10.6× throughput figure is obtained from direct measurement on an Ethereum USDT workload against an EOV simulation running on identical ChainMaker code. No equations, fitted parameters, or self-citation chains are invoked to derive these outcomes. The deterministic-removal property is argued from the consensus invariants rather than reduced to a prior result by the same authors. The work is therefore self-contained against external benchmarks and contains no load-bearing step that collapses to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

Since only the abstract is available, the ledger is based on high-level claims. No free parameters are mentioned. The proposal relies on assumptions about consensus behavior and transaction removal.

axioms (2)
  • domain assumption It is possible to deterministically remove problematic transactions from an ordered list while preserving censorship resistance and decentralization.
    This is the key challenge mentioned and assumed solvable in the framework.
  • domain assumption Embedding endorsements into Tendermint consensus incurs no additional messaging overhead in the normal case.
    Stated as a property of FlexTender.
invented entities (1)
  • FlexTender no independent evidence
    purpose: A framework to enable flexible endorsement in order-execute blockchains by embedding into consensus.
    Newly proposed system in the paper.

pith-pipeline@v0.9.0 · 5578 in / 1639 out tokens · 97156 ms · 2026-05-07T06:33:34.726294+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

93 extracted references · 1 canonical work pages

  1. [1]

    https://chainmaker.org.cn/home

    Chainmaker. https://chainmaker.org.cn/home. Accessed: 2026-04-04

    2026

  2. [2]

    https://ethereum.org/ roadmap/pbs/

    Proposer-builder separation. https://ethereum.org/ roadmap/pbs/

  3. [3]

    https://fabrictestdocs

    Architecture deep dive. https://fabrictestdocs. readthedocs.io/en/latest/arch-deep-dive. html#system-architecture, 2017. Accessed: 2026-04-04

    2017

  4. [4]

    https://hlf.readthedocs.io/en/v0.6/ protocol-spec.html#protocol, 2017

    Hyperledger fabric v0.6 protocol specifica- tion. https://hlf.readthedocs.io/en/v0.6/ protocol-spec.html#protocol, 2017. Accessed: 2026-04-04

    2017

  5. [5]

    https: //www.coindesk.com/markets/2019/07/16/ tether-accidentally-minted-5-billion-of-its-stablecoins-then-deleted-them , 2019

    Tether accidentally minted $5 billion of its stablecoins, then deleted them. https: //www.coindesk.com/markets/2019/07/16/ tether-accidentally-minted-5-billion-of-its-stablecoins-then-deleted-them , 2019

    2019

  6. [6]

    https://decrypt.co/71408/ millions-of-dollars-in-bitcoin-incorrectly-credited-to-blockfi-customers , 2021

    Millions of dollars in bitcoin ’incorrectly credited’ to blockfi customers. https://decrypt.co/71408/ millions-of-dollars-in-bitcoin-incorrectly-credited-to-blockfi-customers , 2021

    2021

  7. [7]

    https:// besu.hyperledger.org/private-networks, 2022

    Besu for private (permissioned) networks. https:// besu.hyperledger.org/private-networks, 2022

    2022

  8. [8]

    https://www.bnbchain.org/en/blog/ bnb-beacon-chain-goes-open-source, 2022

    Bnb beacon chain goes open-source. https://www.bnbchain.org/en/blog/ bnb-beacon-chain-goes-open-source, 2022. 13

    2022

  9. [9]

    https: //www.trmlabs.com/resources/reports/ the-illicit-crypto-ecosystem-report-2022 , 2022

    Trm illicit crypto ecosystem report. https: //www.trmlabs.com/resources/reports/ the-illicit-crypto-ecosystem-report-2022 , 2022

    2022

  10. [10]

    https://backed

    Backed finance - tokenized assets. https://backed. fi/, 2025

    2025

  11. [11]

    Building the most powerful tools for distributed net- works.https://tendermint.com/, 2025

    2025

  12. [12]

    https://www.europol.europa.eu/cms/ sites/default/files/documents/Europol% 20Spotlight%20-%20Cryptocurrencies% 20-%20Tracing%20the%20evolution%20of% 20criminal%20finances.pdf, 2025

    Cryptocurrencies: Tracing the evolution of criminal finances. https://www.europol.europa.eu/cms/ sites/default/files/documents/Europol% 20Spotlight%20-%20Cryptocurrencies% 20-%20Tracing%20the%20evolution%20of% 20criminal%20finances.pdf, 2025

    2025

  13. [13]

    https://hedgebook.com/ interest-rate-swap-tutorial/, 2025

    Hedgebook interest rate swap tutorial – with example. https://hedgebook.com/ interest-rate-swap-tutorial/, 2025

    2025

  14. [14]

    https://finance.yahoo.com/news/ paxos-accidentally-minted-300-trillion-035711207

    Paxos accidentally minted $300 trillion of paypal’s stablecoin — then burned it. https://finance.yahoo.com/news/ paxos-accidentally-minted-300-trillion-035711207. html, 2025

    2025

  15. [15]

    https: //www.congress.gov/119/plaws/publ27/ PLAW-119publ27.pdf, 2025

    Public law 119–27—july 18, 2025. https: //www.congress.gov/119/plaws/publ27/ PLAW-119publ27.pdf, 2025

    2025

  16. [16]

    R3 corda.https://r3.com/r3-labs/corda/, 2025

    2025

  17. [17]

    https://www

    The stablecoins ordinance. https://www. elegislation.gov.hk/hk/cap656, 2025

    2025

  18. [18]

    https://etherscan.io/token/ 0xdac17f958d2ee523a2206206994597c13d831ec7, 2025

    Token tether usd (usdt). https://etherscan.io/token/ 0xdac17f958d2ee523a2206206994597c13d831ec7, 2025

    2025

  19. [19]

    Uniswap.https://app.uniswap.org/, 2025

    2025

  20. [20]

    https://www.justice.gov/opa/pr/ united-states-files-civil-forfeiture-complaint-against-225m-funds-involved-cryptocurrency , 2025

    United states files civil forfeiture complaint against $225m in funds involved in cryp- tocurrency investment fraud money launder- ing. https://www.justice.gov/opa/pr/ united-states-files-civil-forfeiture-complaint-against-225m-funds-involved-cryptocurrency , 2025

    2025

  21. [21]

    Strict lineariz- ability and the power of aborting.Technical Report HPL-2003-241, 2003

    Marcos K Aguilera and Svend Frølund. Strict lineariz- ability and the power of aborting.Technical Report HPL-2003-241, 2003

    2003

  22. [22]

    An approach to anti- money laundering compliance for cryptoassets

    Iñaki Aldasoro, Jon Frost, Sang Hyuk Lim, Fernando Perez-Cruz, and Hyun Song Shin. An approach to anti- money laundering compliance for cryptoassets. Techni- cal report, Bank for International Settlements, 2025

    2025

  23. [23]

    Bottlenecks in blockchain consensus protocols

    Salem Alqahtani and Murat Demirbas. Bottlenecks in blockchain consensus protocols. In2021 IEEE Interna- tional Conference on Omni-Layer Intelligent Systems (COINS), pages 1–8, 2021

    2021

  24. [24]

    Correctness of Tendermint-Core Blockchains

    Yackolley Amoussou-Guenou, Antonella Del Pozzo, Maria Potop-Butucaru, and Sara Tucci-Piergiovanni. Correctness of Tendermint-Core Blockchains. In Jian- nong Cao, Faith Ellen, Luis Rodrigues, and Bernardo Ferreira, editors,22nd International Conference on Prin- ciples of Distributed Systems (OPODIS 2018), volume 125 ofLeibniz International Proceedings in I...

    2018

  25. [25]

    Hyper- ledger fabric: A distributed operating system for permis- sioned blockchains

    Elli Androulaki, Artem Barger, Vita Bortnikov, Chris- tian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, Srinivasan Muralidharan, Chet Murthy, Binh Nguyen, Manish Sethi, Gari Singh, Keith Smith, Alessandro Sorniotti, Chrysoula Stathakopoulou, Marko Vukoli´c, Sharon Weed Cocco, and Ja...

  26. [27]

    En- dorsement in hyperledger fabric

    Elli Androulaki, Angelo De Caro, Matthias Neugschwandtner, and Alessandro Sorniotti. En- dorsement in hyperledger fabric. In2019 IEEE International Conference on Blockchain (Blockchain), pages 510–519, 2019

    2019

  27. [28]

    An efficient frame- work for optimistic concurrent execution of smart con- tracts

    Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, and Archit Somani. An efficient frame- work for optimistic concurrent execution of smart con- tracts. In2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pages 83–92, 2019

    2019

  28. [29]

    Maximizing blockchain performance: Mitigating conflicting transactions through parallelism and dependency management

    Faisal Haque Bappy, Tarannum Shaila Zaman, Md Sajidul Islam Sajid, Mir Mehedi Ahsan Pritom, and Tariqul Islam. Maximizing blockchain performance: Mitigating conflicting transactions through parallelism and dependency management. In2024 IEEE Interna- tional Conference on Blockchain (Blockchain), pages 140–147, 2024

    2024

  29. [30]

    Sui lutris: A blockchain combining broadcast and consensus, 2024

    Sam Blackshear, Andrey Chursin, George Danezis, Anastasios Kichidis, Lefteris Kokoris-Kogias, Xun Li, Mark Logan, Ashok Menon, Todd Nowacki, Alberto Sonnino, Brandon Williams, and Lu Zhang. Sui lutris: A blockchain combining broadcast and consensus, 2024

    2024

  30. [31]

    Trust in con- text: The impact of regulation on blockchain and defi

    Balazs Bodo and Primavera de Filippi. Trust in con- text: The impact of regulation on blockchain and defi. Regulation & Governance, 19(3):740–760, 2025. 14

    2025

  31. [32]

    The latest gossip on BFT consensus

    Ethan Buchman, Jae Kwon, and Zarko Milosevic. The latest gossip on BFT consensus.CoRR, abs/1807.04938, 2018

    work page arXiv 2018

  32. [33]

    A next-generation smart contract and decentralized application platform.white paper, 3(37), 2014

    Vitalik Buterin. A next-generation smart contract and decentralized application platform.white paper, 3(37), 2014

    2014

  33. [34]

    A secure sequencer and data availability committee for rollups

    Margarita Capretto, Martin Ceresa, Antonio Fernan- dez Anta, Pedro Moreno-Sanchez, and Cesar Sanchez. A secure sequencer and data availability committee for rollups. InProceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Secu- rity, CCS ’25, page 2129–2143, New York, NY , USA,

    2025

  34. [36]

    Practical byzantine fault tolerance

    Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. InProceedings of the Third Sympo- sium on Operating Systems Design and Implementation, OSDI ’99, page 173–186, USA, 1999. USENIX Associ- ation

    1999

  35. [37]

    Why do my blockchain transactions fail? a study of hyperledger fabric

    Jeeta Ann Chacko, Ruben Mayer, and Hans-Arno Ja- cobsen. Why do my blockchain transactions fail? a study of hyperledger fabric. InProceedings of the 2021 International Conference on Management of Data, SIG- MOD ’21, page 221–234, New York, NY , USA, 2021. Association for Computing Machinery

    2021

  36. [38]

    Towards a formal foundation for blockchain zk rollups

    Stefanos Chaliasos, Denis Firsov, and Benjamin Livshits. Towards a formal foundation for blockchain zk rollups. InProceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, CCS ’25, page 2714–2728, New York, NY , USA, 2025. Association for Computing Machinery

    2025

  37. [39]

    As easy as abc: Optimal (a)ccountable (b)yzantine (c)onsensus is easy! In2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 560–570, 2022

    Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guer- raoui, and Jovan Komatovic. As easy as abc: Optimal (a)ccountable (b)yzantine (c)onsensus is easy! In2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 560–570, 2022

    2022

  38. [40]

    Upright cluster services

    Allen Clement, Manos Kapritsos, Sangmin Lee, Yang Wang, Lorenzo Alvisi, Mike Dahlin, and Taylor Riche. Upright cluster services. InProceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Prin- ciples, SOSP ’09, page 277–290, New York, NY , USA,

  39. [42]

    Scalability limitations of kademlia dhts when enabling data availability sampling in ethereum

    Mikel Cortes-Goicoechea, Csaba Kiraly, Dmitriy Rya- jov, Jose Luis MuNoz-Tapia, and Leonardo Bautista- Gomez. Scalability limitations of kademlia dhts when enabling data availability sampling in ethereum. InPro- ceedings of the 2024 6th Blockchain and Internet of Things Conference, BIOTC ’24, page 83–91, New York, NY , USA, 2024. Association for Computing...

    2024

  40. [43]

    Hq replication: A hybrid quorum protocol for byzantine fault tolerance

    James Cowling, Daniel Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira. Hq replication: A hybrid quorum protocol for byzantine fault tolerance. InPro- ceedings of the 7th Symposium on Operating Systems Design and Implementation, OSDI ’06, page 177–190, USA, 2006. USENIX Association

    2006

  41. [44]

    Narwhal and tusk: A dag-based mempool and efficient bft consensus

    George Danezis, Lefteris Kokoris-Kogias, Alberto Son- nino, and Alexander Spiegelman. Narwhal and tusk: A dag-based mempool and efficient bft consensus. InPro- ceedings of the Seventeenth European Conference on Computer Systems, EuroSys ’22, page 34–50, New York, NY , USA, 2022. Association for Computing Machinery

    2022

  42. [45]

    Universally composable termination analysis of tendermint, 2025

    Zhixin Dong, Xian Xu, Yuhang Zeng, Mingchao Wan, and Chunmiao Li. Universally composable termination analysis of tendermint, 2025

    2025

  43. [46]

    Consensus in the presence of partial synchrony.J

    Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony.J. ACM, 35(2):288–323, April 1988

    1988

  44. [47]

    Liu, Shirui Pan, and Tsz Hon Yuen

    Qishuang Fu, Joseph K. Liu, Shirui Pan, and Tsz Hon Yuen. Sok: A deep dive into anti-money laundering techniques for blockchain cryptocurrencies. In Willy Susilo and Josef Pieprzyk, editors,Information Security and Privacy, pages 310–330, Singapore, 2025. Springer Nature Singapore

    2025

  45. [48]

    Block-stm: Scaling blockchain execution by turning ordering curse to a performance blessing

    Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li, Dahlia Malkhi, Yu Xia, and Runtian Zhou. Block-stm: Scaling blockchain execution by turning ordering curse to a performance blessing. In Proceedings of the 28th ACM SIGPLAN Annual Sympo- sium on Principles and Practice of Parallel Program- ming, PPoPP ’23, page 232–244, New Yo...

  46. [50]

    Algorand: Scaling byzan- tine agreements for cryptocurrencies

    Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vla- chos, and Nickolai Zeldovich. Algorand: Scaling byzan- tine agreements for cryptocurrencies. InProceedings of the 26th Symposium on Operating Systems Princi- ples, SOSP ’17, page 51–68, New York, NY , USA, 2017. Association for Computing Machinery

    2017

  47. [51]

    Golan Gueta, I

    G. Golan Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. Reiter, D. Seredinschi, O. Tamir, and A. Tomescu. Sbft: A scalable and decentralized trust infrastructure. In2019 49th Annual IEEE/IFIP Interna- tional Conference on Dependable Systems and Networks (DSN), pages 568–580, 2019

    2019

  48. [52]

    Xox fabric: A hybrid approach to blockchain trans- action execution

    Christian Gorenflo, Lukasz Golab, and Srinivasan Ke- shav. Xox fabric: A hybrid approach to blockchain trans- action execution. In2020 IEEE International Confer- ence on Blockchain and Cryptocurrency (ICBC), pages 1–9, 2020. 15

    2020

  49. [53]

    Fastfabric: Scaling hyperledger fab- ric to 20 000 transactions per second.Int

    Christian Gorenflo, Stephen Lee, Lukasz Golab, and Srinivasan Keshav. Fastfabric: Scaling hyperledger fab- ric to 20 000 transactions per second.Int. J. Netw. Manag., 30(5), September 2020

    2020

  50. [54]

    The next 700 bft protocols

    Rachid Guerraoui, Nikola Kneževi´c, Vivien Quéma, and Marko Vukoli´c. The next 700 bft protocols. InPro- ceedings of the 5th European Conference on Computer Systems, EuroSys ’10, page 363–376, New York, NY , USA, 2010. Association for Computing Machinery

    2010

  51. [55]

    Rex: Replication at the speed of multi-core

    Zhenyu Guo, Chuntao Hong, Mao Yang, Dong Zhou, Lidong Zhou, and Li Zhuang. Rex: Replication at the speed of multi-core. InProceedings of the Ninth Euro- pean Conference on Computer Systems, EuroSys ’14, New York, NY , USA, 2014. Association for Computing Machinery

    2014

  52. [56]

    Resilientdb: global scale resilient blockchain fabric.Proc

    Suyash Gupta, Sajjad Rahnama, Jelle Hellings, and Mo- hammad Sadoghi. Resilientdb: global scale resilient blockchain fabric.Proc. VLDB Endow., 13(6):868–883, February 2020

    2020

  53. [57]

    Beyond lamport, towards probabilistic fair ordering

    Muhammad Haseeb, Jinkun Geng, Radhika Mittal, Au- rojit Panda, Srinivas Narayana, and Anirudh Sivaraman. Beyond lamport, towards probabilistic fair ordering. In Proceedings of the 24th ACM Workshop on Hot Topics in Networks, HotNets ’25, page 227–235, New York, NY , USA, 2025. Association for Computing Machinery

    2025

  54. [58]

    Chitu: Avoiding unnecessary fallback in byzantine consensus

    Rongji Huang, Xiangzhe Wang, Xiaofeng Yan, Lei Fan, Guangtao Xue, and Shengyun Liu. Chitu: Avoiding unnecessary fallback in byzantine consensus. In2025 USENIX Annual Technical Conference (USENIX ATC 25), pages 923–942, Boston, MA, July 2025. USENIX Association

    2025

  55. [59]

    Matthew Weinberg, and Edward W

    Harry Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg, and Edward W. Felten. Arbi- trum: Scalable, private smart contracts. In27th USENIX Security Symposium (USENIX Security 18), pages 1353– 1370, Baltimore, MD, August 2018. USENIX Associa- tion

    2018

  56. [60]

    All about Eve: execute-verify replication for multi-core servers

    Manos Kapritsos, Yang Wang, Vivien Quema, Allen Clement, Lorenzo Alvisi, and Mike Dahlin. All about Eve: execute-verify replication for multi-core servers. InProceedings of the 10th USENIX conference on Op- erating Systems Design and Implementation, OSDI’12, pages 237–250, Berkeley, CA, USA, 2012. USENIX Association

    2012

  57. [61]

    Dependency-aware execution mechanism in hyperledger fabric architecture, 2025

    Sanyam Kaul, Manaswini Piduguralla, Gayathri Shreeya Patnala, and Sathya Peri. Dependency-aware execution mechanism in hyperledger fabric architecture, 2025

    2025

  58. [62]

    The byzantine generals problem.ACM Trans

    Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem.ACM Trans. Program. Lang. Syst., 4(3):382–401, July 1982

    1982

  59. [63]

    Fisco-bcos: An enterprise-grade permissioned block- chain system with high-performance

    Huizhong Li, Yujie Chen, Xiang Shi, Xingqiang Bai, Nan Mo, Wenlin Li, Rui Guo, Zhang Wang, and Yi Sun. Fisco-bcos: An enterprise-grade permissioned block- chain system with high-performance. InProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’23, New York, NY , USA, 2023. Association for Comp...

    2023

  60. [64]

    Par- allelevm: Operation-level concurrent transaction execu- tion for evm-compatible blockchains

    Haoran Lin, Hang Feng, Yajin Zhou, and Lei Wu. Par- allelevm: Operation-level concurrent transaction execu- tion for evm-compatible blockchains. InProceedings of the Twentieth European Conference on Computer Sys- tems, EuroSys ’25, page 211–225, New York, NY , USA,

  61. [66]

    Evasion under blockchain sanctions, 2025

    Endong Liu, Mark Ryan, Liyi Zhou, and Pascal Berrang. Evasion under blockchain sanctions, 2025

    2025

  62. [67]

    Xft: Practical fault tol- erance beyond crashes

    Shengyun Liu, Paolo Viotti, Christian Cachin, Vivien Quéma, and Marko Vukolic. Xft: Practical fault tol- erance beyond crashes. InProceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI’16, page 485–500, USA, 2016. USENIX Association

    2016

  63. [68]

    Flexible advancement in asynchronous bft consensus

    Shengyun Liu, Wenbo Xu, Chen Shan, Xiaofeng Yan, Tianjing Xu, Bo Wang, Lei Fan, Fuxi Deng, Ying Yan, and Hui Zhang. Flexible advancement in asynchronous bft consensus. InProceedings of the 29th Symposium on Operating Systems Principles, SOSP ’23, page 264–280, New York, NY , USA, 2023. Association for Computing Machinery

    2023

  64. [69]

    A secure sharding protocol for open blockchains

    Loi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja, Seth Gilbert, and Prateek Saxena. A secure sharding protocol for open blockchains. InProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS ’16, page 17–30, New York, NY , USA, 2016. Association for Computing Machinery

    2016

  65. [70]

    Mendizabal, Rudá S

    Odorico M. Mendizabal, Rudá S. T. De Moura, Fer- nando Luís Dotti, and Fernando Pedone. Efficient and deterministic scheduling for parallel state machine repli- cation. In2017 IEEE International Parallel and Dis- tributed Processing Symposium (IPDPS), pages 748– 757, 2017

    2017

  66. [71]

    Gummadi, and Patrick Loiseau

    Johnnatan Messias, Vabuk Pahari, Balakrishnan Chan- drasekaran, Krishna P. Gummadi, and Patrick Loiseau. Understanding blockchain governance: Analyzing de- centralized voting to amend defi smart contracts, 2025. 16

    2025

  67. [72]

    Bitcoin: A peer-to-peer electronic cash system

    Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. Technical report, Manubot, 2019

    2019

  68. [73]

    Fabriccrdt: A conflict-free replicated datatypes approach to permissioned blockchains

    Pezhman Nasirifard, Ruben Mayer, and Hans-Arno Ja- cobsen. Fabriccrdt: A conflict-free replicated datatypes approach to permissioned blockchains. InProceedings of the 20th International Middleware Conference, Mid- dleware ’19, page 110–122, New York, NY , USA, 2019. Association for Computing Machinery

    2019

  69. [74]

    Kauri: Scalable bft consensus with pipelined tree-based dissemination and aggregation

    Ray Neiheiser, Miguel Matos, and Luís Rodrigues. Kauri: Scalable bft consensus with pipelined tree-based dissemination and aggregation. InProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, page 35–48, New York, NY , USA, 2021. As- sociation for Computing Machinery

    2021

  70. [75]

    Understanding the scalability of hyper- ledger fabric, 2021

    Minh Quang Nguyen, Dumitrel Loghin, and Tien Tuan Anh Dinh. Understanding the scalability of hyper- ledger fabric, 2021

    2021

  71. [76]

    In search of an understandable consensus algorithm

    Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In2014 USENIX Annual Technical Conference (USENIX ATC 14), pages 305–319, Philadelphia, PA, June 2014. USENIX Asso- ciation

    2014

  72. [77]

    Eric Pettersson Ruiz and Jannis Angelis. Combating money laundering with machine learning – applica- bility of supervised-learning algorithms at cryptocur- rency exchanges.Journal of Money Laundering Control, 25(4):766–778, 11 2021

    2021

  73. [78]

    RainBlock: Faster transaction processing in public blockchains

    Soujanya Ponnapalli, Aashaka Shah, Souvik Baner- jee, Dahlia Malkhi, Amy Tai, Vijay Chidambaram, and Michael Wei. RainBlock: Faster transaction processing in public blockchains. In2021 USENIX Annual Tech- nical Conference (USENIX ATC 21), pages 333–347. USENIX Association, July 2021

    2021

  74. [79]

    Bidl: A high- throughput, low-latency permissioned blockchain frame- work for datacenter networks

    Ji Qi, Xusheng Chen, Yunpeng Jiang, Jianyu Jiang, Tianxiang Shen, Shixiong Zhao, Sen Wang, Gong Zhang, Li Chen, Man Ho Au, and Heming Cui. Bidl: A high- throughput, low-latency permissioned blockchain frame- work for datacenter networks. InProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, SOSP ’21, page 18–34, New York, NY , USA,

  75. [81]

    Liuyang Ren, Paul A. S. Ward, and Bernard Wong. Toward reducing cross-shard transaction overhead in sharded blockchains. InProceedings of the 16th ACM In- ternational Conference on Distributed and Event-Based Systems, DEBS ’22, page 43–54, New York, NY , USA,

  76. [83]

    A transactional perspective on execute-order-validate blockchains

    Pingcheng Ruan, Dumitrel Loghin, Quang-Trung Ta, Meihui Zhang, Gang Chen, and Beng Chin Ooi. A transactional perspective on execute-order-validate blockchains. InProceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIG- MOD ’20, page 543–557, New York, NY , USA, 2020. Association for Computing Machinery

    2020

  77. [84]

    Schneider

    Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial.ACM Comput. Surv., 22(4):299–319, December 1990

    1990

  78. [85]

    Conflict-free replicated data types

    Marc Shapiro, Nuno Preguiça, Carlos Baquero, and Marek Zawirski. Conflict-free replicated data types. InProceedings of the 13th International Conference on Stabilization, Safety, and Security of Distributed Sys- tems, SSS’11, page 386–400, Berlin, Heidelberg, 2011. Springer-Verlag

    2011

  79. [86]

    Blurring the lines between blockchains and database systems: the case of hyper- ledger fabric

    Ankur Sharma, Felix Martin Schuhknecht, Divya Agrawal, and Jens Dittrich. Blurring the lines between blockchains and database systems: the case of hyper- ledger fabric. InProceedings of the 2019 International Conference on Management of Data, SIGMOD ’19, page 105–122, New York, NY , USA, 2019. Association for Computing Machinery

    2019

  80. [87]

    Rolis: a software approach to efficiently replicating multi-core transactions

    Weihai Shen, Ansh Khanna, Sebastian Angel, Sid- dhartha Sen, and Shuai Mu. Rolis: a software approach to efficiently replicating multi-core transactions. InPro- ceedings of the Seventeenth European Conference on Computer Systems, EuroSys ’22, page 69–84, New York, NY , USA, 2022. Association for Computing Machinery

    2022

Showing first 80 references.