Computer Engineering and Applications ›› 2020, Vol. 56 ›› Issue (1): 63-68.DOI: 10.3778/j.issn.1002-8331.1906-0258

Previous Articles     Next Articles

Fair and Efficient Consensus Mechanism:Proof of Minimum

YU Benguo, GONG Shiming, PANG Xiaoqiong, NIE Mengfei, CHEN Wenjun, YANG Ting   

  1. 1.School of Software, North University of China, Taiyuan 030051, China
    2.School of Data Science and Technology, North University of China, Taiyuan 030051, China
    3.Taiyuan Central Sub-Branch, The People’s Bank of China, Taiyuan 030001, China
  • Online:2020-01-01 Published:2020-01-02



  1. 1.中北大学 软件学院,太原 030051
    2.中北大学 大数据学院,太原 030051
    3.中国人民银行 太原中心支行,太原 030001

Abstract: Consensus mechanism is the core of block chain technology, which enables all nodes to verify and record transactions periodically, and to maintain the consistency of block chain data stored by all nodes. Aiming at the two problems of low degree of decentralization and easy temporary branching of public block chain consensus mechanism, a Proof of Minimum(PoM) consensus mechanism based on Hash random selector is proposed, which uses the strong confusion of Hash algorithm to improve the degree of decentralization, and uses the anti-collision ability of Hash algorithm to reduce the probability of temporary bifurcation. Theoretical analysis and experimental results show that PoM not only improves the degree of decentralization, but also reduces the probability of temporary bifurcation.

Key words: consensus mechanism, public block chain, decentralization, temporary branching, proof of minimum

摘要: 共识机制是区块链技术的核心,能够使所有节点周期性地完成交易的验证和记录,且保持所有节点保存的区块链数据的一致。针对目前公有链共识机制的去中心化程度不高和容易临时分叉两个问题,提出一种基于哈希随机选主的最小值证明共识机制(Proof of Minimum,PoM),利用哈希算法的强混淆性提高去中心化程度,利用哈希算法的抗碰撞性降低临时分叉的概率。理论分析和实验结果表明PoM不仅提高了去中心化程度,也降低了临时分叉的概率。

关键词: 共识机制, 公有链, 去中心化, 临时分叉, 最小值证明