| Blockchain technology was proposed as the bottom technology of digital currency at first.Most blockchain projects use chain storage structure to store blocks.This blockchain project ensures the tamper ability of blockchain to a large extent,and can accomplish the work of traditional centralized organization at lower cost.In order to reach a consensus among distributed nodes,traditional blockchain projects need to carry out mathematical calculation such as hash value.These work lead to the generation and confirmation of each new block in blockchain network far exceeds the traditional centralized system.Therefore,traditional blockchain projects cannot be applied to the application environment with high requirements for parallelism,such as financial transactions,Internet of vehicles and other fields.At first,Po W workload proves that consensus algorithm is used in many fields,but Po W consensus algorithm consumes a lot.Therefore,the consensus algorithm of Po S equity proof is proposed to solve the problem of resource consumption of pow consensus algorithm.DPo S consensus algorithm,as an improved algorithm of Po S consensus algorithm,solves the problem of inactive high equity nodes in the Po S consensus algorithm.But the improved block chain consensus algorithm based on workload proof algorithm adopts chain storage structure.The transaction confirmation efficiency of blockchain project with this block organization structure is not high,and it cannot be handled in time when there are many transactions in the network.Some blockchain consensus algorithms choose to adopt directed acyclic graph structure.The block chain consensus algorithm with directed acyclic graph structure is not easy to generate branch problems in chain storage structure,such as block chain consensus algorithms such as Tangle,Nano,etc.it can realize concurrent generation and block confirmation while avoiding a large number of branches in the network.In TGA consensus algorithm,this paper proposes that block structures in directed acyclic graph structure are classified according to different transaction roles.The nodes in TGA consensus algorithm are divided into two parties,verification user group and synchronous user.Each user in the blockchain can be the verification user group or synchronous user.According to the data structure of TGA consensus algorithm,the transaction between single user and different user can be executed in parallel or transaction between users in blockchain.At the same time,the verification of user group does not need to carry out complex mathematical calculation in the process of verification,and only a small amount of hash calculation is needed to complete block verification.At the same time,TGA consensus algorithm is compared with the mainstream blockchain consensus algorithm in blockchain branch,resource consumption,parasitic chain,garbage transaction,transaction efficiency and other aspects.In this paper,through experiments,the feasibility verification of TGA consensus algorithm is completed,and the block generation process is completed.By comparing the single user parallel with multi-user parallel,the efficiency of single node parallel transaction of TGA consensus algorithm is higher than that of multi node parallel transaction.Compared with Io TA and Nano consensus algorithm,there are less verification nodes in blockchain network,It can ensure the stability of transaction efficiency.In TGA consensus algorithm,a small number of active nodes can complete block verification in the network.Therefore,TGA consensus algorithm has higher ability to deal with a large number of parallel transactions in the network.TGA consensus algorithm can achieve less resource consumption,higher security and transaction efficiency,and has the advantages of real-time and concurrency,thus achieving higher stability and transaction confirmation efficiency. |
PDF Full Text Request