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

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

edge [ penwidth = 1.75, fontname="Sans", dir=none ]
node [ penwidth = 1.75, shape = "box", fontname="Sans", ]
graph [ penwidth = 1.75, fontname="Sans", fontsize = 16 ]

subgraph cluster_verified {
    graph [ penwidth = 0 ];
    node [ style = "filled" ];

    block0 [ width=0, style = "invis", label = "" ];
    block1 [ label = "1\nDownloaded\nFrom Node A" ];
    block2 [ label = "2\nDownloaded\nFrom Node B" ];


    label = "Downloaded And Validated\n "
}

block0 -> block1;
block1 -> block2;
block2 -> block3 -> block4 -> block5;

block5 -> block6 [ minlen = 2 ];

block6 [ style = "invis", width = 0, label = "" ];

subgraph cluster_download_window {
    block3 [ label = "3\nRequested\nFrom Node A" ];
    block4 [ label = "4\nDownloaded\nFrom Node B", style = "filled" ];
    block5 [ label = "5\nRequested\nFrom Node B" ];

    label = "Download Window\nBlocks Not Validated Yet"
}

label = " \nSimulated Headers-First Download Window (Real Window Is Much Larger)"

}
