CN115439240A - Transaction group execution method, computer device and storage medium - Google Patents

Transaction group execution method, computer device and storage medium Download PDF

Info

Publication number
CN115439240A
CN115439240A CN202110627640.5A CN202110627640A CN115439240A CN 115439240 A CN115439240 A CN 115439240A CN 202110627640 A CN202110627640 A CN 202110627640A CN 115439240 A CN115439240 A CN 115439240A
Authority
CN
China
Prior art keywords
transaction
method body
group
constraint
judging whether
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN202110627640.5A
Other languages
Chinese (zh)
Inventor
王志文
吴思进
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Fuzamei Technology Co Ltd
Original Assignee
Hangzhou Fuzamei Technology Co Ltd
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 Hangzhou Fuzamei Technology Co Ltd filed Critical Hangzhou Fuzamei Technology Co Ltd
Priority to CN202110627640.5A priority Critical patent/CN115439240A/en
Publication of CN115439240A publication Critical patent/CN115439240A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Landscapes

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

Abstract

The invention provides a transaction group execution method, a computer device and a storage medium, wherein the method comprises the following steps: receiving a first transaction group, and executing the following operations on each first transaction in the first transaction group in sequence: judging whether a first method body called by a first transaction belongs to a method body which can be called by a transaction group, judging whether the first method body belongs to a method body which is in compliance, judging whether the name of a second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body, and judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body; if the judgment is yes, the first transaction is verified to be passed; when any one of the above judgments is negative, the first transaction group fails to execute; the first set of transactions is executed when each first transaction is validated. The application can improve the safety of the transaction group.

Description

