Utility and governance for secure, reliable, sustainable, and distributed data routing over the internet

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 a computer network, the operations comprising:

• automatically measuring one-way latencies between a plurality of nodes comprising a first node and a second node in a distributed data routing network;
• automatically calculating relay health scores of potential relayed data routing paths in the distributed network, wherein each of the potential relayed data routing paths includes a relay node and routing segments in connection with the relay node, wherein a relay health score for one of the potential relayed data routing paths is based on at least one of uptimes of the relay node, or bandwidths, jitters, data package losses, or amount of data routed through the routing segments in the potential relayed data routing path;
• automatically selecting, from the potential relayed data routing paths, a relayed data routing path between the first node and the second node via the relay node based on the one-way latencies and the relay health scores of potential relayed data routing paths, wherein selected relayed data routing path has a total one-way latency smaller than a one-way latency measured in a direct path from the first node to the second node;
• and
• transferring data from the first node to the second node along the selected relayed data routing path.

A computer system for autonomously discovering and utilizing low-latency routing paths in a distributed data routing network, comprising:

• a server configured to send instructions to a plurality of nodes in a computer network;
• and
• a 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 measure one-way latencies between a plurality of nodes comprising a first node and a second node in a distributed data routing network;
• automatically calculate relay health scores of potential relayed data routing paths in the distributed network, wherein each of the potential relayed data routing paths includes a relay node and routing segments in connection with the relay node, wherein a relay health score for one of the potential relayed data routing paths is based on at least one of uptimes of the relay node, or bandwidths, jitters, data package losses, or amount of data routed through the routing segments in the potential relayed data routing path;
• automatically select, from the potential relayed data routing paths, a relayed data routing path between the first node and the second node via the relay node based on the one-way latencies and the relay health scores of potential relayed data routing paths, wherein selected relayed data routing path has a total one-way latency smaller than a one-way latency measured in a direct path from the first node to the second node;
• and
• transfer data from the first node to the second node along the selected relayed data routing path.