Giving permission is different from making a transfer. Follow invented workshop counters to understand owner, spender, allowance and why a completed action may leave authority behind.
Begin with How Blockchain Works | Simplest Explanation. This book-style guide is for adults starting from the beginning and children reading with an adult. Its clubs, people and records are fictional teaching examples.
Continue into the matching Master Blockchain technical companion when the beginner ideas are clear.
Choose a reading route
Read all 18 chapters in order, or choose a route into the explanation.
- 1. Permission before action · Chapters 1–3
- 2. Read the allowance model · Chapters 4–7
- 3. Follow changes over time · Chapters 8–11
- 4. Check the authority boundary · Chapters 12–15
- 5. Practise with invented counters · Chapters 16–18
Full chapter index · Practice and answer check · Blockchain learning hub
Contents
Permission before action · Chapters 1–3
Read the allowance model · Chapters 4–7
Follow changes over time · Chapters 8–11
Check the authority boundary · Chapters 12–15
Practise with invented counters · Chapters 16–18
CHAPTER 1 OF 18 · Permission before action
1. The helper has permission, not possession
A fictional workshop gives members digital counters for recording activity. These counters have no monetary value and are not linked to a real token.
LARK allows helper REED to move up to six counters from LARK’s recorded balance through the workshop’s rules.
Granting that permission does not itself move six counters. It creates an authority that REED may be able to use later, subject to the model’s conditions.
This introduces the idea of a token allowance. In familiar ERC-20 designs, one account can approve another address to perform transfers on its behalf within a defined amount.
The technical details vary by implementation. Our paper workshop will use a simple finite allowance so the distinction is clear.
The first question is therefore not only “what moved?” It is also “who is still authorised to cause a later movement?”
LARK is the owner in our fictional allowance relationship. REED is the spender: the address granted the defined transfer authority. The workshop counter contract is the token whose rules hold that relationship.
The word spender does not mean REED necessarily receives every counter. In an ERC-20 transferFrom-style operation, the authorised caller can request a transfer from the owner to a destination permitted by the implementation.
This distinction matters because the authority holder and the destination can be different.
Our paper model writes all three roles explicitly before adding a recipient.
A useful evidence note identifies the network and token contract as well as owner and spender. A familiar logo or short label is not enough to distinguish every system. The allowance belongs to a particular relationship in a particular contract context, not to the abstract idea of an application’s brand.
CHAPTER 3 OF 18 · Permission before action
3. Balance and allowance answer different questions
LARK has ten fictional counters. REED has permission to move up to six. Ten describes the recorded balance; six describes REED’s authority under the simple allowance model.
These are not two names for the same quantity.
If LARK’s balance changes, that does not necessarily mean the permission changes in the same way. A transfer attempt may need to satisfy both the available balance and the applicable authority conditions.
For beginners, draw separate boxes marked balance and allowance. Do not subtract the allowance from balance merely because permission was granted.
This is a frequent source of confusion in interfaces. A screen may report an approval amount beside a token quantity. To interpret it correctly, ask whether the field concerns possession, authorisation or an actual completed movement. The answer changes what the displayed number means.
In our fictional model, LARK approves an allowance of six for REED. The state now records that permission while LARK’s ten-counter balance remains unchanged.
The ERC-20 approve interface concerns setting an allowance for a spender. It is not the same action as transferring the approved quantity.
A transaction can therefore succeed while no token transfer of that amount has occurred. Its successful effect may be the permission update itself.
The block-explorer guide teaches why execution success needs to be interpreted against the intended operation. Here the intended operation is authorisation.
Write the before and after states: balance ten in both; REED’s allowance changes from zero to six.
The exercise needs no real wallet. Its purpose is to make the state change visible. A grant of future authority is an important result even though it does not appear as an immediate movement of the counters.
REED now requests a transfer of two counters from LARK to PINE under our simple workshop rules. Suppose all required conditions are satisfied.
LARK’s balance becomes eight, PINE receives two and the finite remaining allowance becomes four in this teaching model.
The operation used part of the permission. It did not use all six.
Actual token implementations can have special behaviour, including treatment of very large allowances or additional conditions. This guide does not assume every contract behaves exactly like the paper example.
The beginner lesson is the sequence: grant permission, use part of it, inspect what remains.
A report saying “the workshop action finished” does not by itself establish that every earlier authorisation disappeared. That conclusion needs evidence about the actual remaining permission state, not only the completion of one transfer.
CHAPTER 6 OF 18 · Read the allowance model
6. Small actions can leave a larger permission
The fictional workshop asks REED to move two counters, but LARK’s allowance was six. After the successful two-counter move in our finite model, four remain authorised.
The intended size of one task and the granted scope of authority can differ.
This is why a permission discussion should name the allowance rather than only the immediate action. The unused part may matter later.
We are explaining a model, not advising readers to approve a particular token or use a particular service.
For a classroom comparison, give REED permission for exactly two counters in one case and six in another. Perform the same two-counter move in both. The balances can end identically while the remaining authority differs.
This is a useful systems lesson: two workflows can have the same visible completed action and different permission consequences afterward.
CHAPTER 7 OF 18 · Read the allowance model
7. Ordinary allowances do not all expire on a clock
The fictional model does not include an automatic expiry time. REED’s unused finite permission remains until the relevant rules change it.
The basic ERC-20 allowance interface does not itself specify a universal automatic expiry field. Extensions and particular applications can introduce other mechanisms.
Do not infer a time limit simply because a browser tab closes or a workshop session ends.
An explanation should identify which event actually changes the on-chain permission. Was the allowance consumed, replaced or otherwise modified under the contract’s rules?
This is another reason to separate interface state from authority state. A page saying session ended can describe the website interaction without establishing anything about a recorded allowance.
The useful question is precise: what is the permission now in the applicable contract context, and which rule makes it end?
CHAPTER 8 OF 18 · Follow changes over time
8. Disconnecting an interface is a different action
LARK closes the fictional workshop page. The page is no longer interacting with the device, but the allowance recorded in the counter contract is not changed by that fact alone.
Disconnecting a website and changing a token’s on-chain permission are different operations.
A real application’s controls must be understood from their actual behaviour. A button label should not be treated as proof that every related authority has been removed.
Our paper model illustrates the separation by placing the website card and allowance card on different parts of the table. Removing one card does not erase writing on the other.
The lesson is not to distrust every interface. It is to identify the state each control affects.
A clear explanation says whether an action changes a local connection, an application session or a permission enforced by a token contract. Those boundaries matter whenever an old authority could still be relevant.
CHAPTER 9 OF 18 · Follow changes over time
9. Replacing an allowance is not adding another amount
In the basic ERC-20 approve interface, setting a new value replaces the current allowance for that spender rather than simply adding a second independent allowance.
Our fictional example begins with four remaining. A later accepted setting of three produces three under that simple replacement rule, not seven.
The ordering of permission changes and transfers can matter. The standard itself discusses considerations around changing allowances.
This guide does not supply a sequence of live transactions or promise a universal safe procedure. Actual implementations and pending activity need appropriate technical handling.
For beginners, the important reasoning task is to identify what each operation means. Does it set a value, increase it, decrease it or use it? Similar interface wording can hide different operations.
Write the exact fictional rule next to each action so the arithmetic follows the mechanism rather than the reader’s guess.
CHAPTER 10 OF 18 · Follow changes over time
10. A requested reduction is not yet an applied reduction
LARK asks to change REED’s fictional permission, but the request is still waiting to be processed. The workshop’s accepted state has not yet changed.
The distinction between intent and accepted state matters for permissions just as it matters for transfers.
A submitted change does not establish that every participant already treats the new value as effective. Ordering and settlement context can affect the interpretation.
Our paper timeline has separate rows for request submitted and update accepted. Between those rows, the model still uses its applicable existing state.
This is a conceptual example, not operational guidance about competing live transactions.
The useful evidence statement names the observed stage. “A permission change was requested” and “the allowance is now three at this reference point” are different claims. A careful explanation does not let the first sentence silently substitute for the second.
CHAPTER 11 OF 18 · Follow changes over time
11. A very large value has implementation-specific effects
An interface may describe a permission as unlimited. The underlying representation and treatment depend on the contract and related mechanisms.
Some ERC-20 implementations treat a maximum-sized allowance specially rather than reducing it on each authorised transfer. Others may behave differently or impose additional rules.
Our finite six-counter model therefore cannot be used to infer every real remaining allowance.
The beginner takeaway is about scope: a permission larger than the immediate task can authorise more than that task, subject to the implementation and available balance.
Do not infer an amount from an adjective alone. A technical review needs the actual recorded value and behaviour.
This guide avoids recommending any approval size. It gives readers the vocabulary to ask what the contract will permit, rather than assuming every completed action leaves a small or zero remainder.
CHAPTER 12 OF 18 · Check the authority boundary
12. A signed message can also carry authority
Not every authorisation begins with the same visible transaction flow. ERC-2612 describes a signed permit mechanism that can update an ERC-20 allowance through a defined verification process.
The signed message, its context and its permitted use matter. A message is not automatically harmless because the signer did not directly submit the later transaction.
This is the narrow lesson we need here. We are not providing signing instructions or asking readers to test a real permit.
Our fictional workshop could use a properly specified authorisation card that another party later presents. The analogy explains why issuing permission and applying it can be separate events.
A reader should ask what the signed material authorises, under which contract rules and with which conditions. The absence of an immediate balance change does not establish the absence of future authority.
CHAPTER 13 OF 18 · Check the authority boundary
13. Do not combine different approval systems
ERC-20 allowances, an NFT’s operator approval and a smart account’s owner threshold are different permission mechanisms.
They may all appear in one application, but they do not have identical scopes or rules.
Our fictional helper’s six-counter allowance applies only to the defined counter contract relationship. It does not automatically authorise every action in the workshop.
The multisignature guide asks which parties can approve an account operation. This guide asks which spender may transfer a particular token amount on an owner’s behalf.
Keeping those questions separate makes the control map clearer.
When reading a permission screen, identify the mechanism before interpreting its result. The word approve is ordinary language used for several technical operations. A careful explanation names the affected contract, authority holder, action and limit instead of treating all approvals as one universal permission.
CHAPTER 14 OF 18 · Check the authority boundary
14. A spender address needs its own interpretation
The fictional interface calls REED Workshop Helper. That label is a description supplied by the interface. The contract records the relevant address and permission relationship.
A familiar name does not, by itself, establish who controls that address or how a spender contract behaves.
This connects allowances to the block-explorer and identity guides. Address labels, operational control and technical permissions are different evidence layers.
The allowance’s scope can be described without resolving every identity claim. But a broader claim that the authority belongs to a particular trusted organisation needs separate support.
Our paper note records both the fictional label and its role, while admitting that real control would require investigation.
The useful habit is to avoid letting a brand name substitute for a permission analysis. First establish what the mechanism permits; then examine the evidence about who or what can exercise it.
CHAPTER 15 OF 18 · Check the authority boundary
15. Historical events do not always answer current permission
A past Approval event can provide evidence that a permission-setting action occurred. It is not automatically a complete answer about the allowance now.
Later actions can use or change permission. Implementations may differ in which events accompany those changes.
A current-state question needs evidence appropriate to the relevant contract and reference point.
Our fictional notebook shows an approval of six followed by a transfer of two. A reader who sees only the first announcement has an incomplete view of the finite model.
The logs-and-events guide explains why historical messages and current state should be distinguished.
A careful sentence says what was observed: a past approval amount, a later transfer or a queried allowance at a specified point. Do not collapse them into one timeless permission claim. The state of authority is something that can change across the workflow.
CHAPTER 16 OF 18 · Practise with invented counters
16. Write a complete permission sentence
Try describing the fictional state without the word safe: “On Practice Network, Counter Contract C records that REED may transfer up to four remaining counters from LARK under the model’s rules.”
The sentence names the network, contract, owner, spender and remaining amount.
Now add the reference point and any important special conditions. Those details tell another reader what the claim concerns.
This is more informative than “the workshop was approved” because it identifies the actual authority.
For real systems, determining the state can require technical work beyond a beginner interface. Our exercise does not pretend otherwise.
The aim is to make the question well formed. Once the permission relationship is explicit, it becomes easier to distinguish possession, grant, use, remaining authority and a later change. Clear vocabulary prevents a completed action from hiding a continuing capability.
Give LARK ten imaginary counters and REED zero permission. Record both values in separate boxes.
Set REED’s permission to six without moving counters. Then perform one valid two-counter transfer to PINE under the finite model. Record LARK’s balance eight and REED’s remaining allowance four.
Close the paper website card. Explain why that action does not change either recorded number.
Next apply an accepted replacement allowance of three. Contrast it with a request for that change that has only been submitted.
Finally introduce a separate NFT-operator card and explain why it is not governed by the same six-counter rule.
No real signatures, tokens or accounts are used. The exercise is complete when a reader can follow the authority state as carefully as the balance state, while remembering that real implementations require their own specific interpretation.
CHAPTER 18 OF 18 · Practise with invented counters
18. The question is what remains authorised
Token approvals are easier to understand when permission and movement stay separate. An approval can change authority without moving the approved quantity. A later operation can use part of that authority.
A finished application task, closed tab or disconnected interface does not by itself establish that the token permission has ended.
The exact result depends on the contract, current state and applicable mechanisms. Finite allowances, special large-value handling and signed permits should not be treated as identical flows.
Carry five labels into the technical companion: token, owner, spender, amount and reference context.
The goal is not to encourage a beginner to operate live permissions. It is to teach a more complete reading of an application’s effect. Ask not only what happened in the last action, but which authority still exists after that action is over.
Worked situations
Keep the evidence and the conclusion together in these fictional situations.
| Situation | Careful interpretation | Next check |
|---|---|---|
| An allowance of six is granted | Permission changes without moving six counters | Separate balance and allowance |
| Two counters move under a finite allowance | The simple model may leave four authorised | Inspect remaining permission |
| A website is disconnected | The interface connection changed | Do not infer an on-chain allowance update |
| An old Approval event shows six | It records a historical event | Use appropriate evidence for current state |
Check your understanding
Explain your answers in your own words before reading the answer check.
- Does approval itself transfer the approved amount?
- Is spender always the destination?
- Can balance and allowance differ?
- Does closing a page erase allowance?
- Why identify the implementation?
Answer check: No. The authorised spender and transfer destination can differ. Yes: possession and permission are separate. No, not by that action alone. Implementations and extensions can differ in allowance consumption, large-value treatment and authorisation flows.
Continue learning
Revisit the foundations or choose another subject in the beginner series.
- Simplest Explanation
- A Record’s Journey
- Digital Fingerprints
- Keys and Digital Signatures
- Nodes and Shared Copies
- Consensus and Agreement
- Smart Contracts and Rules
- Oracles and the Outside World
- Public, Private and Consortium Networks
- Confirmations and Finality
- Wallets and Custody
- Tokens and What They Represent
- Supply Chains and Handovers
- Certificates and Credentials
- Databases and When Blockchain Helps
- Scaling and Layers
- Bridges Between Networks
- Fees and Computing Resources
- Governance and Upgrades
- Privacy and What Records Reveal
- Zero-Knowledge Proofs
- Block Explorers and Reading a Record
- Testing Rules and Finding Mistakes
- Merkle Trees and Small Proofs
- Data Availability and Missing Pieces
- Forks and Changing Histories
- Digital Identity and Proving Who You Are
- Light Clients and Checkpoints
- Multisignature and Shared Control
- Network Delays and Partitions
- Incident Response and Recovery
Read the technical companion · Structured learning guide · English–Chinese learning hub
References and scope
- ERC-20: Token interface and allowances
- OpenZeppelin: ERC-20 implementation reference
- ERC-2612: Signed permit extension
Primary references checked on 15 October 2026. Ethereum standards and Solidity-specific behaviour do not describe every blockchain. The paper exercises are fictional, not reports of deployed systems, financial recommendations or instructions for operating live permissions. The discussion of NFT rights is general information, not advice about a particular legal arrangement.
How Blockchain Works · beginner reading sequence: 1. Simplest Explanation · 2. A Record’s Journey · 3. Digital Fingerprints · 4. Keys and Digital Signatures · 5. Nodes and Shared Copies · 6. Consensus and Agreement · 7. Smart Contracts and Rules · 8. Oracles and the Outside World · 9. Public, Private and Consortium Networks · 10. Confirmations and Finality · 11. Wallets and Custody · 12. Tokens and What They Represent · 13. Supply Chains and Handovers · 14. Certificates and Credentials · 15. Databases and When Blockchain Helps · 16. Scaling and Layers · 17. Bridges Between Networks · 18. Fees and Computing Resources · 19. Governance and Upgrades · 20. Privacy and What Records Reveal · 21. Zero-Knowledge Proofs · 22. Block Explorers and Reading a Record · 23. Testing Rules and Finding Mistakes · 24. Merkle Trees and Small Proofs · 25. Data Availability and Missing Pieces · 26. Forks and Changing Histories · 27. Digital Identity and Proving Who You Are · 28. Light Clients and Checkpoints · 29. Multisignature and Shared Control · 30. Network Delays and Partitions · 31. Incident Response and Recovery · 32. Transaction Order and Fairness · 33. Token Approvals and Remaining Permission · 34. NFTs, Metadata and Linked Files · 35. Logs, Events and Application Memory · 36. UTXOs and Change Outputs · 37. Proof of Work and Targets · 38. Proof of Stake and Validator Duties · 39. Post-Quantum Cryptography and Migration · 40. Virtual Machines and Replaying Rules · 41. All-or-Nothing Execution and Its Boundaries · 42. Client Diversity and Software Independence · 43. Benchmarks, Throughput and Finality · 44. Encoding and Serialisation · 45. RPC Requests and Access Points · 46. State Snapshots, Pruning and Archives · 47. Timestamps and Clock Limits · 48. Commit–Reveal and Hidden Choices · 49. Proxies and State-Preserving Upgrades · 50. Formal Verification and Model Limits · 51. Content Addressing and File Retrieval
