elanous 0.2.32 → 0.2.35

package/src/self-implement/graph-unit-flatten.ts

@@ -0,0 +1,103 @@
+import type { GraphEdgeSpec, GraphTemplateSpec } from './graph-yaml.js';
+
+export interface StaticGraphUnit {
+  readonly path: string;
+  readonly template: GraphTemplateSpec;
+}
+
+export type StaticUnitResolver = (call: string, callerPath: string) => StaticGraphUnit;
+
+/** Expand calls for static readers (PWA/anatomy) while the runner keeps executing child runs. */
+export function flattenGraphUnits(
+  graph: GraphTemplateSpec,
+  graphPath: string,
+  resolve: StaticUnitResolver,
+  ancestors: readonly string[] = [],
+): GraphTemplateSpec {
+  if (ancestors.includes(graph.graphId)) throw new Error(`unit cycle: ${[...ancestors, graph.graphId].join(' -> ')}`);
+  if (ancestors.length > 3) throw new Error('unit nesting exceeds depth 3');
+
+  let nodes = [...graph.nodes];
+  let edges = [...graph.edges];
+  let entryNode = graph.entryNode;
+  const terminals = [...graph.terminalNodes];
+
+  for (const callNode of graph.nodes) {
+    if (callNode.kind !== 'subgraph' || !callNode.call) continue;
+    const unit = resolve(callNode.call, graphPath);
+    const unitHeader = unit.template.unit;
+    const selectedEntry = callNode.callEntry ?? unit.template.entryNode;
+    if (!unitHeader || !(unitHeader.entries ?? [unit.template.entryNode]).includes(selectedEntry)) {
+      throw new Error(`unit entry mismatch: ${callNode.nodeId} -> ${selectedEntry}`);
+    }
+    const nested = flattenGraphUnits({ ...unit.template, entryNode: selectedEntry }, unit.path, resolve, [...ancestors, graph.graphId]);
+    // Earlier calls may already have rewritten this call's destinations.
+    const outgoing = edges.find((edge) => edge.from === callNode.nodeId);
+    if (!outgoing || outgoing.on !== 'outcome' || !outgoing.map ||
+        Object.keys(outgoing.map).length !== unitHeader.exits.length ||
+        unitHeader.exits.some((exit) => !Object.hasOwn(outgoing.map!, exit)) ||
+        !callNode.contract ||
+        callNode.contract.inputs.length !== unitHeader.inputs.length ||
+        callNode.contract.inputs.some((key) => !unitHeader.inputs.includes(key)) ||
+        callNode.contract.outputs.length !== unitHeader.outputs.length ||
+        callNode.contract.outputs.some((key) => !unitHeader.outputs.includes(key))) {
+      throw new Error(`unit contract mismatch: ${callNode.nodeId} -> ${callNode.call}`);
+    }
+
+    const prefix = (id: string) => `${callNode.nodeId}__${id}`;
+    const childIds = new Map(nested.nodes.map((node) => [node.nodeId, prefix(node.nodeId)]));
+    const parentIds = new Set(nodes.filter((node) => node.nodeId !== callNode.nodeId).map((node) => node.nodeId));
+    for (const node of nested.nodes) {
+      if (!unitHeader.exits.includes(node.nodeId) && parentIds.has(prefix(node.nodeId))) {
+        throw new Error(`flattened unit node collision: ${prefix(node.nodeId)}`);
+      }
+    }
+    const exitTargets = new Map(unitHeader.exits.map((exit) => [exit, outgoing.map![exit]!]));
+    if (unitHeader.exits.includes(nested.entryNode) && exitTargets.get(nested.entryNode) === callNode.nodeId) {
+      throw new Error(`unit entry exit cannot map back to its own call: ${callNode.nodeId} -> ${nested.entryNode}`);
+    }
+    const childEntry = unitHeader.exits.includes(nested.entryNode)
+      ? exitTargets.get(nested.entryNode)!
+      : childIds.get(nested.entryNode);
+    if (!childEntry) throw new Error(`unit entry missing: ${callNode.nodeId} -> ${selectedEntry}`);
+    const childTarget = (id: string): string => {
+      if (unitHeader.exits.includes(id)) {
+        const target = exitTargets.get(id)!;
+        // A caller exit mapped back into its own call re-enters the flattened unit at its entry.
+        return target === callNode.nodeId ? childEntry : target;
+      }
+      const mapped = childIds.get(id);
+      if (!mapped) throw new Error(`unit edge target missing: ${unit.template.graphId}/${id}`);
+      return mapped;
+    };
+
+    const rewriteTarget = (edge: GraphEdgeSpec, target: string): string => target === callNode.nodeId ? childEntry : target;
+    const rewrittenParentEdges = edges
+      .filter((edge) => edge.from !== callNode.nodeId)
+      .map((edge) => ({
+        ...edge,
+        from: rewriteTarget(edge, edge.from),
+        ...(edge.to ? { to: rewriteTarget(edge, edge.to) } : {}),
+        ...(edge.map ? { map: Object.fromEntries(Object.entries(edge.map).map(([outcome, target]) => [outcome, rewriteTarget(edge, target)])) } : {}),
+        ...(edge.fallback ? { fallback: edge.fallback.map((item) => ({ ...item, node: rewriteTarget(edge, item.node) })) } : {}),
+      }));
+    const childNodes = nested.nodes.filter((node) => !unitHeader.exits.includes(node.nodeId))
+      .map((node) => ({ ...node, nodeId: childIds.get(node.nodeId)! }));
+    const childEdges = nested.edges.filter((edge) => !unitHeader.exits.includes(edge.from)).map((edge) => ({
+      ...edge,
+      from: childIds.get(edge.from) ?? childTarget(edge.from),
+      ...(edge.to ? { to: childTarget(edge.to) } : {}),
+      ...(edge.map ? { map: Object.fromEntries(Object.entries(edge.map).map(([outcome, target]) => [outcome, childTarget(target)])) } : {}),
+      ...(edge.fallback ? { fallback: edge.fallback.map((item) => ({ ...item, node: childTarget(item.node) })) } : {}),
+    }));
+
+    nodes = nodes.filter((node) => node.nodeId !== callNode.nodeId).concat(childNodes);
+    edges = rewrittenParentEdges.concat(childEdges);
+    if (entryNode === callNode.nodeId) entryNode = childEntry;
+    // Unit exits are replaced by their caller's mapped destinations. `terminals`
+    // belongs to the parent graph; removing by child exit name can erase a
+    // same-named parent terminal that is still present in the flattened graph.
+  }
+
+  return { ...graph, entryNode, terminalNodes: terminals, nodes, edges, unit: undefined };
+}

