WO2020248982A1

WO2020248982A1 - Method and device for transaction processing in blockchain

Info

Publication number: WO2020248982A1
Application number: PCT/CN2020/095201
Authority: WO
Inventors: 陈宇杰; 李辉忠; 张开翔; 莫楠; 陈宇; 石翔; 范瑞彬
Original assignee: 深圳前海微众银行股份有限公司
Priority date: 2019-06-14
Filing date: 2020-06-09
Publication date: 2020-12-17
Also published as: CN110276688A; CN110276688B

Abstract

A method and device for transaction processing in a blockchain, which relate to the technical field of finance; the method comprises: a transaction node receiving a transaction to be processed that is sent by a client (301), the transaction to be processed comprising a first random number randomly generated by the client for the transaction to be processed; the transaction node performing first verification on the transaction to be processed (302); and after the transaction node determines that the transaction to be processed passes the first verification, recording the first random number in a random number record and placing the transaction to be processed into a transaction pool (303). Thus, the efficiency of transaction nodes when processing transactions is improved.

Description

Method and device for transaction processing in block chain

Cross references to related applications

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office, the application number is 201910514704.3, and the application name is "a method and device for transaction processing in the blockchain" on June 14, 2019, the entire content of which is by reference Incorporated in this application.

Technical field

The embodiments of the present invention relate to the field of financial technology (Fintech), and in particular to a method and device for transaction processing in a blockchain (BlockChain).

Background technique

With the development of computer technology, more and more technologies are applied in the financial field. The traditional financial industry is gradually transforming to financial technology. Blockchain transmission technology is no exception, but due to the security and real-time requirements of the financial and payment industries , But also higher requirements for technology.

A blockchain is a chain composed of a series of blocks. Each block records the data of the block and the hash value of the previous block. In this way, all blocks form a chain one after another. The cryptographic technology and decentralized ideas on which the blockchain is based make the historical information on the chain unable to be tampered with.

When the client sends a transaction to the blockchain, due to network and other reasons, the client may send the same transaction multiple times. In order to prevent the same transaction from being processed multiple times, the prior art adopts a strict incremental sequence to achieve transaction weight prevention. Specifically, each account corresponds to a sequence. This sequence starts from zero. Each time the client where the account is located sends a transaction, the sequence value is increased by one, and the transaction node processes the same sequence according to the sequence value of the transaction sent by the client from small to large. For account transactions, if the sequence value of the transaction received by the node is much greater than the sequence value of the transaction processed by the current node, the received transaction will be placed in the transaction pool and will not be processed until the transaction with the sequence value is processed For this transaction, the efficiency of transaction processing by the transaction node in this manner is low, and the client needs to generate strictly increasing sequence values, which places higher requirements on the client.

Summary of the invention

The embodiment of the present invention provides a method and device for processing transactions in a blockchain, which improves the efficiency of transaction processing by transaction nodes.

An embodiment of the present invention provides a method for processing transactions in a blockchain, including:

The transaction node receives the pending transaction sent by the client, where the pending transaction includes a first random number randomly generated by the client for the pending transaction;

The transaction node performs a first verification on the pending transaction; wherein, the first verification includes determining whether the first random number is included in a random number record; the random number record is used to record that the first random number has been passed 1. The random number of each transaction verified;

After determining that the transaction to be processed passes the first verification, the transaction node records the first random number in the random number record and puts the transaction to be processed into a transaction pool.

In the above technical solution, the client does not need to generate strictly increasing sequence values, and the business logic requirements of the client are reduced, and when one account corresponds to multiple clients, the probability of multiple clients generating the same random number when sending transactions at the same time is also Very small, and further, in order to solve the problem of the client generating the same random number, the first verification is performed on the pending transaction sent by the client, and the random number record is set in the transaction node to receive the pending transaction at the transaction node When, verify whether the first random number in the transaction to be processed already exists in the random number record, if not, determine that the transaction to be processed passes the verification, and further record the first random number of the transaction to be processed in the random number record And put the pending transaction into the transaction pool for subsequent on-chain processing. The transaction node does not need to put the received transaction in the transaction pool and wait for other transaction processing to complete before processing the transaction, which improves the transaction The efficiency of the node in processing transactions, and the guarantee that the transaction node will not process repeated transactions.

Optionally, the random number record includes a first random number record and a second random number record;

The first random number record is used to record the random number of each transaction that has passed the first verification but has not been processed on the chain;

The second random number record is used to record the random number of each transaction that has been processed on the chain;

