Blockchain Historical Record Correction via Linked Block Addresses
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current systems for reading and correcting historical records in distributed ledgers, such as blockchain networks, face challenges due to the immutability of blockchain implementations and the complexity of tracking block numbers for record retrieval and correction.
Innovation Solution
A method and system for sequentially reading and storing historical data on a blockchain network by determining data blocks associated with timestamps, identifying linked addresses, and generating notifications for historical data, while allowing for correction of records by updating links and calculating metrics based on historical data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blockchain immutability is maintained, then data integrity and security are improved, but the ability to correct historical records deteriorates
Solution Approach 1:
The patent creates a copy of the original historical record with correction data and stores it in a new block, while maintaining the original immutable block. This allows correction functionality while preserving blockchain immutability, as the corrected version is a separate copy that can be traced back to the original through the linkage mechanism.
2Speed
If block numbers are tracked in an off-chain hash table, then record retrieval is improved, but system complexity and external dependency increase
Solution Approach 1:
The patent extracts the block number tracking functionality from the off-chain hash table and integrates it directly into the blockchain structure by storing block numbers within the chain itself. This eliminates the external dependency on off-chain components while maintaining efficient retrieval capabilities.
Solution Approach 2:
The patent merges the record retrieval mechanism with the blockchain structure by embedding block number information directly in the chain. This combines the advantages of both the blockchain's immutability and the hash table's efficient lookup into a single integrated system.
3Reliability
If historical records are stored sequentially in the blockchain, then data integrity is improved, but retrieval efficiency and traversal complexity deteriorate
Solution Approach 1:
The patent performs preliminary organization of historical records by storing block numbers sequentially within the blockchain structure during the recording phase. This preliminary arrangement enables efficient retrieval later without requiring complex traversal algorithms, as the data is already positioned for optimal access.
Data Source
AI summary
Systems and methods for implementing historical data correction on a blockchain network. The method includes receiving historical data corresponding to a timestamp. The method also includes determining a first data block at a first address in a blockchain associated with the timestamp. The method further includes identifying a second address stored in the first data block corresponding to a second data block at the second address in the blockchain. The method also includes storing the historical data and the second address corresponding to the second data block in a third block at a third address in the blockchain. The method further includes calculating corrected metrics based on at least the historical data stored in the third data block. The method also includes generating a notification including an indication associated with the calculated corrected metrics.