Topic: Improved Measurement of Proof-of-Work using entropy - page 2. (Read 299 times)
This paper POEM: Proof-of-Entropy-Minima (https://arxiv.org/abs/2303.04305) was just published to arxiv. It seems like a much better way to measure the heaviest chain tip as well as minimize time to resolve orphans. It can instantaneously resolve 67% of orphans rather than having to wait for the next block. Additionally, it seems to have better finalization time guarantees for a given hash. Also, it has an equation that relates to finalization that would create objective measurable preference between different hash functions.
Jump to: