How does the mechanism work?

Start by separating roles. Mining searches for a candidate header satisfying a target. Validation checks whether the entire candidate meets the rules. Relaying shares information with peers under local policy. One participant can perform several roles, but the jobs remain different. Receiving a block from many peers does not relieve a node of the need to check it.

Header checks include proof of work and the expected target in the chain context. Block checks include transaction commitments, permitted weight and structural requirements. Transaction checks resolve inputs, enforce spending conditions and prevent invalid value creation. Some checks need earlier state, so a collection of standalone transaction bytes is not enough to validate arbitrary chain history.

The UTXO set records outputs still available to spend in the accepted chain. Applying a block consumes referenced outputs and creates new ones. A later transaction in the same block can spend an earlier transaction’s output when all relevant rules pass. A spend cannot validly consume an already spent output simply because two peers advertised it.

State changes must be reversible when a node switches to a competing valid history. The node needs to undo outputs created by disconnected blocks and restore outputs they consumed before applying the replacement branch. This does not mean arbitrary balances are edited by an administrator. It means the node derives its current spendable set from the history it accepts. The distinction is useful when a payment loses inclusion during a reorganisation: its status follows the newly accepted history. Independent validation is therefore a continuing process over chain context, rather than a one-time approval that is attached permanently to transaction bytes.

What does a validating node check for itself?A validating node checks blocks and transactions against its own rules using the relevant history and unspent outputs. A miner’s proof of work is one requirement; it cannot replace valid signatures, balanced values or permitted issuance.Check header and workValidate every spendUpdate accepted UTXO state
Work selects among valid histories. It does not make an invalid state transition acceptable.

How do the protocol numbers work in an example?

Use an invented candidate at height 840,000. Its scheduled subsidy is 312,500,000 satoshis, or 3.125 BTC. Suppose its transactions pay 20,000 satoshis in fees. A issuance transaction output sum of 312,520,001 satoshis exceeds the permitted subsidy-plus-fee sum by 1 satoshi. The node rejects it even if its header meets the required target.

Next imagine the claimed reward is within bounds, but two transactions spend the same prior output. The node cannot apply both spends to one accepted state. A qualifying hash, a familiar sender address or a long peer list cannot repair the conflict. Each transaction must be valid in the context in which the block applies it.

issuance transaction outputs also have a maturity rule: they need 100 blocks of age before being spent. If a issuance transaction is created at height 900,000, height 900,100 is the earliest candidate height meeting that maturity comparison. This is a consensus constraint on that output, separate from an ordinary interface’s preferred confirmation count.

An excessive issuance fails despite valid workAt example height 840000, subsidy is 312500000 satoshis. Example fees add 20000. Claiming 312520001 is one satoshi too much and fails issuance validation.Subsidy: 312,500,000 satFees: add 20,000 satMaximum: 312,520,000 satClaim +1 sat → reject
The diagram follows the worked example. Sample heights and amounts illustrate the sourced rules.

Common misunderstandings

Validation is not a majority vote of connected peers. Peers supply data; the node applies its rules. More announcements of the same invalid block do not make its forbidden spend acceptable.

A pruned node and an archival node differ in retained historical block storage, rather than automatically in whether they validate received history. By contrast, a header-only or proof-based reader does not perform the same complete transaction checks. Describe the actual checks instead of treating every network-connected interface as equivalent.

A transaction missing from the local mempool can still appear in a valid block. Mempool admission includes policy choices, while block validity follows consensus rules. Likewise, finding an output in a database is only part of validation: its value, age and spending conditions still need to be checked.

Check yourself

Can a miner compensate for excessive issuance by finding a much lower header hash?

Reveal the answer

No. Proof of work and issuance validity are independent requirements. A block must pass both; extra work does not purchase an exception.

What does this diagram leave out?

This is a map of checks, not a complete validator implementation. Historical exceptions, script details and chain selection require the full specifications and implementation. The examples use invented candidate blocks and no live node data.