@s{quotedtext}
@s{quotedtext}
How do you prevent Sybil attacks-- somebody creating a gazillion n-client and/or hatching nodes, and voting themselves lots and lots of new currency?
And how does a node choose a "random" node-- does every node know about every other node? If yes, then how do you avoid getting O(N^2) communication as the number of nodes (N) rises and every existing node must be told about every new node?