Start free trial
Trending New Genres Authors
EnglishEnglish
EspañolSpanish
简体中文Chinese
繁體中文Chinese (Traditional)
FrançaisFrench
DeutschGerman
日本語Japanese
PortuguêsPortuguese
ItalianoItalian
한국어Korean
РусскийRussian
NederlandsDutch
العربيةArabic
PolskiPolish
हिन्दीHindi
Tiếng ViệtVietnamese
SvenskaSwedish
ΕλληνικάGreek
TürkçeTurkish
ไทยThai
ČeštinaCzech
RomânăRomanian
MagyarHungarian
УкраїнськаUkrainian
IndonesiaIndonesian
DanskDanish
SuomiFinnish
БългарскиBulgarian
עבריתHebrew
NorskNorwegian
HrvatskiCroatian
CatalàCatalan
SlovenčinaSlovak
LietuviųLithuanian
SlovenščinaSlovenian
СрпскиSerbian
EestiEstonian
LatviešuLatvian
فارسیPersian
മലയാളംMalayalam
தமிழ்Tamil
اردوUrdu
Searching...
SoBrief
Blockchain Basics

Blockchain Basics

A Non-Technical Introduction in 25 Steps
Understand what blockchains actually solve, and when a shared ledger is worth its cost.
by Daniel Drescher 2017 255 pages
3.94
500+ ratings
Listen
Immersive
V2.3
Amazon Kindle Audible
Try Full Access for 3 Days
Unlock listening & more!
Continue

Key Takeaways

Use a blockchain when strangers need one ledger without a trusted operator

The core job is integrity. The book defines a blockchain as a way to maintain integrity in a distributed system: a network of independent computers that cooperate without a central coordinator. Integrity means keeping records complete and consistent, ensuring the system behaves as intended, and restricting actions to authorized users. The blockchain is not the user-facing purpose of an application. It is infrastructure for supporting that purpose.

Architecture has consequences. A centralized payment service can use one operator to reconcile records. A distributed design removes that single authority, but creates the harder task of getting independent computers to agree. The book’s case for blockchain begins with that specific problem, not with a claim that every database should be replaced.

Analysis

What's striking is how this framing turns a fashionable technology into a targeted engineering choice. The relevant question is not whether a system can use a blockchain, but whether participants need to share records without trusting one administrator. This resembles institutional design: rules and procedures substitute for some forms of personal discretion. Yet they do not abolish trust. Users still rely on software, cryptography, network access, and the assumptions built into the protocol. A central operator may be the simpler, more accountable choice when participants already trust one another or need a clear party responsible for errors.

Digitized peer-to-peer exchange can make intermediaries optional, not automatically obsolete

Direct exchange can change an industry. The book uses Napster to show how peer-to-peer file sharing let music listeners obtain songs directly from other users, weakening the studios’ traditional role in distribution. Digital files are cheap to copy and send, making them especially suited to direct exchange. The book notes an important wrinkle: Napster still used a central database to help users find songs, so the service was not fully decentralized.

Money is also digital information. Bank balances and many assets exist as records in information systems. A cross-border transfer can pass through several intermediaries, each adding time, processing, or fees. Disintermediation means reducing or removing those middle layers. A blockchain may enable direct exchange, but whether that is useful depends on the service those intermediaries provide.

Analysis

The Napster comparison makes the economic opportunity vivid, while its central directory quietly demonstrates that peer-to-peer systems can retain centralized components. That distinction matters: removing an intermediary is not the same as removing every coordination function. Banks, registries, and platforms may also provide dispute resolution, identity checks, and recourse when something goes wrong. A sound analysis therefore asks which costs are mere friction and which are valuable safeguards. Technology can unbundle those jobs, but the underlying needs do not disappear simply because a ledger is shared.

Prove ownership with an ordered history, not a bare balance

A transaction history explains possession. Inventory data say who owns what now. Transaction data record how ownership moved from one account to another. A complete, ordered history acts as an audit trail: participants can reconstruct current ownership from prior transfers. Order matters because a transfer may be invalid if the sender did not yet own the asset or had already spent it.