package/src/self-implement/graph-unit-resolver.ts

@@ -0,0 +1,107 @@
+import { createHash } from 'node:crypto';
+import { existsSync, readFileSync, readdirSync } from 'node:fs';
+import { dirname, join } from 'node:path';
+import { fileURLToPath } from 'node:url';
+import { parse as parseYaml } from 'yaml';
+import { getElanousConfigDir } from '../elanous-config-dir.js';
+import { parseGraphTemplateYaml, type GraphTemplateSpec } from './graph-yaml.js';
+import { flattenGraphUnits, type StaticGraphUnit } from './graph-unit-flatten.js';
+
+export type ResolvedGraphUnit = StaticGraphUnit & { readonly hash: string };
+
+export class UnitNotFoundError extends Error {
+  constructor(call: string) {
+    super(`unit not found: ${call}`);
+    this.name = 'UnitNotFoundError';
+  }
+}
+
+type UnitCandidate = ResolvedGraphUnit | { readonly path: string; readonly version: unknown; readonly error: string };
+type UnitIndex = Map<string, UnitCandidate[]>;
+type IndexCache = Map<string, UnitIndex>;
+
+function looseTopLevelScalar(source: string, key: string): unknown {
+  const match = source.match(new RegExp(`^${key}:\\s*(.*?)\\s*(?:#.*)?$`, 'm'));
+  if (!match) return undefined;
+  try { return (parseYaml(`value: ${match[1] ?? ''}`) as { value?: unknown }).value; }
+  catch { return match[1]?.trim(); }
+}
+
+function indexUnits(dir: string): UnitIndex {
+  const byId: UnitIndex = new Map();
+  const yamlFiles = (root: string): string[] => readdirSync(root, { withFileTypes: true }).flatMap(entry => {
+    const path = join(root, entry.name);
+    if (entry.isDirectory()) return yamlFiles(path);
+    return entry.isFile() && /\.ya?ml$/.test(entry.name) && entry.name !== 'recipes.yaml' && entry.name !== 'recipes.yml' ? [path] : [];
+  });
+  for (const path of yamlFiles(dir)) {
+    const source = readFileSync(path, 'utf8');
+    let header: unknown;
+    try { header = parseYaml(source); }
+    catch (error) {
+      // A malformed YAML document can still explicitly declare a graph ID and
+      // unit header. Keep that broken declaration visible to block fallback.
+      const id = looseTopLevelScalar(source, 'graph_id');
+      if (typeof id !== 'string' || !/^unit\s*:/m.test(source)) continue;
+      const candidates = byId.get(id) ?? [];
+      candidates.push({
+        path,
+        version: looseTopLevelScalar(source, 'version'),
+        error: `YAML parsing failed: ${error instanceof Error ? error.message : String(error)}`,
+      });
+      byId.set(id, candidates);
+      continue;
+    }
+    if (!header || typeof header !== 'object' || Array.isArray(header)) continue;
+    const id = (header as Record<string, unknown>).graph_id;
+    if (typeof id !== 'string') continue;
+    const version: unknown = (header as Record<string, unknown>).version;
+    const parsed = parseGraphTemplateYaml(source, path);
+    if (parsed.errors.length) {
+      if (!Object.hasOwn(header, 'unit')) continue;
+      const candidates = byId.get(id) ?? [];
+      candidates.push({ path, version, error: parsed.errors.map((issue) => issue.message).join('; ') || 'unit header missing' });
+      byId.set(id, candidates);
+      continue;
+    }
+    if (!parsed.template?.unit) continue;
+    const candidates = byId.get(id) ?? [];
+    candidates.push({ path, template: parsed.template, hash: createHash('sha256').update(source).digest('hex') });
+    byId.set(id, candidates);
+  }
+  return byId;
+}
+
+/** Resolve unit calls with the runner's existing precedence and version contract. */
+export function resolveGraphUnit(call: string, callerPath: string, cache?: IndexCache): ResolvedGraphUnit {
+  const [id, requested] = call.split('@');
+  const repo = join(dirname(fileURLToPath(import.meta.url)), '..', '..');
+  const directories = [join(dirname(callerPath), 'units'), dirname(callerPath), join(repo, 'graphs', 'units'), join(getElanousConfigDir(), 'graphs', 'units')];
+  for (const dir of directories) {
+    if (!existsSync(dir)) continue;
+    const byId = cache?.get(dir) ?? indexUnits(dir);
+    if (cache && !cache.has(dir)) cache.set(dir, byId);
+    const matches = (byId.get(id!) ?? []).filter((candidate) => {
+      const version = 'template' in candidate ? candidate.template.version : candidate.version;
+      if (!('template' in candidate) && (typeof version !== 'number' || !Number.isFinite(version))) return true;
+      return requested === String(version) || requested === `^${version}`;
+    });
+    if (matches.length > 1) throw new Error(`ambiguous unit: ${call}`);
+    if (matches.length) {
+      const match = matches[0]!;
+      if (!('template' in match)) throw new Error(`invalid graph unit: ${call} at ${match.path}: ${match.error}`);
+      return match;
+    }
+  }
+  throw new UnitNotFoundError(call);
+}
+
+export function createGraphUnitResolver(): (call: string, callerPath: string) => ResolvedGraphUnit {
+  const cache: IndexCache = new Map();
+  return (call, callerPath) => resolveGraphUnit(call, callerPath, cache);
+}
+
+/** Shared server-side static view used by PWA, anatomy, and runner verification. */
+export function flattenGraphTemplate(graph: GraphTemplateSpec, graphPath: string): GraphTemplateSpec {
+  return flattenGraphUnits(graph, graphPath, createGraphUnitResolver());
+}

