BA-09 · LESSON 01

Peer discovery and handshakes

KEY DEFINITIONS

Terms used in this lesson

P2P: Peer-to-peer: nodes communicate directly with other nodes rather than through one central server.
DNS: Domain Name System: a naming service Bitcoin can use during peer discovery without trusting it to validate chain data.
TCP: Transmission Control Protocol: the reliable network connection over which a traditional Bitcoin peer session can exchange messages.
NODE_NETWORK: A Bitcoin peer service flag claiming that the peer can provide complete block data under the protocol's service rules.
Proof-of-work target: The maximum header-hash value accepted for a block; lowering it makes valid hashes harder to find.

Nodes discover peers, negotiate services, and exchange inventory without a central network registry.

35 min Difficulty 2/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 · p2p handshakePeers negotiate capabilities before exchanging inventorySelect any state to inspect its exact role.

RELATIONSHIP MAPIndependent peer relationships

01
TCPOutbound connection
The transport creates a byte stream to one network endpoint.
02
VERSIONProtocol 70016 and service flags
Each side advertises version, services, time, and a nonce.
03
CHECKCompatible and not self
Nonce and version checks prevent obvious self-connections and incompatible sessions.
04
VERACKHandshake complete
Verack acknowledges negotiation but conveys no consensus authority.
05
MESSAGESHeaders, inv, getdata
Every later object remains untrusted until locally parsed and validated.

Rule shown: A successful version and verack exchange opens a connection; it does not make the peer trusted.

STAGE 1 OF 5TCP: Outbound connection

The transport creates a byte stream to one network endpoint.

Governing relationship: A successful version and verack exchange opens a connection; it does not make the peer trusted. Complete path: 1. TCP, Outbound connection. The transport creates a byte stream to one network endpoint. 2. VERSION, Protocol 70016 and service flags. Each side advertises version, services, time, and a nonce. 3. CHECK, Compatible and not self. Nonce and version checks prevent obvious self-connections and incompatible sessions. 4. VERACK, Handshake complete. Verack acknowledges negotiation but conveys no consensus authority. 5. MESSAGES, Headers, inv, getdata. Every later object remains untrusted until locally parsed and validated.

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

BEFORE

New node N connects to peer P, which advertises a high starting height and NODE_NETWORK, the service flag claiming it can serve the full block chain.

MECHANISM

A fresh node queries seed sources for initial routable peers, while an established node uses its locally stored and peer-supplied address manager.

AFTER

Peer discovery supplies possible data sources. It does not choose trusted history.

Text equivalent: Starting from New node N connects to peer P, which advertises a high starting height and NODE_NETWORK, the service flag claiming it can serve the full block chain. The mechanism begins when A fresh node queries seed sources for initial routable peers, while an established node uses its locally stored and peer-supplied address manager. The resulting lesson is Peer discovery supplies possible data sources. It does not choose trusted history.

2. Mechanism pathSelect a stage to inspect its job

STAGE 1 OF 5

Obtain candidate addresses

A fresh node queries seed sources for initial routable peers, while an established node uses its locally stored and peer-supplied address manager.

Complete path: 1. Obtain candidate addresses: A fresh node queries seed sources for initial routable peers, while an established node uses its locally stored and peer-supplied address manager. 2. Open a transport connection: The node attempts outbound connections across supported network transports and applies diversity and anti-abuse selection policies. 3. Exchange version messages: Each side announces protocol version, service flags, timestamp, user agent, starting height, and relay preference under current message rules. 4. Acknowledge with verack: After receiving compatible version information, peers send verack and enable the remaining message flow. 5. Judge data locally: Service flags advertise capabilities but do not grant trust. The node validates every header, block, and transaction received from the peer.

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

ACCEPTED PATH

Peer selection checks reachability, required service bits, address-group diversity, and an ordered version then verack state machine before application messages flow.

CHANGED CONDITION

Duplicate or early handshake messages reject, missing services block the requested role, and a dishonest height claim never bypasses local header validation.

Important distinction: The peer advertising the highest block height becomes a new node's trusted chain source. Starting height is only a hint. The node downloads and validates headers and blocks, and chainwork selects among valid branches.

Text equivalent: The accepted path is enforced by Peer selection checks reachability, required service bits, address-group diversity, and an ordered version then verack state machine before application messages flow. If the required condition changes, Duplicate or early handshake messages reject, missing services block the requested role, and a dishonest height claim never bypasses local header validation.

Loading lesson visuals...

Learn the idea

Bitcoin's peer-to-peer (P2P) network has no central peer directory. A node can learn addresses from configured seeds, Domain Name System (DNS) seeds, prior address records, or connected peers. A Transmission Control Protocol (TCP) connection becomes a Bitcoin peer session after each side sends a version message and acknowledges the other's version with a version acknowledgement (verack) message. Those messages exchange protocol version, service claims, time, and synchronization information.

GUIDED EXPLANATION1/5 ideas inspected

Obtain candidate addresses

A fresh node queries seed sources for initial routable peers, while an established node uses its locally stored and peer-supplied address manager.

The worked example follows the explanation

Inspect every idea above to open it.

Important distinction“The peer advertising the highest block height becomes a new node's trusted chain source.”

Starting height is only a hint. The node downloads and validates headers and blocks, and chainwork selects among valid branches.

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.