jeo-code 0.6.14 → 0.6.16

package/CHANGELOG.md

@@ -6,6 +6,22 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 The README mirrors the latest 5 entries — regenerate with `bun run changelog:sync`.
 
+## [0.6.16] - 2026-06-17
+_OKF memory grows a concept cross-link graph: 1-hop search expansion, bundle lint, graphify-optional._
+
+### Added
+- **Concept cross-link graph for the memory bundle (OKF Sprint 04).** A new zero-dependency `src/agent/memory-graph.ts` treats the OKF bundle as a first-class link graph — nodes are concept IDs, edges are the markdown links a concept's body points at another concept, and broken links are tolerated (captured for lint, never thrown). It powers `buildConceptGraph` / `expandByGraph` / `resolveLinkTarget` / `lintConceptGraph` / `graphifyAvailable`. Memory injection now applies **1-hop graph expansion**: a concept the task query directly hits lifts its link-neighbours ahead of unrelated noise (still within `MEMORY_INJECT_MAX_CHARS`). New `lintMemoryBundle(cwd)` reports orphan concepts, broken links, and duplicate-title merge candidates. The optional `graphify` tool is a best-effort enrichment layer only — every feature runs fully on the built-in graph when it is absent (graceful degradation), and `graphify update` is never run against the markdown bundle.
+
+## [0.6.15] - 2026-06-17
+_Query-aware OKF memory injection with budget-priority selection, and a truthful end-of-turn Todos receipt._
+
+### Added
+- **Concept-level memory search & budget-aware injection (OKF Sprint 03).** `memoryPromptSection(cwd, query?)` now loads the OKF concept bundle and selects what to inject by priority — high-confidence core facts first, then query relevance (the one-shot task text is wired in as the query), then stable order — dropping whole lowest-priority concepts to fit `MEMORY_INJECT_MAX_CHARS` (3000) instead of truncating mid-string. New exported helpers `loadConcepts` / `scoreConcept` / `searchConcepts`. The `index.md` rebuild now emits progressive-disclosure `- [title](/relpath) — description` rows. Injection-hardening (DATA framing, fence neutralization) and the `MEMORY.md` fallback are retained.
+
+### Changed
+- **End-of-turn Todos receipt tells the truth.** A successful `finish` shows the Todos checklist fully complete so it agrees with the `done` badge (the model's last `todo` call often forgets to flip the final items, and the once-per-turn done gate can't force it); cancel/error finishes pass `ok:false` so any unfinished items stay honestly shown. The live frame is unchanged, so in-progress work still renders truthfully.
+
+
 ## [0.6.14] - 2026-06-16
 _Memory distillation survives malformed model output, and stream-idle stalls retry instead of failing the turn._
 

package/README.ja.md

@@ -158,11 +158,11 @@ CI は `.github/workflows/npm-publish.yml` で公開します — GitHub リリ
 ## 変更履歴 (Changelog)
 
 <!-- CHANGELOG:START (auto-generated from CHANGELOG.md — run `bun run changelog:sync`) -->
+- **[0.6.16]** (2026-06-17) — OKF memory grows a concept cross-link graph: 1-hop search expansion, bundle lint, graphify-optional.
+- **[0.6.15]** (2026-06-17) — Query-aware OKF memory injection with budget-priority selection, and a truthful end-of-turn Todos receipt.
 - **[0.6.14]** (2026-06-16) — Memory distillation survives malformed model output, and stream-idle stalls retry instead of failing the turn.
 - **[0.6.13]** (2026-06-16) — `team` engine: concrete uncommitted-work reporting and stricter empty-run handling.
 - **[0.6.12]** (2026-06-16) — OKF-backed memory distillation — session learnings become structured concept files.
-- **[0.6.11]** (2026-06-16) — Larger reasoning budgets, and terminal capability-response sequences kept out of the prompt.
-- **[0.6.10]** (2026-06-16) — OKF memory-format foundation and a hardened bashTool subprocess drain.
 
 See [CHANGELOG.md](CHANGELOG.md) for the full history.
 <!-- CHANGELOG:END -->

package/README.ko.md

@@ -158,11 +158,11 @@ CI는 `.github/workflows/npm-publish.yml`로 배포합니다 — GitHub 릴리
 ## 변경 이력 (Changelog)
 
 <!-- CHANGELOG:START (auto-generated from CHANGELOG.md — run `bun run changelog:sync`) -->
