Unification Tree Structure for Monotonic Cryptocurrency Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain systems fail to simultaneously maintain monotonicity, consistency, causal coherence, and computational efficiency, leading to structural contradictions and impractical scalability.
Innovation Solution
Algorithm T implements a unification process that verifies consistency at the moment of data storage, ensuring monotonicity and consistency by integrating only logically consistent information, and uses timestamps to maintain causal order, thereby eliminating the need for post-processing verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blockchain systems store all transaction data to ensure consistency and reliability, then data integrity is improved, but computational load and processing time increase significantly
Solution Approach 1:
The patent segments the data storage structure into immutable blocks that contain only new transaction data, while maintaining references to historical data without duplicating it. This allows the system to preserve data integrity through complete historical records while reducing computational overhead by avoiding redundant data storage and verification across entire histories.
Solution Approach 2:
The patent implements preliminary verification of transaction consistency before data is committed to the immutable structure. By validating data integrity upfront through consensus mechanisms and cryptographic verification, the system ensures reliability without requiring continuous re-verification of all historical data during processing operations.
2Reliability
If blockchain systems verify consistency of all past transactions for each new transaction, then causal consistency is improved, but computational complexity increases
Solution Approach 1:
The patent implements feedback mechanisms where each block contains verification references to previous blocks, creating a chain of cryptographic proofs. This allows the system to maintain causal consistency by having each new transaction verify only its immediate predecessors through hash references, rather than re-verifying all historical transactions, thereby reducing computational complexity while preserving reliability.
3Reliability
If blockchain systems maintain complete transaction histories to ensure monotonicity, then data reliability is improved, but storage requirements and processing overhead increase
Solution Approach 1:
The patent implements a nested data structure where blocks are organized in a hierarchical manner with parent-child relationships. Each block contains essential transaction data and a reference to its parent block, creating a compact nested structure that maintains the complete transaction history for monotonicity verification while minimizing redundant data storage through shared historical references.
Data Source
AI summary
A cryptocurrency system includes a first server including a first controller, a first communication unit, and a first non-transitory storage medium; and a second server including a second controller, a second communication unit, and a second non-transitory storage medium, wherein the second controller includes a unification unit carrying out unification process, the first controller generates cryptocurrency comprised of tree-structured data, the second controller, when the second server receives the cryptocurrency from the first server, makes a temporary tree-structure of cryptocurrency candidate to be received from the first sever, the unification unit carries out the unification process to compare an attribute of the cryptocurrency to an attribute of the candidate cryptocurrency, and the unification unit generates a new tree-structure only when both of the attributes logically match each other.