WO2022021768A1 - Procédé d'exécution de groupe de transactions de chaîne parallèle et dispositif et support de stockage - Google Patents

Procédé d'exécution de groupe de transactions de chaîne parallèle et dispositif et support de stockage Download PDF

Info

Publication number
WO2022021768A1
WO2022021768A1 PCT/CN2020/138872 CN2020138872W WO2022021768A1 WO 2022021768 A1 WO2022021768 A1 WO 2022021768A1 CN 2020138872 W CN2020138872 W CN 2020138872W WO 2022021768 A1 WO2022021768 A1 WO 2022021768A1
Authority
WO
WIPO (PCT)
Prior art keywords
transaction group
transaction
chain
parachain
main chain
Prior art date
Application number
PCT/CN2020/138872
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 WO2022021768A1 publication Critical patent/WO2022021768A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G06F16/275—Synchronous replication
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • 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
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B21/00—Alarms responsive to a single specified undesired or abnormal condition and not otherwise provided for
    • G08B21/18—Status alarms
    • G08B21/24—Reminder alarms, e.g. anti-loss alarms

Definitions

  • the present application relates to the field of blockchain technology, and in particular to a method, device and storage medium for executing a parallel chain transaction group.
  • user A has opened account A on the main chain, opened account a on the first parallel chain, user B has opened account b on the first parallel chain, and user C opened an account on the first parallel chain
  • account c user A wants to transfer 10coins on the main chain to user B, and two transactions will be generated, tx1 (transfer 10coins in A to a), tx2 (transfer 10coins in a to b), the user A also wants to transfer 10coins on the first parachain to user C, which will generate transaction tx3 (transfer 10coins in a to c);
  • user A wants to put 3 transactions into a transaction group to execute, and generate transactions Group txgroup1 ⁇ tx1, tx2, tx3 ⁇ ; in the existing main chain-parachain mechanism, the main chain node executes tx1 in txgroup1 ⁇ tx1, tx2, tx3 ⁇ , if tx1 is successfully executed in the main chain, then the main chain A
  • the present invention provides a parachain transaction group execution method suitable for main chain nodes, the method comprising:
  • the first transaction group When executing the first transaction group, determine whether the first transaction group includes both main chain-first parachain cross-chain transactions and non-main chain-parachain ordinary transactions:
  • the present invention provides a parachain transaction group execution method applicable to a parachain node, the method comprising:
  • the main chain node executes the first transaction, it is marked on the first transaction group when it is identified that the first transaction group includes both main chain-current parallel chain cross-chain transactions and ordinary transactions.
  • the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform various functions according to the present invention.
  • the parachain transaction group execution method provided by the embodiment.
  • the present invention further provides a storage medium storing a computer program, the computer program causing a computer to execute the parachain transaction group execution method provided according to each embodiment of the present invention.
  • the parachain transaction group execution method, device and storage medium provided by various embodiments of the present invention determine whether the first transaction group includes both main chain-parachain cross-chain transactions and non-main chain- Ordinary transactions of parachains: if yes, mark the first transaction group with the flag of execution failure, so that when each parachain node of the first parachain synchronizes to the first transaction group marked with the flag, the execution of the first transaction group fails. method to ensure the successful execution of the main chain-parallel chain cross-chain transaction.
  • FIG. 1 is a flowchart of a method for executing a parachain transaction group according to an embodiment of the present invention.
  • FIG. 2 is a flowchart of another parachain transaction group execution method provided by an embodiment of the present invention.
  • FIG. 3 is a schematic structural diagram of a device according to an embodiment of the present invention.
  • user A has opened account A on the main chain, opened account a on the first parallel chain, user B has opened account b on the first parallel chain, and user C opened an account on the first parallel chain have account c.
  • PN1 ⁇ PN4 parachain nodes
  • user A wants to transfer 10coins on the main chain to user B, two transactions will be generated, tx1 (transferring 10coins in A to a), tx2 (transferring 10coins from A to a), Transfer 10coin in a to b), user A also wants to transfer 10coin on the first parachain to user C, a transaction tx3 will be generated (transfer 10coin in a to c); user A wants to transfer 3 transactions Put it into a transaction group for execution to generate transaction group txgroup1 ⁇ tx1, tx2, tx3 ⁇ .
  • the main chain node executes tx1 in txgroup1 ⁇ tx1, tx2, tx3 ⁇ . If tx1 is successfully executed in the main chain, A freezes 10 coins on the main chain; after PN1 ⁇ PN4 synchronize txgroup1 , execute tx2 and tx3; if the execution of tx3 is unsuccessful, the execution of txgroup1 fails due to the atomicity of the transaction group; the consensus transactions tx(consensus_PN1), tx(consensus_PN2), tx(consensus_PN3), tx(consensus_PN3), tx(consensus_PN4); tx(consensus_PN1), tx(consensus_PN2), tx(consensus_PN3), tx(consensus_PN4), the execution status of txgroup1 is false; the main chain node finds that “
  • FIG. 1 is a flowchart of a method for executing a parachain transaction group according to an embodiment of the present invention.
  • the present invention provides a parachain transaction group execution method applicable to a main chain node, and the above method includes:
  • step S14 marking the first transaction group with an execution failure flag, so that when each parachain node of the first parachain synchronizes to the marked first transaction group, the execution of the first transaction group fails.
  • user A has an account A on the main chain, an account a on the first parachain, user B has an account b on the first parachain, and user C has an account on the first parachain c.
  • parachain nodes PN1 ⁇ PN4 on the first parachain; if user A wants to transfer 10coins on the main chain to user B, two transactions will be generated, tx1 (transferring 10coins in A to a), tx2 (transferring 10coins from A to a), Transfer 10coin in a to b), user A also wants to transfer 10coin on the first parachain to user C, a transaction tx3 will be generated (transfer 10coin in a to c); user A wants to transfer 3 transactions Put it into a transaction group for execution, and generate a transaction group txgroup1 ⁇ tx1, tx2, tx3 ⁇ ;
  • the main chain node executes step S12, and when executing txgroup1 ⁇ tx1, tx2, tx3 ⁇ , judges whether txgroup1 ⁇ tx1, tx2, tx3 ⁇ includes both main chain-first parallel chain cross-chain transactions and ordinary transactions:
  • tx1 is a cross-chain transaction between the main chain and the first parachain, and tx2 and tx3 are ordinary transactions
  • the main chain node executes step S14, and marks txgroup1 with an execution failure flag.
  • PN1 ⁇ PN4 synchronize txgroup1 from the main chain
  • PN1 to PN4 execute txgroup1: Since txgroup1 has the flag of execution failure, the execution of txgroup1 fails.
  • the transaction group received by the blockchain node is generated by the user's client.
  • the client determines whether the generated transaction group includes both the main chain-first parachain cross-chain transaction and ordinary transaction:
  • the above embodiment will prompt the user to obtain the warning information earlier by prompting the failure. If the user modifies the transaction group in time due to the warning information, the wrong transaction group will not be sent to the blockchain and the wrongly executed transaction will not be deducted. Group fee.
  • the transaction pool of the blockchain node determines whether the received transaction group includes both the main chain-first parachain cross-chain transaction and the ordinary transaction:
  • the above embodiment will prompt the user to obtain the warning information earlier by prompting the failure. If the user modifies the transaction group in time due to the warning information, the wrong transaction group will not be sent to the blockchain and the wrongly executed transaction will not be deducted. Group fee.
  • FIG. 2 is a flowchart of another parachain transaction group execution method provided by an embodiment of the present invention.
  • the present invention provides a parachain transaction group execution method suitable for parachain nodes, and the above method includes:
  • the main chain node executes the first transaction, it is marked on the first transaction group when it is identified that the first transaction group includes both main chain-current parallel chain cross-chain transactions and ordinary transactions.
  • the present invention also provides a parachain transaction group execution method suitable for main chain nodes, the method comprising:
  • step S34 discard the first transaction group.
  • the difference between the above embodiment and the method shown in FIG. 1 is that the main chain in the above embodiment does not store the first transaction group that fails to execute the certificate. If the first transaction group is not reached, the first transaction group will not be deposited.
  • the advantage of the method shown in FIG. 1 compared with the above-mentioned embodiment is that the user can clearly know that the first transaction group is acquired and executed by the main chain node and the parachain node of the first parachain, not that it is not sent to the blockchain In the network, the user experience is better.
  • FIG. 3 is a schematic structural diagram of a device according to an embodiment of the present invention.
  • the present application also provides a device 300 including one or more central processing units (CPUs) 301 , which can operate according to a program stored in a read only memory (ROM) 302 or Various appropriate actions and processes are executed from the program loaded into the random access memory (RAM) 303 from the storage section 308 .
  • ROM read only memory
  • RAM random access memory
  • various programs and data necessary for the operation of the device 300 are also stored.
  • the CPU 301 , the ROM 302 , and the RAM 303 are connected to each other through a bus 304 .
  • An input/output (I/O) interface 305 is also connected to bus 304 .
  • the following components are connected to the I/O interface 305: an input section 306 including a keyboard, a mouse, etc.; an output section 307 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 308 including a hard disk, etc. ; and a communication section 309 including a network interface card such as a LAN card, a modem, and the like. The communication section 309 performs communication processing via a network such as the Internet.
  • a drive 310 is also connected to the I/O interface 305 as needed.
  • a removable medium 311, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 310 as needed so that a computer program read therefrom is installed into the storage section 308 as needed.
  • the method described in any of the above embodiments may be implemented as a computer software program.
  • embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program containing program code for performing any of the methods described above.
  • the computer program may be downloaded and installed from the network via the communication portion 309 and/or installed from the removable medium 311 .
  • the present application also provides a computer-readable storage medium.
  • the computer-readable storage medium may be a computer-readable storage medium included in the apparatus of the foregoing embodiment; A computer-readable storage medium in a device.
  • the computer-readable storage medium stores one or more programs that are used by one or more processors to perform the methods described in the present application.
  • each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logical functions for implementing the specified functions executable instructions.
  • the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations can be implemented by dedicated hardware-based systems that perform the specified functions or operations , or can be implemented by a combination of dedicated hardware and computer instructions.
  • the units or modules involved in the embodiments of the present application may be implemented in a software manner, and may also be implemented in a hardware manner.
  • the described units or modules may also be provided in the processor, for example, each of the units may be a software program provided in a computer or a mobile smart device, or may be a separately configured hardware device. Wherein, the names of these units or modules do not constitute limitations on the units or modules themselves under certain circumstances.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Computing Systems (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Technology Law (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Emergency Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Procédé d'exécution de groupe de transactions de chaîne parallèle, dispositif et support de stockage. Le procédé consiste : pendant l'exécution d'un premier groupe de transactions, à déterminer si le premier groupe de transactions comprend à la fois une transaction inter-chaînes chaîne principale-chaîne parallèle et une transaction commune hors chaîne principale-chaîne parallèle (S12) ; et, si tel est le cas, à marquer le premier groupe de transactions à l'aide d'un identifiant d'échec d'exécution (S14), de telle sorte que, lorsque chaque nœud de chaîne parallèle d'une première chaîne parallèle est synchronisé au premier groupe de transactions marqué à l'aide de l'identifiant, l'exécution du premier groupe de transactions échoue. Au moyen du procédé, l'aboutissement de l'exécution d'une transaction inter-chaînes peut être assuré.
PCT/CN2020/138872 2020-07-30 2020-12-24 Procédé d'exécution de groupe de transactions de chaîne parallèle et dispositif et support de stockage WO2022021768A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010748222.7 2020-07-30
CN202010748222.7A CN111858772A (zh) 2020-07-30 2020-07-30 平行链交易组执行方法、设备和存储介质

Publications (1)

Publication Number Publication Date
WO2022021768A1 true WO2022021768A1 (fr) 2022-02-03

Family

ID=72946407

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/138872 WO2022021768A1 (fr) 2020-07-30 2020-12-24 Procédé d'exécution de groupe de transactions de chaîne parallèle et dispositif et support de stockage

Country Status (2)

Country Link
CN (1) CN111858772A (fr)
WO (1) WO2022021768A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111858772A (zh) * 2020-07-30 2020-10-30 杭州复杂美科技有限公司 平行链交易组执行方法、设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107481004A (zh) * 2017-08-11 2017-12-15 中国工商银行股份有限公司 交易风险防范系统及方法
US20180294955A1 (en) * 2017-04-05 2018-10-11 Samsung Sds Co., Ltd. System for processing data based on blockchain and operating method thereof
CN109325762A (zh) * 2018-08-30 2019-02-12 杭州复杂美科技有限公司 平行链跨链交易方法、设备和存储介质
CN110796545A (zh) * 2019-10-25 2020-02-14 杭州趣链科技有限公司 一种区块链交易的批处理方法、设备和存储介质
CN111858772A (zh) * 2020-07-30 2020-10-30 杭州复杂美科技有限公司 平行链交易组执行方法、设备和存储介质

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107196900B (zh) * 2017-03-24 2020-04-24 创新先进技术有限公司 一种共识校验的方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180294955A1 (en) * 2017-04-05 2018-10-11 Samsung Sds Co., Ltd. System for processing data based on blockchain and operating method thereof
CN107481004A (zh) * 2017-08-11 2017-12-15 中国工商银行股份有限公司 交易风险防范系统及方法
CN109325762A (zh) * 2018-08-30 2019-02-12 杭州复杂美科技有限公司 平行链跨链交易方法、设备和存储介质
CN110796545A (zh) * 2019-10-25 2020-02-14 杭州趣链科技有限公司 一种区块链交易的批处理方法、设备和存储介质
CN111858772A (zh) * 2020-07-30 2020-10-30 杭州复杂美科技有限公司 平行链交易组执行方法、设备和存储介质

Also Published As

Publication number Publication date
CN111858772A (zh) 2020-10-30

Similar Documents

Publication Publication Date Title
CN109146448B (zh) 跨链资产转移方法、设备和存储介质
CN109377365B (zh) 一种资产转移方法、设备和存储介质
US20210326813A1 (en) Parallel Chain Cross-Chain Transaction Method, Device and Storage Medium
CN109410045B (zh) 一种平行链共识方法、设备和存储介质
US7721003B2 (en) System and method to synchronize OSGi bundle inventories between an OSGi bundle server and a client
US10733176B2 (en) Detecting phantom items in distributed replicated database
US10679210B2 (en) Blockchain transaction commitment ordering
WO2020043048A1 (fr) Procédé de synchronisation de données de chaînes parallèles, dispositif et support de stockage
US9632828B1 (en) Computing and tracking client staleness using transaction responses
WO2018103318A1 (fr) Procédé et système de gestion de transaction répartie
US9171019B1 (en) Distributed lock service with external lock information database
US6665814B2 (en) Method and apparatus for providing serialization support for a computer system
US9589153B2 (en) Securing integrity and consistency of a cloud storage service with efficient client operations
KR102077898B1 (ko) 데이터베이스 고장 시의 데이터 저장
WO2017219857A1 (fr) Procédé et dispositif de traitement de données
US20230106118A1 (en) Distributed processing of transactions in a network using timestamps
WO2020108325A1 (fr) Procédé, appareil et dispositif de traitement de transaction
WO2022121346A1 (fr) Procédé et dispositif de récupération de portefeuille, et support d'enregistrement
US11681683B2 (en) Transaction compensation for single phase resources
WO2022121348A1 (fr) Procédé de génération de transaction retardée, procédé d'exécution de transaction retardée, et dispositif et support de stockage
CN109862102B (zh) 一种分布式数据多副本并发控制系统、服务器及方法
WO2022121347A1 (fr) Procédé d'exécution de transaction, dispositif et support de stockage
JP2004252986A (ja) 複製コマンド配布のシステムおよび方法
WO2022021768A1 (fr) Procédé d'exécution de groupe de transactions de chaîne parallèle et dispositif et support de stockage
US9043283B2 (en) Opportunistic database duplex operations

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: 20946923

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20946923

Country of ref document: EP

Kind code of ref document: A1