CN115239443A

CN115239443A - Transaction matching method, device, equipment and medium based on block chain

Info

Publication number: CN115239443A
Application number: CN202211161475.XA
Authority: CN
Inventors: 肖伟
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2022-09-23
Filing date: 2022-09-23
Publication date: 2022-10-25

Abstract

The disclosure provides a transaction matching method, device, equipment and medium based on a block chain, and relates to the technical field of computers, in particular to the technical field of block chains. The specific implementation scheme is as follows: acquiring a transaction request aiming at a target element; wherein a transaction counterparty of the transaction request is pending; reading the transaction information available for transaction from the under-chain queue in the process of executing the transaction request; matching and matching are carried out according to the original transaction information in the transaction request and the opposite transaction information and a matching rule to obtain a matching result; and performing uplink operation according to the matching result, and updating the downlink queue according to the matching result. The method and the system can realize the center-removing matching transaction based on the block chain.

Description

Transaction matching method, device, equipment and medium based on block chain

Technical Field

The present disclosure relates to the field of computer technology, and more particularly, to a blockchain technique.

Background

In a blockchain network, a user may be allowed to trade a target element, such as a trade request for initiating a purchase or sale of an electronic product. The transaction of the target element in the blockchain can ensure reliability and convenience.

However, when the transaction request of the target element does not set the transaction counter user, there is a need to match the transaction request.

The existing blockchain network technology is difficult to support the transaction matching requirement on the blockchain, and the processing performance, the data volume and the response speed are all limited greatly.

Disclosure of Invention

The present disclosure provides a transaction matching method, apparatus, device and medium based on blockchain.

According to an aspect of the present disclosure, there is provided a transaction matching method based on a blockchain, including:

acquiring a transaction request aiming at a target element; wherein a transaction counterparty of the transaction request is pending;

reading the transaction information available for transaction from the under-chain queue in the process of executing the transaction request;

matching and matching are carried out according to the original transaction information in the transaction request and the opposite transaction information and a matching rule to obtain a matching result;

and performing uplink operation according to the matching result, and updating the downlink queue according to the matching result.

According to another aspect of the present disclosure, there is provided a blockchain-based transaction matching device, including:

the transaction request acquisition module is used for acquiring a transaction request aiming at the target element; wherein a transaction counterparty of the transaction request is pending;

the transaction information reading module is used for reading the transaction information available for transaction from the down-link queue in the process of executing the transaction request;

the transaction information matching module is used for matching the opposite transaction information according to the original transaction information in the transaction request and the opposite transaction information according to a matching rule to obtain a matching result;

and the under-chain queue updating module is used for carrying out the uplink operation according to the matching result and updating the under-chain queue according to the matching result.

According to another aspect of the present disclosure, there is provided an electronic device including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to cause the at least one processor to perform a method for blockchain based transaction matching provided by any embodiment of the disclosure.

According to another aspect of the present disclosure, there is provided a non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform a method of blockchain based transaction matching provided by any embodiment of the present disclosure.

According to another aspect of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the blockchain-based transaction matching method provided by any of the embodiments of the present disclosure.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The drawings are included to provide a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:

fig. 1 is a schematic diagram of a transaction matching method based on a blockchain according to an embodiment of the present disclosure;

FIG. 2 is a schematic diagram of a block chain based transaction matching method according to another embodiment of the disclosure;

FIG. 3 is a schematic diagram of a block chain based transaction matching method according to another embodiment of the disclosure;

FIG. 4 is a schematic diagram of a blockchain-based transaction matching device provided in accordance with yet another embodiment of the present disclosure;

FIG. 5 is a block diagram of an electronic device used to implement methods of embodiments of the present disclosure.

Detailed Description

Exemplary embodiments of the present disclosure are described below with reference to the accompanying drawings, in which various details of the embodiments of the disclosure are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 is a schematic diagram of a block chain-based transaction matching method provided according to an embodiment of the present disclosure, and the embodiment of the present disclosure is applicable to a case where a block chain node acquires tradable opposite transaction information from a chain buy/sell queue storing tradable information, so as to match and match original transaction information of a target element on a chain, thereby implementing block chain decentralized transaction. The method can be executed by a block chain-based transaction matching device, which can be implemented in a hardware and/or software manner, and can be configured in an electronic device, such as any block chain node in a block chain network, and is particularly suitable for block chain nodes with higher credibility, such as block chain nodes in a federation chain. Referring to fig. 1, the method specifically includes the following steps:

s110, acquiring a transaction request aiming at a target element; wherein a transaction counterparty of the transaction request is pending;

s120, reading the subtended transaction information available for transaction from the under-chain queue in the process of executing the transaction request;

s130, matching and matching are carried out according to the original transaction information in the transaction request and the opposite transaction information and a matching rule to obtain a matching result;

and S140, carrying out uplink operation according to the matching result, and updating the downlink queue according to the matching result.

