3 ms·
Appreciate the suggestion. That's fairly similar to the first algorithm I described except without the initial hash commit step, but I think it shares the same
by sanity31415 6y ago
Appreciate the suggestion.
That's fairly similar to the first algorithm I described except without the initial hash commit step, but I think it shares the same problem which is that I don't see how it could scale up to tens of thousands of peers, with peers constantly leaving and joining the network.
- nabla9 6y agoNodes can come and go. They just have to talk few neighbors. If you want every node over some time period participating, you can't do faster than than log2(n) XOR operations. (in above comment I said O(n) xor's, that's obviously wrong. You need only log(N) xor's)