package/src/self-implement/graph-yaml.ts

@@ -4,6 +4,7 @@ import { readFileSync, readdirSync } from 'node:fs';
 import { join } from 'node:path';
 import { parse as parseYaml } from 'yaml';
 import { HARNESS_CORE_KINDS, hasNodeKind } from '../graph-kinds/registry.js';
+import { parseOverlayCondition } from './graph-overlay-condition.js';
 
 /** ⭐ RFC-graph-templates-as-yaml §5 «0단계» — YAML 저작본을 읽어 실행·해시·원장용 정규형으로.
  *
@@ -36,6 +37,8 @@ export interface GraphNodeSpec {
   /** Entry selected by this call when a unit exposes more than one entry. */
   readonly callEntry?: string;
   readonly budget?: { readonly innerSteps: number };
+  /** L1: skip this optional node when a measured state condition holds. */
+  readonly skipWhen?: string;
 }
 
 export interface GraphEdgeSpec {
@@ -48,6 +51,8 @@ export interface GraphEdgeSpec {
   /** 심이 «주입 안 됐을 때» 내려가는 순서. `requires` 는 그 심 이름들. */
   readonly fallback?: readonly { readonly node: string; readonly requires: readonly string[]; readonly observed?: number }[];
   readonly observed?: number;
+  /** L1: a measured state condition takes precedence over the default edge. */
+  readonly when?: string;
 }
 
 export interface GraphTemplateSpec {
@@ -63,10 +68,41 @@ export interface GraphTemplateSpec {
   /** ⭐ 런 계약(선택) — 이 그래프가 «기본으로» 요구하는 실행 칸 등. 발사 인자가 덮는다(graph-run-contract.ts). */
   readonly runContract?: GraphRunContractSpec;
   readonly unit?: { readonly inputs: readonly string[]; readonly outputs: readonly string[]; readonly exits: readonly string[]; readonly entries?: readonly string[] };
+  /** Non-executable landing policy declaration. The train executor consumes this in a later slice. */
+  readonly policy?: LandUnitTrainPolicySpec;
   readonly nodes: readonly GraphNodeSpec[];
   readonly edges: readonly GraphEdgeSpec[];
 }
 
+export interface LandUnitTrainPolicySpec {
+  readonly express: {
+    readonly by: readonly ('queueFlag' | 'predecessorOf' | 'multiplierTier' | 'p0InCutWindow2h')[];
+    readonly waitsForBatch: false;
+    readonly directive: string;
+  };
+  readonly batch: {
+    readonly min: number;
+    readonly max: number;
+    readonly groupBy: readonly ('area' | 'cellPrefix')[];
+    readonly maxWaitMin: number;
+    readonly order: readonly ('express' | 'predecessor' | 'enqueued')[];
+    readonly directive: string;
+  };
+  readonly scenarioPrebuild: {
+    readonly source: readonly ('src/ux-sim' | 'scenarios/ux-sim' | 'fake-llm' | 'fake-harness')[];
+    readonly mock: 'required';
+    readonly directive: string;
+  };
+  readonly gate: { readonly oncePerBatch: true; readonly directive: string };
+  readonly land: {
+    readonly perPr: 'squash';
+    readonly pinnedHead: true;
+    readonly ejectOnFail: true;
+    readonly integrationPr: false;
+    readonly directive: string;
+  };
+}
+
 export interface GraphParseIssue {
   readonly path: string;
   readonly message: string;
@@ -80,6 +116,7 @@ export interface GraphParseResult {
 
 /** ⚠️ YAML 함정 — `no`/`off`/`yes`/`on` 이 boolean 으로 파싱된다(Norway 문제). 노드 이름에 쓰면 조용히 깨진다. */
 const YAML_TRAP_WORDS = new Set(['true', 'false', 'yes', 'no', 'on', 'off', 'null', '~']);
+export const L1_PROTECTED_ROUTE_NODES = new Set(['gate', 'regate', 'review', 'merge', 'freeze-check']);
 
 function asArray(value: unknown): unknown[] {
   return Array.isArray(value) ? value : [];
@@ -102,6 +139,8 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
 
   const graphId = typeof doc.graph_id === 'string' ? doc.graph_id : undefined;
   if (graphId === undefined) errors.push({ path: `${label}/graph_id`, message: 'graph_id 가 없거나 문자열이 아니다' });
+  const policy = graphId === 'land' ? parseLandUnitTrainPolicy(doc.policy, `${label}/policy`, errors) : undefined;
+  if (graphId === 'land' && doc.policy === undefined) errors.push({ path: `${label}/policy`, message: 'land 유닛에는 착지 열차 policy 가 필요하다' });
   const version = typeof doc.version === 'number' && Number.isInteger(doc.version) ? doc.version : undefined;
   if (version === undefined) errors.push({ path: `${label}/version`, message: 'version 이 없거나 정수가 아니다' });
   const entryNode = typeof doc.entry_node === 'string' ? doc.entry_node : undefined;
@@ -147,6 +186,12 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
         : 'journey_stage 는 비어 있지 않은 문자열이어야 한다' });
       continue;
     }
+    if (n.skip_when !== undefined) {
+      if (typeof n.skip_when !== 'string' || !parseOverlayCondition(n.skip_when).ok)
+        errors.push({ path: `${at}/skip_when`, message: 'skip_when 은 오버레이 조건 한 개(key op literal)여야 한다' });
+      if (L1_PROTECTED_ROUTE_NODES.has(nodeId) || kind === 'gate' || terminalNodes.includes(nodeId))
+        errors.push({ path: `${at}/skip_when`, message: `'${nodeId}' 는 필수 검증·착지·종결 노드라 건너뛸 수 없다` });
+    }
     const contractRaw = n.contract as Record<string, unknown> | undefined;
     const contract: GraphNodeContract | undefined = contractRaw && typeof contractRaw === 'object'
       ? {
@@ -190,6 +235,7 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
       ...(kind === 'subgraph' && n.budget && typeof n.budget === 'object' && !Array.isArray(n.budget) &&
         typeof (n.budget as Record<string, unknown>).inner_steps === 'number'
         ? { budget: { innerSteps: (n.budget as { inner_steps: number }).inner_steps } } : {}),
+      ...(typeof n.skip_when === 'string' ? { skipWhen: n.skip_when } : {}),
     });
   }
   if (nodes.length === 0) errors.push({ path: `${label}/nodes`, message: '노드가 하나도 없다' });
