Structured DAG Transaction Assignment for Blockchain
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain technology faces a bottleneck in transaction capacity, with limited transactions per second (TPS), leading to inefficiencies such as high latency and the concentration of hashing power, resulting in low or no chance of processing low-fee transactions and wastage of hashing power due to high-fee transaction prioritization.
Innovation Solution
A transaction assignment method and apparatus based on a structured directed acyclic graph (DAG), where nodes calculate relative hashing power, partition transactions, create new blocks, and broadcast them, ensuring that transactions with low or no fees are processed without compromising security or decentralization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If blockchain uses traditional chain structure with proof of work, then security and decentralization are achieved, but transaction capacity is extremely limited
Solution Approach 1:
The patent segments the blockchain from a single linear chain into multiple parallel chains organized in a directed acyclic graph structure. Each chain can be processed independently, allowing simultaneous transaction processing across multiple chains, thereby increasing transaction capacity while maintaining security through distributed validation across the entire graph structure.
Solution Approach 2:
The patent transitions from a one-dimensional linear chain structure to a multi-dimensional DAG structure where blocks can be appended in parallel across multiple chains. This dimensional expansion enables concurrent transaction processing while maintaining cryptographic security through the same proof-of-work mechanism applied to each individual chain.
2Productivity
If block size is increased to increase transactions per second, then transaction capacity improves, but time to broadcast block increases leading to more forked blocks
Solution Approach 1:
The patent divides the transaction load across multiple parallel chains, each processing a subset of transactions. This segmentation allows smaller individual blocks to be broadcasted faster while collectively handling the same total transaction volume, reducing broadcast time and fork probability.
Solution Approach 2:
The patent enables continuous block creation across multiple chains simultaneously, with new blocks being appended to different chains at different times. This continuous parallel processing maintains system throughput while reducing individual block broadcast times through distributed operation.
3Productivity
If miners pack high-fee transactions to maximize reward, then mining efficiency improves, but transactions with low or no fees cannot be processed
Solution Approach 1:
The patent introduces local quality by allowing different chains to have different transaction fee requirements and priorities. Each chain can independently process transactions based on local conditions, enabling some chains to prioritize high-fee transactions while others process low-fee or free transactions, thus maintaining mining efficiency while improving transaction processing inclusivity.
Solution Approach 2:
The patent segments the transaction pool across multiple chains, allowing miners to distribute transactions with different fee characteristics to different chains. This segmentation enables high-fee transactions to be processed efficiently on some chains while low-fee transactions are processed on others, maintaining overall mining efficiency without excluding any transaction type.
4Stability of the object's composition
If hashing power concentration occurs to stabilize income, then miner income stability improves, but decentralization deteriorates
Solution Approach 1:
The patent segments the mining operation into multiple independent chains, allowing miners to distribute their hashing power across different chains. This segmentation enables income stabilization through diversified mining operations while maintaining decentralization by preventing concentration of control in a single chain or entity.
Solution Approach 2:
The patent creates a universal mining framework where any miner can participate in any chain regardless of their hashing power distribution. This multi-functionality allows miners to stabilize income through diverse chain participation while maintaining system decentralization through open access to all chains.
Data Source
AI summary
Transaction assignment method and apparatus based on a structured directed acyclic graph (DAG) executed by node devices in a peer-to-peer network are provided including: obtaining data structure of a local database; calculating relative hashing power of each node device by connection information between blocks in the structured DAG; partitioning transactions in the local transaction pool according to the relative hashing power of each node device; based on partitioning result, selecting a first transaction, creating a first new block, establishing connection(s) between the first new block and other blocks in the structured DAG, and removing the first transaction from the local transaction pool; broadcasting the first new block to other node devices in the peer-to-peer network. The invention effectively eliminates waste of hashing power caused by processing transactions with high fees by multiple nodes and increases the chance of processing transactions with low or no fees without sacrificing security and decentralization.