About

This is a visualization of the Cardano Ouroboros peer selection algorithm. It is a direct output from the Haskell code running a network discovery simulation. Each point represents a peer on the network. At the center is the root node, the simulation is from the perspective of this node. Peers go through three stages; "cold", "warm" and "hot". Hot peers are nodes that are being actively talked to. Warm peers have a TCP connection and cold peers are nodes which are known to exist. The lines show connections between nodes. Ouroboros creates quite a dense graph with a high level of interconnectivity.