Transaction group execution method, computer device and storage medium
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a transaction group execution method, a computer device, and a storage medium.
Background
Suppose that user a generates transaction group txgroup1 (including tx1 and tx 2), tx1 indicates that 10 coin1 of user a are frozen, tx2 indicates that 20 coin2 are generated, and coin1 and coin2 are two types of certificates running on the same blockchain; the block chain node performs txgroup1 such that freezing 10 coin1 s of user a generates 20 coin2 s.
In the prior art, since the transactions in the transaction group can be combined at will, user a may issue coin1 'on the same blockchain first, and coin1' is false coin1; the user a generates txgroup2 (including tx3 and tx 4), tx3 indicates that 10 coin 1's of the user a are frozen, and tx2 indicates that 20 coin 2's are generated; the block chain node performs txgroup2, so that 10 coin1' of the user a are frozen to generate 20 coin2; since the coin1' is a false coin1, the above mechanism will cause economic loss to the operator of the coin2, and the security of the transaction group is not guaranteed.
Disclosure of Invention
In view of the above-mentioned shortcomings or drawbacks of the prior art, it is desirable to provide a transaction group execution method, a computer device and a storage medium that improve the security of transaction groups.
In a first aspect, the present invention provides a transaction group execution method for blockchain nodes, where each Fang Fati of each contract that can be called by a transaction group is configured with a prev constraint and a next constraint, the method including:
receiving a first transaction group, and executing the following operations on each first transaction in the first transaction group in sequence:
judging whether a first method body called by a first transaction belongs to a method body which can be called by a transaction group, judging whether the first method body belongs to a method body which is in compliance, judging whether the name of a second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body, and judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body;
if the judgment is yes, the first transaction is verified to be passed;
when any one of the above judgments is negative, the first transaction group fails to execute;
the first set of transactions is executed when each first transaction is validated.
In a second aspect, 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 a transaction group execution method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute a transaction group execution method provided according to embodiments of the present invention.
Embodiments of the present invention provide a transaction group execution method, a computer device, and a storage medium, which perform the following operations on each first transaction in a first transaction group in sequence by receiving the first transaction group: judging whether a first method body called by a first transaction is a method body which can be called by a transaction group, judging whether the first method body is a method body which is in compliance, judging whether the name of a second method body called by a previous transaction of the first transaction is the same as the first prev constraint of the first method body, and judging whether the name of a third method body called by a next transaction of the first transaction is the same as the first next constraint of the first method body; if the judgment is yes, the first transaction is verified to be passed; when any judgment is negative, the execution of the first transaction group fails; and when each first transaction passes the verification, executing the method of the first transaction group, and improving the security of the transaction group.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a transaction group execution method according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a transaction group execution method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a transaction group execution method applicable to blockchain nodes, where each Fang Fati of each contract that can be called by a transaction group is configured with a prev constraint and a next constraint, where the method includes:
s12: receiving a first transaction group, and executing the following operations on each first transaction in the first transaction group in sequence:
s141: judging whether a first method body called by a first transaction belongs to a method body which can be called by a transaction group, judging whether the first method body belongs to a method body which is in compliance, judging whether the name of a second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body, and judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body;
s142: if the judgment is yes, the first transaction is verified to be passed;
s143: when any one of the above judgments is negative, the first transaction group fails to execute;
s16: the first set of transactions is executed when each first transaction is validated.
Specifically, judging whether the name of the second method body called by the last transaction of the first transaction is the same as the first prev constraint of the first method body or not includes "when the first prev constraint is null, judging whether the first transaction is the first transaction of the first transaction group or not; when the first prev constraint is not empty, judging whether the name of a second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body, correspondingly, judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body or not, and judging whether the first transaction is the last transaction of the first transaction group when the first next constraint is empty; judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body or not when the first next constraint is not empty; each method body of each contract is configured with group constraints, and judging whether the first method body called by the first transaction belongs to the method bodies which can be called by the transaction group comprises the steps of judging whether the first method body called by the first method body belongs to the method bodies which can be called by the transaction group according to the group constraints of the first method body as an example; suppose the lock method body of contract A is configured with A.lock- > { group: true, prev: null, next: B.min }; the unlock method body of the contract A is configured with A.unlock- > { group: true, prev: B.burn, and next: null }; the miner method body of the contract B is configured with B.miner- > { group: true, prev: A.lock, and next: null }; the burn method body of the contract B is configured with B.burn- > { group: true, prev: null, next: A.unlock }; the method bodies all belong to the method bodies in compliance;
lock is frozen asset, unlock is unfrozen asset, miner is generated asset, and burn is burning asset;
the blockchain node executes step S12, and receives txgroup1{ tx1, tx2}; wherein tx1 calls A.lock, tx2 calls B.miner;
for tx1:
the block chain node executes step S141, determines whether the a.lock belongs to a method body that can be called by the transaction group, determines whether the a.lock belongs to a method body that is compliant, determines whether the name of the method body called by the previous transaction of tx1 is the same as the prev constraint of the a.lock, and determines whether the name of the method body called by the next transaction of tx1 is the same as the next constraint of the a.lock;
the group of the A.lock is true and belongs to a method body which can be called by a transaction group; lock belongs to the body of compliance; lock prev is empty and tx1 is the first transaction in txgroup 1; the name of the method body called by tx2 is B.miner, which is the same as the next constraint of A.lock; the block link point executes step S142, tx1 passes the verification;
for tx2:
the block chain node executes step S141, determines whether the a.lock belongs to a method that can be called by the transaction group, determines whether the a.lock belongs to a method that is compliant, determines whether the name of the method called by the previous transaction of tx1 is the same as the prev constraint of the a.lock, and determines whether the name of the method called by the next transaction of tx1 is the same as the next constraint of the a.lock;
the group of the B.miner is true and belongs to a method body which can be called by a transaction group; the miner belongs to a method body of the compliance; the name of the method body called by tx1 is A.lock, which is the same as prev constraint of B.miner; next of miner is null, and tx2 is the last transaction of tx1 group; the block link point executes step S142, tx2 verification passes;
since each transaction in txgroup1 is verified, the block link point performs step S16, and tx1group is performed.
Those skilled in the art will appreciate that the group field of a method body that is not invokable by a transaction group should be configured as False.
Those skilled in the art will appreciate that each method body of each contract may be configured with prev and next constraints, except that the prev and next constraints of method bodies that may not be called by the transaction group may be configured as constraints that do not need to be enforced.
It should be understood by those skilled in the art that, in "determining whether a first method body called by a first transaction belongs to a method body that can be called by a transaction group, determining whether the first method body belongs to a method body that is compliant, determining whether a name of a second method body called by a previous transaction of the first transaction is the same as a first prev constraint of the first method body, and determining whether a name of a third method body called by a next transaction of the first transaction is the same as a first next constraint of the first method body", when any one of the determinations is negative, the first transaction group fails to execute; and the number of the first and second groups,
the above determination needs to be established after some basic determination in the prior art, for example, if the signature verification of the first transaction fails, the first transaction group still fails to execute; and the number of the first and second groups,
if any of the first transaction verifications fail, execution of the first transaction group fails.
In further embodiments, the determining whether the first method invoked by the first transaction belongs to a method that can be invoked by the transaction group may also be configured according to actual requirements, for example, the determining may be configured to determine whether the invoked first method belongs to a method that can be invoked by the transaction group according to a group identifier of the first method, that is, a group identifier should be included in a method that can be invoked by the transaction group, such as a.lock, b.miner, and a method that cannot be invoked by the transaction group does not include a group identifier, so that the same technical effects may be achieved.
In more embodiments, it is determined whether the name of the second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body, and it may be configured as "break when the first prev constraint is empty" according to actual requirements; when the first prev constraint is not empty, judging whether the name of a second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body, and correspondingly, judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body comprises' when the first next constraint is empty, break; judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body or not when the first next constraint is not empty; the same technical effect can be achieved.
The above-described embodiments improve transaction group security.
Preferably, the determining whether the name of the second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body comprises:
when the first transaction is a first transaction of a first transaction group, judging whether the first prev constraint is null;
when the first transaction is not the first transaction of the first transaction group, judging whether the name of a second method body called by the last transaction of the first transaction is the same as the first prev constraint of the first method body;
judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body comprises the following steps:
when the first transaction is the last transaction of the first transaction group, judging whether the first next constraint is null;
and when the first transaction is not the last transaction of the first transaction group, judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body or not.
Preferably, the determining whether the name of the second method body called by the previous transaction of the first transaction is the same as the first prev constraint of the first method body comprises:
when the first prev constraint is empty, judging whether the first transaction is a first transaction of a first transaction group;
when the first prev constraint is not empty, judging whether the name of a second method body called by the last transaction of the first transaction is the same as the first prev constraint of the first method body;
judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body comprises the following steps:
when the first next constraint is empty, judging whether the first transaction is the last transaction of the first transaction group;
and judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body or not when the first next constraint is not empty.
The transaction group execution principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, each method of each contract is configured with a group constraint, and determining whether the first method invoked by the first transaction belongs to a method that can be invoked by the transaction group includes:
and judging whether the called first method body belongs to the method bodies which can be called by the transaction group or not according to the group constraint of the first method body.
The transaction group execution principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, the determining whether the first method body invoked by the first transaction belongs to a method body that can be invoked by the transaction group includes:
and judging whether the called first method body belongs to the method bodies which can be called by the transaction group or not according to the group identification of the first method body.
The transaction group execution principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, a white list is stored on the block chain, and names of contracts which are in compliance are updated in the white list;
the method for judging whether the first method belongs to the compliance method comprises the following steps:
and judging whether the contract to which the first method body belongs to a contract in a white list.
In more embodiments, the method for determining whether the first method body belongs to the compliant method body may also be configured according to actual requirements, for example, by accessing a configuration file to obtain a list of compliant method bodies to determine whether the first method body belongs to the compliant method body, and the same technical effect may be achieved.
Preferably, the determining whether the first method body invoked by the first transaction belongs to a method body that can be invoked by the transaction group includes:
and judging whether each first method body comprises a method body which cannot be independently executed.
The difference between the above embodiment and the embodiment shown in fig. 1 is that the above embodiment is more severe, for example, if the user a exchanges 20 coins 2 with 10 coins 1 to the user b, tx3 and tx4 may be generated, tx3 represents that the user a transfers 10 coins 1 to the user b, tx4 represents that the user b transfers 20 coins 2 to the user a, tx3 and tx4 may be executed respectively, and then the transaction group txgroup2 formed according to tx3 and tx4 may not be executed. Whereas for txgroup1, txgroup1 includes a method body b.miner that is not independently executable (the method of generating the asset is a method that is not independently executable), txgroup1 may be executed.
The above embodiments are only for ensuring the security of those transaction groups that can only be executed by way of the transaction group.
Preferably, each method body of each contract, which can be called by the transaction group, is further configured with an account constraint, and determining whether the first method body called by the first transaction belongs to the method bodies called by the transaction group includes:
when the account configuration of the first method body is the same, whether the accounts of the first transaction and other first transactions are the same is judged:
if yes, judging whether the first method body called by the first transaction belongs to the method bodies which can be called by the transaction group.
The account configuration of different method bodies is different, and for txgroup1 in the method shown in fig. 1, as it is the freezing and generating of assets, account should be configured to be the same, that is, the assets of the account of user M should be frozen, and new assets should be generated in the account of user M. In some methods, the account may be configured differently according to actual requirements.
Fig. 2 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 201 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 202 or a program loaded from a storage section 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data necessary for the operation of the computer apparatus are also stored. The CPU201, ROM202, and RAM203 are connected to each other via a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
The following components are connected to the I/O interface 205: an input portion 206 including a keyboard, a mouse, and the like; an output section 207 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 208 including a hard disk and the like; and a communication section 209 including a network interface card such as a LAN card, a modem, or the like. The communication section 209 performs communication processing via a network such as the internet. A drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 210 as necessary, so that a computer program read out therefrom is mounted into the storage section 208 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 209 and/or installed from the removable medium 211.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a computer-readable storage medium that exists separately and is not assembled into a computer device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, 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. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (10)

