Skip to main content
Top
Published in: Peer-to-Peer Networking and Applications 6/2023

22-09-2023

EVONChain: a bi-tiered public blockchain network architecture

Authors: Yihan Kong, Jing Li, Ting Xiong, Tao Xie

Published in: Peer-to-Peer Networking and Applications | Issue 6/2023

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper presents a democratic nature inspired evolvable chain (shorten as EVONChain), a scalable and decentralized public blockchain architecture with high throughput and fast confirmation. EVONChain decouples the function of a full blockchain node into two processes of consensus that are completed separately in two connected networks, with a small number of high-performance cloud nodes in the inner network responsible for collecting and validating transactions, packaging blocks, as well as implementing a consistent replication, and a huge number of low-performance user nodes, connected through the Mobile Edge Computing (MEC) in the outer network, are responsible for the Proof of Intelligence (PoI) work, a novel Proof of Work (PoW) mechanism that resists Application-Specific Integrated Circuit (ASIC) computing and enables “one-CPU-one-vote". To make full use of inner network bandwidth, the graph-chain consensus protocol with high bandwidth utilization called ORIC was deployed to EVONChain. The relationship between the inner and outer networks is enhanced through the bi-tiered incentive mechanism. We developed an EVONChain simulator and evaluated EVONChain on it with up to 5000 nodes. Under the inner network bandwidth of 1.5Gbps, EVONChian can achieve a throughput of close to 375,000 transactions per second, with a block interval of 10s and an orphaned block rate of less than 7%. Simulation results show that EVONChain can drastically increase the performance scalability of practical high-frequency applications, and greatly decrease the confirmation time to a minute level.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
7
The test website is available at https://​xiont.​github.​io
 
8
Assume hash rate is 1TH/s, \(\Delta = 10^{13}\) means delay is 10 seconds.
 
9
\(\lambda = \Omega (\kappa )\), the variables (e.g., The variable X: if at round i an honest node obtains a PoI, then \(X_i\) = 1, otherwise \(X_i\) = 0.) over any \(\lambda\) consecutive rounds do not deviate too much from its expectation [48].
 
10
There exists constants \(c_0 > 0\), \(c_1\) such that for all \(\lambda > 0, \epsilon (\lambda ) \le e^{-c_{0}\lambda +c_1}\) [49].
 
11
we use the standard transaction size of bitcoin - 250 bytes
 
12
NA,EUR,SA,CN,JPN,AUS from https://​testmy.​net
 
