METHOD, APPARATUS, AND COMPUTER-READABLE MEDIUM FOR TRANSACTION MANAGEMENT SPANNING MULTIPLE HETEROGENEOUS COMPUTING NETWORKS
A method and apparatus for providing communications between dissimilar computing networks, such as distributed ledger networks. A ledger-agnostic overlay network and computing architecture spans a range of digital communication networks including transaction only DLT networks like Bitcoin's DLT, smart contract based DLT like Ethereum, and also traditional centralized systems. Implementations communicate transaction information across heterogeneous jurisdictional boundaries, payment networks, banking systems, public and private distributed ledgers, internal corporate accounting systems, and exchanges.
1 . A method for interfacing heterogenous computing networks to accomplish a cross-network transaction in a system consisting of multiple networks, the method comprising:
receiving information proposing a transaction that spans at least two networks and has a source node and a destination node;
traversing a graph structure, the graph structure including transaction nodes within transfer networks and bridges that span networks and being created by a multi-agent system that crawls the networks to identify a path between the source node and the destination nodes using nodes and bridges, wherein, each nodes in the graph structure exists on a network and each have an associated set of attribute variables, the attribute variables specifying supported tokens , and a bridge defined by two nodes spanning two logical networks, the bridge having attribute variables representing transmission characteristics;
generating transaction routing information specifying a set of sub-transactions for executing the transaction based on the graph structure, the information including the anticipated cost and time of the transaction if the route is used; and
controlling execution of the set of sub-transactions using a manager that executes and controls the sequencing of execution of the sub-transactions across heterogeneous networks, ensures and records successful execution of the full chain, and executes rollback if the transaction fails.
2 . The method of claim 1 , wherein the generating includes determining transfer paths based on the transaction routing information, the transfer paths including the set of sub-transactions, the determining including inspecting a catalog of transfer messaging terms and a translation schema to convert heterogeneous ontologies of DLT networks in the optimized transfer path to a syntax-independent model and modeling the sub-transactions according to the syntax-independent model and applying interfaces between the DLT networks in the optimized transfer paths.
3 . The method of claim 1 , wherein pairs of nodes in the graph structure and the corresponding sets of attribute variables define a bridge data structure providing linkage between the nodes in the pairs of nodes.
4 . The method of claim 3 , wherein at least some of the pairs of nodes correspond to accounts in different networks.
5 . The method of claim 3 , wherein the bridge data structure specifies, at least one source network wallet, at least one destination network wallet, and transaction pricing models for value flowing between nodes in the pair of nodes.
6 . The method of claim 3 , wherein the bridge data structure specifies transformation logic to be attached to the logical interfaces.
7 . The method of claim 1 , wherein the generating comprises traversing the graph structure in accordance with a node traversing algorithm and parsing the attribute variables to identify acceptable routes.
8 . The method of claim 1 , wherein each node is wrapped with a common transaction interface that translates syntax independent instructions to the specific network syntax to enable transaction execution on dissimilar networks.
9 . The method of claim 1 , further comprising publishing the transaction and the linkage to each sub-transaction to an independent ledger.
10 . The method of claim 9 , wherein the published transaction uses a Zero Knowledge Proof to provide immutability while maintaining transaction privacy.
11 . A computer architecture for interfacing heterogenous computing networks to accomplish a cross-network transaction in a system consisting of multiple networks, the architecture comprising:
at least one computer processor; and
at least one memory storing computer readable instructions which, when executed by the at least one computer processor, cause the at least one computer processor to:
receive information proposing a transaction that spans at least two networks and has a source node and a destination node;
traverse a graph structure, the graph structure including transaction nodes within transfer networks and bridges that span networks and being created by a multi-agent system that crawls the networks to identify a path between the source node and the destination nodes using nodes and bridges, wherein, each nodes in the graph structure exists on a network and each have an associated set of attribute variables, the attribute variables specifying supported tokens , and a bridge defined by two nodes spanning two logical networks, the bridge having attribute variables representing transmission characteristics;
generate transaction routing information specifying a set of sub-transactions for executing the transaction based on the graph structure, the information including the anticipated cost and time of the transaction if the route is used; and
control execution of the set of sub-transactions using a manager that executes and controls the sequencing of execution of the sub-transactions across heterogeneous networks, ensures and records successful execution of the full chain, and executes rollback if the transaction fails.
12 . The architecture of claim 11 , wherein the generating includes determining transfer paths based on the transaction routing information, the transfer paths including the set of sub-transactions, the determining including inspecting a catalog of transfer messaging terms and a translation schema to convert heterogeneous ontologies of DLT
20 . The method of claim 19 , wherein the published transaction uses a Zero Knowledge Proof to provide immutability while maintaining transaction privacy. networks in the optimized transfer path to a syntax-independent model and modeling the sub-transactions according to the syntax-independent model and applying interfaces between the DLT networks in the optimized transfer paths.
13 . The architecture of claim 11 , wherein pairs of nodes in the graph structure and the corresponding sets of attribute variables define a bridge data structure providing linkage between the nodes in the pairs of nodes.
14 . The architecture of claim 13 , wherein at least some of the pairs of nodes correspond to accounts in different networks.
15 . The architecture of claim 13 , wherein the bridge data structure specifies, at least one source network wallet, at least one destination network wallet, and transaction pricing models for value flowing between nodes in the pair of nodes.
16 . The architecture of claim 13 , wherein the bridge data structure specifies transformation logic to be attached to the logical interfaces.
17 . The architecture of claim 11 , wherein the generating comprises traversing the graph structure in accordance with a node traversing algorithm and parsing the attribute variables to identify acceptable routes.
18 . The architecture of claim 11 , wherein each node is wrapped with a common transaction interface that translates syntax independent instructions to the specific network syntax to enable transaction execution on dissimilar networks.
19 . The architecture of claim 11 , wherein the instructions, when executed by the at least one processor, further cause the at least one processor comprising publish the transaction and the linkage to each sub-transaction to an independent ledger.