Composing Byzantine quorum systems for securing distributed protocols
We show how to realize randomized signature-free asynchronous Byzantine consensus with asymmetric quorum systems.
Scaling blockchains by reducing the concurrency across token transactions.
A technical analysis of Ripple’s protocol reveals that it ensures neither safety nor liveness under the stated assumptions.
How does one express a trust structure for consensus in a distributed system that does more than counting possible faults?
A sound model for blockchain consensus with flexible and subjective trust.