Author: Bram Cohen 2017-04-03 03:13:52
Published on: 2017-04-03T03:13:52+00:00
The discussion on the scalability of Bitcoin transactions continued on the bitcoin-dev mailing list where praxeology_guy highlighted that using spentness bits scales linearly in comparison to swapping digest leafs with empties which can scale logarithmically increasing storage requirements. The limitation of 8 to 12 layers corresponds to an MMR proof length of 512 to 768 bytes if a 32 byte hash and spentness bits are used. In response to this, a participant explained that making the memory commitments smaller would increase CPU requirements and proof size, so it would be reasonable to make MMRs of the bitfield or insertion index data structure but they aren't needed immediately if ever. Full nodes can cache the top bunch of layers to make the proofs smaller or remember a root per block for all the insertions contained therein.
Updated on: 2023-06-11T23:27:47.812305+00:00