Cryptographically Verifiable Data Structure with Multi-Hop Links
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In decentralized blockchain environments, resource-constrained devices face challenges in efficiently verifying transactions due to the increasing size of the blockchain, which requires significant computing resources, and Simplified Payment Verification (SPV) methods still impose substantial bandwidth and power costs, while also being vulnerable to security weaknesses.
Innovation Solution
A cryptographically verifiable data structure with multi-hop backwards and forward links allows devices to verify transactions using a logarithmic number of records, reducing the computational burden and maintaining decentralized security by enabling efficient verification without relying on full-nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional blockchain verification is used, then transaction authenticity is verified, but computing resources and memory requirements increase linearly with blockchain size
Solution Approach 1:
The patent segments the blockchain verification process by introducing summary records that group multiple transaction records together. Instead of verifying every individual record, the system divides the blockchain into manageable segments represented by summary records, reducing the verification burden on resource-constrained devices while maintaining security through cryptographic proofs.
Solution Approach 2:
The patent adds a new dimensional layer to the traditional blockchain structure by introducing summary records that operate at a higher level of abstraction. This creates a multi-level verification structure where summary records provide logarithmic-time verification paths, transforming the linear verification complexity into a logarithmic one by adding this intermediate verification layer.
2Loss of energy
If SPV (Simplified Payment Verification) is used, then bandwidth consumption is reduced, but security vulnerabilities increase due to inability to verify proof-of-work blockchain
Solution Approach 1:
The patent introduces summary records as intermediary elements between the full blockchain and SPV clients. These summary records act as trusted mediators that provide cryptographic proofs of the underlying proof-of-work without requiring clients to download or verify every block. This intermediary layer maintains security by incorporating verifiable proof-of-work references while reducing bandwidth requirements.
Solution Approach 2:
The patent replaces the mechanical process of downloading and verifying every block header with a cryptographic substitution. Instead of mechanically processing each block, the system uses cryptographic summaries and proofs that can be verified with minimal data transfer, substituting heavy mechanical verification with efficient cryptographic validation.
3Reliability
If full blockchain download is performed for catch-up verification, then complete verification is achieved, but computing resources increase without bound over time
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing summary records that capture essential verification information. When catch-up verification is needed, devices can leverage these pre-prepared summaries rather than processing all intermediate blocks, significantly reducing the time and resources required for catch-up while maintaining complete verification integrity.
Data Source
AI summary
Data storage and retrieval systems, methods, and computer-readable media utilize a cryptographically verifiable data structure that facilitates verification of a transaction in a decentralized peer-to-peer environment using multi-hop backwards and forwards links. Backward links are cryptographic hashes of past records. Forward links are cryptographic signatures of future records that are added retroactively to records once the target block has been appended to the data structure.