Log-Structured Merge Tree Blockchain Hash Integrity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data storage systems, particularly log-structured merge-trees, lack the ability to preserve blockchain properties during merge operations, which compromises the immutability and cryptographic proof of data sequences.
Innovation Solution
Embedding blockchain attributes within a log-structured merge-tree by generating and storing sequences of hashes that prove the sequential order of data values, allowing for the preservation of cryptographic proof during file merges, ensuring the integrity and order of data even after merging.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If merge operations are performed in log-structured merge-tree to improve storage efficiency and data management, then data consolidation and retrieval performance are improved, but the immutability and cryptographic proof of data sequences are compromised
Solution Approach 1:
The patent applies preliminary action by generating cryptographic hashes of data sequences before merge operations occur. These hashes are stored in advance as reference points, allowing the system to verify data integrity before and after merges. The hash generation and storage happens proactively, before any potential tampering or loss of immutability proof could occur during the merge process.
Solution Approach 2:
The patent implements feedback mechanisms by continuously verifying data sequences against stored hashes after merge operations. The system checks whether merged data maintains its cryptographic integrity by comparing post-merge data sequences with pre-stored hash values. This feedback loop ensures that any deviation from the original immutable state is detected, allowing the system to maintain reliability evidence even after productivity-improving merge operations.
2Reliability
If blockchain properties are embedded in log-structured merge-tree to preserve immutability, then data integrity and security are improved, but system complexity increases
Solution Approach 1:
The patent applies segmentation by separating the blockchain integrity mechanism into distinct, manageable components: hash generation modules, hash storage structures, and verification routines. Rather than integrating full blockchain complexity into the LSM-tree, the patent segments the solution into discrete cryptographic operations that can be independently implemented and maintained. This segmentation reduces overall system complexity while preserving the essential immutability guarantees.
Solution Approach 2:
The patent uses cryptographic hashes as intermediaries between the LSM-tree merge operations and blockchain immutability requirements. Instead of directly integrating complex blockchain consensus mechanisms with the storage system, the hash values serve as a simplified intermediary that captures the essential immutability property. This intermediary approach maintains data integrity without requiring the full complexity of blockchain technology.
3Measurement precision
If sequences of hashes are generated and stored for each file to provide cryptographic proof, then proof of sequential order is improved, but storage space requirements increase
Solution Approach 1:
The patent extracts only the essential cryptographic proof elements (hashes of data sequences) from the complete blockchain structure. Rather than storing entire blockchain blocks with all their metadata and consensus information, the patent extracts and stores only the minimal hash values needed to prove sequential order and data integrity. This extraction approach maintains measurement precision for verifying data sequence while significantly reducing the quantity of stored data.
Data Source
AI summary
An example operation may include one or more of storing data within a temporary memory structure, transferring the stored data from the temporary memory structure into a set of files of a log-structured merge-tree, generating a respective sequence of hashes within each file of the set of files, where the respective sequence of hashes provides proof of a sequential order in which data values are stored within the respective file, and storing the sequences of hashes in storage.