Abstract: Aiming at the problem that the traditional blockchain consensus algorithms had low efficiency and waste of a lot of resources, we proposed an algorithm that used the directed acyclic graph data structure based on ID classification to replace the traditional blockchain’s chain data structure, which solved the problem that the traditional blockchain project could confirm a large number of transactions in a short time. The proposed algorithm used the data structure of directed acyclic graph based on ID classification could reach a consensus more simply, and this data structure was more suitable for multi-user transaction confirmation at the same time. The proposed consensus algorithm could confirm transactions in a shorter time than traditional blockchain projects, which saved a lot of hardware resources and improved the processing efficiency of blockchain transactions.

Key words: blockchain, consensus algorithm, proof of work (PoW), proof of stake (PoS), practical Byzantine fault tolerance (PBFT)