Blockchain Network Simulator

Blockchain Network

Peer nodes 16

Network latency 1.2×

Block rate 4.0 s

Blocks mined

Network synced

Forks rejected

How it works

Each peer sits on a mesh of direct connections. When a node mines a block it broadcasts it to its immediate neighbors; every peer that receives it for the first time immediately re-broadcasts to its own unvisited neighbors. This is gossip propagation — no central server ever coordinates the spread, yet the message reaches the whole network in only a handful of hops.

Hᵢ = Hash(Hᵢ₋₁ ‖ Blockᵢ)
sync_time ≈ log(N) × hop_latency

Peer nodes — network size; more peers means more hops (roughly log-scaling) before every node holds the same latest block.
Network latency — multiplier on how long each hop takes; higher values simulate a slower, more geographically spread-out network.
Block rate — how often a new block is mined and broadcast, independent of whether the previous one has fully propagated.
Malicious fork — a rival node broadcasts a competing block at the same time. Because the honest majority already gossips the canonical chain, the fork never gains enough of the network and is orphaned — this is the same longest-chain rule that keeps a real blockchain secure without any central authority.

Real-world relevance: this hop-by-hop gossip protocol and its longest-chain conflict resolution are what let Bitcoin, Ethereum and similar networks reach agreement — and resist tampering — across thousands of independent, mutually distrusting computers.

Idle peer Has latest block Chain block Malicious fork pulse

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.