Skip to main content
Top

2018 | OriginalPaper | Chapter

Crux—A New Fast, Flexible and Decentralized Consensus Algorithm with High Fault Tolerance Rate

Authors : Pengfei Li, Jingtian Peng, Long Yang, Qian Zheng, Gang Pan

Published in: Smart Blockchain

Publisher: Springer International Publishing

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

search-config
loading …

Abstract

This paper presents Crux, a new permissionless blockchain consensus algorithm that achieves higher fault tolerance rate with more flexibility than existing blockchains such as Bitcoin, Ethereum and EOS. Crux utilize a DPoS-XPaxos pipelined algorithm to achieve effective and efficient consensus. Those who hold tokens in Crux elect \(2f+1\) block producers called validators through a continuous approval voting system. The elected validators are scheduled in an order and produce blocks in turns agreed by all of the validators. XPaxos, guarantees \(\frac{f}{2f+1}\) fault tolerance rate, is added to traditional DPoS to confirm blocks. Once \(f+1\) validators have signed a block, it is deemed irreversible. Analysis shows Crux provides higher securities, better flexibility, higher TPS (transaction per second) with little cost of centralization compared with existing blockchain consensus algorithms.

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!

Literature
8.
go back to reference Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173–186 (1999) Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173–186 (1999)
9.
go back to reference Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398–461 (2002)CrossRef Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398–461 (2002)CrossRef
10.
go back to reference Clement, A., Wong, E.L., Alvisi, L., Dahlin, M., Marchetti, M.: Making byzantine fault tolerant systems tolerate byzantine faults. In: NSDI, pp. 153–168 (2009) Clement, A., Wong, E.L., Alvisi, L., Dahlin, M., Marchetti, M.: Making byzantine fault tolerant systems tolerate byzantine faults. In: NSDI, pp. 153–168 (2009)
11.
go back to reference Hopkins, A.L., Lala, J.H., Smith, T.B.: The evolution of fault tolerant computing at the Charles Stark Draper laboratory, 1955–85. In: Avižienis, A., Kopetz, H., Laprie, J.C. (eds.) The Evolution of Fault-Tolerant Computing. DEPENDABLECOMP, vol. 1, pp. 121–140. Springer, Vienna (1987). https://doi.org/10.1007/978-3-7091-8871-2_6CrossRef Hopkins, A.L., Lala, J.H., Smith, T.B.: The evolution of fault tolerant computing at the Charles Stark Draper laboratory, 1955–85. In: Avižienis, A., Kopetz, H., Laprie, J.C. (eds.) The Evolution of Fault-Tolerant Computing. DEPENDABLECOMP, vol. 1, pp. 121–140. Springer, Vienna (1987). https://​doi.​org/​10.​1007/​978-3-7091-8871-2_​6CrossRef
12.
go back to reference King, S., Nadal, S.: PPcoin: peer-to-peer crypto-currency with proof-of-stake. Self-published Paper, 19 August 2012 King, S., Nadal, S.: PPcoin: peer-to-peer crypto-currency with proof-of-stake. Self-published Paper, 19 August 2012
13.
go back to reference Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: USENIX Security, pp. 279–296 (2016) Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: USENIX Security, pp. 279–296 (2016)
14.
go back to reference Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1–7:39 (2009)CrossRef Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1–7:39 (2009)CrossRef
15.
go back to reference Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. ACM SIGOPS Oper. Syst. Rev. 41(6), 45–58 (2007)CrossRef Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. ACM SIGOPS Oper. Syst. Rev. 41(6), 45–58 (2007)CrossRef
16.
go back to reference Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)CrossRef Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)CrossRef
17.
go back to reference Lamport, L., et al.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001) Lamport, L., et al.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)
18.
go back to reference Larimer, D.: Delegated proof-of-stake (DPOS). Bitshare whitepaper (2014) Larimer, D.: Delegated proof-of-stake (DPOS). Bitshare whitepaper (2014)
19.
go back to reference Li, C., Li, P., Xu, W., Long, F., Yao, A.C.: Scaling Nakamoto consensus to thousands of transactions per second. CoRR abs/1805.03870 (2018) Li, C., Li, P., Xu, W., Long, F., Yao, A.C.: Scaling Nakamoto consensus to thousands of transactions per second. CoRR abs/1805.03870 (2018)
20.
go back to reference Liu, S., Viotti, P., Cachin, C., Quéma, V., Vukolic, M.: XFT: practical fault tolerance beyond crashes. In: OSDI, pp. 485–500 (2016) Liu, S., Viotti, P., Cachin, C., Quéma, V., Vukolic, M.: XFT: practical fault tolerance beyond crashes. In: OSDI, pp. 485–500 (2016)
21.
go back to reference McConaghy, T., et al.: BigchainDB: a scalable blockchain database. BigchainDB white paper (2016) McConaghy, T., et al.: BigchainDB: a scalable blockchain database. BigchainDB white paper (2016)
22.
go back to reference Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008) Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)
23.
go back to reference Ongaro, D., Ousterhout, J.K.: In search of an understandable consensus algorithm. In: USENIX ATC, pp. 305–319 (2014) Ongaro, D., Ousterhout, J.K.: In search of an understandable consensus algorithm. In: USENIX ATC, pp. 305–319 (2014)
24.
go back to reference Paulitsch, M., Morris, J., Hall, B., Driscoll, K., Latronico, E., Koopman, P.: Coverage and the use of cyclic redundancy codes in ultra-dependable systems. In: DSN, pp. 346–355 (2005) Paulitsch, M., Morris, J., Hall, B., Driscoll, K., Latronico, E., Koopman, P.: Coverage and the use of cyclic redundancy codes in ultra-dependable systems. In: DSN, pp. 346–355 (2005)
25.
go back to reference Rivest, R.L.: The MD5 message-digest algorithm. RFC 1321, pp. 1–21 (1992) Rivest, R.L.: The MD5 message-digest algorithm. RFC 1321, pp. 1–21 (1992)
26.
go back to reference Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRef Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRef
27.
go back to reference Tsudik, G.: Message authentication with one-way hash functions. In: INFOCOM, pp. 2055–2059 (1992) Tsudik, G.: Message authentication with one-way hash functions. In: INFOCOM, pp. 2055–2059 (1992)
Metadata
Title
Crux—A New Fast, Flexible and Decentralized Consensus Algorithm with High Fault Tolerance Rate
Authors
Pengfei Li
Jingtian Peng
Long Yang
Qian Zheng
Gang Pan
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-030-05764-0_7

Premium Partner