Tree-Graph Block Sequencing for Blockchain Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain consensus algorithms, whether based on chain or DAG structures, fail to fully utilize network computing and bandwidth resources, leading to low system throughput due to limitations in block sequencing and consensus mechanisms.
Innovation Solution
A block sequencing method and system based on a tree-graph structure, where blocks are linked according to reference relationships, with a pivot chain selected using the heaviest subtree rule, allowing for multiple blocks to obtain consensus and improving throughput by dividing blocks into Epochs and sorting them in a time sequence.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a chain structure is used for blockchain consensus, then data consistency is ensured, but system throughput is limited due to only one block obtaining consensus per time period
Solution Approach 1:
The patent segments the blockchain into multiple parallel chains (first chain, second chain, third chain, etc.) instead of using a single chain structure. Each chain can independently process and reach consensus on blocks simultaneously, allowing multiple blocks to be confirmed in parallel within the same time period, thereby increasing system throughput while maintaining data consistency through the sorting mechanism.
2Productivity
If a DAG structure is used for blockchain consensus, then computing capability and bandwidth resources are better utilized, but block sequencing complexity increases and block utilization rate decreases
Solution Approach 1:
The patent introduces a sorting device as an intermediary component that receives blocks from multiple chains and performs topological sorting to determine the final sequence. This mediator handles the complexity of block sequencing centrally, allowing the parallel chains to operate independently without complex inter-chain sequencing logic, thus reducing overall system complexity while maintaining high resource utilization.
3Productivity
If multiple parallel chains are used to increase throughput, then more blocks can obtain consensus simultaneously, but determining the sequence of blocks across chains becomes more complex
Solution Approach 1:
The patent changes the sequencing parameter from complex cross-chain topological relationships to a simpler time-based and chain-based ordering mechanism. Blocks within each chain are sequenced by time, and chains themselves are ordered (first chain, second chain, etc.), providing a clear and simple global sequencing rule that maintains low complexity while enabling high throughput through parallel chain operation.
Data Source
AI summary
The present invention relates to a block sequencing method based on a tree-graph structure, comprising of: linking all blocks into a tree-graph structure according to reference relationships; selecting one pivot chain from the tree-graph structure and taking all blocks in the pivot chain as pivot blocks; dividing all blocks into a plurality of Epochs according to a time sequence arrangement of the pivot blocks; sorting the blocks in the Epoch to obtain a set sequence of the Epoch in time sequence; and obtaining a global sequence of all blocks of the tree-graph structure based on all set sequences. The present invention also relates to a block sequencing system based on the tree-graph structure, a data processing terminal for sequencing blocks by the block sequencing method, and a P2P network using the data processing terminal.