Playground

Try a network model

Choose a model for block propagation, competing spends, transaction amounts, mining share, or spending rules. Change one input and inspect the result; these local examples move no real money.

Why blocks arrive in parallelInteractive model
Two miners. Two independent blocks.

Miner 2 found C before hearing about B. Both blocks build on A.

Arrows reference earlier blocks.
A BLOCK earlier TRANSACTIONS Earlier block B BLOCK ref A TRANSACTIONS Miner 1 · 100 ms C BLOCK ref A TRANSACTIONS Miner 2 · 400 ms A BLOCK earlier TRANSACTIONS Earlier block B BLOCK ref A TRANSACTIONS Miner 1100 ms C BLOCK ref A TRANSACTIONS Miner 2400 ms

An illustrative two-miner model. Discoveries stay fixed at 100 and 400 ms. The same delay applies both ways. Packet positions show elapsed delivery, not physical distance.

Model assumptions and event times

Delivery occurs before discovery at an exact tie. Real mining is random. D is a possible later block, not a timed discovery. This example calculates neither GHOSTDAG nor confirmation confidence.

TimeEvent
0 msBoth miners know A.
100 msMiner 1 finds B, referencing A.
400 msMiner 2 finds C, referencing A.
600 msMiner 2 receives B.
900 msMiner 1 receives C.