wood-fired-tasks 1.12.0

package/dist/schemas/task.schema.js

@@ -0,0 +1,276 @@
+import { z } from 'zod';
+import { TASK_STATUSES, TASK_PRIORITIES } from '../types/task.js';
+/**
+ * Wave 1.4 (task #312): verdict enum for the verification_evidence envelope.
+ *
+ * - PASS         — verifier confirmed the task's acceptance criteria.
+ * - FAIL         — verifier ran the checks and at least one failed.
+ * - PARTIAL      — some checks passed, some failed/skipped.
+ * - NOT_VERIFIED — task closed without verification (auto-materialized by the
+ *                  service layer when status -> done/closed and no evidence
+ *                  was supplied). Explicitly distinct from "evidence absent
+ *                  because the column is NULL" — see service updateTask.
+ */
+export const VERIFICATION_VERDICTS = [
+    'PASS',
+    'FAIL',
+    'PARTIAL',
+    'NOT_VERIFIED',
+];
+/**
+ * Per-check status — tighter than the top-level verdict because a single
+ * check is a leaf (it either ran, or was skipped). Kept narrow on purpose so
+ * the boundary rejects free-form strings ("ok", "good", etc.) and forces
+ * verifier subagents to pick one of the three values.
+ */
+export const VERIFICATION_CHECK_STATUSES = ['PASS', 'FAIL', 'SKIP'];
+/**
+ * Structured verification evidence stored in `tasks.verification_evidence`
+ * as a JSON string (write: JSON.stringify; read: JSON.parse — both happen
+ * inside the repository).
+ *
+ * Only `verdict` is required. Every other field is optional so the
+ * auto-NOT_VERIFIED materialization on close (service-layer behavior — see
+ * task.service.ts updateTask) can emit `{verdict: "NOT_VERIFIED"}` without
+ * lying about a verified_at timestamp or fabricating a session id.
+ *
+ * Bounds:
+ *  - `checks` capped at 50 entries (a single task does not realistically
+ *    accumulate more verification gates than that; the cap bounds row size).
+ *  - `evidence_url_or_text` capped at 2000 chars per entry.
+ *  - identifier strings capped at 200 chars.
+ */
+export const VerificationEvidenceSchema = z.object({
+    verdict: z.enum(VERIFICATION_VERDICTS),
+    checks: z
+        .array(z.object({
+        name: z.string().min(1).max(200),
+        status: z.enum(VERIFICATION_CHECK_STATUSES),
+        evidence_url_or_text: z.string().max(2000),
+    }))
+        .max(50)
+        .optional(),
+    verifier_session_id: z.string().min(1).max(200).optional(),
+    verifier_request_id: z.string().min(1).max(200).optional(),
+    verified_at: z.string().datetime().optional(),
+}).strict();
+/**
+ * CreateTaskSchema - validation for creating new tasks
+ * Note: status is NOT included - new tasks always start as 'open'
+ */
+export const CreateTaskSchema = z.object({
+    title: z.string().min(1, 'Title is required').max(255, 'Title must be 255 characters or less'),
+    description: z.string().max(5000).optional().nullable(),
+    priority: z.enum(TASK_PRIORITIES).default('medium'),
+    project_id: z.number().int().positive('Project ID must be a positive integer'),
+    parent_task_id: z.number().int().positive().optional().nullable(),
+    estimated_minutes: z.number().int().min(0).max(10080).optional().nullable(),
+    assignee: z.string().max(100).optional().nullable(),
+    created_by: z.string().min(1, 'Created by is required').max(100),
+    due_date: z.string().datetime({ message: 'Due date must be ISO8601 format' }).optional().nullable(),
+    tags: z.array(z.string().min(1).max(50)).max(20).optional().default([]),
+    // Wave 1.3 (task #311): free-form plain-text acceptance criteria. Clients
+    // supply this on create to make "what would prove this is done?" structured
+    // rather than buried in the description field. Multi-line markdown is fine.
+    // No DB constraint — the 5000-char cap is a schema-layer business rule.
+    acceptance_criteria: z.string().max(5000).optional().nullable(),
+    // Phase 31 (Plan 31-01): optional FK fields. NOTE — these are server-derived
+    // at route boundaries (T-31-02 of 31-01-PLAN threat register): downstream
+    // plans STRIP body-supplied values and set them from request.user / Slack
+    // lookup / MCP boot. They are accepted here only so service/repository
+    // call sites can pass them through.
+    created_by_user_id: z.number().int().positive().optional().nullable(),
+    assignee_user_id: z.number().int().positive().optional().nullable(),
+});
+/**
+ * Client-facing variant of CreateTaskSchema for MCP tool registration
+ * (Phase 31 review WR-04). Omits the server-derived FK fields
+ * (`created_by_user_id`, `assignee_user_id`) so a client supplying them
+ * gets a clear validation error instead of having the values silently
+ * stripped by the route handler.
+ *
+ * The service-layer `CreateTaskSchema` still accepts them because
+ * internal callers (routes, MCP handlers) populate them from
+ * request.user / boot-time context. This separation makes the public
+ * API surface honest about what fields clients control.
+ */
+export const CreateTaskClientSchema = CreateTaskSchema.omit({
+    created_by_user_id: true,
+    assignee_user_id: true,
+}).strict();
+/**
+ * UpdateTaskSchema - validation for updating tasks
+ * All fields are optional (partial updates)
+ */
+export const UpdateTaskSchema = z.object({
+    title: z.string().min(1).max(255),
+    description: z.string().max(5000).nullable(),
+    status: z.enum(TASK_STATUSES),
+    priority: z.enum(TASK_PRIORITIES),
+    parent_task_id: z.number().int().positive().nullable(),
+    estimated_minutes: z.number().int().min(0).max(10080).nullable(),
+    assignee: z.string().max(100).nullable(),
+    due_date: z.string().datetime().nullable(),
+    tags: z.array(z.string().min(1).max(50)).max(20),
+    // Phase 31 (Plan 31-01): optional FK field. Server-derived at the route
+    // boundary (T-31-02) — downstream plans STRIP body-supplied values.
+    assignee_user_id: z.number().int().positive().nullable(),
+    // Wave 1.3 (task #311): patch acceptance_criteria on existing tasks.
+    // Pass null to clear, a string to set. Same 5000-char cap as create.
+    acceptance_criteria: z.string().max(5000).nullable(),
+    // Wave 1.4 (task #312): structured verification evidence. The Zod enum on
+    // `verdict` rejects unknown values at the boundary (the "unknown verdict =
+    // 400" contract). Pass null to clear, an object to set. Stored as a JSON
+    // string by the repository.
+    verification_evidence: VerificationEvidenceSchema.nullable(),
+}).partial();
+/**
+ * Client-facing variant of UpdateTaskSchema for MCP tool registration
+ * (Phase 31 review WR-04). Omits the server-derived `assignee_user_id`
+ * FK; clients update the FK indirectly by supplying `assignee` (an email
+ * or display name), which the MCP handler resolves server-side via
+ * `resolveAssigneeUserId`.
+ */
+export const UpdateTaskClientSchema = z.object({
+    title: z.string().min(1).max(255),
+    description: z.string().max(5000).nullable(),
+    status: z.enum(TASK_STATUSES),
+    priority: z.enum(TASK_PRIORITIES),
+    parent_task_id: z.number().int().positive().nullable(),
+    estimated_minutes: z.number().int().min(0).max(10080).nullable(),
+    assignee: z.string().max(100).nullable(),
+    due_date: z.string().datetime().nullable(),
+    tags: z.array(z.string().min(1).max(50)).max(20),
+    // Wave 1.3 (task #311): clients can patch acceptance_criteria — it is
+    // NOT server-derived, so it stays on the client-facing schema.
+    acceptance_criteria: z.string().max(5000).nullable(),
+    // Wave 1.4 (task #312): verifier subagents call update_task with this
+    // envelope. It is NOT server-derived, so it stays on the client-facing
+    // schema. Unknown verdicts get rejected at the Zod boundary.
+    verification_evidence: VerificationEvidenceSchema.nullable(),
+}).partial().strict();
+/**
+ * CreateProjectSchema - validation for creating new projects
+ */
+export const CreateProjectSchema = z.object({
+    name: z.string().min(1, 'Name is required').max(100, 'Name must be 100 characters or less'),
+    description: z.string().max(1000).optional().nullable(),
+});
+/**
+ * Pagination bounds applied to all list endpoints.
+ *
+ * `limit`  — page size; capped at 500 to bound query cost (GROUP_CONCAT
+ *            over task_tags scales with row count).
+ * `offset` — starting row, zero-based.
+ *
+ * Both fields default to safe values so existing callers that omit them
+ * receive the first page (50 rows) rather than the full table.
+ */
+export const PaginationSchema = z.object({
+    limit: z.coerce.number().int().positive().max(500).default(50),
+    offset: z.coerce.number().int().nonnegative().default(0),
+});
+/**
+ * Optional pagination — same bounds, but each field can be omitted entirely.
+ * Used inside service-level filter parsing where defaults are applied later.
+ */
+export const PaginationOptionalSchema = z.object({
+    limit: z.coerce.number().int().positive().max(500).optional(),
+    offset: z.coerce.number().int().nonnegative().optional(),
+});
+/**
+ * Wrap a row schema in the standard paginated envelope:
+ *   { data: [...], total, limit, offset }
+ *
+ * `total` is the unbounded count for the same filter set, so clients can
+ * implement page navigation without re-issuing without filters.
+ */
+export function paginatedSchema(itemSchema) {
+    return z.object({
+        data: z.array(itemSchema),
+        total: z.number().int().nonnegative(),
+        limit: z.number().int().positive(),
+        offset: z.number().int().nonnegative(),
+    });
+}
+/**
+ * TaskFiltersSchema - validation for task filtering
+ * All fields are optional. Includes pagination knobs (limit/offset).
+ */
+export const TaskFiltersSchema = z.object({
+    project_id: z.number().int().positive(),
+    status: z.enum(TASK_STATUSES),
+    assignee: z.string(),
+    tags: z.array(z.string()),
+    due_before: z.string().datetime(),
+    due_after: z.string().datetime(),
+    updated_before: z.string().datetime(),
+    updated_after: z.string().datetime(),
+    search: z
+        .string()
+        .min(1)
+        .max(200)
+        .refine((s) => s.trim().split(/\s+/).filter(Boolean).length <= 32, { message: 'Search query must contain at most 32 terms.' }),
+    // Wave 1.4 (#312): verified-state filter. See TaskFilters.verified in
+    // src/types/task.ts for semantics. The repository builds the
+    // json_extract(verification_evidence, '$.verdict') predicate.
+    verified: z.boolean(),
+    limit: z.coerce.number().int().positive().max(500),
+    offset: z.coerce.number().int().nonnegative(),
+}).partial();
+/**
+ * ListTasksMcpSchema - filters plus MCP-only knobs.
+ *
+ * `verbose` opts back into full task bodies (description + audit fields).
+ * Default response is a compact projection to keep MCP tool result payloads
+ * within reasonable token budgets — full data is still available via get_task.
+ */
+export const ListTasksMcpSchema = TaskFiltersSchema.extend({
+    verbose: z.boolean().optional(),
+});
+/**
+ * Strip heavy/audit fields from a task for use in list responses. Keeps the
+ * fields a caller needs to decide whether to drill into a task with get_task.
+ *
+ * `parent_task_id` is optional because the remote REST TaskResponse does not
+ * surface it; in-process Task does. The compact projection includes it when
+ * present so callers can still see hierarchy.
+ */
+export function toCompactTask(task) {
+    return {
+        id: task.id,
+        title: task.title,
+        status: task.status,
+        priority: task.priority,
+        project_id: task.project_id,
+        parent_task_id: task.parent_task_id ?? null,
+        assignee: task.assignee,
+        due_date: task.due_date,
+        tags: task.tags,
+    };
+}
+/**
+ * ClaimTaskSchema - validation for claiming a task
+ */
+export const ClaimTaskSchema = z.object({
+    assignee: z.string().min(1, 'Assignee is required').max(100),
+});
+/**
+ * CompletionReportSchema - validation for `getCompletionReport`.
+ *
+ * Caller supplies EITHER `days` (trailing N days from now, max 365) OR an
+ * explicit `start`/`end` pair (both ISO8601, end >= start). Optional
+ * `project_id` and `assignee` filters narrow the result set.
+ */
+export const CompletionReportSchema = z
+    .object({
+    days: z.number().int().min(1).max(365).optional(),
+    start: z.string().datetime().optional(),
+    end: z.string().datetime().optional(),
+    project_id: z.number().int().positive().optional(),
+    assignee: z.string().min(1).max(100).optional(),
+})
+    .refine((v) => v.days !== undefined || (v.start !== undefined && v.end !== undefined), { message: 'Provide either `days` or both `start` and `end`' })
+    .refine((v) => v.days !== undefined ||
+    (v.start !== undefined && v.end !== undefined && v.end >= v.start), { message: '`end` must be greater than or equal to `start`' });
+//# sourceMappingURL=task.schema.js.map

