A Lightweight Locally Repairable Code-based Storage Architecture for Blockchains

The blockchain system requires every node to preserve a complete copy of data arbitrarily, which exerts tremendous storage pressure on nodes. Some researchers applied the erasure code to reduce storage redundancy. However, code storage schemes have the problem of inefficient data communication while verifying transactions and downloading data. To solve this problem, this paper proposes a lightweight locally repairable code (LRC) storage scheme inspired by the idea of slice strategy from privacy computing. Firstly, partitioning each block into distinct transaction slices substantially reduces the amount of transmitted data required to verify a transaction. Secondly, our scheme can recover single-point data with fewer code data slices by local nodes and with less network communication overhead. At last, we analyze the performance of our scheme from theoretical perspectives and examine the storage performance and computation efficiency of our scheme from experimental perspectives. Results suggest that our scheme can effectively reduce the storage overhead while also decreasing the network communication overhead and improving the data reading efficiency.