What does a signature prove, and why can it not prove a sufficient balance?
A Ledger Everyone Can Verify
Start with one transfer that cannot be forged, replayed, or spent twice—not with consensus vocabulary.
We split signatures, nonces, balances, transactions, and blocks into visible state transitions to see why nodes can reject tampering and replay.
- YOUSender: authorize a state change with a key
- TOReceiver: wait for the state to be written
- NODENode: verify signature, nonce, and balance
- BLKBlock: fix transaction order and state root
One question per lesson
The lessons are ordered so that each one uses concepts introduced earlier.
- 01SIGNATURE · NONCE · STATE12 MIN
Who Authorized This Transfer?
KEY QUESTIONWhy can a perfectly valid signature still produce a failed transaction?
Follow a signed transaction into a block and see why tampering, replay, and balance violations are rejected.
→ - 02MEMPOOL · NONCE · REPLACEMENT13 MIN
Why Do Pending Transactions Queue?
KEY QUESTIONTwo pending transactions share a nonce. Can both pay?
Treat the transaction pool as a waiting room: see how one nonce can be replaced and why invalid transactions wait to be rejected.
→ - 03ORDER · REPLAY · STATE ROOT15 MIN
Why Must the Same Transactions Have the Same Order?
KEY QUESTIONHow can the same transaction set produce different balances when reordered?
Replay a chain from genesis with block hashes and state roots, then see how nodes detect divergent execution.
→ - 04CONFIRMATIONS · FINALITY14 MIN
What Is the Difference Between Confirmations and Finality?
KEY QUESTIONWhy distinguish finality after many confirmations?
Produce consecutive blocks and advance a simplified finality switch to separate ‘included’ from ‘safe to depend on’.
→
Questions covered in this course
How does a nonce stop the same transaction from executing twice?
How do balances and the state root change after a transaction enters a block?
Why are broadcasting, verification, packing, and finality different steps?