New answers tagged

3

If you don't use a merkle tree then checking membership is an O(n) operation, as opposed to O(log n) with a merkle tree. Instead of going through each item in the set, you walk up one branch of the merkle tree which has O(log n) depth. Though, without sorting, proving non-membership still requires O(n) steps. Sorting makes it possible to prove non-membership ...


0

Well, the ADRS structure is an 32 byte structure, organized as 8 4-byte words. It looks like: +--------------------+ | Layer address | +--------------------+ | Tree address | | (3 words) | | | +--------------------+ | Type | +--------------------+ | Keypair address | +-------------...


Top 50 recent answers are included