The determining by the transaction node that the transaction to be processed passes the first verification includes:

After determining that the first random number does not exist in the first random number record, it is determined that the first random number does not exist in the second random number record.

In the above technical solution, the random number record is divided into a first random number record and a second random number record. The first random number record is stored in the memory of the transaction node. Since the memory of the transaction node is limited, the first random number record is set The number record is used to record the random number of each transaction that has passed the first verification but has not been processed on the chain, and the random number of each transaction that has been processed on the chain is recorded in the second random number record, thereby ensuring the first random number The amount of data recorded by the data is small, to avoid the problem that the memory of the transaction node exceeds the normal operation of the transaction node.

Optionally, the second random number record includes the random number of the second transaction; the second transaction is a transaction recorded in N blocks with a block height of M to MN, where M is a block chain The block height of the current block, M and N are both positive integers, and M is greater than N.

In the above technical solution, when obtaining the second random number record, according to the current block height, only the current block and the transactions in the N blocks before the current block can be obtained, and the transaction is determined to be the second transaction. The random number of the second transaction is recorded in the second random number record, that is to say, when the second random number record is obtained, not all the transactions of each block that have been recorded in the blockchain are obtained, but the current area The transaction in a part of the block before the block, under the premise that the obtained transaction in each block can be enough to verify the current pending transaction, reduce the workload of the transaction node to obtain the random number of the transaction, and improve the work of the transaction node effectiveness.

Optionally, after the transaction node puts the pending transaction into the transaction pool, the method further includes:

Package the pending transactions in the transaction pool into blocks and perform consensus on the blocks on the chain;

Delete the first random number from the first random number record, and add the first random number and the block height of the transaction to be processed to the second random number record correspondingly in.

In the above technical solution, the first random number is deleted from the first random number record, and the first random number and the block height of the transaction to be processed are correspondingly added to the second random number record to ensure the first random number. The random number record only records the random number of the transaction in the transaction pool that has passed the first verification, and does not record the random number of the transaction that has been on the chain, reducing the amount of data recorded by the first random number, that is, reducing the memory of the node Data storage capacity, further, store the random number of the transaction on the chain and the block height of the exchange in the block correspondingly in the second random number record to ensure that the same transaction is rejected after the same transaction is received .

Correspondingly, an embodiment of the present invention also provides a device for processing transactions in a blockchain, including:

A receiving unit, configured to receive a pending transaction sent by a client, where the pending transaction includes a first random number randomly generated by the client for the pending transaction;

The processing unit is configured to perform first verification on the pending transaction; wherein the first verification includes determining whether the first random number is included in the random number record; the random number record is used to record that the transaction has passed the The random number of each transaction of the first verification; and after determining that the transaction to be processed passes the first verification, record the first random number in the random number record and put the transaction to be processed into the transaction In the pool.

The processing unit is specifically used for:

Optionally, the processing unit is further configured to:

After placing the pending transaction in the transaction pool, package the pending transaction in the transaction pool into a block, and perform a consensus upload on the block;

Correspondingly, an embodiment of the present invention also provides a computing device, including:

Memory, used to store program instructions;

The processor is configured to call the program instructions stored in the memory, and execute the method of transaction processing in the blockchain according to the obtained program.

Correspondingly, an embodiment of the present invention also provides a computer-readable non-volatile storage medium, including computer-readable instructions. When the computer reads and executes the computer-readable instructions, the computer executes the above-mentioned blockchain The method of transaction processing.

Correspondingly, the embodiment of the present invention also provides a computer program product containing instructions, which when running on a computer, causes the computer to execute the above-mentioned method for processing transactions in the blockchain.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings needed in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative work, other drawings can be obtained from these drawings.

FIG. 1 is a schematic diagram of a system architecture provided by an embodiment of the present invention;

Figure 2 is a schematic diagram of another system architecture provided by an embodiment of the present invention;

3 is a schematic flowchart of a method for processing transactions in a blockchain according to an embodiment of the present invention;

4 is a schematic structural diagram of a transaction processing device in a blockchain provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a computing device provided by this application.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.

FIG. 1 exemplarily shows a system architecture applicable to a method for processing transactions in a blockchain provided by an embodiment of the present invention. The system architecture may include multiple clients 100 and a blockchain system 200, as shown in FIG. 2, The blockchain system 200 includes multiple blockchain nodes 210. The blockchain nodes 210 are transaction nodes. Multiple clients 100 can send transactions to the blockchain nodes 210 respectively.

