Efficient Partial Order Based Transaction Processing for Permissioned Blockchains
Shuai Zhao, Zhiwei Zhang, Junkai Wang, Ye Yuan, Meihui Zhang, Guoren Wang, Jiang Xiao
Abstract
With the development of permissioned blockchains, transaction processing plays an increasingly crucial role in improving performance. The execution and consensus phases in existing transaction processing methods are based on total order. The consensus phase constructs a total order representing the execution order and submission order of different transactions. Then, in the execution phase, transactions are executed or validated sequentially based on this total order. However, while the total order guarantees consistency across nodes, it also restricts the execution order of any two transactions, even if there is no conflict between them. Additionally, existing methods process transactions based on block snapshots before the consensus phase, but these snapshots are only updated after reaching consensus. The stale data between these phases results in high transaction abort rates due to delays in updated visibility. Therefore, we propose a novel blockchain called Partial Order-Based Ledger (POBL). POBL constructs a partial order of transaction executions in the execution phase and then, in the consensus phase, builds a consistent submission order based on this execution partial order. Notably, POBL allows the visibility of transaction processing results in the execution phase even before committing its block. To ensure the correct execution, the consensus and execution phases need to consider the consistency of data and the dependencies between transactions. Therefore, we use a graph, PGraph, to capture the concurrent partial order in the execution phase. In the consensus phase, we propose a consensus algorithm to conduct the maximal common subgraph, CPGraph, based on the PGraphs of different nodes. We propose to validate blocks and transactions in parallel based on CPGraph, without being restricted by the order between blocks. We perform extensive experiments compared to state-of-the-art architectural systems, and our method significantly outperforms existing work.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 4d449a25-a9fe-466e-83a0-5c1e47a5f8feRelated papers
- Toward High-Performance Blockchain System by Blurring the Line between Ordering and ExecutionDonghyeon Ryu, Chanik ParkSC 2024 · 6 citations
- NeuChain: A Fast Permissioned Blockchain System with Deterministic OrderingZeshun Peng, Yanfeng Zhang, Qian Xu, Haixu Liu et al.VLDB 2022 · 42 citations
- Revisiting OCC in Permissioned Blockchain via Fast Re-ExecutionMingrui Cao, Bin Cao, Weihao Peng, Mugen PengINFOCOM 2026
- TELL: Efficient Transaction Execution Protocol Towards Leaderless ConsensusXing Tong, Zheming Ye, Zhao Zhang, Cheqing Jin et al.ICDE 2024 · 3 citations
- A Weak Consensus Algorithm and Its Application to High-Performance BlockchainQin Wang, Rujia LiINFOCOM 2021 · 27 citations
