CN106886890B

CN106886890B - Block chain-based timed transaction execution method

Info

Publication number: CN106886890B
Application number: CN201710066749.XA
Authority: CN
Inventors: 谢晗剑; 岳利鹏
Original assignee: Hangzhou Rivtower Technology Co Ltd
Current assignee: Hangzhou Rivtower Technology Co Ltd
Priority date: 2017-02-07
Filing date: 2017-02-07
Publication date: 2020-07-17
Anticipated expiration: 2037-02-07
Also published as: CN106886890A

Abstract

The invention discloses a block chain-based timed transaction execution method, which adds a 'timing height' and 'whether to be delayed' logic for transactions, records a 'timing queue' for each 'timing height' and a 'forward delay queue' function of a full chain to mark and buffer the timed transactions in blocks. Meanwhile, the nodes follow specific priorities and are sequentially processed according to the maximum capacity so as to achieve the function of timing transaction. The method solves the problem that a block chain has no timing mechanism, reduces the uncertainty that the transaction can be packed only when the transaction is broadcasted, and can enable a user to select whether the transaction is delayed or not by considering the problem of the maximum capacity of the block, thereby meeting different requirements of the user.

Description

Block chain-based timed transaction execution method

Technical Field

The invention adds a transaction execution sequence protocol, in particular rules and a method of a timing function thereof, on the basis of the existing block chain protocol.

Background

The block chain is a new distributed technology, and comprises transaction composition blocks which are sequentially arranged one by one, and a block composition chain which is sequentially arranged one by one, wherein each block comprises a self-increment height as a serial number, and a timestamp for recording the packing time. The security of the user data depends on a public and private key system, only the transaction signed by the user private key is a legal transaction, so that others cannot initiate the transaction instead, and each transaction only has a unique ID to ensure that the transaction cannot be initiated repeatedly.

Each operation of a user needs to actively sign and broadcast a new transaction into a network, but due to the distributed characteristic of the network, the transaction has various factors such as certain loss probability, time for broadcasting and accessing the network, time for packing and accessing the blocks by nodes, waiting for queuing when the network is congested, unfixed time interval for outputting the blocks and the like, so that the user cannot completely control the height at which the transaction is packed. If a user needs to pack a transaction at a certain time (height), the user can only manually initiate or write a client timing script mode at present, the transaction is broadcast near the time point, then a period of randomness time needs to be waited for to check the height of the transaction, and if the result of the block entry is not achieved for a long time, the transaction is inferred to have failed and needs to be initiated again.

Disclosure of Invention

The invention aims to overcome the defects in the prior art and provide a block chain-based timed transaction execution method.

The purpose of the invention is realized by the following technical scheme: a block chain-based timed transaction execution method comprises the following steps:

(1) when the block chain is started from the creation block, the timing queues of all heights are set to be empty, and the forward delay queues of the whole chain are set to be empty.

(2) Each time the node is started, the local "unprocessed transaction pool" is set to empty.

(3) When a user initiates each transaction, a 'timing height' field and a 'forward delay or not' field are designated, a transaction ID is generated, and then a signature broadcast is carried out.

(4) After receiving each transaction and verifying the signature, the node joins the local "unprocessed transaction pool" and continues broadcasting.

(5) Firstly, setting the block maximum capacity according to the block physical size or calculation amount limit, then extracting transactions according to the following priority and packaging:

(5.1) when a certain 'block-out height' packages the transaction, firstly, extracting the transaction from the head to the tail of the 'timing queue' of the current 'block-out height', and packaging according to 'block maximum capacity'. If the block capacity of the current height is insufficient, judging whether the field of the residual transactions in the timing queue of the current height is forward-delayed or not, adding the tail of the forward-delayed queue of the whole chain for the transactions of yes, and not operating for the transactions of no.

(5.2) if the transaction processing in the "timing queue" of the current "out-of-block height" is complete and the block still has capacity, then the transaction is extracted from the full chain "forward-delay queue" and packed.

(5.3) if the 'forward queue' of the full chain is processed and the block still has capacity, extracting the transaction from the 'unprocessed transaction pool' and packaging. If the timing height of the transaction is less than or equal to the block outlet height, packaging and executing the transaction; if it is greater than the "out-of-block height", the transaction is packed but not executed and added to the tail of the "timing queue" at that "timing height".

Further, in the above method, the user revokes the transaction by:

(1) the user may initiate a "revoke transaction" that revokes a timed transaction, specify a "to-be-revoked transaction ID," and sign the broadcast.

(2) When the node packs the 'cancel transaction', firstly, the 'to-be-cancelled transaction' is found according to the ID, the original initiating user is verified to be consistent with the initiating user of the 'cancel transaction', and the set 'timing height' is larger than the current 'block-out height', the transaction of the ID is deleted from the 'timing queue', otherwise, the transaction is illegally cancelled.

The invention has the beneficial effects that: the method solves the problem that a block chain has no timing mechanism, reduces the uncertainty that the transaction can be packed only when the transaction is broadcasted, and can enable a user to select whether the transaction is delayed or not by considering the problem of the maximum capacity of the block, thereby meeting different requirements of the user.

Drawings

