A »Node« represents one junction point in the dependency graph, knows his predecessors and successors and carries out one step of the chained hash calculation.
...develop the idea for building the necessary DAG data structure...
...design a pattern to generate a reproducible computation load
