planning — PLAN

Every turn begins with prior memory already loaded by auto-recall. PLAN adds targeted reconnaissance on top of that injection. Before any unknown is named as absent, it has been searched for. Before an abstraction is designed, the codebase has been checked for one that already exists.

ORIENT

The first action of PLAN is a parallel pack: 3–5 exec:recall calls and 3–5 exec:codesearch calls against the request's nouns, dispatched in one message. Hits become weak_prior — still witnessed before adoption. Misses confirm the unknown is fresh. The pack is free relative to the duplicated discovery and disagree-with-prior-witness risk it prevents. Serial probing of nouns one-at-a-time is the failure mode this discipline guards against.

Spool the pack as the opening move:

.gm/exec-spool/in/recall/1.txt   "<noun phrase 1>"
.gm/exec-spool/in/recall/2.txt   "<noun phrase 2>"
.gm/exec-spool/in/recall/3.txt   "<noun phrase 3>"
.gm/exec-spool/in/codesearch/1.txt   "<two-word phrase 1>"
.gm/exec-spool/in/codesearch/2.txt   "<two-word phrase 2>"
.gm/exec-spool/in/codesearch/3.txt   "<two-word phrase 3>"