Open lesson contents
The question is not “How do we store data?” but “Whom do we trust?”
A conventional internet service usually has one authoritative database. A bank updates balances, a marketplace updates orders, and a game company updates points. As long as everyone accepts the administrator, the system can run quickly and cheaply.
That model is not inherently bad. The issue is that the administrator holds several powers at once: deciding who may enter, which operations count as valid, in what order records are written, and even whether history may be changed or deleted. If the server is attacked, shut down, or censored, every participant is affected.
A blockchain addresses a harder—and narrower—problem:
If participants do not fully trust one another and do not want to give final authority to a central institution, how can they maintain one shared ledger?
Interactive diagram · How many people does one failure affect?
single point vs replicated stateCentralized database
Every request passes through one administrator. It is fast, but it is also a point of control and failure.
STATE #105
Status: Online. Everyone depends on the same database.
Multi-node validation network
Multiple nodes store and validate state. One node going offline does not erase the public state.
Status: All five nodes can independently validate #105 under the protocol rules.
A blockchain therefore does not eliminate databases. It replaces the “one trusted database” model with a public state-transition system that anyone can verify and that is difficult for one party to control. In exchange, it sacrifices speed, cost efficiency, privacy, and ease of revision.
The four properties come from one complete chain of cause and effect
Decentralization, permissionless participation, tamper resistance, and global synchronization are not four independent slogans. They emerge from signatures, network propagation, consensus, deterministic execution, and data commitments working together.
Show that the controller of the relevant key authorized a proposed state change.
Transactions and blocks spread among independent nodes over multiple paths.
Determines which blocks the network recognizes and the canonical order of transactions.
The same pre-state and transaction order must produce the same result.
Let nodes compactly check whether history and state match.
At a more abstract level, a blockchain is a state machine replicated across many nodes:
post-state = state-transition function (pre-state, ordered valid transactions)
Suppose Alice has 10 ETH and Bob has 0 ETH. Alice signs a transaction sending 3 ETH. Nodes first validate the signature, account nonce, and balance. Consensus places the transaction in a canonical block. The execution layer applies the same rules, so every honest node derives the same post-state: Alice has 7 ETH and Bob has 3 ETH.
If Alice submits two conflicting spends at the same time, the network does not stop her from sending both requests. Instead, canonical ordering, the account nonce, and balance rules prevent both transactions from becoming part of valid state. That is the core solution to the double-spend problem.
Decentralization: shifting trust from institutions to public rules and independent verification
Decentralization does not mean “no one is responsible,” nor does it mean that everyone has exactly equal power. It means no single participant can unilaterally determine the canonical ledger for everyone without detection or resistance.
Multiple replicas
Public data and state commitments exist across multiple independent nodes. Losing one server does not erase the network’s history.
Independent verification
A node does not have to trust someone else’s claim that “this block is valid.” It can check transactions and state against the protocol rules itself.
Implementation diversity
Different teams, programming languages, and clients implement the same specification, reducing the risk that every node inherits the same software bug.
Costly unilateral control
An attacker must influence enough consensus participants—or overcome social coordination—rather than simply edit one database.
The more precise goal is trust minimization, not complete trustlessness. You still rely on cryptographic assumptions, the protocol specification, client implementations, your own device, and your key management. The difference is that many outcomes move from “an institution says so” to “you can verify it yourself.”
Decentralization has many dimensions; it is not an on/off switch
Ethereum’s base-layer consensus may be broadly distributed while users all depend on the same wallet website, RPC provider, or stablecoin issuer. A contract may also retain an administrator’s upgrade key. To evaluate an application, examine validators, nodes, clients, front ends, data inputs, asset issuance, and governance separately. Asking only “Is it onchain?” is not enough.
Permissionless access: the protocol checks rules, not an administrator’s identity policy
At the protocol layer, anyone who can connect to the network and satisfy its uniform rules can generate an address, read data, validate blocks, submit transactions, or deploy contracts—without first obtaining a platform account or human approval.
It includes at least three kinds of openness
- Open use: Any address can attempt to submit a transaction that follows the rules.
- Open verification: Anyone can run the software and check whether the network is following its rules.
- Open innovation: Developers can deploy contracts without first passing an app store review or platform API approval.
Permissionless does not mean free, anonymous, instantly settled, or exempt from real-world law. Open networks also face spam and malicious participation, so they need transaction fees, gas, Sybil-resistance mechanisms, and a consensus security budget. A specific application may add an allowlist in its contract. That is an application-layer choice: an application does not automatically inherit all of the base protocol’s openness.
Tamper resistance: state changes, but one party cannot easily rewrite history
“Immutable” is often used too absolutely. A more accurate statement is this: history that the network has confirmed cannot be quietly edited by one administrator as it could be in an ordinary database. Replacing it requires rebuilding the subsequent history and persuading the network to accept the alternative.
Interactive diagram · What happens when an old block is edited?
hash-linked historyBLOCK #100
BLOCK #101
BLOCK #102
Hashes are shortened for teaching. Real systems use long hash commitments. Hashing alone makes a change evident; distributed verification, consensus, and economic cost make an alternative history difficult for the network to accept.
A hash is not “immutability magic”
An attacker can edit data and calculate a new hash. The crucial point is that other nodes still hold the original history and reject an alternative chain that does not satisfy consensus rules. Confirmation and finality are not synonyms: a recently included block may still be near the chain head, while a finalized block has much stronger protocol and economic guarantees. Reversing a finalized block would require breaking those assumptions; it could also trigger slashing and social coordination to recover the network.
Tamper resistance does not make data true
A digital signature can prove only that “the holder of a particular private key authorized this message.” It cannot prove that the signer understood the consequences, much less that an offchain weather report, property price, or shipment status is true. A blockchain can preserve a lie indefinitely. Offchain facts still require oracles, audits, sensors, or legal accountability.
Keep the distinction clearState is supposed to change. What is difficult for one party to rewrite is the history of state transitions that have already occurred.
Global state synchronization: honest nodes eventually converge on the same result
At any instant, nodes may have received different transactions or may briefly have different chain heads. Global state synchronization does not mean perfect agreement every millisecond. It means the protocol leads honest nodes to converge on the same canonical ordering and compute the same canonical state from it.
Interactive diagram · How do three nodes move from disagreement to agreement?
mempool → order → execute → stateTransactions take time to propagate
SEES TX-AHAS NOT SEEN TX-BSEES TX-BHAS NOT SEEN TX-ASEES TX-ASEES TX-BConsensus selects a canonical block and transaction order
BLOCK #106ORDER: A → BBLOCK #106ORDER: A → BBLOCK #106ORDER: A → BEach node independently executes the same inputs
S′ = F(S, A, B)EXECUTION COMPLETES′ = F(S, A, B)EXECUTION COMPLETES′ = F(S, A, B)EXECUTION COMPLETENodes derive the same state commitment
STATE #106ROOT 0xA81CSTATE #106ROOT 0xA81CSTATE #106ROOT 0xA81CEthereum’s “world state” primarily includes account balances, account nonces, contract code, and contract storage. It is not the truth of the entire physical world, nor does every ordinary node have to retain every piece of historical data forever. It is the current canonical state recognized by the protocol, together with commitments that let nodes verify it.
“Global” therefore describes the logical scope, while “synchronization” describes a process of convergence. A node may fall behind or go offline. After reconnecting, it can use blocks, state roots, and protocol rules to verify that it has caught up with the same canonical chain.
Neutral coordination comes with real costs
A blockchain exchanges redundant computation and public verification for shared state that does not depend on one operator. It addresses a specific trust structure; it is not the default upgrade for every information system.
| Capability | Primary mechanisms | Direct benefit | Costs and limits |
|---|---|---|---|
| Decentralization | Multiple nodes, client diversity, and consensus | Reduces single points of failure and unilateral control | Redundant execution and complex coordination; control may recentralize at the front-end or asset layer |
| Permissionless access | Open protocols and cryptographic identities | Open use, verification, and innovation | Spam, Sybil attacks, and compliance conflicts require fees and anti-abuse mechanisms |
| Tamper resistance | Hash-linked history, consensus, and finality | Auditable history that is difficult to rewrite secretly | Errors are hard to reverse; upgradeable contracts and community-coordinated forks still exist |
| State synchronization | Canonical ordering and deterministic execution | Prevents double-spends and lets applications share state | Propagation and confirmation take time; network-wide verification constrains throughput |
Six problems it does not solve automatically
Offchain truth
An oracle may publish incorrect data. Consensus can agree on a record; it cannot observe the physical world.
Private-key security
A signature produced with a stolen key may still be perfectly valid from the protocol’s perspective.
Correct code
Smart contracts can contain vulnerabilities, misconfigured permissions, and dangerous upgrade mechanisms.
Privacy by default
Public verifiability often makes data and transaction relationships easier to observe.
Unlimited scalability
Requiring all nodes to verify the same result inherently constrains base-layer throughput.
Fairness and justice
Protocol agreement does not make wealth, governance, transaction ordering, or real-world rules inherently fair.
When is a blockchain worth using?
A blockchain has an advantage when multiple parties must share the same digital state, no neutral administrator is trusted by everyone over the long term, and public verification, censorship resistance, open access, or digital-asset settlement matters enough to justify higher costs, latency, and irreversibility.
Systems such as a company’s internal inventory, personal notes, or school attendance records already have a clear owner and often need high throughput, privacy, and easy correction. An ordinary database is usually a better fit. A useful test is: If you can safely appoint one administrator, a blockchain will probably make the system slower and more expensive without adding enough value.
Compress the lesson into one chain of reasoning
- A central database is efficient, but power is concentratedThe administrator controls admission, ordering, state, and history—and is also a single point of failure.
- Multiple replicas remove the single point but introduce conflictsNodes may see different transactions, so they need common validity rules and canonical ordering.
- Signatures provide authorization; consensus provides orderingCryptography and protocol rules—not identity approval—determine whether a transaction can execute.
- Deterministic execution lets nodes derive the same stateThe same pre-state and ordered transactions must produce the same post-state.
- Hash commitments and economic security protect historyChanges become evident, while replacing history must also overcome consensus, penalties, and social coordination.
No single point; open participation. History resists rewrites; state converges.
Signatures authorize, consensus orders, execution computes, and hashes help verify history.
Five-question self-check
A blockchain primarily guarantees consistent, verifiable onchain state—not absolute truth about the physical world.
Sources and further reading
- ethereum.org: Nodes and clients — Nodes, execution clients, consensus clients, independent verification, and client diversity.
- ethereum.org: Technical intro to Ethereum — An introduction to transaction propagation, hash-linked blockchains, validators, and state transitions.
- ethereum.org: Proof-of-stake FAQ — Ethereum finality and the meaning of its economic security.
- ethereum.org: Ethereum Virtual Machine — How the EVM executes code consistently across nodes and changes world state.