1. A trading group execution method, wherein each Fang Fati of each contract that can be invoked by a trading group is configured with a prev constraint and a next constraint, the method being applicable to blockchain nodes, the method comprising:
receiving a first transaction group, and executing the following operations on each first transaction in the first transaction group in sequence:
judging whether a first method body called by the first transaction belongs to a method body which can be called by a transaction group, judging whether the first method body belongs to a method body which is in compliance, judging whether the name of a second method body called by the last transaction of the first transaction is the same as the first prev constraint of the first method body, and judging whether the name of a third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body;
if the first transaction is judged to be a positive transaction, the first transaction is verified to be passed;
when any one of the above judgments is negative, the first transaction group fails to execute;
executing the first transaction group when each first transaction is verified.
2. The method of claim 1, wherein determining whether the name of the second method body invoked by the previous transaction of the first transaction is the same as the first prev constraint of the first method body comprises:
when the first transaction is a first transaction of the first transaction group, determining whether the first prev constraint is null;
when the first transaction is not the first transaction of the first transaction group, judging whether the name of a second method body called by the last transaction of the first transaction is the same as the first prev constraint of the first method body;
the judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body comprises:
when the first transaction is the last transaction of the first transaction group, judging whether the first next constraint is null;
and when the first transaction is not the last transaction of the first transaction group, judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body.
3. The method of claim 1, wherein determining whether a name of a second method body called by a last transaction of the first transaction is the same as a first prev constraint of the first method body comprises:
when the first prev constraint is empty, judging whether the first transaction is a first transaction of the first transaction group;
when the first prev constraint is not empty, judging whether the name of a second method body called by the last transaction of the first transaction is the same as the first prev constraint of the first method body;
the judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body comprises:
when the first next constraint is empty, judging whether the first transaction is the last transaction of the first transaction group;
and judging whether the name of the third method body called by the next transaction of the first transaction is the same as the first next constraint of the first method body or not when the first next constraint is not empty.
4. The method of claim 1, wherein each method body of each contract is configured with a group constraint, and wherein determining whether the first method body invoked by the first transaction belongs to a method body that can be invoked by a transaction group comprises:
and judging whether the called first method body belongs to the method bodies which can be called by the transaction group or not according to the group constraint of the first method body.
5. The method of claim 1, wherein determining whether the first method body invoked by the first transaction belongs to a method body that can be invoked by a transaction group comprises:
and judging whether the called first method body belongs to the method bodies which can be called by the transaction group or not according to the group identification of the first method body.
6. The method of claim 1, wherein a whitelist is validated on a blockchain, and wherein the whitelist is updated with names of contracts that are compliant;
the judging whether the first method body belongs to a compliance method body comprises the following steps:
and judging whether the contract to which the first method body belongs to the contract in the white list.
7. The method of claim 1, wherein determining whether the first method body invoked by the first exchange belongs to a method body that can be invoked by a transaction group comprises:
and judging whether each first method body comprises a method body which cannot be independently executed.
8. The method according to any one of claims 1-7, wherein each method body of each contract that can be invoked by a transaction group is further configured with an account constraint, and wherein the determining whether the first method body invoked by the first transaction belongs to the method bodies that can be invoked by the transaction group comprises:
when the account configuration of the first method body is the same, judging whether the accounts of the first transaction and other first transactions are the same:
if yes, judging whether the first method body called by the first transaction belongs to the method bodies which can be called by the transaction group.
9. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-8.
10. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-8.
CN202110627640.5A 2021-06-04 2021-06-04 Transaction group execution method, computer device and storage medium Pending CN115439240A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110627640.5A CN115439240A (en) 2021-06-04 2021-06-04 Transaction group execution method, computer device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110627640.5A CN115439240A (en) 2021-06-04 2021-06-04 Transaction group execution method, computer device and storage medium