package/dist/schemas/task.schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"task.schema.js","sourceRoot":"","sources":["../../src/schemas/task.schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG;IACnC,MAAM;IACN,MAAM;IACN,SAAS;IACT,cAAc;CACN,CAAC;AAGX;;;;;GAKG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAU,CAAC;AAI7E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC,MAAM,CAAC;IACjD,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC;IACtC,MAAM,EAAE,CAAC;SACN,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAChC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,2BAA2B,CAAC;QAC3C,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;KAC3C,CAAC,CACH;SACA,GAAG,CAAC,EAAE,CAAC;SACP,QAAQ,EAAE;IACb,mBAAmB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IAC1D,mBAAmB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IAC1D,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;CAC9C,CAAC,CAAC,MAAM,EAAE,CAAC;AAIZ;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,sCAAsC,CAAC;IAC9F,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACvD,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;IACnD,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IAC9E,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACjE,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAC3E,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACnD,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IAChE,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,iCAAiC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACnG,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IACvE,0EAA0E;IAC1E,4EAA4E;IAC5E,4EAA4E;IAC5E,wEAAwE;IACxE,mBAAmB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAC/D,6EAA6E;IAC7E,0EAA0E;IAC1E,0EAA0E;IAC1E,uEAAuE;IACvE,oCAAoC;IACpC,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACrE,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;CACpE,CAAC,CAAC;AAIH;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,gBAAgB,CAAC,IAAI,CAAC;IAC1D,kBAAkB,EAAE,IAAI;IACxB,gBAAgB,EAAE,IAAI;CACvB,CAAC,CAAC,MAAM,EAAE,CAAC;AAIZ;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACjC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IAC5C,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;IAC7B,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC;IACjC,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACtD,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;IAChE,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IACxC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAC1C,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IAChD,wEAAwE;IACxE,oEAAoE;IACpE,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACxD,qEAAqE;IACrE,qEAAqE;IACrE,mBAAmB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IACpD,0EAA0E;IAC1E,2EAA2E;IAC3E,yEAAyE;IACzE,4BAA4B;IAC5B,qBAAqB,EAAE,0BAA0B,CAAC,QAAQ,EAAE;CAC7D,CAAC,CAAC,OAAO,EAAE,CAAC;AAIb;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACjC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IAC5C,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;IAC7B,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC;IACjC,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACtD,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;IAChE,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IACxC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAC1C,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IAChD,sEAAsE;IACtE,+DAA+D;IAC/D,mBAAmB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IACpD,sEAAsE;IACtE,uEAAuE;IACvE,6DAA6D;IAC7D,qBAAqB,EAAE,0BAA0B,CAAC,QAAQ,EAAE;CAC7D,CAAC,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC;AAItB;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,qCAAqC,CAAC;IAC3F,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;CACxD,CAAC,CAAC;AAIH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IAC9D,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;CACzD,CAAC,CAAC;AAIH;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/C,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IAC7D,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,EAAE;CACzD,CAAC,CAAC;AAIH;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAyB,UAAa;IACnE,OAAO,CAAC,CAAC,MAAM,CAAC;QACd,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC;QACzB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;QACrC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;QAClC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;KACvC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IACvC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;IAC7B,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;IACpB,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACzB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACjC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAChC,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACrC,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACpC,MAAM,EAAE,CAAC;SACN,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,GAAG,CAAC;SACR,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,IAAI,EAAE,EACzD,EAAE,OAAO,EAAE,6CAA6C,EAAE,CAC3D;IACH,sEAAsE;IACtE,6DAA6D;IAC7D,8DAA8D;IAC9D,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE;IACrB,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;IAClD,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE;CAC9C,CAAC,CAAC,OAAO,EAAE,CAAC;AAIb;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,MAAM,CAAC;IACzD,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;CAChC,CAAC,CAAC;AAIH;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAU1B,IAAO;IACR,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,cAAc,EAAE,IAAI,CAAC,cAAc,IAAI,IAAI;QAC3C,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IACtC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;CAC7D,CAAC,CAAC;AAIH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC;KACpC,MAAM,CAAC;IACN,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IACjD,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACvC,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACrC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IAClD,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;CAChD,CAAC;KACD,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,EAC7E,EAAE,OAAO,EAAE,iDAAiD,EAAE,CAC/D;KACA,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,SAAS;IACpB,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,EACpE,EAAE,OAAO,EAAE,gDAAgD,EAAE,CAC9D,CAAC"}