+- **[0.6.16]** (2026-06-17) — OKF memory grows a concept cross-link graph: 1-hop search expansion, bundle lint, graphify-optional.
+- **[0.6.15]** (2026-06-17) — Query-aware OKF memory injection with budget-priority selection, and a truthful end-of-turn Todos receipt.
 - **[0.6.14]** (2026-06-16) — Memory distillation survives malformed model output, and stream-idle stalls retry instead of failing the turn.
 - **[0.6.13]** (2026-06-16) — `team` engine: concrete uncommitted-work reporting and stricter empty-run handling.
 - **[0.6.12]** (2026-06-16) — OKF-backed memory distillation — session learnings become structured concept files.
-- **[0.6.11]** (2026-06-16) — Larger reasoning budgets, and terminal capability-response sequences kept out of the prompt.
-- **[0.6.10]** (2026-06-16) — OKF memory-format foundation and a hardened bashTool subprocess drain.
 
 See [CHANGELOG.md](CHANGELOG.md) for the full history.
 <!-- CHANGELOG:END -->

package/README.md

@@ -158,11 +158,11 @@ Required npm token permissions (repository secret `NPM_TOKEN`):
 ## Changelog
 
 <!-- CHANGELOG:START (auto-generated from CHANGELOG.md — run `bun run changelog:sync`) -->
+- **[0.6.16]** (2026-06-17) — OKF memory grows a concept cross-link graph: 1-hop search expansion, bundle lint, graphify-optional.
+- **[0.6.15]** (2026-06-17) — Query-aware OKF memory injection with budget-priority selection, and a truthful end-of-turn Todos receipt.
 - **[0.6.14]** (2026-06-16) — Memory distillation survives malformed model output, and stream-idle stalls retry instead of failing the turn.
 - **[0.6.13]** (2026-06-16) — `team` engine: concrete uncommitted-work reporting and stricter empty-run handling.
 - **[0.6.12]** (2026-06-16) — OKF-backed memory distillation — session learnings become structured concept files.
-- **[0.6.11]** (2026-06-16) — Larger reasoning budgets, and terminal capability-response sequences kept out of the prompt.
-- **[0.6.10]** (2026-06-16) — OKF memory-format foundation and a hardened bashTool subprocess drain.
 
 See [CHANGELOG.md](CHANGELOG.md) for the full history.
 <!-- CHANGELOG:END -->

package/README.zh.md

@@ -158,11 +158,11 @@ CI 通过 `.github/workflows/npm-publish.yml` 发布 — GitHub 发布 release
 ## 更新日志 (Changelog)
 
 <!-- CHANGELOG:START (auto-generated from CHANGELOG.md — run `bun run changelog:sync`) -->
+- **[0.6.16]** (2026-06-17) — OKF memory grows a concept cross-link graph: 1-hop search expansion, bundle lint, graphify-optional.
+- **[0.6.15]** (2026-06-17) — Query-aware OKF memory injection with budget-priority selection, and a truthful end-of-turn Todos receipt.
 - **[0.6.14]** (2026-06-16) — Memory distillation survives malformed model output, and stream-idle stalls retry instead of failing the turn.
 - **[0.6.13]** (2026-06-16) — `team` engine: concrete uncommitted-work reporting and stricter empty-run handling.
 - **[0.6.12]** (2026-06-16) — OKF-backed memory distillation — session learnings become structured concept files.
-- **[0.6.11]** (2026-06-16) — Larger reasoning budgets, and terminal capability-response sequences kept out of the prompt.
-- **[0.6.10]** (2026-06-16) — OKF memory-format foundation and a hardened bashTool subprocess drain.
 
 See [CHANGELOG.md](CHANGELOG.md) for the full history.
 <!-- CHANGELOG:END -->

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "jeo-code",
-  "version": "0.6.14",
+  "version": "0.6.16",
 
   "description": "Clean, highly optimized AI coding agent using spec-first loop",
   "type": "module",

package/src/agent/memory-graph.ts

