What is kademliha-style logaritmic connectivity?
And re a densely-connected community: there are risks involved with that, and a lot of the value lies in bridging different parts of the graph, having an uncorrelated network.
It is a distributed algorithm that has certain desirable properties:
https://en.wikipedia.org/wiki/Kademlia
What is kademliha-style logaritmic connectivity?
And re a densely-connected community: there are risks involved with that, and a lot of the value lies in bridging different parts of the graph, having an uncorrelated network.
It is a distributed algorithm that has certain desirable properties:
https://en.wikipedia.org/wiki/Kademlia