Distributed trading network based on asynchronous directed acyclic graph
By randomly selecting verifiers in a distributed trading network and executing transactions in an asynchronous non-cyclic topology graph, combined with the verifier collateral mechanism, the performance and security problems of blockchain technology are solved, and efficient and secure transaction execution is achieved. and decentralized networks.
Patent Information
- Application Number
- CN201910829909.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2018-09-04
- Filing Date
- 2019-09-03
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2039-09-03
AI Technical Summary
Blockchain technology has limited its scalability due to low performance, high latency, high transaction costs and non-scalability, and the existing alternative transaction network has flaws in terms of security and decentralization, which cannot effectively prevent double spending and competition. situation.
Adopting a distributed trading network, by randomly selecting validators and executing transactions in asynchronous and non-cyclic topology graphs, ensuring the order and security of transactions, and incentivizing participants through the validator collateral mechanism to prevent malicious behavior, while using global Consensus mechanisms manage validator allocation and transaction verification.
It realizes the performance and scalability of the transaction network while ensuring security and decentralization, preventing double spending and competition conditions, reducing transaction delays, and improving the integrity of verifiers through collateral mechanisms.
Smart Images

Figure CN111199481B_ABST
Abstract
Description
Technical Field
[0001] The present invention generally relates to a system for executing a transaction for transferring digital assets between two parties. In particular, the present invention relates to a distributed transaction network suitable for asynchronously executing secure transactions. Background Art
[0002] Blockchain technology is becoming increasingly popular due to its ability to provide a distributed, trustless transaction system that can transparently execute transactions and establish an unalterable permanent record of executed transactions. However, blockchain technology suffers from poor performance, high latency, and high transaction costs due to its underlying design, which severely limits the scalability of the technology.
[0003] In a traditional blockchain network, transactions are written into new blocks and must be verified by each full node of the network by sequentially syncing the blockchain of all transactions. As a result, the performance of the network (defined by the number of transactions that the network can process in a given time interval) is strictly limited by the block size and the time interval between new blocks, and they perform global consensus on all transactions. In addition, each full node must also keep a complete copy of an ever-expanding distributed ledger that records all transactions processed by the blockchain network. This ever-increasing storage and computing requirements, coupled with the ever-increasing processing power required to generate new blocks, creates a significant barrier to participation for ordinary users and undermines the distributed and decentralized nature of blockchains, as fewer and fewer nodes are able to meet the processing and data storage requirements. As a result, blockchains not only limit scalability, but also reduce the security provided by decentralized networks, as processing power becomes increasingly concentrated in a smaller and smaller number of sufficiently powerful individual nodes or centralized pools.
[0004] There are also some existing alternative networks that seek to address the scalability and performance penalties that traditional blockchain networks lack. One type of prior art transaction network relies on a peer-to-peer network that dispenses with the consensus and verification of the blockchain, instead requiring each participant conducting a transaction to verify two previous transactions organized into a transaction chain data structure before processing each transaction, thus theoretically creating a chain of honest transactions. However, this approach does not completely prevent double spend attacks or race conditions, where assets are accessed simultaneously in multiple transactions, nor does it provide strong verification of each transaction to prevent dishonest participants from overwhelming honest participants during periods when their transaction activity is suspended. Other networks also exist that rely on trusted parties acting as "delegates" or "notaries" to verify transactions, thereby creating a centralized network that completely abandons the advantages of a trustless, decentralized network.
[0005] Therefore, there is a need for a truly decentralized distributed transaction network that can ensure the execution of secure transactions while overcoming the non-scalability and performance deficiencies of existing blockchain technology, while avoiding the shortcomings of reduced security and increased centralization of alternative transaction networks in existing technologies.
[0006] In the content disclosed in the present invention, there are references or discussions of documents, laws or knowledge clauses. Such references and discussions do not admit that the documents, laws or knowledge clauses and their combinations have priority, are in a public state, are part of the common knowledge or otherwise constitute the prior art according to applicable legal provisions, or are known to be relevant to attempts to solve any problems involved in the present disclosure.
[0007] When discussing certain aspects of conventional technology in order to better disclose the technical solution of the present invention, no technical rights are waived. It is expected that the claims may cover certain aspects of one or more conventional technologies mentioned herein. Summary of the invention
[0008] One aspect of an embodiment disclosed in the present invention is to provide a distributed network capable of securely executing transactions involving the transfer of digital assets between parties to a transaction. Typically, each transaction includes a transaction obligation, in which one of the parties to the transaction is the transferor, which is obliged to transfer the control of the asset to another party to the transaction as the transferee. Therefore, the present invention provides a distributed transaction network suitable for randomly selecting a verifier from a plurality of verifier nodes and assigning the verifier to each transaction party (referred to as the client of the verifier) involved in all its transactions. Each verifier verifies the transaction by determining that the digital asset (or state) of its transaction party satisfies the transaction obligation, and strictly executes the transactions of all specific transaction parties in order. Randomly selecting and assigning verifiers to transaction parties can prevent collusion between verifiers and transaction parties. This embodiment also uses the word node to refer to the parties or transaction parties on the distributed transaction network interchangeably.
[0009] Another aspect of one embodiment of the present invention provides a distributed network that can execute transactions securely, asynchronously, and in parallel, without delaying the execution of each transaction to be verified and selected by the next node that creates a block in the entire distributed blockchain network, and then the transaction is included in the next block of the global consensus mechanism. Accordingly, the present invention provides a distributed transaction network in which each transaction is executed asynchronously immediately after being agreed and signed by all relevant transaction parties and their validators. This requires each transaction party to digitally sign each transaction, and each validator assigned to each transaction party verifies and signs the transaction. The signed transaction is then broadcast to the entire network.
[0010] Another aspect of the present invention is to provide a distributed network that can prevent race conditions, forks or double spending from occurring. Therefore, the present invention provides a distributed transaction network that is suitable for forming an asynchronous distributed acyclic topological graph, the graph comprising a plurality of topologically ordered vertices, each vertex representing a transaction. In the graph, all transactions of each transaction party form a single transaction path of a series of interconnected transactions, which connects the most recent transaction of the transaction party to the earliest transaction of the same transaction party, ensuring that each transaction of the same transaction party is executed in order and that the assets of the transferor can only be used in one transaction at a time.
[0011] Another aspect of the present invention is to provide a distributed network adapted to incentivize validator participation to increase the processing power and reliability of the network. Thus, the present invention provides a distributed transaction network in which each validator is entitled to charge a fee for each verified transaction and is also required to provide collateral, which will be forfeited if the validator incorrectly verifies an invalid transaction or causes a fork in the transaction sequence of its counterparties.
[0012] Another aspect of the present invention provides a distributed network that is able to protect itself from attacks from malicious nodes acting as verifiers, or verifiers making mistakes. Therefore, the distributed transaction network also includes a plurality of nodes that are suitable for generating and retaining a global consensus mechanism that is suitable for storing the assignment of each verifier to each transaction party, rather than storing the transaction data itself. The global consensus mechanism is usually maintained by a plurality of nodes, and only allows the nodes to perform actions through the global consensus mechanism to allocate and reallocate verifiers, revoke invalid transactions, and confiscate the collateral of unqualified verifiers that have verified invalid transactions or forks. Each completed transaction is broadcast to all nodes on the network, and the transaction can be checked by the distributed transaction network, and the distributed transaction network is suitable for revoking incorrectly verified transactions. However, such checks are voluntary and do not prevent or delay the occurrence and confirmation of transactions.
[0013] The present invention solves at least one of the aforementioned shortcomings of blockchain - in particular, the lack of scalability inherent in examples found in the prior art. However, it is expected that the present invention can effectively solve other problems and defects in blockchain. Therefore, the claims should not be interpreted as being limited to solving any specific problems or defects discussed above. In order to achieve the above objects, the present invention can be implemented in the form shown in the accompanying drawings. However, it should be noted that the drawings are only illustrative and their variations should also be considered part of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0014] In the accompanying drawings, the same elements in the present invention are represented by the same reference numerals. A brief description of the accompanying drawings is as follows.
[0015] Figure 1A The accompanying drawings are for describing an asynchronous distributed transaction network including a plurality of interconnected nodes according to an embodiment disclosed in the present invention, wherein the plurality of interconnected nodes include validator nodes, non-validator nodes and all other nodes.
[0016] Figure 1B It is a block diagram describing the interaction between a distributed transaction network and a global consensus mechanism blockchain according to an embodiment disclosed in the present invention.
[0017] Figure 1C The invention is a block diagram describing the relationship between transaction parties and their corresponding validators according to an embodiment of the present invention, and the location of example transactions in an asynchronous directed acyclic transaction graph.
[0018] Figure 1D It is a block diagram that describes an embodiment of the present invention in which each transaction party collectively refers to the ownership of its digital assets as its state, and the control of each transaction party's state through its validator, and further shows how each validator has its own validator and needs to use its digital assets as collateral.
[0019] Figure 2A is a block diagram depicting a pending transaction and two preceding transactions according to one embodiment of the present disclosure.
[0020] Figure 2B is a block diagram depicting an example transaction with transaction parameters signed by each transaction party and their respective verifiers according to one embodiment of the present disclosure.
[0021] Figure 2C is a block diagram describing the status of each transaction party according to an embodiment disclosed in the present invention.
[0022] Figure 3 is a block diagram describing a distributed asynchronous transaction graph according to an embodiment of the present disclosure.
[0023] Figure 4 1 is a block diagram describing a fork situation according to an embodiment disclosed in the present invention, where multiple pending transactions with the same transaction party point to a previous transaction of this transaction.
[0024] Figure 5 The present invention is a flowchart describing a transaction process in which a distributed transaction network facilitates and verifies transactions according to an embodiment of the present invention.
[0025] Figure 6 is a flow chart describing a post-validation verification process according to an embodiment of the present disclosure.
[0026] The present disclosure will now be described more fully with reference to block diagrams, which illustrate various exemplary embodiments. However, the present disclosure may be embodied in many different forms and should not be construed as being limited to the exemplary embodiments described herein. Instead, these exemplary embodiments are provided to make the present invention thorough, complete, and fully convey the scope of the present invention to those skilled in the art. DETAILED DESCRIPTION
[0027] In the following description of the preferred embodiment, generally, the boxes represent data structures, including transactions 40 (such as Figure 1A ) or block 38 in the blockchain (as shown Figure 1B ). The ovals represent a collection of such data structures, such as a collection of digital transactions 14 constituting an asynchronous directed acyclic transaction graph, or a collection of blocks 30 constituting a blockchain. In general, the rectangular boxes represent nodes 12 constituting computing resources, which may represent entities in the real world that may own digital assets, conduct transactions on the network, or perform certain functions on the network, such as verification, to other nodes.
[0028] Figure 1AAn asynchronous distributed transaction network 10 for verifying and completing transactions 40 between transaction parties 15 is shown, and the transaction parties 15 include multiple nodes 12 interconnected via a network (such as the Internet). Each node 12 is a computing device and can be a verifier node 19 or a non-verifier node 17. Any node 12 can act as a user node that allows it to access the distributed transaction network 10 and participate as a transaction party 15, and the verifier node 19 is suitable for performing additional distributed computing operations on the distributed transaction network 10, as well as distributed data storage that constitutes all transactions. In addition, the transaction party does not restrict users, and any node 12 can participate as a transaction party 15. Each transaction 40 is included in the transaction network 42, and the transaction network 42 uses distributed data storage to store all transactions. The distributed transaction network 10 also includes a set 14 of digital transactions of an asynchronous directed acyclic transaction graph, which is a data structure generated using the transaction network 42, which is jointly maintained by the verifier node 19. When joining the distributed trading network 10, a verifier is randomly selected from all the verifier nodes 19 and assigned to each node 12. The node 12 to which the verifier is assigned is called a client node 17. Each node 12 can (but is not required to) store a complete copy of the set 14 of digital transactions of the directed acyclic transaction graph, and is also eligible to be assigned to its client node 17 by the distributed trading network 10. More specifically, the verifier node 19 of the user node saves the complete transaction history of its client node 17, as well as the current "state" of all digital assets that make up its client node. By randomly assigning verifiers to its client nodes 17 to act as an impartial third party, the distributed trading network 10 can prevent the client node 17 from participating in invalid transactions or carrying out other improper actions, such as double spending (forking). In addition, the distributed trading network blockchain 30 can be further implemented across multiple nodes 12, and the blockchain 30 stores the assignment of a single verifier therein at each node in the network. The distributed trading network uses the blockchain to reach a global consensus when assigning a verification node to each trading node, which is maintained by multiple nodes 13 that create blocks. The validator node 19 may also perform the functions of the node 13 that creates the block.
[0029] Each transaction in the set 14 of digital transactions of the asynchronous directed acyclic transaction graph is locally updated by the transacting party 15 and its verifier 19, and together with all other transactions updated by other transacting parties and their verifiers, constitutes the set 14 of digital transactions of the complete graph. The locally updated transactions are then broadcast to the entire network by the transacting party node 17 and its verifier 19 so that the entire network knows the transaction history. The verifier node 19 needs to keep a copy of the digital assets of its client node 17 and its status in addition to keeping a copy of all transactions of its client node 17. Because all confirmed transactions are broadcast to the entire network, any node 12 can keep a copy of the set 14 of digital transactions of the entire asynchronous directed acyclic transaction graph if they choose to do so.
[0030] Randomly selecting validators helps ensure that there are no pre-existing relationships between the parties to a transaction and their validators, thereby preventing collusion or other improper behavior by the validators to benefit the parties to a transaction. The distributed transaction network 10 uses a randomized global consensus protocol to achieve consensus among the validator nodes 19 so that a validator is randomly selected for each party to a transaction. In one embodiment, this consensus is achieved through a blockchain 30. In one embodiment, the random assignment process is performed by the node that creates the block, which uses the blockchain to assign validators to each node that joins the network. For example, now turn to Figure 1B , while continuing to refer to Figure 1A , when a new node 15 enters the network, the verifier node 19 randomly assigns the verifier 19 to the node via the blockchain mechanism 30.
[0031] In a preferred embodiment, only the verifier node 19 is required to store a portion of the transaction network 42 and a collection of digital transactions 14 that constitutes an asynchronous directed acyclic graph of transactions of other nodes, allowing transaction parties to participate in transactions without having to copy large amounts of data. In addition, each verifier node 19 only needs to store a complete copy and current state of all transactions of its client node 15, which is only a part of the collection 14 of digital transactions of the transaction graph, rather than a complete copy of the entire graph and all transaction networks 42. However, an insufficient number of participating verifier nodes 19 will result in too few potential verifiers, delaying transaction processing if the number of pending transactions exceeds the number of verifier nodes 19, and increasing the possibility that the verifier may be unqualified or involved in fraudulent activities. Therefore, the reliability, credibility, and processing power of the distributed transaction network depend on the participation of a large number of verifier nodes 19. Each verifier can pay a fee for each verified transaction as an incentive to participate. In order to ensure the correctness of the verification, each verifier also needs to submit collateral (stake). The collateral is usually represented by a certain amount of digital currency or other assets, which will be confiscated if the verifier incorrectly verifies the transaction. However, any validator that detects that another validator has incorrectly validated an invalid transaction may be entitled to collect the collateral that was forfeited by the failed validator.
[0032] Continue to refer Figure 1B , the blockchain 30 includes a plurality of sequentially linked blocks 38, each block containing assignments of verifiers to nodes and other distributed computing actions 39. A new block 38 can be created by a node 13 that creates a block using conventional block creation methods, which are obvious to a person of ordinary skill in the art of the present invention. However, unlike conventional blockchains, the distributed transaction network blockchain 30 does not store actual transaction data. The distributed transaction network blockchain is used to assign verifiers to new nodes that join the network, and to assign new verifiers to client nodes when it is determined that the previous verifier is unqualified. For example, determination is made by: verifying invalid transactions, allowing forks, or failing to verify valid transactions after a specified amount of time has passed. In a preferred embodiment, when a node 12 needs a new verifier (e.g., a new node that joins the distributed transaction network 10, or an existing node that needs to replace an unqualified verifier), the next node 13 that creates a block randomly selects one of the verifier nodes 19 to become the new verifier, and records the selection in the newly created block. And the distributed transaction network 10 implements the assignment of new verifiers to their respective client nodes according to the assignment selection stored in the new block 38.
[0033] Now go to Figure 1C , while continuing to refer to Figure 1A. Each transaction 40 is a mechanism for facilitating a change of control over a transferred asset, such as a digital currency or digital representation of a tangible good, between transaction parties 15. Each transaction party may be a transferor or a transferee, with the transferor transferring ownership or control of the transferred asset in its state and the transferee receiving ownership or control of the transferred asset from the transferor. For example, example transaction 40B has two associated transaction parties 15: "A transaction party" 16 and "B transaction party" 18. "A verifier" 20 is the verifier of "A transaction party" 16, and "B verifier" 22 is the verifier of "B transaction party" 18. "Verifier 19" is responsible for confirming whether example transaction 40B is valid or invalid. When the verifier determines that the transaction is valid, the verifier signs the transaction. Each transaction is considered a pending transaction until it is fully verified by all verifiers associated with the transaction parties, and all transaction parties and associated verifiers sign the transaction, at which point the transaction is designated as a confirmed transaction. Pending transactions are processed locally by the transaction parties and their respective verifiers. Confirmed transactions are broadcast to the entire network and added 40 to the set of digital transactions 14 of the asynchronous directed acyclic transaction graph, while invalid transactions are not signed and are discarded.
[0034] Now turn to the figure Figure 1D , while still referring to Figure 1A , each verifier node 19 is also assigned another verifier node as its verifier. For example, although "A verifier" 20 is the verifier of party A 16, it also has a verifier assigned to itself. For example, when "A verifier" participates as a transaction party, "A verifier" 20 can be called "X transaction party" and its verifier can be called "X verifier" 80. In addition, as mentioned above, the collection of all digital assets of each node (including cryptocurrencies) is controlled by its verifier. All of its digital assets constitute the state of the node. In this example, the digital assets of party A 16 are controlled by A verifier 20. Correspondingly, the digital assets of A verifier 20 ("X transaction party") are controlled by "X verifier" 80. Verifiers charge transaction fees for providing services when performing their designated functions. However, verifiers also stake some of their own digital assets. If a verifier fails to perform its duties and signs an invalid transaction, or causes a fork by signing multiple subsequent transactions for its transaction party after the same predecessor transaction, the collateral can be confiscated and allocated to other nodes on the network. This incentivizes validators to remain honest and perform their functions according to the rules set out in this article. If validators fail to do so, the distributed trading network can confiscate the digital assets in the form of collateral of the unqualified validator and reverse the invalid transactions.
[0035] Now go to Figure 3 , while continuing to refer to Figure 1A -C. A collection 14 of digital transactions of an asynchronous directed acyclic transaction graph includes a plurality of vertices 35 connected via a plurality of edges 32. Each vertex 35 represents a transaction 40 conducted between at least two transaction parties, while each edge 32 connects each transaction to another transaction having at least one common transaction party. The edges 32 are unidirectional so that the transactions are topologically ordered, wherein each edge is displayed as an arrow from one vertex to another vertex, the other vertex representing a predecessor transaction that occurred earlier in time.
[0036] Reference now Figure 2A , and continue to refer to Figure 3 , the example transaction 40B is linked to two predecessor transactions 41 by two edges 32, the two predecessor transactions including a first predecessor transaction 41A and a second predecessor transaction 41B, both of which occurred before the example transaction 40B, as shown by the arrows forming each edge 32. The example transaction 40B and the first predecessor transaction 41A have "Party A" as a common transaction party, while the example transaction 40B and the second predecessor transaction 41B have "Party B" as a common transaction party; all transactions involving any particular transaction party (e.g., "Transaction Party A") form a single transaction path (or "sequence"), which is connected from the most recent transaction of that transaction party to the earliest transaction. When a transaction is signed by each transaction party and its respective verifier, the new transaction is added to the set of digital transactions 14 of the asynchronous directed acyclic graph and is connected to the most recent transaction associated with each transaction party in the asynchronous directed acyclic graph. Transactions in a single transaction path form a topologically ordered sequence in which each transaction, except the earliest one, is connected to a single predecessor transaction, thus ensuring that transactions for each specific transacting party are processed in order to prevent race conditions, forks, or potential double spend attempts that could affect the assets of the transacting party that is the transferor. Figure 3 In the example, "Transaction Party A" is a transaction party of 5 transactions in the set 14 of digital transactions in the asynchronous directed acyclic graph, represented by vertices representing the topological ordering of the transactions, and the transactions are numbered 40B, 41A, 43, 44 and 45, and connected by transaction path edges 34A. These transactions together constitute the transaction path of "Transaction Party A". The example transaction 40B is a newly started transaction, and transaction 45 is the earliest transaction. Transactions 40B, 41B, 46 and 47 of transaction party B are connected into a single sequence connected by transaction path edges 34B. In addition, the transaction paths of different transaction parties can intersect at any vertex in the set 14 of digital transactions in the asynchronous directed acyclic graph (the vertex represents a transaction in which the transaction parties are co-participants). For example, the transaction path of "Transaction Party A" and the transaction path of "Transaction Party C" intersect at transactions numbered 43 and 45.
[0037] Furthermore, unlike traditional blockchain transactions, which are subject to the long delays required by the block creation process, where blockchain transactions must be selected for inclusion in a block to be considered confirmed, transactions of each trading party in the distributed trading network of the present invention can be executed asynchronously with transactions of other unrelated trading parties. For pending transactions, only the trading parties and their respective validators are involved. Once the pending transaction is signed by all of its trading parties and their validators, the execution of the transaction may occur immediately - without the need to delay the execution of confirmed transactions by waiting for block creation and global consensus as in traditional blockchains.
[0038] refer to Figure 2B , and continue to refer to Figure 2A , the topological ordering of the asynchronous directed acyclic graph and transaction paths is reflected in the transaction data itself. The transaction data of each transaction defines the predecessor transaction pointed to by the transaction, and may include pointers or hash values that identify the predecessor transactions of each transaction party involved in the current transaction. The detailed transaction data of each transaction can be stored in copies of other nodes of the collection 14 of digital transactions of the asynchronous distributed acyclic transaction graph, but must be stored in the transaction history saved by the verifier node of each client node (transaction party), or in its copy of the asynchronous distributed acyclic graph.
[0039] Continue to refer Figure 2B as well as Figure 2A , each transaction 40 has one or more transaction parameters 50. The transaction parameters 50 define the transaction parties involved in the transaction and include a timestamp 51 indicating the time when the transaction was initiated. The transaction parameters 50 also include transfer details 52, identifying the transferor and the transferee, and may also generally or specifically describe the transfer assets that each transferor needs to transfer to the transferee as part of the transaction obligations. The transaction parameters 50 may describe the type and amount of the transferred assets. For example, the transaction parameters 50 may specify that the transferred assets may be a certain amount of digital currency (including cryptocurrency), legal currency, a digital representation of a specific number of tangible goods, or other units that quantify the digital assets that constitute the transferred assets. In the example transaction 40B, the transfer details 52 indicate that "Party A" 16 and "Party B" 18 are both transferors and transferees. Therefore, "A Verifier" 20 must verify that Party A can perform the transfer from "Party A" to "Party B", and "B Verifier" 22 must verify that Party B can perform the transfer from "Party B" to "Party A".
[0040] refer to Figure 1A -D. Figure 2A -B while turning Figure 2C. Each transaction defines a transferred asset and the amount or balance of said asset to be transferred in the transaction. All transfers of the transaction parties in the transaction are implemented through state transitions, which change the states of the transferor and the transferee, resulting in changes in the amount of the transferred asset owned by the transaction party as a result of the transaction. The execution of the state transition is controlled by the verifier of the transaction party. Each verifier must verify the amount of the digital asset of its transaction party to ensure that the transaction party, when acting as the transferor, has sufficient digital assets to transfer and satisfy the transaction obligations of the transaction party, and further provide each verifier with the ability to agree or refuse the state transfer that transfers control of the transferred asset from the transferor to the transferee. For example, "A Verifier" 20 and "B Verifier" 22 control the states of "Party A" 16 and "Party B" 18, respectively. "A Verifier" verifies that the digital asset of "Party A", represented by the state 54A of Party A, contains a sufficient amount of digital currency 55A corresponding to the transferred asset that "Party A" is obliged to transfer, and can agree or refuse the state transition of transferring digital currency 55A to the state 54B of "Party B". Similarly, the "B Verifier" 22 verifies that the state 54B of "Party B" contains a sufficient amount of digital assets 55B that "Party B" is obliged to transfer, and can agree or reject the state transition. In addition, in order to allow the state transition to be revoked, the verifier of each trading party must save the transaction history of its trading party, which details each state transition of each trading party executed. In order to revoke the transaction, the state and digital assets of the transferor and transferee can be restored to the initial state before the transaction was executed. It should be noted that the state of each trading party is not stored in any centralized data storage, but only exists locally, stored in the digital storage of the trading party itself and its verifier. Of course, if other nodes obtain all transactions through broadcasting, they can also save a copy of the state of any trading party 17, and if another node becomes the verifier of any trading party 17, the node can seamlessly take over control of the state of the trading party 17.
[0041] The distributed transaction network may have its own unique cryptocurrency, as well as an asynchronous directed acyclic graph that serves as a distributed ledger. For example, this unique cryptocurrency may be used to pay validators for processing and verifying transactions. In addition to the unique cryptocurrency, the distributed transaction network is also adapted to access third-party payment processors or payment solutions as needed to enable the transfer of digital or legal currency and other assets as needed. It is apparent to one of ordinary skill in the art that the distributed transaction network may generate appropriate states and state transitions to facilitate the transfer of various types of assets between transaction parties.
[0042] return Figure 2B , while continuing to refer to Figure 1A and Figure 2C. Once each transaction party and verifier signs the transaction 40 using a digital signature unique to the transaction party and the verifier, the status of the transaction 40 changes from a pending transaction to a confirmed transaction. In a preferred embodiment, each transaction party and each verifier has a pair of public-private keys, where the private key is used to sign the transaction and the public key is used by other nodes to verify the validity of the signature. Each transaction party signs the transaction (16S, 18S) to authenticate the transaction and indicate that the transaction parties have a consistent understanding of the transaction obligations. Each verifier signs the transaction 20S, 22S when verifying the status of the transaction party and agreeing to the state transition. No agreed state transition that will result in a change in control of the digital asset will be executed until the transaction is designated as a confirmed transaction by the signatures of all relevant verifiers. Once the transaction is confirmed, the confirmed transaction is broadcast to all nodes 12 of the transaction network 10, and the transaction network allows the state transition to be executed.
[0043] Go to Figure 4 And also refer to Figure 1A and Figure 2A-2B The transaction network 10 is adapted to prevent forks (or double spends) from occurring for any given transaction party within the set 14 of digital transactions in the asynchronous directed acyclic graph. Each branch in the set 14 of digital transactions in the asynchronous directed acyclic graph corresponds to a situation where two or more subsequent transactions occur in a transaction, where a transaction party is a transferor to a single predecessor transaction. A transaction party may fork by initiating a new transaction when the transaction party is already involved in another pending transaction, or by initiating two or more transactions simultaneously. Figure 4 Describes something like Figure 2A, a portion of the set 14 of digital transactions of the asynchronous directed acyclic graph shown in , generates the addition of a fork 32F by adding a second example transaction 40F pointing to the first transaction 41A. The example transaction 40B and the second example transaction 40F are both pending transactions connected to the first transaction 41A, and the timestamp 51 of the example transaction 40B is 12:00, while the timestamp 51 of the second example transaction 40F is 12:01, which indicates that the second example transaction 40F was initiated by "Party A" while the example transaction 40B was still pending. However, because Party A cannot implement any transaction unless the verifier of Party A signs, the second transaction will not be confirmed. If the verifier is required to verify more than one transaction for the client transaction party, he will only agree to one of the transactions and sign it, thereby preventing a fork condition. In the current example, the verifier A20 of transaction party A determines the previous transaction 41A of the second example transaction 40F, which is pointed to by two subsequent transactions, where "transaction party A" is the transferor of the example transaction 40B and the second example transaction 40F. Therefore, "the verifier of transaction party A" will not sign the second example transaction 40F. The second example transaction is discarded and will not be broadcasted to the network as a confirmed transaction, nor will it become part of the set 14 of digital transactions of the asynchronous directed acyclic graph.
[0044] Now turn to Figure 5 , while referring to Figure 1A and Figure 2B , the example transaction method 500 shows a series of steps from initiating to completing the transaction example 40B of the distributed transaction network 10. Return to reference Figure 2A -C depicts the example transaction 40B, while continuing to refer to Figure 1A and Figure 3 , when the transaction parties "Party A" 16 and "Party B" 18 initiate the example transaction 40B, the transaction method 500 begins at step 502. Here, the transaction parties define the transaction parameters 50. For example, the transaction parameters 50 may specify that "Party A" transfers ten units of digital currency A to "Party B", and "Party B" transfers five units of digital currency B to "Party A". Then, in step 504, the transaction parties sign the example transaction 40B. Here, each transaction party authenticates the transaction by digitally signing the transaction, indicating that each transaction party agrees with the transaction and the transaction parameters are correct. Then, the method proceeds to step 506, and the example transaction 40B is sent to the verifier node 19 of each transaction party on the distributed transaction network 10 as a pending transaction.
[0045] refer to Figure 1A and Figure 2A , while continuing to refer to Figure 5, only the verifier assigned to each transaction party is required to verify the transaction, allowing each transaction to be processed in an asynchronous manner. The method proceeds to step 508, and each verifier must ensure that the example transaction 40B does not generate a fork for its associated transaction party in the set 14 of digital transactions of the asynchronous directed acyclic graph. "A verifier" 20 and "B verifier" 22 must ensure that the predecessor transactions of the example transaction 40B are each connected to only a single subsequent transaction in which its assigned transaction party participates. "A verifier" 20 checks the set 14 of digital transactions of the asynchronous directed acyclic transaction graph and verifies that only one subsequent transaction points to the previous transaction 41A, while "B verifier" 22 performs the same operation on the second predecessor transaction 41B. It should be noted here that for the purpose of verifying pending transactions, each verifier only locally handles pending transactions. In this current example, if there is no fork condition, the method proceeds to step 510, and each verifier verifies the status of its assigned transaction party. Here, each verifier verifies that its counterparty can enter the transaction correctly by ensuring that the existing state of the counterparty contains enough digital assets to provide the transferred assets (if the counterparty acts as the transferor). Once each verifier determines that the transaction of its counterparty is valid, the verifier signs the transaction in step 512, and once the transaction is signed by all relevant verifiers, the transaction is confirmed. Here, the verifier and the counterparty can update their local copies of the asynchronous directed acyclic graph, and add transaction 40B to the set 14 of digital transactions of the asynchronous directed acyclic graph, and connect it to the nearest predecessor transaction with the common counterparty of the example transaction 40B with an edge 32. Then, in step 514, all the counterparties and their verifiers broadcast the confirmed transaction and the signatures from all the counterparties and their verifiers to the entire network. In step 516, all other nodes on the network that save the set 14 of digital transactions of the asynchronous directed acyclic graph continue to add the confirmed transaction to their copies of the asynchronous directed acyclic graph, whereby the asynchronous directed acyclic graph is updated with new valid transactions throughout the network. Accordingly, given the existing state of its counterparties, if any validator determines at steps 508 or 510, respectively, that the transaction forks, or that the transaction is invalid, the method proceeds to step 518, where the validator does not sign the transaction, and then discards the invalid transaction at step 520.
[0046] Return now Figure 1A and Figure 2A -C, while continuing to refer Figure 5, additional details about the implementation of steps 510 and 512 are now provided. In a preferred embodiment, each verifier may first verify in step 508 that the transaction does not generate a fork for its counterparty, and then determine in step 510 whether the state is valid and whether the digital asset is available and ready to be transferred to the transferee through a state transition. However, please note that this order is not limited, and in other embodiments, the verifier may first determine the validity of its counterparty state before checking the occurrence of a fork condition. Example transaction 40B includes two transfers 52, "Party A" 16 and "Party B" 18 are both transferors and transferees. The state 58A of "Party A" indicates that the digital assets 54A of "Party A" include a certain amount of digital assets 55A, which are currently controlled by "Party A", and the ownership of the digital assets 55A will be transferred to "Party B". As the designated verifier of "Party A" 16, "A Verifier" 20 agrees to inspect "Party A's" digital asset 55A and verify that the digital asset 55A contains at least 10 units of digital currency "A", matching the amount and type specified in the transaction parameters 50, and that the ownership of "Party A's" digital asset 55A is transferable to "Party B". Similarly, "B Verifier" 22 is able to verify that "Party B's" digital asset 55B contains 5 units of digital currency "B", as specified in the transaction parameters 50. After verifying the status of its assigned transaction party, each verifier signs the transaction at step 512, agreeing to the state transition, transferring control of the transferred assets from the transferor to the transferee. However, the agreed state transition is not performed until after the transaction is confirmed. Once all transaction parties and their respective verifiers have signed the transaction, the status of the transaction is switched from pending to confirmed, and the confirmed transaction is broadcast to the distributed transaction network 10 at step 514. The state transition of the confirmed transaction is then performed, and all validator nodes 19 can update the set of digital transactions 14 of the asynchronous directed acyclic graph to indicate that the transaction is completed in step 516. Therefore, the transaction that has performed the state transition is designated as a completed transaction.
[0047] Returning to step 513, if the verifier does not respond and does not verify the status of its counterparty after a certain period of time, the counterparty associated with the verifier may report that the verifier is unresponsive, and in step 515, the distributed transaction network 10 may use the global consensus mechanism to replace the unresponsive verifier through global consensus among the verifier nodes of the network, and randomly assign a new verifier to the counterparty. Then, the method returns to step 508, and the newly assigned verifier continues to check the fork status and verify the transaction.
[0048] Now turn to Figure 6 , shows an exemplary post-validation monitoring and correction method 600 for detecting unqualified validators, revoking invalid transactions, and reassigning validators. Figure 6 , and also refer to Figure 5 The trading method 500 depicted in Figure 1A and Figure 2A -C. Any node 12 on the distributed transaction network 10 (which holds a more comprehensive copy of the set 14 of digital transactions of the asynchronous distributed acyclic transaction graph) can perform post-confirmation monitoring and verify the validity of any confirmed transaction that has been broadcast to the network. Each such node (which may also be referred to as a monitoring node) can monitor any confirmed transaction to determine whether any verifier associated with the confirmed transaction has incorrectly signed the confirmed transaction, for example: signing the transaction when the transaction of its assigned transaction party is invalid (because its state does not contain enough digital assets to transfer), or signing the transaction even if it produces a fork condition. In order to determine the validity of the transaction, the monitoring node can ensure that the transferor has enough digital assets to fulfill its obligations defined by the transaction parameters. In addition, the node must also ensure that the confirmed transaction has not produced a fork condition by looking at the asynchronous directed acyclic transaction graph to check whether any predecessor transaction of the confirmed transaction has more than one successor transaction of the same transaction party pointing to it. If a monitoring node determines that any confirmed transaction is invalid and was incorrectly signed, it can broadcast a dissent to the distributed transaction network that identifies the validator that incorrectly signed the transaction and the reason why the transaction is invalid (e.g., there is a fork condition and / or invalid transaction). Similarly, any transaction node that determines that its assigned validator is unresponsive can also broadcast an unresponsive validator dissent.
[0049] Whenever one of the nodes determines that one of the confirmed transactions has been incorrectly signed, the post-confirmation monitoring and correction process 600 can be initiated at step 604, and then, at step 606, the monitoring node broadcasts the invalid transaction or fork objection to the distributed transaction network 10. In addition, any transaction party can raise an unresponsive validator objection to its own unresponsive validator at step 602, and then broadcast the unresponsive validator objection to the network at step 606. In each case, the objection is broadcast to the entire network 606, and if the objection is correct, the global consensus mechanism 30 can adopt a global consensus protocol in step 608 to replace the unresponsive or unqualified validator, confiscate and redistribute the collateral of the validator, and revoke the invalid transaction signed by the validator in the case of violation. The consensus can be achieved using the blockchain 30, and then the node 13 that created the block thereby revokes the invalid transaction or fork transaction, or replaces the violating validator with a new validator randomly selected and recorded in a newly created block 38 on the blockchain 30. In a preferred embodiment, the node 13 that created the block receives the objection broadcast to the network in step 606 and immediately starts creating a new block 38 of the distributed transaction network blockchain 30. Return to reference Figure 1B , while continuing to refer to Figure 6 , the next node 13 to create a block can broadcast the objection and put the appropriate corrective action in the new block. The corrective action may include removing each unresponsive or unqualified validator and assigning a new validator to replace the removed validator, reversing invalid transactions or forked transactions, and confiscating the collateral of the unqualified validator. The next node 13 to create a block creates a new block and adds it to the blockchain 30, and the corrective action stored in the new block 38 is executed by the distributed transaction network. The distributed transaction network is allowed to continuously execute appropriate corrective actions in response to objections broadcast to the network.
[0050] Once an invalid or forked transaction 40 is revoked, it is removed from the set 14 of digital transactions in the asynchronous directed acyclic graph. The collateral of the unqualified validator is confiscated and redistributed to other nodes on the network in any agreed-upon protocol. For example, the node that first broadcasts the objection that leads to the removal of the unqualified validator can earn a reward by receiving the collateral of the unqualified validator, thereby providing an incentive for the node to perform post-confirmation monitoring. The payment of fees and rewards, and the redistribution of collateral can be executed and processed as a new transaction on the distributed transaction network, which is initiated by the monitoring node and / or the node that created the block, rather than by the transaction party. The redistribution of collateral may involve the unqualified validator and the node that broadcasts the objection as a transaction party, acting as the transferor and transferee, respectively.
[0051] It should be understood by those skilled in the art that various protocols can be used to allow all nodes on the entire distributed network to jointly reach a single conclusion. In other alternative embodiments, the present invention also allows all validator nodes 19 to reach a global consensus without using a blockchain, and the validator nodes can use a consensus protocol suitable for a distributed computing system to assign validators and initiate corrective actions.
[0052] In summary, the distributed transaction network reduces processing time by allowing transactions to be created and signed only between transaction parties and their validators, allowing the transactions to occur locally and asynchronously with the rest of the network, thus avoiding the global synchronization mechanism of traditional blockchains. The blockchain global consensus process does not need to be used for transaction verification, nor does it need to write confirmed transactions to the blockchain. Instead, transactions are stored in a collection of digital transactions in an asynchronous directed acyclic graph 14 and broadcast to the entire network. This allows transactions to be implemented locally, asynchronously and in parallel by only a few parties, resulting in fast execution. At the same time, the fidelity of the transaction network is not only retained by the digital signatures of all transaction parties and their validators, but also requires a validator to be randomly assigned to each transaction party, and ensures that the validator verifies each transaction of its transaction party and prevents forks or double spending. Validators are prevented from improperly verifying transactions by requiring them to provide their own digital assets as collateral, which may be confiscated when they violate regulations to verify invalid transactions. After the collateral is confiscated, it will be redistributed to other nodes through a global consensus mechanism (which may be implemented using a blockchain).
[0053] It will be appreciated by those skilled in the art that aspects of the present invention may be embodied as systems, methods or computer program products. Therefore, aspects of the present invention may take the form of complete hardware embodiments, complete software embodiments (including firmware, resident software, microcode, etc.) or embodiments of combined software and hardware aspects, which may generally be referred to as circuits, modules or systems. In addition, aspects of the present invention may take the form of a computer program product embodied in one or more computer-readable media having a computer-readable program code contained thereon.
[0054] Any combination of one or more computer-readable media may be utilized. A computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium (including but not limited to a non-transitory computer-readable storage medium). A computer-readable storage medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared or semiconductor system, device or equipment, or any suitable combination of the foregoing. More specific examples (non-exhaustive list) of computer-readable storage media will include the following: an electrical connection with one or more wires, a portable computer disk, 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 portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be any tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device or equipment.
[0055] A computer readable signal medium may include a propagated data signal containing a computer readable program code, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including but not limited to electromagnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0056] Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
[0057] The computer program code for performing the operations of various aspects of the present invention may be written in any combination of one or more programming languages, including asynchronous or concurrent programming languages such as go or Javascript, functional programming languages such as Haskell, object-oriented programming languages such as Java, Smalltalk, C++, etc., and traditional procedural programming languages such as the "C" programming language or similar programming languages. Other types of languages include XML, XBRL, HTML5, Python, or Web assemblies. The program code may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer, partially on a remote computer, or entirely on a remote computer or server. In the latter case, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0058] Various aspects of the present invention are described below with reference to the flowcharts and / or block diagrams of the methods, devices (systems) and computer program products according to embodiments of the present invention. Each block of the flowchart illustration and / or block diagram and the combination of blocks in the flowchart illustration and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer or other programmable data processing device to produce a machine, so that the instructions are executed by the processor of the computer or other programmable data processing device, creating a device for implementing the functions / actions specified in the flowchart and / or one or more block diagram blocks.
[0059] These computer program instructions may also be stored in a computer-readable medium that can direct a computer, other programmable data processing apparatus, or other device to function in a specific manner so that the instructions stored in the computer-readable medium produce an article of manufacture including instructions for implementing the functions / actions specified in the flowchart and / or one or more block diagram blocks.
[0060] The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus or other device to cause a series of operating steps to be performed on the computer, other programmable apparatus or other device to produce a computer-implemented process. The instructions executed on the computer or other programmable apparatus provide a process for implementing the functions / actions specified in the flowchart and / or one or more block diagram blocks.
[0061] The flowcharts and block diagrams in the block diagrams show the architecture, functions and operations of possible implementations of the systems, methods and computer program products according to various embodiments of the present invention. Here, each block in the flowchart or block diagram may represent a module, fragment or portion of a code, which includes one or more executable instructions for implementing one or more specified logical functions. It should also be noted that in other alternative embodiments, the functions mentioned in the blocks may not occur in the order shown in the figure. For example, two blocks shown in succession can actually be executed substantially simultaneously, or the blocks can sometimes be executed in reverse order, depending on the functions involved. Each block illustrated in the block diagram and / or flowchart and the combination of blocks in the block diagram and / or flowchart can be implemented by a dedicated hardware-based system or a combination of dedicated hardware and computer instructions that performs a specific function or action.
[0062] The corresponding structures, materials, actions and other equivalents of all means or steps and functional elements in the following claims are intended to include any structure, material or action for performing the function in combination with other claimed elements specifically claimed. The description of the present invention has been given for the purpose of illustration and description, but is not intended to be exhaustive or to limit the invention to the disclosed form. Many modifications and variations thereof will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the present invention. The embodiments are selected and described in order to best explain the principles and practical application of the present invention and to enable others skilled in the art to understand the various embodiments of the present invention with various modifications suitable for the intended specific use.
[0063] The flow chart depicted herein is only an example. Without departing from the spirit of the present invention, many changes may be made to the figure or the steps (or operations) described therein. For example, the steps may be performed in a different order and / or steps may be added, deleted and / or modified. All of these changes are considered to be part of the claimed invention.
[0064] In summary, this paper proposes a distributed trading network based on an asynchronous directed acyclic graph. The invention is illustrated by the examples in the block diagram and the entire written description. It should be understood that many variations are possible while adhering to the concept of the invention. These variations are also part of the invention.
Claims
1. A method for asynchronously facilitating, verifying and executing a transaction, comprising the following steps: Providing a distributed transaction network, the distributed transaction network having a plurality of nodes operably connected via a network, each of the nodes having a state consisting of digital assets, the plurality of nodes further comprising a plurality of validator nodes, the plurality of validator nodes being adapted to verify all transactions on the distributed transaction network to ensure the accuracy of the transactions, and to maintain the network and further perform distributed computing operations, using a global consensus mechanism to correct the failure of a validator under certain conditions; A transaction verification system for maintaining the validity of all transactions is provided, wherein the transaction verification system includes storing an asynchronous directed acyclic transaction graph containing multiple vertices through a distributed data storage device; wherein each vertex represents a transaction in which multiple transaction parties participate, each transaction party corresponds to one of the multiple nodes, and the transaction parties also include at least one transferor and one transferee, and each vertex representing a subsequent transaction must point to at least one other vertex through a unidirectional edge, wherein each vertex pointed to by a subsequent transaction represents a predecessor transaction that occurred before the subsequent transaction, and wherein one of the transaction parties of each predecessor transaction matches a unique transaction party of the subsequent transaction; By using a global consensus mechanism, a validator is assigned to each new node when it joins the distributed transaction network by randomly selecting one of a plurality of validator nodes to become the validator of the new node when the new node first joins the network, and after the assignment, the state of the new node is controlled by its validator; Each node participates in multiple transactions, and each transaction must be verified and confirmed by the validator node of the transaction node; The transacting parties initiate a new pending transaction, send the transaction parameters to their respective validators, and sign the transaction; defining transaction parameters of the pending transaction, including a transaction obligation of each transferor, the transaction obligation determining and quantifying the amount of the pending asset to be transferred by the transferor to the transferee; Defines the state transition of a transaction when the transferor transfers the transferred assets from the transferor to the transferee, as well as the resulting changes in the digital asset balances of both the transferor and the transferee, and the changes in the states of both the transferor and the transferee; A transaction can only be confirmed and executed if the validators of each transferor and transferee of the pending transaction agree and sign the transaction; The validator of each transaction party verifies the pending transaction, and each validator verifies whether the balance of the transferred asset in the state of its transaction party is sufficient to satisfy the party’s obligations in the pending transaction; Verify that each transacting party has only one subsequent transaction after its predecessor, ensuring that there are no forks or race conditions for that party, thus preventing double spending of its assets; When the validator determines that the status of its counterparty does not satisfy the transaction obligations or the counterparty has more than one subsequent transaction, the validator of one of the counterparties designates the pending transaction as an invalid transaction and discards the invalid pending transaction; Only when the validators of each transaction party validate the pending transaction and the validators of the transaction party agree with the state transition of each transaction party, the pending transaction is designated as a confirmed transaction; Complete the confirmed transaction by asynchronously confirming the agreed state transition of each transferor, resulting in the transfer of control of the transferred asset to the transferee; broadcasting the confirmed transaction to the distributed transaction network; and The asynchronous directed acyclic graph is updated by the multiple nodes, and a new vertex representing the confirmed transaction is added to the asynchronous directed acyclic graph, so that the confirmed transaction points to each predecessor transaction of its transaction party.
2. The method of claim 1, wherein the step of initiating a new pending transaction further comprises locally proposing the pending transaction by listing transaction parameters by the transaction parties and each transaction party signing the transaction and sending the pending transaction to a verifier of each transaction party.
3. In the method of claim 2, the step of initiating a pending transaction is followed by the following step: each transaction party authenticates the pending transaction by digitally signing the transaction and sending it to the transaction party's verifier, indicating that the transaction party agrees to the pending transaction.
4. The method of claim 3, wherein: The step of each party's validator verifying the pending transaction also includes each validator verifying that the state of the validator's party is sufficient to satisfy the transaction obligations and that there is no fork condition: that is, except for the pending transaction, no subsequent transaction of the party points to the previous transaction of the validator of the party; and The step of designating the pending transaction as invalid also includes: when the validator determines that the status of its transaction party does not meet the transaction obligations or determines that a fork situation exists, the validator of one of the transaction parties designates the pending transaction as invalid.
5. The method of claim 4, wherein: The step of verifying the pending transaction also includes each validator digitally signing the pending transaction upon verifying that the state of its counterparty is sufficient to satisfy the transaction obligations and that there is no fork condition.
6. The method of claim 5, wherein: The step of designating the pending transaction as a confirmed transaction also includes designating the pending transaction as a confirmed transaction only after each verifier verifies that the pending transaction is valid and digitally signs it, and the verifiers who agree to the transaction parties perform a state transition on each transaction party, wherein the asset transfer specified in the transaction causes the digital assets of each transaction party to change according to the transaction.
7. The method of claim 6, wherein: The step of broadcasting the confirmed transaction to the distributed transaction network also includes broadcasting the confirmed transaction together with the digital signature of each transaction party and the verifier of each transaction party to the distributed transaction network.
8. The method of claim 7, wherein: The step of updating the asynchronous directed acyclic graph also includes adding the newly confirmed transaction to the asynchronous directed acyclic graph as a new vertex, whose transaction parameters point to all predecessor transactions of the transaction; and after other nodes receive the broadcasted confirmed transaction and all signatures of the transaction parties and verifiers, they selectively add the transaction to their own retained copies of the asynchronous directed acyclic graph.
9. A method as claimed in claim 8, wherein the step of verifying and confirming the transaction is also accompanied by each validator in the transaction collecting a transaction fee from its counterparty and simultaneously pledging a portion of its digital assets as collateral.
10. The method of claim 9, wherein the step of updating the asynchronous distributed acyclic transaction network is followed by the following steps: The confirmed transaction is monitored by at least one of a plurality of nodes, referred to as a monitoring node, which performs a post-confirmation monitoring function by verifying the validity of the confirmed transaction, wherein the validity of the confirmed transaction is verified by ensuring that the transaction parties have sufficient digital assets to fulfill their transfer obligations in the confirmed transaction and that there is no fork condition; When the node performing the post-confirmation monitoring function determines that the transferor is in a state where there are not enough digital assets to fulfill the obligation to transfer to the transferee in the transaction, or there is a fork condition, and the monitoring node broadcasts an invalid transaction objection to all nodes of the distributed transaction network and identifies the invalid transaction and each validator who incorrectly signed the invalid transaction for its client transaction party, the confirmed transaction is designated as an invalid transaction.
11. The method of claim 10, wherein: The steps to designate a confirmed transaction as invalid are followed by: Using the global consensus mechanism to perform revocation of invalid transactions of multiple nodes, and revoking each transaction state transition of the invalid transaction; and The invalid transaction is discarded from the asynchronous distributed directed acyclic graph.
12. A method as claimed in claim 11, wherein the step of executing the revocation of the invalid transaction is followed by the following steps: designating the verifier who incorrectly signed the invalid transaction as an unqualified verifier, multiple nodes using the global consensus mechanism to remove the unqualified verifier as the verifier of their transaction party, and using the global consensus mechanism, randomly selecting one of the multiple verifier nodes to become the new verifier of the node of the transaction party.
13. The method of claim 12, wherein the step of assigning a new validator to each node through a global consensus mechanism further comprises: The step of designating a validator who incorrectly signs an invalid transaction as an unqualified validator, and also includes the step of confiscating the collateral of the unqualified validator and reallocating the collateral by the validator nodes using the global consensus mechanism.
14. The method of claim 13, wherein: The step of designating each validator that incorrectly signed the invalid transaction as an ineligible validator also includes: redistributing the collateral as a reward to the monitoring nodes that broadcast the invalid transaction objection and the nodes that contributed to the global consensus mechanism.
15. The method of claim 14, wherein: The contributing nodes are nodes that create blocks in the blockchain.
16. The method of claim 14, wherein the step of designating the confirmed transaction as an invalid transaction is followed by the step of: broadcasting a non-responsive verifier objection to the distributed transaction network after one of the transaction parties determines that its verifier has not responded after expiration of a specified time period; The step of designating a validator as an unresponsive validator is followed by the step of removing the unresponsive validator as a validator of its transaction party through a global consensus mechanism, and randomly selecting one of a plurality of validator nodes to become a new validator of the node of the transaction party by using the global consensus mechanism.
17. The method of claim 16, wherein: The step of assigning a validator to each node by multiple nodes also includes: when each node just joins the distributed transaction network, assigning a validator to each node through the global consensus mechanism.
18. The method of claim 17, wherein: The global consensus mechanism allows nodes to reach a consensus and perform the operations of any of the steps taken in claims 11-17; and Prior to the step of executing the revocation of the invalid transaction, multiple monitoring nodes receive invalid transaction objections or unresponsive verifier objections from broadcast objections, and one of the nodes creates a new block, wherein the new block contains multiple corrective actions suitable for responding to the invalid transaction objections or unresponsive verifier objections, consisting of distributed computing operations of revoking invalid transactions, removing and replacing unresponsive verifiers or verifiers that improperly signed invalid transactions, and confiscating and redistributing the collateral of verifiers that improperly signed invalid transactions.
19. The method of claim 18, wherein the distributed transaction network also has its own unique cryptocurrency, wherein the digital assets of each node contain other types of digital assets and a certain amount of the cryptocurrency.
20. The method of claim 19, wherein: The step of designating each validator that incorrectly signs an invalid transaction as an unqualified validator also includes: using the global consensus mechanism to initiate a new transaction, the transferor in the new transaction is an unqualified validator, and the transferee is the node that broadcasts the invalid transaction and other nodes that help maintain the global consensus mechanism.
21. A computer readable medium storing instructions which, when executed, cause a system to perform the operations of the method according to any one of claims 1 to 20.
