MBFT: A New Consensus Algorithm for Consortium Blockchain

Mingxiao Du,Xiaofeng Ma,Qijun Chen

doi:10.1109/access.2020.2993759

Mingxiao Du, Xiaofeng Ma + Show 1 more

Open Access

https://doi.org/10.1109/access.2020.2993759

Copy DOI

Abstract

Blockchain technology is an emerging distributed ledger technology that has exploratory applications in many areas. The consensus algorithm, as the core module of the blockchain, has an important impact on the security, scalability, and efficiency of the blockchain network. The consensus algorithm is also a popular topic in current blockchain technology research. In existing consortium blockchains and public blockchains, the blockchain has low efficiency or poor fault tolerance because of the limitations of the consensus algorithm. To both ensure the fault tolerance of the blockchain and improve the scalability and throughput, in this paper, we propose a new type of consensus algorithm: mixed Byzantine fault tolerance (MBFT). MBFT uses sharding and layered technology. MBFT functionally partitions the nodes that participate in the consensus process and improves the scalability and efficiency without sacrificing security. MBFT also introduces a random node selection mechanism and a credit mechanism to improve security and fault tolerance. We analyze the security and experiment on transaction throughput in a real network environment. The results prove that MBFT has good security and scalability and high throughput.

Highlights

The consensus algorithm is the core technology of the blockchain
DESIGN OF mixed Byzantine fault tolerance (MBFT) CONSENSUS ALGORITHM There is a large difference between consortium blockchains and public blockchains
To improve the transactions per second (TPS) of the consortium blockchain and to consider fault tolerance, this paper proposes a new consensus algorithm - Mixed Byzantine fault tolerant (MBFT)

Summary

INTRODUCTION

The consensus algorithm is the core technology of the blockchain. The consensus algorithm is a set of mechanisms that are designed to ensure the accuracy and consistency of the data stored. Kokoris-Kogias et al optimized the basis of Byzcoin and merged protocols, such as RandHound, therein proposing OmniLedger [14] These algorithms retain the PoW consensus, require a certain amount of hashing power to ensure security, and need to solve the problems of distrust and competition among nodes. Due to the openness of the public blockchain, the system must adopt an economic incentive to attract nodes to participate in transaction verification These algorithms are not very suitable for consortium blockchain. The consensus mechanism based on PBFT is currently mostly used in the consortium blockchain This makes it necessary to communicate multiple times between two nodes to confirm a transaction. In MBFT, we assign nodes to different consensus groups and design the new transaction verification and fault-tolerant algorithm for each consensus group.

BACKGROUND

CONSENSUS IN LCG

CONCLUSIONS