package/dist/schemas/topology.schema.d.ts

@@ -0,0 +1,56 @@
+import { z } from 'zod';
+/**
+ * Wave 4.1 (task #318) — Task-topology classifier output contract.
+ *
+ * `TopologyReportSchema` is the wire-shape returned by:
+ *   - `TopologyService.classify(projectId)`
+ *   - the `tasks topology --project <id>` CLI command (stdout JSON)
+ *   - the `topology_check` MCP tool (structuredContent)
+ *
+ * The classifier decides whether a project is `/tasks:loop`-safe (parallelizable
+ * leaves) or requires `/tasks:loop-dag` (wave-by-wave parallel dispatch
+ * respecting dependency edges; Wave 4.3 / task #341) based on whether the
+ * project's `task_dependencies` rows form a flat set, an acyclic DAG, or a
+ * cycle-bearing graph.
+ *
+ * Field semantics:
+ *   - `topology`:
+ *       FLAT        — zero `task_dependencies` edges in the project.
+ *       DAG         — ≥1 edge, no cycles (a total order exists).
+ *       DAG_CYCLIC  — ≥1 edge, contains a cycle (`/tasks:loop` is unsafe).
+ *   - `edges`: `{from, to}` rows where `from` blocks `to` (i.e. `from` must
+ *     complete before `to` can start). Derived from `task_dependencies`
+ *     (`task_id → blocks_task_id`). Sorted by (from asc, to asc) for
+ *     deterministic comparison across runs.
+ *   - `roots`: task IDs with zero in-degree (no task blocks them). Sorted asc.
+ *   - `leaves`: task IDs with zero out-degree (they block nothing). Sorted asc.
+ *   - `advisory`:
+ *       `/tasks:loop`        — recommended for FLAT projects.
+ *       `/tasks:loop-dag`    — recommended for DAG projects (Wave 4.3 / #341).
+ *       `BLOCKED`            — refuse to loop; manual intervention needed for
+ *                              DAG_CYCLIC projects.
+ *
+ * NOTE: `parent_task_id` (the taxonomy column) is INCLUDED in node enumeration
+ * (we know about parent/child rows) but NOT counted as graph edges — per AC
+ * "excluding parent/child taxonomy edges". The only edge source is the
+ * `task_dependencies` table.
+ */
+export declare const TopologyReportSchema: z.ZodObject<{
+    topology: z.ZodEnum<{
+        FLAT: "FLAT";
+        DAG: "DAG";
+        DAG_CYCLIC: "DAG_CYCLIC";
+    }>;
+    edges: z.ZodArray<z.ZodObject<{
+        from: z.ZodNumber;
+        to: z.ZodNumber;
+    }, z.core.$strip>>;
+    roots: z.ZodArray<z.ZodNumber>;
+    leaves: z.ZodArray<z.ZodNumber>;
+    advisory: z.ZodEnum<{
+        "/tasks:loop": "/tasks:loop";
+        "/tasks:loop-dag": "/tasks:loop-dag";
+        BLOCKED: "BLOCKED";
+    }>;
+}, z.core.$strip>;
+export type TopologyReport = z.infer<typeof TopologyReportSchema>;

