Abstract: Systems and techniques are provided for obscured routing. A computing device may send stacks of identifiers to neighbor computing devices in a network. Each stack of identifiers may include a unique identifier for the neighbor computing device to which it is sent. The computing device may send a notification identifying a destination computing device to the neighbor computing devices. The computing device may receive stacks of identifiers from the neighbor computing devices. The received stacks of identifiers may include completed routes to the destination computing device. Each completed route may be specified by unique identifiers added to the stack of identifiers by computing devices in the network. A unique identifier in each stack of identifiers may not be resolvable to an address by the computing device. The computing device may send a message a neighbor computing device based on a unique identifier in a chosen stack of identifiers.

Abstract: A computing system can establish asynchronous network communications with exchanges to facilitate cross-medium transactions between originating and recipient clients. Such communications can result in filtering out errant responses that would otherwise cause an open transaction to fail.

Abstract: Systems and techniques are provided for obscured routing. A computing device may send stacks of identifiers to neighbor computing devices in a network. Each stack of identifiers may include a unique identifier for the neighbor computing device to which it is sent. The computing device may send a notification identifying a destination computing device to the neighbor computing devices. The computing device may receive stacks of identifiers from the neighbor computing devices. The received stacks of identifiers may include completed routes to the destination computing device. Each completed route may be specified by unique identifiers added to the stack of identifiers by computing devices in the network. A unique identifier in each stack of identifiers may not be resolvable to an address by the computing device. The computing device may send a message a neighbor computing device based on a unique identifier in a chosen stack of identifiers.

Abstract: Systems and techniques are provided for Byzantine agreement in open networks. An indication to change a validation network for an open network from a current validation network to a next validation network may be broadcast. An agreement to change to the validation network to the next validation network may be. An instance of external validity multi-valued Byzantine agreement may be run to determine a continuing sequence number to be used by the next validation network based on the sequence numbers of amendments applied to decentralized database copies stored node computing devices of the open network. The next validation network may be switched to as the validation network for the open network after the continuing sequence number is determined. An amendment validated by the next validation network may be applied to a decentralized database copy. The amendment may include a sequence number that is higher than the continuing sequence number.

Abstract: Systems and techniques are provided for a resource distribution system. Selected resource paths in a resource transfer network may be monitored. A quantity of an intermediate resource type to transfer into resource pools in the resource transfer network may be determined. Each of the resource pools may be associated with a leg that can be part of a route with two legs for one or more of the selected resource paths. Instructions decrementing a register in a repository resource pool by the determined quantities of the intermediate resource type to be transferred into the resource pools in the resource transfer network and incrementing a register in each of the resource pools in the resource transfer network by the determined quantity of the intermediate resource type to be transferred into that resource pool when the determined quantity is greater than zero may be generated and caused to be executed.

Abstract: Systems and techniques are provided for random oracles in open networks. A node computing device of an open network may choose a random secret. The random secret may be a numeric or alphanumeric value. The node computing device may distribute shares of the random secret to node computing devices that are members of essential subsets for the node computing device. The node computing device may receive a share of a random secret from a second node computing device. The node computing device may be a member of an essential subset of the second node computing device. The node computing device may sign a deterministic seed message using the share of the random secret received from the second node computing device to generate a signature share. The node computing device may reveal the signature share and may receive a random value in response.

Abstract: A computing system can facilitate cross-medium transactions through exchanges without having dependency on exchange computer infrastructure, which when down, can cause open transactions to fail. In response to detecting a downed exchange, the system can execute a failover state to facilitate any transactions initially reliant upon the downed exchange.

Abstract: A computing system can establish asynchronous network communications with exchanges to facilitate cross-medium transactions between originating and recipient clients. Such communications can result in filtering out errant responses that would otherwise cause an open transaction to fail.

Abstract: A computing system can facilitate cross-medium transactions through use of a digital currency. The computing system can provide a guaranteed exchange rate and manage customer pools and/or slippage balances in digital wallets to adjust digital currency transfer amounts in order to align them with the guaranteed exchange rate.

Abstract: In a method for executing software, a result produced from an execution of a copy of the software by a corresponding platform can be received from each of a plurality of platforms. A number of results of execution of the software can be determined. The extent to which the results match can be compared to a threshold. The matching results can be accepted as an agreed-upon output of the software when the extent to which the results match is equal to or greater than the threshold. The software can include an implementation of at least a portion of an act associated with an agreement between at least two entities.

Abstract: Systems and techniques are provided for obscured routing. A computing device may send stacks of identifiers to neighbor computing devices in a network. Each stack of identifiers may include a unique identifier for the neighbor computing device to which it is sent. The computing device may send a notification identifying a destination computing device to the neighbor computing devices. The computing device may receive stacks of identifiers from the neighbor computing devices. The received stacks of identifiers may include completed routes to the destination computing device. Each completed route may be specified by unique identifiers added to the stack of identifiers by computing devices in the network. A unique identifier in each stack of identifiers may not be resolvable to an address by the computing device. The computing device may send a message a neighbor computing device based on a unique identifier in a chosen stack of identifiers.

Abstract: In a method for executing software, a result produced from an execution of a copy of the software by a corresponding platform can be received from each of a plurality of platforms. A number of results of execution of the software can be determined. The extent to which the results match can be compared to a threshold. The matching results can be accepted as an agreed-upon output of the software when the extent to which the results match is equal to or greater than the threshold. The software can include an implementation of at least a portion of an act associated with an agreement between at least two entities.

Abstract: Systems and techniques are provided for multi-hop path finding. Order data describing an order may be received. The order data may include a currency pair, a price level, and a volume. A one-hop path structure may be generated based on the order data describing the order. The one-hop path structure may include one-hop paths for the currency pair. The one-hop path structure may be written to a first ring buffer. The one-hop path structure may be read from the first ring buffer. Two-hop path structures may be generated by joining the one-hop path structure with other one-hop path structures. A value for the relative importance of the two-hop path structures may be determined to be greater than a threshold. Combined two-hop path structures may be written to a second ring buffer when the value for the relative importance of the two-hop path structures is greater than the threshold.

Abstract: Systems and techniques are provided for multi-hop path finding. Order data describing an order may be received. The order data may include a currency pair, a price level, and a volume. A one-hop path structure may be generated based on the order data describing the order. The one-hop path structure may include one-hop paths for the currency pair. The one-hop path structure may be written to a first ring buffer. The one-hop path structure may be read from the first ring buffer. Two-hop path structures may be generated by joining the one-hop path structure with other one-hop path structures. A value for the relative importance of the two-hop path structures may be determined to be greater than a threshold. Combined two-hop path structures may be written to a second ring buffer when the value for the relative importance of the two-hop path structures is greater than the threshold.

Abstract: In a method, computer readable medium, or system for making a payment transaction between a payor having an associated payor computer with a ledger storage for the payor and a payee having an associated payee computer with a ledger storage for the payee in a consensus payment network having a plurality of nodes each comprising a respective computer with ledger storage and relying on consensus determinations, an initiator is provided for making the payment transaction between the payor and the payee, the initiator being either the payor, the payee, or an intermediary having an associated intermediary computer. The respective initiator computer creates a temporary payment transaction consensus subnetwork comprising a set of validation nodes acceptable to both the payor and the payee, the set of validation nodes comprising fewer than all of said plurality of nodes in the payment network.