FREE Blockchain Developer Consensus Algorithms and Protocols Questions and Answers Flashcards
6 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 6 FREE Blockchain Developer Consensus Algorithms and Protocols Questions and Answers flashcards as text
What mechanism does Delegated Proof of Stake (DPoS) use to achieve consensus?
Answer: Token holders vote for a fixed number of delegates who validate blocks
DPoS allows token holders to elect a limited set of delegates responsible for producing blocks and validating transactions.
Which consensus algorithm is specifically designed to tolerate up to one-third of nodes acting maliciously?
Answer: Practical Byzantine Fault Tolerance (PBFT)
PBFT can tolerate up to f Byzantine faulty nodes in a network of 3f+1 total nodes, meaning it handles just under one-third malicious participants.
In Proof of Stake systems, what is the primary risk that slashing conditions are designed to prevent?
Answer: Validators signing conflicting blocks or performing equivocation
Slashing penalizes validators who sign two different blocks at the same height or otherwise act dishonestly, deterring equivocation.
What is the key advantage of the Nakamoto consensus used in Bitcoin compared to classical BFT protocols?
Answer: It supports an open and permissionless set of participants
Nakamoto consensus allows any node to join or leave the network freely, making it suitable for open permissionless blockchains.
In the Raft consensus algorithm, what happens when a follower node does not receive a heartbeat from the leader within the election timeout?
Answer: It becomes a candidate and initiates a new leader election
When a follower's election timeout elapses without receiving a heartbeat, it transitions to candidate state and starts a new election term.
What problem does the Longest Chain Rule solve in Proof of Work blockchains?
Answer: It resolves temporary forks by having nodes adopt the chain with the most cumulative work
The longest chain rule ensures that when forks occur, nodes converge on the chain representing the greatest cumulative proof of work.