@thanh01.pmt/domain-kit 0.5.0 → 0.6.1

package/dist/feed/index.cjs

@@ -52,6 +52,14 @@ var FeedNodeSchema = zod.z.object({
     reason: zod.z.string().default("")
   })).optional(),
   is_core: zod.z.boolean().default(false),
+  /**
+   * Prerequisite concept ids this node needs that NO node in this feed provides —
+   * i.e. the learner must already know them before starting. Previously these were
+   * silently dropped (knowledge path) or crashed emission (both hybrid paths), so a
+   * course silently lost its entry requirements. Kept on the node so the mapping
+   * "concept X needs prior knowledge Y" survives; a course-level roll-up is derivable.
+   */
+  external_prerequisites: zod.z.array(zod.z.string()).default([]),
   // Depth layer text (optional, additive — old feeds validate unchanged).
   // Carries the ULO/CIO/SIO authored text from the KnowledgeGraph concept
   // so downstream consumers (KX generator) can inject depth-appropriate
@@ -87,12 +95,28 @@ var FeedPhaseSchema = zod.z.object({
   product_completion: zod.z.string().min(1),
   node_ids: zod.z.array(zod.z.string()).min(1)
 });
+var FeedDiagnosticSchema = zod.z.object({
+  code: zod.z.string().min(1),
+  severity: zod.z.enum(["info", "warning", "error"]),
+  message: zod.z.string(),
+  node_ids: zod.z.array(zod.z.string()).default([])
+});
+var FeedProvenanceSchema = zod.z.object({
+  providers: zod.z.array(zod.z.string()).default([]),
+  models: zod.z.array(zod.z.string()).default([]),
+  calls: zod.z.number().int().nonnegative().default(0),
+  failed_calls: zod.z.number().int().nonnegative().default(0),
+  degraded: zod.z.boolean().default(false)
+});
 var CurriculumFeedSchema = zod.z.object({
   schema_version: zod.z.literal(2),
   source: zod.z.object({
     graph_type: zod.z.enum(["project_graph", "knowledge_graph", "hybrid_graph"]),
+    /** DERIVED from diagnostics — do not write to it directly. */
     warnings: zod.z.array(zod.z.string()).default([]),
-    hallucination_count: zod.z.number().int().nonnegative().default(0)
+    hallucination_count: zod.z.number().int().nonnegative().default(0),
+    diagnostics: zod.z.array(FeedDiagnosticSchema).default([]),
+    provenance: FeedProvenanceSchema.optional()
   }),
   learning_nodes: zod.z.array(FeedNodeSchema).min(1, "curriculum feed must contain at least one learning node"),
   dependency_edges: zod.z.array(FeedEdgeSchema).default([]),
@@ -125,6 +149,15 @@ function validateCurriculumFeed(feed) {
   }
   const phaseIds = parsed.phases.map((p) => p.id);
   if (new Set(phaseIds).size !== phaseIds.length) throw new Error("curriculum feed contains duplicate phase ids");
+  const phaseOrders = parsed.phases.map((p) => p.order);
+  if (new Set(phaseOrders).size !== phaseOrders.length) {
+    throw new Error("curriculum feed contains duplicate phase orders: " + phaseOrders.join(", "));
+  }
+  for (let i = 1; i < phaseOrders.length; i++) {
+    if (phaseOrders[i] <= phaseOrders[i - 1]) {
+      throw new Error("curriculum feed phase orders are not ascending: " + phaseOrders.join(", "));
+    }
+  }
   if (parsed.phases.length > 0) {
     const phaseIndexOf = /* @__PURE__ */ new Map();
     parsed.phases.forEach((p, i) => {
@@ -145,18 +178,82 @@ function validateCurriculumFeed(feed) {
 }
 
 // src/feed/curriculumFeedEmitter.ts
+var DEPTH_MINUTE_FRACTIONS = {
+  /** Awareness-only pass before the anchor teach. */
+  preview: 0.25,
+  ulo: 0.35,
+  cio: 0.65,
+  sio: 1,
+  /** An advanced revisit re-teaches the concept, not the whole thing again. */
+  advancedRevisit: 0.5,
+  /** Minutes saved when an advanced revisit drops from SIO practice to a CIO recap. */
+  advancedRecapSave: 0.3,
+  /** Floor so a tiny concept still gets a teachable awareness pass. */
+  floor: 5,
+  /** Floor for an advanced revisit — it is a real teach, not an awareness pass. */
+  advancedFloor: 15
+};
+var DEFAULT_STEP_MINUTES = 15;
 var BLOOM_RANK = { Remember: 0, Understand: 1, Apply: 2, Analyze: 3, Evaluate: 4, Create: 5 };
 var pad2 = (n) => String(n).padStart(2, "0");
+var steplessStepIds = [];
+var takeSteplessStepIds = () => steplessStepIds.splice(0, steplessStepIds.length);
 var arr = (v) => Array.isArray(v) ? v : [];
 var str = (v, d = "") => typeof v === "string" ? v : d;
 var num = (v, d) => typeof v === "number" && Number.isFinite(v) ? v : d;
 var strs = (v) => Array.isArray(v) ? v.filter((x) => typeof x === "string") : [];
 function stepMinutes(step) {
   const effort = step.effort ?? {};
-  return Math.max(0, Math.round(num(effort.estimated_minutes, num(step.estimated_minutes, 45))));
+  return Math.max(0, Math.round(num(effort.estimated_minutes, num(step.estimated_minutes, DEFAULT_STEP_MINUTES))));
+}
+function diagnosticsOf(opts) {
+  const list = opts.diagnostics ?? (opts.diagnostics = []);
+  for (const message of opts.warnings ?? []) {
+    if (!list.some((d) => d.code === "upstream_warning" && d.message === message)) {
+      list.push({ code: "upstream_warning", severity: "warning", message, node_ids: [] });
+    }
+  }
+  return list;
+}
+function pushDiagnostic(opts, code, severity, message, nodeIds = []) {
+  diagnosticsOf(opts).push({ code, severity, message, node_ids: nodeIds });
+}
+function splitPrerequisites(concept, known) {
+  const internal = [];
+  const external = [];
+  for (const p of strs(concept.prerequisites)) {
+    (known.has(p) ? internal : external).push(p);
+  }
+  return { internal, external };
+}
+function noteExternalPrerequisites(opts, byNode) {
+  if (byNode.size === 0) return;
+  const entries = [];
+  for (const [nodeId, prereqs] of byNode) {
+    for (const prereqId of prereqs) entries.push({ nodeId, prereqId });
+  }
+  entries.sort((a, b) => a.nodeId === b.nodeId ? a.prereqId.localeCompare(b.prereqId) : a.nodeId.localeCompare(b.nodeId));
+  pushDiagnostic(
+    opts,
+    "external_prerequisite",
+    "info",
+    "Prerequisite(s) outside this analysis \u2014 the learner must already know them: " + entries.map((e) => e.nodeId + " \u2190 " + e.prereqId).join(", "),
+    entries.map((e) => e.nodeId)
+  );
+}
+function buildSource(opts, graphType) {
+  const diagnostics = diagnosticsOf(opts);
+  return {
+    graph_type: graphType,
+    // Derived view — 'info' diagnostics are deliberately not surfaced as warnings.
+    warnings: diagnostics.filter((d) => d.severity !== "info").map((d) => d.message),
+    hallucination_count: opts.hallucinationCount ?? 0,
+    diagnostics,
+    provenance: opts.provenance
+  };
 }
-function pushWarning(opts, message) {
-  (opts.warnings ?? (opts.warnings = [])).push(message);
+function keywordKey(k) {
+  return k.normalize("NFC").toLowerCase();
 }
 function newKeywordsInOrder(nodes) {
   const seen = /* @__PURE__ */ new Set();
@@ -165,9 +262,9 @@ function newKeywordsInOrder(nodes) {
     n.keywords.new = [];
     n.keywords.prerequisite = [];
     for (const k of all) {
-      if (seen.has(k)) n.keywords.prerequisite.push(k);
+      if (seen.has(keywordKey(k))) n.keywords.prerequisite.push(k);
       else n.keywords.new.push(k);
-      seen.add(k);
+      seen.add(keywordKey(k));
     }
   }
 }
@@ -191,6 +288,7 @@ function feedNodeFromStep(step, featureId) {
     // sessions at user-visible checkpoints instead of raw minute counts.
     user_visible_deliverable: str(step.outcome?.user_visible),
     is_core: false,
+    external_prerequisites: [],
     phase_id: "",
     introduce_aspect: null
   };
@@ -210,9 +308,9 @@ function deriveConceptDepthHint(concept) {
   return "ulo";
 }
 function deriveDepthInputs(minutes, depth) {
-  const ulo = Math.max(5, Math.round(minutes * 0.35));
-  const cio = Math.max(ulo + 5, Math.round(minutes * 0.65));
-  const sio = Math.max(cio + 5, minutes);
+  const ulo = Math.max(DEPTH_MINUTE_FRACTIONS.floor, Math.round(minutes * DEPTH_MINUTE_FRACTIONS.ulo));
+  const cio = Math.max(ulo + DEPTH_MINUTE_FRACTIONS.floor, Math.round(minutes * DEPTH_MINUTE_FRACTIONS.cio));
+  const sio = Math.max(cio + DEPTH_MINUTE_FRACTIONS.floor, minutes);
   const variants = { ulo, cio, sio };
   const candidates = [];
   if (depth === "sio") {
@@ -255,7 +353,11 @@ function feedNodeFromConcept(concept) {
     user_visible_deliverable: "",
     // concepts are taught, not shipped — checkpoints live on product steps
     ...deriveDepthInputs(Math.max(0, Math.round(num(concept.estimated_minutes, 15))), deriveConceptDepthHint(concept)),
-    is_core: false,
+    // Knowledge-Tree concepts are the spine of the course — the reconciler must
+    // escalate them, never downgrade them. The emitter hardcoded `false`, so the
+    // flag the schema documents never reached the planner for any concept.
+    is_core: concept.is_core === true || str(concept.standardization) === "standardized",
+    external_prerequisites: [],
     depth_context: {
       ulo: str(concept.ulo),
       cio: str(concept.cio),
@@ -271,7 +373,10 @@ function addFeatureGroup(f, fid, nodes, edges, groupings) {
   let prev = "";
   for (let i = 0; i < steps.length; i++) {
     const stepNode = feedNodeFromStep(steps[i], fid);
-    if (!stepNode.id) continue;
+    if (!stepNode.id) {
+      steplessStepIds.push(fid + "#" + i);
+      continue;
+    }
     stepIds.push(stepNode.id);
     nodes.push(stepNode);
     if (prev) edges.push({ from: prev, to: stepNode.id, kind: "task", reason: "feature build order" });
@@ -294,18 +399,26 @@ function emitFromHybrid(hybrid, opts) {
   const features = arr(pg.features);
   const conceptRecs = arr(kg.concepts);
   const conceptById = new Map(conceptRecs.map((c) => [str(c.id), c]));
+  const knownConceptIds = new Set(conceptById.keys());
   if (rawPhases.length === 0) {
+    const externalByNode2 = /* @__PURE__ */ new Map();
     for (const c of conceptRecs) {
       const node = feedNodeFromConcept(c);
       nodes.push(node);
-      for (const p of strs(c.prerequisites)) edges.push({ from: p, to: node.id, kind: "knowledge", reason: "concept prerequisite" });
+      const { internal, external } = splitPrerequisites(c, knownConceptIds);
+      if (external.length > 0) {
+        node.external_prerequisites = external;
+        externalByNode2.set(node.id, external);
+      }
+      for (const p of internal) edges.push({ from: p, to: node.id, kind: "knowledge", reason: "concept prerequisite" });
     }
+    noteExternalPrerequisites(opts, externalByNode2);
     features.forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad2(fi + 1)), nodes, edges, groupings));
     linkHybridKnowledgeEdges(hybrid, nodes, edges);
     newKeywordsInOrder(nodes);
     return validateCurriculumFeed({
       schema_version: 2,
-      source: { graph_type: "hybrid_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
+      source: buildSource(opts, "hybrid_graph"),
       learning_nodes: nodes,
       dependency_edges: edges,
       suggested_groupings: groupings,
@@ -322,6 +435,8 @@ function emitFromHybrid(hybrid, opts) {
   const emitCtx = [];
   const emittedConcepts = /* @__PURE__ */ new Set();
   const previewsEmitted = /* @__PURE__ */ new Set();
+  const previewNodeIdByConcept = /* @__PURE__ */ new Map();
+  const externalByNode = /* @__PURE__ */ new Map();
   const linkList = arr(hybrid.links);
   for (const rp of rawPhases) {
     const pid = str(rp.id);
@@ -361,7 +476,7 @@ function emitFromHybrid(hybrid, opts) {
         prevNode.name = str(c.name, cid) + " (preview)";
         prevNode.phase_id = pid;
         prevNode.introduce_aspect = "preview";
-        prevNode.estimated_minutes = Math.max(5, Math.round(prevNode.estimated_minutes * 0.25));
+        prevNode.estimated_minutes = Math.max(DEPTH_MINUTE_FRACTIONS.floor, Math.round(prevNode.estimated_minutes * DEPTH_MINUTE_FRACTIONS.preview));
         prevNode.depth_hint = "ulo";
         prevNode.bloom_hint = "Understand";
         prevNode.concept_codes = [str(c.code) || cid];
@@ -371,6 +486,7 @@ function emitFromHybrid(hybrid, opts) {
         prevNode.depth_scaffold_candidates = [];
         nodes.push(prevNode);
         conceptOrder.push(prevNode.id);
+        previewNodeIdByConcept.set(cid, prevNode.id);
         continue;
       }
       if (!emittedConcepts.has(cid)) {
@@ -379,13 +495,22 @@ function emitFromHybrid(hybrid, opts) {
         node.introduce_aspect = "new";
         nodes.push(node);
         for (const p of strs(c.prerequisites)) {
-          if (!emittedConcepts.has(p)) {
-            throw new Error("Concept " + cid + " (phase " + pid + ") has prerequisite " + p + " that is not introduced in an earlier phase - fail-closed");
+          if (!conceptById.has(p)) {
+            if (!externalByNode.has(cid)) externalByNode.set(cid, []);
+            externalByNode.get(cid).push(p);
+            node.external_prerequisites.push(p);
+            continue;
           }
-          edges.push({ from: p, to: cid, kind: "knowledge", reason: "concept prerequisite" });
+          const previewOfPrereq = previewNodeIdByConcept.get(p);
+          if (!emittedConcepts.has(p) && !previewOfPrereq) {
+            throw new Error("Concept " + cid + " (phase " + pid + ") has prerequisite " + p + " that is neither introduced nor previewed in an EARLIER phase - fail-closed");
+          }
+          edges.push({ from: emittedConcepts.has(p) ? p : previewOfPrereq, to: cid, kind: "knowledge", reason: "concept prerequisite" });
         }
         emittedConcepts.add(cid);
         conceptOrder.push(cid);
+      } else if (str(intro.aspect, "new") === "new") {
+        throw new Error("Phase " + pid + " introduces " + cid + " as new but it was already introduced in an earlier phase - fail-closed");
       } else {
         const revisitId = cid + "__ADV" + pad2(order);
         const node = feedNodeFromConcept(c);
@@ -393,8 +518,16 @@ function emitFromHybrid(hybrid, opts) {
         node.name = str(c.name, cid) + " (advanced)";
         node.phase_id = pid;
         node.introduce_aspect = "advanced";
-        node.depth_scaffold_candidates = [{ from_depth: "sio", to_depth: "cio", minutes_saved: Math.round(node.estimated_minutes * 0.3), reason: "advanced revisit may drop to CIO recap without breaking first-teach chain" }];
-        node.estimated_minutes = Math.max(15, Math.round(node.estimated_minutes * 0.5));
+        node.estimated_minutes = Math.max(
+          DEPTH_MINUTE_FRACTIONS.advancedFloor,
+          Math.round(node.estimated_minutes * DEPTH_MINUTE_FRACTIONS.advancedRevisit)
+        );
+        node.depth_scaffold_candidates = [{
+          from_depth: "sio",
+          to_depth: "cio",
+          minutes_saved: Math.round(node.estimated_minutes * DEPTH_MINUTE_FRACTIONS.advancedRecapSave),
+          reason: "advanced revisit may drop to CIO recap without breaking first-teach chain"
+        }];
         node.concept_codes = [str(c.code) || cid];
         edges.push({ from: cid, to: revisitId, kind: "knowledge", reason: "advanced revisit of " + cid + " at phase " + pid });
         nodes.push(node);
@@ -404,6 +537,7 @@ function emitFromHybrid(hybrid, opts) {
     const featureIds = strs(rp.feature_ids).filter((fid) => featureOrder.has(fid)).sort((a, b) => featureOrder.get(a) - featureOrder.get(b));
     emitCtx.push({ id: pid, order, name: str(rp.name, pid), productCompletion: str(rp.product_completion), conceptOrder, featureIds });
   }
+  noteExternalPrerequisites(opts, externalByNode);
   for (const l of linkList) {
     const cid = str(l.concept_id);
     if (cid && conceptById.has(cid) && !emittedConcepts.has(cid)) {
@@ -415,6 +549,16 @@ function emitFromHybrid(hybrid, opts) {
   if (missingFeatures.length > 0) {
     throw new Error("Features not covered by any phase: " + missingFeatures.join(", ") + " - fail-closed");
   }
+  const orphans = Array.from(conceptById.keys()).filter((cid) => !emittedConcepts.has(cid));
+  if (orphans.length > 0) {
+    pushDiagnostic(
+      opts,
+      "orphan_concept",
+      "error",
+      "Knowledge graph has " + orphans.length + " concept(s) no phase introduces and no link consumes \u2014 they will not be taught: " + orphans.join(", "),
+      orphans
+    );
+  }
   const phaseNodeIds = [];
   for (const ctx of emitCtx) {
     const ids = [...ctx.conceptOrder];
@@ -422,13 +566,26 @@ function emitFromHybrid(hybrid, opts) {
       const f = features.find((x) => str(x.id) === fid);
       const stepIds = addFeatureGroup(f, fid, nodes, edges, groupings);
       for (const sid of stepIds) {
-        const node = nodes.find((n) => n.id === sid);
+        const node = nodes.find((x) => x.id === sid);
         node.phase_id = ctx.id;
       }
       ids.push(...stepIds);
     }
+    if (ids.length === 0) {
+      throw new Error("Phase " + ctx.id + " contains no teaching nodes (no concepts introduced and no feature steps) - drop it or give it work - fail-closed");
+    }
     phaseNodeIds.push(ids);
   }
+  const idlessInHybrid = takeSteplessStepIds();
+  if (idlessInHybrid.length > 0) {
+    pushDiagnostic(
+      opts,
+      "step_without_id",
+      "warning",
+      "Step(s) carrying no id cannot become planning nodes and were dropped (feature#index): " + idlessInHybrid.join(", "),
+      idlessInHybrid
+    );
+  }
   const placed = new Set(phaseNodeIds.flat());
   const orderedNodes = [];
   for (const ids of phaseNodeIds) {
@@ -459,7 +616,13 @@ function emitFromHybrid(hybrid, opts) {
     const anchorPhaseIdx = anchorNode ? emitCtx.findIndex((c2) => c2.id === anchorNode.phase_id) : -1;
     const stepPhaseIdx = stepNode ? emitCtx.findIndex((c2) => c2.id === stepNode.phase_id) : -1;
     if (emitCtx.length > 0 && anchorPhaseIdx > stepPhaseIdx) {
-      pushWarning(opts, "hybrid link drift: concept " + cid + " is fully taught in a later phase than consumer " + firstStep + " (a preview covers the dependency)");
+      pushDiagnostic(
+        opts,
+        "hybrid_link_drift",
+        "warning",
+        "hybrid link drift: concept " + cid + " is fully taught in a later phase than consumer " + firstStep + " (a preview covers the dependency)",
+        [cid, firstStep]
+      );
       continue;
     }
     pushEdge(cid, firstStep, str(l.relationship, "hybrid link") + " [" + depth + "]");
@@ -473,12 +636,12 @@ function emitFromHybrid(hybrid, opts) {
   const feedOrder = new Map(nodes.map((n, i) => [n.id, i]));
   const introducer = /* @__PURE__ */ new Map();
   for (const n of nodes) for (const k of n.keywords?.new ?? []) {
-    const key = k.toLowerCase();
+    const key = keywordKey(k);
     if (!introducer.has(key)) introducer.set(key, n.id);
   }
   for (const n of nodes) {
     for (const k of n.keywords?.prerequisite ?? []) {
-      const src = introducer.get(k.toLowerCase());
+      const src = introducer.get(keywordKey(k));
       if (!src || src === n.id) continue;
       const srcNode = nodes.find((x) => x.id === src);
       const phaseOf = (id) => {
@@ -489,9 +652,12 @@ function emitFromHybrid(hybrid, opts) {
       const fromPhase = phaseOf(src);
       const toPhase = phaseOf(n.id);
       if (conceptOvertaken || emitCtx.length > 0 && fromPhase > toPhase) {
-        pushWarning(
+        pushDiagnostic(
           opts,
-          "keyword-order drift: introducer " + src + " sits in a later phase than consumer " + n.id + ' (keyword "' + k + '") \u2014 host should move the introducer earlier'
+          conceptOvertaken ? "concept_overtaken_by_step" : "keyword_order_drift",
+          "warning",
+          "keyword-order drift: introducer " + src + " sits in a later phase than consumer " + n.id + ' (keyword "' + k + '") \u2014 host should move the introducer earlier',
+          [src, n.id]
         );
         continue;
       }
@@ -507,7 +673,7 @@ function emitFromHybrid(hybrid, opts) {
   }));
   return validateCurriculumFeed({
     schema_version: 2,
-    source: { graph_type: "hybrid_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
+    source: buildSource(opts, "hybrid_graph"),
     learning_nodes: nodes,
     dependency_edges: edges,
     suggested_groupings: groupings,
@@ -535,11 +701,17 @@ function emitFromKnowledge(kg, opts) {
   const edges = [];
   const groupings = [];
   const conceptIds = new Set(arr(kg.concepts).map((c) => str(c.id)));
+  const externalByNode = /* @__PURE__ */ new Map();
   for (const c of arr(kg.concepts)) {
     const node = feedNodeFromConcept(c);
     nodes.push(node);
-    for (const p of strs(c.prerequisites)) {
-      if (p !== node.id && conceptIds.has(p)) {
+    const { internal, external } = splitPrerequisites(c, conceptIds);
+    if (external.length > 0) {
+      node.external_prerequisites = external;
+      externalByNode.set(node.id, external);
+    }
+    for (const p of internal) {
+      if (p !== node.id) {
         edges.push({
           from: p,
           to: node.id,
@@ -549,6 +721,7 @@ function emitFromKnowledge(kg, opts) {
       }
     }
   }
+  noteExternalPrerequisites(opts, externalByNode);
   if (arr(kg.learning_path).length > 0) {
     const orderMap = /* @__PURE__ */ new Map();
     arr(kg.learning_path).forEach((s, idx) => {
@@ -573,7 +746,7 @@ function emitFromKnowledge(kg, opts) {
   newKeywordsInOrder(nodes);
   return validateCurriculumFeed({
     schema_version: 2,
-    source: { graph_type: "knowledge_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
+    source: buildSource(opts, "knowledge_graph"),
     learning_nodes: nodes,
     dependency_edges: edges,
     suggested_groupings: groupings,
@@ -584,17 +757,38 @@ function emitFromProject(pg, opts) {
   const nodes = [];
   const edges = [];
   const groupings = [];
-  arr(pg.features).forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad2(fi + 1)), nodes, edges, groupings));
-  if (nodes.length === 0 && arr(pg.features).length > 0) {
+  const allFeatures = arr(pg.features);
+  allFeatures.forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad2(fi + 1)), nodes, edges, groupings));
+  const stepless = allFeatures.filter((f) => arr(f.steps).length === 0).map((f) => str(f.id)).filter(Boolean);
+  if (stepless.length > 0) {
+    pushDiagnostic(
+      opts,
+      "feature_without_steps",
+      "warning",
+      "Feature(s) declared but carrying no steps \u2014 they will be absent from the feed: " + stepless.join(", "),
+      stepless
+    );
+  }
+  const idless = takeSteplessStepIds();
+  if (idless.length > 0) {
+    pushDiagnostic(
+      opts,
+      "step_without_id",
+      "warning",
+      "Step(s) carrying no id cannot become planning nodes and were dropped (feature#index): " + idless.join(", "),
+      idless
+    );
+  }
+  if (nodes.length === 0 && allFeatures.length > 0) {
     const hasTasks = arr(pg.implementation ?? {}).length > 0 || arr(pg.implementation?.tasks).length > 0;
     throw new Error(
-      "Project graph has " + arr(pg.features).length + " features but NO features[].steps - the curriculum feed cannot emit planning nodes." + (hasTasks ? " This looks like a legacy knowledge-tree graph (implementation.tasks). Regenerate it with the domain-kit v3 pipeline (runProjectGraphPipeline / hybridGraphPipeline), then re-run." : " Every feature must carry at least one step with id/name/keywords/effort for curriculum planning.")
+      "Project graph has " + allFeatures.length + " features but NO features[].steps - the curriculum feed cannot emit planning nodes." + (hasTasks ? " This looks like a legacy knowledge-tree graph (implementation.tasks). Regenerate it with the domain-kit v3 pipeline (runProjectGraphPipeline / hybridGraphPipeline), then re-run." : " Every feature must carry at least one step with id/name/keywords/effort for curriculum planning.")
     );
   }
   newKeywordsInOrder(nodes);
   return validateCurriculumFeed({
     schema_version: 2,
-    source: { graph_type: "project_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
+    source: buildSource(opts, "project_graph"),
     learning_nodes: nodes,
     dependency_edges: edges,
     suggested_groupings: groupings,
@@ -613,6 +807,8 @@ function emitCurriculumFeed(graph, opts = {}) {
   return emitFromProject(g, opts);
 }
 
+exports.DEFAULT_STEP_MINUTES = DEFAULT_STEP_MINUTES;
+exports.DEPTH_MINUTE_FRACTIONS = DEPTH_MINUTE_FRACTIONS;
 exports.emitCurriculumFeed = emitCurriculumFeed;
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map