Literature
7.
go back to reference Kiayias A, Russell A, David B, Oliynykov R (2017) Ouroboros: A provably secure proof-of-stake blockchain protocol. Annual International Cryptology Conference, pp 357–388 Kiayias A, Russell A, David B, Oliynykov R (2017) Ouroboros: A provably secure proof-of-stake blockchain protocol. Annual International Cryptology Conference, pp 357–388
8.
go back to reference Castro M, Liskov B (1999) Practical byzantine fault tolerance. USENIX Symposium on Operating Systems Design and Implementation, pp 173–186 Castro M, Liskov B (1999) Practical byzantine fault tolerance. USENIX Symposium on Operating Systems Design and Implementation, pp 173–186
9.
go back to reference Lamport L (2001) Paxos made simple. ACM Sigact News, pp 18–25 Lamport L (2001) Paxos made simple. ACM Sigact News, pp 18–25
10.
go back to reference Ongaro D, Ousterhout J (2014) In search of an understandable consensus algorithm. 2014 USENIX Annual Technical Conference (USENIX ATC 14), pp 305–319 Ongaro D, Ousterhout J (2014) In search of an understandable consensus algorithm. 2014 USENIX Annual Technical Conference (USENIX ATC 14), pp 305–319
15.
go back to reference Gilad Y, Hemo R, Micali S, Vlachos G, Zeldovich N (2017) Algorand: Scaling byzantine agreements for cryptocurrencies. Proceedings of the 26th Symposium on Operating Systems Principles, pp 51–68 Gilad Y, Hemo R, Micali S, Vlachos G, Zeldovich N (2017) Algorand: Scaling byzantine agreements for cryptocurrencies. Proceedings of the 26th Symposium on Operating Systems Principles, pp 51–68
16.
go back to reference Sarfraz U, Alam M, Zeadally S, Khan A (2019) Privacy aware iota ledger: Decentralized mixing and unlinkable iota transactions. Comput Netw, pp 361–372 Sarfraz U, Alam M, Zeadally S, Khan A (2019) Privacy aware iota ledger: Decentralized mixing and unlinkable iota transactions. Comput Netw, pp 361–372
17.
go back to reference Li C, Li P, Zhou D, Yang Z, Wu M, Yang G, Xu W, Long F, Yao AC-C (2020) A decentralized blockchain with high throughput and fast confirmation. 2020 USENIX Annual Technical Conference (USENIX ATC 20), pp 515–528 Li C, Li P, Zhou D, Yang Z, Wu M, Yang G, Xu W, Long F, Yao AC-C (2020) A decentralized blockchain with high throughput and fast confirmation. 2020 USENIX Annual Technical Conference (USENIX ATC 20), pp 515–528
18.
go back to reference Baird L (2016) The swirlds hashgraph consensus algorithm: Fair, fast, byzantine fault tolerance. Swirlds, Inc. Technical Report SWIRLDS-TR-2016, pp 9–11 Baird L (2016) The swirlds hashgraph consensus algorithm: Fair, fast, byzantine fault tolerance. Swirlds, Inc. Technical Report SWIRLDS-TR-2016, pp 9–11
19.
go back to reference Decker C, Seidel J, Wattenhofer R (2016) Bitcoin meets strong consistency. Proceedings of the 17th International Conference on Distributed Computing and Networking, pp 1–10 Decker C, Seidel J, Wattenhofer R (2016) Bitcoin meets strong consistency. Proceedings of the 17th International Conference on Distributed Computing and Networking, pp 1–10
20.
go back to reference Kogias EK, Jovanovic P, Gailly N, Khoffi I, Gasser L, Ford B (2016) Enhancing bitcoin security and performance with strong consistency via collective signing. 25th Usenix Security Symposium (Usenix Security 16), pp 279–296 Kogias EK, Jovanovic P, Gailly N, Khoffi I, Gasser L, Ford B (2016) Enhancing bitcoin security and performance with strong consistency via collective signing. 25th Usenix Security Symposium (Usenix Security 16), pp 279–296
21.
go back to reference Kokoris-Kogias E, Jovanovic P, Gasser L, Gailly N, Syta E, Ford B (2018) Omniledger: A secure, scale-out, decentralized ledger via sharding. 2018 IEEE Symposium on Security and Privacy, pp 583–598 Kokoris-Kogias E, Jovanovic P, Gasser L, Gailly N, Syta E, Ford B (2018) Omniledger: A secure, scale-out, decentralized ledger via sharding. 2018 IEEE Symposium on Security and Privacy, pp 583–598
22.
go back to reference Luu L, Narayanan V, Zheng C, Baweja K, Gilbert S, Saxena P (2016) A secure sharding protocol for open blockchains. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp 17–30 Luu L, Narayanan V, Zheng C, Baweja K, Gilbert S, Saxena P (2016) A secure sharding protocol for open blockchains. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp 17–30
23.
go back to reference Zamani M, Movahedi M, Raykova M (2018) Rapidchain: Scaling blockchain via full sharding. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp 931–948 Zamani M, Movahedi M, Raykova M (2018) Rapidchain: Scaling blockchain via full sharding. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp 931–948
25.
go back to reference Xiong T, Xie T, Xie J, Luo X (2021) Oric: A self-adjusting blockchain protocol with high throughput. 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), pp 1422–1434 Xiong T, Xie T, Xie J, Luo X (2021) Oric: A self-adjusting blockchain protocol with high throughput. 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), pp 1422–1434
26.
go back to reference Aoki Y, Otsuki K, Kaneko T, Banno R, Shudo K (2019) SimBlock: A Blockchain Network Simulator. IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS 2019), pp 325–329 Aoki Y, Otsuki K, Kaneko T, Banno R, Shudo K (2019) SimBlock: A Blockchain Network Simulator. IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS 2019), pp 325–329
27.
go back to reference Pass R, Shi E (2017) Fruitchains: A fair blockchain. Proceedings of the ACM Symposium on Principles of Distributed Computing, pp 315–324 Pass R, Shi E (2017) Fruitchains: A fair blockchain. Proceedings of the ACM Symposium on Principles of Distributed Computing, pp 315–324
28.
go back to reference Abbas N, Zhang Y, Taherkordi A, Skeie T (2017) Mobile edge computing: A survey. IEEE Internet Things J 5(1):450–465CrossRef Abbas N, Zhang Y, Taherkordi A, Skeie T (2017) Mobile edge computing: A survey. IEEE Internet Things J 5(1):450–465CrossRef
29.
go back to reference Sun W, Liu J, Yue Y, Wang P (2020) Joint resource allocation and incentive design for blockchain-based mobile edge computing. IEEE Trans Wirel Commun 19(9):6050–6064CrossRef Sun W, Liu J, Yue Y, Wang P (2020) Joint resource allocation and incentive design for blockchain-based mobile edge computing. IEEE Trans Wirel Commun 19(9):6050–6064CrossRef
30.
go back to reference Yu Y, Liu S, Guo L, Yeoh PL, Vucetic B, Li Y (2020) Crowdr-fbc: A distributed fog-blockchains for mobile crowdsourcing reputation management. IEEE Internet Things J 7(9):8722–8735CrossRef Yu Y, Liu S, Guo L, Yeoh PL, Vucetic B, Li Y (2020) Crowdr-fbc: A distributed fog-blockchains for mobile crowdsourcing reputation management. IEEE Internet Things J 7(9):8722–8735CrossRef
31.
go back to reference Xiong Z, Zhang Y, Niyato D, Wang P, Han Z (2018) When mobile blockchain meets edge computing. IEEE Commun Mag 56(8):33–39CrossRef Xiong Z, Zhang Y, Niyato D, Wang P, Han Z (2018) When mobile blockchain meets edge computing. IEEE Commun Mag 56(8):33–39CrossRef
32.
go back to reference Sompolinsky Y, Zohar A (2015) Secure high-rate transaction processing in bitcoin. Financial Cryptography and Data Security, pp 507–527 Sompolinsky Y, Zohar A (2015) Secure high-rate transaction processing in bitcoin. Financial Cryptography and Data Security, pp 507–527
33.
go back to reference Eyal I, Gencer AE, Sirer EG, VanRenesse R (2016) Bitcoin-ng: A scalable blockchain protocol. Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation, pp 45–59 Eyal I, Gencer AE, Sirer EG, VanRenesse R (2016) Bitcoin-ng: A scalable blockchain protocol. Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation, pp 45–59
34.
go back to reference Sompolinsky Y, Lewenberg Y, Zohar A (2017) Spectre : Serialization of proof-of-work events : Confirming transactions via recursive elections. Cryptology ePrint Archive Sompolinsky Y, Lewenberg Y, Zohar A (2017) Spectre : Serialization of proof-of-work events : Confirming transactions via recursive elections. Cryptology ePrint Archive
35.
go back to reference Sompolinsky Y, Zohar A (2018) Phantom: A scalable blockdag protocol. IACR Cryptol. ePrint Arch. 2018:104 Sompolinsky Y, Zohar A (2018) Phantom: A scalable blockdag protocol. IACR Cryptol. ePrint Arch. 2018:104
36.
go back to reference Li C, Li P, Xu W, Long F, Yao AC-C (2018) Scaling nakamoto consensus to thousands of transactions per second. ArXiv abs/1805.03870 Li C, Li P, Xu W, Long F, Yao AC-C (2018) Scaling nakamoto consensus to thousands of transactions per second. ArXiv abs/​1805.​03870
37.
go back to reference Yu H, Nikolić I, Hou R, Saxena P (2020) Ohie: Blockchain scaling made simple. 2020 IEEE Symposium on Security and Privacy, pp 90–105 Yu H, Nikolić I, Hou R, Saxena P (2020) Ohie: Blockchain scaling made simple. 2020 IEEE Symposium on Security and Privacy, pp 90–105
38.
go back to reference Martino W, Quaintance M, Popejoy S (2018) Chainweb: A proof-of-work parallel-chain architecture for massive throughput Martino W, Quaintance M, Popejoy S (2018) Chainweb: A proof-of-work parallel-chain architecture for massive throughput
40.
go back to reference Fitzi M, Gazi P, Kiayias A, Russell A (2018) Parallel chains: Improving throughput and latency of blockchain protocols via parallel composition. IACR Cryptol. ePrint Arch. 2018:1119 Fitzi M, Gazi P, Kiayias A, Russell A (2018) Parallel chains: Improving throughput and latency of blockchain protocols via parallel composition. IACR Cryptol. ePrint Arch. 2018:1119
41.
go back to reference Kiffer L, Rajaraman R, Shelat A (2018) A better method to analyze blockchain consistency. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp 729–744 Kiffer L, Rajaraman R, Shelat A (2018) A better method to analyze blockchain consistency. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp 729–744
42.
go back to reference Burdges J, Cevallos A, Czaban P, Habermeier R, Hosseini S, Lama F, Alper HK, Luo X, Shirazi F, Stewart A et al (2020) Overview of polkadot and its design considerations. arXiv preprint arXiv:2005.13456 Burdges J, Cevallos A, Czaban P, Habermeier R, Hosseini S, Lama F, Alper HK, Luo X, Shirazi F, Stewart A et al (2020) Overview of polkadot and its design considerations. arXiv preprint arXiv:​2005.​13456
43.
go back to reference Puri GS, Tiwary RK, Shukla S (2019) A review on cloud computing. 2019 9th International Conference on Cloud Computing, Data Science & Engineering (Confluence), pp 63–68 Puri GS, Tiwary RK, Shukla S (2019) A review on cloud computing. 2019 9th International Conference on Cloud Computing, Data Science & Engineering (Confluence), pp 63–68
44.
go back to reference Xie J, Ding Y, Xie T (2008) etc: An algorithm of proof of intelligence (poi) based on random magic square construction Xie J, Ding Y, Xie T (2008) etc: An algorithm of proof of intelligence (poi) based on random magic square construction
45.
go back to reference Pinn K, Wieczerkowski C (1998) Number of magic squares from parallel tempering monte carlo. Int J Mod Phys C 09:541–546CrossRef Pinn K, Wieczerkowski C (1998) Number of magic squares from parallel tempering monte carlo. Int J Mod Phys C 09:541–546CrossRef
46.
go back to reference Xie T, Kang L (2003) An evolutionary algorithm for magic squares. The 2003 Congress on Evolutionary Computation 2:906–913 Xie T, Kang L (2003) An evolutionary algorithm for magic squares. The 2003 Congress on Evolutionary Computation 2:906–913
47.
go back to reference Johnson D, Menezes A, Vanstone S (2001) The Elliptic Curve Digital Signature Algorithm (ECDSA). Int J Inf Secur 1(1):36–63CrossRef Johnson D, Menezes A, Vanstone S (2001) The Elliptic Curve Digital Signature Algorithm (ECDSA). Int J Inf Secur 1(1):36–63CrossRef
48.
go back to reference Garay JA, Kiayias A, Leonardos N (2015) The bitcoin backbone protocol: Analysis and applications. Advances in Cryptology (EUROCRYPT 2015), pp 281–310 Garay JA, Kiayias A, Leonardos N (2015) The bitcoin backbone protocol: Analysis and applications. Advances in Cryptology (EUROCRYPT 2015), pp 281–310
49.
go back to reference Pass R, Seeman L, Shelat A (2017) Analysis of the blockchain protocol in asynchronous networks. IACR Cryptol. ePrint Arch. 2016:454MATH Pass R, Seeman L, Shelat A (2017) Analysis of the blockchain protocol in asynchronous networks. IACR Cryptol. ePrint Arch. 2016:454MATH
50.
go back to reference Eyal I, Sirer EG (2018) Majority Is Not Enough: Bitcoin mining is vulnerable. Commun ACM 61(7):95–102CrossRefMATH Eyal I, Sirer EG (2018) Majority Is Not Enough: Bitcoin mining is vulnerable. Commun ACM 61(7):95–102CrossRefMATH
51.
go back to reference Heilman E, Kendler A, Zohar A, Goldberg S (2015) Eclipse attacks on Bitcoin’s peer-to-peer network. Proceedings of the 24th USENIX Security Symposium, 129–144 Heilman E, Kendler A, Zohar A, Goldberg S (2015) Eclipse attacks on Bitcoin’s peer-to-peer network. Proceedings of the 24th USENIX Security Symposium, 129–144
52.
go back to reference Gervais A, Karame GO, Wüst K, Glykantzis V, Ritzdorf H, Čapkun S (2016) On the security and performance of Proof of Work blockchains. Proceedings of the ACM Conference on Computer and Communications Security 24-28-Octo, 3–16 Gervais A, Karame GO, Wüst K, Glykantzis V, Ritzdorf H, Čapkun S (2016) On the security and performance of Proof of Work blockchains. Proceedings of the ACM Conference on Computer and Communications Security 24-28-Octo, 3–16
Metadata
Title
EVONChain: a bi-tiered public blockchain network architecture
Authors
Yihan Kong
Jing Li
Ting Xiong
Tao Xie
Publication date
22-09-2023
Publisher
Springer US
Published in
Peer-to-Peer Networking and Applications / Issue 6/2023
Print ISSN: 1936-6442
Electronic ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-023-01562-1

Other articles of this Issue 6/2023

Peer-to-Peer Networking and Applications 6/2023 Go to the issue

Premium Partner