Merkle Tree-Based Transaction Verification BDC Practice Questions (Page 2)

Questions 6–10

1. 6application · medium

   A developer is building a Merkle tree from a list of transactions. The developer hashes each transaction to create leaf nodes. What is the primary reason for hashing the transactions before building the tree?

   • ATo encrypt the transactions so they cannot be read.
   • BTo reduce the size of each transaction to a fixed-length hash.
   • CTo compress the transactions for storage.
   • DTo sort the transactions in a specific order.
   Reveal Solution Discussion Select an answer first
2. 7expert · medium

   A blockchain platform stores 1,048,576 transactions per block. A developer must design a proof service that minimizes bandwidth for clients verifying a single transaction. The service can precompute and cache data. Which strategy provides the lowest bandwidth for a single inclusion proof?

   • ASend the entire block to the client.
   • BSend the Merkle path of 20 sibling hashes.
   • CSend the transaction hash and the block header.
   • DSend all leaf hashes in the block.
   Reveal Solution Discussion Select an answer first
4. 8foundation · easy

   In a Merkle tree with 8 transactions, how many sibling hashes are required in the Merkle path for one transaction?

   • A4
   • B7
   • C3
   • D8
   Reveal Solution Discussion Select an answer first
5. 9foundation · easy

   How is a parent node generated from two child nodes in a Merkle tree?

   • ABy hashing each child separately and then adding the two hashes together.
   • BBy concatenating the two child hashes and then hashing the concatenated result.
   • CBy XORing the two child hashes and then hashing the result.
   • DBy taking the larger of the two child hashes and hashing it.
   Reveal Solution Discussion Select an answer first
6. 10foundation · easy

   What is the Merkle root in a blockchain block?

   • AThe single hash that represents all transactions in the block.
   • BThe first transaction hash in the block.
   • CThe hash of the last transaction in the block.
   • DThe hash of the block header excluding the transactions.
   Reveal Solution Discussion Select an answer first