Overview of Polkadot and its Design Considerations

In this paper we describe the design components of the heterogenous multi-chain protocol Polkadot and explain how these components help Polkadot address some of the existing shortcomings of blockchain technologies. At present, a vast number of blockchain projects have been introduced and employed with various features that are not necessarily designed to work with each other. This makes it difficult for users to utilise a large number of applications on different blockchain projects. Moreover, with the increase in number of projects the security that each one is providing individually becomes weaker. Polkadot aims to provide a scalable and interoperable framework for multiple chains with pooled security that is achieved by the collection of components described in this paper.

[1]  Ethan Heilman,et al.  Eclipse Attacks on Bitcoin's Peer-to-Peer Network , 2015, USENIX Security Symposium.

[2]  Satoshi Nakamoto.  Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

[3]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[4]  Michael Hamburg.  The STROBE protocol framework , 2017, IACR Cryptol. ePrint Arch..

[5]  Vitalik Buterin.  A NEXT GENERATION SMART CONTRACT & DECENTRALIZED APPLICATION PLATFORM , 2015 .

[6]  Edith Elkind,et al.  Proportional Justified Representation , 2016, AAAI.

[7]  Michael Hamburg,et al.  Decaf: Eliminating Cofactors Through Point Compression , 2015, CRYPTO.

[8]  Vitalik Buterin,et al.  Casper the Friendly Finality Gadget , 2017, ArXiv.

[9]  Ethan Buchman,et al.  The latest gossip on BFT consensus , 2018, ArXiv.

[10]  Pekka Aavikko,et al.  Network Time Protocol , 2010 .

[11]  DR. Gavin Wood.  POLKADOT: VISION FOR A HETEROGENEOUS MULTI-CHAIN FRAMEWORK , 2016 .

[12]  Norberto Fernández García,et al.  Fully Open Extensions to the D'Hondt Method , 2016, ArXiv.

[13]  Vitalik Buterin,et al.  Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities. , 2018, 1809.09044.

[14]  Alexei Zamyatin,et al.  XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed Assets , 2019, 2019 IEEE Symposium on Security and Privacy (SP).

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

[16]  Dominik Harz,et al.  Refinement and Verification of CBC Casper , 2019, 2019 Crypto Valley Conference on Blockchain Technology (CVCBT).

[17]  Luis Sánchez-Fernández,et al.  The Maximin Support Method: An Extension of the D'Hondt Method to Approval-Based Multiwinner Elections , 2016, AAAI.

[18]  David Both.  Network Time Protocol , 2020 .

[19]  Tanja Lange,et al.  High-speed high-security signatures , 2011, Journal of Cryptographic Engineering.

[20]  Abdolkarim Sadrieh,et al.  Sudden Termination Auctions - An Experimental Study , 2012 .

[21]  Aggelos Kiayias,et al.  The Bitcoin Backbone Protocol: Analysis and Applications , 2015, EUROCRYPT.

[22]  Svante Janson,et al.  Phragmén’s voting methods and justified representation , 2017, AAAI.

[23]  Elaine Shi,et al.  Analysis of Deterministic Longest-Chain Protocols , 2019, 2019 IEEE 32nd Computer Security Foundations Symposium (CSF).

[24]  Alfonso Cevallos,et al.  Validator election in nominated proof-of-stake , 2020, ArXiv.

[25]  Silvio Micali,et al.  Verifiable random functions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[26]  Handan Kilinç Alper.  Consensus on Clock in Universally Composable Timing Model , 2019, IACR Cryptol. ePrint Arch..

[27]  Tarun Chitra,et al.  Competitive equilibria between staking and on-chain lending , 2019, ArXiv.

[28]  Aggelos Kiayias,et al.  Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain , 2018, EUROCRYPT.