Blockchain Consensus Handling Time Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In existing blockchain technologies, service data often waits for consensus for a long time due to selection based on attribute values, leading to low processing efficiency.
Innovation Solution
A blockchain consensus method where nodes determine and store the handling time of service data, selecting service data for consensus based on this handling time to ensure balanced processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If service data is selected for consensus based on attribute values in descending order, then nodes can systematically select service data within block capacity limits, but service data with smaller values waits for consensus for a relatively long time, causing low processing efficiency
Solution Approach 1:
The patent inverts the traditional selection criterion from attribute values (transaction amount, gas price) to arrival time of service data. Instead of selecting data with highest values first, the system selects data that has been waiting longest (oldest arrival time), ensuring fair processing and preventing data with smaller values from waiting indefinitely.
Solution Approach 2:
The patent changes the selection parameter from economic attributes (transaction amount, gas price) to temporal attribute (arrival time). This parameter change transforms the selection mechanism from value-based to time-based, ensuring that all service data is processed in a fair sequence regardless of its economic value.
2Ease of operation
If service data is selected based on values corresponding to specified attributes, then nodes can prioritize high-value transactions, but service data with smaller values experiences significantly longer waiting times
Solution Approach 1:
The patent inverts the selection logic from prioritizing high-value data to prioritizing oldest data. The selection criterion is flipped from economic importance to temporal precedence, ensuring that the selection mechanism remains simple (first-come-first-served) while eliminating the time penalty for lower-value transactions.
3Reliability
If block capacity is limited to maintain blockchain stability, then the blockchain can operate reliably, but service data exceeding block capacity must wait for multiple blocks, increasing consensus waiting time
Solution Approach 1:
The patent implements preliminary ordering of service data by arrival time before the consensus process. By pre-sorting data in temporal order, the system ensures that when blocks are filled to capacity, the oldest waiting data is always selected first, minimizing overall waiting time while maintaining block capacity limits for stability.
Data Source
AI summary
This specification describes techniques for performing blockchain consensus. An example method performed by a first node in a blockchain includes: receiving first service data; determining a corresponding handling time of the first service data; storing the first service data including the corresponding handling time at a cache, in which the cache stores multiple pieces of additional service data, and in which each piece of additional service data is associated with a respective handling time; determining whether a consensus needs to be performed on at least two pieces of service data; in response to determining that the consensus needs to be performed, selecting the at least two pieces of service data according to a sequence that is based on handling times associated with the at least two pieces of service data; and performing the consensus on the more than one pieces of service data according to the sequence.