StairDag: Cross-DAG Validation For Scalable BFT Consensus

This paper introduces a new consensus protocol, so-called \emph{\stair}, for fast consensus in DAG-based trustless system. In \stair, we propose a new approach to creating local block DAG, namely \emph{x-DAG} (cross-DAG), on each node. \emph{\stair} protocol is based on our Proof-of-Stake StakeDag framework \cite{stakedag} that distinguishes participants into users and validators by their stake. Both users and validators can create and validate event blocks. Unlike StakeDag's DAG, x-DAG ensures that each new block has to have parent blocks from both Users and Validators to achieve more safety and liveness. Our protocol leverages a pool of validators to expose more validating power to new blocks for faster consensus in a leaderless asynchronous system. Further, our framework allows participants to join as observers / monitors, who can retrieve DAG for post-validation, but do not participate in onchain validation.

[1]  Ariel Gabizon,et al.  Cryptocurrencies Without Proof of Work , 2014, Financial Cryptography Workshops.

[2]  Yo-Sub Han,et al.  OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems , 2018, ArXiv.

[3]  Yoad Lewenberg,et al.  SPECTRE: A Fast and Scalable Cryptocurrency Protocol , 2016, IACR Cryptol. ePrint Arch..

[4]  Jae Kwon,et al.  Tendermint : Consensus without Mining , 2014 .

[5]  Elaine Shi,et al.  FruitChains: A Fair Blockchain , 2017, IACR Cryptol. ePrint Arch..

[6]  Yonatan Sompolinsky PHANTOM , GHOSTDAG : Two Scalable BlockDAG protocols , 2018 .

[7]  C. Lemahieu,et al.  RaiBlocks: A Feeless Distributed Cryptocurrency Network , 2017 .

[8]  Husneara Hamid Sheikh Sheikh,et al.  Proof-of-Work Vs Proof-of-Stake: A Comparative Analysis and an Approach to Blockchain Consensus Mechanism , 2018 .

[9]  Qi Ma,et al.  Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0 , 2019, ArXiv.

[10]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[11]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[12]  Elaine Shi,et al.  The Honey Badger of BFT Protocols , 2016, CCS.

[13]  Silvio Micali,et al.  Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..

[14]  Ramakrishna Kotla,et al.  Zyzzyva: speculative byzantine fault tolerance , 2007, TOCS.

[15]  George Danezis,et al.  Blockmania: from Block DAGs to Consensus , 2018, ArXiv.

[16]  Wei Xu,et al.  Scaling Nakamoto Consensus to Thousands of Transactions per Second , 2018, ArXiv.

[17]  Antonio Puliafito,et al.  Blockchain and IoT Integration: A Systematic Survey , 2018, Sensors.

[18]  Silvio Micali,et al.  ALGORAND: The Efficient and Democratic Ledger , 2016, ArXiv.

[19]  Sunny King,et al.  PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake , 2012 .

[20]  Andre Cronje,et al.  Fantom: A scalable framework for asynchronous distributed systems , 2018, ArXiv.

[21]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[22]  Leslie Lamport,et al.  Paxos Made Simple , 2001 .

[23]  Andre Cronje,et al.  ONLAY: Online Layering for scalable asynchronous BFT system , 2019, ArXiv.

[24]  Andre Cronje,et al.  StakeDag: Stake-based Consensus For Scalable Trustless Systems , 2019, ArXiv.