skip to main content
research-article

Stability and Scalability of Blockchain Systems

Published:12 June 2020Publication History
Skip Abstract Section

Abstract

The blockchain paradigm provides a mechanism for content dissemination and distributed consensus on Peer-to-Peer (P2P) networks. While this paradigm has been widely adopted in industry, it has not been carefully analyzed in terms of its network scaling with respect to the number of peers. Applications for blockchain systems, such as cryptocurrencies and IoT, require this form of network scaling. In this paper, we propose a new stochastic network model for a blockchain system. We identify a structural property called one-endedness, which we show to be desirable in any blockchain system as it is directly related to distributed consensus among the peers. We show that the stochastic stability of the network is sufficient for the one-endedness of a blockchain. We further establish that our model belongs to a class of network models, called monotone separable models. This allows us to establish upper and lower bounds on the stability region. The bounds on stability depend on the connectivity of the P2P network through its conductance and allow us to analyze the scalability of blockchain systems on large P2P networks. We verify our theoretical insights using both synthetic data and real data from the Bitcoin network.

References

  1. Confirmation. https://en.Bitcoin.it/wiki/Confirmation. Online; accessed 20-October-2019.Google ScholarGoogle Scholar
  2. David Aldous, Russell Lyons, et al. Processes on unimodular random networks. Electron. J. Probab, 12(54):1454--1508, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  3. François Baccelli and Serguei Foss. On the saturation rule for the stability of queues. Journal of Applied Probability, 32(2):494--507, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  4. Francois Baccelli, Mir-Omid Haji-Mirsadeghi, and Ali Khezeli. Eternal family trees and dynamics on unimodular random graphs. Unimodularity in Randomly Generated Graphs, 719:85, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  5. François Baccelli, Mir-Omid Haji-Mirsadeghi, James T Murphy III, et al. Doeblin trees. Electronic Journal of Probability, 24, 2019.Google ScholarGoogle Scholar
  6. François Baccelli, Fabien Mathieu, Ilkka Norros, and Rémi Varloot. Can p2p networks be super-scalable? In 2013 Proceedings IEEE INFOCOM, pages 1753--1761. IEEE, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  7. François Baccelli and Antonio Sodre. Renewal population dynamics and their eternal family trees. arXiv preprint arXiv:1803.08081, 2018.Google ScholarGoogle Scholar
  8. Vivek Bagaria, Sreeram Kannan, David Tse, Giulia Fanti, and Pramod Viswanath. Prism: Deconstructing the blockchain to approach physical limits. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pages 585--602. ACM, 2019.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Itai Benjamini and Oded Schramm. Recurrence of distributional limits of finite planar graphs. In Selected Works of Oded Schramm, pages 533--545. Springer, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  10. Blockchair. Bitcoin database dump. https://gz.blockchair.com/Bitcoin/blocks/. Online; accessed 20-Janurary-2020.Google ScholarGoogle Scholar
  11. Shaileshh Bojja Venkatakrishnan, Giulia Fanti, and Pramod Viswanath. Dandelion: Redesigning the bitcoin network for anonymity. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(1):22, 2017.Google ScholarGoogle Scholar
  12. Vitalik Buterin et al. Ethereum white paper. GitHub repository, pages 22--23, 2013.Google ScholarGoogle Scholar
  13. Flavio Chierichetti, Silvio Lattanzi, and Alessandro Panconesi. Rumour spreading and graph conductance. In Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, pages 1657--1663. SIAM, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Christian Decker and RogerWattenhofer. Information propagation in the bitcoin network. In IEEE P2P 2013 Proceedings, pages 1--10. IEEE, 2013.Google ScholarGoogle Scholar
  15. Alexandros G Dimakis, Anand D Sarwate, and Martin J Wainwright. Geographic gossip: Efficient aggregation for sensor networks. In Proceedings of the 5th international conference on Information processing in sensor networks, pages 69--76, 2006.Google ScholarGoogle Scholar
  16. Ittay Eyal, Adem Efe Gencer, Emin Gün Sirer, and Robbert Van Renesse. Bitcoin-ng: A scalable blockchain protocol. In 13th {USENIX} symposium on networked systems design and implementation ({NSDI} 16), pages 45--59, 2016.Google ScholarGoogle Scholar
  17. Ittay Eyal and Emin Gün Sirer. Majority is not enough: Bitcoin mining is vulnerable. Communications of the ACM, 61(7):95--102, 2018.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the internet topology. In ACM SIGCOMM computer communication review, volume 29, pages 251--262. ACM, 1999.Google ScholarGoogle Scholar
  19. Giulia Fanti, Shaileshh Bojja Venkatakrishnan, Surya Bakshi, Bradley Denby, Shruti Bhargava, Andrew Miller, and Pramod Viswanath. Dandelion++: Lightweight cryptocurrency networking with formal anonymity guarantees. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2(2):29, 2018.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Serguei Foss and Takis Konstantopoulos. An overview of some stochastic stability methods (<special issue> network design, control and optimization). Journal of the Operations Research Society of Japan, 47(4):275--303, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  21. Nikolaos Fountoulakis and Konstantinos Panagiotou. Rumor spreading on random regular graphs and expanders. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 560--573. Springer, 2010.Google ScholarGoogle Scholar
  22. Nikolaos Fountoulakis, Konstantinos Panagiotou, and Thomas Sauerwald. Ultra-fast rumor spreading in social networks. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 1642--1660. SIAM, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Maria Frolkova and Michel Mandjes. A bitcoin-inspired infinite-server model with a random fluid limit. Stochastic Models, 35(1):1--32, 2019.Google ScholarGoogle ScholarCross RefCross Ref
  24. Ayalvadi Ganesh. Rumor spreading on graphs, 2015.Google ScholarGoogle Scholar
  25. Juan Garay, Aggelos Kiayias, and Nikos Leonardos. The bitcoin backbone protocol: Analysis and applications. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 281--310. Springer, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  26. Adem Efe Gencer, Soumya Basu, Ittay Eyal, Robbert Van Renesse, and Emin Gün Sirer. Decentralization in bitcoin and ethereum networks. In International Conference on Financial Cryptography and Data Security, pages 439--457. Springer, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  27. Arthur Gervais, Ghassan Karame, Karl WÃ'st, Vasileios Glykantzis, Hubert Ritzdorf, and Srdjan Capkun. On the security and performance of proof of work blockchains. In Proceedings of the 23nd ACM SIGSAC Conference on Computer and Communication Security (CCS). ACM, 2016.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Johannes Göbel, Holger Paul Keeler, Anthony E Krzesinski, and Peter G Taylor. Bitcoin blockchain dynamics: The selfish-mine strategy in the presence of propagation delay. Performance Evaluation, 104:23--41, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  29. Rudolf Halin. Über unendliche wege in graphen. Mathematische Annalen, 157(2):125--137, 1964.Google ScholarGoogle ScholarCross RefCross Ref
  30. Stratis Ioannidis, Augustin Chaintreau, and Laurent Massoulié. Optimal and scalable distribution of content updates over a mobile social network. In IEEE INFOCOM 2009, pages 1422--1430. IEEE, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  31. Svante Janson, Tomasz Luczak, and Andrzej Rucinski. Random graphs, volume 45. John Wiley & Sons, 2011.Google ScholarGoogle Scholar
  32. Sanjit Kaul, Roy Yates, and Marco Gruteser. Real-time status: How often should one update? In 2012 Proceedings IEEE INFOCOM, pages 2731--2735. IEEE, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  33. Yoshiaki Kawase and Shoji Kasahara. Transaction-confirmation time for bitcoin: a queueing analytical approach to blockchain mechanism. In International Conference on Queueing Theory and Network Applications, pages 75--88. Springer, 2017.Google ScholarGoogle ScholarCross RefCross Ref
  34. Frank P Kelly. Reversibility and stochastic networks. Cambridge University Press, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Michael Krivelevich, Benny Sudakov, Van H Vu, and Nicholas C Wormald. Random regular graphs of high degree. Random Structures & Algorithms, 18(4):346--363, 2001.Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Yoad Lewenberg, Yonatan Sompolinsky, and Aviv Zohar. Inclusive block chain protocols. In International Conference on Financial Cryptography and Data Security, pages 528--547. Springer, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  37. Quan-Lin Li, Jing-Yu Ma, and Yan-Xia Chang. Blockchain queue theory. In International Conference on Computational Social Networks, pages 25--40. Springer, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  38. Quan-Lin Li, Jing-Yu Ma, Yan-Xia Chang, Fan-Qi Ma, and Hai-Bo Yu. Markov processes in blockchain systems. arXiv preprint arXiv:1904.03598, 2019.Google ScholarGoogle Scholar
  39. Russell Lyons and Yuval Peres. Probability on trees and networks, volume 42. Cambridge University Press, 2017.Google ScholarGoogle Scholar
  40. Laurent Massoulié and Milan Vojnovi?. Coupon replication systems. In ACM SIGMETRICS Performance Evaluation Review, volume 33, pages 2--13. ACM, 2005.Google ScholarGoogle Scholar
  41. Milena Mihail, Christos Papadimitriou, and Amin Saberi. On certain connectivity properties of the internet topology. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pages 28--35. IEEE, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  42. Jelena Misic, Vojislav B Misic, Xiaolin Chang, Saeideh Gholamrezazadeh Motlagh, and Zulfiker M Ali. Modeling of bitcoin's blockchain delivery network. IEEE Transactions on Network Science and Engineering, 2019.Google ScholarGoogle ScholarCross RefCross Ref
  43. Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. 2008.Google ScholarGoogle Scholar
  44. Mark Newman. Networks. Oxford university press, 2018.Google ScholarGoogle Scholar
  45. Konstantinos Panagiotou and Leo Speidel. Asynchronous rumor spreading on random graphs. Algorithmica, 78(3):968-- 989, 2017.Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Nikolaos Papadis, Sem Borst, AnwarWalid, Mohamed Grissa, and Leandros Tassiulas. Stochastic models and wide-area network measurements for blockchain design and analysis. In IEEE INFOCOM 2018-IEEE Conference on Computer Communications, pages 2546--2554. IEEE, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  47. Rafael Pass, Lior Seeman, and Abhi Shelat. Analysis of the blockchain protocol in asynchronous networks. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 643--673. Springer, 2017.Google ScholarGoogle ScholarCross RefCross Ref
  48. Rafael Pass and Elaine Shi. Fruitchains: A fair blockchain. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 315--324. ACM, 2017.Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Mathew Penrose et al. Random geometric graphs, volume 5. Oxford university press, 2003.Google ScholarGoogle Scholar
  50. Sergei Popov. Iota whitepaper. Technical White Paper, year= 2017, 2017.Google ScholarGoogle Scholar
  51. Dongyu Qiu and Rayadurgam Srikant. Modeling and performance analysis of bittorrent-like peer-to-peer networks. In ACM SIGCOMM computer communication review, volume 34, pages 367--378. ACM, 2004.Google ScholarGoogle Scholar
  52. Sridharan Ranganathan, Alan D George, Robert W Todd, and Matthew C Chidester. Gossip-style failure detection and distributed consensus for scalable heterogeneous clusters. Cluster Computing, 4(3):197--209, 2001.Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Saulo Ricci, Eduardo Ferreira, Daniel Sadoc Menasche, Artur Ziviani, Jose Eduardo Souza, and Alex Borges Vieira. Learning blockchain delays: a queueing theory approach. ACM SIGMETRICS Performance Evaluation Review, 46(3):122-- 125, 2019.Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Sujay Sanghavi, Bruce Hajek, and Laurent Massoulié. Gossiping with multiple messages. IEEE Transactions on Information Theory, 53(12):4640--4654, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. Devavrat Shah et al. Gossip algorithms. Foundations and Trends® in Networking, 3(1):1--125, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. Yonatan Sompolinsky and Aviv Zohar. Secure high-rate transaction processing in bitcoin. In International Conference on Financial Cryptography and Data Security, pages 507--527. Springer, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  57. David Tse and Pramod Viswanath. Fundamentals of wireless communication. Cambridge university press, 2005.Google ScholarGoogle Scholar
  58. Valery Ugrinovskii. Conditions for detectability in distributed consensus-based observer networks. IEEE Transactions on Automatic Control, 58(10):2659--2664, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  59. Remco Van Der Hofstad. Random graphs and complex networks. Available on http://www. win. tue. nl/rhofstad/NotesRGCN. pdf, 11, 2009.Google ScholarGoogle Scholar
  60. Lei Yang, Vivek Bagaria, Gerui Wang, Mohammad Alizadeh, David Tse, Giulia Fanti, and Pramod Viswanath. Prism: Scaling bitcoin by 10,000 x. arXiv preprint arXiv:1909.11261, 2019.Google ScholarGoogle Scholar
  61. Xiangying Yang and Gustavo De Veciana. Service capacity of peer to peer networks. In IEEE INFOCOM 2004, volume 4, pages 2242--2252. IEEE, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  62. Ji Zhu and Bruce Hajek. Stability of a peer-to-peer communication system. IEEE Transactions on Information Theory, 58(7):4693--4713, 2012. Proc.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Stability and Scalability of Blockchain Systems

                          Recommendations

                          Comments

                          Login options

                          Check if you have access through your login credentials or your institution to get full access on this article.

                          Sign in

                          Full Access

                          PDF Format

                          View or Download as a PDF file.

                          PDF

                          eReader

                          View online with eReader.

                          eReader
                          About Cookies On This Site

                          We use cookies to ensure that we give you the best experience on our website.

                          Learn more

                          Got it!