elanous 0.2.32 → 0.2.35

package/src/self-implement/goal-author-decompose.ts

@@ -2,7 +2,7 @@ import { debug } from '../debug/log.js';
 import { adversarialPlanCritique } from '../harness/adversarial-plan.js';
 import { classifyHeft, adversarialThreshold } from '../harness/harness-seams.js';
 import { llmDecomposeSteps } from '../harness/llm-decompose.js';
-import { GOAL_AUTHOR_COARSE_MAX_SLICES } from '../task-orchestrator/generator-prompt.js';
+import { GOAL_AUTHOR_SIZE_SAFETY_MAX_SLICES } from '../task-orchestrator/generator-prompt.js';
 import { getDefaultLogStore } from '../mss/logging/log-store.js';
 import { emitDecision } from '../live/detail-switch.js';
 import { selectPlanningLlm } from '../prompt-enhance/enhance.js';
@@ -10,6 +10,128 @@ import type { GoalAuthorDeps } from './goal-author.js';
 
 const GOAL_STEPS_DECOMPOSED_EVENT = 'goal-steps-decomposed';
 
+type GoalSliceTier = 'low' | 'medium' | 'high';
+type GoalSliceSize = { files: number; actions: number; newFiles: number; tier: GoalSliceTier; unavoidableReason: string | null };
+
+export type SliceTier = '하' | '중' | '상';
+export interface SizedSlice {
+  goal: string;
+  files: number;
+  behaviours: number;
+  newFiles: number;
+  tier: SliceTier;
+  unavoidable?: string;
+}
+export type TierSizedDecomposeResult =
+  | { ok: true; slices: SizedSlice[]; redecomposed: number }
+  | { ok: false; reason: string };
+
+function publicSizedSlices(steps: readonly string[], sizes: readonly GoalSliceSize[]): SizedSlice[] {
+  return steps.map((goal, index) => {
+    const size = sizes[index]!;
+    return { goal, files: size.files, behaviours: size.actions, newFiles: size.newFiles,
+      tier: ({ low: '하', medium: '중', high: '상' } as const)[size.tier],
+      ...(size.unavoidableReason ? { unavoidable: size.unavoidableReason } : {}) };
+  });
+}
+
+/** Keep a slice's file names grounded in the parent's explicit target/new paths. */
+function restoreSlicePaths(slices: readonly SizedSlice[], parentGoal: string): SizedSlice[] {
+  const parentPaths = new Map<string, Set<string>>();
+  for (const line of parentGoal.split('\n')) {
+    if (!/^\s*(?:[-*]\s*)?(?:대상 경로|신설)\s*:/.test(line)) continue;
+    for (const match of line.matchAll(/(?:^|[\s,·`])([\w./-]+\.[A-Za-z][\w-]*)(?=$|[\s,·`])/g)) {
+      const path = match[1]!;
+      const name = path.slice(path.lastIndexOf('/') + 1);
+      const candidates = parentPaths.get(name) ?? new Set<string>();
+      candidates.add(path);
+      parentPaths.set(name, candidates);
+    }
+  }
+  return slices.flatMap((slice, sliceIndex) => {
+    let unresolved = false;
+    const goal = slice.goal.replace(/(^|[\n·])(\s*(?:[-*]\s*)?(?:대상 경로|신규 경로|신설)\s*:\s*)([^\n]+?)(?=\s*·\s*(?:동작|행동|작업|대상 경로|신규 경로|신설)\s*:|$)/gm,
+      (_whole, prefix: string, label: string, value: string) => {
+        const restored = value.replace(/(?<![\w./-])[\w./-]+\.[A-Za-z][\w-]*/g, (path) => {
+          if (path.includes('/')) return path;
+          const candidates = [...(parentPaths.get(path) ?? [])];
+          if (candidates.length === 1) return candidates[0]!;
+          unresolved = true;
+          try { debug.log('self-implement.decompose', 'slice-path-unresolved', { sliceIndex, path, candidates }); } catch { /* observation is fail-soft */ }
+          return path;
+        });
+        return `${prefix}${label}${restored}`;
+      });
+    return unresolved ? [] : [{ ...slice, goal }];
+  });
+}
+
+function expectedSliceTier(files: number, actions: number, newFiles: number): GoalSliceTier {
+  if (files <= 2 && actions <= 1 && newFiles <= 1) return 'low';
+  if (files <= 4 && actions <= 2 && newFiles <= 2) return 'medium';
+  return 'high';
+}
+
+/** Estimates are observations from the planner, checked against the declared tier before they guide retry. */
+function parseGoalSliceSizes(raw: string, count: number): GoalSliceSize[] | null {
+  try {
+    const parsed = JSON.parse(raw) as { slices?: unknown };
+    if (!Array.isArray(parsed?.slices) || parsed.slices.length !== count) return null;
+    const result: GoalSliceSize[] = [];
+    for (const value of parsed.slices) {
+      if (!value || typeof value !== 'object' || Array.isArray(value)) return null;
+      const row = value as Record<string, unknown>;
+      const { files, newFiles, tier } = row;
+      const actions = row.actions ?? row.behaviours;
+      if (!Number.isSafeInteger(files) || !Number.isSafeInteger(actions) || !Number.isSafeInteger(newFiles)
+        || (files as number) < 1 || (actions as number) < 1 || (newFiles as number) < 0
+        || (newFiles as number) > (files as number)
+        || tier !== expectedSliceTier(files as number, actions as number, newFiles as number)) return null;
+      const unavoidableReason = typeof row.unavoidableReason === 'string' && row.unavoidableReason.trim()
+        ? row.unavoidableReason.trim() : null;
+      result.push({ files: files as number, actions: actions as number, newFiles: newFiles as number,
+        tier: tier as GoalSliceTier, unavoidableReason });
+    }
+    return result;
+  } catch { return null; }
+}
+
+/** Only explicit path and action lines can replace missing planner metadata. */
+function deriveGoalSliceSizes(steps: readonly string[]): GoalSliceSize[] | null {
+  const result: GoalSliceSize[] = [];
+  for (const step of steps) {
+    const pathLines = [...step.matchAll(/(?:^|[\n·])\s*(대상 경로|신규 경로)\s*:\s*([^\n]+?)(?=\s*·\s*(?:동작|행동|대상 경로|신규 경로)\s*:|$)/g)];
+    const paths = new Set<string>();
+    const newPaths = new Set<string>();
+    for (const [, label, value] of pathLines) {
+      for (const match of value!.matchAll(/(?:^|[\s,·`])([\w./-]+\.[A-Za-z][\w-]*)(?=$|[\s,·`])/g)) {
+        paths.add(match[1]!);
+        if (label === '신규 경로') newPaths.add(match[1]!);
+      }
+    }
+    const actions = [...step.matchAll(/(?:^|[\n·])\s*(?:[-*]\s*)?(?:동작|행동)\s*:\s*([^\n·]+)/g)]
+      .filter((match) => !!match[1]?.trim()).length;
+    if (!paths.size || !actions) return null;
+    const files = paths.size;
+    const newFiles = newPaths.size;
+    result.push({ files, actions, newFiles, tier: expectedSliceTier(files, actions, newFiles), unavoidableReason: null });
+  }
+  return result;
+}
+
+function goalSliceSizePrompt(objective: string, steps: readonly string[]): string {
+  return [
+    'GOAL_AUTHOR_SLICE_SIZE — estimate the size of each FINAL implementation slice.',
+    'Reply with STRICT JSON only: {"slices":[{"files":1,"behaviours":1,"newFiles":0,"tier":"low","unavoidableReason":null}]}. Every slice MUST contain files, behaviours, newFiles, tier and unavoidableReason; do not omit a field.',
+    'Example for two slices: {"slices":[{"files":2,"behaviours":1,"newFiles":0,"tier":"low","unavoidableReason":null},{"files":3,"behaviours":2,"newFiles":1,"tier":"medium","unavoidableReason":null}]}.',
+    'One array item per slice in the same order. Count all target files including tests and runtime wiring; count distinct changed behaviors and newly created files.',
+    'Use low for files<=2, behaviours<=1, newFiles<=1; medium for files<=4, behaviours<=2, newFiles<=2; otherwise high.',
+    'For high, give a concrete one-line unavoidableReason only if splitting breaks an inseparable operation. Otherwise leave it null so the planner must split again.',
+    `OBJECTIVE: ${objective}`,
+    `STEPS_JSON: ${JSON.stringify(steps)}`,
+  ].join('\n');
+}
+
 /** Injectable reader: failures remain distinguishable from a successful empty read. */
 export type RecentStepCountReader = () => readonly number[];
 
