BA-01 · LESSON 05

Networks and adversaries

Bitcoin nodes exchange information over an imperfect network. They must remain safe when messages arrive late, connections split, or peers lie.

35 min Difficulty 1/5 Not started

VISUAL MODEL

See the whole mechanism before going step by step

Use the diagrams to orient yourself. Then the guided explanation below teaches every part in depth.

4 explanatory views

CONCEPT-SPECIFIC MAP · state machineOne valid action transforms a known stateSelect any state to inspect its exact role.

RELATIONSHIP MAPOrdered mechanism flow

01
BEFOREKnown state
Identify the facts and objects that exist before the action.
02
ACTIONNetworks and adversaries
The Networks and adversaries lesson isolates the event that proposes a change.
03
RULEDeterministic check
The enforcing rule accepts or rejects the proposed transition.
04
AFTERSuccessor state
Accepted work creates a new state without silently changing the prior facts.
05
FAILUREState unchanged
A failed condition must not produce a partially accepted successor.

Rule shown: A valid transition names the prior state, action, enforcing rule, and successor state.

STAGE 1 OF 5BEFORE: Known state

Identify the facts and objects that exist before the action.

Governing relationship: A valid transition names the prior state, action, enforcing rule, and successor state. Complete path: 1. BEFORE, Known state. Identify the facts and objects that exist before the action. 2. ACTION, Networks and adversaries. The Networks and adversaries lesson isolates the event that proposes a change. 3. RULE, Deterministic check. The enforcing rule accepts or rejects the proposed transition. 4. AFTER, Successor state. Accepted work creates a new state without silently changing the prior facts. 5. FAILURE, State unchanged. A failed condition must not produce a partially accepted successor.

1. State transitionWhat exists, what changes, and what results

BEFORE

Node one and node two share the same tip. Miners produce competing valid blocks X and Y at the next height.

MECHANISM

A peer can announce a transaction or block, but the announcement does not make it valid. Each node checks received data locally.

AFTER

Temporary disagreement is expected. The protocol needs local validation plus a convergence rule, not instantaneous global knowledge.

Text equivalent: Starting from Node one and node two share the same tip. Miners produce competing valid blocks X and Y at the next height. The mechanism begins when A peer can announce a transaction or block, but the announcement does not make it valid. Each node checks received data locally. The resulting lesson is Temporary disagreement is expected. The protocol needs local validation plus a convergence rule, not instantaneous global knowledge.

2. Mechanism pathSelect a stage to inspect its job

STAGE 1 OF 5

Treat peers as data sources

A peer can announce a transaction or block, but the announcement does not make it valid. Each node checks received data locally.

Complete path: 1. Treat peers as data sources: A peer can announce a transaction or block, but the announcement does not make it valid. Each node checks received data locally. 2. Expect different arrival orders: Because latency varies, honest nodes can temporarily see conflicting messages in different orders without either node being broken. 3. Continue through partitions: Separated groups can each receive new data. They may hold different tentative tips until communication resumes. 4. Use an objective reconciliation rule: Bitcoin nodes accept only valid chains and choose the one with the most accumulated proof of work when valid histories compete. 5. Limit resource abuse: Peers can send expensive or useless data, so implementations use size limits, timeouts, peer scoring, and relay policies to protect availability.

3. Rule and failure boundaryWhat accepts the result and where it can stop

ACCEPTED PATH

Each node filters blocks through consensus validity before comparing accumulated proof of work among remaining branches.

CHANGED CONDITION

An invalid higher-work block is rejected, while an ongoing partition can preserve temporary disagreement until messages and additional valid work arrive.

Important distinction: Honest nodes must always have identical views of the network at every moment. Latency and partitions create temporary differences. Safety comes from validating locally, while eventual message delivery and chain selection support convergence.

Text equivalent: The accepted path is enforced by Each node filters blocks through consensus validity before comparing accumulated proof of work among remaining branches. If the required condition changes, An invalid higher-work block is rejected, while an ongoing partition can preserve temporary disagreement until messages and additional valid work arrive.

Loading lesson visuals...

Learn the idea

A network is a set of computers exchanging messages. Latency is delivery delay, a partition is a period when groups cannot communicate, and an adversary is a participant that may lie, withhold, reorder, or flood messages. A robust protocol must define what nodes can verify despite incomplete information.

GUIDED EXPLANATION1/5 ideas inspected

Treat peers as data sources

A peer can announce a transaction or block, but the announcement does not make it valid. Each node checks received data locally.

The worked example follows the explanation

Inspect every idea above to open it.

Important distinction“Honest nodes must always have identical views of the network at every moment.”

Latency and partitions create temporary differences. Safety comes from validating locally, while eventual message delivery and chain selection support convergence.

FINISH LEARNING FIRST

The questions unlock after every required learning activity

Inspect every guided idea, open the worked example, rebuild its mechanism, and complete the deterministic lesson tool. Your progress is saved automatically.