The target elements may include virtual currency, virtual goods, and other blockchain elements that can be transacted in a blockchain. The transaction request can be divided into a buy request or a sell request for the target element, for example, a buy target element is requested by using the A element in the user account as a payment element; or request to sell goods with the target element in the user account in exchange for other element A.

The data for the down-link queue is stored independently of the blockchain data, and typically may be stored in the local storage space of the blockchain node device. The data of the down-link queue consists of nodes with uniform data format, the data of each node can comprise user information, trading (buying or selling) price, trading quantity and trading time, and the complete data structure of any node forms a piece of trading information. The transaction information corresponds to the transaction request on the chain and therefore has a corresponding transaction Identification (ID).

According to different transaction types, the tradable information is respectively stored in a selling chain down queue and a buying chain down queue, wherein the selling chain down queue stores tradable opposite-direction transaction information of a target element for listing to be sold, and the buying chain down queue stores tradable opposite-direction transaction information of a target element for listing to be bought. The original transaction information records the transaction requirements of the user initiating the transaction request on the aspects of transaction price, transaction quantity, transaction user and the like, and the opposite transaction information records the transaction requirements of the opposite party on the aspects of transaction price, transaction quantity, transaction user and the like.

The native call interface of the queue under the chain can be constructed through an intelligent contract interface (xupper bridge) of the super chain, so that the intelligent contract can perform correct access and update operations on the queue under the chain by means of the native call interface, and the native call interface for the intelligent contract to call can include: 1) Inserting the transaction information with a set data structure into an interface in a queue under a selling chain; 2) Inserting the transaction information with a set data structure into an interface of a purchase-link-down queue; 3) And canceling the interface corresponding to the transaction or the transaction information according to the transaction Identification (ID).

Specifically, the user initiates a transaction request to the block node through the user account. And the block chain node acquires target elements for requesting transaction, transaction types and original transaction information for recording user transaction requirements from the transaction request. And determining a buy/sell off-chain queue of the target element from the multi-chain off-chain queue according to the target element and the buy and sell type of the request transaction, wherein the buy/sell off-chain queue is used as an information source of the opposite transaction information which can be matched with the original transaction information, for example, if the buy transaction of the target element is carried out by the transaction type, the corresponding information source is the sell off-chain queue of the target element. Acquiring opposite-direction transaction information matched with the original transaction information in the buying and selling types from the buying/selling off-link queue, and determining the opposite-direction transaction information matched with the transaction requirements of the user as the opposite-direction transaction information matched successfully based on the transaction requirements recorded by the original transaction information. And performing uplink publicity on the matched trade, and performing updating operations such as deleting, modifying and the like on the opposite trade information which changes after the trade in the downlink queue according to the matched trade. The off-chain queue is used as a data structure added outside the chain, the existing tradable opposite-direction trading information can be stored, namely, the trading matching on the chain is guaranteed to be real and effective, the tradable information is stored through the sell/buy queue under the chain, the matching speed and the resource consumption problem are solved, and the decentralized trading mode of the block chain is realized.

The embodiment of the invention ensures that the transaction is real and effective through on-chain transaction matching, and the off-chain queue stores tradable information to solve the problems of matching speed and resource consumption and realize a block chain decentralized transaction mode.

Fig. 2 is a flowchart of a method for matching transactions of a blockchain according to another embodiment of the present disclosure, which is improved based on the foregoing embodiment. As shown in fig. 2, the method includes:

s210, acquiring a transaction request aiming at the target element; wherein a transaction counterparty of the transaction request is pending.

Optionally, after obtaining the transaction request for the target element, the method further includes:

according to the transaction request of the target element, confirming that the target element exists in an initiating account of the transaction request and freezing the target element; and if the target element meeting the transaction request does not exist in the initiating account, ending the processing of the transaction request.

Specifically, if the transaction request is a selling request for the target elements, a certain number of target elements should be stocked in the account, and the target elements are used as an execution basis for executing the transaction after the transaction is successfully matched. The block chain link point acquires the stock quantity of the target elements in the initiating account, and if the stock quantity is higher than the transaction quantity required by transaction completion, the target elements of the transaction quantity are frozen in the transaction matching process; if the stock quantity is lower than the transaction quantity, the transaction cannot be executed even if matching is successful, and the processing of the transaction request is directly finished at the moment. In addition, if the transaction request is a purchase request of a target element, a certain number of other blockchain elements should be stored in the initiating account, and as the payment currency for the target element, the freezing process can be referred to freeze the other blockchain elements of the transaction number, and if the other blockchain elements of the transaction number cannot be frozen, the processing of the transaction request is directly ended. By pre-freezing the target elements of the transaction quantity in the initiating account, the problem that the transaction cannot be completed because the initiating account does not have the target elements of the transaction quantity after matching is successful is avoided.