@@ -56,13 +178,19 @@ export function readRecentStepCountsFailOpen(reader: RecentStepCountReader = rea
 
 /**
  * ⭐ AUTHOR-SHADOW-FIRST-SPLIT ① (0.2.29 · 근거 사례 #26644 · 대표 10-12 «착지해야만 낼 수 있는 증거는
- * 처음 저작부터 쪼갰어야»). 골 문면에 «명시 표지» 한 줄이 있을 때만 처음부터 두 조각
- * (① 그림자 → ② live 스위치, 선행 간선 1)으로 낸다. 표지가 없으면 어떤 문면이든 종전 LLM 분해 그대로다.
+ * 처음 저작부터 쪼갰어야»). 골 문면에 «명시 표지» 한 줄이 있으면 처음부터 두 조각
+ * (① 그림자 → ② live 스위치, 선행 간선 1)으로 낸다.
  *
- * ⛔ 발동은 명시 표지 «하나»뿐이다 — 자연어 감지(자율 표지·운영 실증·부정어)는 쓰지 않는다.
- *   자연어 부정 판별은 수렴하지 않았고(리뷰 r4~r6), 오탐은 live 조각이 원 목표와 반대로 «켜라»를 지시하게 만든다.
- *   자연어 감지 발동은 후속 개선(OP 결정 10-15).
- * 런 슈퍼바이저 REVIEW-MUSTFIX-CLASSIFY ②가 «런 중간»에 같은 쪼개기를 한다 — 저작이 먼저 막고 그쪽은 놓친 것을 받는다.
+ * ⭐ 자연어 발동(0.2.35 must-fix ①) — 표지 줄이 없어도 «한 줄» 안에 그림자 우선 어휘(그림자 먼저·shadow first)와
+ *   요청형 분할 어휘(분할해·분할해서·분할하라·나눠·나누어·쪼개)가 «같이» 실린 자연어 요청은 발동한다.
+ *   오탐은 live 조각이 원 목표와 반대로 «켜라»를 지시하게 만드므로(리뷰 r4~r6) 닫힌 어휘쌍으로 보수적으로 본다:
+ *   ⑴ 표지 콜론 형태(분할: …)와 그 변형·인용은 동사형이 아니어도 발동 제외(근접 오탐 방어 유지)
+ *   ⑵ 같은 줄에 부정 어휘(말라·말고·마라·아니·않·금지·하면 안·안 되)가 있으면 발동 제외.
+ *   표지가 없고 자연어 어휘쌍도 없는 문면은 종전 LLM 분해 그대로다.
+ * 생산 소비자는 이 seam «하나»다 — `runGoalAuthorCli` 와 OP 디스패처(`dispatchSelfImplement`)가 기본 seam 으로 부른다.
+ * ⛔ 런 슈퍼바이저쪽에 «같은 쪼개기»는 아직 없다(REVIEW-MUSTFIX-CLASSIFY ②는 범위 축 in-scope/split/ask-owner 만 판정하고
+ *   이 표지를 다시 읽지 않는다 — `rg -l 'classifyShadowFirstSplit|SHADOW_FIRST_SPLIT|shadow-first-split' src/`의 결과는
+ *   이 파일 ⊕ 그 시험뿐). 저작 때 놓친 표지를 런 중간에 되받는 경로는 후속이다.
  */
 export const SHADOW_FIRST_SPLIT_MARKER = '분할: 그림자 먼저';
 /**
@@ -75,28 +203,54 @@ function hasShadowFirstSplitMarkerLine(objective: string): boolean {
 
 export type ShadowFirstSplitPiece = { id: 'shadow' | 'live'; step: string; dependsOn: readonly ('shadow' | 'live')[] };
 
+/** 발동 근거 — 명시 표지 줄 또는 자연어 요청(0.2.35 must-fix ①). */
+export type ShadowFirstSplitTrigger = 'explicit-marker' | 'natural-language';
+
 export type ShadowFirstSplitVerdict =
-  | { kind: 'shadow-first-split'; pieces: readonly [ShadowFirstSplitPiece, ShadowFirstSplitPiece] }
+  | { kind: 'shadow-first-split'; pieces: readonly [ShadowFirstSplitPiece, ShadowFirstSplitPiece]; trigger: ShadowFirstSplitTrigger }
   | { kind: 'single-piece' };
 
-/** 순수 판정 — 골 문면의 명시 표지 줄만 본다(LLM·원장·자연어 감지 0 · 던지지 않는다). grounding context 는 읽지 않는다. */
+// ⭐ AUTHOR-SHADOW-FIRST-SPLIT 자연어 발동(0.2.35 must-fix ①) — 닫힌 어휘쌍만 본다(오탐 방어 · 리뷰 r4~r6).
+const SHADOW_FIRST_PHRASE_SOURCE = '그림자\\s+먼저|shadow[\\s-]+first';
+const SHADOW_FIRST_NATURAL_LANGUAGE_LINE = new RegExp(
+  `(?:${SHADOW_FIRST_PHRASE_SOURCE})[^\\n]{0,16}(?:분할(?:해|해서|하여|하라|해라|하고|하며)|나눠|나누어|쪼개)`
+    + `|(?:분할(?:해|해서|하여|하라|해라|하고|하며)|나눠|나누어|쪼개)[^\\n]{0,16}(?:${SHADOW_FIRST_PHRASE_SOURCE})`,
+  'i',
+);
+// ⛔ 부정·거절 어휘가 같은 줄에 있으면 발동하지 않는다 — live 조각의 «켜라» 오지시 방어(보수적 미발동).
+//   «안 되»는 실현형(된다·됩니다·돼·됐…)까지 본다 — 본문은 «안 된다» 꼴이 지배한다.
+const SHADOW_FIRST_NATURAL_NEGATION = /말라|말고|마라|아니|않|금지|하면\s*안|안\s*(?:돼|되|된|됐|될|됨|됩|됫|됬)/i;
+// ⛔ 표지 콜론 형태(분할: …)와 그 변형·인용 줄은 자연어 발동에서 제외한다(문서 ⑴ · 근접 오탐 방어 유지).
+const SHADOW_FIRST_MARKER_COLON_LIKE = /분할\s*[:：]/;
+
+function hasShadowFirstSplitNaturalLanguageLine(objective: string): boolean {
+  return objective.split(/\r?\n/).some((line) => SHADOW_FIRST_NATURAL_LANGUAGE_LINE.test(line)
+    && !SHADOW_FIRST_NATURAL_NEGATION.test(line)
+    && !SHADOW_FIRST_MARKER_COLON_LIKE.test(line));
+}
+
+const SHADOW_FIRST_SPLIT_PIECES: readonly [ShadowFirstSplitPiece, ShadowFirstSplitPiece] = [
+  {
+    id: 'shadow',
+    step: '① 그림자 — 이 골의 배선이 자율 결정을 «기록만» 한다(자율 실행 0). 판정 = 시험 통과 ⊕ 그림자 관측 줄 모양(기록된 결정 1건 이상).',
+    dependsOn: [],
+  },
+  {
+    id: 'live',
+    step: '② live 스위치 — 선행 = ① 그림자 착지. 같은 배선의 자율 실행을 켠다. 판정 = ① 착지 뒤 그림자 로그에 기대 결정 1건 이상 ⊕ 스위치 켬 ⊕ 이 골의 원 판정.',
+    dependsOn: ['shadow'],
+  },
+];
+
+/** 순수 판정 — 골 문면의 명시 표지 줄 ⊕ 자연어 요청 줄만 본다(LLM·원장 0 · 던지지 않는다). grounding context 는 읽지 않는다. */
 export function classifyShadowFirstSplit(objective: string): ShadowFirstSplitVerdict {
-  if (!hasShadowFirstSplitMarkerLine(objective)) return { kind: 'single-piece' };
-  return {
-    kind: 'shadow-first-split',
-    pieces: [
-      {
-        id: 'shadow',
-        step: '① 그림자 — 이 골의 배선이 자율 결정을 «기록만» 한다(자율 실행 0). 판정 = 시험 통과 ⊕ 그림자 관측 줄 모양(기록된 결정 1건 이상).',
-        dependsOn: [],
-      },
-      {
-        id: 'live',
-        step: '② live 스위치 — 선행 = ① 그림자 착지. 같은 배선의 자율 실행을 켠다. 판정 = ① 착지 뒤 그림자 로그에 기대 결정 1건 이상 ⊕ 스위치 켬 ⊕ 이 골의 원 판정.',
-        dependsOn: ['shadow'],
-      },
-    ],
-  };
+  if (hasShadowFirstSplitMarkerLine(objective)) {
+    return { kind: 'shadow-first-split', pieces: SHADOW_FIRST_SPLIT_PIECES, trigger: 'explicit-marker' };
+  }
+  if (hasShadowFirstSplitNaturalLanguageLine(objective)) {
+    return { kind: 'shadow-first-split', pieces: SHADOW_FIRST_SPLIT_PIECES, trigger: 'natural-language' };
+  }
+  return { kind: 'single-piece' };
 }
 
 /** Shared LLM-backed decomposition seam for every goal-author entrypoint. */
@@ -106,6 +260,7 @@ export function createGoalAuthorDecomposeSteps(
     adversarialReview?: boolean;
     adversarialReviewSource?: 'cli' | 'default' | 'unknown';
     recentStepCounts?: readonly number[];
+    onSizedSlices?: (slices: SizedSlice[], redecomposed: number) => void;
   } = {},
 ): NonNullable<GoalAuthorDeps['decomposeSteps']> {
   return async (objective, options) => {
@@ -133,7 +288,7 @@ export function createGoalAuthorDecomposeSteps(
         debug.log('goal-author', 'shadow-first-split', {
           surface: 'goal-author',
           verdict: shadowSplit.kind,
-          trigger: 'explicit-marker',
+          trigger: shadowSplit.trigger,
           pieces: shadowSplit.pieces.map((piece) => piece.id),
           edges: shadowSplit.pieces.reduce((n, piece) => n + piece.dependsOn.length, 0),
           ...(options?.runId === undefined ? {} : { runId: options.runId }),
@@ -141,7 +296,9 @@ export function createGoalAuthorDecomposeSteps(
       } catch { /* observation is fail-soft */ }
       return finalize(
         shadowSplit.pieces.map((piece) => piece.step),
-        `명시 표지 «${SHADOW_FIRST_SPLIT_MARKER}» — 그림자 우선 두 조각(선행 간선 1).`,
+        shadowSplit.trigger === 'explicit-marker'
+          ? `명시 표지 «${SHADOW_FIRST_SPLIT_MARKER}» — 그림자 우선 두 조각(선행 간선 1).`
+          : '자연어 요청(그림자 우선 어휘 ⊕ 분할 지시) — 그림자 우선 두 조각(선행 간선 1).',
       );
     }
     const { streamLLM } = await import('../llm.js');
@@ -149,15 +306,65 @@ export function createGoalAuthorDecomposeSteps(
     //   «같은 규칙»으로 planning 노브(roleLlm.planning ⊕ ELANOUS_PROMPT_ENHANCE_MODEL/EFFORT)를 따른다.
     //   미설정이면 종전 그대로 — model 은 아예 전달하지 않는다(streamLLM 기본 모델) ⊕ effort 는 high.
     const { model, effort } = selectPlanningLlm();
-    const llmOpts: { model?: string; reasoningEffort: 'low' | 'medium' | 'high' } = model === undefined
-      ? { reasoningEffort: effort }
-      : { model, reasoningEffort: effort };
+    const llmOpts: { model?: string; reasoningEffort: 'low' | 'medium' | 'high'; signal?: AbortSignal } = model === undefined
+      ? { reasoningEffort: effort, ...(signal ? { signal } : {}) }
+      : { model, reasoningEffort: effort, ...(signal ? { signal } : {}) };
     let decompositionRationale: string | undefined;
-    const steps = await llmDecomposeSteps(
-      objective,
-      (input) => streamLLM([{ role: 'user', content: input.prompt }], () => {}, llmOpts).then((text) => ({ text })),
-      { ...(options?.context ? { context: options.context } : {}), maxTasks: GOAL_AUTHOR_COARSE_MAX_SLICES, promptProfile: 'goal-author-coarse', ...(signal ? { signal } : {}), onRationale: (rationale) => { decompositionRationale = rationale; } },
-    );
+    const decompose = (ask: string) => {
+      decompositionRationale = undefined;
+      return llmDecomposeSteps(
+        ask,
+        (input) => streamLLM([{ role: 'user', content: input.prompt }], () => {}, llmOpts).then((text) => ({ text })),
+        { ...(options?.context ? { context: options.context } : {}), maxTasks: GOAL_AUTHOR_SIZE_SAFETY_MAX_SLICES,
+          promptProfile: 'goal-author-coarse', ...(signal ? { signal } : {}),
+          onRationale: (rationale) => { decompositionRationale = rationale; } },
+      );
+    };
+    const steps = await decompose(objective);
+    const finish = async (candidate: string[], rationale?: string): Promise<string[]> => {
+      if (!candidate.length) return finalize(candidate, rationale);
+      const measure = async (slices: string[]) => {
+        const parsed = parseGoalSliceSizes(await streamLLM(
+          [{ role: 'user', content: goalSliceSizePrompt(objective, slices) }], () => {}, llmOpts), slices.length);
+        return parsed ? { sizes: parsed, sizeSource: 'planner-estimate' as const }
+          : { sizes: deriveGoalSliceSizes(slices), sizeSource: 'derived' as const };
+      };
+      const observe = (event: 'slice-sized' | 'slice-oversize', sizeSource: 'planner-estimate' | 'derived', data: Record<string, unknown>) => {
+        try { debug.log('goal-author.decompose', event, { surface: 'goal-author', sizeSource, ...data,
+          ...(options?.runId === undefined ? {} : { runId: options.runId }) }); } catch { /* observation is fail-soft */ }
+      };
+      let redecomposed = 0;
+      let measured = await measure(candidate);
+      let sizes = measured.sizes;
+      if (sizes) observe('slice-sized', measured.sizeSource, { retry: 0, slices: sizes });
+      const oversized = sizes?.flatMap((size, index) => size.tier === 'high' ? [index] : []) ?? [];
+      if (oversized.length || !sizes) {
+        observe('slice-oversize', measured.sizeSource, { retry: 0, indexes: oversized,
+          reasons: sizes ? oversized.map((index) => sizes![index]!.unavoidableReason) : [],
+          ...(sizes ? {} : { error: 'size metadata missing or inconsistent' }) });
+        const retryAsk = [objective, '', 'The previous goal-author proposal had missing size metadata or oversized slices.',
+          `PREVIOUS_STEPS_JSON: ${JSON.stringify(candidate)}`,
+          `OVERSIZED_INDEXES_JSON: ${JSON.stringify(oversized)}`,
+          'Regenerate the full plan once. Preserve fitting slices and split each oversized slice into dependent low/medium slices where possible.',
+          'If an oversized slice truly cannot split, leave it high and state a concrete unavoidable reason.'].join('\n');
+        const regenerated = await decompose(retryAsk);
+        if (!regenerated.length) throw new Error('goal-author slice sizing: regeneration produced no slices');
+        redecomposed = 1;
+        candidate = regenerated;
+        rationale = decompositionRationale;
+        measured = await measure(candidate);
+        sizes = measured.sizes;
+        if (!sizes) throw new Error('goal-author slice sizing: size metadata missing after one retry');
+        observe('slice-sized', measured.sizeSource, { retry: 1, slices: sizes });
+        const remaining = sizes.flatMap((size, index) => size.tier === 'high' ? [index] : []);
+        if (remaining.length) observe('slice-oversize', measured.sizeSource, { retry: 1, indexes: remaining,
+          reasons: remaining.map((index) => sizes![index]!.unavoidableReason) });
+        if (remaining.some((index) => !sizes![index]!.unavoidableReason))
+          throw new Error('goal-author slice sizing: high slice lacks unavoidable reason after one retry');
+      }
+      config.onSizedSlices?.(restoreSlicePaths(publicSizedSlices(candidate, sizes), objective), redecomposed);
+      return finalize(candidate, rationale);
+    };
     const heft = classifyHeft(objective);
     const adversarialReviewSource = config.adversarialReviewSource
       ?? (config.adversarialReview === undefined ? 'default' : 'unknown');
@@ -191,9 +398,10 @@ export function createGoalAuthorDecomposeSteps(
       reviewExecuted,
       reviewSkipReason,
     });
-    if (!reviewExecuted) return finalize(steps, decompositionRationale);
+    if (!reviewExecuted) return finish(steps, decompositionRationale);
     const critic = (prompt: string) => streamLLM([{ role: 'user', content: prompt }], () => {}, llmOpts);
 
+    let revisedSteps: string[] | undefined;
     try {
       const critique = await adversarialPlanCritique(objective, steps, critic, options?.context);
       const sample = critique?.issues.slice(0, 3).map((issue) => issue.slice(0, 60)) ?? [];
@@ -208,20 +416,40 @@ export function createGoalAuthorDecomposeSteps(
           byAxis,
           reviewEnabled,
         });
-        return finalize(critique.revisedSteps);
+        revisedSteps = critique.revisedSteps;
+      } else {
+        debug.log('goal-author', 'adversarial-sound', {
+          surface: 'goal-author',
+          heft,
+          issues: critique?.issues.length ?? 0,
+          sample,
+          byAxis,
+          reviewEnabled,
+        });
       }
-
-      debug.log('goal-author', 'adversarial-sound', {
-        surface: 'goal-author',
-        heft,
-        issues: critique?.issues.length ?? 0,
-        sample,
-        byAxis,
-        reviewEnabled,
-      });
     } catch {
       // The red-team is advisory; authoring must retain the LLM decomposition on failure.
     }
-    return finalize(steps, decompositionRationale);
+    if (revisedSteps) return finish(revisedSteps);
+    return finish(steps, decompositionRationale);
   };
 }
