Blockchain Transaction Grouping by Contract Mapping Identity

Solution Overview

Problem

Existing blockchain transaction grouping methods are inefficient, leading to high computational and storage resource usage, and lack effective parallelism in transaction execution.

Innovation Solution

Transactions invoking the same contract are grouped based on the mapping relationships of accessed variables, determining storage positions in the state database, thereby reducing the need for pre-execution key retrieval and optimizing transaction grouping.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If transactions are grouped using existing methods, then transaction grouping is achieved, but computational load and storage resource usage are high

Engineering Contradiction:

Improvetransaction grouping efficiencyVSAvoidcomputational load

Core Design Contradiction:

ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing mapping relationship identities for contract variables during contract deployment or compilation. This allows transaction grouping to directly use pre-computed identities without performing expensive key derivation operations at transaction processing time, thereby reducing computational load while maintaining grouping efficiency

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent uses copying by creating and storing mapping relationship identity information in advance during contract deployment. These pre-computed identities are then copied and reused during transaction grouping operations, eliminating the need to re-compute key derivation operations for each transaction group, thus reducing both computational load and energy consumption

Inventive Principle:

Principle #26Copying

2Productivity

If transactions are grouped using existing methods, then transaction grouping is achieved, but storage resources are consumed

Engineering Contradiction:

Improvetransaction grouping efficiencyVSAvoidstorage resources

Core Design Contradiction:

ProductivityVSQuantity of substance

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing mapping relationship identities for contract variables during contract deployment or compilation. This allows transaction grouping to directly use pre-computed identities without performing expensive key derivation operations at transaction processing time, thereby reducing computational load while maintaining grouping efficiency

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent uses copying by creating and storing mapping relationship identity information in advance during contract deployment. These pre-computed identities are then copied and reused during transaction grouping operations, eliminating the need to re-compute key derivation operations for each transaction group, thus reducing both computational load and energy consumption

Inventive Principle:

Principle #26Copying

3Manufacturing precision

If transactions are grouped based on mapping relationship identity, then transaction grouping granularity is improved, but pre-execution key retrieval is required

Engineering Contradiction:

Improvetransaction grouping granularityVSAvoidpre-execution time

Core Design Contradiction:

Manufacturing precisionVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing mapping relationship identities for contract variables during contract deployment or compilation. This allows transaction grouping to directly use pre-computed identities without performing expensive key derivation operations at transaction processing time, thereby reducing computational load while maintaining grouping efficiency

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent uses copying by creating and storing mapping relationship identity information in advance during contract deployment. These pre-computed identities are then copied and reused during transaction grouping operations, eliminating the need to re-compute key derivation operations for each transaction group, thus reducing both computational load and energy consumption

Inventive Principle:

Principle #26Copying

Data Source

PatentUS20250322393A1Methods for grouping transactions in blockchain, and blockchain nodes

Publication Date: 2025.10.16 ANT BLOCKCHAIN TECHNOLOGY (SHANGHAI) CO LTD

AI summary

Described is grouping, by a blockchain node, transactions in a blockchain. A plurality of transactions is obtained that invoke a same contract and that include a plurality of first transactions, where execution of each of the first transactions includes access to one or more first variables of the same contract, and where the one or more first variables correspond to mapping relationships in the same contract. A mapping relationship identity corresponding to the one or more first variables that are to be accessed in the execution of each of the first transactions is obtained, where a storage position of each of the one or more first variables in a state database is determined based on the mapping relationship identity corresponding to the one or more first variables. The plurality of first transactions are grouped based on the mapping relationship identity corresponding to each of the first transactions.