JP6467540B1 - Method for verifying transactions in a blockchain network and nodes for configuring the network - Google Patents

Abstract

In a method for verifying a transaction, a verification speed is increased.
In a blockchain network, a first node receives a transaction (tx) S201. The first node gives the received tx as an input to the Bloom filter S202. The Bloom filter is generated based on one or more past tx included in the block chain. When the Bloom filter returns true S202T, the first node searches the dictionary with the txid of tx to be verified as a key and determines whether or not there is S203T. The dictionary is generated based on one or more tx included in a previously agreed block. If the dictionary search result is false, S203F determines that the transaction to be verified is valid, and if the Bloom filter returns false, S202F also determines that tx to be verified is also valid S204.
[Selection] Figure 2

Description

  The present invention relates to a method for verifying transactions in a blockchain network and nodes for configuring the network.

  In a blockchain network comprising a plurality of nodes, each node has a blockchain with a series of blocks that have been agreed upon for adoption. Each block has a header and a body containing one or more transactions.

  Each transaction can have a hash value of the transaction as an identifier, and the identifier may be referred to as “transaction id (txid)”. The txid is used when referring to a past transaction, and the dictionary may be held in one, a plurality, or all nodes as necessary.

  One of the situations where txid is used is prevention of double execution of the same transaction. The block for which consensus is reached regarding the adoption is one in which one or more transactions are selected from the transactions accumulated in the memory pool, and when the transaction is stored in the memory pool. In some cases, a verification is made as to whether the transaction is included in a block agreed upon in the past. In addition, a transaction included in a block generated in another node may be verified.

  However, in order to perform verification, a dictionary of txids for all transactions included in a block agreed in the past is maintained, and each time a new transaction is received, the dictionary is referred to and exists in the past. It must be confirmed that there is no data, and this becomes a process that requires time or a storage area as the block height increases.

  The present invention has been made in view of such problems, and an object of the present invention is to increase the verification speed in a method for verifying a transaction in a blockchain network and a node for configuring the network. Alternatively, it is intended to suppress an increase in storage area.

  In order to achieve such an object, a first aspect of the present invention is a method for verifying a transaction in a blockchain network, the step of receiving a transaction to be verified, and the blockchain network. And entering the transaction to a Bloom filter generated based on one or more transactions included in a block agreed upon in the past, and validating the transaction if the output of the Bloom filter is false. And determining.

  The second aspect of the present invention includes, in the first aspect, when the output of the Bloom filter is true, the txid of the transaction as a key, and the block agreed upon in the blockchain network in the past. And a step of searching a dictionary generated based on one or a plurality of transactions, and a step of determining that the transaction is valid when a search result of the dictionary is false.

  According to a third aspect of the present invention, in the second aspect, the method further includes the step of determining that the transaction is invalid when the dictionary search result is true.

  According to a fourth aspect of the present invention, in any one of the first to third aspects, data for configuring the Bloom filter is stored in a memory.

  According to a fifth aspect of the present invention, in the fourth aspect, the data is a data string generated from one or more txids corresponding to one or more transactions included in the block agreed in the past. It is characterized by being.

  According to a sixth aspect of the present invention, in the fifth aspect, the data string has a bit length longer than txid of the transaction.

  In addition, according to a seventh aspect of the present invention, in any one of the first to sixth aspects, the transaction to be verified is any one of one or more transactions included in a block to be a consensus formation target. It is characterized by.

  In addition, in an eighth aspect of the present invention, in the seventh aspect, one or more txids corresponding to one or more transactions included in the block are held using the txid of the transaction to be verified as a key. The method further includes searching the temporary dictionary.

  According to a ninth aspect of the present invention, there is provided a program for causing a computer to execute a method for verifying a transaction in a blockchain network, the method receiving a transaction to be verified; Inputting the transaction to a Bloom filter generated based on one or more transactions included in a block previously agreed in the blockchain network; and if the output of the Bloom filter is false, And determining that the transaction is valid.

  According to a tenth aspect of the present invention, there is provided a node constituting the blockchain network for verifying a transaction in the blockchain network, the node receiving the transaction to be verified, and the past in the blockchain network. The transaction is input to a Bloom filter generated based on one or more transactions included in a block agreed to, and if the output of the Bloom filter is false, determining that the transaction is valid Features.

  According to one aspect of the present invention, a transaction to be verified is input to a Bloom filter generated based on one or a plurality of transactions included in a block agreed in the past in the blockchain network. By accessing the dictionary only when is obtained as an output, access to the dictionary that requires time can be suppressed and transaction verification can be speeded up.

It is a figure which shows the block chain network concerning the 1st Embodiment of this invention. It is a flowchart of the verification method of the transaction concerning the 1st Embodiment of this invention.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