Delay creates double spending. The double spending problem occurs when the same digital asset is transferred more than once. In the book’s example, a seller transfers a house to one buyer, then quickly asks another ledger to record a sale to someone else. Because updates take time to spread, some computers may not yet know about the first sale. The system must settle on one valid history.

Analysis

This distinction between a snapshot and a history echoes the difference between an account balance and an audit trail in accounting. A balance is convenient, but the sequence of entries is what makes the result inspectable. There is also a boundary to what a ledger can prove: it can show what its rules accepted and recorded, not independently establish that a real-world claim was true. A land registry, for example, still needs reliable procedures for connecting people, property, and recorded transfers. Shared records improve verification, but they cannot make bad inputs true.

Let public keys identify accounts, and require private-key signatures to authorize transfers

An open address, a private authority. In asymmetric cryptography, each account has a public key that can be shared and a corresponding private key that must remain secret. The public key acts like an address: others can use it to send assets to the account. To transfer assets away, the account holder must authorize the transaction with a digital signature.

The signature binds agreement to content. A digital signature is created from the transaction’s cryptographic fingerprint using the private key. Other participants use the public key to check that the signature matches both the account and the exact transaction details. If the transaction is altered, verification fails. The system can therefore be open to anyone while still requiring proof that the account holder approved a transfer.

Analysis

This design separates visibility from control: an account can be publicly addressable without making its assets publicly spendable. It is a powerful pattern for digital systems, where identity claims and permissions can be checked without a human clerk reviewing every action. But the private key becomes a concentrated point of failure for its owner. If it is lost or exposed, the protocol cannot infer the owner’s intentions or provide ordinary account recovery. Security is therefore partly a technical property and partly a practical question of how people safeguard credentials.

Hashes act as fingerprints. A cryptographic hash function turns data of any size into a fixed-length value. The same input produces the same value, while even a small change produces a different one. A Merkle tree combines the fingerprints of many transactions into one root value. Blocks also contain a reference to the preceding block, so changing old data disrupts the chain of references.

Detection alone is not prevention. Someone could try to replace the changed fingerprints and rebuild later blocks. Proof of work makes that repair costly: computers search for a nonce that makes a block’s hash meet a required difficulty. Rewriting old records means repeating that work for the affected blocks. This makes alteration expensive, not physically impossible.

Analysis

The layered protection is more important than any single cryptographic trick. Hashes make inconsistency visible; the chain spreads the consequences of a change; proof of work attaches a cost to rebuilding the altered history. This is a useful security principle beyond blockchains: detection, propagation, and deterrence solve different parts of a threat. The cost model also creates a design constraint. If work is too cheap, rewriting is easier; if it is too expensive, ordinary participation becomes burdensome. Security is purchased, and the price must fit the system’s purpose.

Make every node a verifier, and reward useful validation

The network checks its own work. Nodes receive transactions and new blocks through a gossip-style process: each computer forwards information to its peers, which pass it on. Messages can arrive late, more than once, or out of order, so nodes use identifiers to ignore duplicates and timestamps and rules to evaluate records.

Validation combines rules and incentives. Nodes check whether transactions are properly formed, make sense under the application’s rules, and carry valid authorization. In the book’s proof-of-work model, a node that creates a valid block can earn transaction fees or another reward. Other nodes examine that block and reject invalid work. The arrangement uses competition, peer review, rewards, and penalties instead of a central supervisor.

Analysis

The design resembles both distributed quality control and a market: participants are paid to produce accepted work, while other participants have reasons to inspect it. Its strength is that verification is not assigned to one privileged observer. Its weakness is that incentives are not guarantees. Participants may collude, ignore rules, or find it profitable to attack the system. The book’s model depends on honest participants controlling enough resources to outweigh dishonest ones. That assumption should be examined as part of system design, not treated as a reassuring feature of the word decentralization.

Treat new blocks as provisional until one history accumulates more work

Networks produce competing histories. Two computers can create blocks at nearly the same time, or a delayed message can leave some nodes working from an older version. The result is a temporary fork, where the record branches into competing histories. Nodes select the path with the most accumulated work, measured in the book’s account by chain length or, when difficulty varies, by total difficulty.