S220, reading the subtended transaction information available for transaction from the under-chain queue in the process of executing the transaction request.

Optionally, when the original transaction information is the purchase information of the target element, the corresponding opposite transaction information is the sell information of the target element and is stored in the sell-off-link queue of the target element; and when the original transaction information is the sale information of the target element, the corresponding opposite transaction information is the purchase information of the target element and is stored in the purchase link lower queue of the target element.

The purchase information includes purchase conditions such as a purchase price and a purchase quantity of the target element, and the sale information includes sale conditions such as a sale price and a sale quantity of the target element.

Specifically, the transaction request may be a buy or sell request for the target element, and for the former, the original transaction information in the transaction request is the buy information of the target element, and the block chain node acquires the opposite transaction information of the pending sale target element stored in the queue from the sell chain lower queue as the sell information of the target element; for the latter, the original transaction information in the transaction request is the sell information of the target element, and the block chain node buy-down queue obtains the opposite transaction information of the purchase target element stored in the block chain node buy-down queue as the buy information of the target element. Namely, the transaction information of the opposite direction and the original transaction information are opposite to the transaction type of the target element, so that matching of the target element is completed according to the transaction information of the opposite direction and the original transaction information.

Optionally, the selling information stored in the queue under the selling chain is arranged according to the sequence that the selling price increases progressively and the selling time increases progressively; the purchase information stored in the purchase-under-chain queue is arranged according to the order that the purchase price decreases and the purchase time increases.

Specifically, each selling information in the queue under the selling chain is arranged in sequence based on the order of increasing selling price, and when the prices of a plurality of selling information are consistent, the selling information is sorted according to the events with increasing selling time, namely, the selling information is sorted according to the increasing time when the prices are the same; and when the prices of a plurality of purchase information are consistent, sorting the purchase information by events with ascending purchase time, namely sorting the purchase information by ascending according to time when the prices are the same. By optimizing the arrangement logic of the buy/sell information in the queue under the chain, the matching efficiency of the original transaction information and the opposite transaction information is improved.

Optionally, in the process of executing the transaction request, reading available transaction pair transaction information from the off-chain queue includes:

in the process of executing the transaction request, reading the transaction information available for transaction at the head of the queue from the down-link queue according to the sequence of the transaction information in the queue, and taking the transaction information as the current transaction information;

correspondingly, matching and matching the opposite transaction information according to the matching rules and the original transaction information in the transaction request comprises the following steps:

matching with the current opposite transaction information according to the original transaction information in the transaction request and a matching rule; and if the original transaction information cannot be completely matched with the current opposite transaction information, returning to execute the operation of reading the opposite transaction information at the head of the queue from the down-link queue, updating the opposite transaction information into the current opposite transaction information, and continuing to execute matching until a matching end condition is reached.

The queue under the buy chain is sorted according to descending price and ascending time, and the sell queue is sorted according to ascending price and ascending time. Therefore, the head opposite transaction information available for transaction is actually the opposite transaction information with the strongest transaction intention and the highest matching success probability in the queue.

Specifically, the opposite-direction transaction information which is at the head of the queue and is available for transaction is read as the current opposite-direction transaction information, and if the purchase price of the current opposite-direction transaction information is larger than the sale price of the original opposite-direction transaction information or the sale price of the current opposite-direction transaction information is smaller than the purchase price of the original transaction information, the current opposite-direction transaction information and the original transaction information are matched. In the matching process, the current opposite transaction information may meet the matching condition of the original transaction information, but the transaction quantity of the former is less than that of the latter, so that the latter cannot be completely transacted, at this time, the opposite transaction information at the head of the queue needs to be read again in the corresponding under-link queue as new current opposite transaction information, and the above-mentioned flow is executed again until the matching is finished. The head transaction information with the strongest transaction intention and the highest matching success probability in the down-link queue is preferentially taken as the current opposite transaction information to be matched with the original transaction information one by one, so that the matching efficiency is improved.

Optionally, the matching end condition is that the subtended transaction information in the queue under the chain is empty, or the read current subtended transaction information does not meet the matching condition.

Specifically, in addition to the case where the transaction amount of the original transaction information is completely traded and match matching is ended, in some cases, match matching may be ended in advance when the transaction amount is not completely traded. Firstly, no opposite transaction information exists in the queue under the corresponding selling/buying chain, and the matching is ended in advance because no transactable object exists at the moment; and secondly, the expected selling/buying price of the opposite-direction trading information in the queue under the selling/buying chain is not in accordance with the expected selling/buying price of the original trading information, so that the current opposite-direction trading information does not meet the matching condition, for example, the selling price of a target element in the original trading information is higher than the buying price of all opposite-direction trading information in the queue under the chain, and at the moment, the matching is finished because the original trading information cannot be consistent with the opposite-direction trading information in the matching condition, and the waste of computing resources in an insignificant matching process is avoided by finishing the matching of the original trading information in advance in partial conditions.

