Assembled Blockchain Transactions for Fixed Execution Order
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In consortium blockchains, first-in-first-out transaction rules can be disrupted by network conditions, leading to inconsistent execution orders, which is problematic for applications requiring fixed transaction sequences, and current workarounds like waiting for previous transactions to complete significantly impact performance.
Innovation Solution
A transaction method and apparatus that generates assembled transactions with a fixed execution order by adding reserved fields and using assembly rules, allowing for sorting and sequencing without modifying the existing system, ensuring transactions are executed in a predetermined order.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If first-in-first-out rules are used for transaction execution, then network simplicity is maintained, but execution order consistency deteriorates due to network disruptions
Solution Approach 1:
The patent applies preliminary action by adding reserved fields (transaction identifier, total number of transactions, serial numbers) to transactions before they are submitted to the pool. This pre-arranged structure enables the system to automatically reconstruct and enforce a fixed execution order without requiring complex real-time coordination or network consensus mechanisms, thus maintaining network simplicity while ensuring execution order consistency.
2Productivity
If node operators modify filtering rules to favor their own transactions, then their transaction priority is improved, but synchronization across all users deteriorates
Solution Approach 1:
The patent implements universality by designing a standardized reserved field structure that all node operators must adopt. This universal format includes transaction identifier, total transaction count, and serial number fields that work consistently across all nodes regardless of operator preferences. The system processes all transactions through the same assembly rule mechanism, ensuring synchronization consistency while still allowing operators to prioritize their transactions through the standardized serial number assignment.
3Reliability
If transactions are sent sequentially waiting for previous transactions to complete, then execution order accuracy is improved, but processing performance deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-assigning serial numbers and transaction identifiers to multiple transactions before they are submitted to the pool. The reserved fields contain all necessary ordering information in advance, allowing the system to process multiple transactions in parallel while maintaining accurate execution order through the pre-established serial number sequence, thus improving processing performance without sacrificing execution order accuracy.
Solution Approach 2:
The patent introduces an intermediary mechanism in the form of reserved fields that act as a mediator between transaction submission and execution. These fields contain transaction identifier, total number of transactions, and serial number information that mediates the ordering process, allowing the system to determine execution order without requiring sequential waiting or complex real-time coordination between transactions.
4Reliability
If assembled transactions with reserved fields are implemented, then execution order control is improved, but transaction structure complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the transaction structure into distinct functional components: standard transaction fields and reserved fields. The reserved fields are further segmented into specific elements (transaction identifier, total number of transactions, serial numbers). This segmentation isolates the complexity of execution order control into a dedicated structure, making it easier to manage and process while keeping the overall system architecture clean and modular.
Data Source
AI summary
Provided are a transaction method and apparatus with a fixed execution order, and relates to the technical field of computers. According to one alternative implementation, the method includes: transactions to be executed are received, generating an assembled transaction is generated with the transactions having a same identifier based on an assembly rule, and the assembled transaction to a transaction pool is sent; parsing, in response to acquiring a transaction from the transaction pool, the assembled transaction which is acquired to obtain a transaction list; and transaction execution is performed based on an execution order of each transaction in the transaction list.