Blockchain Consensus Sharding to Eliminate Leader Node Bottlenecks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The large volume of data transmitted by a leader node in a blockchain network can cause a single-point bottleneck, leading to communication inefficiencies and potential collapse.
Innovation Solution
The data is divided into smaller shards and transmitted to multiple consensus nodes, allowing each node to reconstruct the original data and reach consensus, reducing the overall data volume transmitted by the leader node.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the leader node transmits the complete service block to each consensus node, then all nodes can reach consensus on the complete data, but the data transmission volume becomes excessively large causing a single-point bottleneck
Solution Approach 1:
The service block is divided into multiple shards (first shard data, second shard data, etc.). The leader node transmits only one shard to each consensus node instead of the complete block. Each node reconstructs the complete service block by combining its received shard with shard data transmitted by other consensus nodes, thereby reducing transmission volume while maintaining consensus accuracy.
2Reliability
If the leader node transmits large volume data to all consensus nodes, then complete consensus can be reached, but the leader node becomes a single-point bottleneck reducing network stability
Solution Approach 1:
By segmenting the service block into multiple shards and distributing them to different consensus nodes, the system eliminates the single-point bottleneck at the leader node. Each node receives and transmits only a portion of the data, distributing the transmission load across the network and reducing dependency on the leader node's bandwidth capacity.
Solution Approach 2:
Each consensus node combines its received shard data with shard data transmitted by other nodes to reconstruct the complete service block. This merging process at each node ensures consensus completeness without requiring the leader node to transmit the entire block to all nodes simultaneously.
3Reliability
If the leader node sends complete service block data to each node, then data integrity is maintained, but communication efficiency decreases due to excessive data volume
Solution Approach 1:
The service block is segmented into multiple shards that are transmitted separately to different consensus nodes. This segmentation reduces the data transmission volume for each node while maintaining data integrity through the reconstruction process, thereby improving communication efficiency without sacrificing reliability.
Solution Approach 2:
Each consensus node creates a copy of the complete service block by combining its received shard with shards transmitted by other nodes. This copying mechanism ensures data integrity at each node while the segmented transmission approach improves communication efficiency by reducing the initial transmission burden on the leader node.
Data Source
AI summary
A consensus processing method includes: obtaining an associated set, the associated set including a plurality of pieces of block associated data, the plurality of pieces of block associated data including a plurality of pieces of block shard data, and the plurality of pieces of block shard data being obtained by dividing a service block on which consensus is to be reached; transmitting a part of the block associated data in the associated set to the second consensus nodes, so that the second consensus nodes broadcast, to each other, the block associated data received by each other and restore the service block; and reaching consensus on the service block between the first consensus node and the plurality of second consensus nodes.