Two-Dimensional Merkle Tree Data Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing Merkle tree-based data management methods are inefficient in reducing the total amount of hash function calculations required for data integrity verification and management, particularly when dealing with large datasets.
Innovation Solution
A two-dimensional Merkle tree structure is introduced, where data is aligned into a square matrix, and hash values are calculated for rows and columns, with additional rows and columns generated to reduce the number of hash calculations needed to verify data integrity, allowing for efficient data management and integrity verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a traditional one-dimensional Merkle tree structure is used for data integrity verification, then the data can be verified, but the total amount of hash function calculations is large and computational load is high
Solution Approach 1:
The patent transforms the traditional one-dimensional Merkle tree structure into a two-dimensional square matrix structure. Data is arranged in a 2D grid where rows and columns form additional verification paths. This dimensional change enables parallel hash calculations across rows and columns, significantly reducing the total number of hash operations required for data integrity verification while maintaining verification reliability.
2Productivity
If data is organized in a two-dimensional square matrix with additional rows and columns, then computational load is reduced, but data management complexity increases
Solution Approach 1:
The patent segments the data into a two-dimensional square matrix structure with clear row and column divisions. Each row and column can be independently processed for hash calculations, allowing modular computation. The additional row and column are systematically generated from existing data, providing structured organization that manages complexity through regular patterns rather than arbitrary arrangements.
Solution Approach 2:
The two-dimensional matrix structure serves multiple functions simultaneously: it enables parallel hash calculations for efficiency, provides redundant verification paths for reliability, and creates a systematic organization for data management. The same structural framework supports both data storage and integrity verification operations, reducing overall system complexity despite the enhanced functionality.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A Merkle tree-based data management method may comprise: aligning data into two-dimensional square matrix; calculating a hash value of each node of the two-dimensional square matrix; calculating hash values of each row of the two-dimensional square matrix; generating an additional column with nodes having the hash values of each row; calculating hash values of each column of the two-dimensional square matrix; generating an additional row with nodes having hash values of each column; and calculating a Merkle root by concatenating the hash values of the additional column and the hash values of the additional row.