Optionally, the data structure of the transaction information includes: the element belongs to user information, transaction price, element quantity, transaction time and transaction identification.

The element belongs to the user information is a user account to which the element belongs before the transaction is not executed, the transaction price is a ratio between the target element and the payment currency, for example, if the transaction request is to exchange the element A and the element B, and the element B is used as the payment currency to buy/sell the element A, the transaction price is a price of the currency B required by buying one unit A.

Specifically, the transaction type, the transaction price, the element quantity, the transaction time, the element identifier of the target element and the element identifiers of other blockchain elements of the target element are used as signature parameters, signature calculation is carried out to obtain the transaction identifier of the transaction information, the transaction identifier, the user information, the transaction price, the element quantity and the transaction time of the element are stored in a data structure of the transaction information, the transaction information is uniquely identified through the transaction identifier, and the transaction matching is achieved.

Illustratively, two queues are set for A/B exchange under the chain, selling (Ask) the queue under the chain is used for placing selling information of A, buying (Bid) the queue under the chain is used for placing buying information of A, and each data node storing tradable information in the queues at least comprises user information, price, quantity and time.

When the bill is hung for sale, the element identification of A, the element identification of B, the transaction (sale) amount num, the transaction (sale) price and the time are obtained through a function Ask, the num (amount) A currency of the user is locked, and if the amount is not enough, the return fails. After the locking is successful, the transaction identifier of the transaction is calculated by signing the parameters of the function name Ask, the element identifier of A, the element identifier of B, num, price and time, and the corresponding purchase-under-chain queue is found through the code numbers of A and B.

When the user hangs the order to buy, the element identifier of A, the element identifier of B, the transaction (buy) amount num, the expected transaction (buy) price and the time are obtained through a function Bid, the num (amount) B currencies of the user are locked, and if the amount is not enough, the return fails. After the locking is successful, the transaction identifier of the transaction is calculated by signing the function name Bid, the element identifier of A, the element identifier of B, num, price and time, and the corresponding sale under-chain queue is found through the code numbers of A and B.

And S230, matching according to the original transaction information in the transaction request and the transaction price and the transaction quantity in the opposite transaction information.

If the transaction request is a purchase request, the transaction price and the transaction quantity in the original transaction information are a purchase price and a purchase quantity respectively, and the transaction price and the transaction quantity in the opposite transaction information are a sale price and a sale quantity respectively; if the transaction request is a sell request, the transaction price and the transaction quantity in the original transaction information are respectively a sell price and a sell quantity, and the transaction price and the transaction quantity in the opposite transaction information are respectively a buy price and a buy quantity

Specifically, if the original transaction information is the purchase information of the target element, acquiring the sale quantity and the sale price of each opposite transaction information from a sale chain lower queue of the target element according to the purchase price and the purchase quantity, and matching the sale information of which the sale price is not more than the purchase price to complete the transaction of the purchase quantity of the target element; and if the original transaction information is the sale information of the target element, selling the price and the expected sale quantity, acquiring the purchase quantity and the purchase price of each pair of transaction information from the purchase chain lower queue of the target element, and matching the purchase information of which the sale price is not more than the purchase price to complete the transaction of the sale quantity of the target element. By taking the transaction price and the transaction quantity as reference objects for matching, the rules for matching are simplified, and the matching efficiency is improved.

And S240, carrying out uplink operation according to the matching result, and updating the downlink queue according to the matching result.

And S250, calculating an original transaction identifier according to the transaction request of the target element, and performing uplink storage.

Specifically, according to the request content of the transaction request, signature calculation is carried out on the transaction request to obtain an original transaction identifier of the transaction request, and on the basis of chain storage of the transaction matching result, the original transaction identifier which initiates the matching request is also chain stored, so that the truth and effectiveness of the matching transaction are further ensured.

S260, acquiring a transaction canceling request aiming at the existing transaction request; and according to the transaction information to be cancelled of the transaction canceling request, if the transaction information to be cancelled exists in the under-link queue, unlocking the existing transaction request in the block chain, and deleting the transaction information to be cancelled from the under-link queue.

Specifically, the down-link queue stores the opposite transaction information of purchase/sale of the user holding a bill, and before the opposite transaction information is not matched, the opposite transaction information can be withdrawn by the corresponding initiating user through the block link point, specifically: and after receiving the transaction canceling request, the block chain link point unlocks the existing transaction request in the block chain according to the transaction identifier of the transaction information to be canceled, and positions a specific node of a queue under the chain where the transaction information to be canceled is located according to the transaction identifier so as to delete the transaction information to be canceled. By unlocking the transaction request and deleting the corresponding transaction information to be cancelled in the queue under the chain, the transaction function of the block chain to the central transaction is enriched, and the transaction experience of the user is improved.

