Open Access

ARTICLE

CLEC: Combination Locality Based Erasure Code for Permissioned Blockchain Storage

Jiabin Wu^1,3, Boai Yang², Yang Liu¹, Fang Liu^3,*, Nong Xiao¹, Shuo Li⁴

1 National University of Defense Technology, Changsha, 410073, China
2 Hunan University, Changsha, 410082, China
3 Sun Yat-sen University, Guangzhou, 510275, China
4 The University of Edinburgh, Edinburgh, EH8 9BT, The United Kingdom

* Corresponding Author: Fang Liu. Email:

Computers, Materials & Continua 2022, 73(3), 5137-5150. https://doi.org/10.32604/cmc.2022.028305

Received 07 February 2022; Accepted 31 May 2022; Issue published 28 July 2022

Abstract

Building a new decentralized domain name system based on blockchain technology is helping to solve problems, such as load imbalance and over-dependence on the trust of the central node. However, in the existing blockchain storage system, the storage overhead is very high due to its full-replication data storage mechanism. The total storage consumption for each block is up to O(n) with n nodes. Erasure code applied to blockchains can significantly reduce the storage overhead, but also greatly lower the read performance. In this study, we propose a novel coding scheme for blockchain storage, Combination Locality based Erasure Code for Permissioned blockchain storage (CLEC). CLEC uses erasure code, parity locality, and topology locality in blockchain storage, greatly reducing reading latency and repair time. In CLEC, the storage consumption per block can be reduced to O(1), and the repair penalty can also be lowered to O(1). Experiments in an open-source permissioned blockchain Tendermint show that CLEC has a maximum repair speed of 6 times and a read speed of nearly 1.7 times with storage overhead of only 1.17 times compared to the current work, a great improvement in reading performance and repair performance with slightly increased storage overhead via implementation.

---

Keywords

---