(First embodiment)
FIG. 1 shows a block chain network according to a first embodiment of the present invention. The network 100 includes a first node 101, a second node 102, a third node 103, and a fourth node 104. Each of these nodes has a block chain and participates in consensus building for the adoption of a new block. Although four examples are shown in FIG. 1, this is merely an example. In addition, the network 100 may include nodes that do not participate in consensus building. Hereinafter, the description will be given focusing on the first node 101. Other nodes can also have the configuration described below.

  The first node 101 includes a communication unit 101-1 such as a communication interface, a processing unit 101-2 such as a processor and a CPU, a main storage device 101-3 such as a memory, and an auxiliary storage device 101-4 such as a hard disk. And can be configured by executing a program for performing each process. The first node 101 may include one or a plurality of devices or servers, and the program may include one or a plurality of programs. The first node 101 may be recorded on a computer-readable storage medium and stored in a non-unique manner. Can be a transient program product.

  Further, although the main storage device 101-3 and the auxiliary storage device 101-4 will be described separately, they are regarded as the same storage device or storage medium, or the storage device or storage medium including them is regarded as a storage unit. Is also possible. The main storage device 101-3 and the auxiliary storage device 101-4 may each include a plurality of storage devices or storage media. Further, it is noted that the data described below as being stored in the main storage device 101-3 may be stored in a cache memory such as L1, L2, or L3 of the processing unit 101-2 such as a CPU. To do. In this case, the main storage device 101-3 and the cache memory included in the processing unit 101-2 are included to be referred to as a “first storage device”, and the auxiliary storage device 101-4 is included to indicate the “second storage device”. Can also be called.

  The first node 101 first receives a transaction (tx) generated within or outside the blockchain network 100 (S201). Here, a transaction is generated in the network 100 and may be received by itself. In the example of FIG. 1, a transaction generated outside the network 100 has been received by a first node.

  In addition to receiving one or more transactions directly, receiving a transaction to be verified may receive one or more transactions included in the block by receiving a block generated in another node. is there.

  The first node 101 gives the received transaction as an input to the Bloom filter (S202). The Bloom filter can be operated by storing a module having a program and data for configuring the filter in the main storage device 101-3 or the first storage device and executing the program.

  The data is generated on the basis of one or more past transactions included in the block chain of each node constituting the network 100. More specifically, the data is stored in the past one or more transactions. It can be generated based on the corresponding one or more txids.

  Although txid can be a hash value of 32 bytes, a case of 4 bits will be described as an example. It is assumed that 0101 as the first txid and 1001 as the second txid exist as txid corresponding to the past transaction. By superposing these two bits of txid, a 4-bit data string 1101 can be generated and used as data for constituting the Bloom filter. In other words, based on one or a plurality of txids corresponding to one or a plurality of past transactions, a data string generated by superposing bits having a value of 1 may be used as data for configuring the filter. it can.

  Actually, it is not necessary to make the length of txid and the length of the data string the same, but some conversion to one or more txid corresponding to one or more past transactions is performed to generate a data string longer than txid. You can also For example, it is desirable that it is 100,000 times longer than the bit length of txid, more preferably 500,000 times and 1 million times or more. If it is 1 million times the txid of 32 bytes, it becomes 32 MB, and in this way, it can be stored in the general main storage device 101-3 or the first storage device.

  When the above-mentioned Bloom filter is a transaction that is not included in a block that has been agreed in the past, the Bloom filter always returns false as an output and returns true as an output. , There are times when it is a transaction that existed in the past and when it is not. Returning true even though it does not exist in the past is called false positive.

  Actually, more complicated processing is possible. However, in the case of the 4-bit example described above, when a 4-bit hash value 1001 is newly given to the Bloom filter in the first node 101 as a verification target, A program for configuring the filter determines whether or not a bit whose transaction target value is 1 is also 1 in the data string. The Bloomfill filter returns true if all of the bits for which the value of the transaction to be verified is affirmatively determined. Although 1001 does not exist in the past txid, it becomes a false positive in comparison with 1101.

  When the Bloom filter returns true, the first node 101 searches the dictionary using the txid of the transaction to be verified as a key or based on the txid, and determines the presence or absence (S203). The dictionary holds txid for one or more or all transactions included in a previously agreed block in order, and can be stored in the auxiliary storage device 101-4 or the second storage device. .

  If the dictionary search result is false, that is, the txid of the transaction to be verified is not included in the dictionary, it is determined that the transaction to be verified is valid (S204).

  If the Bloom filter returns false, the transaction to be verified is similarly determined to be valid (S204).

  When the dictionary search result is true, that is, when the txid of the transaction to be verified is included in the dictionary, it is determined that the transaction to be verified is invalid (S205).

  As described above, a Bloom filter is generated and stored in addition to a dictionary based on one or a plurality of transactions included in a block agreed upon in the past or its txid, thereby allowing access to a time-consuming dictionary. It can be suppressed to speed up transaction verification. In particular, by storing the Bloom filter module in the main storage device 101-3 such as a memory or the first storage device, the speed can be further increased.

  It is desirable that the Bloom filter and the dictionary update one or more transactions included in the block after the consensus is reached for the new block and before the next transaction to be verified is received.

  As a variation of the above-mentioned Bloom filter, each value of the data string for constituting the filter is a unit of bytes instead of bits, and the byte value at the position corresponding to the bit whose txid value is 1 is You may make it increment according to the number of txid whose value is 1. Assuming that 0101 as the first txid and 1001 as the second txid exist as txid corresponding to the past transaction, the data string to be generated is 1102 of 4 bytes. If 0001 is further considered as the third txid, the data string is 1103. In this way, txid reflected in the past can be deleted. In this form, as an example, true or false may be determined by determining whether or not the byte corresponding to the bit whose transaction value to be verified is 1 is 1 or more in the data string. it can. The filter described in this specification as the Bloom filter may be a filter that performs the required operation described above.

  In addition, in the present specification, additional information is provided unless there is a description of “only”, such as “based only on XX”, “according to XX only”, and “only XX”. Note that it is also assumed that

  Also, just in case, even if there is an aspect of performing an operation different from the operation described in this specification in any method, program, terminal, device, server, or system (hereinafter “method etc.”), each of the present invention The aspect is directed to the same operation as any of the operations described in this specification, and there is an operation different from the operation described in this specification. It is added that it is not outside the scope of the embodiment.

