Author: Chris Pacia 2017-03-26 14:16:15
Published on: 2017-03-26T14:16:15+00:00
On March 25, 2017, Luke Dashjr asked for ideas in the bitcoin-dev mailing list. He proposed a solution where the size can be aggregated up the tree such that each midstate hash is the hash of branches below plus the aggregate of the sizes below. This would result in the root hash being (left + right + size/weight), and the proof would simply be the preimage.
Updated on: 2023-06-11T22:26:40.434079+00:00