@@ -0,0 +1,198 @@
+/**
+ * Concept cross-link graph for the OKF memory bundle — OKF Sprint 04 (Graph Layer).
+ *
+ * A first-class, zero-dependency link graph over the concept bundle: nodes are
+ * concept IDs (bundle-relative path minus `.md`), edges are the markdown links a
+ * concept's body points at another concept. Broken links (targets with no node)
+ * are TOLERATED — OKF's lenient model treats them as "knowledge not yet written"
+ * and the lint pass reports them rather than failing.
+ *
+ * Used to (1) strengthen Sprint 03 search by 1-hop graph expansion (a concept
+ * the query directly hits pulls in its neighbours as injection candidates) and
+ * (2) lint the bundle (orphans / broken links / duplicate-title candidates).
+ *
+ * graphify (the external graph tool) is an OPTIONAL second layer: when present
+ * it can enrich, but every feature here runs fully on the built-in graph so the
+ * bundle works with graphify absent (graceful degradation). Note: `graphify
+ * update` is for CODE repos only — never run it against this markdown bundle.
+ *
+ * Design contract: docs/okf_mem/sprint-04-graph-layer/index.md
+ */
+import * as posix from "node:path/posix";
+import { conceptId } from "./memory-okf";
+
+/** Minimal shape the graph needs from a concept (a `Concept` satisfies it). */
+export interface GraphConcept {
+  /** Bundle-relative path, e.g. `commands/bun-test.md`. */
+  relPath: string;
+  /** Markdown body; scanned for `](target)` links. */
+  body: string;
+  /** Optional concept title (for duplicate-title lint). */
+  title?: string;
+}
+
+/** A directed cross-link graph over concept IDs. */
+export interface ConceptGraph {
+  /** All concept IDs present in the bundle. */
+  nodes: Set<string>;
+  /** from-ID → set of to-IDs that resolve to a real node. */
+  edges: Map<string, Set<string>>;
+  /** from-ID → set of link targets that have NO node (tolerated broken links). */
+  broken: Map<string, Set<string>>;
+}
+
+/** A markdown inline link `](target)` — captures the target, not the label. */
+const LINK_RE = /\]\(([^)\s]+)\)/g;
+
+function addEdge(map: Map<string, Set<string>>, from: string, to: string): void {
+  const set = map.get(from) ?? new Set<string>();
+  set.add(to);
+  map.set(from, set);
+}
+
+/**
+ * Resolve a markdown link target (as written in `from`'s body) to a concept ID,
+ * or `null` when it is not an in-bundle concept reference. Handles:
+ *  - external/protocol links (`http://…`, `mailto:`) → null
+ *  - pure anchors (`#section`) → null
+ *  - bundle-absolute (`/commands/x.md`) → `commands/x`
+ *  - relative (`../facts/x.md`) → resolved against `from`'s directory
+ * Anchors and query strings are stripped before ID normalization.
+ */
+export function resolveLinkTarget(fromId: string, rawTarget: string): string | null {
+  let t = rawTarget.trim();
+  if (!t || t.startsWith("#") || /^[a-z][a-z0-9+.-]*:/i.test(t)) return null; // external/protocol/anchor
+  t = t.split("#")[0]!.split("?")[0]!.trim();
+  if (!t) return null;
+  let full: string;
+  if (t.startsWith("/")) {
+    full = t.replace(/^\/+/, "");
+  } else {
+    const slash = fromId.lastIndexOf("/");
+    const fromDir = slash === -1 ? "" : fromId.slice(0, slash);
+    full = fromDir ? posix.normalize(`${fromDir}/${t}`) : posix.normalize(t);
+  }
+  if (!full || full.startsWith("..")) return null; // escaped the bundle — not a concept ref
+  const id = conceptId(full);
+  return id || null;
+}
+
+/** Build the cross-link graph from a set of concepts. Broken links are kept
+ *  (in `broken`) rather than dropped, so lint can surface them. */
+export function buildConceptGraph(concepts: GraphConcept[]): ConceptGraph {
+  const nodes = new Set(concepts.map(c => conceptId(c.relPath)));
+  const edges = new Map<string, Set<string>>();
+  const broken = new Map<string, Set<string>>();
+  for (const c of concepts) {
+    const from = conceptId(c.relPath);
+    LINK_RE.lastIndex = 0;
+    let m: RegExpExecArray | null;
+    while ((m = LINK_RE.exec(c.body)) !== null) {
+      const to = resolveLinkTarget(from, m[1]!);
+      if (!to || to === from) continue;
+      if (nodes.has(to)) addEdge(edges, from, to);
+      else addEdge(broken, from, to);
+    }
+  }
+  return { nodes, edges, broken };
+}
+
+/** Undirected adjacency (links are navigable both ways for discovery). */
+function undirectedAdjacency(graph: ConceptGraph): Map<string, Set<string>> {
+  const adj = new Map<string, Set<string>>();
+  for (const [from, tos] of graph.edges) {
+    for (const to of tos) {
+      addEdge(adj, from, to);
+      addEdge(adj, to, from);
+    }
+  }
+  return adj;
+}
+
+/**
+ * Expand a set of seed concept IDs along the (undirected) link graph by up to
+ * `hops` steps, returning seeds + reachable neighbours. Seeds not present as
+ * nodes are dropped. With `hops` 0 this is just the valid seeds.
+ */
+export function expandByGraph(seedIds: Iterable<string>, graph: ConceptGraph, hops = 1): Set<string> {
+  const adj = undirectedAdjacency(graph);
+  const result = new Set<string>();
+  for (const id of seedIds) if (graph.nodes.has(id)) result.add(id);
+  let frontier = [...result];
+  for (let h = 0; h < hops && frontier.length > 0; h++) {
+    const next: string[] = [];
+    for (const id of frontier) {
+      for (const nb of adj.get(id) ?? []) {
+        if (!result.has(nb)) {
+          result.add(nb);
+          next.push(nb);
+        }
+      }
+    }
+    frontier = next;
+  }
+  return result;
+}
+
+/** A lenient lint report over the concept graph (warnings, never hard failures). */
+export interface GraphLintReport {
+  /** Concept IDs with no incoming or outgoing edges. */
+  orphans: string[];
+  /** Links whose target resolves to no concept node. */
+  brokenLinks: { from: string; to: string }[];
+  /** Concepts that share a (case-insensitive) title — merge/contradiction candidates. */
+  duplicates: { title: string; ids: string[] }[];
+}
+
+/** Lint the bundle's graph: orphan concepts, broken links, duplicate titles.
+ *  Purely advisory — mirrors llm-wiki's lint pass (broken/orphan/contradiction). */
+export function lintConceptGraph(concepts: GraphConcept[], graph: ConceptGraph): GraphLintReport {
+  const linked = new Set<string>();
+  for (const [from, tos] of graph.edges) {
+    if (tos.size > 0) linked.add(from);
+    for (const to of tos) linked.add(to);
+  }
+  const orphans = [...graph.nodes].filter(id => !linked.has(id)).sort();
+
+  const brokenLinks: { from: string; to: string }[] = [];
+  for (const [from, tos] of graph.broken) {
+    for (const to of tos) brokenLinks.push({ from, to });
+  }
+  brokenLinks.sort((a, b) => a.from.localeCompare(b.from) || a.to.localeCompare(b.to));
+
+  const byTitle = new Map<string, string[]>();
+  for (const c of concepts) {
+    const title = (c.title ?? "").trim();
+    if (!title) continue;
+    const key = title.toLowerCase();
+    const ids = byTitle.get(key) ?? [];
+    ids.push(conceptId(c.relPath));
+    byTitle.set(key, ids);
+  }
+  const duplicates: { title: string; ids: string[] }[] = [];
+  for (const ids of byTitle.values()) {
+    if (ids.length > 1) duplicates.push({ title: ids.length ? (concepts.find(c => conceptId(c.relPath) === ids[0])?.title ?? "").trim() : "", ids: ids.sort() });
+  }
+  duplicates.sort((a, b) => a.title.localeCompare(b.title));
+
+  return { orphans, brokenLinks, duplicates };
+}
+
+/**
+ * Whether the optional graphify tool is available on PATH. The built-in graph
+ * is always the primary layer; graphify is a best-effort enrichment, so callers
+ * degrade gracefully when this is false. `detect` is injectable for testing.
+ */
+export function graphifyAvailable(detect: () => boolean = defaultGraphifyDetect): boolean {
+  try {
+    return detect();
+  } catch {
+    return false;
+  }
+}
+
+function defaultGraphifyDetect(): boolean {
+  // Bun.which resolves a binary on PATH without spawning it.
+  const which = (globalThis as { Bun?: { which?: (cmd: string) => string | null } }).Bun?.which;
+  return typeof which === "function" ? which("graphify") != null : false;
+}

