DAG Blockchain Consensus via Temporal Order Transformations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain consensus protocols, especially in directed acyclic graph (DAG) formats, face challenges in determining a sequential order of blocks efficiently, leading to slow processing speeds and increased vulnerability to attacks due to complex block relationships and lack of mandated coordination among peers.
Innovation Solution
A system that receives a chain of blocks from a blockchain in DAG format, identifies temporal relationships based on the structure of the blocks, and determines a sequential linear order using transformations such as parent, cycle, and path transforms, allowing for parallel addition of blocks without proof-of-work or endorsement protocols, thereby improving consensus protocol efficiency and security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a DAG format is used to allow blocks to be added without proof-of-work or voting, then block addition speed is improved, but determining consensus order becomes more difficult
Solution Approach 1:
The patent segments the block addition process into two independent phases: (1) block submission and validation, where blocks are added to the DAG without consensus requirements, and (2) consensus order determination, where temporal relationships are identified through graph transformations. This segmentation allows blocks to be added at high speed while separating the complexity of order determination into a post-processing step.
Solution Approach 2:
The patent introduces an intermediary transformation process that converts the DAG structure into a linear sequence through graph transformations (parent transform, cycle transform, path transform). This intermediary step mediates between the parallel block additions and the sequential consensus order, making the complex relationship management tractable.
2Reliability
If traditional consensus protocols (proof-of-work or voting) are used, then security and integrity are improved, but processing speed deteriorates
Solution Approach 1:
The patent performs preliminary validation of blocks against the DAG structure before final consensus order determination. Blocks are pre-processed and added to the DAG without requiring full consensus, then later transformed into a linear order. This preliminary action separates security validation from consensus speed requirements.
Solution Approach 2:
The patent replaces traditional mechanical consensus mechanisms (proof-of-work computational puzzles or voting processes) with a graph-theoretic approach using DAG transformations. The security and ordering functions are achieved through structural relationships in the graph rather than computational or voting mechanisms.
3Productivity
If blocks are added without hindrance in DAG format, then productivity is improved, but the blockchain becomes a random tangle difficult to manage
Solution Approach 1:
The patent applies dynamic transformations to the DAG structure to convert it from a static random tangle into a dynamic linear sequence. Through parent transform, cycle transform, and path transform operations, the system dynamically reorganizes the block relationships to produce a manageable linear order while preserving the parallel addition benefits.
Solution Approach 2:
The patent changes the structural parameters of the blockchain from a parallel DAG arrangement to a sequential linear order through graph transformations. By transforming the connectivity parameters and temporal relationships, the system maintains high block addition rates while producing an ordered structure that is easy to manage and process.
Data Source
Figure 1A
Figure 1B
Figure 1C
AI summary
An example operation may include one or more of receiving a chain of blocks from a blockchain comprising a directed acyclic graph (DAG) format in which blocks are independently hash-linked to multiple blocks, identifying temporal relationships between blocks in the chain of blocks based on a structure of the chain of blocks in the DAG format, determining a sequential linear order of the chain of blocks in the DAG format based on the identified temporal relationships, and storing the sequential linear order of the chain of blocks.