@thanh01.pmt/domain-kit 0.2.1 → 0.4.0

package/dist/index.d.cts

@@ -1,8 +1,8 @@
 export { i as ArchEdgeSchema, A as ArchNodeSchema, x as ArchitectureDetail, j as ArchitectureDetailSchema, w as Capability, C as CapabilitySchema, z as DataIntegration, m as DataIntegrationSchema, G as Decomposition, s as DecompositionSchema, D as DevelopmentStageSchema, y as Experience, E as ExperienceComponentSchema, l as ExperienceSchema, d as Feature, F as FeatureSchema, B as Implementation, I as ImplementationSchema, e as JourneySchema, J as JourneyStepSchema, r as MilestoneDecompositionSchema, M as MissingGapSchema, N as NavigationSchema, v as Product, P as ProductGoalSchema, g as ProductSchema, f as ProductUserSchema, u as ProjectGraph, t as ProjectGraphSchema, h as ProjectInfoSchema, R as RequirementSchema, k as ScreenSchema, c as Step, S as StepEffortSchema, a as StepOutcomeSchema, b as StepSchema, n as TaskEffortSchema, o as TaskOutcomeSchema, p as TaskSchema, q as TechDebtSchema, T as TechStackSchema, U as UiStateSchema } from './projectGraphSchema-DnD7orZV.cjs';
-export { b as Concept, d as ConceptCategory, c as ConceptCategorySchema, m as ConceptIntroduction, i as ConceptIntroductionSchema, C as ConceptSchema, l as DevelopmentPhase, D as DevelopmentPhaseSchema, j as HybridGraph, H as HybridGraphSchema, g as KnowledgeGraph, K as KnowledgeGraphSchema, f as LearningPathStep, L as LearningPathStepSchema, a as ProblemType, P as ProblemTypeSchema, k as ProjectConceptLink, h as ProjectConceptLinkSchema, e as SubjectInfo, S as SubjectInfoSchema } from './hybridGraphSchema-BCgXicgA.cjs';
+export { b as Concept, d as ConceptCategory, c as ConceptCategorySchema, m as ConceptIntroduction, i as ConceptIntroductionSchema, C as ConceptSchema, l as DevelopmentPhase, D as DevelopmentPhaseSchema, j as HybridGraph, H as HybridGraphSchema, g as KnowledgeGraph, K as KnowledgeGraphSchema, f as LearningPathStep, L as LearningPathStepSchema, a as ProblemType, P as ProblemTypeSchema, k as ProjectConceptLink, h as ProjectConceptLinkSchema, e as SubjectInfo, S as SubjectInfoSchema } from './hybridGraphSchema-nrUeSwpU.cjs';
 export { ExperimentProcedureSchema, GrammarRuleSchema, HardwareFeatureExtensionSchema, HardwareStepSchema, HardwareTaskExtensionSchema, HardwareTechStackExtensionSchema, LanguageConceptExtension, LanguageConceptExtensionSchema, MathConceptExtension, MathConceptExtensionSchema, MathTheoremSchema, ScienceConceptExtension, ScienceConceptExtensionSchema, ShapeSchema, ThreeDesignFeatureExtensionSchema, ThreeDesignTaskExtensionSchema, ThreeDesignTechStackExtensionSchema, WiringSchema } from './schemas/index.cjs';
 export { a as DetectionConfidenceSchema, e as DomainCategory, D as DomainCategorySchema, c as DomainProfile, b as DomainProfileSchema, g as GraphType, G as GraphTypeSchema, d as InputType, I as InputTypeSchema, f as LearningMode, L as LearningModeSchema } from './domainProfileSchema-CwT3Ffsw.cjs';
-export { g as CurriculumFeed, C as CurriculumFeedSchema, i as FeedEdge, c as FeedEdgeSchema, j as FeedGrouping, d as FeedGroupingSchema, F as FeedKeywordsSchema, h as FeedNode, b as FeedNodeSchema, f as FeedPhase, e as FeedPhaseSchema, a as FeedScaffoldCandidateSchema, v as validateCurriculumFeed } from './curriculumFeedSchema-TEeQg2bY.cjs';
+export { g as CurriculumFeed, C as CurriculumFeedSchema, i as FeedEdge, c as FeedEdgeSchema, j as FeedGrouping, d as FeedGroupingSchema, F as FeedKeywordsSchema, h as FeedNode, b as FeedNodeSchema, f as FeedPhase, e as FeedPhaseSchema, a as FeedScaffoldCandidateSchema, v as validateCurriculumFeed } from './curriculumFeedSchema-B66H3gEV.cjs';
 export { C as CppParseResult, P as PythonParseResult, S as SwiftParseResult, T as TsParseResult, f as mergeCppResults, d as mergePythonResults, m as mergeSwiftResults, b as mergeTsResults, e as parseCppFile, c as parsePythonFile, p as parseSwiftFile, a as parseTsFile } from './cpp-CZUPqJt9.cjs';
 export { P as ParsedSyllabus, a as SyllabusTopic, S as SyllabusUnit, p as parseSyllabus } from './syllabusParser-MSX1fEzW.cjs';
 export { K as Keyword, S as SourceContext, e as extractKeywords } from './keywordExtractor-BxlGRMHC.cjs';
