WO2023070924A1 - Procédé et système de traitement de transaction de chaîne de blocs - Google Patents

Procédé et système de traitement de transaction de chaîne de blocs Download PDF

Info

Publication number
WO2023070924A1
WO2023070924A1 PCT/CN2021/141180 CN2021141180W WO2023070924A1 WO 2023070924 A1 WO2023070924 A1 WO 2023070924A1 CN 2021141180 W CN2021141180 W CN 2021141180W WO 2023070924 A1 WO2023070924 A1 WO 2023070924A1
Authority
WO
WIPO (PCT)
Prior art keywords
transaction
pool
standard
point
current
Prior art date
Application number
PCT/CN2021/141180
Other languages
English (en)
Chinese (zh)
Inventor
王云丽
姚昱旻
尹海波
杨征
谭林
储超尘
Original Assignee
湖南天河国云科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 湖南天河国云科技有限公司 filed Critical 湖南天河国云科技有限公司
Publication of WO2023070924A1 publication Critical patent/WO2023070924A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3226—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using a predetermined code, e.g. password, passphrase or PIN
    • H04L9/3228—One-time or temporary data, i.e. information which is sent for every authentication or authorization, e.g. one-time-password, one-time-token or one-time-key
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Definitions

  • the invention relates to the technical field of block chains, in particular to a fragmentation and calling method of a block chain transaction pool.
  • the transaction of the blockchain system refers to a piece of request data sent to the blockchain system, which can be used to deploy smart contracts, call smart contract interfaces, maintain the life cycle of smart contracts, and manage assets and value exchanges.
  • the transaction is mainly composed of four parts: sender, receiver, transaction data and transaction signature, which is the basis of various applications of the blockchain system.
  • the user needs to use his own private key to sign the transaction created by himself, and then send the signed transaction to the blockchain, and then complete the consensus processing by multiple nodes of the blockchain system , and then execute the smart contract code related to the transaction to generate the status data specified by the transaction. Finally, the accounting node packs the transaction into the newly released block and stores it together with the status data. So far, the transaction has been confirmed by the blockchain system, and the confirmed transaction is considered to have both consistency and transactionality.
  • the blockchain transaction pool (TxPool transaction buffer pool) is used to temporarily store transactions that have not been added to the block (including transactions created by this node and transactions broadcast by other nodes). On the one hand, it is necessary to check the legitimacy of all submitted transactions; on the other hand, select legal transactions from them to be confirmed by the consensus mechanism of the blockchain system, and all pending legal transactions need to be cached. As the core component of the blockchain system, the transaction pool participates in the entire life cycle from transaction issuance to on-chain. Therefore, the performance of the transaction pool directly affects the performance of the blockchain system.
  • the resource scheduling of the blockchain transaction pool exists in the entire life cycle of each transaction from issuance to on-chain (including: RPC thread, Sync thread, Channel thread, Verify thread and packaged threads, etc).
  • RPC thread Sync thread
  • Channel thread Verify thread and packaged threads, etc.
  • the packaging process of the consensus module needs to obtain the read lock of the transaction pool (locked in shared mode) , extract the transaction from it for execution, when the transaction is executed and the block is obtained, obtain the write lock (locked in exclusive mode), and delete the packaged transaction from the transaction pool.
  • the patent with the publication number CN110599136A provides a method for controlling the flow of a blockchain transaction pool.
  • the Each user in the user set is respectively configured with a traffic threshold associated with the transaction pool to provide an overall utilization rate of the transaction pool.
  • FISCO BCOS optimizes the performance of the transaction pool by splitting and executing transaction verification tasks in parallel and asynchronous transaction notification strategies to optimize the efficiency of transaction pipeline processing.
  • the existing blockchain transaction pool performs read or write operations through threads, and threads are the basic unit of independent operation and scheduling.
  • the existing blockchain system has one and only one complete transaction pool, which is scheduled through read-write locks. In order to maintain data consistency, each operation needs to lock or unlock the transaction pool as a whole. Due to the use of a large number of Locks cause blocking between multiple operations.
  • the present invention provides a processing method for blockchain transactions, including:
  • Fragmentation step Divide the blockchain transaction pool into X standard transaction pools S i ; where X is a positive integer; 2 ⁇ i ⁇ X;
  • Calling step call 1 to X-1 of the standard transaction pool S i according to the feature value of the current transaction T j to complete the current transaction T j .
  • the fragmentation step includes:
  • Quantity determination determine the quantity X of the standard transaction pool S i ;
  • Mapping block perform hash operation on the unique identifier of each standard transaction pool S i , and map the unique identifier of each standard transaction pool S i to point A i on the hash ring, so as to block
  • the blockchain transaction pool is divided into X standard transaction pools S i .
  • the calling step includes:
  • Characteristic value generation generate the characteristic value of the current transaction T j ;
  • Mapping fixed point perform hash operation on the Nonce value of the current transaction T j , and map the current transaction T j to the point B j on the hash ring;
  • Judgment call according to the positions of points A i and B j , call 1 to X-1 of the standard transaction pool S i to complete the current transaction T j .
  • step of judging the call includes:
  • the step of invoking the standard transaction pool S i corresponding to the point A i to complete the current transaction if it coincides includes:
  • the steps to complete the current transaction include:
  • the calling of 1 to X-1 of the standard transaction pool S i , before completing the current transaction T j further includes the steps of:
  • the step of calling 1 to X-1 of the standard transaction pool Si to complete the current transaction Tj is not performed.
  • the step of judging whether the current transaction T j is a valid transaction includes:
  • the step of judging whether the current transaction T j is a valid transaction includes:
  • the present invention also provides a processing system for blockchain transactions, including:
  • the fragmentation module is used to divide the blockchain transaction pool into X standard transaction pools S i ; where X is a positive integer; 2 ⁇ i ⁇ X;
  • the calling module is connected with the sharding module, and is used to call 1 to X-1 of the standard transaction pool S i according to the characteristic value of the current transaction T j to complete the current transaction T j .
  • the fragmentation module includes:
  • Quantity determination unit used to determine the quantity X of the standard transaction pool S i ;
  • An identifier matching unit connected to the quantity determination unit, for matching a one-to-one unique identifier for each of the standard transaction pools S i ;
  • the mapping block unit is connected with the identification matching unit, and is used to perform a hash operation on the unique identification of each standard transaction pool S i , and map the unique identification of each standard transaction pool S i to the hash Point A i on the Greek ring to divide the blockchain transaction pool into X standard transaction pools S i .
  • the calling module includes:
  • a characteristic value generating unit configured to generate the characteristic value of the current transaction T j ;
  • a mapping fixed-point unit is connected with the characteristic value generating unit, and is used to perform a hash operation on the Nonce value of the current transaction T j , and map the current transaction T j to a point B j on the hash ring;
  • Judgment calling unit connected with the mapping block unit and mapping fixed-point unit, used to call 1 to X-1 of the standard transaction pool S i according to the positions of points A i and B j , and complete the current Transaction T j .
  • processing system is configured to execute any of the above processing methods.
  • the method and system for processing block chain transactions adopts the idea of divide and conquer, and proposes an improvement to the fragmentation of the transaction pool structure, and divides a single complete large block chain transaction pool into several small fragments.
  • the standard transaction pool according to the characteristic value of the current transaction, calls the appropriate small standard transaction pool to complete the processing, and controls the thread's competition for the read-write lock of the transaction pool within the limited range of the small standard transaction pool, and locks or unlocks the read-write lock During operation, there is no need to lock or unlock the read-write lock for the entire large blockchain transaction pool, avoiding the congestion problem between multiple operations, effectively reducing the frequency of conflicts, improving transaction throughput, and thus improving transaction
  • the overall processing efficiency of the pool improves the overall performance of the blockchain system.
  • Figure 1 is a schematic diagram of the transaction pool of Ethereum
  • Fig. 2 is the flowchart of an embodiment of the processing method of block chain transaction of the present invention
  • Fig. 3 is a schematic diagram of division of the marked transaction pool of the present invention.
  • Fig. 4 is the flow chart of step S1 of the processing method of block chain transaction of the present invention.
  • Figure 5 is a schematic diagram of the blockchain transaction pool divided into 4 standard transaction pools and mapped to the hash ring;
  • Fig. 6 is the flow chart of step S2 of the processing method of block chain transaction of the present invention.
  • Figures 7-8 are two schematic diagrams of the standard transaction pool and the position of transactions on the hash ring in the present invention.
  • FIG. 9 is a flowchart of step S23 of the processing method of blockchain transactions of the present invention.
  • FIG. 10 is a flowchart of an embodiment of step S23b of the method for processing blockchain transactions of the present invention.
  • FIG. 11 is a flow chart of another embodiment of step S23b of the method for processing blockchain transactions of the present invention.
  • Fig. 12 is a flowchart of step S0 of the processing method of blockchain transactions of the present invention.
  • FIG. 13 is a flowchart of an embodiment of step S01 of the method for processing blockchain transactions of the present invention.
  • FIG. 14 is a flow chart of another embodiment of step S01 of the method for processing blockchain transactions of the present invention.
  • Fig. 15 is a structural block diagram of an embodiment of the blockchain transaction processing system of the present invention.
  • S1 Divide a blockchain transaction pool Pool into X standard transaction pools (SubPool i , hereinafter referred to as S i ); where X is a positive integer; 2 ⁇ i ⁇ X.
  • the shard transaction pool system is optional but limited to include a blockchain transaction pool (shard transaction pool) and several standard transaction pools and other entities.
  • the roles and functions of each entity in the two-tier transaction pool system are introduced in detail as follows: 1.
  • Fragmented transaction pool The interface of this pool is the same as that of a common transaction pool.
  • the sharded transaction pool has two key components: (1) The transaction pool sharding device, which is optional but not limited to a transaction pool sharding algorithm based on a consistent hash ring. Since the transaction hash has a better Discrete, the transactions in the transaction pool have a better balance, which can achieve a more even distribution of transactions in each standard transaction pool; (2) transaction pool transaction merging device, which is mainly required for transaction sorting and acquisition of shard transaction pools Used to implement a first-in-first-out sorting method. In the public chain mode, the merger device also needs to sort the transactions based on the maximum yield. In addition, the device constructs a global transaction priority queue, which is used to realize the transaction sorting method for different standard transaction pools.
  • Standard transaction pool The X standard transaction pools are consistent and meet all the routine transaction processing procedures of the blockchain, which are related to the network module and consensus algorithm adopted by the specific blockchain, including writing to a separate standard transaction pool and ordering transactions , Read, delete several standard interfaces.
  • the block chain transaction processing method of the present invention adopts the idea of divide and conquer, proposes an improvement to the fragmentation of the transaction pool structure, and divides a single complete large block chain transaction pool into fragments
  • For several small standard transaction pools call the appropriate small standard transaction pool according to the characteristic value of the current transaction to complete the processing, and control the thread's read-write lock competition for the transaction pool within the limited small standard transaction pool.
  • the lock or unlock operation there is no need to lock or unlock the entire large blockchain transaction pool, which avoids the congestion problem between multiple operations, effectively reduces the frequency of conflicts, and improves transaction throughput. Thereby improving the overall processing efficiency of the transaction pool, thereby improving the overall performance of the blockchain system.
  • step S1 the dividing step may optionally include but is not limited to:
  • the number X is an empirical value, which can be optionally but not limited to be set freely in advance by those skilled in the art according to the core number N of the node's own CPU, that is, the parallel processing capability, preferably an integer equal to N/3. More specifically, the quantity X can be preset and directly input through the input device; or can be calculated according to the current situation.
  • each divided standard transaction pool S i (2 ⁇ i ⁇ X) match a one-to-one unique identifier.
  • it is optional but not limited to create an index ID i similar to an ID card for each standard transaction pool S i of the X standard transaction pools, as the unique identifier of the corresponding standard transaction pool.
  • Prefix represents the prefix of the transaction pool, which is optional but not limited to the host name or IP address of the node; i represents the i-th standard transaction pool, and is the serial number marked by X standard transaction pools.
  • S13 Perform a hash operation on the unique identifier of each standard transaction pool to map the unique identifier of each standard transaction pool S i (optional but not limited to index ID i ) to point A i on the hash ring (As shown in Figure 5, it is a schematic diagram of four standard transaction pools, A 1 -A 4 are respectively mapped to S 1 -S 4 ). Specifically, taking the unique identifier as index ID i as an example, Hash(IDi) is calculated, and all unique identifiers matching X standard transaction pools are mapped to the hash ring one by one.
  • index ID 1 .., ID i , .., ID x of all standard transaction pools S 1 , .., S i , .., S x as consistent hash operations in sequence
  • the input of the function Hash is mapped to the [0,2 32 -1] numerical space through Hash(IDi), and the intervals of the output results are connected end to end to form a clockwise-growing hash ring, as shown in Figure 5 (4 Schematic diagram of the hash ring formed after the division of standard transaction pools). More specifically, the hash operation Hash used during the period is optional but not limited to MurmurHash.
  • step S1 is, how to divide a complete large blockchain transaction pool Pool into multiple small standard transaction pools S i .
  • the consistent hash ring maps all the standard transaction pools to the numerical space of [0,2 32 -1] through the consistent hash algorithm, and then connects this numerical space end to end to form a hash ring, which not only solves the problem of standard
  • the one-to-one correspondence of the transaction pool avoids confusion and errors; and because the hash algorithm has better discreteness, the standard transaction pool has a better balance, which can make subsequent transactions more evenly distributed among standard transactions in the pool.
  • step S2 is optional but not limited to, including:
  • S21 Generate feature values of the current transaction (Transaction j , T j for short). Specifically, it is optional but not limited to adopting the Nonce value of the current transaction T j or the hash value of the current transaction T j itself as the characteristic value. Specifically, those skilled in the art may optionally, but not limited to, use a local UUID generator to generate a Nonce value for the new candidate transaction, that is, the current transaction. It is worth noting that, like each standard transaction pool, the Nonce value and hash value also have a unique identifier for each new candidate transaction, which can be applied to subsequent hash operations to convert each current transaction T j , are all mapped to a fixed point on the hash ring.
  • S22 Perform a hash operation on the characteristic value of the current transaction T j , that is, the above-mentioned determined Nonce value or hash value, so as to map the current transaction T j to the point B j on the hash ring.
  • the position B j of the current transaction T j on the hash ring coincides with the standard transaction pool S 2 , that is, Into the jurisdiction of the standard transaction pool S2 , priority is given to calling the standard transaction pool S2 to complete the transaction. More specifically, optional but not limited to, it is also necessary to consider whether the number of transactions in the standard transaction pool S i exceeds the set threshold. If it exceeds, it needs to wait or call its two adjacent standard transaction pools S i+1 , S i-1 (that is, calling S 1 or S 3 as shown in Figure 5 ), if not exceeded, directly call the standard transaction pool S i (S 2 ) to complete the transaction.
  • the position B j of the current transaction T j on the hash ring does not coincide with the position of any standard transaction pool S i , but is located on an arc formed by A 3 and A 2 . Then we can select any one of S 3 and S 2 corresponding to A 3 and A 2 to complete the current transaction by looking up the table. Of course, it is also necessary to consider whether the number of transactions in the two standard transaction pools S3 and S2 exceeds the set threshold.
  • the above S23 may optionally include, but is not limited to:
  • the processing method of the present invention is given.
  • processing the current transaction how to call a certain standard transaction pool S i in a balanced manner among X standard transaction pools to complete the current transaction.
  • each current transaction T j can be discretely allocated to X standard transaction pools S i , to further ensure the locking or unlocking of read-write locks During operation, there is no need to lock or unlock the read-write lock for the entire large blockchain transaction pool, avoiding the congestion problem between multiple operations, effectively reducing the frequency of conflicts, improving transaction throughput, and thus improving transaction
  • the overall processing efficiency of the pool improves the overall performance of the blockchain system.
  • step S23b may also optionally include, but is not limited to:
  • step S23c may also optionally include, but is not limited to:
  • step S23c5 If it exceeds the set threshold, wait and return to step S23c1 until the transaction quantity of one of the standard transaction pools S i and S i-1 does not exceed the set threshold, then call it to complete the current transaction. It is worth noting that which one or several of the standard transaction pools to call above, as well as the call priority level, only give the above example, but not limited to this specific embodiment, those skilled in the art can according to actual needs, such as Arbitrary settings such as the threshold size of the transaction quantity and the waiting time requirement. For example, you can only call the standard transaction pool S i , you can also call S i , S i-1 or even involve S i+1 , S i+2 , and S i-2 . It is judged clockwise first and then There is no restriction on whether to judge counterclockwise, or whether to judge counterclockwise first and then judge clockwise.
  • step S23b in another embodiment, may also optionally but not limited to include:
  • step S23b7' If it exceeds the set threshold, wait and return to step S23b1' until the transaction quantity of one of the standard transaction pools S i , S i+1 , and S i-1 does not exceed the set threshold, then call it to complete current transaction. It is worth noting that which one or several of the standard transaction pools to call above, as well as the call priority level, only give the above example, but not limited to this specific embodiment, those skilled in the art can according to actual needs, such as Arbitrary settings such as the threshold size of the transaction quantity and the waiting time requirement.
  • the order of priority such as judging clockwise first and then counterclockwise, or judging counterclockwise first and then clockwise, is not limited.
  • the method for processing blockchain transactions in the present invention may also optionally, but not limited to, include step S0 :include:
  • steps S01-S03 of judging whether the current transaction is a valid transaction are optional but not limited to being set before or during step S1 or S2, as long as it is before calling the standard transaction pool to complete the current transaction.
  • step S01 is optional but not limited to, including:
  • step S01 optionally but not limited to, includes:
  • the step of judging whether the current transaction T j is valid may optionally but not limited to include judging whether it is a legal transaction or a repeated transaction.
  • judging whether it is a legal transaction or a repeated transaction Those skilled in the art can understand that one of the judgments of legal transactions and repeated transactions can be selected, or a combination of the two, or involve more evaluation indicators for judging whether the transaction is a valid transaction.
  • the determination order and criteria can be arbitrarily set by those skilled in the art according to actual requirements.
  • the present invention also provides a blockchain transaction processing system based on the above processing method, including:
  • the fragmentation module 100 is used to divide the blockchain transaction pool into X standard transaction pools S i ; where X is a positive integer; 2 ⁇ i ⁇ X;
  • the calling module 200 is connected with the sharding module 100, and is used to call 1 to X-1 of the standard transaction pool S i according to the characteristic value of the current transaction T j to complete the current transaction T j .
  • the fragmentation module 100 may optionally include, but is not limited to:
  • a quantity determination unit 110 configured to determine the quantity X of the standard transaction pool S i ;
  • the identification matching unit 120 is connected with the quantity determination unit 110, and is used for matching a one-to-one unique identification for each standard transaction pool S i ;
  • the mapping block unit 130 is connected with the identification matching unit 120, and is used for hashing the unique identification of each standard transaction pool S i , and mapping the unique identification of each standard transaction pool S i to the hash ring. Point A i to divide the blockchain transaction pool into X standard transaction pools S i .
  • calling module 200 may optionally but not be limited to include:
  • a feature value generating unit 210 configured to generate a feature value of the current transaction T j ;
  • the mapping fixed-point unit 220 is connected with the characteristic value generating unit 210, and is used for performing a hash operation on the Nonce value of the current transaction T j , and mapping the current transaction T j to the point B j on the hash ring;
  • the judgment call unit 230 is connected with the mapping block unit 130 and the mapping fixed-point unit 220, and is used to call 1 to X-1 in the standard transaction pool S i for the current transaction T j according to the positions of points A i and B j , to complete the current transaction T j .
  • modules and units are functional divisions of the processing system of the blockchain transaction of the present invention, and do not substantially separate its structure and unit modules. The execution of the device is completed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Technology Law (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

La présente invention concerne un procédé et un système de traitement de transaction de chaîne de blocs. Le fondement de l'invention relève du fait que l'amélioration de la fragmentation d'une structure de groupe de transactions de chaîne de blocs est fournie en recourant au concept de diviser pour régner, un unique grand groupe complet de transactions de chaîne de blocs est divisé en plusieurs petits groupes de transactions standard, et un petit groupe de transactions standard est appelé selon une valeur de caractéristique d'une transaction courante pour achever le traitement. La concurrence entre les verrous de lecture-écriture d'un fil au groupe de transactions est contrôlée à l'intérieur d'une petite plage de groupes de transactions standard définie, et dans l'opération de verrouillage ou de déverrouillage d'un verrou de de lecture-écriture, l'opération de verrouillage ou de déverrouillage du verrou de lecture-écriture n'a pas besoin d'être effectuée sur l'ensemble du grand groupe de transactions de chaîne de blocs, de sorte que le problème de congestion parmi une pluralité d'opérations soit évité, la fréquence de conflit peut être efficacement réduite, et le débit de transaction est amélioré, améliorant ainsi l'efficacité de traitement globale du groupe de transactions, et améliorant en outre la performance globale d'un système de chaîne de blocs.
PCT/CN2021/141180 2021-10-28 2021-12-24 Procédé et système de traitement de transaction de chaîne de blocs WO2023070924A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111259077.7A CN113708937B (zh) 2021-10-28 2021-10-28 区块链交易的处理方法和系统
CN202111259077.7 2021-10-28

Publications (1)

Publication Number Publication Date
WO2023070924A1 true WO2023070924A1 (fr) 2023-05-04

Family

ID=78647228

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/141180 WO2023070924A1 (fr) 2021-10-28 2021-12-24 Procédé et système de traitement de transaction de chaîne de blocs

Country Status (2)

Country Link
CN (1) CN113708937B (fr)
WO (1) WO2023070924A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113708937B (zh) * 2021-10-28 2022-03-01 湖南天河国云科技有限公司 区块链交易的处理方法和系统
CN114205160B (zh) * 2021-12-13 2024-05-28 深圳前海微众银行股份有限公司 基于区块链的数据处理方法、装置及电子设备

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110717762A (zh) * 2019-12-16 2020-01-21 腾讯科技（深圳）有限公司 数据处理方法、装置、节点设备及存储介质
US20200076573A1 (en) * 2018-08-30 2020-03-05 International Business Machines Corporation Special relationships in a blockchain
CN111127013A (zh) * 2019-12-24 2020-05-08 深圳大学 基于区块链的去中心化数据交易方法、装置、设备及介质
CN111507695A (zh) * 2020-04-17 2020-08-07 腾讯科技（深圳）有限公司 数据处理方法、装置、节点设备及存储介质
CN111611321A (zh) * 2020-06-29 2020-09-01 上海优扬新媒信息技术有限公司 一种数据存储方法、装置及区块链系统
CN112260836A (zh) * 2020-09-28 2021-01-22 电子科技大学 一种基于分片技术提升区块链吞吐量的方法
CN113708937A (zh) * 2021-10-28 2021-11-26 湖南天河国云科技有限公司 区块链交易的处理方法和系统

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106991008B (zh) * 2016-01-20 2020-12-18 华为技术有限公司 一种资源锁管理方法、相关设备及系统
CN110489059B (zh) * 2019-07-11 2022-04-12 平安科技（深圳）有限公司 数据集群存储的方法、装置及计算机设备
CN110737668B (zh) * 2019-12-17 2020-12-22 腾讯科技（深圳）有限公司 数据存储方法、数据读取方法、相关设备及介质
CN111181715B (zh) * 2019-12-30 2022-07-12 杭州云象网络技术有限公司 一种基于一致性哈希共识协议的多方跨链方法
CN112839086B (zh) * 2021-01-06 2022-02-08 中山大学 基于区块链分片技术的网络资源分配方法、装置、终端设备及存储介质

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200076573A1 (en) * 2018-08-30 2020-03-05 International Business Machines Corporation Special relationships in a blockchain
CN110717762A (zh) * 2019-12-16 2020-01-21 腾讯科技（深圳）有限公司 数据处理方法、装置、节点设备及存储介质
CN111127013A (zh) * 2019-12-24 2020-05-08 深圳大学 基于区块链的去中心化数据交易方法、装置、设备及介质
CN111507695A (zh) * 2020-04-17 2020-08-07 腾讯科技（深圳）有限公司 数据处理方法、装置、节点设备及存储介质
CN111611321A (zh) * 2020-06-29 2020-09-01 上海优扬新媒信息技术有限公司 一种数据存储方法、装置及区块链系统
CN112260836A (zh) * 2020-09-28 2021-01-22 电子科技大学 一种基于分片技术提升区块链吞吐量的方法
CN113708937A (zh) * 2021-10-28 2021-11-26 湖南天河国云科技有限公司 区块链交易的处理方法和系统

Also Published As

Publication number Publication date
CN113708937B (zh) 2022-03-01
CN113708937A (zh) 2021-11-26

Similar Documents

Publication Publication Date Title
WO2023070924A1 (fr) Procédé et système de traitement de transaction de chaîne de blocs
JP7114629B2 (ja) ブロックチェーントランザクションの並列検証のためのシステム及び方法
CN111989705B (zh) 有许可区块链中的优先级
US9154442B2 (en) Concurrent linked-list traversal for real-time hash processing in multi-core, multi-thread network processors
CN107657438B (zh) 一种区块链生成方法、数据验证方法、节点及系统
CN107807951B (zh) 一种区块链生成方法、数据验证方法、节点及系统
WO2017133623A1 (fr) Procédé, appareil et système de traitement de flux de données
US8321385B2 (en) Hash processing in a network communications processor architecture
US8539199B2 (en) Hash processing in a network communications processor architecture
CN106406896B (zh) 一种并行PipeLine技术的区块链建块方法
US9158810B2 (en) Hardware message queues for intra-cluster communication
EP3493084B1 (fr) Procédé de traitement de données dans un filtre de bloom et filtre de bloom
CN112041872A (zh) 在分区区块链网络中维护区块链的区块
CN105531713A (zh) 从单个数据缓冲器生成多个安全散列
JP2016535337A (ja) ネットワーク環境における効率的なパケット処理モデルおよびパケット処理のための最適化されたバッファ利用をサポートするためのシステムおよび方法
US11487478B2 (en) Memory system and method of controlling nonvolatile memory
CN108776758B (zh) 一种雾存储中支持动态所有权管理的块级数据去重方法
WO2011123991A1 (fr) Procédé d'accès mémoire pour traitement parallèle
WO2019080232A1 (fr) Procédé et appareil de transmission d'informations de tâches dans un système de flux de travaux, et dispositif informatique
WO2023070925A1 (fr) Procédé de fragmentation pour un groupe de transactions à chaîne de blocs, système, support de stockage et système informatique
CN116455559B (zh) 软硬协同高速密码设备实现方法、装置及电子设备
US20230102617A1 (en) Repeat transaction verification method, apparatus, and device, and medium
CN111158878A (zh) 资源转移请求线程控制方法、装置及存储介质
WO2021070106A1 (fr) Procédés et dispositifs pour minage symbiotique sécurisé
WO2024098613A1 (fr) Système et procédé de traitement d'algorithme hmac, dispositif et support de stockage lisible non volatil

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21962265

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE