Merkle Tree Root Hash for Blockchain File Authenticity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain technology faces limitations in processing large volumes of data and transactions due to low bandwidth and high transaction costs, making it inefficient and expensive for storing and verifying file authenticity in large datasets.
Innovation Solution
A method and system that utilize a Merkle tree structure to compute a root hash value from multiple file hash values, allowing for efficient storage and verification of file authenticity on a blockchain network, reducing the need for multiple transactions and minimizing bandwidth usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all file hash values are stored directly in the blockchain network, then file authenticity verification is straightforward, but transaction costs increase significantly and bandwidth capacity is exceeded
Solution Approach 1:
The patent segments the file verification process into two parts: (1) storing only the root hash in the blockchain, and (2) storing individual file hashes in traditional storage systems. This segmentation reduces blockchain transaction load while maintaining verification capability through the Merkle tree structure.
Solution Approach 2:
The patent introduces a Merkle tree as an intermediary structure between the blockchain and individual files. The root hash of the Merkle tree serves as a mediator that represents all file hashes, allowing verification without storing each hash individually in the blockchain.
2Measurement precision
If multiple individual file hash transactions are processed through the blockchain network, then each file's authenticity is individually certified, but the bandwidth limitation causes processing delays and high costs
Solution Approach 1:
The patent merges multiple individual file hash transactions into a single transaction by computing the root hash of the Merkle tree that contains all file hashes. This combining approach maintains individual file authentication capability while dramatically reducing transaction processing requirements.
Solution Approach 2:
The patent performs preliminary computation of the Merkle tree structure and root hash before submitting to the blockchain. This preliminary action prepares the data in advance, allowing efficient batch verification without requiring multiple separate blockchain transactions.
3Loss of information
If the blockchain network stores detailed file information, then complete audit trails are maintained, but storage costs and transaction fees become prohibitive for large datasets
Solution Approach 1:
The patent creates a condensed copy of the file information structure (Merkle tree) where only the root hash is stored in the expensive blockchain storage, while the detailed file hash information is copied to and stored in cheaper traditional storage systems. This copying strategy maintains audit trail completeness at reduced cost.
Data Source
AI summary
A system and method for authenticating data files using a block chain network. An exemplary method includes identifying data files in electronic data storage, computing hash values for files, adding pairs of the hash values and computing hash values for each resulting pair, continuing this process to a root level of a hash tree, and sending the root hash to a blockchain network in which one or more nodes in the blockchain network adds the hash value as one or more blocks in a blockchain.