Research On Consensus Algorithm Based On Time Weight Value

Consensus algorithms are an important part of the blockchain.The establishment of a consensus algorithm requires not only a reasonable selection of consensus nodes but also a perfect consensus mechanism.The consensus algorithms Po W(Proof of Work)and Po S(Proof of Stake)consensus algorithms used in existing blockchain networks are proof of computing power and assets.This proof method based on competition between nodes not only limits the vitality of the blockchain network but also greatly restricts ordinary nodes from joining the consensus network and raises the threshold for nodes to join the blockchain network.Although the consensus algorithm Po S(Proof of Share)and DPo S(Delegated Proof of Stake)have improved the generation speed of consensus nodes and the TPS of transactions,there is still a large delay in the speed of data synchronization and data query.The TWV(Time Weight Value)consensus algorithm not only achieves the characteristics of low latency in the generation of consensus nodes but also enables the selected 101 consensus nodes to have higher data storage capacity than nodes in other algorithms.This advantage not only reduces the delay of node consensus,and can provide information broadcasting and data synchronization services to ordinary nodes.The TWV consensus mechanism uses the node with the largest time weight value as the basis for selecting the consensus node so that the entire consensus network has the characteristics of the largest data volume and low delay.To prevent the generation of malicious Leader nodes(nodes that generate new blocks),Leader nodes are supervised through a consensus node committee-based mechanism.Through the network sharding and transaction sharding combined with the time weight value of the consensus node,the node sharding method based on the number of visits is proposed,which realizes the scalability of the blockchain network and improves the data query speed between nodes.It is proved by experiments that the TPS of the consensus algorithm proposed in this paper is 1160tx/s;the query speed is 10 times that of the PBFT consensus algorithm;the delay of ordinary nodes for information query is small,and the node sharding based on the number of visits is adopted to make data query faster It is further improved by 2times;with the participation of 101 consensus nodes,the TWV consensus algorithm can reach a consensus on 4MB of transaction information within 2.6s.