Nakamoto consensus has been incredibly influential in enabling robust blockchain systems, and one of its components is the so-called heaviest chain rule (HCR). Within this rule, the calculation of the weight of the chain tip is performed by adding the difficulty threshold value to the previous total difficulty. Current difficulty based weighting systems do not take the intrinsic block weight into account. This paper studies a new mechanism based on entropy differences, named proof of entropy minima (POEM), which incorporates the intrinsic block weight in a manner that significantly reduces the orphan rate of the blockchain while simultaneously accelerating finalization. Finally, POEM helps to understand blockchain as a static time-independent sequence of committed events.

翻译：摘要：中本聪共识在支撑稳健区块链系统中发挥了极为深远的影响，其核心组件之一即为所谓的“最长链规则”（HCR）。在该规则下，链尖端权重的计算是通过将难度阈值累加至先前总难度来实现的。现有的基于难度的权重系统并未考虑区块的内在权重。本文研究了一种基于熵差异的新机制，称为“熵最小值证明”（POEM），该机制通过纳入区块内在权重，在显著降低区块链孤块率的同时，加速了最终确认过程。最后，POEM有助于将区块链理解为一种与时间无关的静态已提交事件序列。