Limitations and Challenges of Blockchain
1.7 — Limitations and Challenges of Blockchain
Recall first. From §1.5–1.6, public chains buy open participation and reduced dependence on a central authority through mechanisms such as PoW or PoS. What do you think they give up to get that? List two costs before reading.
Reference-book anchor
Primary reference: Blockchain Technology, Chapter 1, §1.6.2 and Chapter 11, §§11.2–11.3 — converted Markdown lines 854–891 and 7623 onward.1
The book’s anchor covers the Chapter 1 pros/cons frame and Chapter 11’s scalability, privacy, skills, security, speed, cost, storage, governance, energy, mining, and human-error challenges. The trilemma is retained as a reasoning frame, with permissioned-chain qualifications added where the trade-off is not universal.
Why this topic closes Module I
A mastery-level student doesn’t just recite what blockchain is — they can state where it fails and why. Every strength in Module I has a corresponding cost. This note pairs each property with its limitation so the trade-offs are explicit.
The central tension: the “blockchain trilemma”
Public blockchains often strain against three goals that are difficult to maximize simultaneously: decentralization, security, and scalability.2 This trilemma is a useful design heuristic, not a formal theorem with one fixed definition of each corner; it is not a universal law that every blockchain sacrifices exactly one goal. Always state the assumptions behind a comparison, including what “security” and “decentralization” mean.
Scalability
/ \
Decentralization — Security
A design may improve two goals at the expense of the third. Bitcoin’s public, permissionless PoW design prioritizes decentralization + security and sacrifices scalability (low throughput). A private or consortium chain may improve throughput by using a smaller, permissioned validator set, but it gives up open-membership decentralization and shifts trust toward its operators, members, and governance; it can still be distributed among multiple organizations.
Limitation-by-limitation
| Limitation | Root cause | Consequence |
|---|---|---|
| Throughput / latency limits | Replication, validation, block limits, and network propagation | Confirmation capacity and delay depend on the protocol and measurement; public chains usually trade some throughput for open verification |
| Energy use (PoW) | Security uses repeated hashing as a scarce resource | Energy demand rises with the work required; non-PoW designs make a different security trade-off3 |
| Storage growth | Full-node replication; the chain only grows | Full nodes need ever more disk (mitigated by pruning, §1.3) |
| Majority-resource attack (e.g. 51% in PoW) | A participant controls enough consensus weight to dominate chain selection | Reorganizations, censorship, or double-spends become possible within the protocol’s limits |
| Immutability vs. errors | Append-only, no edit | A buggy/illegal record can’t easily be undone (e.g. the DAO) |
| Key management | “Not your keys, not your coins” | Lost/stolen keys = lost funds; no password reset |
| Governance / forks | No central owner | Disputes split the chain (hard forks: BTC/BCH) |
| Privacy paradox | Transparent ledger, pseudonymous IDs, and replicated data | Link analysis can de-anonymize addresses; putting sensitive data on many nodes can create an access and deletion problem |
| Smart-contract risk | Code executes according to protocol rules | A bug can produce unintended, difficult-to-reverse state changes (Module III) |
| Oracle / input problem | Consensus can agree on submitted data without knowing whether it is true in the physical world | A tamper-evident record can preserve a false sensor reading, identity claim, or shipment event; integrity after entry is not truth before entry |
Throughput, concretely
Why can’t Bitcoin just “make blocks bigger”? Because every full node must download and verify each block. Bigger blocks → fewer nodes can afford to participate → more centralization → weaker the very property that justifies the chain. This is the trilemma in action.
Energy: the PoW cost
PoW secures the chain by making attack expensive and making honest participation expensive. Proof-of-Stake (Module II) removes the need for continuous hash racing, but it introduces a different security model based on stake, validator behavior, penalties, and governance assumptions. Lower energy use is a trade-off, not proof that PoS is universally safer.34
Can a blockchain be “edited”?
Generally no — that’s the point. But when a catastrophic bug or theft occurs, communities have sometimes made exceptional edits via a hard fork (e.g. Ethereum’s split after the 2016 DAO exploit produced ETH vs. ETC). This reveals a deep tension: pure immutability is incompatible with human notions of justice, yet any edit mechanism reintroduces a trusted authority. There is no free lunch.
Worked example — the trilemma in a choice
A government wants a land-registry blockchain. They choose a private, PoS-based chain run by licensed notaries.
(a) Which trilemma corner did they sacrifice? (b) Which limitation from the table does this reduce? (c) Which property from §1.1 did they lose?
Answer: (a) They sacrificed open, permissionless decentralization (few known validators). (b) They may reduce throughput/latency limits and energy use (PoS, few nodes). (c) They lose the “no trusted intermediary” guarantee — the notaries collectively are the authority. The cryptographic tamper-evidence remains; the trustlessness does not.
Exercise
A startup claims: “Our new blockchain is fully decentralized, processes 1 million tx/s, and is more secure than Bitcoin.” Using the trilemma and the limitation table, state the most likely hidden catch(es) in one or two sentences.
Answer
By the trilemma, hitting 1M tx/s and full decentralization and Bitcoin-level security simultaneously is implausible. The likely catch: either the “decentralization” is illusory (few real validators / permissioned), or “security” rests on weaker assumptions (smaller validator set, lower attack cost), or the throughput figure counts something narrower than confirmed, finalized transactions.
Exam lens
Strong limitation answer: do not list disadvantages in isolation. For each one, state the design choice that causes it, the consequence, and the trade-off that would reduce it.
Example:
Open membership improves resistance to a single gatekeeper, but requires expensive Sybil resistance and replicated validation. Raising throughput by making validation more demanding can reduce the number of independent nodes, weakening decentralization.
Separate these terms:
- Tamper-evidence: later alteration is detectable or costly.
- Immutability: accepted history is difficult to change under the protocol/social rules.
- Truth: the recorded event corresponds to the real world; consensus alone does not guarantee this.
- Finality: the point at which a protocol treats a state as settled.
Common traps:
- The trilemma is a reasoning frame, not permission to claim every blockchain sacrifices exactly one corner.
- “On-chain” does not automatically mean private, correct, legal, or permanent in every jurisdiction.
- A private chain can improve throughput while retaining cryptographic auditability, but it cannot provide the same open-membership trust model as a public chain.
Rapid revision
- Can I connect each limitation to its root design choice?
- Can I explain why bigger blocks may reduce node participation?
- Can I distinguish data integrity from real-world truth?
- Can I give one mitigation and one new trade-off for scalability, energy, privacy, and governance?
Key takeaways
- Every blockchain strength has a cost; the trilemma (decentralization / security / scalability) is the master frame.
- Common public-chain limits: throughput/latency, storage growth, consensus-resource attacks, key custody, privacy, governance, and—when PoW is used—energy demand.
- Immutability clashes with error-correction; hard forks are the escape valve (and a trust compromise).
- “Blockchain solves everything” is a red flag — match the tool to the trust problem.
Sources
Footnotes
-
Blockchain Technology, S. Chandramouli, Asha A. George, Abhillash K. A., Meena Karthikeyan. Universities Press. E-edition first published 2020; copyright 2021. ↩
-
Bashir, I. (2019). Mastering Blockchain, 3rd Ed. Packt — Ch. on limitations, scalability, and the trilemma. ↩
-
Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System. https://bitcoincore.org/bitcoin.pdf — §6 notes the cost of attack vs. honest mining. ↩ ↩2
-
Ethereum Foundation, “Proof-of-stake (PoS).” https://ethereum.org/developers/docs/consensus-mechanisms/pos/ — contrasts PoS with PoW and describes stake-based validator security. ↩