Agreement strengthens with time. Blocks outside the selected path become orphan blocks, and their transactions may need to be processed again. As additional blocks build on one branch, it becomes less likely to be abandoned. This is eventual consistency: computers may disagree temporarily, but the system tends toward a shared history. A majority attack tries to control enough computing power to replace that accepted history.

Analysis

This is a more realistic account of agreement than imagining a network reaches instant unanimity. Consensus here is an ongoing process in which confidence grows as competing records fall behind. That has practical consequences: an application must decide how much uncertainty it can tolerate before treating a transaction as settled. The deeper principle is that finality can be a matter of degree rather than a switch. The book’s model also makes power measurable through computing resources, so a system’s security depends on who controls those resources, not simply how many computers appear on the network.

Choose visibility and write access separately, then price their tradeoffs

Two access decisions create four designs. A public blockchain allows everyone to read the ledger; a private one limits reading to a selected group. A permissionless blockchain lets anyone take part in writing and validating records; a permissioned one restricts those roles to approved participants. Combining these choices yields public permissionless, public permissioned, private permissionless, and private permissioned systems.

Restrictions buy some advantages and change the model. Limiting readership can improve privacy, while restricting writers can reduce the burden of open participation and support faster processing. But an approval process raises questions about who sets the rules and grants access. The book also identifies costs, limited scalability, key loss, legal uncertainty, and the risk that specialized hardware concentrates control.

Analysis

This framework is useful because it prevents the word blockchain from hiding important governance choices. Access is not a technical footnote: it determines who can inspect, participate, and exercise authority. Permissioned designs can make sense where known organizations need a shared record, but they may reintroduce central decision-making through membership rules. Conversely, public access can expose sensitive transaction patterns. There is no configuration that maximizes openness, privacy, speed, and distributed control at once. The right choice depends on which risks the participants are actually trying to reduce.

Demand a reason to decentralize before buying blockchain promises

Start with the application, not the technology. The book identifies uses such as payments, digital identity, notary records, auditing, voting, and ownership registries. More generally, a blockchain can provide evidence that data existed, establish an order or time, identify an author, or record ownership. Smart contracts extend the idea by running code that carries out specified actions when conditions are met.

Test the practical case. Ask whether participants need a shared record without a trusted operator, what access rules apply, what data will be visible, how validators are compensated, and who bears costs or legal responsibility. Also compare the design with a centralized alternative. If the application lacks a compelling need for distributed control, a blockchain may add complexity without adding value.

Analysis

The strongest decision rule is comparative: evaluate the blockchain against a plausible alternative, not against an imaginary system with no costs. Automation and standardization may reduce processing and coordination burdens, while code-based execution can make routine agreements easier to carry out. Yet code can only execute defined rules; it cannot by itself resolve every dispute about meaning, responsibility, or real-world events. This is why the book’s checklist matters. It asks readers to inspect governance and business incentives alongside technical design, where many supposedly revolutionary projects either earn their value or reveal that the ledger is beside the point.

Analysis

The book’s most durable contribution is a change of question. Instead of asking whether blockchain is revolutionary, it asks what happens when a group of independent computers must maintain a dependable record without a trusted central operator. That shift strips away much of the promotional fog and makes the technology legible as a collection of tradeoffs: cryptographic identity, tamper evidence, costly revision, open verification, incentives, and a rule for choosing between competing histories.

The narrative works because each technical mechanism answers a distinct failure. Signatures address unauthorized transfers. Hash references expose changed records. Proof of work raises the cost of rewriting them. Peer-to-peer communication distributes updates. Consensus selects a shared history despite delay. None of these mechanisms alone creates trust. Their coordination creates a system whose reliability rests on specific assumptions, especially that honest participants control sufficient resources and that the rules correctly express the application’s needs.

That distinction matters for claims about replacing institutions. A blockchain can make certain forms of record keeping and verification less dependent on a single intermediary. It cannot automatically supply accurate facts about the physical world, settle ambiguous agreements, recover a lost key, or determine who should be accountable when automated rules cause harm. Those are institutional questions, even when software makes them more visible.

The access model is therefore not a secondary implementation detail. Public and permissionless participation prioritizes open entry and scrutiny, while restricting readers or writers can improve privacy or performance but shifts authority toward whoever administers access. The book’s practical lesson is not that one design wins. It is that applications should state their trust assumptions, failure costs, and governance rules before choosing the machinery. Blockchain is valuable when its particular combination of shared verification and costly revision solves a real coordination problem better than simpler alternatives.

