Thread

While working on #BitVotr version 2, I've been able to solve its Byzantine general's problem by using Bitcoin as a reference. It seems to me it can be used to solve BGPs for ALL other distributed networks. Because it's solved once, it's solved for all. All nodes in BitVotr can agree on some time-based state of data, as in, which version is latest and valid, by requiring it to contain the latest known bitcoin hash, which can then settle latency related uncertainties. Additionally, when a random node needs to be chosen, all can agree on which random node by using a random number from the latest bitcoin block (the hash), then apply that to the numbered list (with modulo).