Choose the correct option(s): Modifying a leaf node in a Merkle tree will result in O(k) changes to a table of depth k A Merkle tree to store 1024 unique elements will have a total of 211-1 nodes The maximum number of hashes to be computed to verify proof for a Merkle tree of 1024 elements is 11. None of the given options
Answers
Answered by
0
Answer:
none of the these
Explanation:
Similar questions
Biology,
5 months ago
Math,
5 months ago
Accountancy,
5 months ago
Psychology,
11 months ago
Hindi,
1 year ago
Hindi,
1 year ago
Math,
1 year ago