DAG Ledger Segmentation for P2P Network Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional blockchain systems face challenges in high-throughput, real-time data sharing and exchanging scenarios due to low transaction throughput, high transaction costs, and poor fault tolerance, making them unsuitable for applications like banks and exchanges.
Innovation Solution
A data-interoperability-oriented trusted processing method and system utilizing a peer-to-peer network with an Active List and Passive List, where nodes are categorized into Eager and Lazy Lists for message transmission and fault tolerance, employing a directed acyclic graph structure and random witness mechanisms to ensure secure and efficient data sharing and querying.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional blockchain systems use a chain structure ledger with global consensus mechanism, then data security and trust are improved, but transaction throughput decreases and transaction costs increase
Solution Approach 1:
The patent segments the monolithic blockchain consensus mechanism into multiple parallel directed acyclic graph (DAG) ledgers. Each DAG ledger operates independently with its own consensus process, allowing multiple transactions to be processed simultaneously rather than sequentially. This segmentation enables the system to maintain security through distributed consensus while dramatically improving throughput by eliminating the single-chain bottleneck.
Solution Approach 2:
The patent transitions from a one-dimensional linear chain structure to a multi-dimensional directed acyclic graph structure. Instead of a single sequence of blocks, the system uses multiple interconnected DAG ledgers that operate in parallel dimensions. This dimensional change allows transactions to be processed across multiple pathways simultaneously, increasing throughput while maintaining the cryptographic security guarantees of blockchain through the graph-based consensus mechanism.
2Stability of the object's composition
If traditional blockchain systems maintain a globally unified longest chain, then network consensus is achieved, but system complexity and synchronization overhead increase
Solution Approach 1:
The patent divides the single global consensus maintenance task into multiple independent DAG ledger consensus processes. Each DAG ledger maintains its own consensus state separately, eliminating the need for complex global synchronization. Nodes participate in multiple parallel consensus processes rather than coordinating a single global chain, reducing synchronization overhead while maintaining network consensus through distributed agreement across multiple ledgers.
Solution Approach 2:
The patent introduces DAG ledger structures as intermediary layers between individual transactions and the global network consensus. These DAG ledgers act as intermediate consensus units that aggregate transactions locally before integrating with the broader network state. This intermediary structure simplifies global consensus by breaking it down into manageable intermediate consensus steps, reducing the complexity of direct global synchronization.
3Reliability
If traditional blockchain systems adopt a chain structure for trusted exchange, then security against double spend attack is improved, but extendibility to high-throughput scenarios deteriorates
Solution Approach 1:
The patent segments the security verification process across multiple parallel DAG ledgers rather than relying on a single chain structure. Each DAG ledger independently verifies transactions and maintains security guarantees, allowing the system to scale to high-throughput scenarios by adding more parallel ledgers. This segmentation enables the system to adapt to different throughput requirements while maintaining security through distributed verification across multiple independent consensus units.
Solution Approach 2:
The patent transitions from a single-chain security model to a multi-dimensional DAG ledger security model. Instead of securing a single linear sequence of blocks, the system distributes security across multiple parallel graph-based ledgers. This dimensional expansion provides both the security guarantees needed for trusted exchange and the adaptability to scale to high-throughput scenarios by utilizing additional parallel dimensions for transaction processing.
Data Source
AI summary
A data-interoperability-oriented trusted processing method and system applied to a P2P network system are provided. The P2P network system includes a plurality of nodes. The trusted processing method includes a storage method and a query method. Firstly, a directed acyclic graph ledger structure is employed to be matched with an nRW consensus mechanism during a storage process, so that a supervision problem in a large-scale sharing exchange process is solved. Secondly, in a query process, a P2P network system is optimized by maintaining a tree structure with high fault tolerance and load balance through a hop optimization method to construct the P2P network system with a relatively balanced network, so that a query delay is not greatly influenced on the premise of ensuring the load balance, and an expandability of the system is ensured.