Example 1: Why You Can't Erase a Bitcoin Transaction
Imagine an attacker wants to reverse a Bitcoin payment they made — essentially getting their money back after receiving goods. They need to remove or alter the transaction from the blockchain.
The transaction is in Block 750,000. Currently the chain is at Block 760,000 — 10,000 blocks have been added since. To alter Block 750,000, the attacker must: recompute Block 750,000 (requiring finding a new valid nonce — massive computation), then recompute Blocks 750,001 through 760,000 (each requiring new nonce solutions), all while the legitimate network is still producing new legitimate blocks at full speed.
Bitcoin's hash rate is measured in exahashes per second (10^18 hashes per second, combined across thousands of miners worldwide). The attacker would need to outcompute ALL of this simultaneously. The cost in hardware and electricity would run into billions of dollars — far more than any transaction is worth to reverse.
Example 2: Pharmaceutical Supply Chain on Blockchain
A pharmaceutical manufacturer ships a batch of insulin. Each step is recorded on a permissioned blockchain shared by consortium members:
- Manufacturer: Records batch ID, production date, storage conditions, and QA test results as a blockchain transaction.
- Cold chain shipper: Confirms receipt with temperature readings throughout transport. Any temperature excursion is recorded.
- Regional distributor: Records receiving timestamp, storage conditions, lot subdivision.
- Hospital pharmacy: Scans barcode — blockchain instantly shows the complete chain of custody back to manufacture.
A counterfeit product cannot be inserted into this chain — any entry must be signed by an authorized participant. A diversion (selling legitimate drugs on the black market) is detectable — the legitimate chain ends at one destination; a diverted product's records would simply stop at some legitimate point and not continue.
A patient adverse event can be traced to exactly which batch, which shipment, which storage condition — in minutes instead of weeks of manual investigation.
Example 3: Smart Contract — Automatic Insurance Payout
A travel insurance smart contract is deployed on Ethereum. The terms (written in code): "If flight AA123 on 2025-06-15 is delayed more than 2 hours, automatically pay the insured 500 USDC."
The smart contract receives real-world data through a trusted oracle (a data feed service). When the flight delay data is reported by the oracle (2+ hours), the smart contract automatically executes: it sends 500 USDC from the insurance pool to the insured's wallet.
No claim filing. No adjuster review. No denial and appeal. No wait. The code is the contract — it runs exactly as written. The insurance company cannot "forget" or refuse — the contract is immutable on the blockchain.
Example 4: The 51% Attack on a Small Chain
In 2018, Ethereum Classic (ETC) — a smaller cryptocurrency — suffered a successful 51% attack. An attacker rented enough mining power (hash rate) to temporarily control more than 50% of the ETC network's computing power.
With majority control, the attacker was able to rewrite recent transaction history — specifically, they double-spent ETC: sent coins to an exchange, waited for the exchange to credit their account and they withdrew other assets, then rewrote the blockchain so their original deposit appeared never to have happened. The exchange lost real money; the attacker kept both the withdrawn assets AND their coins.
Key lesson: smaller blockchains with lower hash rates are more vulnerable to 51% attacks because the cost of renting majority hash power is much lower. Bitcoin's hash rate is so large that a 51% attack would cost billions of dollars per hour — effectively infeasible. ETC's attack cost only a few thousand dollars to rent the necessary hash rate for a few hours.
Exam Scenario 1
Question: What property of blockchain makes it tamper-evident?
Answer: Hash chaining — each block contains the hash of the previous block. If any historical block is modified, its hash changes, which breaks the "previous hash" reference in every subsequent block. All nodes can detect the inconsistency immediately by comparing hashes. An attacker cannot modify history without recomputing every block after the altered one, which requires outcomputing the entire network simultaneously.
Exam Scenario 2
Question: Which consensus mechanism is more energy-efficient, and why?
Answer: Proof of Stake (PoS) is more energy-efficient. Proof of Work requires competitive computational work — thousands of miners burn electricity racing to solve the same puzzle, and only one wins. This wasted computation is the cost of security. Proof of Stake selects validators based on staked cryptocurrency — no competitive computation is needed. Validators simply run software and stake capital. The security comes from economic incentives (lose your stake if you cheat), not from electricity consumption.