Hacker News new | ask | show | jobs
by hdespiritu 2961 days ago
There's decades of academic work in the form of "impossibility" results showing that handling byzantine fault tolerance in distributed consensus is alot more computationally expensive than omission/crash fault tolerance. The following (FLP impossibility result) being one of the most famous ones:

https://groups.csail.mit.edu/tds/papers/Lynch/jacm85.pdf

1 comments

Yes, that's the root of the problem. A deceptively simple sounding result.