Learning Routes
Tracks
Four routes through the same 17 steps. Pick the one that matches what you already know; each ends somewhere the next one starts.
- You start knowing
- Loop Engineering — heartbeat, spine, maker/checker
- You finish able to
- explain why one memory file stops working past one loop; tell the two graphs apart
- You start knowing
- the two-graph split
- You finish able to
- run a fact through extraction → resolution → provenance; build a subgraph and a grounded checker
- You start knowing
- how to build and read one graph
- You finish able to
- wire multiple loops into a governance graph; name and fix the four failure modes
- You start knowing
- how to ship one graph
- You finish able to
- decide when not to build one; run graphs at scale; author new patterns
The 17-step roadmap
PART 1
Part 1 · The memory problem
PART 2
Part 2 · The DAG of work
PART 4
Part 4 · Working from the graph
PART 5
Part 5 · The graph of loops
PART 6
Part 6 · One graph end to end
PART 7
Part 7 · Staying grounded
Your progress
Kept in this browser only — nothing is sent anywhere and there is no account.
Step 0 of 17
- read Step 1 · When a Single Memory File Stops Being Enough
- read Step 2 · Graphs in Plain Terms
- read Step 3 · Keep Your Two Graphs Separate
- read Step 4 · The Ratchet — Recording Progress Without Losing the Trail
- read Step 5 · Letting Failed Branches Stay Queryable
- read Step 6 · Extraction — Schema First, Prose Second
- read Step 7 · Resolution — Merge Without Losing the Evidence
- read Step 8 · Provenance — Every Claim Carries a Receipt
- read Step 10 · The Grounded Checker
- read Step 9 · Give a Worker a Slice, Not the Whole Graph
- read Step 11 · Wiring Loops Together
- read Step 12 · The Four Ways a Lone Loop Fails Itself
- read Step 13 · Anchors and Frozen Nodes
- read Step 14 · Six Honest Questions Before You Build
- read Step 15 · One Small System, Built Twice
- read Step 16 · Recognizing the Skip-It Cases
- read Step 17 · How Much Governance the Job Actually Needs