How do digital signatures and hash functions combine to enable transaction authenticity and immutability in blockchains?
Think about your answer, then reveal below.
Model answer: Digital signatures enable authenticity: a transaction signed by a private key can be verified by anyone with the public key, proving the transaction originated from that key holder. Hash functions enable immutability: a block's hash depends on all transactions and the previous block's hash. Changing any transaction changes the block hash, which breaks the chain (all subsequent blocks become invalid). Combining these: each transaction is signed (authenticity), blocks are hashed (immutability), and the chain is public (anyone can verify). An attacker would need to forge a signature (break signatures) and recompute all subsequent hashes faster than the network (break hash collision resistance) to alter history.
Signatures + hashing create a chain of verifiable history. This is the cryptographic foundation of immutability.
Question 2 Multiple Choice
Proof-of-Work (mining) requires solving computational puzzles (finding a hash below a target). Why is this cryptographically useful?
AProof-of-work has no cryptographic purpose; it is purely computational waste
BProof-of-work makes block creation expensive (in energy), creating an economic barrier to attacking the chain; reversing history requires re-doing all work
CProof-of-work encrypts the blockchain content to hide transactions
DProof-of-work signs all transactions cryptographically
Proof-of-work's cryptographic utility is indirect but essential: it makes block creation expensive in energy/compute, creating a cost barrier to attacks. Reversing the blockchain history requires recomputing all work from the attack point faster than the network continues (hard because the network has 51% hash power and continues growing the honest chain). This economic cost complements cryptographic security: even if an attacker forges signatures or breaks hashing (unlikely but possible), the high cost of PoW makes attacks prohibitively expensive.
Question 3 True / False
Proof-of-Stake (PoS) uses cryptographic signatures and slashing (penalizing equivocation). How does slashing provide security without computational puzzles?
TTrue
FFalse
Answer: True
In PoS, validators are chosen to propose blocks based on stake (amount held). Instead of computational cost (PoW), PoS uses economic cost: validators put up collateral (stake), which is slashed (forfeited) if they equivocate (sign conflicting blocks). Cryptographic signatures prove equivocation (two conflicting signatures with the same key), triggering slashing. This economic punishment replaces computational expense as the barrier to attacks. If you own 33% of stake and try a 33% attack, you lose 33% of your wealth (slashing), making the attack more expensive than any benefit. Slashing requires careful Byzantine-Fault-Tolerant (BFT) protocol design to correctly identify and penalize attacks.