Multi-Linked Distributed Register for Low-Energy Block Preservation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed data register systems waste energy and computing resources due to the computational work of nodes competing to append blocks, leading to inefficiencies in data storage and retrieval processes.
Innovation Solution
A multi-linked data structure is implemented in the distributed register, allowing multiple valid blocks to be appended to a parent block with a hash stack, and a two-pointer algorithm is used for efficient data retrieval, reducing unnecessary searches and preserving multiple data records.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If nodes compete to append blocks through computational work, then data security is improved, but energy consumption and computing resource waste increase
Solution Approach 1:
The patent extracts the security verification function from the block appending process itself and separates it into a distinct validation mechanism. Nodes validate blocks through verification of cryptographic proofs and consistency checks rather than through competitive computational work, thereby maintaining security while eliminating energy waste from redundant computation.
Solution Approach 2:
The patent uses cryptographic hash copies and digital signatures to verify block authenticity and integrity. Instead of requiring nodes to perform computational work to create secure blocks, the system uses cryptographic copies (hashes) and signed proofs to establish security, dramatically reducing energy consumption while maintaining reliability.
2Ease of operation
If a single-chain data structure is used, then data retrieval is simplified, but multiple valid blocks cannot be preserved simultaneously
Solution Approach 1:
The patent transitions from a one-dimensional linear chain structure to a multi-dimensional structure where blocks can be organized in parallel sequences. The system introduces multiple chains or layers that branch from common ancestor blocks, allowing simultaneous preservation of multiple valid blocks while maintaining organized retrieval paths through dimensional separation.
Solution Approach 2:
The patent segments the single data retrieval path into multiple independent chains or sequences. Each chain can be traversed separately, allowing the system to preserve multiple valid blocks across different segments while maintaining simplified retrieval within each segment. The segmentation enables parallel organization of blocks that would otherwise conflict in a single-chain structure.
3Reliability
If computational validation is performed for each block append, then data integrity is improved, but processing speed decreases
Solution Approach 1:
The patent performs preliminary validation actions during block creation and propagation phases. Cryptographic proofs, signatures, and consistency checks are completed before the block appending process begins, allowing the actual append operation to proceed rapidly without intensive real-time computational validation. This preliminary action ensures integrity while maintaining high appending speed.
Solution Approach 2:
The patent replaces mechanical computational validation with cryptographic verification mechanisms. Instead of requiring intensive computational work to validate each block, the system uses mathematical proofs and cryptographic signatures that can be verified efficiently. This substitution maintains data integrity through rigorous validation while dramatically improving processing speed by eliminating computationally expensive operations.
Data Source
AI summary
A system is provided for preservation of multiple electronic data records within a distributed electronic data register. The system may use a stacked data structure within the distributed electronic data register that allows data records or blocks within the distributed electronic data register to include multiple links or pointers (e.g., hash values) to previous blocks, where previous blocks are linked to a single parent block. By using such a multi-link data structure, the system may prevent the waste of energy and/or computing resources associated with the computational work of the nodes for submitting blocks to be appended to the distributed electronic data register. The system may further use a two-pointer algorithm for traversing the multi-link distributed electronic data register, thereby providing for an efficient way to search for specific data records. The system thus provides a secure and efficient way to store data within a distributed electronic data register.