Autonomous data routing in a peer-to-peer computer network

A non-transitory computer-readable medium storing a plurality of instructions which, when executed by one or more processors, cause the one or more processors to perform operations in a peer-to-peer computer network, the operations comprising:

• automatically updating the peer-to-peer computer network comprising a plurality of nodes each associated with a unique node ID, comprising:
• storing, at a first node, IDs of neighbor nodes that are connected to the first node in the peer-to-peer computer network;
• storing, at the first node, IDs of candidate nodes for connecting to the first node in the peer-to-peer computer network;
• automatically sending pulse messages from the first node to the neighbor nodes and the candidate nodes;
• in response to the pulse messages, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes;
• calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses;
• sorting the nodes in the neighbor nodes and the candidate nodes into a plurality of orbital bins each comprising nodes characterized by RTTs related to the first node within a specific interval;
• and
• automatically selecting and adding at least one node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node;
• and
• automatically routing data from the first node to a second node via a relay node that is one of updated nodes in the peer-to-peer computer network.

A computer system for autonomously routing data using in a peer-to-peer computer network, comprising:

• a communication module configured to send or receive data to and from nodes in the peer-to-peer computer network;
• and
• a computer memory storing the instructions that, when executed by the one or more processors at the plurality of nodes, cause the plurality of nodes to:
• automatically update the peer-to-peer computer network comprising a plurality of nodes each associated with a unique node ID, which comprises:
• storing, at a first node, IDs of neighbor nodes that are connected to the first node in the peer-to-peer computer network;
• storing, at the first node, IDs of candidate nodes for connecting to the first node in the peer-to-peer computer network;
• automatically sending pulse messages from the first node to the neighbor nodes and the candidate nodes;
• in response to the pulse messages, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes;
• calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses;
• storing the nodes in the neighbor nodes and the candidate nodes into a plurality of orbital bins each comprising nodes characterized by RTTs related to the first node within a specific interval;
• and
• automatically selecting and adding at least one node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node;
• and
• automatically route data from the first node to a second node via a relay node that is one of updated nodes in the peer-to-peer computer network.