Some Byzantine fault tolerant (BFT) consensus algorithm in consortium blockchains have lots of message broadcast to encroach bandwidth, which greatly affect the efficiency of consensus execution. Although reducing the number of global consensus nodes can help, it is also at the cost of reduced security. Based on the idea of Mimic Defense, this paper proposes a consensus framework for BFT consensus and takes the Parallel Proof of Vote (PPoV) algorithm as an example to design a randomized node sharding and role partitioning scheme to improve security of the consensus process without affecting efficiency much. In addition, the multimode adjudication group composed of the shard leaders can replace the single leader to complete voting statistics to improve the reliability of consensus results. Through theoretical analysis, it is known that the BFT consensus framework based on mimic security, taking PPoV as an example, has a strong defense effect against eclipse attacks and selfish mining. A simulation experiment is also designed to prove that through efficient iteration and dynamic threshold design, the adjudication group greatly improves the reliability of the results and the robustness of the algorithm.

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.