package/src/agent/memory.ts

@@ -3,18 +3,21 @@
  * (plan/gjc-inheritance.md B6; gjc memories/ 2-phase consolidation 참조).
  *
  * Session end distills durable learnings (repo facts, commands that work,
- * gotchas, user preferences) into `.jeo/memory/MEMORY.md` with ONE model call,
- * merging into the existing doc. The next session injects the doc back into
- * the system prompt under a hard char cap — local-first (nullclaw/zeroclaw),
- * no remote backend, disable with JEO_NO_MEMORY=1.
+ * gotchas, user preferences) into the OKF concept bundle under `.jeo/memory/`
+ * (type-partitioned `facts/`, `commands/`, … dirs) with ONE model call, upserting
+ * each concept; a legacy single `MEMORY.md` doc is the fallback when the model
+ * returns plain text. The next session reads the bundle back (bundle-first, then
+ * MEMORY.md) and injects it into the system prompt under a hard char cap —
+ * local-first (nullclaw/zeroclaw), no remote backend, disable with JEO_NO_MEMORY=1.
  */
 import * as fs from "node:fs/promises";
 import { spawn as nodeSpawn } from "node:child_process";
 import * as path from "node:path";
 import { callLlm, type Message } from "./loop";
 import { jeoEnv } from "../util/env";