+
+/** Public goal-author sizing seam for a hand caller that needs per-slice tier metadata. */
+export async function decomposeToTierSizedSlices(
+  goal: string,
+  opts?: { signal?: AbortSignal },
+): Promise<TierSizedDecomposeResult> {
+  let result: { slices: SizedSlice[]; redecomposed: number } | undefined;
+  try {
+    const steps = await createGoalAuthorDecomposeSteps(opts?.signal, {
+      adversarialReview: false,
+      onSizedSlices: (slices, redecomposed) => { result = { slices, redecomposed }; },
+    })(goal);
+    if (!steps.length || !result) return { ok: false, reason: 'goal-author slice sizing: no sized slices' };
+    if (result.slices.length === 0) return { ok: false, reason: 'slice-path-unresolved' };
+    return { ok: true, ...result };
+  } catch (error) {
+    return { ok: false, reason: error instanceof Error ? error.message : String(error) };
+  }
+}

package/src/self-implement/goal-author-identity.ts

@@ -0,0 +1,66 @@
+const IDENTITY_LINE = /^(agent|track|session|submitted):\s*(.*?)\s*$/i;
+
+export function repositoryIdentifiers(ask: string): string[] {
+  const lines = ask.split(/\r?\n/);
+  const metadata = leadingIdentityMetadata(ask);
+  const body = metadata.size
+    ? (lines[0]?.trim() === '---' ? lines.slice(lines.slice(1).findIndex((line) => line.trim() === '---') + 2) : lines.slice(lines.findIndex((line) => !IDENTITY_LINE.test(line))))
+    : lines;
+  return body
+    .filter((line) => !line.startsWith('Checkable requested criterion:'))
+    .join('\n')
+    .match(/[A-Za-z0-9]+(?:-[A-Za-z0-9]+)*/g) ?? [];
+}
+
+function leadingIdentityMetadata(ask: string): Map<string, string> {
+  const lines = ask.split(/\r?\n/);
+  let candidates: string[] = [];
+  if (lines[0]?.trim() === '---') {
+    const end = lines.slice(1).findIndex((line) => line.trim() === '---');
+    if (end < 0) return new Map();
+    candidates = lines.slice(1, end + 1);
+  } else if (IDENTITY_LINE.test(lines[0] ?? '')) {
+    candidates = lines.slice(0, lines.findIndex((line) => !IDENTITY_LINE.test(line)) === -1
+      ? lines.length
+      : lines.findIndex((line) => !IDENTITY_LINE.test(line)));
+  }
+
+  const metadata = new Map<string, string>();
+  for (const line of candidates) {
+    const match = IDENTITY_LINE.exec(line);
+    const value = match?.[2].trim();
+    if (match && value && !metadata.has(match[1].toLowerCase())) metadata.set(match[1].toLowerCase(), value);
+  }
+  return metadata;
+}
+
+/** `submitted` 는 KST 로 적는다 — 두 트랙이 같은 벽시계를 인용해야 이력이 정렬된다. */
+export function formatSubmittedAt(at: Date): string {
+  const parts = new Intl.DateTimeFormat('sv-SE', {
+    timeZone: 'Asia/Seoul', year: 'numeric', month: '2-digit', day: '2-digit',
+    hour: '2-digit', minute: '2-digit', hour12: false,
+  }).format(at);
+  return `${parts.replace(' ', ' ')} KST`;
+}
+
+/**
+ * 신원 머리말 — **값이 있는 줄만** 낸다.
+ *
+ * ⛔ 빈 값·`unknown` 을 찍지 않는다: 부재와 미지가 같은 값이 되면 조회가 거짓을 생산한다.
+ *    *"모르면 비워라"* 가 아니라 **"없으면 줄을 쓰지 마라"** 다.
+ * ⭐ 우선순위는 **ask 에 이미 적힌 값 > 환경/시계 유도**다(호출자가 명시한 것이 이긴다).
+ */
+export function identityLines(ask: string, cwd: string, env: NodeJS.ProcessEnv, at: Date): string[] {
+  const metadata = leadingIdentityMetadata(ask);
+  const tree = /[/\\](pilot|axon)[/\\]/i.exec(cwd)?.[1]?.toLowerCase();
+  const track = metadata.get('track') ?? (tree === 'pilot' ? 'S' : tree === 'axon' ? 'T' : undefined);
+  const agent = metadata.get('agent') ?? env.AI_AGENT?.trim();
+  const session = metadata.get('session') ?? env.CLAUDE_CODE_SESSION_ID?.trim();
+  const submitted = metadata.get('submitted') ?? formatSubmittedAt(at);
+  return [
+    agent && `agent: ${agent}`,
+    track && `track: ${track}`,
+    session && `session: ${session}`,
+    submitted && `submitted: ${submitted}`,
+  ].filter((line): line is string => Boolean(line));
+}