The transaction information is uniquely identified through the transaction identification, and the ordered matching of transaction matching is realized; and the original transaction identifier which initiates the matching request is also stored in an uplink manner, so that the truth and the effectiveness of the matching transaction are further ensured.

Fig. 3 is a flowchart of a method for matching transactions of a blockchain according to another embodiment of the present disclosure, which is improved based on the foregoing embodiment. As shown in fig. 3, the method includes:

s310, acquiring a transaction request aiming at the target element; wherein a transaction counterpart of the transaction request is pending;

and S320, reading the subtended transaction information available for transaction from the under-chain queue in the process of executing the transaction request.

S330, matching and matching are carried out according to matching rules and the opposite transaction information according to the original transaction information in the transaction request to obtain a matching result;

s340, if the matching result is that the original transaction information can be completely matched with the opposite transaction information, generating a transaction deleting request for deleting the opposite transaction information or a transaction reducing request for reducing the opposite transaction information according to the matched opposite transaction information; executing the delete transaction request or the reduce transaction request to realize uplink operation; and deleting or reducing the subtended transaction information from the downlink queue according to the transaction deleting request or the transaction reducing request.

Specifically, when the transaction quantity of the original transaction information is completely transacted and match matching is finished, the successfully matched opposite transaction information needs to be cleared from the corresponding under-chain queue, so that the under-chain queue is updated after transaction is finished, and the condition that the opposite transaction information which cannot be transacted is still stored in the under-chain queue is avoided. According to the transaction identification of the opposite transaction information, a transaction deleting request aiming at the opposite transaction information is generated, uplink operation is carried out by the block chain link point, and the opposite transaction information in the downlink queue is deleted by means of the corresponding native call interface. In addition, if only part of complete opposite transaction information is matched with the original transaction information, a transaction reducing request aiming at the opposite transaction information is generated according to the transaction identifier, the uplink operation is carried out on the request by the block chain node point, and the corresponding transaction quantity of the opposite transaction information is reduced by means of the corresponding native calling interface under the condition that the transaction price of the opposite transaction information is not changed. By updating the opposite transaction information in the queue under the chain after the transactions are matched, the queue under the chain is ensured to be real and effective.

S350, if the matching result is that the original transaction information cannot be completely matched with the opposite transaction information, generating a new transaction request of the new transaction information of the target element according to the unmatched residual original transaction information; executing the newly added transaction request to realize uplink operation; and adding the new transaction information into an opposite down-link queue according to the new transaction request.

Wherein, the new transaction request comprises a new transaction request of a sell queue and a new transaction request of a buy queue

Specifically, if the transaction information is not completely traded and matching is finished, a newly added transaction request and corresponding new transaction information of a sell/buy queue of the transaction information are generated according to the transaction type of the original transaction information and the remaining original transaction information which is not matched, the newly added transaction request is executed by the block link point to finish the uplink operation, and the new transaction information is added into a sell/buy-off-link queue consistent with the transaction type of the new transaction information, for example, the remaining target elements which are not all sold are listed in an under-link sell queue to serve as new opposite transaction information to wait for matching of subsequent other original transaction information. In addition, when the new opposite transaction information is stored in the down-chain queue, the opposite transaction information in the down-chain queue is sorted based on the transaction price and the transaction time, so the new opposite transaction information is sorted once and is arranged in the corresponding position of the down-chain queue. The original transaction information which cannot be completely transacted is converted into the opposite transaction information, and the subsequent matching with other original transaction information is waited, so that the matching and matching capability of the original transaction information is improved.

Illustratively, for a match of a sell target element, 1) if there is a buy price in the buy queue that is higher than the sell price: the buy queue is traversed from scratch until all deals are reached or the maximum buy price in the buy queue is less than the sell price. (1) If all deals are committed, the function returns successfully, and matched subtended transaction information is deleted from the buying queue; (2) if partial matching exists in the nodes in the buying queue, the transaction number of the node is subtracted by the matching number, and the node does not delete and update the transaction request identification; (3) if the original transaction information is only partially committed, the remaining non-committed parts form a new data structure of the opposite transaction information to be inserted into the selling queue, and the function returns successfully. 2) If the purchase price in the purchase queue is not higher than the sell price, the opposite transaction information which directly forms a new data structure by the original transaction information is inserted into the sell queue, and the function is successfully returned.

Illustratively, for a match of a buy target element, 1) if there is a sell price in the sell queue that is less than the buy price in the buy information, the buy queue is traversed from the beginning until all of the deals are made, or the minimum sell price in the sell queue is greater than the buy price. (1) If all deals are successful, the function returns successfully, and matched opposite-direction transaction data is deleted in the selling queue; (2) if the nodes in the selling queue have partial matching, the transaction quantity of the node is subtracted by the matching quantity, and the node does not delete and update the transaction request identifier; (3) if the original transaction information is only partially committed, the remaining non-committed parts form a new data structure of the opposite transaction information to be inserted into the selling queue, and the function returns successfully. 2) If the selling price is not lower than the buying price in the selling queue, the opposite transaction information of a new data structure formed by the original transaction information is directly inserted into the buying queue, and the function is returned successfully.

