1. Which of the following statements about hash pointers is incorrect: A. A hash pointer gives you a way to retrieve the information. B. A hash pointer gives you a way to verify that the information hasn't been changed. C. In the blockchain, if an attacker tampers a block without modifying other blocks, then we cannot detect the change. D. In the blockchain, the head of the list is a regular hash‐pointer that points to the most recent data block.
1. Which of the following statements about hash pointers is incorrect:
A. A hash pointer gives you a way to retrieve the information.
B. A hash pointer gives you a way to verify that the information hasn't been changed.
C. In the blockchain, if an attacker tampers a block without modifying other blocks, then we cannot detect the change.
D. In the blockchain, the head of the list is a regular hash‐pointer that points to the most recent data block.
2. Which of the following statements about the Merkle tree is incorrect:
A. Merkle tree can be considered as a binary tree of hash pointers.
B. A node in a Merkle tree can have more than two children.
C. In the Merkle tree, it takes O(log n) for the proof of membership, where n is the number of nodes in the tree.
D. We can use hash pointers in any pointer‐based data structure as long as the data structure doesn’t have cycles.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
