Quiz: Alternative Consensus Mechanisms
Multiple Choice
1. The blockchain trilemma states that a blockchain can optimize for at most two of which three properties?
a) Speed, cost, and privacy b) Decentralization, security, and scalability c) Throughput, finality, and interoperability d) Consensus, execution, and data availability
Answer: b) The blockchain trilemma, articulated by Vitalik Buterin, holds that decentralization, security, and scalability are the three properties, and achieving all three simultaneously requires fundamental compromises. This is an empirical observation about current technology, not a mathematical impossibility proof.
2. In EOS's Delegated Proof of Stake system, how many active block producers validate transactions?
a) 100 b) 51 c) 27 d) 21
Answer: d) EOS uses exactly 21 active block producers, elected by token holders through stake-weighted voting. This small number enables fast block production (0.5-second intervals) but creates centralization concerns. Tron uses a similar model with 27 Super Representatives.
3. What is the primary advantage of Tendermint/CometBFT consensus over Proof of Work?
a) It requires no validators at all b) It provides instant (deterministic) finality c) It can support an unlimited number of validators d) It uses a DAG data structure
Answer: b) Tendermint provides instant finality: once a block receives pre-commits from validators representing more than two-thirds of total stake, it is permanently final. No additional confirmations are needed, and no chain reorganization is possible. This contrasts with PoW's probabilistic finality, which requires multiple confirmations.
4. What is the message complexity per round in classical PBFT with n validators?
a) O(log n) b) O(n) c) O(n log n) d) O(n^2)
Answer: d) Classical PBFT requires every validator to communicate with every other validator during the prepare and commit phases, resulting in O(n^2) message complexity. This is why PBFT does not scale to large validator sets. HotStuff improved this to O(n) by routing votes through the leader.
5. What distinguishes IOTA's Tangle from a traditional blockchain?
a) It uses Proof of Stake instead of Proof of Work b) It uses a DAG structure where each transaction references two previous transactions instead of blocks in a linear chain c) It has no transaction fees but requires validators to stake tokens d) It uses a patented gossip-about-gossip protocol
Answer: b) The Tangle is a Directed Acyclic Graph where each new transaction references (approves) two previous transactions. There are no blocks, no miners, and no transaction fees. Users contribute to network security by verifying previous transactions when they submit their own. Option d) describes Hedera Hashgraph, not IOTA.
6. Solana's Proof of History is best described as:
a) A consensus mechanism that replaces Proof of Stake b) A mining algorithm that uses sequential hashing c) A cryptographic clock that establishes time ordering before consensus d) A DAG-based data structure for parallel transaction processing
Answer: c) Proof of History is not a consensus mechanism itself — it is a clock. It uses a sequential SHA-256 hash chain to create a verifiable, ordered record of events. Solana's actual consensus mechanism is Tower BFT, which leverages the PoH clock to reduce messaging overhead and enable high throughput.
7. Hedera Hashgraph's "gossip-about-gossip" protocol achieves consensus without explicit vote messages by:
a) Using Proof of Work to resolve conflicts b) Having each node compute how other nodes would have voted based on the communication history c) Requiring all nodes to connect to a central coordinator d) Using sequential hashing to order transactions
Answer: b) In Hashgraph, the gossip-about-gossip protocol creates a complete record of the communication history across all nodes. Each node can then perform "virtual voting" — calculating how every other node would have voted based on what it knew at each point in time. No actual vote messages need to be transmitted, which reduces communication overhead.
8. What is the main practical problem that undermined DPoS governance in EOS?
a) Block producers could not keep up with transaction volume b) Vote buying, voter apathy, and cartel formation among block producers c) The consensus algorithm had a critical security vulnerability d) Token holders refused to participate because rewards were too low
Answer: b) EOS experienced widespread vote buying (block producers offering rewards to voters), low voter participation (most token holders did not actively vote), and evidence of cartel formation (top block producers voting for each other to maintain their positions). These governance failures are inherent risks of the representative democracy model when applied to token-weighted voting.
9. What hardware requirements distinguish Solana validators from Ethereum validators?
a) Solana validators require specialized ASIC hardware like Bitcoin miners b) Solana validators need significantly more powerful hardware (256 GB RAM, high-core CPUs, fast SSDs, 1 Gbps network) c) Solana validators only need a smartphone d) Solana and Ethereum validators have identical hardware requirements
Answer: b) Solana's architecture prioritizes performance and requires validators to run high-specification servers with 256 GB RAM, high-core-count CPUs, NVMe SSDs, and gigabit network connections. This contrasts with Ethereum, which aims to be runnable on consumer-grade hardware. Solana's high hardware requirements are a centralization vector because they limit who can afford to validate.
10. Avalanche's Snowball consensus achieves agreement through:
a) A single leader proposing blocks to all validators b) Repeated random subsampling of small validator subsets c) Every validator communicating with every other validator d) A centralized coordinator issuing checkpoints
Answer: b) Avalanche uses repeated random subsampling: a validator randomly selects a small subset of other validators (e.g., 20 out of thousands), asks their preference, and updates its confidence based on the supermajority response. This process repeats until confidence crosses a threshold. This achieves O(k log n) message complexity, better than both PBFT and HotStuff.
11. Algorand uses Verifiable Random Functions (VRFs) primarily to:
a) Generate random numbers for smart contracts b) Secretly select committee members so attackers cannot target them in advance c) Encrypt transaction data for privacy d) Determine transaction fees based on network load
Answer: b) Algorand's VRFs allow each validator to privately determine whether they have been selected for the consensus committee in a given round. Because the selection is computed locally using a secret key, no one knows the committee composition until members reveal themselves by broadcasting their proposals or votes. This prevents targeted denial-of-service attacks on known upcoming leaders.
12. Which of the following best describes Proof of Authority?
a) A permissionless consensus mechanism where anyone can validate b) A consensus mechanism where block production is restricted to validators with verified real-world identities c) A consensus mechanism that uses computational puzzles to establish authority d) A DAG-based consensus mechanism used in enterprise settings
Answer: b) Proof of Authority relies on a known set of validators whose real-world identities are verified. Security comes from the reputational stake of the validators rather than from computational work or economic stake. PoA is appropriate for permissioned environments like enterprise consortia and testnets, not for permissionless public blockchains.
True/False
13. The blockchain trilemma has been mathematically proven to be an absolute impossibility.
False. The blockchain trilemma is an empirical observation about the difficulty of achieving decentralization, security, and scalability simultaneously with current techniques. It is not a proven impossibility theorem. Future cryptographic or architectural innovations may weaken the trilemma, and modular architectures are already exploring ways to achieve better tradeoffs by separating concerns across layers.
14. Tendermint-based blockchains can never experience chain reorganizations.
True. Tendermint provides instant (deterministic) finality. Once a block is committed (receiving pre-commits from validators representing more than two-thirds of total stake), it is permanently final. This is a fundamentally different finality model from Bitcoin or Ethereum, where chain reorganizations are theoretically possible (though increasingly unlikely as more blocks are added).
15. Solana's Proof of History replaces the need for any other consensus mechanism.
False. Proof of History is not a consensus mechanism — it is a cryptographic clock that establishes time ordering. Solana still requires Tower BFT (a BFT consensus variant) for validators to agree on the validity of transactions. PoH reduces the work that consensus needs to do by pre-establishing transaction order, but it does not replace consensus.
Short Answer
16. Explain why HotStuff achieves O(n) message complexity per round while PBFT requires O(n^2). What is the key architectural difference?
Answer: In PBFT, during the prepare and commit phases, every validator broadcasts messages to every other validator. With n validators, this creates n * (n-1) messages per phase, giving O(n^2) total complexity. In HotStuff, communication flows through the leader: validators send their votes to the leader, the leader aggregates them into a quorum certificate (a compact cryptographic proof of supermajority agreement), and broadcasts the QC back to all validators. This creates only 2n messages per phase (n inbound votes + n outbound QCs), giving O(n) complexity. The key difference is that HotStuff replaces all-to-all communication with a star topology centered on the leader.
17. A blockchain project claims 50,000 TPS. List three specific questions you should ask before accepting this claim at face value.
Answer: (Any three of the following are acceptable) 1. Was this measured on mainnet under real-world load or in a controlled testnet environment? 2. What counts as a "transaction" — does this include consensus votes, oracle updates, or system messages? 3. What is the transaction mix — simple transfers, or complex smart contract operations? 4. How many validators were participating during the measurement? 5. What hardware were the validators running, and what are the minimum hardware requirements? 6. Is this a peak or sustained measurement, and under what network conditions?
18. Why did IOTA's theoretical advantage of "the network gets faster as more people use it" not materialize in practice?
Answer: IOTA's theory was that more users = more transactions = more approvals = faster confirmation. In practice, the network was too small and usage too low for this self-reinforcing mechanism to provide adequate security. Without sufficient honest transaction volume, an attacker could generate enough transactions to perform double-spend attacks. The IOTA Foundation had to rely on a centralized Coordinator that periodically issued checkpoints to guarantee security, undermining the permissionless design. Additionally, the original tip selection algorithm had vulnerabilities, and the custom cryptography (Curl-P hash function) was found to have weaknesses, further complicating the transition to a truly decentralized operation.