-import { parseConcept, serializeConcept, slugify, isReservedFile } from "./memory-okf";
+import { parseConcept, serializeConcept, slugify, isReservedFile, conceptId } from "./memory-okf";
 import { tryExtractJsonObject } from "./json";
+import { buildConceptGraph, expandByGraph, lintConceptGraph, type GraphLintReport } from "./memory-graph";
 
 /** On-disk document cap — the distill prompt instructs the model to stay under it. */
 export const MEMORY_MAX_CHARS = 6_000;
@@ -47,16 +50,206 @@ export async function loadMemory(cwd: string): Promise<string> {
   }
 }
 
+/** Render a single index.md-style section: a `## header` followed by one bullet
+ *  per concept (`**title**: description`), with the concept body indented beneath. */
+function renderConceptSection(header: string, list: { title: string; description: string; body: string }[]): string {
+  const lines = [`## ${header}`];
+  for (const c of list) {
+    lines.push(`- **${c.title}**${c.description ? `: ${c.description}` : ""}`);
+    if (c.body) {
+      for (const bodyLine of c.body.split("\n")) lines.push(`  ${bodyLine}`);
+    }
+  }
+  return lines.join("\n");
+}
+
+/** A loaded OKF concept: frontmatter fields + body + bundle-relative path. */
+export interface Concept {
+  type: string;
+  title: string;
+  description: string;
+  body: string;
+  tags: string[];
+  /** high | medium | low — distiller defaults to "high"; drives core selection. */
+  confidence: string;
+  /** Bundle-relative path, e.g. `commands/bun-test.md`. */
+  relPath: string;
+}
+
+/** Read every concept document in the bundle into structured `Concept`s. Reserved
+ *  files (index.md/log.md) and raw/ payloads are skipped; unparseable or
+ *  frontmatter-less files are ignored (lenient consumption). */
+export async function loadConcepts(cwd: string): Promise<Concept[]> {
+  return loadConceptsFromBundle(path.join(cwd, ".jeo", "memory"));
+}
+
+/** Lint the concept bundle's cross-link graph (Sprint 04): orphan concepts,
+ *  broken links, and duplicate-title merge candidates. Advisory only — mirrors
+ *  llm-wiki's lint pass. Returns empty lists for an empty/absent bundle. */
+export async function lintMemoryBundle(cwd: string): Promise<GraphLintReport> {
+  const concepts = await loadConcepts(cwd);
+  return lintConceptGraph(concepts, buildConceptGraph(concepts));
+}
+
+async function loadConceptsFromBundle(bundleDir: string): Promise<Concept[]> {
+  const files = await findMarkdownFiles(bundleDir);
+  const concepts: Concept[] = [];
+  for (const file of files) {
+    const relPath = path.relative(bundleDir, file).replace(/\\/g, "/");
+    if (isReservedFile(relPath)) continue;
+    let parsed;
+    try {
+      parsed = parseConcept(await fs.readFile(file, "utf-8"));
+    } catch {
+      continue;
+    }
+    if (!parsed.hasFrontmatter) continue;
+    const fm = parsed.frontmatter;
+    concepts.push({
+      type: (fm.type as string) || "RepoFact",
+      title: (fm.title as string) || path.basename(file, ".md"),
+      description: (fm.description as string) || "",
+      body: parsed.body.trim(),
+      tags: Array.isArray(fm.tags) ? fm.tags.filter((t): t is string => typeof t === "string") : [],
+      confidence: typeof fm.confidence === "string" ? fm.confidence : "high",
+      relPath,
+    });
+  }
+  return concepts;
+}
+
+/** Tokenize a free-text query into distinct lowercased keywords (len ≥ 3). */
+function tokenize(query?: string): string[] {
+  if (!query) return [];
+  return Array.from(new Set((query.toLowerCase().match(/[a-z0-9]+/g) ?? []).filter(t => t.length >= 3)));
+}
+
+/** Relevance score of a concept against query tokens. Field weights mirror
+ *  llm-wiki's retrieval bias (title ≫ tags ≫ type/description ≫ body). 0 = no hit. */
+export function scoreConcept(concept: Concept, tokens: string[]): number {
+  if (tokens.length === 0) return 0;
+  const title = concept.title.toLowerCase();
+  const desc = concept.description.toLowerCase();
+  const body = concept.body.toLowerCase();
+  const type = concept.type.toLowerCase();
+  const tags = concept.tags.map(t => t.toLowerCase());
+  let score = 0;
+  for (const t of tokens) {
+    if (title.includes(t)) score += 5;
+    if (tags.some(tag => tag.includes(t))) score += 3;
+    if (type.includes(t)) score += 2;
+    if (desc.includes(t)) score += 2;
+    if (body.includes(t)) score += 1;
+  }
+  return score;
+}
+
+/** Search the bundle's concepts for a query, returning the relevant ones (score > 0)
+ *  highest-score first. A type/tags/title/body keyword match all contribute. */
+export function searchConcepts(concepts: Concept[], query: string): { concept: Concept; score: number }[] {
+  const tokens = tokenize(query);
+  return concepts
+    .map(concept => ({ concept, score: scoreConcept(concept, tokens) }))
+    .filter(r => r.score > 0)
+    .sort((a, b) => b.score - a.score);
+}
+
+/** Priority order for injection: high-confidence "core" concepts first, then by
+ *  query relevance (descending), then concepts the relevant ones LINK TO (1-hop
+ *  graph expansion — Sprint 04: a directly-hit concept pulls its neighbours in as
+ *  context ahead of unrelated noise), preserving input order as a stable tiebreak. */
+function priorityOrder(concepts: Concept[], query?: string): Concept[] {
+  const tokens = tokenize(query);
+  // 1-hop graph expansion: seed from concepts the query directly hits, then mark
+  // their link-neighbours as "related" so they outrank unrelated zero-score noise.
+  const related = new Set<string>();
+  if (tokens.length > 0) {
+    const graph = buildConceptGraph(concepts);
+    const seeds = concepts.filter(c => scoreConcept(c, tokens) > 0).map(c => conceptId(c.relPath));
+    for (const id of expandByGraph(seeds, graph, 1)) related.add(id);
+  }
+  return concepts
+    .map((concept, i) => ({
+      concept,
+      i,
+      core: concept.confidence === "high",
+      score: scoreConcept(concept, tokens),
+      related: related.has(conceptId(concept.relPath)),
+    }))
+    .sort((a, b) => {
+      if (a.core !== b.core) return a.core ? -1 : 1;
+      if (b.score !== a.score) return b.score - a.score;
+      if (a.related !== b.related) return a.related ? -1 : 1;
+      return a.i - b.i;
+    })
+    .map(s => s.concept);
+}
+
+/** Group items by their `type` into ordered `{ header, list }` sections: TYPE_LAYOUT
+ *  order first, then any unknown types under their raw type name (lenient). The one
+ *  place that encodes the section ordering — shared by render and index. */
+function groupByTypeLayout<T extends { type: string }>(items: T[]): { header: string; list: T[] }[] {
+  const byType = new Map<string, T[]>();
+  for (const it of items) {
+    const list = byType.get(it.type) ?? [];
+    list.push(it);
+    byType.set(it.type, list);
+  }
+  const sections: { header: string; list: T[] }[] = [];
+  const rendered = new Set<string>();
+  for (const { type, header } of TYPE_LAYOUT) {
+    rendered.add(type);
+    const list = byType.get(type);
+    if (list && list.length > 0) sections.push({ header, list });
+  }
+  for (const [type, list] of byType) {
+    if (rendered.has(type) || list.length === 0) continue;
+    sections.push({ header: type, list });
+  }
+  return sections;
+}
+
+/** Render a set of concepts as a compact markdown block grouped by type in
+ *  TYPE_LAYOUT order, with any unknown types appended under their raw type name. */
+function renderConcepts(concepts: Concept[]): string {
+  return groupByTypeLayout(concepts)
+    .map(({ header, list }) => renderConceptSection(header, list))
+    .join("\n\n");
+}
+
+/** Greedily select concepts (in priority order) whose grouped render stays within
+ *  `budget` chars, dropping the lowest-priority concepts first. At least the
+ *  top-priority concept is always kept (the framing/backstop cap still applies). */
+function selectWithinBudget(concepts: Concept[], query: string | undefined, budget: number): Concept[] {
+  const ordered = priorityOrder(concepts, query);
+  const selected: Concept[] = [];
+  for (const c of ordered) {
+    if (renderConcepts([...selected, c]).length <= budget) selected.push(c);
+  }
+  if (selected.length === 0 && ordered.length > 0) selected.push(ordered[0]!);
+  return selected;
+}
+
 /** System-prompt block carrying prior-session learnings; "" when empty or disabled.
+ *  Selection (Sprint 03): always-included high-confidence core + concepts most
+ *  relevant to `query` (the current task), chosen whole within MEMORY_INJECT_MAX_CHARS
+ *  (lowest-priority dropped first) — never a mid-concept string truncation. Falls
+ *  back to the legacy single MEMORY.md doc when no concept bundle exists.
  *  The memory text is MODEL-DISTILLED from session transcripts (which include tool
  *  outputs — file contents, web results), so it is injection-hardened like subagent
  *  reports: tag-breakout sequences are neutralized and the block is framed as DATA. */
