System and method for automated decentralized multilateral transaction processing
Through the automatic decentralized multilateral transaction processing system, the net settlement algorithm and smart contracts are used to solve the transaction deadlock caused by insufficient liquidity, improve the transaction clearing speed and liquidity optimization, and achieve efficient processing of private transactions.
Patent Information
- Application Number
- CN201880055394.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2017-07-13
- Filing Date
- 2018-07-13
- Publication Date
- 2024-11-05
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
In transactions between multiple parties, insufficient liquidity leads to a decrease in transaction liquidation speed and a problem of trading deadlock.
Adopt automatic decentralized multilateral transaction processing system and method, by receiving transaction requests, executing net settlement algorithms, identifying the second transaction that allows transactions, and performing transaction processing in the distributed general ledger, using smart contracts and rule orchestrator to unlock flow , optimize transactions in the transaction queue.
It improves transaction clearing speed, unlocks transaction deadlock, realizes efficient processing and liquidity optimization of private transactions, and avoids the need for centralized processing.
Smart Images

Figure CN112204557B_ABST
Abstract
Description
[0001] Related Applications
[0002] This application claims priority to U.S. Provisional Patent Application Serial No. 62 / 532,051, filed on July 13, 2017, the entire contents of which are incorporated herein by reference. Technical Field
[0003] The present disclosure generally relates to systems and methods for automated decentralized multilateral transaction processing. Background Art
[0004] Trading deadlock may exist where there may be multiple dependent trades between multiple parties and some or all of these trades cannot occur independently. For example, when liquidity is insufficient on one party, that party may need to wait for another trade to clear before it can clear other trades. This results in a slower rate of trade clearing. Summary of the invention
[0005] A system and method for automated decentralized multilateral transaction processing are disclosed. According to one embodiment, in an information processing device including at least one computer processor, a method for automated decentralized multilateral transaction processing may include: (1) receiving multiple transaction requests for conducting multiple transactions; (2) determining that a party to a first transaction in the multiple transactions does not meet liquidity requirements for conducting the first transaction; (3) executing a netting algorithm to identify a second transaction in the multiple transactions that, when executed, allows the first transaction to be executed; and (4) executing the first transaction and the second transaction.
[0006] In one embodiment, the method may further include propagating the transaction request to a plurality of nodes in the network.
[0007] In one embodiment, the transaction request may be propagated to the parties to the transaction.
[0008] In one embodiment, the method may further include writing the transaction to a distributed ledger.
[0009] In one embodiment, the first transaction may comprise a private transaction.
[0010] In one embodiment, the method may further include queuing the first transaction in a transaction queue.The netting algorithm may be executed after a threshold of transactions are in the transaction queue or after a threshold amount of transactions are in the transaction queue.
[0011] In one embodiment, at least one of the first transaction and the second transaction may be performed as a shielded transaction.
[0012] In one embodiment, the netting algorithm may include a smart contract.
[0013] According to another embodiment, a system for automatic decentralized multilateral transaction processing may include a network and multiple decentralized access points, the network including multiple nodes, each node including a distributed ledger and a payment manager, each decentralized access point associated with the node and including a rules orchestrator and a listener. The multiple nodes may receive multiple transaction requests for multiple transactions, each transaction request received from an associated decentralized access point. A first payment manager executed at a first node among the multiple nodes for a party to a first transaction may determine that a party to the first transaction does not meet the liquidity requirements for conducting the first transaction, and may submit the first transaction to a first distributed ledger. A first listener in a first decentralized access point associated with the first node may register the first transaction with a net settlement smart contract. A first rule orchestrator associated with the first decentralized access point may execute a net settlement smart contract to identify a second transaction in the multiple transactions, which, when executed, allows the execution of the first transaction. The first transaction and the second transaction may then be executed.
[0014] In one embodiment, the first rule orchestrator may generate a proof for the first transaction.
[0015] In one embodiment, a proof generator at a second node associated with a party to the second transaction generates a proof for the second transaction.
[0016] In one embodiment, the payment manager may include a smart contract.
[0017] In one embodiment, a transaction request may be propagated to multiple nodes in the network.
[0018] In one embodiment, the transaction request may be propagated to the parties to the transaction.
[0019] In one embodiment, the first transaction may comprise a private transaction.
[0020] In one embodiment, the netting algorithm may be after a threshold of transactions are in the transaction queue and / or after a threshold amount of transactions are in the transaction queue.
[0021] In one embodiment, at least one of the first transaction and the second transaction may be performed as a private transaction. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] For a more complete understanding of the present invention, its objects and advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which:
[0023] Figure 1 A system for automated decentralized multilateral transaction processing according to one embodiment is depicted; and
[0024] Figure 2 A method for automated decentralized multilateral transaction processing according to one embodiment is described. DETAILED DESCRIPTION
[0025] Embodiments disclosed herein relate to systems and methods for automated decentralized multilateral transaction processing.
[0026] Embodiments disclosed herein may enable liquidity optimization measures such as queuing, netting, gridlock, and deadlock resolution algorithms, and may operate on "private" transactions without the need for centralized processing.
[0027] Reference Figure 1 , according to one embodiment, an exemplary system for automated decentralized multilateral transaction processing is disclosed. System 100 may include a plurality of decentralized applications or software programs, or access points ("decentralized apps") 110, 120, 130, etc. Although three decentralized apps are shown, it should be appreciated that a greater or lesser number of decentralized apps may be included as needed and / or desired.
[0028] In one embodiment, each decentralized app 110, 120, 130 may be associated with a buyer, a seller, an investor, a financial institution, etc.
[0029] In one embodiment, each decentralized app 110 , 120 , 130 may include a rule orchestrator 112 , 122 , 132 , a listener 114 , 124 , 134 , and a proof generator 116 , 126 , 136 .
[0030] In one embodiment, the rule orchestrators 112, 122, 132 may orchestrate a series of steps required to complete a transaction. The listeners 114, 124, 134 may listen to events from their associated distributed ledgers 154, 164, and 174, and may call the associated rule orchestrators 112, 122, 132 to perform subsequent steps based on the events. The proof generators 116, 126, 136 may generate proofs for balance updates required to complete a transaction.
[0031] Each node 150, 160, and 170 may include a proof verifier 152, 162, and 172, respectively. Each proof verifier 152, 162, and 172 may verify a proof generated by a corresponding proof generator 116, 126, 136.
[0032] Each node 150, 160, and 170 may also include a distributed ledger 154, 164, and 174, respectively. The distributed ledgers 154, 164, and 174 may store encrypted transactions and hidden balances thereon.
[0033] Each node 150, 160, and 170 may also include a payment manager 156, 166, 176. In one embodiment, each payment manager 156, 166, 176 may include a smart contract.
[0034] Each node 150, 160, and 170 may also include a netting settlement module 158, 168, 178. In one embodiment, each netting settlement module 158, 168, 178 may include a smart contract.
[0035] Reference Figure 2 According to one embodiment, a method for automated decentralized multilateral transaction processing is disclosed.
[0036] In step 205, a party may submit a transaction to a node using a transaction application, computer program, etc. In one embodiment, a party may be associated with a node in a distributed ledger transaction network.
[0037] In one embodiment, the transaction may be a payment transaction, a securities settlement, a combination thereof, or any other suitable transaction.
[0038] In step 210, the node may store the encrypted private transaction, and in step 215, the transaction may be transmitted to the distributed ledger network. In one embodiment, the transaction may be propagated to each node and / or party to the transaction. In another embodiment, the transaction may be propagated to all nodes and / or parties in the network.
[0039] In one embodiment, a payment manager smart contract executing at a node may perform these functions.
[0040] In one embodiment, the transaction, or a portion thereof (if private), may be written to the distributed ledger of each node.
[0041] In step 220, the submission node may check liquidity for the transaction. In one embodiment, the payment manager smart contract may perform the liquidity check. If the liquidity check fails (e.g., the submission node does not have sufficient funds to conduct the transaction), then in step 225, the submission node (e.g., the payment manager smart contract of the submission node) may queue the transaction via a listener in the transaction application. In one embodiment, the queued transaction may be written to the distributed ledger.
[0042] In one embodiment, all listeners in the network may be notified of events on the distributed ledger in order to initiate deadlock resolution.
[0043] In one embodiment, the payment manager smart contract may be implemented as one or more smart contracts.
[0044] In step 230, the trading application may register queued trades with a netting settlement smart contract, which may receive queued trades from some or all nodes in the network. In one embodiment, once a threshold of registered queued trades is met, in step 235, the netting settlement contract may trigger deadlock resolution.
[0045] In one embodiment, the threshold may be based on the number of registered transactions, the number of nodes submitting registered transactions, the monetary amount of registered transactions, etc. In one embodiment, the threshold may be selected, for example, to optimize the number of registered transactions that can be executed.
[0046] In step 240, the trading application for each node can execute the netting algorithm. In one embodiment, each node can look at its queued transactions and can determine which queued transactions it can make if it is to receive the funds it has committed to receive. It can then submit these transactions to the netting smart contract.
[0047] In one embodiment, the nodes may execute the netting algorithm sequentially. In another embodiment, the nodes may execute the netting algorithm simultaneously or substantially simultaneously.
[0048] In step 245, once net settlement is complete, each node's transaction application can generate proof of the payment to be cleared, and the private transaction can then be submitted to the zeroknowledge proof layer in step 250, which can then verify and execute the transaction(s) in step 255.
[0049] In one embodiment, two proofs may be required (eg, one from the initiator and one from the recipient) so that each party can update their respective account balances.
[0050] In one embodiment, each node may only have knowledge of the details of the specific transaction it participated in. The node may have other information, such as an identifier for the transaction written to the distributed ledger.
[0051] In step 260, the zero-knowledge proof layer may confirm that the transaction(s) have been executed, and in step 265, the transaction application may update the transaction status of its node to "confirmed".
[0052] An illustrative example is as follows: Each of Banks A, B, and C has a balance of 0, but Bank A has a pledged balance of 10, Bank B has a pledged balance of 5, and Bank C has a pledged balance of 15. Bank A is submitting a transaction of 2 to Bank B, but it fails the liquidity test.
[0053] Therefore, a transaction is made using the deadlock resolution method. Bank A's pledge balance decreases by 2, and Bank B's pledge balance increases by 2.
[0054] In the following, general aspects of embodiments of the systems and methods of the present invention will be described.
[0055] The system of the present invention or part of the system of the present invention may be in the form of a "processing machine", such as, for example, a general-purpose computer. As used herein, the term "processing machine" will be understood to include at least one processor using at least one memory. At least one memory stores an instruction set. The instructions may be permanently or temporarily stored in one or more memories of the processing machine. The processor executes the instructions stored in the one or more memories in order to process data. The instruction set may include various instructions for performing one or more specific tasks, such as those described above. Such an instruction set for performing a specific task may be characterized as a program, a software program, or simply as software.
[0056] In one embodiment, the processing machine may be a dedicated processor.
[0057] As mentioned above, the processing machine executes instructions stored in one or more memories to process data. The processing of data may be, for example, in response to commands of one or more users of the processing machine, in response to previous processing, in response to a request by another processing machine, and / or any other input.
[0058] As mentioned above, the processing machine used to implement the present invention can be a general-purpose computer. However, the processing machine described above can also utilize any of a variety of other technologies, including special-purpose computers, computer systems (including, for example, microcomputers, minicomputers or mainframes), programmed microprocessors, microcontrollers, peripheral integrated circuit components, CSIC (customer-specific integrated circuits) or ASICs (application-specific integrated circuits) or other integrated circuits, logic circuits, digital signal processors, programmable logic devices (such as FPGAs, PLDs, PLAs or PALs), or any other device or arrangement of devices capable of implementing the steps of the process of the present invention.
[0059] The processor for implementing the present invention may utilize a suitable operating system. Thus, embodiments of the present invention may include processors running the following systems: iOS operating system, OSX operating system, Android operating system, Microsoft Windows TM Operating system, Unix operating system, Linux operating system, Xenix operating system, IBM ATX TM Operating system, Hewlett-Packard UX TM Operating system, Novell Netware TM Operating system, Sun Microsystems Solaris TM Operating system, OS / 2 TM Operating system, BeOS TM Operating system, Macintosh operating system, Apache operating system, OpenStep TM operating system or other operating systems or platforms.
[0060] It should be understood that in order to practice the method of the present invention as described above, the processor and / or memory of the processing machine do not have to be physically located in the same geographical location. That is, each of the processor and memory used by the processing machine can be located in geographically different locations and connected to communicate in any suitable manner. In addition, it should be understood that each of the processor and / or memory can be composed of different physical pieces of equipment. Therefore, the processor does not have to be a single piece of equipment in one location, and the memory does not have to be another single piece of equipment in another location. In other words, it is expected that the processor can be two pieces of equipment in two different physical locations. Two different pieces of equipment can be connected in any suitable manner. In addition, the memory can include two or more parts of the memory in two or more physical locations.
[0061] In order to further illustrate, as mentioned above, processing is carried out by various components and various memories. However, it should be appreciated that, according to other embodiments of the present invention, the processing carried out by two different components as mentioned above can be carried out by a single component. In addition, the processing carried out by a different component as mentioned above can be carried out by two different components. In a similar manner, according to other embodiments of the present invention, the memory storage carried out by two different memory parts as mentioned above can be carried out by a single memory part. In addition, the memory storage carried out by a different memory part as mentioned above can be carried out by two memory parts.
[0062] In addition, various techniques may be used to provide communications between various processors and / or memories, as well as to allow the processor and / or memory of the present invention to communicate with another other entity; i.e., for example, to obtain additional instructions or to access and use remote memory storage. For example, such techniques for providing such communications may include a network (Internet, intranet, extranet, LAN, Ethernet), wireless communications via cellular towers or satellites, or any client-server system that provides communications. For example, such communications techniques may use any suitable protocol, such as TCP / IP, UDP, or OSI.
[0063] As described above, instruction sets may be used in the processing of the present invention. The instruction set may be in the form of a program or software. For example, the software may be in the form of system software or application software. For example, the software may also be in the form of a collection of separate programs, a program module within a larger program, or a portion of a program module. The software used may also include modular programming in the form of object-oriented programming. The software tells the processor how to process the data being processed.
[0064] In addition, it should be understood that the instructions or instruction sets used in the embodiments and operations of the present invention can be in a suitable form so that the processing machine can read the instructions. For example, the instructions forming the program can be in the form of a suitable programming language, which is converted into a machine language or object code to allow one or more processors to read the instructions. That is, the programming code lines or source code lines written in a specific programming language are converted into machine language using a compiler, assembler or interpreter. Machine language is a binary coded machine instruction specific to a specific type of processing machine (i.e., for example, specific to a specific type of computer). The computer understands machine language.
[0065] Any suitable programming language may be used according to various embodiments of the present invention. Illustratively, for example, the programming language used may include assembly language, Ada, APL, Basic, C, C++, COBOL, dBase, Forth, Fortran, Java, Modula-2, Pascal, Prolog, REXX, Visual Basic, and / or JavaScript. In addition, it is not necessary to utilize a single type of instruction or a single programming language in conjunction with the operation of the system and method of the present invention. Instead, any number of different programming languages may be utilized as needed and / or desired.
[0066] Furthermore, the instructions and / or data used in the practice of the present invention may utilize any compression or encryption techniques or algorithms as desired. An encryption module may be used to encrypt data. In addition, for example, files or other data may be decrypted using a suitable decryption module.
[0067] As described above, the present invention can be illustratively embodied in the form of a processor including, for example, a computer or computer system, which includes at least one memory. It should be understood that, as desired, the instruction set (i.e., software) that enables the computer operating system to implement the operations described above can be included in any of a variety of media or media. In addition, the data processed by the instruction set can also be included in any of a variety of media. That is, for example, the specific medium (i.e., the memory in the processor) for storing the instruction set and / or data used in the present invention can take any of a variety of physical forms or transmissions. Illustratively, the medium can be paper, paper transparency, optical disk, DVD, integrated circuit, hard disk, floppy disk, optical disk, magnetic tape, RAM, ROM, PROM, EPROM, wire, cable, optical fiber, communication channel, satellite transmission, memory card, SIM card or other remote transmission, and any other medium or data source that can be read by the processor of the present invention.
[0068] In addition, as desired, one or more memories used in a processor implementing the present invention may be in any of a variety of forms to allow the memory to store instructions, data, or other information. Thus, the memory may be in the form of a database for storing data. The database may use any desired file arrangement, such as, for example, a flat file arrangement or a relational database arrangement.
[0069] In system and method of the present invention, multiple " user interface " can be used to allow user to be connected with one or more processing machine interfaces for implementing the present invention.As used herein, user interface comprises any hardware, software or the combination of hardware and software used by the processing machine that allows user to interact with processing machine.For example, user interface can be the form of dialogue screen.User interface can also comprise any one of following: mouse, touch screen, keyboard, keypad, voice reader, voice recognizer, dialogue screen, menu box, list, check box, toggle switch, button or any other equipment that allows user to receive information about the operation of processing machine when processing instruction set and / or providing information to processing machine.Therefore, user interface is any equipment that provides communication between user and processing machine.For example, the information that is provided to processing machine by user through user interface can be the form of selection of command, data or some other input.
[0070] As discussed above, the processing machine that implements instruction set utilizes user interface so that the processing machine processes the data of user.User interface is usually used by processing machine, for interacting with user, to carry information or receive information from user.But, should be appreciated that according to some embodiments of system and method of the present invention, human user actually need not interact with the user interface used by processing machine of the present invention.On the contrary, it is also contemplated that user interface of the present invention can interact with another processing machine rather than human user, that is, carry and receive information.Therefore, other processing machines can be characterized as user.In addition, it is contemplated that the user interface utilized in system and method of the present invention can partially interact with another processing machine or a plurality of processing machines, and also partially interact with human user.
[0071] Those skilled in the art will readily appreciate that the present invention is susceptible to widespread use and application. Many embodiments and adaptations of the present invention other than those described herein, and many variations, modifications and equivalent arrangements will be apparent from the present invention and the foregoing description thereof, or reasonably suggested by the present invention and the foregoing description thereof, without departing from the spirit or scope of the present invention.
[0072] Therefore, although the present invention has been described in detail with respect to exemplary embodiments of the present invention, it should be understood that the present disclosure is only an illustration and example of the present invention and is used to provide the enabling disclosure of the present disclosure. Therefore, the foregoing disclosure is not intended to explain or limit the present invention or otherwise exclude any other such embodiments, adaptations, variations, modifications or equivalent arrangements.
Claims
1. A method for automated decentralized multilateral transaction processing, comprising: In an information processing device comprising at least one computer processor and configured as a first node of a distributed ledger network: receiving a plurality of transaction requests for performing a plurality of transactions, the plurality of transactions including a first transaction for execution; Determining, by the payment manager smart contract of the first node, that a party to the first transaction does not meet liquidity requirements for conducting the first transaction; queuing, by the payment manager smart contract and based on determining that a party to the first transaction does not meet liquidity requirements, the first transaction in a listener queue of the first node; Registering the queued first transaction with a netting smart contract of a netting module of the first node; registering a plurality of other transactions by the netting smart contract, the plurality of other transactions being queued at corresponding listener queues of a plurality of other nodes of the distributed ledger network; In response to the number of registered transactions satisfying a threshold, and a second transaction of the plurality of registered transactions being identified by the netting smart contract, the second transaction, when executed, allowing the first transaction to be executed; as well as The first transaction and the second transaction are performed.
2. The method according to claim 1, further comprising: The transaction request is propagated to multiple nodes in the network. The method of claim 2 , wherein the transaction request is propagated to the parties to the transaction.
4. The method according to claim 1, wherein The threshold number of transactions is based on a number of transactions registered with the netting smart contract, wherein the threshold is selected to optimize the number of transactions that can be executed. The method of claim 1 , wherein the first transaction comprises a private transaction.
6. The method according to claim 1, Wherein the threshold number of transactions is based on a number of nodes of the distributed ledger network that have registered transactions with the netting smart contract, wherein the threshold is selected to optimize the number of transactions that can be executed.
7. The method of claim 1, wherein at least one of the first transaction and the second transaction is performed as a private transaction.
8. A system for automated decentralized multilateral transaction processing, comprising: a distributed ledger network comprising a plurality of nodes, each node comprising a distributed ledger and a payment manager smart contract; A plurality of decentralized access points, each of which is associated with a node and includes a rule orchestrator and a listener; in: A first node of the plurality of nodes receives a plurality of transaction requests for conducting a plurality of transactions, the plurality of transactions including a first transaction for execution, wherein each transaction request is received from an associated decentralized access point; a payment manager smart contract executing at the first node of the plurality of nodes determining that a party to the first transaction does not meet liquidity requirements to conduct the first transaction; Based on determining that the party to the first transaction does not meet liquidity requirements to conduct the first transaction, the payment manager smart contract queues the first transaction in a first listener queue of a first decentralized access point associated with the first node; The first listener queue in the first decentralized access point associated with the first node registers the first transaction with a netting smart contract of a netting module of the first node; The netting smart contract registers a plurality of other transactions, the plurality of other transactions being queued at respective listener queues of decentralized access points associated with other nodes of the distributed ledger network; In response to the number of registered transactions satisfying a threshold, the netting smart contract identifies a second transaction that allows execution of the first transaction when the second transaction is executed; The first transaction and the second transaction are executed.
9. The system of claim 8, wherein the first rule orchestrator generates a proof for the first transaction.
10. The system of claim 9, wherein a proof generator at a second node associated with a party to the second transaction generates a proof for the second transaction.
11. The system of claim 8, wherein the threshold number of transactions is based on a number of transactions registered with the netting smart contract, wherein the threshold is selected to optimize the number of transactions that can be executed.
12. The system of claim 8, wherein the plurality of transaction requests are propagated to the plurality of nodes in the network.
13. The system of claim 8, wherein the plurality of transaction requests are propagated to parties to the transaction.
14. The system of claim 8, wherein the first transaction comprises a private transaction.
15. The system of claim 8, wherein the threshold number of transactions is based on a number of nodes of the distributed ledger network that have registered transactions with the netting smart contract, wherein the threshold is selected to optimize the number of transactions that can be executed.
16. The system of claim 8, wherein at least one of the first transaction and the second transaction is performed as a private transaction.