Summary in 30 Seconds
Blockchains help independent participants maintain a shared record without relying on one trusted operator. Public-key signatures authorize transfers, while linked cryptographic fingerprints expose changes and proof-of-work makes rewriting records costly. Nodes verify transactions and choose the history with the most accumulated work, though agreement can take time and forks can occur. Access restrictions can improve privacy or speed but place authority in the hands of those who approve participants. Use this design only when its shared verification solves a real coordination problem better than a simpler system.
Contains spoilers

Last updated:

Report Issue

Review Summary

3.94 out of 5
Average of 500+ ratings from Goodreads and Amazon.

Blockchain Basics is praised for its clear explanations of complex concepts using metaphors and repetition. Readers appreciate its non-technical approach and systematic breakdown of blockchain technology. Many find it an excellent introduction for beginners, though some technical readers may find it verbose. The book is commended for its structure, outlines, and comprehensive coverage of blockchain fundamentals. While some critics note its dry style and repetitiveness, most reviewers highly recommend it for those seeking to understand blockchain technology without delving into cryptocurrencies specifically.

Your rating:
4.45
159 ratings
Want to read the full book?

Glossary

Blockchain

Shared ledger system

In the book, blockchain refers to a distributed peer-to-peer system of ledgers that uses connected data blocks, an algorithm for selecting accepted records, and cryptographic and security techniques to maintain integrity. It is not synonymous with Bitcoin or cryptocurrency, which are particular applications of blockchain technology.

Double spending problem

Repeatedly transferring one asset

The double spending problem is the risk that the same digital asset will be transferred more than once. In a distributed ledger, updates take time to reach every computer, so different participants may temporarily accept conflicting transfers. The system must select one accepted history and treat incompatible records as though they did not occur.

Cryptographic hash value

Fixed-length data fingerprint

A cryptographic hash value is a fixed-length result produced from data of any size. The function is deterministic, so identical input gives identical output, and designed so that small input changes produce unpredictable differences. It is difficult to reverse or find different inputs with the same output, making the value useful for detecting changes and linking records.

Merkle tree

Grouped transaction fingerprints

A Merkle tree combines the hash values of many items in pairs, then repeatedly hashes those combined values until one root value remains. The root provides a compact reference to the whole collection. If a transaction or one of its references changes, the affected hashes change up the tree, making the altered collection detectable.

Digital signature

Verifiable transaction authorization

A digital signature is created using a private key and a fingerprint of the data being authorized. Other participants use the corresponding public key to check that the signature matches the data and came from the holder of the private key. A change to the signed transaction breaks verification, helping establish both authorization and data integrity.

Proof of work

Costly computational puzzle

Proof of work requires a computer to find a value, called a nonce, that makes a block’s hash meet a specified difficulty. Finding a solution requires repeated computation, while checking a proposed solution is comparatively straightforward. In the book’s model, this work helps make adding or rewriting blocks costly and supports the selection of an accepted history.

Distributed consensus

Agreement among independent nodes

Distributed consensus is agreement among computers in a peer-to-peer system about which record or transaction history to accept, without a central authority declaring the result. In the book’s proof-of-work model, nodes follow a common rule for selecting the history with the greatest accumulated work, allowing temporary disagreements to be resolved.

Eventual consistency

Agreement strengthens over time

Eventual consistency describes a system in which different computers may temporarily hold different versions of a record, but tend toward a shared version as updates spread and additional blocks are added. In the book’s blockchain model, deeper blocks are less likely to be displaced by a competing history, so confidence in their inclusion grows over time.

Smart contract

Code executed by a blockchain

A smart contract is a computer program stored and executed within a blockchain system. It can encode conditions and actions, such as transferring an asset when specified requirements are met. The book distinguishes this technical use from the everyday legal meaning of a contract: running code does not by itself settle questions of legal interpretation or responsibility.

FAQ

What's Blockchain Basics about?

  • Non-Technical Introduction: Blockchain Basics by Daniel Drescher offers a non-technical introduction to blockchain, breaking down complex concepts into 25 understandable steps.
  • Focus on Concepts: The book emphasizes understanding the underlying concepts of blockchain rather than specific applications like Bitcoin, making it accessible to a broader audience.
  • Ownership and Applications: It explores how blockchain manages ownership and transfer of assets securely, addressing challenges like double spending and showcasing various applications.

Why should I read Blockchain Basics?

  • Comprehensive Understanding: The book bridges the gap between technical and non-technical literature, providing a conceptual understanding necessary for evaluating blockchain applications.
  • Accessible Language: Drescher uses a conversational style without heavy jargon, making it suitable for readers without a technical background.
  • Incremental Learning: The structured approach allows readers to build knowledge step-by-step, ensuring a solid grasp of blockchain fundamentals.

What are the key takeaways of Blockchain Basics?

  • Understanding Ownership: The book explains how blockchain technology can manage ownership through a decentralized ledger, emphasizing integrity and trust.
  • Immutability and Security: It highlights the importance of immutability in blockchain, making it resistant to tampering and fraud, crucial for applications like cryptocurrencies.
  • Peer-to-Peer Architecture: The decentralized nature of blockchain allows for peer-to-peer transactions without intermediaries, leading to reduced costs and increased efficiency.

How does Blockchain Basics define ownership?

  • Three Elements of Ownership: Ownership is defined through identification of the owner, identification of the object, and mapping the owner to the object.
  • Transaction History: The book emphasizes maintaining a history of transactions to clarify ownership, rather than relying solely on inventory data.
  • Role of Ledgers: Ledgers document ownership and transfers, ensuring that ownership claims are verifiable.

What is the double spending problem discussed in Blockchain Basics?

  • Definition: The double spending problem refers to the risk of a digital currency being spent more than once, a significant concern in decentralized systems.
  • Impact on Integrity: If integrity is violated through double spending, it undermines trust in the blockchain system, leading to potential financial losses.
  • Blockchain Solution: Blockchain technology addresses this issue by ensuring all transactions are recorded in a way that prevents double spending.

How does Blockchain Basics explain the concept of digital signatures?

  • Authorization of Transactions: Digital signatures allow the owner of an account to authorize transactions, ensuring only they can transfer ownership.
  • Public-Private Key Cryptography: Digital signatures utilize asymmetric cryptography, where a private key signs a transaction, and a public key verifies it.
  • Proof of Agreement: A digital signature serves as proof that the owner agrees with the transaction details, similar to a handwritten signature on a document.

What is the significance of hash functions in Blockchain Basics?

  • Data Integrity: Hash functions create unique digital fingerprints for data, allowing for quick comparisons and detection of changes, crucial for maintaining blockchain integrity.
  • Collision Resistance: Cryptographic hash functions are designed to be collision-resistant, making it highly unlikely for two different inputs to produce the same hash value.
  • Change Detection: Hash values detect unauthorized changes in transaction data, ensuring any manipulation is easily identified.

What are the limitations of blockchain technology as discussed in Blockchain Basics?

  • Scalability Issues: The book addresses challenges related to scalability, particularly how blockchain can struggle to handle a high volume of transactions efficiently.
  • Energy Consumption: It discusses the energy-intensive nature of certain consensus mechanisms, such as proof of work, which can be a drawback for widespread adoption.
  • Regulatory Concerns: Potential legal and regulatory challenges could impact the implementation and acceptance of blockchain technology.

How does Blockchain Basics describe the blockchain-data-structure?

  • Chain of Blocks: The blockchain-data-structure is a series of blocks, each containing a header and a Merkle tree of transaction data, linked by hash references.
  • Order Preservation: The structure ensures that the order of transactions is preserved, crucial for maintaining data integrity.
  • Change Sensitivity: The blockchain-data-structure is designed to be change-sensitive, meaning any alteration to the data will invalidate the entire structure.

How does the blockchain ensure data integrity according to Blockchain Basics?

  • Immutable Data Structure: Blockchain uses an immutable append-only data structure, meaning once data is added, it cannot be changed or deleted.
  • Hashing Mechanism: Each block contains a cryptographic hash of the previous block, creating a chain that makes tampering easily detectable.
  • Consensus Algorithm: A consensus algorithm, such as proof of work, validates transactions and adds new blocks, deterring malicious actors from manipulating data.

