A Data Lightweight Scheme for Parallel Proof of Vote Consensus
Zixian Wang, Hui Li, Han Wang, Zhenwei Xiao, Ping Lu, Zhenyuan Yang, Minglong Zhang, Peter Han Joo Chong · 2021 IEEE International Conference on Big Data (Big Data) · 2021
Each blockchain’s node needs to store a backup of all blocks, resulting in the whole network needs O(n) storage space, which greatly affects the nodes’ scalability. Parallel proof of vote(PPoV) is a permissioned blockchain algorithm that uses block groups as the basic data structures. This paper proposes a data lightweight scheme for PPoV. In the bock group generation stage, the BLS algorithm is used to realize signature aggregation, and the storage space of block signature and vote signature is reduced from O(n) to O(1) without affecting the performance. In the storage stage, we use erasure code to implement storage partition for block groups and ensure the real-time recoverability of complete data. To speed up reading, the timeline-based model applies different storage strategies for hot and cold data. The experimental results show that the empty block group generated by BLS aggregation signature is smaller and less sensitive to the number of nodes. And the reduction ratio of storage space under a large number of transactions can be similar to the number of normal nodes.