package/dist/schemas/topology.schema.js

@@ -0,0 +1,48 @@
+import { z } from 'zod';
+/**
+ * Wave 4.1 (task #318) — Task-topology classifier output contract.
+ *
+ * `TopologyReportSchema` is the wire-shape returned by:
+ *   - `TopologyService.classify(projectId)`
+ *   - the `tasks topology --project <id>` CLI command (stdout JSON)
+ *   - the `topology_check` MCP tool (structuredContent)
+ *
+ * The classifier decides whether a project is `/tasks:loop`-safe (parallelizable
+ * leaves) or requires `/tasks:loop-dag` (wave-by-wave parallel dispatch
+ * respecting dependency edges; Wave 4.3 / task #341) based on whether the
+ * project's `task_dependencies` rows form a flat set, an acyclic DAG, or a
+ * cycle-bearing graph.
+ *
+ * Field semantics:
+ *   - `topology`:
+ *       FLAT        — zero `task_dependencies` edges in the project.
+ *       DAG         — ≥1 edge, no cycles (a total order exists).
+ *       DAG_CYCLIC  — ≥1 edge, contains a cycle (`/tasks:loop` is unsafe).
+ *   - `edges`: `{from, to}` rows where `from` blocks `to` (i.e. `from` must
+ *     complete before `to` can start). Derived from `task_dependencies`
+ *     (`task_id → blocks_task_id`). Sorted by (from asc, to asc) for
+ *     deterministic comparison across runs.
+ *   - `roots`: task IDs with zero in-degree (no task blocks them). Sorted asc.
+ *   - `leaves`: task IDs with zero out-degree (they block nothing). Sorted asc.
+ *   - `advisory`:
+ *       `/tasks:loop`        — recommended for FLAT projects.
+ *       `/tasks:loop-dag`    — recommended for DAG projects (Wave 4.3 / #341).
+ *       `BLOCKED`            — refuse to loop; manual intervention needed for
+ *                              DAG_CYCLIC projects.
+ *
+ * NOTE: `parent_task_id` (the taxonomy column) is INCLUDED in node enumeration
+ * (we know about parent/child rows) but NOT counted as graph edges — per AC
+ * "excluding parent/child taxonomy edges". The only edge source is the
+ * `task_dependencies` table.
+ */
+export const TopologyReportSchema = z.object({
+    topology: z.enum(['FLAT', 'DAG', 'DAG_CYCLIC']),
+    edges: z.array(z.object({
+        from: z.number().int().positive(),
+        to: z.number().int().positive(),
+    })),
+    roots: z.array(z.number().int().positive()),
+    leaves: z.array(z.number().int().positive()),
+    advisory: z.enum(['/tasks:loop', '/tasks:loop-dag', 'BLOCKED']),
+});
+//# sourceMappingURL=topology.schema.js.map

