“This paper presents a new byzantine fault tolerant consensus algorithm with very weak synchrony assumptions. Like Hashgraph [1], it has no leaders, no round robin, no proof-of-work and reaches eventual consensus with probability one. However, unlike Hashgraph, it does not only provide high speed in the absence of faults, but also in their presence. It is also fully open, and a GPLv3 implementation written in Rust will be made available in the near future.”
Sounds pretty awesome. The very next sentence said the got the ideas by looking at all the things in the CompSci literature that worked in various situations. If only more developers tried that approach. ;)
“This paper presents a new byzantine fault tolerant consensus algorithm with very weak synchrony assumptions. Like Hashgraph [1], it has no leaders, no round robin, no proof-of-work and reaches eventual consensus with probability one. However, unlike Hashgraph, it does not only provide high speed in the absence of faults, but also in their presence. It is also fully open, and a GPLv3 implementation written in Rust will be made available in the near future.”
Sounds pretty awesome. The very next sentence said the got the ideas by looking at all the things in the CompSci literature that worked in various situations. If only more developers tried that approach. ;)