Block-Prefixed State Trie Nodes for Faster Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The performance degradation in blockchain state databases is significant due to the need to access the state database using random hash keys for trie node operations, which is inefficient and slows down transaction execution and verification processes.
Innovation Solution
A blockchain state database performance enhancement system and method using a state trie node, where nodes are stored based on a predetermined condition that ensures the prefix of their hash values matches the block number, optimizing trie node operations and reducing the need for random key access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If trie nodes are stored using random hash keys in the blockchain state database, then data integrity and reliability are ensured, but transaction execution and verification performance deteriorate significantly
Solution Approach 1:
The patent changes the key parameter for storing trie nodes from random hash values to structured keys composed of block number prefixes and node identifiers. This parameter transformation enables sequential access patterns while maintaining the cryptographic integrity requirements of blockchain, thereby resolving the contradiction between reliability and transaction execution speed.
Solution Approach 2:
The patent applies different storage strategies to different types of nodes based on their characteristics. Changed nodes (those modified from the previous block) are stored with optimized key structures that include block number prefixes, while unchanged nodes are handled differently. This localized optimization improves overall database performance without compromising data integrity.
2Measurement precision
If the entire state database is accessed for every transaction verification, then complete verification accuracy is achieved, but system performance and scalability worsen
Solution Approach 1:
The patent extracts only the necessary trie nodes for verification from the large state database by using optimized key structures that include block number prefixes. This extraction approach allows the system to access only relevant data portions rather than scanning the entire database, thereby maintaining verification accuracy while improving scalability.
Solution Approach 2:
The patent segments the state database access into smaller, targeted operations by organizing trie nodes with structured keys that include block number prefixes. This segmentation enables efficient retrieval of specific nodes needed for transaction verification without requiring access to the entire database, thus improving system scalability.
3Reliability
If hash values are computed for every node in the trie structure, then data integrity is maintained, but computational overhead and processing time increase
Solution Approach 1:
The patent performs preliminary hashing of node data during the block creation process, storing the computed hash values along with the node information. This preliminary action eliminates the need to recompute hashes during verification, maintaining data integrity while significantly reducing processing time for subsequent operations.
Solution Approach 2:
The patent stores pre-computed hash values as part of the node data structure, creating a copy of the hash result that can be used for verification without recalculating. This copying approach maintains integrity verification capability while reducing computational overhead and processing time.
Data Source
AI summary
A mining method performed by node devices connected to a blockchain network, comprises: a step in which a specific node device acquires a transaction including a first block having a first block number and a first trie node related to specific state data of the blockchain network, and state change data for changing the state of a specific account; a step in which the specific node device generates a second block including a second trie node and a second block number, the second trie node being generated based on the transaction and the first trie node; and a step in which, if the hash value of a second node corresponding to a state path-being a path from a specific leaf node corresponding to the specific account to a specific root node-among one or more second nodes included in the second trie node satisfies a predetermined criterion.