Publications (1)

Publication Number Publication Date
CN115439240A true CN115439240A (en) 2022-12-06

Family

ID=84272142

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110627640.5A Pending CN115439240A (en) 2021-06-04 2021-06-04 Transaction group execution method, computer device and storage medium

Country Status (1)

Country Link
CN (1) CN115439240A (en)

Similar Documents

Publication Publication Date Title
US11336465B2 (en) Sending cross-chain authenticatable messages
WO2020258848A1 (en) Method and apparatus for cross-chain transmission of resources
US20220239470A1 (en) Cross-blockchain data processing method and apparatus, device, and computer storage medium
CN109831514B (en) Parallel chain consensus method, data exception handling method, device and storage medium
US11336451B2 (en) Cross-blockchain resource transmission
CN109242453A (en) A kind of method of commerce and system for depositing card based on centralization clearing and block chain
CN109377216A (en) A kind of method of commerce and system for depositing card based on centralization clearing and block chain
CN110766410B (en) Trusted cross-chain event construction and verification method and device based on Merker tree
CN112000730B (en) Tracing information writing and tracing information verification method and system based on block chain
CN111383114A (en) Asset information management method and device based on block chain
CN110187831A (en) The block data storage system and method for block chain alliance chain
CN111340628A (en) Asset information management method and device based on block chain
CN111967061A (en) Credible account transfer transaction method and device based on block chain
CN115456603A (en) Double-chain structure-based approval process processing method and device
CN111597269A (en) Block chain-based contract implementation method, device and equipment
CN112396427B (en) Cross-chain interchange operation method for general scenes
EP3907644B1 (en) Blockchain
CN113377875A (en) Cross-link data processing method and device, electronic equipment and readable storage medium
CN109801168B (en) Block chain transaction verification method, equipment and storage medium
CN115439240A (en) Transaction group execution method, computer device and storage medium
CN107277108B (en) Method, device and system for processing messages at nodes of block chain
CN111309801A (en) Method and device for fragmenting alliance chain
CN113987598A (en) Block migration method and device
CN114119243A (en) Pool financing management method, device, medium and electronic equipment based on block chain
CN115439239A (en) Transaction group execution method, computer device and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination