Key Takeaways
Treat blockchain as a new way to coordinate trust, not trust's disappearance.
Trust without a referee. Banks and governments help strangers transact by verifying identities, keeping records, and resolving disputes. The book argues that blockchain can shift some of this work to a peer-to-peer network: participants maintain copies of a shared record, and software rules determine which transactions count. The hoped-for gains are faster transfers, lower intermediary costs, and fewer centralized stores of sensitive information. The 2007 financial crisis and declining confidence in institutions form the backdrop for this appeal, though the technology is not limited to finance.
Trust moves, it does not vanish. Participants still rely on code, network operators, incentives, and the people who build the system. Blockchain changes who performs the referee's job; it does not make the job unnecessary.
What's compelling is the shift from trusting a particular organization to checking whether many participants follow shared rules. That resembles distributed scientific measurement: independent observers can make a record harder to manipulate. Yet decentralization can obscure accountability. When a transaction is wrong, a system needs more than a tamper-resistant record; it needs a way to decide who can correct the error and compensate those harmed. The useful question is therefore not simply whether a blockchain removes intermediaries, but whether its new arrangement handles verification, responsibility, and redress better than the old one.
A cryptocurrency is a ledger of transfers, not a file sitting in a wallet.
The record is the asset. In Bitcoin, there is no individual digital object that can be pointed to as a coin. The network's history records which transactions transferred value, and a person's balance is inferred from that record. A typical transaction identifies a source of funds, an amount, and a destination address. A wallet manages the keys used to authorize transactions; it does not literally contain coins.
Why history matters. This design creates the double-spend problem: someone might try to use the same funds in two conflicting payments. Network participants check whether funds have already been spent. If competing histories appear, the protocol's rules help the network converge on one chain. The book recommends waiting for multiple blocks before treating a Bitcoin payment as settled, since an accepted transaction can still be displaced while the chain is being resolved.
This distinction clears up a common category error: digital money is not necessarily a digital object. It is a claim that the network recognizes because of its transaction history. Similar logic appears in accounting, where an account balance is meaningful because entries reconcile, not because a pile of cash exists inside the ledger. The design also makes recovery unfamiliar. If someone loses control of their private key, there may be no institution able to restore access. A system can reduce dependence on a bank while increasing dependence on careful key custody.
Use hashes to expose edits, then consensus to make rewrites costly.
Fingerprints, not encryption. A cryptographic hash function turns data of varying length into a fixed-length output. The same input produces the same hash, while even a tiny change produces a very different one. Hashes are designed to be easy to calculate but infeasible to reverse in practice. They are not encryption: a hash does not conceal the original information or provide a way to decrypt it.
Blocks refer backward. Transactions are summarized with hashes, and each block includes a reference to the preceding block. Altering an old transaction changes its hash and breaks the links in every later block. The book describes Bitcoin blocks as arriving about every ten minutes and containing roughly 1,500 to 2,000 transactions in its snapshot. Rebuilding the history would require substantial computing power and acceptance by the network.
The chain is best understood as a system for making tampering detectable and expensive, not as a magical guarantee that records can never change. That distinction matters in security engineering: detection, prevention, and recovery are separate properties. Hashes help detect changes; consensus and incentives make certain rewrites costly; neither guarantees that the original data was true. A perfectly preserved false record is still false. Blockchain is therefore strongest when paired with reliable processes for checking what information enters the ledger.
Proof of work buys security with electricity; proof of stake changes the bargain.
Compete to certify. Under proof of work, miners gather transactions and repeatedly try different values until a block meets the network's mathematical target. The successful miner earns a reward, and other participants check the proposed block. Rewriting past transactions means rebuilding later blocks and competing with the honest network. The book calls the majority-control risk the 51% problem: an attacker with most of the relevant mining power could potentially reorganize the chain or double-spend, though that does not mean they can simply spend anyone else's funds.
Stake instead of computation. Proof of stake selects block validators using rules tied to their holdings, with penalties intended to discourage dishonest behavior. It can use far less energy than thousands of miners competing at once. The tradeoff is different security assumptions, not security without cost; the exact rules vary across systems.
These mechanisms illustrate that consensus is an incentive design problem as much as a cryptographic one. Proof of work converts electricity and hardware into a costly barrier against rewriting history. Proof of stake substitutes economic exposure and protocol rules. Neither method is automatically fair: mining can concentrate among large operators, while stake-based systems can give greater influence to holders with greater wealth. Comparing them requires asking who can participate, what misconduct costs, and how concentrated power can become, not just counting energy use.
Automate promises only when the code and its inputs deserve trust.
Agreements that execute. A smart contract is software deployed on a blockchain that carries out agreed actions when its coded conditions are met. It can hold funds like escrow and release them after specified requirements are satisfied, reducing the need for an intermediary to perform routine steps. Ethereum was designed to support such programs, including decentralized applications and organizations governed by linked contracts.
Code can fail. The DAO, an Ethereum-based project for pooling investment and making decisions, raised about $150 million in 2016. A flaw in its code enabled attackers to take more than $50 million. Ethereum participants then adopted a hard fork, creating a revised chain that moved the affected funds, while others continued using the earlier history as Ethereum Classic. The episode showed that code can automate an agreement, but cannot guarantee that the agreement was coded safely or that people will agree on how to repair a failure.
Smart contracts reduce discretion at the moment of execution, which can make routine transactions more predictable. But the rules are written by people, and the facts they depend on may come from outside the blockchain. A contract that pays out based on a delivery, a sensor reading, or an accident report needs a trustworthy way to establish that event. The DAO dispute also makes a deeper point: even a system designed to resist intervention ultimately depends on people deciding what counts as legitimate when the rules produce an unacceptable result.
Bitcoin's block limits turn popularity into queues, fees, and governance fights.
Capacity became a bottleneck. In the book's 2017-era account, Bitcoin's blocks were limited to about 1 MB and created roughly every ten minutes. When transactions exceeded the available space, some waited for confirmation. Users could offer miners fees to prioritize their payments, making a network designed to reduce intermediary charges feel more like a constrained payment service with a queue.
No simple upgrade. One proposed route, Segregated Witness, separates some signature data from transaction data to increase effective capacity. Another proposal would enlarge blocks. The disagreement contributed to a hard fork that created Bitcoin Cash, which raised its block-size limit to 8 MB. The underlying conflict is about more than transaction speed: larger blocks may raise the demands on people running nodes, while limited blocks can mean delays and fees. Changing protocol rules requires enough participants to accept the change.
This is a classic infrastructure tradeoff: improving throughput can make a system more expensive to operate for ordinary participants. In distributed networks, that cost can push validation toward larger, better-funded operators, weakening the decentralization the upgrade was meant to serve. Conversely, keeping access requirements low can limit capacity. The debate is not solved by declaring one side pro-user and the other anti-user. It asks which users matter, what costs they can bear, and how much centralization a given increase in speed quietly introduces.
Ethereum made blockchains programmable, but the DAO hack exposed code's limits.
Beyond a payment ledger. Bitcoin's core role is recording transfers. Ethereum added a platform where developers could deploy programs and tokens on a shared blockchain. Its smart contracts enabled decentralized applications, and the ERC-20 protocol standardized how many Ethereum-based tokens behaved, making them easier to exchange within the ecosystem. The book describes initial coin offerings, or ICOs, as a way projects raised funds by selling tokens, often through smart contracts.
A new funding route, new risks. The book reports that ICOs raised more than $1.6 billion in 2017, while warning that many offerings had little regulation and could be manipulated. The DAO hack further demonstrated that deploying code to a public network does not make it safe. Ethereum's hard fork to address the theft also showed that the community could disagree over whether preserving transaction history or returning funds should take priority.
Programmability turns a ledger into a platform, which expands its possible uses but also expands its attack surface. A standardized token interface lowers friction for developers and users, yet ease of issuance is not evidence of a sound business, honest team, or secure code. The contrast resembles the early web: common standards made innovation faster, but also made it easier to distribute unreliable services. A useful discipline is to evaluate the application, its governance, and its funding claims separately from the underlying chain.
Privacy coins hide different parts of a public ledger, with regulatory tradeoffs.
Pseudonymous is not anonymous. Bitcoin addresses do not directly display a person's name, but transaction histories are public. If an address becomes linked to an identity, its activity may become traceable. Monero was described as combining ring confidential transactions and stealth addresses to obscure senders, recipients, and amounts. Zcash uses zero-knowledge proofs, which can allow a transaction to be checked without exposing its details, although the book notes that private transactions were optional in its design. Dash uses coin mixing, where transactions are combined to make their paths harder to follow.
Privacy has a public purpose. The book connects stronger privacy with fungibility: a unit of currency is more interchangeable when its past does not cause it to be rejected. The same opacity can complicate law enforcement and financial regulation. These systems make different choices about what information is visible, so “private cryptocurrency” is not one uniform technical or policy category.
Privacy is not merely a shield for wrongdoing. It can protect ordinary people from profiling, targeted theft, or public exposure of their spending. At the same time, financial privacy can make investigations harder, creating a real tension between individual protection and collective enforcement. The key policy question is not whether privacy should exist, but how to preserve it without treating every transaction as beyond accountability. The technical details matter because systems can conceal different pieces of information while still permitting some forms of verification.
Match each blockchain to its job; a shared ledger is not a universal solvent.
Different designs, different aims. The book surveys projects built for distinct needs: Ripple sought to speed cross-border payments for banks; Hyperledger supported open-source and enterprise blockchain development rather than a single currency; and IOTA proposed a network called the Tangle for connected devices and small transactions. It also imagines uses in identity, supply chains, insurance, voting, and the Internet of Things.
A record cannot solve every problem. Voting still needs reliable identity checks and ballot secrecy. Insurance automation needs trustworthy evidence of an accident. Product tracking is useful only if information about the product is entered accurately. The book acknowledges regulatory obstacles and argues that blockchain may be adopted by established institutions as well as challengers. Its most persuasive future is not the disappearance of every institution, but selective use where shared records and automated rules add practical value.
A ledger is useful when several parties need to coordinate records but do not want one party to control the only authoritative copy. That is a narrower and more testable claim than saying blockchain will transform every industry. Many applications still depend on trusted sensors, identity providers, courts, or administrators. The strongest evaluation begins with the actual coordination failure: who needs to agree on what, who currently maintains the record, and what happens when an entry is wrong? If a conventional database solves the problem more simply, decentralization may add cost rather than value.
Analysis
The book's central contribution is an accessible explanation of how a blockchain attempts to replace a trusted central record-keeper with shared records, cryptographic linking, and participant agreement. Its most important conceptual move is to connect the practical mechanics to a social ambition: enabling exchange among strangers without asking one institution to control the ledger. The chapter sequence makes the idea legible, moving from institutional frustrations to ledgers, hashes, mining, Bitcoin, Ethereum, and other projects.
The same ambition also creates the book's central tension. It presents decentralization as a route to speed, low cost, privacy, and security, but each benefit depends on design choices and tradeoffs. A public ledger can improve auditability while revealing activity. Proof of work can make rewrites expensive while consuming significant electricity. Smart contracts can reduce reliance on intermediaries while making bugs and external data sources consequential. The DAO episode is especially revealing because a dispute over a technical exploit became a dispute about governance and whether a community should reverse its consequences.
The book is a 2017 beginner's guide, so its forecasts, market rankings, timelines, and technical snapshots should be read as historical context rather than current facts. Its enduring value lies less in predicting which coin or protocol wins than in teaching readers the vocabulary to ask better questions. Is the ledger genuinely shared? What does the consensus mechanism make costly? Who has authority to change the rules? Who is accountable when the recorded data is wrong?
A useful modern lens is to treat blockchains as one option in institutional design, not as institutions' inevitable replacements. They can redistribute verification and make some records harder to alter, but they cannot abolish the need for governance, good inputs, or remedies. The technology's promise is strongest when a concrete coordination problem justifies those costs. Its limit is equally clear: a durable record can preserve mistakes as efficiently as truths.
Review Summary
Blockchain Technology Explained receives mostly positive reviews for providing a concise, easy-to-understand introduction to blockchain technology. Readers appreciate its clear explanations of complex concepts, balanced coverage of benefits and challenges, and broad overview of applications beyond cryptocurrencies. Some criticize the book's organization and limited depth on certain topics. Many recommend it as a good starting point for beginners, praising its accessibility and value for the price. Overall, reviewers find it helpful in demystifying blockchain technology for non-technical readers.
People Also Read
Glossary
Distributed ledger
Shared transaction recordA record of transactions or other data maintained by multiple computers on a network rather than by one central owner alone. Participants use agreed rules to check and update their copies. In a blockchain, transactions are grouped into linked blocks, making later changes detectable and difficult to accept across the network.
Cryptographic hash function
Fixed-length data fingerprintA mathematical function that converts input data of any length into an output of a standard length. The same input produces the same output, while a small input change produces a substantially different hash. It is designed to be easy to compute but infeasible to reverse in practice. A hash is not encryption and does not itself hide its input.
Proof of work
Computational block competitionA consensus method in which miners compete to find a valid result to a computational puzzle associated with a proposed block. Other network participants check the result and the transactions. The successful miner may receive a reward. Rewriting the chain requires repeating substantial computation, but this approach can consume significant electricity.
Proof of stake
Stake-based block validationA consensus method that selects participants to propose or validate blocks according to protocol rules connected to their holdings or stake. Participants can earn transaction fees or other rewards for valid work and may lose stake for misconduct. It can use much less energy than proof of work, though implementations differ and rely on distinct security assumptions.
Smart contract
Code that executes conditionsSoftware recorded on a blockchain that carries out specified actions when coded conditions are met. A contract might hold funds and release them after a stated requirement is satisfied. It can reduce reliance on an intermediary for execution, but its behavior depends on the quality of its code and, when relevant, the accuracy of information supplied from outside the blockchain.
Decentralized Autonomous Organization (DAO)
Organization governed by codeAn organization that uses blockchain-based rules, often implemented as a set of smart contracts, to manage decisions, funds, or operations. Members may participate through voting or other mechanisms encoded in the system. The book's example, The DAO, raised funds on Ethereum but suffered a major code exploit, illustrating that automated governance still depends on security and human decisions.
51% problem
Majority-control attack riskThe risk that an attacker who controls most of a proof-of-work network's mining power could disrupt the chain, potentially reorganize recent blocks or double-spend their own transactions. It does not automatically let an attacker spend other users' funds or create valid transactions without authorization. The cost and feasibility depend on the network's size and mining resources.
ERC-20 protocol
Ethereum token standardA set of common rules for tokens created on Ethereum. By following shared conventions, different applications and services can recognize and handle compatible tokens without developing a separate integration for each one. The standard made token creation and exchange easier, but compatibility does not establish that a token's project is useful, trustworthy, or financially sound.
zero knowledge proof
Verification without revealing detailsA cryptographic method that can demonstrate a claim is valid without disclosing the underlying information used to prove it. In the book's discussion of Zcash, this technique can let network participants verify a transaction without seeing its sender, recipient, or amount. The privacy properties depend on how the system is designed and whether protected transactions are actually used.
The Tangle
IOTA's transaction graphThe name given to IOTA's directed acyclic graph structure, which differs from a conventional blockchain. In the book's account, a user posting a new transaction must first verify two other transactions. The design was intended to support frequent, low-cost transactions among connected devices, but the book describes it as relatively new and untested at the time.
Download PDF
Download EPUB
.epub digital book format is ideal for reading ebooks on phones, tablets, and e-readers.