...during development of the Chain-Load, it became clear that we'll often need a collection of small trees rather than one huge graph. Thus a rule for pruning nodes and finishing graphs was added. This has the consequence that there might now be several exit nodes scattered all over the graph; we still want one single global hash value to verify computations, thus those exit hashes must now be picked up from the nodes and combined into a single value. All existing hash values hard coded into tests must be updated |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||