Author: Ruben Somsen 2022-07-19 22:23:40
Published on: 2022-07-19T22:23:40+00:00
In this email exchange, Ruben explains a merkle sum tree that can be used to burn multiple amounts in a single OP_RETURN and specifically indicate how much of the total is intended for what use case. Ruben presents two examples of merkle sum trees where the root hash is calculated by hashing the leaf nodes' values together recursively until only one hash remains. This ensures that you can't create a valid tree with commitments that add up to more than the burned amount (essentially a "double spend"). ZmnSCPxj raises concerns about the commitment scheme's atomicity issue and the risk being moved to the seller side. However, Ruben argues that assuming the opening of the commitment is actually what has value (since the lack of such an opening means the buyer cannot prove the commitment), then the buyer has every incentive to actually pay.
Updated on: 2023-06-15T22:58:31.533400+00:00