Navigate

Navigate

Pick the next wave on a bead graph and keep the graph honest toward its frozen acceptance. The root epic holds acceptance; each child bead is one experiment with one RPI. Navigate never edits acceptance, dispatches, judges or closes: Craft Goal owns the prompt and HOLD, Plan shapes a bead, Orchestrate dispatches, RPI runs, Validate judges.

One pass, when a person asks what is next on an epic: steps 1 and 2 plus hygiene, returning the wave in the step 4 shape instead of handing it off. Write nothing; change edges only on the caller's go-ahead; stop after one pass. Each wave of a running goal: steps 1 to 4.

Rules that decide the pick

• Closed is not proven. Only cited evidence for a criterion proves its row: the passing check that exercises it, or the Validate PASS where a fresh read was required. Closed status, a merge or an approving note leaves it open.
• Serve an open row. Pick only ready beads that serve an open criterion or a named blocking uncertainty; a bead tied to none is a hygiene finding.
• Stay disjoint. Picked write and generated scopes overlap neither each other nor any in-flight bead; an overlapping ready bead waits.
• Ready is a tracker state. An empty ready list does not prove completion; a closed prerequisite with missing or stale bytes is not usable readiness.

Speak the domain

• BDD: each criterion is a Given/When/Then example with an observable result. Each bead names the example it moves; a bead that lacks one gets Plan first inside its RPI.
• DDD: the root epic defines each domain term once, in one line. Titles, examples, code and tests reuse that exact word. A synonym is a hygiene finding; Domain settles disputes.
• Write a bead as its title, then its id: Locale fallback test (ag-12).

Bead graph contract

Root epic: outcome, acceptance examples, non-goals, authority, domain terms. Child bead: the question and the criterion or uncertainty it serves; method, expected observation, falsifier, scope, non-goals; notes enough to resume after compaction; verdict, evidence refs, learning.

Edges: parent-child for membership, blocks only for real ordering, related for alternatives, discovered-from for provenance. A requested retrospective never blocks code judgment; both stay required.

The tracker owns status and closing. BD is the example; any tracker with status, dependencies and notes fits. With BD, run bd context --json before any write; BR is a different tool, never a fallback or alias for BD. bv rank is advice; live BD beats it and any saved plan.

1. Observe

bd context --json                   # verify the destination first
bd show <epic>                      # outcome, acceptance, domain terms
bd children <epic>                  # direct children only; recurse into child epics
bd ready --parent <epic> --json     # ready frontier across descendants
bd blocked --parent <epic>          # blocked work
bd show <bead>; bd comments <bead>  # prior verdicts and evidence refs

Build the acceptance matrix (criterion, evidence, status) under the rules above; note in-flight beads with their scopes and any result limit you hit. Done when every criterion has a row and every open row names its bead, blocker or gap.

2. Pick the wave

When every row is proven, or no ready bead serves an open row, pick nothing, say which, and go to step 4. Otherwise pick the smallest set of ready beads with the most decision-relevant information that meets the rules above and fits the declared wave budget; no budget means one bead. Prefer an early falsifier.

Hand each bead to one RPI: through Orchestrate or Agent Native when delegation is authorized, one bead per worker, otherwise the caller's runtime. Its checks and CI are its result; it gets one fresh, author-distinct Validate only when the caller asks, a mistake cannot be cheaply undone after it lands, or no deterministic check covers the changed behavior, and a repair does not start another. Done when each picked bead has a one-line reason and a named handoff.