Last time, a secret key let you approve a payment. But who checks whether the payment follows the rules?
A computer running a full node does. Each full node checks for itself what it will accept into its own copy of the shared record.
Some computers, called miners, gather waiting payments into a batch called a block. A full node checks every payment in a proposed block, along with the block’s other rules. If a rule fails, it leaves the whole block out.
Picture three full nodes and the piece called P from lesson 2. P has already been spent in the shared record they each checked. Now a miner announces a block containing another payment that uses P.
Each full node asks two questions you already know: Is P unspent? No. Was the payment signed with P’s key? Say yes. That second answer cannot repair the first. Even the right key cannot spend an already spent piece again. Each full node rejects the block on its own.
Pause: a thousand computers now pass that proposed block on. Should this change any full node’s answer? Explain why before reading on.
No. The block still uses P again. Passing a message on changes how many computers hear it; it does not change whether P is available. Each full node checks the rules, not a headcount. All three cards in the figure reach their answers separately.
One full node’s rejection does not delete anyone else’s copy or make a decision for every computer. It decides only what it accepts into its own copy.
Most phone wallets do not check all these rules themselves. They ask someone else’s full node for information. Later, Lightning Network & Bitcoin Nodes, Course 4, shows how to run your own.
Explain it
For now, practise explaining the three independent checks on paper.
Check your understanding
1. A miner’s block uses P again. A thousand computers pass it on. Should a full node reject the block?
Show answer and explanation
The answer is B.
P is already spent, so each full node rejects the block even if many computers pass it on.
If you chose A:
A crowd cannot make a rule-breaking block pass the checks.
2. A payment uses Ben’s new piece, which has not been spent. The payment was not signed with Ben’s key. Thousands pass it on. Does a full node accept it?
Show answer and explanation
The answer is A.
Being unspent is not enough: the signature must pass the piece’s spending rule too.
If you chose B:
Passing the message on cannot supply the missing proof from Ben’s key.
3. A full node rejects a block many computers pass on. What has it done?
Show answer and explanation
The answer is B.
Each full node decides only what it accepts into its own copy of the shared record.
If you chose A or C:
A full node neither votes nor changes everyone else’s copy when it rejects a block.
What you can now explain
Each full node checks the rules, not a headcount.
A crowd passing a block on can’t make a spent P unspent.
Next · Lesson 5