The embodiment of the disclosure updates the opposite transaction information in the queue under the chain after the transactions are matched, so that the queue under the chain is ensured to be real and effective.

Fig. 4 is a schematic structural diagram of a transaction matching device based on a blockchain according to another embodiment of the present disclosure. As shown in fig. 4, the apparatus includes:

a transaction request obtaining module 410, configured to obtain a transaction request for a target element; wherein a transaction counterpart of the transaction request is pending;

a transaction information reading module 420, configured to read, from the off-chain queue, counter-transaction information available for a transaction in a process of executing the transaction request;

the transaction information matching module 430 is used for matching the opposite transaction information according to the original transaction information in the transaction request and the opposite transaction information and a matching rule to obtain a matching result;

and a down-link queue updating module 440, configured to perform an uplink operation according to the matching result, and update the down-link queue according to the matching result.

The transaction matching device based on the block chain provided by the embodiment of the disclosure can execute the transaction matching method based on the block chain provided by any embodiment of the disclosure, and has corresponding functional modules and beneficial effects of the execution method.

Optionally, when the original transaction information is the purchase information of the target element, the corresponding opposite transaction information is the sell information of the target element and is stored in the sell-off-link queue of the target element; and when the original transaction information is the sale information of the target element, the corresponding opposite transaction information is the purchase information of the target element and is stored in the purchase-linked lower queue of the target element.

Optionally, the transaction information matching module 430 is specifically configured to match and match the transaction price and the transaction quantity in the opposite transaction information according to the original transaction information in the transaction request and the transaction price and the transaction quantity in the opposite transaction information.

Optionally, the downlink queue updating module 440 includes:

an update request generation unit, configured to generate a delete transaction request for deleting the opposite transaction information or a reduce transaction request for reducing the opposite transaction information according to the matched opposite transaction information if the matching result indicates that the original transaction information can be completely matched with the opposite transaction information;

an update request execution unit, configured to execute the delete transaction request or the reduce transaction request to implement uplink operation;

and the transaction information updating unit is used for deleting or reducing the opposite transaction information from the downlink queue according to the transaction deleting request or the transaction reducing request.

Optionally, the downlink queue updating module 440 includes: a new transaction request generating unit, configured to generate a new transaction request of the new transaction information of the target element according to the remaining original transaction information that is not matched if the matching result is that the original transaction information cannot be completely matched with the opposite transaction information;

a newly added request execution unit, configured to execute the newly added transaction request to implement a cochain operation;

and the transaction information adding unit is used for adding the new transaction information into the opposite-direction downlink queue according to the new transaction request.

Optionally, the transaction information reading module 420 is specifically configured to, in the process of executing the transaction request, read, from the off-link queue, the subtended transaction information available for transaction at the head of the queue according to the sequence of the transaction information in the queue, and serve as the current subtended transaction information; correspondingly, the transaction information matching module 430 includes: the current transaction information matching unit is used for matching the current opposite transaction information according to the original transaction information in the transaction request and the current opposite transaction information according to a matching rule; and the current transaction information updating unit is used for returning and executing the operation of reading the transaction information at the head of the queue from the off-link queue, updating the transaction information into the current transaction information and continuously executing matching until the matching end condition is reached if the original transaction information cannot be completely matched by the current transaction information.

Optionally, the apparatus further comprises:

the target element freezing module is used for confirming that the target element exists in an initiating account of the transaction request according to the transaction request of the target element and freezing the target element;

and the transaction request ending module is used for ending the processing of the transaction request if the target element meeting the transaction request does not exist in the initiating account.

Optionally, the apparatus further comprises:

and the transaction identifier storage module is used for calculating the original transaction identifier according to the transaction request of the target element and performing uplink storage.

Optionally, the apparatus further comprises:

the cancellation request acquisition module is used for acquiring a cancellation transaction request aiming at the existing transaction request;

and the cancellation request processing module is used for unlocking the existing transaction request in the block chain and deleting the transaction information to be cancelled from the off-chain queue if the transaction information to be cancelled exists in the off-chain queue according to the transaction information to be cancelled of the cancellation transaction request.

The further-described transaction matching device based on the blockchain can also execute the transaction matching method based on the blockchain provided by any embodiment of the disclosure, and has corresponding functional modules and beneficial effects of the execution method. In the technical scheme of the disclosure, the collection, storage, use, processing, transmission, provision, disclosure and the like of the personal information of the related user all conform to the regulations of related laws and regulations, and do not violate the good custom of the public order.

