He could use timeout as a proxy for distance because all the e-mail recipients were within the same university, with a direct-switched network. Once it got on the wire, the only latency was from speed-of-light.
If you cross this line over multiple countries, you now have a system where you can prove that the devices are spread across some number of the different countries, which probably has some useful properties, like making nation-state attacks slightly more difficult.
In an non-constrained case, sure, there's no-minimal link distance. You just have a pile of chain.
However, if you make the chain taut between the two points, say by decreasing the number of nodes in the chain or the maximal distance of links, the minimal distance between nodes then approaches the maximal distance between nodes. When you have a chain constrained to the straight line between the two points, the maximal distance between nodes is equal to the minimal distance between nodes.
If that picture is of you, you can thus prove that you were in a particular place at a particular time.
A bitcoin block hash is found, and 2 participants begin a back and forth hashing session in which billions of round trips are performed...every minute or so, a transaction containing the latest result is submitted to the network, and eventually one is locked in.
An interested party could then verify that the transaction could not have occurred unless the 2 keys involved were within a certain physical distance from one another.
Not sure what it could be used for yet, but it's something that feels like it could be important for some purpose.