The Future of Blockchain 4.0
https://goo[add a dot here]gl/yCECzv
We are making another history of success!
https://i.pinimg.com/originals/3a/f4/4f/3af44fe32bd22db6c8a4a3f93f727fa6.jpg
TraceChainThe Chain System will synthesizes the advantages and disadvantages of current mainstream consensus algorithms, and proposes a new ε-differential agreement (EDA) based on “micro-real numbers”, which transform the consensus problem into an asynchronous request processing and sorting of data in large-scale environment, and has a very strong robustness for the overall connectivity of the network, for non-fully connected networks, and even each network connection is less than 50% of the proportion of the system can operate normally. One of the most important features of the consensus algorithm is the linear scalability, that is, the performance increases linearly with the node size. The larger the node size, the faster convergence and the better performance. In the 100K node network environment, TPS reached 100K, the transaction confirmation delay decreased to several seconds.
The current consensus algorithms are not compatible with Scalability, Security and Efficiency, forming an SSE paradox. Such as PoW, to meet the scalability and safety requirements, but the computational overhead; PoS meets the requirements of efficiency but is deficient in scalability and security; DPoS meets the requirements of scalability and efficiency, but has insufficient security; pBFT meets the requirements of security and power consumption, but when the node size is very large, the problem of network overhead becomes very prominent. Hashgraph meets the requirements of scalability and efficiency, but has insufficient security, and due to its structural and process constraints, such as the connectivity and partition of network nodes, the Seele 7 confirmation delay of some transactions is relatively large; Algorand meets the requirements of scalability, security and power consumption, but has strict requirements on the overall connectivity of the network, convergence delay becomes unpredictable in the case of network partition.
Security purposesFor the Sybil attack, according to the currency value held by the consensus users, assign weights to them and use multiple local random sampling step by step features to cover as long as the Sybil node has a total monetary value of less than half of the total value, To the chain algorithm on the Sybil attack has the absolute resistance and immunity, to avoid the bifurcation and double spend. For the random selection of nodes in the consensus process, the metamethod uses a random computable function, and the user calculates from his private key whether or not it is selected and feeds back and broadcast the result to other Users, this random selection process is non-interactive, the attacker could not know in advance which nodes are selected. During each round of consensus, the nodes in the selection are all random and different, which also increases the cost and cost of the attack.
Lets make a different by changing the world for the better!
