Secure and Efficient Read-Write Synchronization in Re-Sharding Via Lightweight Global State Tree

View at publisher Summarise with VIRAT
Authors: Peiyun Zhang, Ying Liu, Sen Ma, Qinglin Zhao, Haibin Zhu
Cited by: 0
References: 42

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

State re-sharding can reduce cross-shard transaction ratios, which improves the scalability of blockchain systems. However, unavoidable cross-shard transactions and account-locking mechanisms can lead to security risks (read-write conflicts) and performance bottlenecks (low synchronization efficiency). Therefore, this paper proposes a secure and efficient read-write synchronization model for cross-shard transactions in blockchain state re-sharding via a lightweight Global State Tree ($\mathcal{GT}$). The model consists of intra-shard and inter-shard state consistency modules. The intra-shard module includes two methods: account state read-write and account record update. The former allows local shard committees to track account state changes and prevent the use of expired account states, while the latter incorporates account records within maximum latency into an account state data structure, thereby enhancing the traceability and verification efficiency of update history. In the inter-shard module, a transaction processing method with a global takeover mechanism is proposed during the re-sharding window. By using validated data in the$\mathcal{GT}$, the method achieves non-blocking global coordination and account reallocation. Experimental results demonstrate that the proposed model increases transaction throughput and reduces transaction latency compared to bases under Byzantine conditions.

Fields of Study & Subjects

Blockchain Technology Applications and Security Distributed systems and fault tolerance Blockchain Technology in Education and Learning

Publication details

Journal / source
IEEE Transactions on Computers
Volume
75
Issue
6
Pages
2239–2252
Publication date
25 March 2026
Language
EN