FIG. 1 is a flow chart of the method of the present invention.

Detailed Description

The invention relates to a block chain-based timed transaction execution method, as shown in fig. 1, comprising the following steps:

step 1: when the block chain is started from the creation block, the timing queues of all heights are set to be empty, and the forward delay queues of the whole chain are set to be empty.

1.1: the queue is not required to be an actual data storage structure in the block, but only a logic structure of the chain, and can be directly cached in the memory without being stored on the chain.

Step 2: each time the node is started, the local "unprocessed transaction pool" is set to empty.

And step 3: when a user initiates each transaction, a 'timing height' field and a 'forward delay or not' field are designated, a transaction ID is generated, and then a signature broadcast is carried out.

The user needs to pay attention before setting the timing transaction at a certain height, if the existing 'timing queue' at the height may exceed the 'block maximum capacity', the subsequent transaction to be executed may be input into the 'forward delay queue' during execution, the packaging at the set height cannot be guaranteed, and the timing height may need to be modified. The user may set the "timing height" to 0 or other smaller value if he wishes to simply set the transaction to take effect immediately.

And 4, step 4: after receiving each transaction and verifying the signature, the node joins the local "unprocessed transaction pool" and continues broadcasting.

And 5: firstly, setting the block maximum capacity according to the block physical size or calculation amount limit, then extracting transactions according to the following priority and packaging:

step 5.1: when a certain 'block-out height' is used for packaging transaction, firstly, the transaction is extracted from the 'timing queue' of the current 'block-out height' from beginning to end, and the transaction is packaged according to 'maximum block capacity'. If the block capacity of the current height is insufficient, judging whether the field of the residual transactions in the timing queue of the current height is forward-delayed or not, adding the tail of the forward-delayed queue of the whole chain for the transactions of yes, and not operating for the transactions of no.

Step 5.2: if the transaction processing in the "timing queue" of the current "out-of-block height" is complete and the block still has capacity, the transaction is extracted from the full chain "forward-delay queue" and packed.

Step 5.3: if the 'forward queue' of the full chain is processed and the block still has capacity, then the transaction is extracted from the 'unprocessed transaction pool' and packed. If the timing height of the transaction is less than or equal to the block outlet height, packaging and executing the transaction; if it is greater than the "out-of-block height", the transaction is packed but not executed and added to the tail of the "timing queue" at that "timing height".

The packing sequence rule is a bottom-layer protocol, and as other nodes reserve the same timing queue and the same forward delay queue, the same sequence verification can be carried out according to the block maximum capacity of a new block so as to determine whether the block is legal or not.

In addition, the user may initiate a "revoke transaction" that revokes certain timed transactions, specify a "to-revoke transaction ID," and sign the broadcast. When the node packs the 'cancel transaction', firstly, the 'to-be-cancelled transaction' is found according to the ID, the original initiating user is verified to be consistent with the initiating user of the 'cancel transaction', and the set 'timing height' is larger than the current 'block-out height', the transaction of the ID is deleted from the 'timing queue', otherwise, the transaction is illegally cancelled.

Claims

1. A block chain-based timed transaction execution method is characterized by comprising the following steps:

(1) when a block chain is started from a creation block, setting timing queues at all heights to be empty, and setting forward delay queues of the whole chain to be empty;

(2) when the node is started each time, setting a local unprocessed transaction pool to be empty;

(3) when a user initiates each transaction, a 'timing height' field and a 'whether forward delay' field are designated, a transaction ID is generated, and then signature broadcasting is carried out;

(4) after receiving each transaction and verifying the signature, the node adds the transaction into a local unprocessed transaction pool and continues broadcasting;

(5.1) when a certain 'block-out height' packages the transaction, firstly, extracting the transaction from the beginning to the end of a 'timing queue' of the current 'block-out height', and packaging according to 'maximum block capacity'; if the block capacity of the current height is insufficient, judging whether the field of the residual transaction in the timing queue of the current height is forward-delayed or not, adding the tail of a forward-delayed queue of the whole chain for the transaction with the positive value, and not operating for the transaction with the negative value;

(5.2) if the transaction processing in the timing queue of the current 'out-of-block height' is finished and the block still has capacity, extracting the transaction from the 'forward delay queue' of the full chain and packaging;

(5.3) if the processing of the 'forward delay queue' of the whole chain is finished and the block still has capacity, extracting the transaction from the 'unprocessed transaction pool' and packaging; if the timing height of the transaction is less than or equal to the block outlet height, packaging and executing the transaction; if it is greater than the "out-of-block height", the transaction is packed but not executed and added to the tail of the "timing queue" at that "timing height".

2. The method of claim 1, wherein the user revokes the transaction by:

(1) the user can initiate a 'cancel transaction' for canceling a certain timing transaction, designate a 'transaction ID to be canceled' and sign and broadcast;

(2) when the node packs the 'cancel transaction', firstly, the 'transaction to be canceled' is found according to the ID, the original initiating user is verified to be consistent with the initiating user of the 'cancel transaction', and the set 'timing height' is larger than the current 'block-out height', the transaction of the ID is deleted from the 'timing queue', otherwise, the transaction is illegally canceled.