Let T_{xy} be number of jumps needed to go from the leaf x to a target ID y.
To make the model closer to real Kademlia networks, x_1, \ldots, x_n can also be assumed to be chosen uniformly at random without replacement from \{0,1\}^d.