Search

The rapid development of blockchain technology has given rise to many applications like digital currency. Building a consortium blockchain for a bidding system is a promising way to benefit the bidding businesses, by reducing cost and sharing data among tenderers and bidders. Generally, Practical Byzantine Fault Tolerance (PBFT) algorithm is the wide-ly-used consensus algorithm in a consortium blockchain. However, this algorithm meets its bottleneck, when there are a large number of nodes in the consortium blockchain net-work. In order to enhance the scalability of the consensus algorithm, this paper puts for-ward an advanced PBFT-based consensus algorithm, named ANPBFT, by taking ad-vantages of the message aggregation technology and tree topology technology. Specially, the consensus nodes in our proposed algorithm are divided into active nodes and passive nodes. Then, the consensus of block information is equivalent to the confirmation of iden-tity aggregation signature and aggregation promise of information key. The experimental results show that our proposed algorithm has better performance than the original PBFT algorithm. It also shows good scalability and can be used in a large-scale license-chain system.