Score:0

Proof of inclusion for odd-valued tree

ao flag

How would a proof of inclusion be done here as the number of nodes is odd and some hashes don't have a sibling hash? Normally you would send the sibling for each level to the client.

Here there are none, is the proof of inclusion not possible here, or do you just send the parent, until you reach a node that has a sibling? But what would the client calculate then?

kelalaka avatar
in flag
Are we talking about the Merkle Trees?
Yoinkers McGee avatar
ao flag
Yes merkle tree.
kelalaka avatar
in flag
I'm lazy to draw a figure, however, if you look at a heap ( a special binary tree), it is easy to achieve a Merkle tree of size not equal to $2^n$ for some integer $n$.
I sit in a Tesla and translated this thread with Ai:

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.