package/dist/schemas/topology.schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topology.schema.js","sourceRoot":"","sources":["../../src/schemas/topology.schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IAC/C,KAAK,EAAE,CAAC,CAAC,KAAK,CACZ,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;QACjC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;KAChC,CAAC,CACH;IACD,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;IAC3C,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;IAC5C,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,iBAAiB,EAAE,SAAS,CAAC,CAAC;CAChE,CAAC,CAAC"}

package/dist/services/auth-audit.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Failed-auth audit-log helper.
+ *
+ * Locks the AUDIT-03 contract: the helper signature physically cannot accept
+ * a raw credential. Callers MUST reduce the failure to a categorical
+ * `reasonCode` before invoking, which makes credential-leakage a compile-time
+ * error rather than a runtime convention.
+ *
+ * Used by Phase 28's auth chain (PAT / session / legacy strategies). Defined
+ * here in Phase 27 so the contract is fixed before any caller exists.
+ */
+/** Authentication strategy that produced the failure. */
+export type AuthStrategy = 'pat' | 'session' | 'legacy';
+/**
+ * Categorical reason a credential-bearing request was rejected. The set is
+ * intentionally narrow — anything that does not fit one of these buckets
+ * should be widened here (and in the test fixture) rather than smuggled in
+ * via a free-form string.
+ */
+export type AuthFailureReason = 'missing_credential' | 'malformed' | 'unknown_token' | 'revoked' | 'expired' | 'user_disabled' | 'wrong_prefix';
+/**
+ * Required context for every auth-failure log line. There is NO field for
+ * the supplied credential — this is the discipline the helper enforces.
+ */
+export interface AuthFailureContext {
+    readonly strategy: AuthStrategy;
+    readonly reasonCode: AuthFailureReason;
+    readonly requestId: string;
+    readonly peerIp: string;
+}
+/**
+ * Structural logger contract — compatible with both Fastify's
+ * `FastifyBaseLogger` and a vitest mock. Kept minimal to avoid pulling
+ * Fastify types into the helper's surface.
+ */
+export interface MinimalWarnLogger {
+    warn(obj: object, msg?: string): void;
+}
+/**
+ * Emit exactly one `warn`-level structured log line tagged `auth.failure`.
+ *
+ * The payload is deliberately minimal: `tag`, `strategy`, `reasonCode`,
+ * `requestId`, `peerIp` — nothing else. Aggregators filter on `tag` and
+ * group by `strategy` + `reasonCode`.
+ */
+export declare function logAuthFailure(logger: MinimalWarnLogger, ctx: AuthFailureContext): void;

