Blockchain Receipt System with History Trees for Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain systems face scalability issues due to lengthy settlement times and vulnerabilities in verification mechanisms, particularly in decentralized networks where intermediate nodes may become unavailable, making it difficult to confirm transactions and detect tampering.
Innovation Solution
Incorporating a receipt system that utilizes validator identifiers and history trees to provide irrefutable proof of transaction entry into a blockchain, allowing for efficient verification and reducing storage requirements through pruning and archiving of history trees, while maintaining the integrity of the blockchain.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If proof of work arrangement is used for blockchain reconciliation, then security and decentralization are improved, but settlement time increases to minutes or seconds
Solution Approach 1:
The patent segments the blockchain verification process by introducing history trees that store only essential verification data (hashes and validator identifiers) rather than complete block data. This allows the system to maintain security through distributed validation while enabling faster verification by working with segmented, compressed data structures.
Solution Approach 2:
The patent applies preliminary action by pre-computing and storing history trees that contain all necessary verification information in advance. These history trees are built incrementally as blocks are added to the blockchain, so when verification is needed, the data is already prepared and available, eliminating the need for time-consuming real-time computations.
2Measurement precision
If complete blockchain data is stored for verification, then verification accuracy is improved, but storage requirements and system complexity increase
Solution Approach 1:
The patent extracts only the essential verification elements from complete blockchain data to create history trees. Instead of storing and processing entire block data, the system extracts and stores only the hash values, validator identifiers, and chain links needed for verification. This extraction maintains verification accuracy while dramatically reducing storage requirements and system complexity.
Solution Approach 2:
The patent inverts the traditional approach by having nodes store and verify against history trees rather than storing complete blockchain data. The history trees serve as the primary verification structure, and complete block data can be discarded after verification. This inversion allows verification to proceed with minimal stored data while maintaining security and accuracy.
3Loss of substance
If intermediate nodes are removed to save storage, then storage efficiency is improved, but ability to verify block existence deteriorates
Solution Approach 1:
The patent creates compressed copies of blockchain data in the form of history trees. These history trees are compact representations that contain all necessary verification information in a space-efficient format. Nodes can store these copied, compressed structures instead of complete block data, enabling verification while minimizing storage requirements.
Solution Approach 2:
The patent changes the data structure parameters by transforming detailed block data into condensed history tree structures with different organizational parameters. The history trees use hierarchical organization with hash links that provide the same verification capability as complete data but with optimized storage parameters, allowing efficient verification with minimal storage.
Data Source
AI summary
An event is registered in at least one node server in a directed data structure, which comprises a computationally linked series of nodes such that each node encodes information included in at least one preceding node. Within at least selected nodes of the directed data structure after at least one initial node, a representation of at least one history data structure is included and has a highest-level value computed based on inputs of lowest level input values, at least one said lowest level input value encoding node-specific information of at least one preceding node. In a verification phase, a purportedly valid lowest level input value is verified by recomputing the corresponding highest-level value from the representation of the history data structure included in the corresponding node.