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.
The intellectual property right of this paper belongs to LD Research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Delegated proof-of-stake consensus. https://bitshares.org/technology/delegated-proof-of-stake-consensus/
EOSIO white paper. https://github.com/EOSIO/Documentation/blob/master/TechnicalWhitePapermd
Ethcore. parity: next generation ethereum browser. https://ethcore.io/parity.html
Ethereum blockchain app platform. https://www.ethereum.org
Hyperledger project. https://www.hyperledger.org/projects/fabric
Ripple. https://ripple.com
Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-68339-9_34
Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173–186 (1999)
Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398–461 (2002)
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)
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_6
King, S., Nadal, S.: PPcoin: peer-to-peer crypto-currency with proof-of-stake. Self-published Paper, 19 August 2012
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)
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)
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)
Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Lamport, L., et al.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)
Larimer, D.: Delegated proof-of-stake (DPOS). Bitshare whitepaper (2014)
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)
Liu, S., Viotti, P., Cachin, C., Quéma, V., Vukolic, M.: XFT: practical fault tolerance beyond crashes. In: OSDI, pp. 485–500 (2016)
McConaghy, T., et al.: BigchainDB: a scalable blockchain database. BigchainDB white paper (2016)
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)
Ongaro, D., Ousterhout, J.K.: In search of an understandable consensus algorithm. In: USENIX ATC, pp. 305–319 (2014)
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)
Rivest, R.L.: The MD5 message-digest algorithm. RFC 1321, pp. 1–21 (1992)
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)
Tsudik, G.: Message authentication with one-way hash functions. In: INFOCOM, pp. 2055–2059 (1992)
Vasin, P.: Blackcoin’s proof-of-stake protocol v2 (2014). https://blackcoin.co/blackcoin-pos-protocolv2-whitepaper.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, P., Peng, J., Yang, L., Zheng, Q., Pan, G. (2018). Crux—A New Fast, Flexible and Decentralized Consensus Algorithm with High Fault Tolerance Rate. In: Qiu, M. (eds) Smart Blockchain. SmartBlock 2018. Lecture Notes in Computer Science(), vol 11373. Springer, Cham. https://doi.org/10.1007/978-3-030-05764-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-05764-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05763-3
Online ISBN: 978-3-030-05764-0
eBook Packages: Computer ScienceComputer Science (R0)