package/dist/services/auth-audit.js

@@ -0,0 +1,28 @@
+/**
+ * Failed-auth audit-log helper.
+ *
+ * Locks the AUDIT-03 contract: the helper signature physically cannot accept
+ * a raw credential. Callers MUST reduce the failure to a categorical
+ * `reasonCode` before invoking, which makes credential-leakage a compile-time
+ * error rather than a runtime convention.
+ *
+ * Used by Phase 28's auth chain (PAT / session / legacy strategies). Defined
+ * here in Phase 27 so the contract is fixed before any caller exists.
+ */
+/**
+ * Emit exactly one `warn`-level structured log line tagged `auth.failure`.
+ *
+ * The payload is deliberately minimal: `tag`, `strategy`, `reasonCode`,
+ * `requestId`, `peerIp` — nothing else. Aggregators filter on `tag` and
+ * group by `strategy` + `reasonCode`.
+ */
+export function logAuthFailure(logger, ctx) {
+    logger.warn({
+        tag: 'auth.failure',
+        strategy: ctx.strategy,
+        reasonCode: ctx.reasonCode,
+        requestId: ctx.requestId,
+        peerIp: ctx.peerIp,
+    }, 'Authentication failed');
+}
+//# sourceMappingURL=auth-audit.js.map

package/dist/services/auth-audit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"auth-audit.js","sourceRoot":"","sources":["../../src/services/auth-audit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAwCH;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAyB,EACzB,GAAuB;IAEvB,MAAM,CAAC,IAAI,CACT;QACE,GAAG,EAAE,cAAc;QACnB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,MAAM,EAAE,GAAG,CAAC,MAAM;KACnB,EACD,uBAAuB,CACxB,CAAC;AACJ,CAAC"}