@@ -205,6 +251,12 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
     if (!known.has(from)) { errors.push({ path: `${at}/from`, message: `'${from}' 은 선언된 노드가 아니다` }); continue; }
     const hasTo = typeof e.to === 'string';
     const hasMap = e.map !== null && typeof e.map === 'object';
+    if (e.when !== undefined && (typeof e.when !== 'string' || !parseOverlayCondition(e.when).ok))
+      errors.push({ path: `${at}/when`, message: 'when 은 오버레이 조건 한 개(key op literal)여야 한다' });
+    if (e.when !== undefined && (L1_PROTECTED_ROUTE_NODES.has(from) || nodes.some(node => node.nodeId === from && node.kind === 'gate') || terminalNodes.includes(from)))
+      errors.push({ path: `${at}/when`, message: `'${from}' 의 필수 검증·착지 결과는 when 간선으로 덮을 수 없다` });
+    if (e.when !== undefined && (!hasTo || hasMap || e.on !== undefined))
+      errors.push({ path: `${at}/when`, message: 'when 은 to 간선에서만 쓴다' });
     if (hasTo === hasMap) {
       errors.push({ path: at, message: 'to 와 map 중 «정확히 하나»를 써야 한다' });
       continue;
@@ -237,8 +289,21 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
       ...(hasMap ? { on: String(e.on), map } : {}),
       ...(fallback.length > 0 ? { fallback } : {}),
       ...(typeof e.observed === 'number' ? { observed: e.observed } : {}),
+      ...(typeof e.when === 'string' ? { when: e.when } : {}),
     });
   }