The present disclosure also provides an electronic device, a readable storage medium, and a computer program product according to embodiments of the present disclosure.

FIG. 5 illustrates a schematic block diagram of an example electronic device 500 that can be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic devices may also represent various forms of mobile devices, such as personal digital processors, cellular telephones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not intended to limit implementations of the disclosure described and/or claimed herein.

As shown in fig. 5, the apparatus 500 comprises a computing unit 501 which may perform various appropriate actions and processes in accordance with a computer program stored in a Read Only Memory (ROM) 502 or a computer program loaded from a storage unit 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the device 500 can also be stored. The calculation unit 501, the ROM 502, and the RAM 503 are connected to each other by a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

A number of components in the device 500 are connected to the I/O interface 505, including: an input unit 506 such as a keyboard, a mouse, or the like; an output unit 507 such as various types of displays, speakers, and the like; a storage unit 508, such as a magnetic disk, optical disk, or the like; and a communication unit 509 such as a network card, modem, wireless communication transceiver, etc. The communication unit 509 allows the device 500 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

The computing unit 501 may be a variety of general and/or special purpose processing components with processing and computing capabilities. Some examples of the computing unit 501 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The computing unit 501 performs the various methods and processes described above, such as blockchain-based transaction matching methods. For example, in some embodiments, the transaction matching method may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as storage unit 508. In some embodiments, part or all of the computer program may be loaded and/or installed onto device 500 via ROM 502 and/or communications unit 509. When the computer program is loaded into the RAM 503 and executed by the computing unit 501, one or more steps of the transaction matching method described above may be performed. Alternatively, in other embodiments, the computing unit 501 may be configured to perform the transaction matching method in any other suitable manner (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), system on a chip (SOCs), complex Programmable Logic Devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Network (WAN) blockchain networks, and the internet.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service are overcome. The server may also be a server of a distributed system, or a server incorporating a blockchain.

Artificial intelligence is the subject of research that makes computers simulate some human mental processes and intelligent behaviors (such as learning, reasoning, thinking, planning, etc.), both at the hardware level and at the software level. Artificial intelligence hardware technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing, and the like; the artificial intelligence software technology mainly comprises a computer vision technology, a voice recognition technology, a natural language processing technology, a machine learning/deep learning technology, a big data processing technology, a knowledge map technology and the like.

Cloud computing (cloud computing) refers to a technology system that accesses a flexibly extensible shared physical or virtual resource pool through a network, where resources may include servers, operating systems, networks, software, applications, storage devices, and the like, and may be deployed and managed in a self-service manner as needed. Through the cloud computing technology, high-efficiency and strong data processing capacity can be provided for technical application and model training of artificial intelligence, block chains and the like.

It should be understood that various forms of the flows shown above, reordering, adding or deleting steps, may be used. For example, the steps described in this disclosure may be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solutions provided by this disclosure can be achieved, and are not limited herein.

The above detailed description should not be construed as limiting the scope of the disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.

Claims

1. A transaction matching method based on a blockchain comprises the following steps:

matching with the opposite transaction information according to the original transaction information in the transaction request and a matching rule to obtain a matching result;

2. The method of claim 1, wherein:

when the original transaction information is the purchase information of the target element, the corresponding opposite transaction information is the sale information of the target element and is stored in a sale under-chain queue of the target element;

and when the original transaction information is the sale information of the target element, the corresponding opposite transaction information is the purchase information of the target element and is stored in the purchase-linked lower queue of the target element.

3. The method of claim 2, wherein:

the selling information stored in the under-chain queue is arranged according to the sequence that the selling price is increased and the selling time is increased;

the purchase information stored in the purchase-under-chain queue is arranged according to the order that the purchase price decreases and the purchase time increases.

4. The method of claim 1, wherein: the data structure of the transaction information comprises: user information of the element, transaction price, element quantity, transaction time and transaction identification.

5. The method of claim 1, wherein matching with the opposite transaction information according to a matching rule according to the original transaction information in the transaction request comprises:

and matching according to the original transaction information in the transaction request and the transaction price and the transaction quantity in the opposite transaction information.

6. The method of claim 1 or 5, wherein performing uplink operation according to the matching result, and updating the downlink queue according to the matching result comprises:

if the matching result is that the original transaction information can be completely matched with the opposite transaction information, generating a transaction deleting request for deleting the opposite transaction information or a transaction reducing request for reducing the opposite transaction information according to the matched opposite transaction information;

executing the delete transaction request or the reduce transaction request to realize uplink operation;

and deleting or reducing the subtended transaction information from the downlink queue according to the transaction deleting request or the transaction reducing request.

7. The method of claim 1 or 5, wherein performing uplink operation according to the matching result, and updating the downlink queue according to the matching result comprises:

if the matching result is that the original transaction information cannot be completely matched with the opposite transaction information, generating a new transaction request of the new transaction information of the target element according to the remaining original transaction information which is not matched;