package/dist/services/claim-release.service.d.ts

@@ -0,0 +1,42 @@
+import type Database from 'better-sqlite3';
+/**
+ * ClaimReleaseService - auto-releases stale task claims after a configurable timeout.
+ *
+ * Tasks that have been claimed but show no activity (no updated_at changes)
+ * for longer than the timeout are considered stale and are automatically
+ * released back to 'open' status with no assignee.
+ */
+export declare class ClaimReleaseService {
+    private db;
+    private timeoutMinutes;
+    private intervalHandle;
+    constructor(db: Database.Database, timeoutMinutes?: number);
+    /**
+     * Find all claimed tasks with no activity past the timeout.
+     * "No activity" = claimed_at is older than timeoutMinutes AND updated_at is also older.
+     * This way, any update/comment activity resets the clock via updated_at.
+     */
+    findStaleClaims(): Array<{
+        id: number;
+        assignee: string;
+        claimed_at: string;
+    }>;
+    /**
+     * Release a stale claim: set assignee to NULL, status to 'open',
+     * clear claimed_at, increment version.
+     */
+    releaseClaim(taskId: number): boolean;
+    /**
+     * Sweep: find and release all stale claims.
+     * Returns count of released claims.
+     */
+    sweep(): number;
+    /**
+     * Start periodic sweep (default: every 5 minutes).
+     */
+    start(intervalMs?: number): void;
+    /**
+     * Stop periodic sweep.
+     */
+    stop(): void;
+}

package/dist/services/claim-release.service.js

@@ -0,0 +1,90 @@
+import { eventBus } from '../events/event-bus.js';
+/**
+ * ClaimReleaseService - auto-releases stale task claims after a configurable timeout.
+ *
+ * Tasks that have been claimed but show no activity (no updated_at changes)
+ * for longer than the timeout are considered stale and are automatically
+ * released back to 'open' status with no assignee.
+ */
+export class ClaimReleaseService {
+    db;
+    timeoutMinutes;
+    intervalHandle = null;
+    constructor(db, timeoutMinutes = 30) {
+        this.db = db;
+        this.timeoutMinutes = timeoutMinutes;
+    }
+    /**
+     * Find all claimed tasks with no activity past the timeout.
+     * "No activity" = claimed_at is older than timeoutMinutes AND updated_at is also older.
+     * This way, any update/comment activity resets the clock via updated_at.
+     */
+    findStaleClaims() {
+        const cutoff = `-${this.timeoutMinutes} minutes`;
+        return this.db.prepare(`SELECT id, assignee, claimed_at FROM tasks
+       WHERE assignee IS NOT NULL
+         AND claimed_at IS NOT NULL
+         AND status = 'in_progress'
+         AND claimed_at <= datetime('now', ?)
+         AND updated_at <= datetime('now', ?)`).all(cutoff, cutoff);
+    }
+    /**
+     * Release a stale claim: set assignee to NULL, status to 'open',
+     * clear claimed_at, increment version.
+     */
+    releaseClaim(taskId) {
+        const info = this.db.prepare(`UPDATE tasks
+       SET assignee = NULL, status = 'open', claimed_at = NULL,
+           version = version + 1, updated_at = datetime('now')
+       WHERE id = ? AND assignee IS NOT NULL AND status = 'in_progress'`).run(taskId);
+        return info.changes > 0;
+    }
+    /**
+     * Sweep: find and release all stale claims.
+     * Returns count of released claims.
+     */
+    sweep() {
+        const stale = this.findStaleClaims();
+        let released = 0;
+        for (const claim of stale) {
+            if (this.releaseClaim(claim.id)) {
+                // Reload task for event payload
+                const task = this.db.prepare(`SELECT t.*, GROUP_CONCAT(tt.tag, ',') as tags_csv
+           FROM tasks t
+           LEFT JOIN task_tags tt ON tt.task_id = t.id
+           WHERE t.id = ?
+           GROUP BY t.id`).get(claim.id);
+                if (task) {
+                    const { tags_csv, ...taskData } = task;
+                    const tags = tags_csv ? tags_csv.split(',').sort() : [];
+                    eventBus.emit('task.updated', {
+                        eventType: 'task.updated',
+                        timestamp: new Date().toISOString(),
+                        data: { ...taskData, tags },
+                        metadata: { source: 'workflow' }
+                    });
+                }
+                released++;
+            }
+        }
+        return released;
+    }
+    /**
+     * Start periodic sweep (default: every 5 minutes).
+     */
+    start(intervalMs = 5 * 60 * 1000) {
+        if (this.intervalHandle)
+            return;
+        this.intervalHandle = setInterval(() => this.sweep(), intervalMs);
+    }
+    /**
+     * Stop periodic sweep.
+     */
+    stop() {
+        if (this.intervalHandle) {
+            clearInterval(this.intervalHandle);
+            this.intervalHandle = null;
+        }
+    }
+}
+//# sourceMappingURL=claim-release.service.js.map

