Ben has ten copies of his message. Cara has one. Does Ben’s pile prove that his payment counts?
Bitcoin has no bank keeping the record. Instead, thousands of computers each keep a copy of one shared record, which Bitcoin Fundamentals calls the ledger. A computer that keeps a copy and checks every rule for itself is called a full node.
Copies can’t stop one trick. Take a piece of bitcoin in the shared record that hasn’t been spent yet, and call it P. Only Ana can spend P (lesson 3 shows how). She sends Ben a payment using P, then sends Cara a second payment using the same P. Both may get a message saying they were paid. But P can be spent only once. Spending the same money twice is called a double spend, and Bitcoin’s rules forbid it.
Pause and choose. Ben has ten copies of his message. Cara has one. Does Ben’s pile prove that his payment counts?
No. Ben’s ten messages are copies of one payment, and anyone can make copies. A pile of copies doesn’t decide which payment counts.
Which payment counts? Not the one heard about first or the one with more copies. Whichever payment gets into the shared record counts, and from then on every full node rejects the other. How a payment gets in is the first new idea in Bitcoin Fundamentals, lesson 1.
Say Ana’s payment to Ben is the one that gets in. P is used up whole. New pieces are made: one for Ben and, if P held more than the payment, one back to Ana. Each new piece has a lock saying which key can spend it. A wallet adds up your spendable pieces to show your balance. The pieces stay in the shared record; your phone only shows them. Bitcoin Fundamentals calls these pieces coins.
The names are only for our story. The shared record has no names in it. That doesn’t make it anonymous. People can often work out who paid whom from other clues.
Explain it
Before you stop, explain why Ben’s ten copies don’t beat Cara’s one.
Then compare with ours: a copy only tells more computers about a payment. It never makes a second P.
Check your understanding
1. Cara hears about her payment a minute before Ben hears about his. Does Cara’s payment count because of that?
Show answer and explanation
The answer is A.
Computers hear payments in different orders. What counts is which payment gets into the shared record.
If you chose B or C:
Hearing first doesn’t settle it.
2. P has been spent in the shared record a full node checks. Many computers repeat a later payment using P. Should the full node reject that payment?
Show answer and explanation
The answer is B.
P is already spent, so the later payment breaks the rules, however many computers repeat it.
If you chose A:
Repeating it doesn’t make P available again.
3. Three full nodes each keep a copy of Ana’s payment to Ben. How many payments is that?
Show answer and explanation
The answer is B.
It is one payment, copied three times.
If you chose A:
Each computer keeps information about the same payment.
What you can now explain
A copy only tells more computers about a payment. It never makes a second P.
What counts is which payment gets into the shared record.
Next · Lesson 3