Bitcoin Takeover / BIPs / BIP 98
BIP 98
Fast Merkle Trees
Draft Draft Consensus (soft fork) Specification Assigned 2017-08-24
From the BIP’s abstract
In many applications it is useful to prove membership of a data element in a set without having to reveal the entire contents of that set. The Merkle hash-tree, where inner/non-leaf nodes are labeled with the hash of the labels or values of its children, is a cryptographic tool that achieves this goal. Bitcoin uses a Merkle hash-tree construct for committing the transactions of a block into the block header. This particular design, created by Satoshi, suffers from a serious flaw related to duplicate entries documented in the National Vulnerability Database as CVE-2012-2459[1], and also suffers from less than optimal performance due to unnecessary double-hashing. This Bitcoin Improvement…
Read BIP 98 on GitHubFind in explorer