package/dist/services/claim-release.service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"claim-release.service.js","sourceRoot":"","sources":["../../src/services/claim-release.service.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAGlD;;;;;;GAMG;AACH,MAAM,OAAO,mBAAmB;IAIpB;IACA;IAJF,cAAc,GAA0C,IAAI,CAAC;IAErE,YACU,EAAqB,EACrB,iBAAyB,EAAE;QAD3B,OAAE,GAAF,EAAE,CAAmB;QACrB,mBAAc,GAAd,cAAc,CAAa;IAClC,CAAC;IAEJ;;;;OAIG;IACH,eAAe;QACb,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,UAAU,CAAC;QACjD,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CACpB;;;;;8CAKwC,CACzC,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAgE,CAAC;IACvF,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,MAAc;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC1B;;;wEAGkE,CACnE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACd,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,gCAAgC;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC1B;;;;yBAIe,CAChB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAqD,CAAC;gBACpE,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE,GAAG,IAAI,CAAC;oBACvC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACxD,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE;wBAC5B,SAAS,EAAE,cAAc;wBACzB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;wBACnC,IAAI,EAAE,EAAE,GAAG,QAAQ,EAAE,IAAI,EAAE;wBAC3B,QAAQ,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE;qBACjC,CAAC,CAAC;gBACL,CAAC;gBACD,QAAQ,EAAE,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAqB,CAAC,GAAG,EAAE,GAAG,IAAI;QACtC,IAAI,IAAI,CAAC,cAAc;YAAE,OAAO;QAChC,IAAI,CAAC,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,UAAU,CAAC,CAAC;IACpE,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACnC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC7B,CAAC;IACH,CAAC;CACF"}

package/dist/services/comment.service.d.ts

@@ -0,0 +1,44 @@
+import type { ICommentRepository } from '../repositories/interfaces.js';
+import type { ITaskRepository } from '../repositories/interfaces.js';
+import type { Comment, PaginatedResponse } from '../types/task.js';
+export declare class CommentService {
+    private commentRepo;
+    private taskRepo;
+    constructor(commentRepo: ICommentRepository, taskRepo: ITaskRepository);
+    /**
+     * Add a comment to a task
+     * @throws ValidationError if input is invalid
+     * @throws NotFoundError if task does not exist
+     */
+    addComment(input: unknown): Comment;
+    /**
+     * Get comments for a task in chronological order — current page only.
+     * Internal callers use this; REST/MCP use {@link getCommentsPaginated}.
+     * @throws NotFoundError if task does not exist
+     */
+    getComments(taskId: number, pagination?: {
+        limit?: number;
+        offset?: number;
+    }): Comment[];
+    /**
+     * Paginated get-comments: `{ data, total, limit, offset }`.
+     */
+    getCommentsPaginated(taskId: number, pagination?: {
+        limit?: number;
+        offset?: number;
+    }): PaginatedResponse<Comment>;
+    /**
+     * Delete a comment
+     *
+     * @param id - Comment id to delete.
+     * @param task_id - Optional parent task id. When provided, the comment is
+     *   only deleted if it belongs to this task. This protects the
+     *   `DELETE /tasks/:id/comments/:commentId` route from IDOR — a caller cannot
+     *   delete a comment by guessing its id under an unrelated task. Mismatches
+     *   are reported as NotFoundError to avoid leaking comment existence across
+     *   tasks.
+     * @throws NotFoundError if the comment does not exist, or if `task_id` is
+     *   provided and the comment does not belong to that task.
+     */
+    deleteComment(id: number, task_id?: number): void;
+}