Skip to content
Nothing Can Be FirstAll fifty notes

In order

The part that can be put in an order

Most of the map sorts into six layers and can be worked straight down. This part is what a plan would look like if the rest were not there.

52 of 94 · 6 layers

9 notes in this part

The fifty-two that behave

Most of the map is not tangled at all. Fifty-two of the ninety-four dependencies sort into a plain order, and this part is about what that order looks like.

Finding

The longest chain is six steps

Once the circular dependencies are removed, the deepest run of one-thing-after-another in the map is six steps and forty-eight days.

Finding

Ninety days, if there were no rings

Delete the forty-two circular dependencies and the whole map could be finished in ninety days — the length of its single slowest step.

Finding

Why a list is not a plan

A list of thirty-six things looks like a plan and is not one. The difference is forty-two dependencies, and no amount of ticking will reveal them.

Reference

After the file, a straight line

Once the file is lodged the map stops being a knot. Five steps remain and they run in sequence, ninety of their days a single wait.

Finding