Blockchain World State Chaining for Parallel Block Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain networks face challenges in ensuring data consistency when multiple blocks attempt consensus simultaneously, leading to potential inconsistencies in state data across nodes.
Innovation Solution
A method and apparatus that maintain world states of multiple blocks in a chained structure, where each block's world state points to its parent, allowing for simultaneous verification and ensuring consistency by updating states sequentially until they match the newest on-chain world state.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a consensus mechanism that allows multiple blocks to perform consensus at the same time is used, then the productivity of the blockchain system is improved, but the reliability of state data consistency deteriorates
Solution Approach 1:
The patent segments the state data into multiple isolated world states, each corresponding to a specific block height. Each world state is independently maintained with its own state root hash, allowing parallel consensus verification without interference. This segmentation enables multiple blocks to be verified simultaneously while preventing state data conflicts.
Solution Approach 2:
The patent introduces world state roots as intermediary elements that mediate between multiple blocks and the consensus mechanism. Each block contains a world state root that serves as a snapshot of the state at that block height, allowing consensus nodes to verify blocks independently without directly accessing or modifying other blocks' state data, thus maintaining consistency while enabling parallel processing.
2Speed
If multiple blocks are verified simultaneously through consensus, then the speed of block processing is improved, but the complexity of maintaining state consistency increases
Solution Approach 1:
The patent performs preliminary action by pre-calculating and storing the world state root hash for each block before consensus verification. This pre-computed root serves as a compact representation of the entire state at that block height, allowing consensus nodes to quickly verify blocks without needing to maintain or process the complete state data, thereby reducing complexity while maintaining speed.
Solution Approach 2:
The patent extracts the essential state information into a compact world state root hash that is stored in each block. This extraction separates the critical verification element (the root hash) from the detailed state data, allowing fast verification through the extracted root while the detailed state can be reconstructed only when needed, reducing the complexity of simultaneous state management.
Data Source
Figure 1
Figure 2a
Figure 2b
AI summary
Disclosed in the present application are a data processing method and apparatus based on a blockchain, and a device and a readable storage medium. The method comprises: creating a first world state corresponding to an initial block; updating the first world state on the basis of a transaction in the initial block, so as to obtain an initial updated state, and performing clean state tree construction processing for the initial updated state on the basis of a world state chain, so as to obtain an updated first world state that includes the current clean world state tree; writing into the initial block a first world state root which corresponds to the current clean world state tree, so as to obtain a block to be chained; and if a consensus on the block to be chained is passed, writing into a blockchain the block to be chained, submitting, by means of the world state chain and level by level, the updated first world state to the latest chained world state, and determining the updated first world state as a new consensus root world state. By using the present application, world states of a plurality of blocks can be maintained, thereby ensuring the consistency of state data.