strikethroo 3.7.0 → 3.8.0

package/templates/harness/skills/st-execute-task/scripts/validate-plan-blueprint.cjs

@@ -39,7 +39,7 @@ var path4 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;
@@ -242,6 +242,12 @@ var resolvePlan = (input, startPath = process.cwd()) => {
   return resolveByIdInAncestry(planId, startPath);
 };
 
+// src/skill-scripts/shared/task-file.ts
+var extractFrontmatter = (content) => {
+  const match = content.match(/^---\s*\r?\n([\s\S]*?)\r?\n---/);
+  return match && match[1] ? match[1] : null;
+};
+
 // src/skill-scripts/validate-plan-blueprint.ts
 var VALID_FIELDS = [
   "planFile",
@@ -249,8 +255,47 @@ var VALID_FIELDS = [
   "taskCount",
   "blueprintExists",
   "strikethrooRoot",
-  "planId"
+  "planId",
+  "complexityScoresValid",
+  "invalidComplexityTasks"
 ];
+var validateComplexityScores = (planDir) => {
+  const tasksDir = path4.join(planDir, "tasks");
+  if (!fs4.existsSync(tasksDir)) return [];
+  let files;
+  try {
+    if (!fs4.lstatSync(tasksDir).isDirectory()) return [];
+    files = fs4.readdirSync(tasksDir).filter((f) => f.endsWith(".md")).sort();
+  } catch (_err) {
+    return [];
+  }
+  const invalid = [];
+  for (const file of files) {
+    let content;
+    try {
+      content = fs4.readFileSync(path4.join(tasksDir, file), "utf8");
+    } catch (_err) {
+      invalid.push(`${file}: unreadable`);
+      continue;
+    }
+    const frontmatter = extractFrontmatter(content);
+    const match = frontmatter ? frontmatter.match(/^\s*complexity_score\s*:\s*(.*?)\s*(?:#.*)?$/im) : null;
+    if (!match || match[1] === void 0) {
+      invalid.push(`${file}: missing complexity_score`);
+      continue;
+    }
+    const raw = match[1].trim();
+    if (!/^\d+$/.test(raw)) {
+      invalid.push(`${file}: non-integer complexity_score "${raw}"`);
+      continue;
+    }
+    const parsed = Number.parseInt(raw, 10);
+    if (parsed < 1 || parsed > 10) {
+      invalid.push(`${file}: complexity_score ${parsed} out of range 1-10`);
+    }
+  }
+  return invalid;
+};
 var countTasks = (planDir) => {
   const tasksDir = path4.join(planDir, "tasks");
   if (!fs4.existsSync(tasksDir)) return 0;
@@ -324,13 +369,16 @@ var main = () => {
     }
     process.exit(1);
   }
+  const invalidComplexity = validateComplexityScores(resolved.planDir);
   const result = {
     planFile: resolved.planFile,
     planDir: resolved.planDir,
     strikethrooRoot: resolved.strikethrooRoot,
     planId: resolved.planId,
     taskCount: countTasks(resolved.planDir),
-    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no"
+    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no",
+    complexityScoresValid: invalidComplexity.length === 0 ? "yes" : "no",
+    invalidComplexityTasks: invalidComplexity.join("; ")
   };
   if (fieldName) {
     if (!VALID_FIELDS.includes(fieldName)) {

package/templates/harness/skills/st-full-workflow/SKILL.md

@@ -222,13 +222,48 @@ For each task, identify:
 
 A task B depends on A if B requires A's output or artifacts, modifies code created by A, or tests functionality implemented by A. Validate that the final dependency graph is acyclic.
 
-#### 7. Allocate task IDs
+#### 7. Complexity analysis
+
+For every candidate task, assign a `complexity_score` (integer 1–10) before
+writing any file. Base the score on these four dimensions:
+
+| Score | Skill breadth | Acceptance-criteria clarity | Integration surface | Decomposition depth |
+| --- | --- | --- | --- | --- |
+| 1–3 | One well-known skill | Criteria are concrete and observable | None or a single file/module | No further split possible |
+| 4–5 | One primary skill plus a familiar adjacent skill | Criteria are clear with few edge cases | One component or API boundary | Already atomic |
+| 6–7 | Two distinct skills, or one skill with ambiguous requirements | Criteria need clarification or have multiple edge cases | Multiple components or contracts | Could still be split |
+| 8–10 | Three or more skills, or cross-cutting design decisions | Criteria are vague, unknown, or depend on unresolved choices | Wide integration surface or external systems | Must be decomposed further |
+
+**Pre-emission sanity rules** — apply these before any task is written:
+
+- 3+ skills assigned → split the task into smaller tasks, each with 1–2 skills.
+- Vague acceptance criteria → sharpen them until they include at least one
+  concrete, runnable verification step.
+- Trivially small adjacent tasks → merge them into a single task.
+- Score ≥ 8 → decompose further; do not emit as-is.
+- Score 6–7 → either sharpen criteria or split; do not emit without an
+  explicit reason.
+
+**Required frontmatter:**
+
+- Every emitted task MUST include `complexity_score` (integer 1–10).
+- Optionally include `complexity_notes` when the score needs justification,
+  such as "Ambiguous API contract" or "Decomposed from a higher-score parent".
+
+**Loop-back rule:**
+
+After applying split, sharpen, or merge, re-run dependency analysis and
+re-score the adjusted tasks. Repeat this loop no more than three times. If
+complexity is still unresolved after three passes, stop and surface the
+blocker to the user.
+
+#### 8. Allocate task IDs
 
 Run `scripts/get-next-task-id.cjs <plan-id>` to obtain the first available task ID. Allocate subsequent IDs by incrementing in-process. Use the unpadded integer in the task frontmatter `id` field and the zero-padded form (`{padded-id}--{slug}`) for the filename.
 
 The slug derives from a short task title: lowercase, alphanumeric and hyphens only, collapsed, trimmed.
 
-#### 8. Emit the task files
+#### 9. Emit the task files
 
 Write each task to:
 
@@ -246,11 +281,15 @@ including required frontmatter fields:
 - `created` (YYYY-MM-DD)
 - `skills` (array of 1–2 kebab-case skills)
 
-Optional frontmatter for high-complexity or decomposed tasks:
+Required additional frontmatter:
+
+- `complexity_score` (integer 1–10, required on every emitted task)
+
+Optional frontmatter:
 
-- `complexity_score` (number, 1–10, include only if >4 or for decomposed
-  tasks)
-- `complexity_notes` (string)
+- `complexity_notes` (string) — include when the score needs justification,
+  such as "Decomposed from a cross-cutting parent task" or "Ambiguous API
+  contract".
 
 The body sections (Objective, Skills Required, Acceptance Criteria, Technical
 Requirements, Input Dependencies, Output Artifacts, Implementation Notes)
@@ -258,7 +297,7 @@ must be filled with task-specific content. Place detailed implementation
 guidance inside a `<details>` block under "Implementation Notes" — write it
 so a non-thinking LLM could execute the task from that section alone.
 
-#### 9. Validation checklist
+#### 10. Validation checklist
 
 Before declaring task generation complete, verify:
 
@@ -276,16 +315,23 @@ Before declaring task generation complete, verify:
 - Minimization applied (20–30% reduction target).
 - Test tasks focus on business logic, not framework functionality.
 - No gold-plating: only plan requirements are addressed.
+- After writing the task files, run
+  `scripts/validate-plan-blueprint.cjs <plan-id> complexityScoresValid`. Stop
+  unless it prints `yes`; if it prints `no`, run
+  `scripts/validate-plan-blueprint.cjs <plan-id> invalidComplexityTasks` to see
+  which files are missing, non-integer, or out-of-range, fix them, and re-run.
+  Every generated task must carry an integer `complexity_score` from 1 to 10.
+- Add `complexity_notes` only when a score needs explanation (typically atomic
+  tasks scoring greater than 4).
 
-#### 10. Run the POST_TASK_GENERATION_ALL hook
+#### 11. Run the POST_TASK_GENERATION_ALL hook
 
 Read `<root>/config/hooks/POST_TASK_GENERATION_ALL.md` and follow its instructions. This typically requires:
 
-- Sanity-checking complexity.
 - Appending an Execution Blueprint section to the plan document, including a Mermaid dependency diagram and explicit phase groupings.
 - Use `<root>/config/templates/BLUEPRINT_TEMPLATE.md` for structure.
 
-#### 11. Emit the Phase 2 structured summary
+#### 12. Emit the Phase 2 structured summary
 
 Conclude Phase 2 with exactly this block:
 

package/templates/harness/skills/st-full-workflow/scripts/check-phase-readiness.cjs

@@ -86,7 +86,7 @@ var path3 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-full-workflow/scripts/create-feature-branch.cjs

@@ -54,7 +54,7 @@ var path3 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-full-workflow/scripts/find-strikethroo-root.cjs

@@ -37,7 +37,7 @@ module.exports = __toCommonJS(find_strikethroo_root_exports);
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-full-workflow/scripts/get-next-plan-id.cjs

@@ -37,7 +37,7 @@ module.exports = __toCommonJS(get_next_plan_id_exports);
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-full-workflow/scripts/get-next-task-id.cjs

@@ -41,7 +41,7 @@ var path3 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-full-workflow/scripts/validate-plan-blueprint.cjs

@@ -39,7 +39,7 @@ var path4 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;
@@ -242,6 +242,12 @@ var resolvePlan = (input, startPath = process.cwd()) => {
   return resolveByIdInAncestry(planId, startPath);
 };
 
+// src/skill-scripts/shared/task-file.ts
+var extractFrontmatter = (content) => {
+  const match = content.match(/^---\s*\r?\n([\s\S]*?)\r?\n---/);
+  return match && match[1] ? match[1] : null;
+};
+
 // src/skill-scripts/validate-plan-blueprint.ts
 var VALID_FIELDS = [
   "planFile",
@@ -249,8 +255,47 @@ var VALID_FIELDS = [
   "taskCount",
   "blueprintExists",
   "strikethrooRoot",
-  "planId"
+  "planId",
+  "complexityScoresValid",
+  "invalidComplexityTasks"
 ];
+var validateComplexityScores = (planDir) => {
+  const tasksDir = path4.join(planDir, "tasks");
+  if (!fs4.existsSync(tasksDir)) return [];
+  let files;
+  try {
+    if (!fs4.lstatSync(tasksDir).isDirectory()) return [];
+    files = fs4.readdirSync(tasksDir).filter((f) => f.endsWith(".md")).sort();
+  } catch (_err) {
+    return [];
+  }
+  const invalid = [];
+  for (const file of files) {
+    let content;
+    try {
+      content = fs4.readFileSync(path4.join(tasksDir, file), "utf8");
+    } catch (_err) {
+      invalid.push(`${file}: unreadable`);
+      continue;
+    }
+    const frontmatter = extractFrontmatter(content);
+    const match = frontmatter ? frontmatter.match(/^\s*complexity_score\s*:\s*(.*?)\s*(?:#.*)?$/im) : null;
+    if (!match || match[1] === void 0) {
+      invalid.push(`${file}: missing complexity_score`);
+      continue;
+    }
+    const raw = match[1].trim();
+    if (!/^\d+$/.test(raw)) {
+      invalid.push(`${file}: non-integer complexity_score "${raw}"`);
+      continue;
+    }
+    const parsed = Number.parseInt(raw, 10);
+    if (parsed < 1 || parsed > 10) {
+      invalid.push(`${file}: complexity_score ${parsed} out of range 1-10`);
+    }
+  }
+  return invalid;
+};
 var countTasks = (planDir) => {
   const tasksDir = path4.join(planDir, "tasks");
   if (!fs4.existsSync(tasksDir)) return 0;
@@ -324,13 +369,16 @@ var main = () => {
     }
     process.exit(1);
   }
+  const invalidComplexity = validateComplexityScores(resolved.planDir);
   const result = {
     planFile: resolved.planFile,
     planDir: resolved.planDir,
     strikethrooRoot: resolved.strikethrooRoot,
     planId: resolved.planId,
     taskCount: countTasks(resolved.planDir),
-    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no"
+    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no",
+    complexityScoresValid: invalidComplexity.length === 0 ? "yes" : "no",
+    invalidComplexityTasks: invalidComplexity.join("; ")
   };
   if (fieldName) {
     if (!VALID_FIELDS.includes(fieldName)) {

package/templates/harness/skills/st-generate-tasks/SKILL.md

@@ -160,7 +160,42 @@ A task B depends on A if B requires A's output or artifacts, modifies code
 created by A, or tests functionality implemented by A. Validate that the
 final dependency graph is acyclic.
 
-### 8. Allocate task IDs
+### 8. Complexity analysis
+
+For every candidate task, assign a `complexity_score` (integer 1–10) before
+writing any file. Base the score on these four dimensions:
+
+| Score | Skill breadth | Acceptance-criteria clarity | Integration surface | Decomposition depth |
+| --- | --- | --- | --- | --- |
+| 1–3 | One well-known skill | Criteria are concrete and observable | None or a single file/module | No further split possible |
+| 4–5 | One primary skill plus a familiar adjacent skill | Criteria are clear with few edge cases | One component or API boundary | Already atomic |
+| 6–7 | Two distinct skills, or one skill with ambiguous requirements | Criteria need clarification or have multiple edge cases | Multiple components or contracts | Could still be split |
+| 8–10 | Three or more skills, or cross-cutting design decisions | Criteria are vague, unknown, or depend on unresolved choices | Wide integration surface or external systems | Must be decomposed further |
+
+**Pre-emission sanity rules** — apply these before any task is written:
+
+- 3+ skills assigned → split the task into smaller tasks, each with 1–2 skills.
+- Vague acceptance criteria → sharpen them until they include at least one
+  concrete, runnable verification step.
+- Trivially small adjacent tasks → merge them into a single task.
+- Score ≥ 8 → decompose further; do not emit as-is.
+- Score 6–7 → either sharpen criteria or split; do not emit without an
+  explicit reason.
+
+**Required frontmatter:**
+
+- Every emitted task MUST include `complexity_score` (integer 1–10).
+- Optionally include `complexity_notes` when the score needs justification,
+  such as "Ambiguous API contract" or "Decomposed from a higher-score parent".
+
+**Loop-back rule:**
+
+After applying split, sharpen, or merge, re-run dependency analysis and
+re-score the adjusted tasks. Repeat this loop no more than three times. If
+complexity is still unresolved after three passes, stop and surface the
+blocker to the user.
+
+### 9. Allocate task IDs
 
 Run `scripts/get-next-task-id.cjs <plan-id>` to obtain the first available
 task ID. Allocate subsequent IDs by incrementing in-process; do not invoke
@@ -170,7 +205,7 @@ field and the zero-padded form (`{padded-id}--{slug}`) for the filename.
 The slug derives from a short task title: lowercase, alphanumeric and
 hyphens only, collapsed, trimmed.
 
-### 9. Emit the task files
+### 10. Emit the task files
 
 Write each task to:
 
@@ -188,11 +223,15 @@ including required frontmatter fields:
 - `created` (YYYY-MM-DD)
 - `skills` (array of 1–2 kebab-case skills)
 
-Optional frontmatter for high-complexity or decomposed tasks:
+Required additional frontmatter:
+
+- `complexity_score` (integer 1–10, required on every emitted task)
+
+Optional frontmatter:
 
-- `complexity_score` (number, 1–10, include only if >4 or for decomposed
-  tasks)
-- `complexity_notes` (string)
+- `complexity_notes` (string) — include when the score needs justification,
+  such as "Decomposed from a cross-cutting parent task" or "Ambiguous API
+  contract".
 
 The body sections (Objective, Skills Required, Acceptance Criteria, Technical
 Requirements, Input Dependencies, Output Artifacts, Implementation Notes)
@@ -200,7 +239,7 @@ must be filled with task-specific content. Place detailed implementation
 guidance inside a `<details>` block under "Implementation Notes" — write it
 so a non-thinking LLM could execute the task from that section alone.
 
-### 10. Validation checklist
+### 11. Validation checklist
 
 Before declaring task generation complete, verify:
 
@@ -218,21 +257,27 @@ Before declaring task generation complete, verify:
 - Minimization applied (20–30% reduction target).
 - Test tasks focus on business logic, not framework functionality.
 - No gold-plating: only plan requirements are addressed.
+- After writing the task files, run
+  `scripts/validate-plan-blueprint.cjs <plan-id> complexityScoresValid`. Stop
+  unless it prints `yes`; if it prints `no`, run
+  `scripts/validate-plan-blueprint.cjs <plan-id> invalidComplexityTasks` to see
+  which files are missing, non-integer, or out-of-range, fix them, and re-run.
+  Every generated task must carry an integer `complexity_score` from 1 to 10.
+- Add `complexity_notes` only when a score needs explanation (typically atomic
+  tasks scoring greater than 4).
 
-### 11. Run the POST_TASK_GENERATION_ALL hook
+### 12. Run the POST_TASK_GENERATION_ALL hook
 
 Read `<root>/config/hooks/POST_TASK_GENERATION_ALL.md` and follow its
 instructions. This typically requires:
 
-- Sanity-checking complexity (3+ technologies/skills → split; vague criteria
-  → sharpen; trivially small → merge).
 - Appending an Execution Blueprint section to the plan document, including a
   Mermaid dependency diagram and explicit phase groupings (Phase 1 contains
   zero-dependency tasks; each subsequent phase contains tasks whose
   dependencies all live in earlier phases). Use
   `<root>/config/templates/BLUEPRINT_TEMPLATE.md` for structure.
 
-### 12. Emit the structured summary
+### 13. Emit the structured summary
 
 Conclude with exactly this block as the final output:
 

package/templates/harness/skills/st-generate-tasks/scripts/find-strikethroo-root.cjs

@@ -37,7 +37,7 @@ module.exports = __toCommonJS(find_strikethroo_root_exports);
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-generate-tasks/scripts/get-next-task-id.cjs

@@ -41,7 +41,7 @@ var path3 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-generate-tasks/scripts/validate-plan-blueprint.cjs

@@ -39,7 +39,7 @@ var path4 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;
@@ -242,6 +242,12 @@ var resolvePlan = (input, startPath = process.cwd()) => {
   return resolveByIdInAncestry(planId, startPath);
 };
 
+// src/skill-scripts/shared/task-file.ts
+var extractFrontmatter = (content) => {
+  const match = content.match(/^---\s*\r?\n([\s\S]*?)\r?\n---/);
+  return match && match[1] ? match[1] : null;
+};
+
 // src/skill-scripts/validate-plan-blueprint.ts
 var VALID_FIELDS = [
   "planFile",
@@ -249,8 +255,47 @@ var VALID_FIELDS = [
   "taskCount",
   "blueprintExists",
   "strikethrooRoot",
-  "planId"
+  "planId",
+  "complexityScoresValid",
+  "invalidComplexityTasks"
 ];
+var validateComplexityScores = (planDir) => {
+  const tasksDir = path4.join(planDir, "tasks");
+  if (!fs4.existsSync(tasksDir)) return [];
+  let files;
+  try {
+    if (!fs4.lstatSync(tasksDir).isDirectory()) return [];
+    files = fs4.readdirSync(tasksDir).filter((f) => f.endsWith(".md")).sort();
+  } catch (_err) {
+    return [];
+  }
+  const invalid = [];
+  for (const file of files) {
+    let content;
+    try {
+      content = fs4.readFileSync(path4.join(tasksDir, file), "utf8");
+    } catch (_err) {
+      invalid.push(`${file}: unreadable`);
+      continue;
+    }
+    const frontmatter = extractFrontmatter(content);
+    const match = frontmatter ? frontmatter.match(/^\s*complexity_score\s*:\s*(.*?)\s*(?:#.*)?$/im) : null;
+    if (!match || match[1] === void 0) {
+      invalid.push(`${file}: missing complexity_score`);
+      continue;
+    }
+    const raw = match[1].trim();
+    if (!/^\d+$/.test(raw)) {
+      invalid.push(`${file}: non-integer complexity_score "${raw}"`);
+      continue;
+    }
+    const parsed = Number.parseInt(raw, 10);
+    if (parsed < 1 || parsed > 10) {
+      invalid.push(`${file}: complexity_score ${parsed} out of range 1-10`);
+    }
+  }
+  return invalid;
+};
 var countTasks = (planDir) => {
   const tasksDir = path4.join(planDir, "tasks");
   if (!fs4.existsSync(tasksDir)) return 0;
@@ -324,13 +369,16 @@ var main = () => {
     }
     process.exit(1);
   }
+  const invalidComplexity = validateComplexityScores(resolved.planDir);
   const result = {
     planFile: resolved.planFile,
     planDir: resolved.planDir,
     strikethrooRoot: resolved.strikethrooRoot,
     planId: resolved.planId,
     taskCount: countTasks(resolved.planDir),
-    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no"
+    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no",
+    complexityScoresValid: invalidComplexity.length === 0 ? "yes" : "no",
+    invalidComplexityTasks: invalidComplexity.join("; ")
   };
   if (fieldName) {
     if (!VALID_FIELDS.includes(fieldName)) {

package/templates/harness/skills/st-refine-plan/scripts/find-strikethroo-root.cjs

@@ -37,7 +37,7 @@ module.exports = __toCommonJS(find_strikethroo_root_exports);
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;

package/templates/harness/skills/st-refine-plan/scripts/validate-plan-blueprint.cjs

@@ -39,7 +39,7 @@ var path4 = __toESM(require("path"));
 // src/skill-scripts/shared/root.ts
 var fs = __toESM(require("fs"));
 var path = __toESM(require("path"));
-var EXPECTED_SCHEMA = true ? 2 : 2;
+var EXPECTED_SCHEMA = true ? 3 : 3;
 var isValidStrikethrooRoot = (strikethrooPath) => {
   try {
     if (!fs.existsSync(strikethrooPath)) return false;
@@ -242,6 +242,12 @@ var resolvePlan = (input, startPath = process.cwd()) => {
   return resolveByIdInAncestry(planId, startPath);
 };
 
+// src/skill-scripts/shared/task-file.ts
+var extractFrontmatter = (content) => {
+  const match = content.match(/^---\s*\r?\n([\s\S]*?)\r?\n---/);
+  return match && match[1] ? match[1] : null;
+};
+
 // src/skill-scripts/validate-plan-blueprint.ts
 var VALID_FIELDS = [
   "planFile",
@@ -249,8 +255,47 @@ var VALID_FIELDS = [
   "taskCount",
   "blueprintExists",
   "strikethrooRoot",
-  "planId"
+  "planId",
+  "complexityScoresValid",
+  "invalidComplexityTasks"
 ];
+var validateComplexityScores = (planDir) => {
+  const tasksDir = path4.join(planDir, "tasks");
+  if (!fs4.existsSync(tasksDir)) return [];
+  let files;
+  try {
+    if (!fs4.lstatSync(tasksDir).isDirectory()) return [];
+    files = fs4.readdirSync(tasksDir).filter((f) => f.endsWith(".md")).sort();
+  } catch (_err) {
+    return [];
+  }
+  const invalid = [];
+  for (const file of files) {
+    let content;
+    try {
+      content = fs4.readFileSync(path4.join(tasksDir, file), "utf8");
+    } catch (_err) {
+      invalid.push(`${file}: unreadable`);
+      continue;
+    }
+    const frontmatter = extractFrontmatter(content);
+    const match = frontmatter ? frontmatter.match(/^\s*complexity_score\s*:\s*(.*?)\s*(?:#.*)?$/im) : null;
+    if (!match || match[1] === void 0) {
+      invalid.push(`${file}: missing complexity_score`);
+      continue;
+    }
+    const raw = match[1].trim();
+    if (!/^\d+$/.test(raw)) {
+      invalid.push(`${file}: non-integer complexity_score "${raw}"`);
+      continue;
+    }
+    const parsed = Number.parseInt(raw, 10);
+    if (parsed < 1 || parsed > 10) {
+      invalid.push(`${file}: complexity_score ${parsed} out of range 1-10`);
+    }
+  }
+  return invalid;
+};
 var countTasks = (planDir) => {
   const tasksDir = path4.join(planDir, "tasks");
   if (!fs4.existsSync(tasksDir)) return 0;
@@ -324,13 +369,16 @@ var main = () => {
     }
     process.exit(1);
   }
+  const invalidComplexity = validateComplexityScores(resolved.planDir);
   const result = {
     planFile: resolved.planFile,
     planDir: resolved.planDir,
     strikethrooRoot: resolved.strikethrooRoot,
     planId: resolved.planId,
     taskCount: countTasks(resolved.planDir),
-    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no"
+    blueprintExists: checkBlueprintExists(resolved.planFile) ? "yes" : "no",
+    complexityScoresValid: invalidComplexity.length === 0 ? "yes" : "no",
+    invalidComplexityTasks: invalidComplexity.join("; ")
   };
   if (fieldName) {
     if (!VALID_FIELDS.includes(fieldName)) {

package/templates/strikethroo/README.md

@@ -4,4 +4,4 @@ This directory contains AI-assisted task management files for this project.
 
 Managed by the [Strikethroo](https://www.github.com/e0ipso/strikethroo) project.
 
-**Documentation**: https://mateuaguilo.com/strikethroo
+**Documentation**: https://strikethroo.canpicasoft.com