requestBlocksFromRandomPeers is inefficient (though it is sufficient)
We should find pending blocks and sample the peers in one go rather than the current O(n^2) impl.