Blockchain Consensus Checkpoint Rounds for Stable State Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain consensus algorithms waste memory and computing resources due to the need to record and verify execution results of all nodes, leading to instability and reduced scalability.
Innovation Solution
Implement a checkpoint round in the consensus process where transaction execution results are verified only after a preset number of nodes agree, allowing for flexible customization and reducing the impact of transaction execution on consensus stability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all nodes execute and verify transactions in every consensus round, then transaction execution consistency is ensured, but consensus stability deteriorates due to resource waste and execution impact
Solution Approach 1:
The consensus process is segmented into different round types: checkpoint rounds where full transaction execution and verification occur, and non-checkpoint rounds where only proposal block validation is required. This segmentation allows the system to balance between consistency verification and resource conservation, improving consensus stability while reducing computing resource waste.
Solution Approach 2:
In non-checkpoint rounds, nodes perform partial verification by validating only the proposal block without executing all transactions. This partial action reduces resource consumption while maintaining adequate verification, resolving the contradiction between full verification reliability and resource efficiency.
2Reliability
If all nodes record and verify execution results of every block, then state consistency is ensured, but memory resources are wasted
Solution Approach 1:
The patent extracts the full transaction execution and verification process from every consensus round and confines it to only checkpoint rounds. In non-checkpoint rounds, nodes extract and validate only essential proposal block information without recording complete execution results, thereby ensuring state consistency while significantly reducing memory resource consumption.
Solution Approach 2:
Checkpoint rounds are performed preliminarily at specific intervals to establish trusted state snapshots. These preliminary full verifications provide reference points that eliminate the need for continuous full verification in between, reducing memory usage while maintaining state consistency.
3Measurement precision
If a tree of all historical states is maintained, then state verification accuracy is improved, but design complexity increases
Solution Approach 1:
The historical state verification is segmented into checkpoint states (fully verified at interval points) and intermediate states (validated through proposal block chains). This segmentation maintains verification accuracy for checkpoint states while simplifying intermediate state handling, reducing execution module complexity.
Solution Approach 2:
Proposal blocks serve as intermediary structures that link checkpoint states without requiring full historical state trees. Nodes validate intermediate states through proposal block references rather than maintaining complete historical state trees, improving verification accuracy while reducing system complexity.
Data Source
AI summary
Provided are a consensus method and apparatus for a blockchain, a server and a storage medium. A checkpoint round is designed without waiting for transaction execution results of all nodes in each consensus round so as to reduce the impact of transaction execution on consensus and improve consensus stability. A newly created block comprises an execution result and status of a preorder block of the blockchain. Only the consistency of the newly created block is verified to avoid wasting memory resources and computing resources. The checkpoint round can be customized to improve the scalability of consensus algorithms.