The Heterogeneous Consensus project has invented and implemented a Consensus algorithm in which not all participants agree on who may fail, and how. We in some ways resemble the Stellar project, but our algorithm tolerates mixed Byzantine and Crash failures, one message-send lower latency, and a different model of Observers and Participants.
With Charlotte, we can append one block onto multiple blockchains, solving the atomic commit problem.
A work-in-progress talk about our Heterogeneous Consensus algorithm.
We’ve been looking at modeling distributed system failures with information flow tools, and expressing heterogeneous trust.