Each block chain node 210 of the block chain system 200 includes a transaction pool 211, a consensus module 212, a synchronization module 213, a block link port module 214, a storage module 215, and the like.

The transaction pool 211 is used to receive new transactions from the client 100 or other blockchain nodes 210, and store the verified transactions in the transaction pool queue for use by the consensus module 212 when packaging blocks. The transaction pool 211 may include a transaction validator, which is used to verify the new transaction received from the client. It may include multiple verifications, such as verifying whether the signature of the received transaction is valid, whether it is in the transaction pool or the blockchain There is the transaction, whether the parameters in the transaction are valid, etc.

The consensus module 212 is divided into two sub-modules: a packaging thread and a consensus thread. The packaging thread is responsible for taking out transactions from the transaction pool 211, packaging them into blocks, and broadcasting the newly generated blocks to all other consensus nodes; the consensus thread is responsible for executing new blocks , Run the consensus algorithm, write all consensus blocks into the storage module 215 through the block link port module 214.

The synchronization module 213 is used for transaction synchronization and block synchronization. The transaction synchronization broadcasts all transactions received by this node to other consensus nodes to ensure that when the block node is switched, the new block node can generate a new block based on the latest transaction ; Block synchronization is used to solve the problem of block height inconsistency between nodes with different performance. The synchronization module 213 maintains the block height information of all nodes. When the block height of the current node lags behind other nodes, it will actively initiate a block download Request to ensure that the block height of this node is consistent with other nodes.

The storage module 215 includes two parts: storage and state. Storage (such as AMDB, LevelDB) uses a table-like storage structure, which is mainly used to store block information, system tables, etc.; state stores transaction execution results, including mpt state and storage state, mpt state is a world state tree, which can trace the historical information of any transaction, storage state stores the current state after the transaction is executed, and does not store historical information.

Based on the foregoing description, FIG. 3 exemplarily shows a flow of a method for processing transactions in a blockchain provided by an embodiment of the present invention, and the flow may be executed by a device for processing transactions in the blockchain.

As shown in Figure 3, the process specifically includes:

Step 301: The transaction node receives the pending transaction sent by the client.

The client sends a transaction to be processed, and the transaction to be processed may include a first random number, which is a random value (Nonce value) randomly generated by the client for the transaction to be processed. Optionally, the client can introduce any random variable to generate a random value, and the client can use a random number of type u256. Compared with the prior art, the client does not need to generate strictly increasing sequence values, and the business logic requirements of the client are reduced, and when an account corresponds to multiple clients, the probability that multiple clients generate the same random number when sending transactions It is also very small. Further, in order to solve the problem of the client generating the same random number, the first verification of the pending transaction sent by the client is required.

Step 302: The transaction node performs first verification on the transaction to be processed.

The transaction node performs the first verification of the transaction to be processed. Specifically, it can be to verify the first random number in the transaction to be verified, and determine whether the first random number has been recorded in the random number record, which is equivalent to judging whether the random number record includes The first random number. Here, the random number record is used to record the random number of each transaction that has passed the first verification, that is, to determine whether the first random number in a transaction to be processed is in the random number record, if not, determine the The transaction to be processed passes the first verification, and the first random number of the transaction to be processed is added to the random number record.

In the embodiment of the present invention, the random number record may include a first random number record and a second random number record, where the first random number record is used to record the random number of each transaction that has passed the first verification but has not been processed on the chain. ; The second random number record is used to record the random number of each transaction that has been processed on the chain. That is, the transaction node performs the first verification of the transaction to be processed, which may include two verifications. One is to determine that the first random number does not exist in the first random number record, and the other is to determine that the second random number record does not exist. A random number.

Optionally, after determining that the first random number does not exist in the first random number record, obtain a second random number record, and determine whether the first random number exists in the second random number record. In some embodiments, the first random number record may be a random number list stored in memory, and it may also be called a transaction pool Nonce list, which is used to prevent the transaction pool from processing repeated transactions; the second random number record may also It is a list of random numbers, stored in the database, and can also be called a list of Nonce system tables to prevent the consensus thread from packaging and processing repeated transactions.

When obtaining the second random number record, it can be obtained according to the current block of the blockchain and the N blocks before the current block. If the block height of the current block of the blockchain is M, then the block height is obtained Is the random number of all transactions in the N blocks from M to MN. If the determined transaction is the second transaction, then the random number of the determined transaction is the random number of the second transaction. The random number is recorded in the second random number record. Here, both M and N are positive integers, and M is greater than N.