(Second Embodiment)
In the first embodiment, the verification of whether or not the transaction to be verified is a transaction included in a block that has been agreed in the past has been described. As a result, a plurality of identical transactions are included in the block to be agreed. It cannot be prevented.

  Therefore, in the second embodiment of the present invention, the first node 101 has, for a block generated by itself or a block received from another node, one or more corresponding to one or more transactions included in the block. Generate a temporary temporary dictionary holding the txid of

  For example, in the verification method described in the first embodiment, even if the Bloom filter returns false (S202), there is a possibility that the same txid is detected by searching the temporary dictionary. In this case, it is necessary to determine that the transaction to be verified is invalid. The same applies when the dictionary returns false (S203). It is also possible to search the temporary dictionary for all transactions using the txid of the transaction to be verified as a key before uniformly applying the Bloom filter. The temporary dictionary search time can be changed randomly or in accordance with a predetermined rule, or can be executed in parallel with the loop shown in FIG.

100 block chain network 101 first node 101-1 communication unit 101-2 processing unit 101-3 main storage device 101-4 auxiliary storage device 102 second node 103 third node 104 fourth node

Claims (5)

A method for validating a transaction in a blockchain network, comprising:
Receiving a transaction to be verified;
Inputting a txid corresponding to the transaction or the transaction to Bloom filter is generated based on one or more transactions included in the block agreed in the past in the block chain network,
Determining that the transaction is valid if the output of the Bloom filter is false;
If the output of the Bloom filter is true, searching a dictionary generated based on one or a plurality of transactions included in a block that has been agreed in the blockchain network using the txid of the transaction as a key When,
Determining that the transaction is valid if the dictionary search result is false;
Determining that the transaction is invalid if the dictionary search result is true. The data for configuring the Bloom filter is a data string generated from one or more txids corresponding to one or more transactions included in the block agreed in the past. The method described in 1. The verification subject to transaction method according to claim 1 or 2, characterized in that any of the one or more transactions included in the block to be consensus. A program for causing a computer to execute a method for validating a transaction in a blockchain network, the method comprising:
Receiving a transaction to be verified;
Inputting a txid corresponding to the transaction or the transaction to Bloom filter is generated based on one or more transactions included in the block agreed in the past in the block chain network,
Determining that the transaction is valid if the output of the Bloom filter is false;
If the output of the Bloom filter is true, searching a dictionary generated based on one or a plurality of transactions included in a block that has been agreed in the blockchain network using the txid of the transaction as a key When,
Determining that the transaction is valid if the dictionary search result is false;
And determining that the transaction is invalid if the dictionary search result is true. Nodes constituting the blockchain network for verifying transactions in the blockchain network,
Receive the transaction to be verified,
Enter the txid corresponding to the transaction or the transaction to Bloom filter is generated based on one or more transactions included in the block agreed in the past in the block chain network,
If the output of the Bloom filter is false, determine that the transaction is valid,
If the output of the Bloom filter is true, using the txid of the transaction as a key, search a dictionary generated based on one or more transactions included in a block agreed in the blockchain network in the past,
If the dictionary search result is false, the transaction is determined to be valid,
A node that determines that the transaction is invalid when a search result of the dictionary is true.

Images