A large number of consensus algorithms have been proposed. However, the requirement of strict consistency limits their wide adoption, especially in high-performance required systems. In this paper, we propose a weak consensus algorithm that only maintains the consistency of relative positions between the messages. We apply this consensus algorithm to construct a high-performance blockchain system, called \textit{Sphinx}. We implement the system with 32k+ lines of code including all components like consensus/P2P/ledger/etc. The evaluations show that Sphinx can reach a peak throughput of 43k TPS (with 8 full nodes), which is significantly faster than current blockchain systems such as Ethereum given the same experimental environment. To the best of our knowledge, we present the first weak consensus algorithm with a fully implemented blockchain system.
翻译:提出了大量协商一致算法,然而,严格一致的要求限制了这些算法的广泛采用,特别是在高性能要求的系统中。在本文件中,我们提出一个弱性共识算法,它只能维持电文之间相对立场的一致性。我们用这种协商一致算法来建立一个高性能的块链系统,称为\ textit{Sphinx}。我们用32k+的代码行来实施这个系统,包括所有组成部分,如共识/P2P/Ledger/etc。评价表明,Sphinx能够达到43kTPS(8个全节)的最高通过量,大大快于Ethereum(Ethereum)等现有块链系统,以同样的实验环境。我们最了解的是,我们用一个完全执行的块链系统来展示第一个弱的协商一致算法。