Abstract

Blockchain, a specific distributed database which maintains a list of data records against tampering and corruption, has aroused wide interests and become a hot topic in the real world. Nevertheless, the increasingly heavy storage consumption brought by the full-replication data storage mechanism, becomes a bottleneck to the system scalability. To address this problem, a reliable storage scheme named BFT-Store (Qi <i>et al.</i> 2020), integrating erasure coding with Byzantine Fault Tolerance (BFT), was proposed recently. While, three critical problems are still left open: (i) The complex re-initialization process of the blockchain when the number of nodes varies; (ii) The high computational overload of downloading data; (iii) The massive communication on the network. This paper proposes a better trade-off for blockchain storage scheme termed PartitionChain which addresses the above three problems, maintaining the merits of BFT-Store. First, our scheme allows the original nodes to merely update a single aggregate signature (e.g., 320 bits) when the number of nodes varies. Using aggregate signatures as the proof of the encoded data not only saves the storage costs but also gets rid of the trusted third party. Second, the computational complexity of retrieving data by decoding, compared to BFT-Store, is greatly reduced by about <inline-formula><tex-math notation="LaTeX">$2^{18}$</tex-math></inline-formula> times on each node. Third, the amount of transmitted data for recovering each block is reduced from <inline-formula><tex-math notation="LaTeX">$O(n)$</tex-math></inline-formula> (assuming <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> is the number of nodes) to <inline-formula><tex-math notation="LaTeX">$O(1)$</tex-math></inline-formula> , by partitioning each block into smaller pieces and applying Reed-Solomon coding to each block. Furthermore, this paper also introduces a reputation ranking system where the malicious behaviors of the nodes can be detected and marked, enabling PartitionChain to check the credits of each node termly and expel the nodes with misbehavior to the specific extent. Comparing with BFT-Store, our scheme allows blockchain system to suit dynamic network with higher efficiency and scalability.

Highlights

  • Blockchain, first proposed in 2008 as a solution to the double-spending problem existing in purely peer-to-peer version of electronic cash system in [2], [3], has aroused interests in various fields for recent decades

  • This paper proposes a better trade-off for blockchain storage scheme termed PartitionChain which addresses the above three problems, maintaining the merits of Byzantine Fault Tolerance (BFT)-Store

  • This paper introduces a reputation ranking system where the malicious behaviors of the nodes can be detected and marked, enabling PartitionChain to check the credits of each node termly and expel the nodes with misbehavior to the specific extent

Read more

Summary

Introduction

Blockchain, first proposed in 2008 as a solution to the double-spending problem existing in purely peer-to-peer version of electronic cash system in [2], [3], has aroused interests in various fields for recent decades. One primary method is to reclaim disk space on the nodes, in which the previous transactions will be discarded [2] To achieve this without breaking the hash of blocks, Satoshi et al [10] suggest to hash the transactions in a Merkle-Tree [11], [12], which allows the blocks to merely include the root hash of the tree in the block header. Through this method, the size of each block header is roughly decreased to 200 bytes; the nodes can still verify the payments through the root hash. In contrast to the traditional fullnodes who preserving the complete blocks, the light-nodes merely store the block headers

Objectives
Methods
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.