digraph {
// This file is licensed under the MIT License (MIT) available on
// http://opensource.org/licenses/MIT.

size=6.25;
rankdir=LR
splines = "false";
ranksep = 0.2;
nodesep = 0.1;

edge [ penwidth = 1.75, fontname="Sans" ]
node [ penwidth = 1.75, shape = "box", fontname="Sans", ]
graph [ penwidth = 1.75, fontname="Sans" ]

subgraph cluster_mainchain {
block0 [ label = "1\n←Parent: 0" ];
block1 [ label = "2\n←Parent: 1" ];
block2 [ label = "3\n←Parent: 2" ];

style = "invis";
}

block0 -> block1 -> block2;

block0 -> block1_1;

block2 -> block5 [ style = "invis", minlen = 4 ];


block1_1 [ label = "2 (Stale)\n←Parent: 1", style = "filled" ];

block5 [ label = "5 (Orphan)\n←Parent: 4", style = "filled" ];

subgraph cluster_toplabel {
    node [ style = "invis", height = 0, width = 0, label = "" ];
    graph [ penwidth = 0 ];
    a -> b -> c -> d -> e -> f -> g [ style = "invis" ];
    label = "Orphan blocks have no known parent, so they can't be validated"
}

label = " \nStale blocks are valid but not part of the best block chain"

}