A Reliable Storage Partition for Permissioned Blockchain

The full-replication data storage mechanism, as commonly utilized in existing blockchains, is the barrier to the system's scalability, since it retains a copy of entire blockchain at each node so that the overall storage consumption per block is O(n) with n participants. Yet another drawback is that this mechanism may limit the throughput in permissioned blockchain. Moreover, due to the existence of Byzantine nodes, existing partitioning methods, though widely adopted in distributed systems for decades, cannot suit for blockchain systems directly, so that it is critical to devise new storage mechanism for blockchain systems. This article proposes a novel storage engine, called BFT-Store, to enhance storage scalability by integrating erasure coding with Byzantine Fault Tolerance (BFT) consensus protocol. The first property of BFT-store is that the storage consumption per block can be reduced to O(1) for the first time, which enlarges overall storage capability when more nodes attend the blockchain. Second, we design an efficient online re-encoding protocol for storage scale-out and a hybrid replication scheme to enhance reading performance. Analysis in theory and extensive experimental results illustrate the scalability, availability and efficiency of BFT-Store via the implementation in an open-source permissioned blockchain Tendermint.

Automated summary

The article introduces a novel storage engine called BFT-Store, which enhances storage scalability by integrating erasure coding with Byzantine Fault Tolerance (BFT) consensus protocol. BFT-Store reduces the storage consumption per block to O(1) for the first time, increasing overall storage capability, and includes efficient online re-encoding protocol and hybrid replication scheme to enhance reading performance. Analysis and experimental results demonstrate the scalability, availability, and efficiency of BFT-Store in an open-source permissioned blockchain Tendermint.