FLP impossibility is one of those results that everyone talks about, but many people don’t really understand. Presented in a short, yet hugely influential 9 page paper, it relates a consensus algorithm’s safety and liveness properties to the network of computers trying to achieve consensus.

In light of the multitude of comments posted after CCN published an op-ed I wrote, I offer further explanation here.

We at Pyrofex share the visions of the most ambitious cryptomaniacs. We believe that crypto is…

We recently got some questions about two consensus algorithms, Albatross and Thundercore, which have some similarities to Casanova. If you’ve been reading our stuff about Casanova and C∆, you will have seen that one of the main features of Casanova is that it’s an “optimistic”…