-export async function memoryPromptSection(cwd: string): Promise<string> {
+export async function memoryPromptSection(cwd: string, query?: string): Promise<string> {
   if (jeoEnv("NO_MEMORY") === "1") return "";
-  let memory = await loadMemory(cwd);
+  // Prefer the OKF concept bundle (budget-selected); fall back to legacy MEMORY.md.
+  const concepts = await loadConcepts(cwd);
+  let memory = concepts.length > 0
+    ? renderConcepts(selectWithinBudget(concepts, query, MEMORY_INJECT_MAX_CHARS))
+    : await loadMemory(cwd);
   if (!memory) return "";
+  // Backstop: legacy MEMORY.md is a single blob (not concept-selectable), and a
+  // pathological single concept can exceed the budget — hard-cap either way.
   if (memory.length > MEMORY_INJECT_MAX_CHARS) {
-    memory = memory.slice(0, MEMORY_INJECT_MAX_CHARS) + "\n…(memory truncated — full doc in .jeo/memory/MEMORY.md)";
+    memory = memory.slice(0, MEMORY_INJECT_MAX_CHARS) + "\n…(memory truncated — full doc in .jeo/memory/)";
   }
   // Neutralize the fence tags so distilled content can never close the block and
   // smuggle instruction-shaped text into the bare system prompt.
@@ -120,33 +313,20 @@ async function findMarkdownFiles(dir: string): Promise<string[]> {
 }
 
 async function rebuildIndex(bundleDir: string): Promise<void> {
-  const files = await findMarkdownFiles(bundleDir);
-  const concepts: { type: string; title: string; relPath: string }[] = [];
-  for (const file of files) {
-    const relPath = path.relative(bundleDir, file);
-    if (isReservedFile(relPath)) continue;
-    try {
-      const content = await fs.readFile(file, "utf-8");
-      const parsed = parseConcept(content);
-      concepts.push({
-        type: (parsed.frontmatter.type as string) || "RepoFact",
-        title: (parsed.frontmatter.title as string) || path.basename(file, ".md"),
-        relPath,
-      });
-    } catch {
-      // ignore
-    }
-  }
+  const concepts = await loadConceptsFromBundle(bundleDir);
 
-  let body = "# Index\n\n";
-  for (const { type, header } of TYPE_LAYOUT) {
-    const list = concepts.filter(c => c.type === type);
-    if (list.length === 0) continue;
-    body += `## ${header}\n`;
+  // Progressive-disclosure index: a link per concept plus its one-line description,
+  // grouped by type (TYPE_LAYOUT order first, then any unknown types — lenient).
+  const section = (header: string, list: Concept[]): string => {
+    let out = `## ${header}\n`;
     for (const c of list) {
-      body += `- [${c.title}](/${c.relPath.replace(/\\/g, "/")})\n`;
+      out += `- [${c.title}](/${c.relPath})${c.description ? ` — ${c.description}` : ""}\n`;
     }
-    body += "\n";
+    return out + "\n";
+  };
+  let body = "# Index\n\n";
+  for (const { header, list } of groupByTypeLayout(concepts)) {
+    body += section(header, list);
   }
 
   const indexContent = serializeConcept({ okf_version: "0.1" }, body.trim());

package/src/commands/launch.ts

@@ -396,7 +396,10 @@ export async function runLaunchCommand(args: string[]): Promise<void> {
   const protocol = buildToolProtocol(allowedTools);
   const preamble = flags.systemPrompt ?? "You are the jeo, an interactive coding agent.\nAccomplish the user's request by calling tools and verifying your work.";
   // Prior-session learnings (B6 경험 증류) — "" when absent or JEO_NO_MEMORY=1.
-  const memoryBlock = await memoryPromptSection(cwd);
+  // The one-shot task text (flags.message) seeds relevance search so the most
+  // pertinent concepts win the injection budget; interactive boots with no query
+  // (high-confidence core concepts are always prioritized regardless).
+  const memoryBlock = await memoryPromptSection(cwd, flags.message || undefined);
 
   const baseSystemPrompt =
     preamble + "\n\n" + protocol + "\n\n" +
@@ -679,7 +682,7 @@ export async function runLaunchCommand(args: string[]): Promise<void> {
           else console.log(msg);
         },
         onHardExit: () => {
-          if (tui) tui.finish("Cancelled.");
+          if (tui) tui.finish("Cancelled.", { ok: false });
           process.exit(130);
         },
       });
@@ -812,7 +815,7 @@ export async function runLaunchCommand(args: string[]): Promise<void> {
       }
     } catch (err) {
       if (tui) {
-        tui.finish(`! ${friendlyProviderError(err)}`);
+        tui.finish(`! ${friendlyProviderError(err)}`, { ok: false });
         interactiveTurnActive = false;
       }
       throw err;

package/src/tui/app.ts

@@ -359,12 +359,16 @@ export class LaunchTui {
     try { this.write(`\x1b]2;jeo: ${this.turnTitle}\x07`); } catch { /* terminal gone */ }
   }
 
-  /** Render the task plan as a status-colored checklist; empty when no plan. */
-  private renderPlan(color: boolean): string[] {
+  /** Render the task plan as a status-colored checklist; empty when no plan. When
+   *  `complete` (the success-finish receipt), every still-open item is shown done so the
+   *  checklist agrees with the `done` badge — the model's last `todo` call often forgets
+   *  to flip the final items, and the once-per-turn done gate can't force it. The LIVE
+   *  frame never passes `complete`, so in-progress work still renders truthfully. */
+  private renderPlan(color: boolean, complete = false): string[] {
     if (this.todos.length === 0) return [];
     const steps = this.todos.map(t => ({
       label: t.title,
-      state: (t.status === "done" ? "done" : t.status === "in_progress" ? "active" : "pending") as StepState,
+      state: (complete || t.status === "done" ? "done" : t.status === "in_progress" ? "active" : "pending") as StepState,
     }));
     const header = formatStepHeader(steps, { unicode: this.unicode, color, label: "Todos" });
     return [header, ...formatStepTimeline(steps, { unicode: this.unicode, color, highlightActive: true, maxRows: 8, badges: false })];
@@ -984,8 +988,11 @@ export class LaunchTui {
     return this.theme.color ? chalk.bold(accentPaint(this.theme)("jeo")) : "jeo";
   }
 
-  /** Collapse the live region to static final output. */
-  finish(reply: string): void {
+  /** Collapse the live region to static final output. `ok` (default true) marks a
+   *  SUCCESSFUL turn — its Todos receipt is shown fully complete. Cancel/error finishes
+   *  pass `ok:false` so the checklist truthfully keeps any unfinished items. */
+  finish(reply: string, opts: { ok?: boolean } = {}): void {
+    const ok = opts.ok !== false;
     this.finished = true;
     this.hudPhase = "done";
     if (this.timer) {
@@ -1014,7 +1021,7 @@ export class LaunchTui {
     const finalLines: string[] = [];
     // jeo-ref final-report order: the ANSWER leads; the Todos checklist follows it
     // (done = checked + struck through), so the plan reads as a completion receipt.
-    const planLines = this.renderPlan(this.theme.color);
+    const planLines = this.renderPlan(this.theme.color, ok);
     if (!this.inline) {
       // Inline scrollback already reads as a ✓/✗ checklist; the step timeline +
       // compact strip + flow line would just repeat it (gjc-style slim summary).