Blockchain Data Transfer Verification Using Hash-Sum Comparison
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data transfer methods between storage systems are inefficient and unreliable, particularly when dealing with large volumes of data, as they fail to ensure data integrity and immutability, which is critical for sensitive information like financial or medical data.
Innovation Solution
A method utilizing a blockchain network to calculate and compare hash-sums of data before and after transfer, employing a Merkle tree data structure to verify data immutability by detecting changes in the root hash, ensuring data integrity and authenticity across multiple storage systems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If data transfer is performed between storage systems, then data mobility and storage optimization are improved, but data integrity and immutability verification becomes time-consuming and complicated
Solution Approach 1:
The system calculates and stores hash-sums of data blocks during the initial data placement phase, before any transfer occurs. These pre-calculated hash-sums are recorded on a blockchain network, creating a baseline for future verification. When data is transferred between storage systems, only the hash-sums need to be recalculated and compared, rather than verifying the entire data set, thus dramatically reducing verification time while maintaining data integrity assurance
2Reliability
If traditional data transfer verification methods are used, then the process is simpler, but data integrity and immutability cannot be reliably ensured for large volumes of data
Solution Approach 1:
The verification system divides large data sets into smaller blocks and calculates hash-sums for each block individually. These block-level hash-sums are then used to verify data integrity without requiring verification of the entire data set. This segmentation approach maintains high reliability for large volumes of data while keeping the verification process manageable and scalable
Solution Approach 2:
The system introduces hash-sums as an intermediary representation of the actual data. Instead of directly verifying the original data during transfers, the system verifies the hash-sums, which serve as compact, immutable certificates of data integrity. This intermediary approach simplifies the verification process while maintaining high reliability, as hash-sums are computationally easy to calculate and compare
3Reliability
If hash-sums are calculated and stored on blockchain for each data block, then data immutability verification reliability is improved, but computational overhead and storage requirements increase
Solution Approach 1:
The system calculates hash-sums only for data blocks that are actually transferred or modified, rather than recalculating hash-sums for the entire data set during each verification operation. This partial action approach maintains immutability verification reliability for the specific data being transferred while significantly reducing unnecessary computational overhead and energy consumption
Data Source
AI summary
Disclosed are system and method for verification of data transferred among several data storages. An exemplary method includes: calculating first hash-sums of the data during an initial placement in a data storage; transmitting the first hash-sums to at least one blockchain network; detecting a transfer of the data to a new data storage; calculating second hash-sums of the data after a placement of the data in the new data storage; transmitting the second hash-sums to the at least one blockchain network; comparing the first and second hash-sums of the data; and determining data immutability after the transfer of the data from the data storage to the new data storage based at least on results of the comparing.