State-Trie Node Mining for Faster Synchronization and Pool Resistance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The large size of state databases in account-based blockchains leads to significant performance degradation due to random key value access, and mining pools with excessive hash power can dominate the network, necessitating improved mining methods and transaction verification.
Innovation Solution
A blockchain system using state trie nodes that generate a second block based on a first block and a transaction, with nonce values calculated for changed nodes to satisfy a predetermined criterion, enhancing mining pool resistance and improving transaction synchronization speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the state database size increases to store more blockchain state data, then the blockchain can support more accounts and transactions, but the random key value access performance degrades significantly
Solution Approach 1:
The patent segments the state database into a trie data structure with multiple nodes (root node, intermediate nodes, and leaf nodes). Each node stores only a portion of the state data, allowing the system to handle large quantities of state data while maintaining efficient access. The segmentation transforms the single large database into a hierarchical structure where data is distributed across nodes, reducing the performance degradation associated with large database sizes.
Solution Approach 2:
The patent introduces a hierarchical dimension to the state database by organizing state data into a trie structure with multiple levels (depth). Instead of flat random access in a single database, the system navigates through dimensions of the trie structure (root → intermediate nodes → leaf nodes), enabling efficient access even as the overall state database grows. This dimensional organization allows the system to scale state storage without proportionally degrading access performance.
2Productivity
If mining pools aggregate more hash power to increase mining capability, then the mining efficiency and block production speed improve, but the network security and decentralization are compromised
Solution Approach 1:
The patent segments the mining task into multiple independent trie node hash calculations instead of a single block hash. Miners must calculate hashes for numerous trie nodes (root node, intermediate nodes, and leaf nodes) across the state database. This segmentation distributes the mining workload and makes it more difficult for mining pools to dominate, as the complexity increases with the number of nodes rather than being concentrated in a single calculation.
Solution Approach 2:
The patent changes the mining parameter from a single block header hash to multiple trie node hashes. The mining difficulty is now determined by the collective hash values of numerous trie nodes, fundamentally altering the mining mechanism. This parameter change increases the computational complexity and makes it harder for mining pools to aggregate effective hash power, thereby improving network security while maintaining mining productivity.
3Ease of operation
If the trie node structure is used to organize state data, then the data organization and retrieval efficiency improve, but the complexity of hash value calculation and verification increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing hash values in each trie node during the node creation and update process. Instead of calculating hashes on-demand during verification, the hash values are prepared in advance as part of the trie structure. This preliminary calculation reduces the complexity of verification operations, as nodes can be validated by comparing pre-computed hashes rather than performing complex calculations during each access operation.
Data Source
AI summary
According to an embodiment, a mining method performed by node devices connected to a blockchain network, includes: acquiring, by a specific node device, a transaction including state change data for changing the state of a specific account and a first block including a first trie node related to specific state data of the blockchain network; generating, by the specific node device, a second block including a second trie node based on the transaction and the first trie node; and generating, by the specific node device, a nonce value for a second node corresponding to a state 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, and determining whether a hash value derived based on the generated nonce value and the second node corresponding to the state path satisfies a predetermined criterion.