Content
@
0 reply
0 recast
2 reactions
EulerLagrange.eth
@eulerlagrange.eth
How sparse merkle trees work: Imagine you have a sorted array of integers, and you want to check if 5 is in it. If I prove to you 4 and 6 are right next to each other, then it’s a proof of the same. So a non-inclusion proof is a combination of two inclusion proofs.
2 replies
4 recasts
34 reactions
hana mari 🎩
@hana1395
333 $degen
0 reply
0 recast
1 reaction
