Author: Peter Todd 2017-02-23 07:23:10
Published on: 2017-02-23T07:23:10+00:00
The bitcoin-dev community is discussing the possibility of implementing a cryptographic data structure that improves on delayed TXO commitments by using lazy hashing. The proposed data structure would substitute commitments for pointers, allowing for the combination of a cryptographic data structure and a standard pointer-based data structure. The main challenge lies in how to handle the proofs, as the level of verification possible depends on what digests a given node has calculated. This approach only works for data structures where the overall structure of the tree does not change as nodes are added and updated.
Updated on: 2023-06-11T21:36:36.252451+00:00