executing the new transaction request to realize the uplink operation;

and adding the new transaction information into an opposite down-link queue according to the new transaction request.

8. The method of claim 1, wherein reading transactable subtended transaction information from an off-chain queue during execution of the transaction request comprises:

in the process of executing the transaction request, reading the opposite transaction information which is at the head of the queue and is available for transaction from the down-link queue according to the sequence of the transaction information in the queue, and taking the opposite transaction information as the current opposite transaction information;

correspondingly, the matching and matching according to the matching rule and the opposite transaction information according to the original transaction information in the transaction request comprises the following steps:

matching and matching the current opposite transaction information according to the original transaction information in the transaction request and a matching rule;

and if the original transaction information cannot be completely matched with the current opposite transaction information, returning to execute the operation of reading the opposite transaction information at the head of the queue from the off-link queue, updating the opposite transaction information to the current opposite transaction information, and continuously executing matching until a matching ending condition is reached.

9. The method according to claim 8, wherein the matching end condition is that the opposite transaction information in the queue under the chain is empty or the read current opposite transaction information does not satisfy the match condition.

10. The method of claim 1, after obtaining the transaction request for the target element, further comprising:

according to the transaction request of the target element, confirming that the target element exists in an initiating account of the transaction request and freezing the target element;

and if the target element meeting the transaction request does not exist in the initiating account, ending the processing of the transaction request.

11. The method of claim 1, after obtaining the transaction request for the target element, further comprising:

and calculating an original transaction identifier according to the transaction request of the target element, and performing uplink storage.

12. The method of claim 1, further comprising:

acquiring a transaction canceling request aiming at an existing transaction request;

and according to the transaction information to be cancelled of the transaction canceling request, if the transaction information to be cancelled exists in the under-link queue, unlocking the existing transaction request in the block chain, and deleting the transaction information to be cancelled from the under-link queue.

13. A blockchain based transaction matching apparatus comprising:

the transaction information matching module is used for matching and matching the opposite transaction information according to the original transaction information in the transaction request and the opposite transaction information according to a matching rule to obtain a matching result;

and the downlink queue updating module is used for performing uplink operation according to the matching result and updating the downlink queue according to the matching result.

14. The apparatus of claim 13, wherein:

15. The apparatus of claim 14, wherein:

the purchase information stored in the purchase-link-down queue is arranged in an order of decreasing purchase price and increasing purchase time.

16. The apparatus of claim 13, wherein: the data structure of the transaction information comprises: user information of the element, transaction price, element quantity, transaction time and transaction identification.

17. The device of claim 13, wherein the transaction information matching module is specifically configured to match according to the original transaction information in the transaction request and the transaction price and the transaction amount in the counter transaction information.

18. The apparatus of claim 13 or 17, wherein the under-link queue updating module comprises:

19. The apparatus of claim 13 or 17, wherein the offline queue updating module comprises:

a newly added request generating unit, configured to generate a newly added transaction request for the new transaction information of the target element according to the remaining original transaction information that is not matched, if the matching result is that the original transaction information cannot be completely matched with the opposite transaction information;

a new request execution unit, configured to execute the new transaction request to implement uplink operation;

and the transaction information adding unit is used for adding the new transaction information into the opposite-direction down-link queue according to the new transaction request.

20. The apparatus according to claim 13, wherein the transaction information reading module is specifically configured to, during execution of the transaction request, read, from the off-chain queue, the subtended transaction information at the head of the queue and available for transaction, as the current subtended transaction information, in an order of the transaction information in the queue;

correspondingly, the transaction information matching module comprises:

the current transaction information matching unit is used for matching with the current opposite transaction information according to the original transaction information in the transaction request and a matching rule;

and the current transaction information updating unit is used for returning to execute the operation of reading the opposite transaction information at the head of the queue from the off-link queue and updating the opposite transaction information into the current opposite transaction information if the original transaction information cannot be completely matched with the current opposite transaction information, and continuously executing matching until a matching ending condition is reached.

21. The device of claim 20, wherein the matching end condition is that the counter transaction information in the off-chain queue is empty or the read current counter transaction information does not satisfy the match condition.

22. The apparatus of claim 13, the apparatus further comprising:

23. The apparatus of claim 13, the apparatus further comprising:

and the transaction identifier storage module is used for calculating the original transaction identifier according to the transaction request of the target element and linking and storing the original transaction identifier.

24. The apparatus of claim 13, the apparatus further comprising:

the system comprises an undo request acquisition module, a transaction processing module and a transaction processing module, wherein the undo request acquisition module is used for acquiring an undo transaction request aiming at an existing transaction request;

25. An electronic device, comprising:

at least one processor; and

the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method for blockchain based transaction matching of any of claims 1-12.

26. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of blockchain based transaction matching according to any one of claims 1-12.