What are the different types of blockchains mentioned in Blockchain Basics?

  • Public Blockchains: Open to everyone, allowing any user to read and write data, exemplifying decentralization and transparency.
  • Private Blockchains: Restrict access to a preselected group of users, often used in commercial contexts where privacy and control are prioritized.
  • Permissioned Blockchains: Grant writing access only to a limited group of trusted nodes, enhancing security and efficiency while leveraging blockchain benefits.

What are the practical applications of blockchain technology outlined in Blockchain Basics?

  • Cryptocurrencies: Blockchain underpins cryptocurrencies, enabling secure and decentralized transactions, gaining significant attention and adoption.
  • Digital Identity: Blockchain can create secure digital identities, allowing individuals to manage personal information without centralized authorities.
  • Notary Services: The technology can be applied to notary services, providing a secure way to digitize and verify documents, streamlining processes.

About the Author

Daniel Drescher is the author of Blockchain Basics: A Non-Technical Introduction in 25 Steps. He has successfully created a book that explains complex blockchain concepts in a way that is accessible to non-technical readers. Drescher's approach involves using metaphors, repetition, and systematic explanations to break down the technology into understandable components. His writing style is described as clear and concise, with a focus on providing a solid foundation for understanding blockchain technology. Drescher's work is particularly appreciated by readers new to the subject, as it avoids getting bogged down in technical jargon while still providing a comprehensive overview of blockchain's potential applications and limitations.

Download PDF

To save this Blockchain Basics summary for later, download the free PDF. You can print it out, or read offline at your convenience.
Download PDF
File size: 0.40 MB     Pages: 20

Download EPUB

To read this Blockchain Basics summary on your e-reader device or app, download the free EPUB. The .epub digital book format is ideal for reading ebooks on phones, tablets, and e-readers.
Download EPUB
File size: 1.40 MB     Pages: 25
Want to read the full book?
Follow
Listen10 mins
Home
Swipe
Library
Get App
Try Full Access for 3 Days
Listen, bookmark, and more
Compare Features Free Pro
📖 Read Summaries
Read unlimited summaries. Free users get 3 per month
🎧 Listen to Summaries
Listen to unlimited summaries in 40 languages
—
❤️ Unlimited Bookmarks
Free users are limited to 4
—
📜 Unlimited History
Free users are limited to 4
—
📥 Unlimited Downloads
Free users are limited to 1
—
Risk-Free Timeline
Today: Get Instant Access
Listen to full summaries of 26,000+ books. That's 12,000+ hours of audio!
Day 2: Trial Reminder
We'll send you a notification that your trial is ending soon.
Day 3: Your subscription begins
You'll be charged on Nov 24,
cancel anytime before.
Consume 2.8× More Books
2.8× more books Listening Reading
Our users love us
1M+ readers
Trustpilot Rating
TrustPilot
4.6 Excellent
This site is a total game-changer. I've been flying through book summaries like never before. Highly, highly recommend.
— Dave G
Worth my money and time, and really well made. I've never seen this quality of summaries on other websites. Very helpful!
— Em
Highly recommended!! Fantastic service. Perfect for those that want a little more than a teaser but not all the intricate details of a full audio book.
— Greg M
Save 62%
Yearly
$119.88 $44.99/year/yr
$3.75/mo
Monthly
$9.99/mo
Start a 3-Day Free Trial
3 days free, then $44.99/year. Cancel anytime.
Unlock a world of fiction & nonfiction books
26,000+ books for the price of 2 books
Read any book in 10 minutes
Discover new books like Tinder
Request any book if it's not summarized
Read more books than anyone you know
#1 app for book lovers
Lifelike & immersive summaries
30-day money-back guarantee
Download summaries in EPUBs or PDFs
Cancel anytime in a few clicks

Why one summary?

Scanner
Find a barcode to scan

⭐
⭐
⭐
We have a special gift for you
Open
38% off
DISCOUNT FOR YOU
⭐
⭐
⭐
$79.99
$49.99/year
Only $4.16 per month
Continue
2 taps to start, super easy to cancel
Settings
General
Widget
Loading...