@@ -10,7 +10,7 @@ export { FileRelevanceScore, scoreByContent, scoreByPath, scoreFiles, selectRele
 export { DetectDomainOptions, DetectInputTypeOptions, DetectLearningModeOptions, DomainDetectionResult, InputTypeDetectionResult, LearningModeDetectionResult, detectDomain, detectInputType, detectLearningMode } from './detector/index.cjs';
 export { D as DetectDomainProfileOptions, d as detectDomainProfile } from './domainProfileDetector-bzugdQmS.cjs';
 export { CIO_CODE_RE, CONCEPT_CODE_RE, DepthLayerAudit, ExtractOverviewOptions, ExtractScaffoldOptions, ExtractStepsOptions, LEARNER_CLAUSE, SIO_CODE_RE, ULO_CODE_RE, assignConceptCodes, auditDepthLayers, cioActionSlug, cioCode, conceptCodeFromName, extractFeatureSteps, extractFeatureStepsBatched, extractProjectOverview, extractScaffold, sioCode, standardStatement, techTagFor, uloCode } from './graph/index.cjs';
-export { H as Hallucination, i as HybridGraphPipelineOptions, j as HybridGraphPipelineResult, K as KnowledgeGraphPipelineOptions, a as KnowledgeGraphPipelineResult, f as KnowledgeGraphVerificationReport, V as VerifyOptions, e as auditSyllabusCoverage, c as breakPrerequisiteCycles, d as detectPrerequisiteCycles, h as generateHybridGraph, g as generateKnowledgeGraph, b as verifyKnowledgeGraph, v as verifyProjectGraph } from './hybridGraphPipeline-DmWRKYXf.cjs';
+export { H as Hallucination, j as HybridGraphPipelineOptions, k as HybridGraphPipelineResult, K as KnowledgeGraphPipelineOptions, a as KnowledgeGraphPipelineResult, f as KnowledgeGraphVerificationReport, V as VerifyOptions, i as auditPhasePlan, e as auditSyllabusCoverage, c as breakPrerequisiteCycles, d as detectPrerequisiteCycles, h as generateHybridGraph, g as generateKnowledgeGraph, b as verifyKnowledgeGraph, v as verifyProjectGraph } from './hybridGraphPipeline-dT-bio-3.cjs';
 export { C as ConceptMapping, E as EscalateOptions, e as escalateAndMapConcepts } from './conceptEscalator-ltRLtPhf.cjs';
 export { ConceptMatch, ProposedConcept, ResolveConceptsOptions, ResolveConceptsResult, ResolvedConcept, resolveConcepts } from './concepts/index.cjs';
 export { AssembleOptions, AssembledMilestone, AssembledPhase, AssembledRoadmap, assembleRoadmap } from './assembly/index.cjs';

package/dist/index.d.ts

@@ -1,8 +1,8 @@
 export { i as ArchEdgeSchema, A as ArchNodeSchema, x as ArchitectureDetail, j as ArchitectureDetailSchema, w as Capability, C as CapabilitySchema, z as DataIntegration, m as DataIntegrationSchema, G as Decomposition, s as DecompositionSchema, D as DevelopmentStageSchema, y as Experience, E as ExperienceComponentSchema, l as ExperienceSchema, d as Feature, F as FeatureSchema, B as Implementation, I as ImplementationSchema, e as JourneySchema, J as JourneyStepSchema, r as MilestoneDecompositionSchema, M as MissingGapSchema, N as NavigationSchema, v as Product, P as ProductGoalSchema, g as ProductSchema, f as ProductUserSchema, u as ProjectGraph, t as ProjectGraphSchema, h as ProjectInfoSchema, R as RequirementSchema, k as ScreenSchema, c as Step, S as StepEffortSchema, a as StepOutcomeSchema, b as StepSchema, n as TaskEffortSchema, o as TaskOutcomeSchema, p as TaskSchema, q as TechDebtSchema, T as TechStackSchema, U as UiStateSchema } from './projectGraphSchema-DnD7orZV.js';
-export { b as Concept, d as ConceptCategory, c as ConceptCategorySchema, m as ConceptIntroduction, i as ConceptIntroductionSchema, C as ConceptSchema, l as DevelopmentPhase, D as DevelopmentPhaseSchema, j as HybridGraph, H as HybridGraphSchema, g as KnowledgeGraph, K as KnowledgeGraphSchema, f as LearningPathStep, L as LearningPathStepSchema, a as ProblemType, P as ProblemTypeSchema, k as ProjectConceptLink, h as ProjectConceptLinkSchema, e as SubjectInfo, S as SubjectInfoSchema } from './hybridGraphSchema-BCgXicgA.js';
+export { b as Concept, d as ConceptCategory, c as ConceptCategorySchema, m as ConceptIntroduction, i as ConceptIntroductionSchema, C as ConceptSchema, l as DevelopmentPhase, D as DevelopmentPhaseSchema, j as HybridGraph, H as HybridGraphSchema, g as KnowledgeGraph, K as KnowledgeGraphSchema, f as LearningPathStep, L as LearningPathStepSchema, a as ProblemType, P as ProblemTypeSchema, k as ProjectConceptLink, h as ProjectConceptLinkSchema, e as SubjectInfo, S as SubjectInfoSchema } from './hybridGraphSchema-nrUeSwpU.js';
 export { ExperimentProcedureSchema, GrammarRuleSchema, HardwareFeatureExtensionSchema, HardwareStepSchema, HardwareTaskExtensionSchema, HardwareTechStackExtensionSchema, LanguageConceptExtension, LanguageConceptExtensionSchema, MathConceptExtension, MathConceptExtensionSchema, MathTheoremSchema, ScienceConceptExtension, ScienceConceptExtensionSchema, ShapeSchema, ThreeDesignFeatureExtensionSchema, ThreeDesignTaskExtensionSchema, ThreeDesignTechStackExtensionSchema, WiringSchema } from './schemas/index.js';
 export { a as DetectionConfidenceSchema, e as DomainCategory, D as DomainCategorySchema, c as DomainProfile, b as DomainProfileSchema, g as GraphType, G as GraphTypeSchema, d as InputType, I as InputTypeSchema, f as LearningMode, L as LearningModeSchema } from './domainProfileSchema-CwT3Ffsw.js';
-export { g as CurriculumFeed, C as CurriculumFeedSchema, i as FeedEdge, c as FeedEdgeSchema, j as FeedGrouping, d as FeedGroupingSchema, F as FeedKeywordsSchema, h as FeedNode, b as FeedNodeSchema, f as FeedPhase, e as FeedPhaseSchema, a as FeedScaffoldCandidateSchema, v as validateCurriculumFeed } from './curriculumFeedSchema-TEeQg2bY.js';
+export { g as CurriculumFeed, C as CurriculumFeedSchema, i as FeedEdge, c as FeedEdgeSchema, j as FeedGrouping, d as FeedGroupingSchema, F as FeedKeywordsSchema, h as FeedNode, b as FeedNodeSchema, f as FeedPhase, e as FeedPhaseSchema, a as FeedScaffoldCandidateSchema, v as validateCurriculumFeed } from './curriculumFeedSchema-B66H3gEV.js';
 export { C as CppParseResult, P as PythonParseResult, S as SwiftParseResult, T as TsParseResult, f as mergeCppResults, d as mergePythonResults, m as mergeSwiftResults, b as mergeTsResults, e as parseCppFile, c as parsePythonFile, p as parseSwiftFile, a as parseTsFile } from './cpp-CZUPqJt9.js';
 export { P as ParsedSyllabus, a as SyllabusTopic, S as SyllabusUnit, p as parseSyllabus } from './syllabusParser-MSX1fEzW.js';
 export { K as Keyword, S as SourceContext, e as extractKeywords } from './keywordExtractor-DU5XRN8-.js';
@@ -10,7 +10,7 @@ export { FileRelevanceScore, scoreByContent, scoreByPath, scoreFiles, selectRele
 export { DetectDomainOptions, DetectInputTypeOptions, DetectLearningModeOptions, DomainDetectionResult, InputTypeDetectionResult, LearningModeDetectionResult, detectDomain, detectInputType, detectLearningMode } from './detector/index.js';
 export { D as DetectDomainProfileOptions, d as detectDomainProfile } from './domainProfileDetector-DHb1T0zB.js';
 export { CIO_CODE_RE, CONCEPT_CODE_RE, DepthLayerAudit, ExtractOverviewOptions, ExtractScaffoldOptions, ExtractStepsOptions, LEARNER_CLAUSE, SIO_CODE_RE, ULO_CODE_RE, assignConceptCodes, auditDepthLayers, cioActionSlug, cioCode, conceptCodeFromName, extractFeatureSteps, extractFeatureStepsBatched, extractProjectOverview, extractScaffold, sioCode, standardStatement, techTagFor, uloCode } from './graph/index.js';
-export { H as Hallucination, i as HybridGraphPipelineOptions, j as HybridGraphPipelineResult, K as KnowledgeGraphPipelineOptions, a as KnowledgeGraphPipelineResult, f as KnowledgeGraphVerificationReport, V as VerifyOptions, e as auditSyllabusCoverage, c as breakPrerequisiteCycles, d as detectPrerequisiteCycles, h as generateHybridGraph, g as generateKnowledgeGraph, b as verifyKnowledgeGraph, v as verifyProjectGraph } from './hybridGraphPipeline-DVZYLCAQ.js';
+export { H as Hallucination, j as HybridGraphPipelineOptions, k as HybridGraphPipelineResult, K as KnowledgeGraphPipelineOptions, a as KnowledgeGraphPipelineResult, f as KnowledgeGraphVerificationReport, V as VerifyOptions, i as auditPhasePlan, e as auditSyllabusCoverage, c as breakPrerequisiteCycles, d as detectPrerequisiteCycles, h as generateHybridGraph, g as generateKnowledgeGraph, b as verifyKnowledgeGraph, v as verifyProjectGraph } from './hybridGraphPipeline-DXQDbBEj.js';
 export { C as ConceptMapping, E as EscalateOptions, e as escalateAndMapConcepts } from './conceptEscalator-YfMKIKCZ.js';
 export { ConceptMatch, ProposedConcept, ResolveConceptsOptions, ResolveConceptsResult, ResolvedConcept, resolveConcepts } from './concepts/index.js';
 export { AssembleOptions, AssembledMilestone, AssembledPhase, AssembledRoadmap, assembleRoadmap } from './assembly/index.js';

package/dist/index.mjs

@@ -1,8 +1,8 @@
 import './chunk-R57WTNXW.mjs';
-export { runDomainPipeline, runHybridGraphPipeline, runKnowledgeGraphPipeline, runProjectGraphPipeline } from './chunk-23TQPTHG.mjs';
-export { emitCurriculumFeed } from './chunk-HUDFN4IX.mjs';
-export { ArchEdgeSchema, ArchNodeSchema, ArchitectureDetailSchema, CapabilitySchema, ConceptCategorySchema, ConceptIntroductionSchema, ConceptSchema, DataIntegrationSchema, DecompositionSchema, DetectionConfidenceSchema, DevelopmentPhaseSchema, DevelopmentStageSchema, DomainCategorySchema, DomainProfileSchema, ExperienceComponentSchema, ExperienceSchema, ExperimentProcedureSchema, FeatureSchema, GrammarRuleSchema, GraphTypeSchema, HardwareFeatureExtensionSchema, HardwareStepSchema, HardwareTaskExtensionSchema, HardwareTechStackExtensionSchema, HybridGraphSchema, ImplementationSchema, InputTypeSchema, JourneySchema, JourneyStepSchema, KnowledgeGraphSchema, LanguageConceptExtensionSchema, LearningModeSchema, LearningPathStepSchema, MathConceptExtensionSchema, MathTheoremSchema, MilestoneDecompositionSchema, MissingGapSchema, NavigationSchema, ProblemTypeSchema, ProductGoalSchema, ProductSchema, ProductUserSchema, ProjectConceptLinkSchema, ProjectGraphSchema, ProjectInfoSchema, RequirementSchema, ScienceConceptExtensionSchema, ScreenSchema, ShapeSchema, StepEffortSchema, StepOutcomeSchema, StepSchema, SubjectInfoSchema, TaskEffortSchema, TaskOutcomeSchema, TaskSchema, TechDebtSchema, TechStackSchema, ThreeDesignFeatureExtensionSchema, ThreeDesignTaskExtensionSchema, ThreeDesignTechStackExtensionSchema, UiStateSchema, WiringSchema } from './chunk-WHBAGJWN.mjs';
-export { CurriculumFeedSchema, FeedEdgeSchema, FeedGroupingSchema, FeedKeywordsSchema, FeedNodeSchema, FeedPhaseSchema, FeedScaffoldCandidateSchema, validateCurriculumFeed } from './chunk-HH4UX65C.mjs';
+export { runDomainPipeline, runHybridGraphPipeline, runKnowledgeGraphPipeline, runProjectGraphPipeline } from './chunk-LZQLLAYP.mjs';
+export { emitCurriculumFeed } from './chunk-QJF4QCBJ.mjs';
+export { ArchEdgeSchema, ArchNodeSchema, ArchitectureDetailSchema, CapabilitySchema, ConceptCategorySchema, ConceptIntroductionSchema, ConceptSchema, DataIntegrationSchema, DecompositionSchema, DetectionConfidenceSchema, DevelopmentPhaseSchema, DevelopmentStageSchema, DomainCategorySchema, DomainProfileSchema, ExperienceComponentSchema, ExperienceSchema, ExperimentProcedureSchema, FeatureSchema, GrammarRuleSchema, GraphTypeSchema, HardwareFeatureExtensionSchema, HardwareStepSchema, HardwareTaskExtensionSchema, HardwareTechStackExtensionSchema, HybridGraphSchema, ImplementationSchema, InputTypeSchema, JourneySchema, JourneyStepSchema, KnowledgeGraphSchema, LanguageConceptExtensionSchema, LearningModeSchema, LearningPathStepSchema, MathConceptExtensionSchema, MathTheoremSchema, MilestoneDecompositionSchema, MissingGapSchema, NavigationSchema, ProblemTypeSchema, ProductGoalSchema, ProductSchema, ProductUserSchema, ProjectConceptLinkSchema, ProjectGraphSchema, ProjectInfoSchema, RequirementSchema, ScienceConceptExtensionSchema, ScreenSchema, ShapeSchema, StepEffortSchema, StepOutcomeSchema, StepSchema, SubjectInfoSchema, TaskEffortSchema, TaskOutcomeSchema, TaskSchema, TechDebtSchema, TechStackSchema, ThreeDesignFeatureExtensionSchema, ThreeDesignTaskExtensionSchema, ThreeDesignTechStackExtensionSchema, UiStateSchema, WiringSchema } from './chunk-VCPIWJ7R.mjs';
+export { CurriculumFeedSchema, FeedEdgeSchema, FeedGroupingSchema, FeedKeywordsSchema, FeedNodeSchema, FeedPhaseSchema, FeedScaffoldCandidateSchema, validateCurriculumFeed } from './chunk-PKUEOSZ3.mjs';
 import './chunk-IJZUV7N3.mjs';
 export { mergeCppResults, mergePythonResults, mergeSwiftResults, mergeTsResults, parseCppFile, parsePythonFile, parseSwiftFile, parseTsFile } from './chunk-DRVOV5ZD.mjs';
 export { scoreByContent, scoreByPath, scoreFiles, selectRelevantFiles } from './chunk-RKRNOVKO.mjs';
@@ -10,7 +10,7 @@ export { extractKeywords } from './chunk-XMHKWHVK.mjs';
 import './chunk-7XGWW6CB.mjs';
 export { detectDomain, detectDomainProfile, detectInputType, detectLearningMode } from './chunk-BL5NBKPH.mjs';
 import './chunk-ZKLT27T4.mjs';
-export { CIO_CODE_RE, CONCEPT_CODE_RE, LEARNER_CLAUSE, SIO_CODE_RE, ULO_CODE_RE, assignConceptCodes, auditDepthLayers, auditSyllabusCoverage, breakPrerequisiteCycles, cioActionSlug, cioCode, conceptCodeFromName, detectPrerequisiteCycles, escalateAndMapConcepts, extractFeatureSteps, extractFeatureStepsBatched, extractProjectOverview, extractScaffold, generateHybridGraph, generateKnowledgeGraph, sioCode, standardStatement, techTagFor, uloCode, verifyKnowledgeGraph, verifyProjectGraph } from './chunk-CRN6D4HG.mjs';
+export { CIO_CODE_RE, CONCEPT_CODE_RE, LEARNER_CLAUSE, SIO_CODE_RE, ULO_CODE_RE, assignConceptCodes, auditDepthLayers, auditPhasePlan, auditSyllabusCoverage, breakPrerequisiteCycles, cioActionSlug, cioCode, conceptCodeFromName, detectPrerequisiteCycles, escalateAndMapConcepts, extractFeatureSteps, extractFeatureStepsBatched, extractProjectOverview, extractScaffold, generateHybridGraph, generateKnowledgeGraph, sioCode, standardStatement, techTagFor, uloCode, verifyKnowledgeGraph, verifyProjectGraph } from './chunk-HILSUZOF.mjs';
 export { parseSyllabus } from './chunk-T4Y2DE2W.mjs';
 import './chunk-KMYENICQ.mjs';
 export { resolveConcepts } from './chunk-KNDBODUQ.mjs';

package/dist/pipeline/index.cjs

@@ -39,6 +39,22 @@ 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");
+  if (parsed.phases.length > 0) {
+    const phaseIndexOf = /* @__PURE__ */ new Map();
+    parsed.phases.forEach((p, i) => {
+      for (const id of p.node_ids) phaseIndexOf.set(id, i);
+    });
+    for (const e of parsed.dependency_edges) {
+      const fromIdx = phaseIndexOf.get(e.from);
+      const toIdx = phaseIndexOf.get(e.to);
+      if (fromIdx === void 0 || toIdx === void 0) continue;
+      if (fromIdx > toIdx) {
+        throw new Error(
+          "curriculum feed teaching-order violation: prerequisite " + e.from + " (phase " + (fromIdx + 1) + ") is scheduled AFTER its consumer " + e.to + " (phase " + (toIdx + 1) + ")"
+        );
+      }
+    }
+  }
   return parsed;
 }
 var FeedKeywordsSchema, FeedScaffoldCandidateSchema, FeedNodeSchema, FeedEdgeSchema, FeedGroupingSchema, FeedPhaseSchema, CurriculumFeedSchema;
@@ -72,11 +88,33 @@ var init_curriculumFeedSchema = __esm({
       references: zod.z.array(zod.z.object({ file: zod.z.string().min(1), evidence: zod.z.string().default("") })).default([]),
       feature_id: zod.z.string().nullable().default(null),
       concept_ref: zod.z.string().nullable().default(null),
+      // P52/T2.1: outcome.user_visible projected from the ProjectGraph step — the
+      // tangible checkpoint the session-cutting planner aims for (empty when the
+      // step declares no user-visible result). Concepts carry '' by default.
+      user_visible_deliverable: zod.z.string().default(""),
+      // P52/T3.1 — depth-reconcile inputs (optional/defaulted so old feeds
+      // validate unchanged):
+      // • depth_variants: minutes to teach this node at each depth level.
+      //  ULO (know-it-exists) ≤ CIO (mechanism) ≤ SIO (implementation). All 3
+      //   required so a downgrade never turns an anchor teach into a zero.
+      // • depth_scaffold_candidates: parallel to scaffold_candidates but
+      //   acts on DEPTH (e.g. SIO→CIO) instead of lesson time.
+      // • is_core: concept is a Master-Tree core concept — reconciler must
+      //   never downgrade it; escalate instead.
+      depth_variants: zod.z.object({ ulo: zod.z.number().int().nonnegative(), cio: zod.z.number().int().nonnegative(), sio: zod.z.number().int().nonnegative() }).optional(),
+      depth_scaffold_candidates: zod.z.array(zod.z.object({
+        from_depth: zod.z.enum(["ulo", "cio", "sio"]),
+        to_depth: zod.z.enum(["ulo", "cio", "sio"]),
+        minutes_saved: zod.z.number().int().nonnegative(),
+        reason: zod.z.string().default("")
+      })).optional(),
+      is_core: zod.z.boolean().default(false),
       // Progressive-completion bookkeeping (feed v2, additive):
       // phase_id = development phase that introduces/uses this node;
-      // introduce_aspect = how the phase teaches a concept node (first intro vs advanced revisit).
+      // introduce_aspect = how the phase teaches a concept node (first intro, advanced
+      // revisit, or preview — a light ULO awareness pass that is NOT the introduction).
       phase_id: zod.z.string().default(""),
-      introduce_aspect: zod.z.enum(["new", "advanced"]).nullable().default(null)
+      introduce_aspect: zod.z.enum(["new", "advanced", "preview"]).nullable().default(null)
     });
     FeedEdgeSchema = zod.z.object({
       from: zod.z.string().min(1),
@@ -123,6 +161,9 @@ function stepMinutes(step) {
   const effort = step.effort ?? {};
   return Math.max(0, Math.round(num(effort.estimated_minutes, num(step.estimated_minutes, 45))));
 }
+function pushWarning(opts, message) {
+  (opts.warnings ?? (opts.warnings = [])).push(message);
+}
 function newKeywordsInOrder(nodes) {
   const seen = /* @__PURE__ */ new Set();
   for (const n of nodes) {
@@ -152,6 +193,10 @@ function feedNodeFromStep(step, featureId) {
     references: arr(step.files).map((f) => ({ file: str(f), evidence: "step file" })).filter((f) => f.file),
     feature_id: featureId,
     concept_ref: null,
+    // P52/T2.1: carry the step's tangible outcome so the planner can cut
+    // sessions at user-visible checkpoints instead of raw minute counts.
+    user_visible_deliverable: str(step.outcome?.user_visible),
+    is_core: false,
     phase_id: "",
     introduce_aspect: null
   };
@@ -170,6 +215,20 @@ function deriveConceptDepthHint(concept) {
   if (str(concept.cio) || prereqs.length >= 1) return "cio";
   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 variants = { ulo, cio, sio };
+  const candidates = [];
+  if (depth === "sio") {
+    candidates.push({ from_depth: "sio", to_depth: "cio", minutes_saved: sio - cio, reason: "SIO implementation practice deferred \u2014 CIO mechanism suffices for downstream consumers" });
+  }
+  if (depth === "cio" || depth === "sio") {
+    candidates.push({ from_depth: depth, to_depth: "ulo", minutes_saved: (depth === "sio" ? sio : cio) - ulo, reason: "Mechanism deferred \u2014 ULO awareness suffices (know-it-exists); never below the ULO floor" });
+  }
+  return { depth_variants: variants, depth_scaffold_candidates: candidates };
+}
 function feedNodeFromConcept(concept) {
   const id = str(concept.id);
   const pts = arr(concept.problem_types).map((p) => str(p.bloom_level, "Understand")).filter((b) => b in BLOOM_RANK).sort((a, b) => BLOOM_RANK[a] - BLOOM_RANK[b]);
@@ -199,6 +258,10 @@ function feedNodeFromConcept(concept) {
     references,
     feature_id: null,
     concept_ref: id,
+    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,
     phase_id: "",
     introduce_aspect: null
   };
@@ -259,6 +322,7 @@ function emitFromHybrid(hybrid, opts) {
   }
   const emitCtx = [];
   const emittedConcepts = /* @__PURE__ */ new Set();
+  const previewsEmitted = /* @__PURE__ */ new Set();
   const linkList = arr(hybrid.links);
   for (const rp of rawPhases) {
     const pid = str(rp.id);
@@ -267,7 +331,8 @@ function emitFromHybrid(hybrid, opts) {
     const intros = arr(rp.introduces);
     const news = intros.filter((i) => str(i.aspect, "new") === "new");
     const advanced = intros.filter((i) => str(i.aspect) === "advanced");
-    for (const intro of [...news, ...advanced]) {
+    const previews = intros.filter((i) => str(i.aspect) === "preview");
+    for (const intro of [...news, ...advanced, ...previews]) {
       const cid = str(intro.concept_id);
       const c = conceptById.get(cid);
       if (!c) {
@@ -276,6 +341,39 @@ function emitFromHybrid(hybrid, opts) {
       if (str(intro.aspect, "new") === "advanced" && !emittedConcepts.has(cid)) {
         throw new Error("Phase " + pid + " advanced-revisits concept " + cid + " that was never emitted - fail-closed");
       }
+      if (str(intro.aspect, "new") === "preview") {
+        if (emittedConcepts.has(cid)) {
+          throw new Error("Phase " + pid + " previews concept " + cid + " that was already introduced - preview must precede the anchor teach - fail-closed");
+        }
+        if (previewsEmitted.has(cid)) {
+          throw new Error("Phase " + pid + " duplicate preview of concept " + cid + " - fail-closed");
+        }
+        const pidIdx = rawPhases.findIndex((rp2) => str(rp2.id) === pid);
+        const anchorIdx = rawPhases.findIndex((rp2) => arr(rp2.introduces).some((i2) => str(i2.concept_id) === cid && str(i2.aspect, "new") !== "preview"));
+        if (anchorIdx < 0) {
+          throw new Error("Phase " + pid + " previews concept " + cid + " that is never fully introduced in any phase - fail-closed");
+        }
+        if (pidIdx >= anchorIdx) {
+          throw new Error("Phase " + pid + " previews concept " + cid + " whose anchor introduction is not in a LATER phase - fail-closed");
+        }
+        previewsEmitted.add(cid);
+        const prevNode = feedNodeFromConcept(c);
+        prevNode.id = cid + "__PREV" + pad22(order);
+        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.depth_hint = "ulo";
+        prevNode.bloom_hint = "Understand";
+        prevNode.concept_codes = [str(c.code) || cid];
+        prevNode.keywords = { all: strs(c.keywords), new: [], prerequisite: [] };
+        prevNode.scaffolding = { scaffold_candidates: [], core_value_minutes: 0 };
+        prevNode.depth_variants = { ulo: prevNode.estimated_minutes, cio: prevNode.estimated_minutes, sio: prevNode.estimated_minutes };
+        prevNode.depth_scaffold_candidates = [];
+        nodes.push(prevNode);
+        conceptOrder.push(prevNode.id);
+        continue;
+      }
       if (!emittedConcepts.has(cid)) {
         const node = feedNodeFromConcept(c);
         node.phase_id = pid;
@@ -296,6 +394,7 @@ 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.concept_codes = [str(c.code) || cid];
         edges.push({ from: cid, to: revisitId, kind: "knowledge", reason: "advanced revisit of " + cid + " at phase " + pid });
@@ -331,6 +430,17 @@ function emitFromHybrid(hybrid, opts) {
     }
     phaseNodeIds.push(ids);
   }
+  const placed = new Set(phaseNodeIds.flat());
+  const orderedNodes = [];
+  for (const ids of phaseNodeIds) {
+    for (const id of ids) {
+      const n = nodes.find((x) => x.id === id);
+      if (n) orderedNodes.push(n);
+    }
+  }
+  for (const n of nodes) if (!placed.has(n.id)) orderedNodes.push(n);
+  nodes.length = 0;
+  nodes.push(...orderedNodes);
   const edgeSeen = new Set(edges.map((e) => e.from + ">" + e.to));
   const pushEdge = (from, to, reason) => {
     const key = from + ">" + to;
@@ -345,6 +455,14 @@ function emitFromHybrid(hybrid, opts) {
     const firstStep = (stepIdsByFeature.get(fid) || [])[0];
     if (!firstStep) continue;
     const depth = str(l.depth, "cio");
+    const anchorNode = nodes.find((n2) => n2.kind === "concept" && n2.concept_ref === cid && n2.introduce_aspect === "new");
+    const stepNode = nodes.find((n2) => n2.id === firstStep);
+    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)");
+      continue;
+    }
     pushEdge(cid, firstStep, str(l.relationship, "hybrid link") + " [" + depth + "]");
     for (const n of nodes) {
       if (n.kind === "concept" && n.concept_ref === cid && n.introduce_aspect === "advanced" && n.phase_id === str(l.phase_id)) {
@@ -363,6 +481,21 @@ function emitFromHybrid(hybrid, opts) {
     for (const k of n.keywords?.prerequisite ?? []) {
       const src = introducer.get(k.toLowerCase());
       if (!src || src === n.id) continue;
+      const srcNode = nodes.find((x) => x.id === src);
+      const phaseOf = (id) => {
+        const n2 = nodes.find((x) => x.id === id);
+        return n2 ? emitCtx.findIndex((c) => c.id === n2.phase_id) : -1;
+      };
+      const conceptOvertaken = n.kind === "concept" && srcNode?.kind === "product_step";
+      const fromPhase = phaseOf(src);
+      const toPhase = phaseOf(n.id);
+      if (conceptOvertaken || emitCtx.length > 0 && fromPhase > toPhase) {
+        pushWarning(
+          opts,
+          "keyword-order drift: introducer " + src + " sits in a later phase than consumer " + n.id + ' (keyword "' + k + '") \u2014 host should move the introducer earlier'
+        );
+        continue;
+      }
       if (feedOrder.get(src) < feedOrder.get(n.id)) pushEdge(src, n.id, "keyword prerequisite [" + k + "]");
     }
   }
@@ -4136,6 +4269,8 @@ function auditPhasePlan(plan, features, concepts, links, warnings, log) {
   const phases = [];
   const featurePhase = /* @__PURE__ */ new Map();
   const newIntroPhase = /* @__PURE__ */ new Map();
+  const previewsSeen = /* @__PURE__ */ new Set();
+  const previewPhase = /* @__PURE__ */ new Map();
   const errors = [];
   plan.forEach((rp, idx) => {
     const id = String(rp.id || "PH" + (idx + 1));
@@ -4167,7 +4302,22 @@ function auditPhasePlan(plan, features, concepts, links, warnings, log) {
         errors.push("Phase " + id + ": introduces unknown concept " + cid);
         continue;
       }
-      const aspect = String(ri.aspect || "new") === "advanced" ? "advanced" : "new";
+      const rawAspect = String(ri.aspect || "new");
+      const aspect = rawAspect === "advanced" || rawAspect === "preview" ? rawAspect : "new";
+      if (aspect === "preview") {
+        if (newIntroPhase.has(cid)) {
+          errors.push("Phase " + id + ": preview of " + cid + " after its new introduction in phase " + newIntroPhase.get(cid) + " - preview must precede the anchor teach");
+          continue;
+        }
+        if (previewsSeen.has(cid)) {
+          errors.push("Phase " + id + ": duplicate preview of " + cid);
+          continue;
+        }
+        previewsSeen.add(cid);
+        previewPhase.set(cid, order);
+        introductions.push({ concept_id: cid, aspect, note: String(ri.note || "") });
+        continue;
+      }
       if (aspect === "advanced") {
         const first = newIntroPhase.get(cid);
         if (first === void 0) {
@@ -4215,10 +4365,17 @@ function auditPhasePlan(plan, features, concepts, links, warnings, log) {
   }
   for (const [cid, consumerOrder] of firstConsumerPhase) {
     const intro = newIntroPhase.get(cid);
-    if (intro === void 0) {
+    const prev = previewPhase.get(cid);
+    if (intro === void 0 && prev === void 0) {
       errors.push("Concept " + cid + " is consumed from phase " + consumerOrder + " but never introduced in any phase");
-    } else if (intro > consumerOrder) {
-      errors.push("Concept " + cid + " introduced in phase " + intro + " but first consumed in phase " + consumerOrder + " - introduction must come no later than first consumption");
+    } else if (intro !== void 0 && intro > consumerOrder && (prev === void 0 || prev > consumerOrder)) {
+      errors.push("Concept " + cid + " introduced in phase " + intro + " but first consumed in phase " + consumerOrder + " - introduction must come no later than first consumption (or a preview must cover the dependency)");
+    }
+  }
+  for (const [cid, pOrder] of previewPhase) {
+    const anchor = newIntroPhase.get(cid);
+    if (anchor !== void 0 && anchor <= pOrder) {
+      errors.push("Concept " + cid + " previewed in phase " + pOrder + " but fully introduced in phase " + anchor + " - preview must precede the anchor introduction");
     }
   }
   return { phases, errors };
@@ -4234,7 +4391,7 @@ async function decomposePhases(args) {
   const linkList = links.map(
     (l) => "- " + l.feature_id + " -> " + l.concept_id + " (" + l.depth + ")"
   ).join("\n") || "(none)";
-  const systemPrompt = "You decompose a software project build into PROGRESSIVE COMPLETION PHASES for learning purposes.\n\nA phase is NOT a feature and NOT a milestone list: it is a cross-feature slice of the\nproduct whose completion yields a DEMONSTRABLY more complete product. Build up gradually:\nthe product grows feature by feature across phases, and each phase adds its features to\nwhat previous phases already built.\n\nRULES:\n1. Every feature must be assigned to EXACTLY ONE phase (no feature reused, none skipped).\n2. Phases are ordered; later phases depend on earlier ones and yield a more complete product.\n3. product_completion describes concretely what the product can DO once the phase is done.\n4. introduces lists which concepts the phase must teach BEFORE its feature work starts:\n   - aspect new: first time the concept appears in the course\n   - aspect advanced: a concept introduced in an EARLIER phase, revisited here at a\n     higher depth (an advanced aspect of the same concept, e.g. validation rules on top\n     of basic data modeling). Use the note field to say which aspect.\n5. A concept MUST be introduced (new) no later than the first phase that consumes it.\n6. A concept must not be introduced before its own prerequisites are introduced.\n7. Typically 3-6 phases for a small project; keep phases balanced.\n8. Phase 1 usually covers project setup/foundation features plus the first minimal slice.\n9. Return JSON only.";
+  const systemPrompt = 'You decompose a software project build into PROGRESSIVE COMPLETION PHASES for learning purposes.\n\nA phase is NOT a feature and NOT a milestone list: it is a cross-feature slice of the\nproduct whose completion yields a DEMONSTRABLY more complete product. Build up gradually:\nthe product grows feature by feature across phases, and each phase adds its features to\nwhat previous phases already built.\n\nRULES:\n1. Every feature must be assigned to EXACTLY ONE phase (no feature reused, none skipped).\n2. Phases are ordered; later phases depend on earlier ones and yield a more complete product.\n3. product_completion describes concretely what the product can DO once the phase is done.\n4. introduces lists which concepts the phase must teach BEFORE its feature work starts:\n   - aspect new: first time the concept appears in the course\n   - aspect advanced: a concept introduced in an EARLIER phase, revisited here at a\n     higher depth (an advanced aspect of the same concept, e.g. validation rules on top\n     of basic data modeling). Use the note field to say which aspect.\n   - aspect preview: a light awareness pass ("know it exists", ULO depth only, ~5 min)\n     placed in an EARLIER phase when its feature work needs the vocabulary before the\n     full teach. The anchor phase still owns the full new introduction.\n5. A concept MUST be introduced (new) no later than the first phase that consumes it.\n6. A concept must not be introduced before its own prerequisites are introduced.\n7. Typically 3-6 phases for a small project; keep phases balanced.\n8. Phase 1 usually covers project setup/foundation features plus the first minimal slice.\n9. Return JSON only.';
   const baseUserPrompt = "FEATURES:\n" + featureList + "\n\nCONCEPTS:\n" + conceptList + "\n\nFEATURE-CONCEPT LINKS:\n" + linkList + "\n\nReturn JSON with a phases array. Each phase: { id: PH1, name, product_completion, feature_ids: [F0, F1], introduces: [{ concept_id: C1, aspect: new or advanced, note }] }.\n";
   const MAX_DECOMPOSE_ATTEMPTS = 3;
   let auditErrors = [];