Score:0

Zero Knowledge Proof for Merkle Tree Update

ve flag

I have a Merkle tree that contains the balances of users in each leaf. Periodically, users are paid more, and their corresponding Merkle leaves are updated, which results in a new Merkle root.

Is it possible to use a zero-knowledge proof to verify that between two Merkle roots:

a) No individual leaf (user balance) was decreased

b) The sum of all leaves increased by a known amount

The goal is to prevent a scenario where I can pay an arbitrarily large amount to myself. If I can't reduce the balance of any leaf, the only way to pay myself would be to add to my own leaf. And if the sum can only increase by a known amount, that becomes the maximum I can allocate to myself without detection.

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.