jeo-code 0.6.15 → 0.6.16

package/CHANGELOG.md

@@ -6,6 +6,12 @@ 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._
 

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.
 
 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.
 
 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.
 
 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.
 
 See [CHANGELOG.md](CHANGELOG.md) for the full history.
 <!-- CHANGELOG:END -->

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "jeo-code",
-  "version": "0.6.15",
+  "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

@@ -15,8 +15,9 @@ 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;
@@ -82,6 +83,14 @@ 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[] = [];
@@ -146,14 +155,31 @@ export function searchConcepts(concepts: Concept[], query: string): { concept: C
 }
 
 /** Priority order for injection: high-confidence "core" concepts first, then by
- *  query relevance (descending), preserving input order as a stable tiebreak. */
+ *  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) }))
+    .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);