In the embodiment of the present invention, N can be understood as the limit value of the transaction weight prevention (Limit) value, that is, the block range of the transaction weight prevention. From the current block to the future N blocks, there cannot be transactions with repeated random numbers. The current block to the Nth block in the future is understood as the upper limit of the transaction weight (BlockLimit), which is the block height used to indicate the upper limit of the weight. Assuming the current block is M, then M+N is the upper limit of the transaction weight The height of the block, where N can be set based on experience and can be set to 1000. Further, when obtaining the second random number record, the obtained random numbers of all the second transactions in the N blocks are not repeated.

In addition, the pending transaction sent by the client may also include a height parameter, which is used to indicate that the block height of the transaction to be processed in the block is not greater than the height parameter. Accordingly, the transaction node performs the first verification of the transaction to be processed , Can include not only judging whether the first random number is included in the random number record, but also judging whether the height parameter in the transaction to be processed is valid according to the block height of the current block of the blockchain. For example, if Confirm that the height parameter is not less than the block height of the current block of the blockchain and is not greater than the sum of the block height of the current block and the preset value, then the height parameter is determined to be valid, for example, such as the current block height It is 1500, the default value is 1000, and the height parameter in the transaction to be processed sent by the client is 1700, then it is determined that 1700 is not less than 1500 and not more than 2500, then the height parameter is 1700 is valid. In this technical solution, the preset value can be determined based on experience, or it can be a transaction weight prevention limit value. In addition, the height parameter is used to indicate the priority of pending transactions sent by the client to meet the different needs of the client for sending transactions.

Step 303: After determining that the transaction to be processed passes the first verification, the transaction node records the first random number in the random number record and puts the transaction to be processed into a transaction pool.

After the transaction node determines that the transaction to be processed passes the first verification, that is, it is determined that the first random number does not exist in the first random number record and the first random number does not exist in the second random number record, the transaction to be processed can be Put it in the transaction pool, and then process the transactions in the transaction pool on the chain. Specifically, the pending transactions in the transaction pool can be packaged into blocks, and then the blocks can be chained by consensus. After the pending transactions in the transaction pool are processed on the chain, the first random number can be deleted from the first random number record, and the first random number and the pending transaction can be added correspondingly to the block height of the block To the second random number record. Here, the block height of the transaction to be processed in the block is understood as the block height of the block chain where the transaction to be processed is packaged into the block when the block is chained.

In order to better explain the embodiments of the present invention, the following will describe the transaction processing flow in the blockchain in a specific implementation scenario, which is shown in conjunction with Figure 2, and the details are as follows:

The client sends the transaction to be processed to the transaction node. The transaction to be processed has the first random number recorded, and the transaction to be processed is T _i , and the first random number of the transaction to be processed T _i is Nonce _i ; the transaction node receives after T _i, call transaction transaction validator pool verify the validity of T _i, including three verification:

Height parameter contained in ①T _i is valid;

② Whether T _i is duplicated: first query the Nonce list of the transaction pool. If Nonce _i exists in the Nonce list of the transaction pool, it means that the transaction pool has received the same transaction and rejected T _i ; otherwise, continue to query the Nonce system table list to determine whether T _i is available on the transaction chain, if Nonce Nonce system table _I present in the list, the transaction has been described on the same chain, reject T _i;

③T _i signature is valid.

If it is determined that T _i passes the above three verifications of the transaction validator, it is determined that T _i can be processed on the chain, and T _{i is} determined to be a verified transaction. Specifically, the random number Nonce _{i of} T _i is inserted into the transaction pool Nonce list, and remove the module from the transaction by consensus pool T _i and packaged into blocks, block after consensus is successful, will be submitted to the storage module block by block link interface module, about to block the chain. After successfully uploading the block to the chain, first update the Nonce system table list, append the Nonce _{i of the} block to the Nonce system table list, and then update the transaction pool Nonce list, and delete Nonce _i from the transaction pool Nonce list.

It should be noted that the first random number generated by the client uniquely represents a transaction. In the embodiment of the present invention, Nonce _{i is} inserted into the Nonce list of the transaction pool. When there is a second pending transaction with the random number Nonce _i When submitting to the transaction node again, the transaction node will reject the second pending transaction because the Nonce _i already exists in the Nonce list of the transaction pool. And after adding Nonce _i to the Nonce system table list, delete Nonce _i from the Nonce list of the transaction pool. When a second pending transaction with a random number of Nonce _i is submitted to the transaction node again, the transaction node will be affected by the Nonce system table. The Nonce _i already exists in the list and the second pending transaction is rejected.

