Core Blockchain Data Structures Flashcards
7 cards from real Blockchain Technology practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 7 Core Blockchain Data Structures flashcards as text
What does the Merkle root in a block header summarize?
Answer: All transactions in the block
The Merkle root is a single hash representing every transaction included in that block.
Which field is NOT typically part of a Bitcoin block header?
Answer: The full list of transactions
Transactions are stored in the block body, while the header holds only summary metadata like the Merkle root.
What is a Patricia Merkle Trie used for in Ethereum?
Answer: Storing account state and enabling efficient state proofs
Ethereum uses Patricia Merkle Tries to store and prove account state, storage, and transaction data efficiently.
What makes a hash function suitable as a blockchain building block?
Answer: It is one-way and collision-resistant
Blockchain hash functions must be one-way and collision-resistant so outputs cannot be forged or reversed.
In a Merkle tree, how many hashes must an SPV client receive to prove inclusion in a tree of N transactions?
Answer: Approximately log2(N)
A Merkle proof requires only about log2(N) sibling hashes to reconstruct the root path.
What is the genesis block?
Answer: The first block in a blockchain with no predecessor
The genesis block is the very first block and is the only one without a reference to a previous block.
Why are hashes preferred over plaintext for linking blocks?
Answer: Fixed-length output that uniquely fingerprints variable data
Hashes give a compact, fixed-size fingerprint of arbitrary data, ideal for compact and verifiable links.