+  for (const node of nodes) {
+    if (node.skipWhen === undefined) continue;
+    const outgoing = edges.filter(edge => edge.from === node.nodeId);
+    if (outgoing.length !== 1 || outgoing[0]?.to === undefined || outgoing[0]?.when !== undefined ||
+        (outgoing[0]?.fallback?.length ?? 0) > 0)
+      errors.push({ path: `${label}/nodes/${node.nodeId}/skip_when`, message: 'skip_when 노드에는 분기 없는 무조건 to 후속 간선 하나만 필요하다' });
+  }
+  for (const edge of edges) {
+    if (edge.when === undefined) continue;
+    if (!edges.some(candidate => candidate.from === edge.from && candidate.when === undefined))
+      errors.push({ path: `${label}/edges/${edge.from}/when`, message: 'when 간선에는 모호·미관측 때 탈 무조건 기본 간선이 필요하다' });
+  }
 
   if (entryNode !== undefined && !known.has(entryNode)) errors.push({ path: `${label}/entry_node`, message: `'${entryNode}' 는 선언된 노드가 아니다` });
   for (const t of terminalNodes) if (!known.has(t)) errors.push({ path: `${label}/terminal_nodes`, message: `'${t}' 는 선언된 노드가 아니다` });
@@ -288,6 +353,7 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
     template: {
       graphId: graphId!, version: version!, entryNode: entryNode!, terminalNodes, nodes, edges,
       ...(unit ? { unit } : {}),
+      ...(policy ? { policy } : {}),
       ...(Array.isArray(journeyStages) ? { journeyStages: journeyStages as string[] } : {}),
       ...(loop ? { loop } : {}),
       ...(typeof doc.docs_only_gate_skip === 'boolean' ? { docsOnlyGateSkip: doc.docs_only_gate_skip } : {}),
@@ -298,6 +364,89 @@ export function parseGraphTemplateYaml(source: string, label = '<inline>'): Grap
   };
 }
 