package/src/self-implement/goal-author-preservation-obligation.ts

@@ -0,0 +1,35 @@
+const EXPLICIT_OBLIGATION_MODAL = /\b(?:must|should|needs?\s+to|is\s+required\s+to)\s+/gi;
+const OBLIGATION_HARD_BOUNDARY = /[.;!?]|\s+but\s+|\s+(?:although|because|while)\s+/i;
+const COORDINATED_OBLIGATION = /\s+(?:and|or)\s+|,\s*(?:(?:and|or)\s+)?/i;
+const PRESERVATION_OBLIGATION_VERB = /^(?:preserve|remain|retain|keep|maintain)$/i;
+// ⛔⭐ 수동태 보존(`must be preserved` · `should be unchanged`)은 동사가 `be` 라 위 배제를 빠져나간다.
+//    실측 2026-08-03: `this behavior should be preserved across releases` 가 요구로 오탐됐다.
+//    ⚠️ 오탐 비용이 낮지 않다 — 이 판정은 clarification 을 만들고, 미답 clarification 은
+//    발사 전 도달 경로를 태운다(`RUN-S13`). ⇒ `be` 뒤의 분사만 좁게 더 본다.
+const PRESERVATION_PARTICIPLE = /^(?:preserved|retained|kept|maintained|unchanged|intact|stable)$/i;
+
+/** Persistent evidence remains a preservation contract; only preservation verbs are excluded from explicit modal obligations. */
+/** ⭐ 테스트가 **배포 코드**를 물게 export 한다 — 종전 회귀는 정규식을 복사해 vacuous 였다(`[T]` 반증 자기검증). */
+export function hasUnmetRequirementOutsidePreservationClause(evidence: string): boolean {
+  return explicitObligationPhrases(evidence).some((phrase) => {
+    const [verb, next] = phrase.trim().split(/\s+/, 2);
+    if (!verb) return false;
+    if (PRESERVATION_OBLIGATION_VERB.test(verb)) return false;
+    // `be preserved` / `be unchanged` 처럼 수동태로 쓴 보존은 요구가 아니다.
+    if (/^be$/i.test(verb) && next && PRESERVATION_PARTICIPLE.test(next)) return false;
+    return true;
+  });
+}
+
+/** 배제 판정에 `be <분사>` 를 보려면 동사 하나가 아니라 구가 필요하다. */
+function explicitObligationPhrases(evidence: string): string[] {
+  const modals = Array.from(evidence.matchAll(EXPLICIT_OBLIGATION_MODAL));
+  return modals.flatMap((modal, index) => {
+    const start = (modal.index ?? 0) + modal[0].length;
+    const nextModal = modals[index + 1]?.index ?? evidence.length;
+    const remaining = evidence.slice(start, nextModal);
+    const boundary = remaining.search(OBLIGATION_HARD_BOUNDARY);
+    const obligation = remaining.slice(0, boundary === -1 ? remaining.length : boundary);
+    return obligation.split(COORDINATED_OBLIGATION).map((phrase) => phrase.trim()).filter(Boolean);
+  });
+}