Votes-as-a-Proof (VaaP): Permissioned Blockchain Consensus Protocol Made Simple

Abstract

With the development of Blockchain technology, permissioned Blockchains are getting more and more attention from researchers because applications based on permissioned Blockchains are more practical and easier to be carried out. This paper aims to design a dedicated consensus protocol for permissioned Blockchains. The existing consensus protocols applied to permissioned Blockchains are either derived from public Blockchains such as Proof of Work (PoW) or Proof of Stake (PoS), with full decentralization, resulting in low transaction processing efficiency; or derived from traditional Byzantine fault-tolerant (BFT) consensus protocols such as Practical BFT (PBFT) or HoneyBadgerBFT, with high communication complexity of the consensus process, resulting in low scalability. Therefore, we propose a dedicated consensus protocol for permissioned Blockchains called Votes-as-a-Proof (VaaP) with high transaction processing efficiency while ensuring high scalability. Every node in VaaP runs a simple consensus process based on voting in parallel. Faulty nodes will only deprive themselves of using consensus service. We present the comparison of VaaP and Sphinx, one of the state-of-the-art consensus protocols, analytically and experimentally (up to 500 nodes). The results indicate that VaaP outperforms Sphinx in throughput, latency and scalability.