+function isRecord(value: unknown): value is Record<string, unknown> {
+  return value !== null && typeof value === 'object' && !Array.isArray(value);
+}
+
+function exactKeys(value: Record<string, unknown>, keys: readonly string[]): boolean {
+  return Object.keys(value).length === keys.length && keys.every((key) => Object.hasOwn(value, key));
+}
+
+function isEnumList<T extends string>(value: unknown, allowed: readonly T[], expected: readonly T[]): value is T[] {
+  return Array.isArray(value) && value.every((item): item is T => typeof item === 'string' && allowed.includes(item as T))
+    && value.length === expected.length && expected.every((item, index) => value[index] === item);
+}
+
+function isDirectiveText(value: unknown): value is string {
+  if (typeof value !== 'string') return false;
+  const entry = value.replace(/[\p{P}\p{S}\s]/gu, '');
+  return entry.length > 0;
+}
+
+function parseLandUnitTrainPolicy(
+  value: unknown,
+  path: string,
+  errors: GraphParseIssue[],
+): LandUnitTrainPolicySpec | undefined {
+  if (value === undefined) return undefined;
+  const fail = (suffix: string, message: string): void => { errors.push({ path: `${path}${suffix}`, message }); };
+  if (!isRecord(value) || !exactKeys(value, ['express', 'batch', 'scenarioPrebuild', 'gate', 'land'])) {
+    fail('', 'policy 는 express·batch·scenarioPrebuild·gate·land 만 가진 맵이어야 한다');
+    return undefined;
+  }
+  const express = value.express;
+  const batch = value.batch;
+  const scenarioPrebuild = value.scenarioPrebuild;
+  const gate = value.gate;
+  const land = value.land;
+  const field = (name: string, raw: unknown, keys: readonly string[]): Record<string, unknown> | undefined => {
+    if (!isRecord(raw) || !exactKeys(raw, keys)) {
+      fail(`/${name}`, `${name} 필드는 ${keys.join('·')} 키만 가진 맵이어야 한다`);
+      return undefined;
+    }
+    if (!isDirectiveText(raw.directive))
+      fail(`/${name}/directive`, 'directive 는 구두점만으로 된 값이 아닌 비어 있지 않은 문자열이어야 한다');
+    return raw;
+  };
+  const e = field('express', express, ['by', 'waitsForBatch', 'directive']);
+  const b = field('batch', batch, ['min', 'max', 'groupBy', 'maxWaitMin', 'order', 'directive']);
+  const s = field('scenarioPrebuild', scenarioPrebuild, ['source', 'mock', 'directive']);
+  const g = field('gate', gate, ['oncePerBatch', 'directive']);
+  const l = field('land', land, ['perPr', 'pinnedHead', 'ejectOnFail', 'integrationPr', 'directive']);
+
+  if (e && !isEnumList(e.by, ['queueFlag', 'predecessorOf', 'multiplierTier', 'p0InCutWindow2h'], ['queueFlag', 'predecessorOf', 'multiplierTier', 'p0InCutWindow2h']))
+    fail('/express/by', 'by 는 queueFlag·predecessorOf·multiplierTier·p0InCutWindow2h 를 각각 한 번 포함해야 한다');
+  if (e && e.waitsForBatch !== false) fail('/express/waitsForBatch', 'express 는 waitsForBatch: false 여야 한다');
+  if (b) {
+    if (!Number.isSafeInteger(b.min) || b.min !== 2) fail('/batch/min', 'min 은 정확히 2여야 한다');
+    if (!Number.isSafeInteger(b.max) || b.max !== 4) fail('/batch/max', 'max 는 정확히 4여야 한다');
+    if (Number.isSafeInteger(b.min) && Number.isSafeInteger(b.max) && (b.min as number) > (b.max as number)) fail('/batch', 'min 은 max 이하여야 한다');
+    if (!isEnumList(b.groupBy, ['area', 'cellPrefix'], ['area', 'cellPrefix'])) fail('/batch/groupBy', 'groupBy 는 area·cellPrefix 를 각각 한 번 포함해야 한다');
+    if (!Number.isSafeInteger(b.maxWaitMin) || (b.maxWaitMin as number) !== 30) fail('/batch/maxWaitMin', 'maxWaitMin 은 30 정수여야 한다');
+    if (!Array.isArray(b.order) || b.order.length !== 3 || b.order.some((item, index) => item !== ['express', 'predecessor', 'enqueued'][index]))
+      fail('/batch/order', 'order 는 express·predecessor·enqueued 순이어야 한다');
+  }
+  if (s && !isEnumList(s.source, ['src/ux-sim', 'scenarios/ux-sim', 'fake-llm', 'fake-harness'], ['src/ux-sim', 'scenarios/ux-sim', 'fake-llm', 'fake-harness']))
+    fail('/scenarioPrebuild/source', 'source 는 UX sim·fake LLM·fake harness 네 경로를 각각 한 번 포함해야 한다');
+  if (s && s.mock !== 'required') fail('/scenarioPrebuild/mock', 'mock 은 required 여야 한다');
+  if (g && g.oncePerBatch !== true) fail('/gate/oncePerBatch', 'oncePerBatch 는 true 여야 한다');
+  if (l) {
+    if (l.perPr !== 'squash') fail('/land/perPr', 'perPr 은 squash 여야 한다');
+    if (l.pinnedHead !== true) fail('/land/pinnedHead', 'pinnedHead 는 true 여야 한다');
+    if (l.ejectOnFail !== true) fail('/land/ejectOnFail', 'ejectOnFail 은 true 여야 한다');
+    if (l.integrationPr !== false) fail('/land/integrationPr', 'integrationPr 는 false 여야 한다');
+  }
+  if (!e || !b || !s || !g || !l || errors.some((error) => error.path.startsWith(`${path}/`))) return undefined;
+  return {
+    express: { by: e.by as LandUnitTrainPolicySpec['express']['by'], waitsForBatch: false, directive: e.directive as string },
+    batch: { min: b.min as number, max: b.max as number, groupBy: b.groupBy as LandUnitTrainPolicySpec['batch']['groupBy'], maxWaitMin: b.maxWaitMin as number,
+      order: b.order as LandUnitTrainPolicySpec['batch']['order'], directive: b.directive as string },
+    scenarioPrebuild: { source: s.source as LandUnitTrainPolicySpec['scenarioPrebuild']['source'], mock: 'required', directive: s.directive as string },
+    gate: { oncePerBatch: true, directive: g.directive as string },
+    land: { perPr: 'squash', pinnedHead: true, ejectOnFail: true, integrationPr: false, directive: l.directive as string },
+  };
+}
+
 /** 정규 JSON — 「같은 그래프인가」를 답하는 유일한 형식. ⛔ 키를 «정렬»해 직렬화 순서를 없앤다. */
 export function canonicalGraphJson(template: GraphTemplateSpec): string {
   const sort = (value: unknown): unknown => {
@@ -330,7 +479,8 @@ export function loadGraphTemplates(dir: string): GraphLoadResult {
   const templates: Record<string, GraphTemplateSpec> = {};
   let files: string[];
   try {
-    files = readdirSync(dir).filter((f) => f.endsWith('.yaml') || f.endsWith('.yml')).sort();
+    // recipes are command catalogs consumed by the runner, not graph templates.
+    files = readdirSync(dir).filter((f) => (f.endsWith('.yaml') || f.endsWith('.yml')) && f !== 'recipes.yaml' && f !== 'recipes.yml').sort();
   } catch (error) {
     return { templates, errors: [{ path: dir, message: `그래프 디렉토리를 못 읽었다: ${error instanceof Error ? error.message : String(error)}` }], warnings, scannedFiles: 0 };
   }

package/src/self-implement/headless-elanous-driver.ts

@@ -1329,6 +1329,7 @@ export async function runHeadlessGoalLoopPty(opts: HeadlessGoalLoopPtyOptions):
     workdir: opts.cwd,
     env: {
       ...(opts.stateDir ? { ELANOUS_STATE_DIR: opts.stateDir } : {}),
+      ...(process.env.XDG_DATA_HOME?.trim() ? { XDG_DATA_HOME: process.env.XDG_DATA_HOME } : {}),
       [CHILD_LIVENESS_HEARTBEAT_ENV]: resolveChildLivenessHeartbeatPath(opts.cwd),
       ...controlInboxEnv(controlInboxDir),
 // ⛔⭐ 뿌리와 «한 벌»로 간다(`OBS-T121`) — 안 주면 자식이 「파생」을 「명시 격리」로 읽는다.

package/src/self-implement/knowhow-pack.ts

@@ -0,0 +1,103 @@
+/** Bounded, read-only context from promoted repository knowhow. */
+import { lstatSync, readFileSync, realpathSync, readdirSync, statSync } from 'node:fs';
+import { join, relative, resolve, sep } from 'node:path';
+
+export const KNOWHOW_PACK_MAX_BYTES = 4096;
+const MARKER = '[KNOWHOW-PACK v1';
+const SIGNATURES = ['no-progress', 'scope-escape', 'wallclock-cap', 'pod-job-failed', 'gate-failed', 'review-blocked', 'token_revoked'];
+
+export interface KnowhowPack {
+  text: string;
+  ids: string[];
+  bytes: number;
+}
+
+function inside(root: string, path: string): boolean {
+  const rel = relative(root, path);
+  return rel === '' || (rel !== '..' && !rel.startsWith(`..${sep}`) && !rel.startsWith(sep));
+}
+
+function promotedSections(source: string): Array<{ id: string; text: string }> {
+  const sections: Array<{ id: string; text: string }> = [];
+  for (const block of source.split(/(?=^## K-[A-Z]+-\d+\b)/m)) {
+    const id = /^## (K-[A-Z]+-\d+)\b/m.exec(block)?.[1];
+    if (!id || !/^[-*] 출처:.*상태: active\s*$/m.test(block)) continue;
+    sections.push({ id, text: block.trim() });
+  }
+  return sections;
+}
+
+function mentionedPaths(text: string): Set<string> {
+  // Keep the complete repository-relative path, including package/docs prefixes.
+  // First slice: root filenames have no directory context and are deliberately excluded.
+  // A path may use any extension; reject absolute and parent-relative paths as whole tokens.
+  const paths = new Set<string>();
+  for (const match of text.matchAll(/(?<![\w./~-])([\w.-]+(?:\/[\w.-]+)+)/g)) {
+    const path = match[1].replace(/[.,;:!?]+$/, '');
+    const segments = path.split('/');
+    if (segments.some((segment) => segment === '.' || segment === '..' || !segment)) continue;
+    if (!/\.[\w-]+$/.test(segments.at(-1) ?? '')) continue;
+    paths.add(path);
+  }
+  return paths;
+}
+
+function relevance(goal: string, section: string): number {
+  const paths = mentionedPaths(goal);
+  const sourcePaths = mentionedPaths(section);
+  let score = 0;
+  for (const path of paths) {
+    if (sourcePaths.has(path)) score += 20;
+  }
+  // A path-scoped remedy must not be selected solely because an unrelated goal shares its failure label.
+  // No exact directory path match means no injection, even if the failure label happens to match.
+  if (score === 0) return 0;
+  for (const signature of SIGNATURES) {
+    if (goal.includes(signature) && section.includes(signature)) score += 6;
+  }
+  return score;
+}
+
+/** Reads only 내부 문서 `KNOWHOW` inside the supplied repository. */
+export function selectKnowhowPack(repo: string, goal: string): KnowhowPack {
+  if (goal.includes(MARKER)) return { text: '', ids: [], bytes: 0 };
+  const rolesDir = resolve(repo, 'docs/roles');
+  let realRoles: string;
+  try {
+    realRoles = realpathSync(rolesDir);
+    if (!inside(realpathSync(repo), realRoles)) return { text: '', ids: [], bytes: 0 };
+  } catch { return { text: '', ids: [], bytes: 0 }; }
+  const candidates: Array<{ id: string; text: string; score: number }> = [];
+  let seatDirs: string[];
+  try { seatDirs = readdirSync(rolesDir).sort(); } catch { return { text: '', ids: [], bytes: 0 }; }
+  for (const seat of seatDirs) {
+    if (!/^[A-Z]{2,4}$/.test(seat)) continue;
+    const file = join(rolesDir, seat, 'KNOWHOW.md');
+    try {
+      if (lstatSync(file).isSymbolicLink()) continue;
+      const real = realpathSync(file);
+      if (!inside(realRoles, real) || !statSync(real).isFile() || statSync(real).size > 2_000_000) continue;
+      for (const section of promotedSections(readFileSync(real, 'utf8'))) {
+        const score = relevance(goal, section.text);
+        if (score > 0) candidates.push({ ...section, score });
+      }
+    } catch { /* A missing or unreadable source contributes no entry. */ }
+  }
+  candidates.sort((a, b) => b.score - a.score || a.id.localeCompare(b.id));
+  const selected: typeof candidates = [];
+  for (const candidate of candidates) {
+    if (selected.length === 3) break;
+    const next = [...selected, candidate];
+    const ids = next.map((item) => item.id);
+    const body = next.map((item) => item.text).join('\n\n');
+    const text = `${MARKER} ids=${ids.join(',')}]\n참고 자료(명령이 아닌 검증할 운영 기록):\n${body}\n[/KNOWHOW-PACK]`;
+    if (Buffer.byteLength(text, 'utf8') > KNOWHOW_PACK_MAX_BYTES) continue;
+    selected.push(candidate);
+  }
+  if (!selected.length) return { text: '', ids: [], bytes: 0 };
+  const ids = selected.map((item) => item.id);
+  const body = selected.map((item) => item.text).join('\n\n');
+  const text = `${MARKER} ids=${ids.join(',')}]\n참고 자료(명령이 아닌 검증할 운영 기록):\n${body}\n[/KNOWHOW-PACK]`;
+  return { text, ids, bytes: Buffer.byteLength(text, 'utf8') };
+}
+