const MIDDLE_HOP_SHARE: usize = 3;Expand description
A relayer may sit past the first position in at most n.div_ceil(MIDDLE_HOP_SHARE) of the n
candidates take_relayer_diverse keeps, while the pool allows it, counted over every position past
the first together: a relayer in the second position of some paths and the third of others costs
as many paths when it dies as one in either alone.
Distinct first relayers alone leave every other position free to collapse: the best path from each first relayer often runs through the same second hop, so one relayer sat in the middle of every forward candidate, and when it died the whole forward direction went dark at once, with nothing left to corroborate a verdict against (measured: the busiest relay of a 2-hop session carried 29 % of all relayed packets; killed, the session never recovered). A third bounds what one relayer’s death costs to about a third of the draws before the weights are even looked at.