Further, when packaging the verified transactions in the transaction pool into a block, the consensus module can periodically package multiple verified transactions from the transaction pool, that is, after the block is successfully uploaded to the chain, the new area There are multiple on-chain transactions in the block, and the first random numbers in the multiple on-chain transactions form a Nonce list. All the first random numbers in the Nonce list are deleted from the Nonce list of the transaction pool and added to the Nonce system table. List.

In the above technical solution, the client does not need to generate strictly increasing sequence values, and the business logic requirements of the client are reduced, and when one account corresponds to multiple clients, the probability of multiple clients generating the same random number when sending transactions at the same time is also Very small, and further, in order to solve the problem of the client generating the same random number, the first verification is performed on the pending transaction sent by the client, and the random number record is set in the transaction node to receive the pending transaction at the transaction node When, verify whether the first random number in the transaction to be processed already exists in the random number record, if not, determine that the transaction to be processed passes the verification, and further record the first random number of the transaction to be processed in the random number record The transaction node does not need to put the received transaction in the transaction pool and wait for the completion of other transaction processing before processing the transaction, and the pending transaction is processed on the chain, which improves the efficiency of transaction processing by the transaction node and guarantees the transaction The node will not process duplicate transactions.

Based on the same inventive concept, FIG. 4 exemplarily shows the structure of a device for processing transactions in a blockchain according to an embodiment of the present invention, and the device can execute the flow of the method for processing transactions in the blockchain. The device includes:

The receiving unit 401 is configured to receive a pending transaction sent by a client, where the pending transaction includes a first random number randomly generated by the client for the pending transaction;

The processing unit 402 is configured to perform a first verification on the pending transaction; wherein the first verification includes determining whether the first random number is included in a random number record; the random number record is used to record that the transaction has passed The random number of each transaction of the first verification; and after determining that the transaction to be processed passes the first verification, record the first random number in the random number record and place the transaction to be processed In the trading pool.

The processing unit 402 is specifically configured to:

Optionally, the processing unit 402 is further configured to:

Based on the same concept as the method shown in FIG. 3, the present application also provides a computing device. As shown in FIG. 5, the computing device includes at least one processor 520 for implementing the method in FIG. 3 provided by the embodiment of the present application. Any method.

The computing device 500 may also include at least one memory 530 for storing program instructions and/or data. The memory 530 and the processor 520 are coupled. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, and may be in electrical, mechanical or other forms, and is used for information exchange between devices, units or modules. The processor 520 may cooperate with the memory 530 to operate. The processor 520 may execute program instructions stored in the memory 530. At least one of the at least one memory may be included in the processor.

In the implementation process, the steps of the above method can be completed by hardware integrated logic circuits in the processor or instructions in the form of software. The steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware processor, or executed and completed by a combination of hardware and software modules in the processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware. To avoid repetition, it will not be described in detail here.

It should be noted that the processor in the embodiment of the present application may be an integrated circuit chip with signal processing capability. In the implementation process, the steps of the foregoing method embodiments can be completed by hardware integrated logic circuits in the processor or instructions in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processing circuit (digital signal processor, DSP), a dedicated integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other Programming logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps, and logical block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like. The steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

It can be understood that the memory in the embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory can be read-only memory (ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), and electronic Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory. The volatile memory may be random access memory (RAM), which is used as an external cache. By way of exemplary but not restrictive description, many forms of RAM are available, such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM) ) And direct memory bus random access memory (direct rambus RAM, DR RAM). It should be noted that the memories of the systems and methods described herein are intended to include, but are not limited to, these and any other suitable types of memories.

The computing device 500 may further include a communication interface 510 for communicating with other devices through a transmission medium, so that the apparatus used in the computing device 500 can communicate with other devices. In the embodiment of the present application, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface. In the embodiments of the present application, when the communication interface is a transceiver, the transceiver may include an independent receiver and an independent transmitter; it may also be a transceiver with integrated transceiver functions, or an interface circuit.

The computing device 500 may also include a communication line 540. Among them, the communication interface 510, the processor 520, and the memory 530 may be connected to each other through a communication line 540; the communication line 540 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (extended industry standard architecture). , Referred to as EISA) bus and so on. The communication line 540 can be divided into an address bus, a data bus, a control bus, and the like. For ease of presentation, only one thick line is used in FIG. 5 to represent, but it does not mean that there is only one bus or one type of bus.

