University of Cambridge > > Microsoft Research Cambridge, public talks > Canopus and RCanopus: Scalable Consensus for Permissioned Blockchains

Canopus and RCanopus: Scalable Consensus for Permissioned Blockchains

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

 Please note, this event may be recorded. Microsoft will own the copyright of any recording and reserves the right to distribute it as required.

A critical problem with the consensus protocols underlying blockchains is that they do not scale well. As the number of transactions needing linearization increases, network traffic from topology-oblivious broadcasts can quickly overwhelm the network or a central coordinator. Thus, achieving strong linearizabiilty is typically restricted to a handful of participants, or systems must resort to weaker forms of consensus, such as those using proof of work. To address this problem, we propose Canopus, a highly-parallel consensus protocol that exploits modern data center network topology, parallelism, and consensus semantics to achieve scalability. Our key insight is to make network communication patterns topology-aware. In our prototype implementation, Canopus achieves rates as high as 5m linearizable transactions/second over 21 nodes distributed across 7 datacenters. I will also outline an extension, Resilient Canopus, that makes Canopus Byzantine Fault Tolerant as well as network partition tolerant.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity