Consortium Blockchain Consensus Using Erasure Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current consortium blockchain systems using the Practical Byzantine Fault Tolerance (PBFT) algorithm incur high network bandwidth and storage space overheads due to the need for redundant data transmission during the consensus process.
Innovation Solution
Implementing erasure coding (EC) technology to divide proposed data into data blocks with corresponding hash values, which are then sent and verified by backup consensus nodes, reducing the need for redundant data transmission and improving resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundant proposed data is sent to ensure fault tolerance in PBFT protocol, then reliability is improved, but network bandwidth and storage space are wasted
Solution Approach 1:
The patent segments the proposed data into multiple data blocks and applies different erasure coding strategies to each block. Some blocks use strong coding for high reliability, while others use weak coding or no coding for low overhead. This segmentation allows the system to achieve overall fault tolerance while minimizing total resource consumption.
Solution Approach 2:
The patent applies local quality by using different erasure coding strengths for different data blocks based on their specific requirements. Critical data blocks receive stronger coding protection, while less critical blocks use weaker coding, optimizing the balance between reliability and resource usage in different local regions of the data.
2Loss of substance
If erasure coding technology is used to divide proposed data into data blocks, then network bandwidth and storage space overheads are reduced, but system complexity increases
Solution Approach 1:
The patent uses hash values as simplified copies or representations of the actual data blocks. Instead of transmitting and storing complete redundant data, the system transmits hash values that serve as verification copies, dramatically reducing bandwidth and storage requirements while maintaining verification capability.
Solution Approach 2:
The patent changes the parameter of data representation from full data blocks to hash values for verification purposes. This parameter change reduces the amount of data that needs to be transmitted and stored, simplifying the system's resource requirements while maintaining the ability to verify data integrity.
3Reliability
If hash values are transmitted via PBFT protocol messages for verification, then data integrity is ensured, but consensus process time increases
Solution Approach 1:
The patent performs preliminary hashing of data blocks before the main consensus process. By pre-computing hash values and making them available in advance, the system avoids time-consuming verification computations during the critical consensus phase, thereby reducing overall consensus process time while maintaining data integrity verification.
Data Source
Figure 1~2
Figure 3
AI summary
Embodiments of the disclosure disclose a consensus method of a consortium blockchain, and a consortium blockchain system. The method includes: dividing, by a primary consensus node, proposed data subject to consensus into data blocks corresponding to backup consensus nodes based on the erasure coding (EC) technology, where the data blocks obtained by dividing the proposed data correspond to hash values calculated based on the EC technology; sending, by the primary consensus node, the data blocks obtained by dividing the proposed data to the corresponding backup consensus nodes; forwarding, by a backup consensus node that received a data block sent by the primary consensus nodes, the data block to one or more other backup consensus nodes; initiating, by the primary consensus nodes, a consensus of the proposed data based on a Practical Byzantine Fault Tolerance (PBFT) protocol, to send a hash value of the data block obtained by dividing the proposed data to the backup consensus node via a PBFT protocol message; and performing, by the backup consensus node, based on the hash value of the data block in the PBFT protocol message, a verification on the data block obtained by dividing the proposed data, to execute a consensus logic of the PBFT protocol on successfully verified proposed data.