Based on the same inventive concept, embodiments of the present invention also provide a computer-readable non-volatile storage medium, including computer-readable instructions. When the computer reads and executes the computer-readable instructions, the computer executes the aforementioned blocks. The method of transaction processing in the chain.

Based on the same inventive concept, the embodiments of the present application provide a computer program product containing instructions, which when running on a computer, cause the computer to execute the above-mentioned method of transaction processing in the blockchain.

The present invention is described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment are generated It is a device that realizes the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment. The instructions provide steps for implementing functions specified in a flow or multiple flows in the flowchart and/or a block or multiple blocks in the block diagram.

Although the preferred embodiments of the present invention have been described, those skilled in the art can make additional changes and modifications to these embodiments once they learn the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. In this way, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention is also intended to include these modifications and variations.

Claims

A method for transaction processing in a blockchain, characterized in that it includes:

The transaction node receives the pending transaction sent by the client, where the pending transaction includes a first random number randomly generated by the client for the pending transaction;

The transaction node performs a first verification on the pending transaction; wherein, the first verification includes determining whether the first random number is included in a random number record; the random number record is used to record that the first random number has been passed 1. The random number of each transaction verified;

After determining that the transaction to be processed passes the first verification, the transaction node records the first random number in the random number record and puts the transaction to be processed into a transaction pool.
8. The method of claim 1, wherein the random number record comprises a first random number record and a second random number record;

The first random number record is used to record the random number of each transaction that has passed the first verification but has not been processed on the chain;

The second random number record is used to record the random number of each transaction that has been processed on the chain;

The determining by the transaction node that the transaction to be processed passes the first verification includes:

After determining that the first random number does not exist in the first random number record, it is determined that the first random number does not exist in the second random number record.
The method of claim 2, wherein the second random number record includes a random number of a second transaction; the second transaction is a transaction recorded in N blocks with a block height of M to MN , Where M is the block height of the current block of the blockchain, M and N are both positive integers, and M is greater than N.
The method according to claim 2, wherein after the transaction node puts the transaction to be processed into the transaction pool, the method further comprises:

Package the pending transactions in the transaction pool into blocks and perform consensus on the blocks on the chain;

Delete the first random number from the first random number record, and add the first random number and the block height of the transaction to be processed to the second random number record correspondingly in.
A device for processing transactions in a blockchain, characterized in that it comprises:

A receiving unit, configured to receive a pending transaction sent by a client, where the pending transaction includes a first random number randomly generated by the client for the pending transaction;

The processing unit is configured to perform first verification on the pending transaction; wherein the first verification includes determining whether the first random number is included in the random number record; the random number record is used to record that the transaction has passed the The random number of each transaction of the first verification; and after determining that the transaction to be processed passes the first verification, record the first random number in the random number record and put the transaction to be processed into the transaction In the pool.
5. The device of claim 5, wherein the random number record comprises a first random number record and a second random number record;

The first random number record is used to record the random number of each transaction that has passed the first verification but has not been processed on the chain;

The second random number record is used to record the random number of each transaction that has been processed on the chain;

The processing unit is specifically used for:

After determining that the first random number does not exist in the first random number record, it is determined that the first random number does not exist in the second random number record.
7. The device of claim 6, wherein the second random number record includes a random number of a second transaction; the second transaction is a transaction recorded in N blocks with a block height of M to MN , Where M is the block height of the current block of the blockchain, M and N are both positive integers, and M is greater than N.
The device according to claim 6, wherein the processing unit is further configured to:

After placing the pending transaction in the transaction pool, package the pending transaction in the transaction pool into a block, and perform a consensus upload on the block;

Delete the first random number from the first random number record, and add the first random number and the block height of the transaction to be processed to the second random number record correspondingly in.
A computing device, characterized by comprising:

Memory, used to store program instructions;

The processor is configured to call the program instructions stored in the memory, and execute the method according to any one of claims 1 to 4 according to the obtained program.
A computer-readable non-volatile storage medium, characterized by comprising computer-readable instructions, when the computer reads and executes the computer-readable instructions, the computer is caused to execute any one of claims 1 to 4 Methods.
A computer program product, characterized in that, the computer program product includes a calculation program stored on a non-transitory computer-readable storage medium, the computer program includes program instructions, when the program instructions are executed by a computer, The computer executes the method described in any one of claims 1 to 4.