libero3 0.3.0

package/dist/mcp/src/stickiness/report.js

@@ -0,0 +1,174 @@
+/** 「真实动作」日：reward 行 或 completed timeblock（COALESCE(updated_at, created_at) 取日）。 */
+export function activeDaysByUser(db, from, to) {
+    const out = new Map();
+    const add = (user, day) => {
+        let s = out.get(user);
+        if (!s) {
+            s = new Set();
+            out.set(user, s);
+        }
+        s.add(day);
+    };
+    const rewards = db
+        .prepare("SELECT user_id, substr(created_at,1,10) AS d FROM ap_reward_log WHERE created_at >= ? AND created_at < ?")
+        .all(from, to);
+    for (const r of rewards)
+        add(r.user_id, r.d);
+    const blocks = db
+        .prepare(`SELECT user_id, substr(COALESCE(updated_at, created_at),1,10) AS d
+       FROM time_blocks
+       WHERE status='completed' AND deleted_at IS NULL
+         AND COALESCE(updated_at, created_at) >= ? AND COALESCE(updated_at, created_at) < ?`)
+        .all(from, to);
+    for (const r of blocks)
+        add(r.user_id, r.d);
+    return out;
+}
+/** UTC 日期字符串加减 n 天（yyyy-mm-dd → yyyy-mm-dd） */
+export function addUtcDays(day, n) {
+    const t = Date.parse(`${day}T00:00:00.000Z`);
+    return new Date(t + n * 86_400_000).toISOString().slice(0, 10);
+}
+/** 每用户「真实动作」时间戳（ms，升序）：reward 行 UNION completed timeblock。 */
+export function activityTimestamps(db, from, to) {
+    const out = new Map();
+    const push = (user, at) => {
+        const t = Date.parse(at);
+        if (Number.isNaN(t))
+            return;
+        const arr = out.get(user) ?? [];
+        arr.push(t);
+        out.set(user, arr);
+    };
+    const rewards = db
+        .prepare("SELECT user_id, created_at FROM ap_reward_log WHERE created_at >= ? AND created_at < ?")
+        .all(from, to);
+    for (const r of rewards)
+        push(r.user_id, r.created_at);
+    const blocks = db
+        .prepare(`SELECT user_id, COALESCE(updated_at, created_at) AS at FROM time_blocks
+       WHERE status='completed' AND deleted_at IS NULL
+         AND COALESCE(updated_at, created_at) >= ? AND COALESCE(updated_at, created_at) < ?`)
+        .all(from, to);
+    for (const r of blocks)
+        push(r.user_id, r.at);
+    for (const arr of out.values())
+        arr.sort((x, y) => x - y);
+    return out;
+}
+/** trigger 事件（reward/spend/balance_view）后 24h 内是否有真实动作；分母为空 → null */
+function pullRateAfter(triggers, activity) {
+    if (triggers.length === 0)
+        return null;
+    let hit = 0;
+    for (const tr of triggers) {
+        const ts = activity.get(tr.user_id);
+        if (!ts)
+            continue;
+        // 找是否存在 t 满足 trigger < t <= trigger+24h（ts 升序，线性找第一个 > trigger 即可）
+        for (const t of ts) {
+            if (t > tr.at) {
+                if (t - tr.at <= 86_400_000)
+                    hit++;
+                break;
+            }
+        }
+    }
+    return hit / triggers.length;
+}
+/** Pearson 相关；样本 <3 或方差 0 → null */
+function pearson(xs, ys) {
+    const n = xs.length;
+    if (n < 3)
+        return null;
+    const mx = xs.reduce((a, b) => a + b, 0) / n;
+    const my = ys.reduce((a, b) => a + b, 0) / n;
+    let cov = 0;
+    let vx = 0;
+    let vy = 0;
+    for (let i = 0; i < n; i++) {
+        const dx = xs[i] - mx;
+        const dy = ys[i] - my;
+        cov += dx * dy;
+        vx += dx * dx;
+        vy += dy * dy;
+    }
+    if (vx === 0 || vy === 0)
+        return null;
+    return cov / Math.sqrt(vx * vy);
+}
+export function buildStickinessReport(db, window) {
+    const { fromIso: from, toIso: to } = window;
+    const daysByUser = activeDaysByUser(db, from, to);
+    const users = daysByUser.size;
+    // D1/D3/D7 cohort 留存：以首次真实动作日为 day0，day0+n 是否仍活跃。
+    // 分母=有 day0 且 day0+n 仍在窗口 to 之前的用户（观察窗够长）。
+    const toDay = to.slice(0, 10);
+    const retentionDays = [1, 3, 7];
+    const cohortSizes = { d1: 0, d3: 0, d7: 0 };
+    const hitCounts = { d1: 0, d3: 0, d7: 0 };
+    for (const days of daysByUser.values()) {
+        const first = [...days].sort()[0];
+        for (const n of retentionDays) {
+            const target = addUtcDays(first, n);
+            if (target >= toDay)
+                continue; // 观察窗不够长，不进分母
+            cohortSizes[`d${n}`]++;
+            if (days.has(target))
+                hitCounts[`d${n}`]++;
+        }
+    }
+    const rate = (n) => cohortSizes[`d${n}`] === 0 ? null : hitCounts[`d${n}`] / cohortSizes[`d${n}`];
+    // 7 日内 ≥3 天有动作占比：活跃天数 ≥3 的用户 / 活跃天数 ≥1 的用户
+    let active3plus = 0;
+    for (const days of daysByUser.values())
+        if (days.size >= 3)
+            active3plus++;
+    const active_3plus_share = users === 0 ? null : active3plus / users;
+    // 游戏拉动：回流 / 出击后动作 / 看余额后动作（个体前后，无对照组）
+    const activity = activityTimestamps(db, from, to);
+    const parseTs = (rows) => rows
+        .map((r) => ({ user_id: r.user_id, at: Date.parse(r.at) }))
+        .filter((r) => !Number.isNaN(r.at));
+    const rewardTriggers = parseTs(db
+        .prepare("SELECT user_id, created_at AS at FROM ap_reward_log WHERE created_at >= ? AND created_at < ?")
+        .all(from, to));
+    const spendTriggers = parseTs(db
+        .prepare("SELECT user_id, created_at AS at FROM ap_spend_log WHERE created_at >= ? AND created_at < ?")
+        .all(from, to));
+    const viewTriggers = parseTs(db
+        .prepare("SELECT user_id, created_at AS at FROM ap_balance_view_log WHERE created_at >= ? AND created_at < ?")
+        .all(from, to));
+    // 个体相关：每用户 reward_count vs spend_count（样本 ≥3 用户才算）
+    const rewardCountByUser = new Map();
+    for (const t of rewardTriggers)
+        rewardCountByUser.set(t.user_id, (rewardCountByUser.get(t.user_id) ?? 0) + 1);
+    const spendCountByUser = new Map();
+    for (const t of spendTriggers)
+        spendCountByUser.set(t.user_id, (spendCountByUser.get(t.user_id) ?? 0) + 1);
+    const userIds = new Set([...rewardCountByUser.keys(), ...spendCountByUser.keys()]);
+    const xs = [];
+    const ys = [];
+    for (const u of userIds) {
+        xs.push(rewardCountByUser.get(u) ?? 0);
+        ys.push(spendCountByUser.get(u) ?? 0);
+    }
+    const correlation_reward_vs_spend = pearson(xs, ys);
+    return {
+        window: { from, to },
+        users,
+        retention: {
+            d1: rate(1),
+            d3: rate(3),
+            d7: rate(7),
+            cohort_sizes: cohortSizes,
+        },
+        active_3plus_share,
+        pull: {
+            after_reward_24h: pullRateAfter(rewardTriggers, activity),
+            after_spend_24h: pullRateAfter(spendTriggers, activity),
+            after_balance_view_24h: pullRateAfter(viewTriggers, activity),
+        },
+        correlation_reward_vs_spend,
+    };
+}

package/dist/mcp/src/stickiness/types.js

@@ -0,0 +1 @@
+export {};

package/dist/mcp/src/task/index.js

@@ -0,0 +1,412 @@
+import { assertProfileConfirmed, } from "../profile-confirm.js";
+import { lookupTargetUserLabel } from "../profile-helpers.js";
+// ── Status machine ──
+const VALID_TRANSITIONS = {
+    draft: ["aligned", "executing", "abandoned"],
+    aligned: ["executing", "abandoned"],
+    executing: ["done", "abandoned"],
+    done: [],
+    abandoned: [],
+};
+function isValidTransition(from, to) {
+    return VALID_TRANSITIONS[from]?.includes(to) ?? false;
+}
+// ── Helpers ──
+function nowStr() {
+    // High-resolution timestamp — mirrors sqlite.ts line 173-178.
+    // Appends performance.now() micro-digits so consecutive calls within the
+    // same millisecond still produce distinct strings.
+    return (new Date().toISOString().replace("T", " ").replace("Z", "") +
+        String(Math.floor(performance.now() * 100000) % 100000).padStart(5, "0"));
+}
+// S46: difficulty/priority 归一化（不合法值 → medium）
+function normalizeDiff(v) {
+    return v === "easy" || v === "medium" || v === "hard" ? v : "medium";
+}
+function normalizePrio(v) {
+    return v === "high" || v === "medium" || v === "low" ? v : "medium";
+}
+function rowToTask(row) {
+    return {
+        id: row.id,
+        user_id: row.user_id,
+        parent_id: row.parent_id ?? null,
+        title: row.title,
+        status: row.status,
+        est_minutes: row.est_minutes ?? null,
+        category_id: row.category_id ?? null,
+        linked_timeblock_id: row.linked_timeblock_id ?? null,
+        order_index: row.order_index ?? 0,
+        // S46: difficulty/priority（migration 014 加的列；旧库未 migrate 时回退 medium）
+        difficulty: row.difficulty ?? "medium",
+        priority: row.priority ?? "medium",
+        created_at: row.created_at,
+        updated_at: row.updated_at,
+        deleted_at: row.deleted_at ?? null,
+    };
+}
+// ── Factory ──
+export function createTaskTools(db) {
+    // -- Draft plan store（进程内 in-memory；per-MCP-process）--
+    // draftPlan 写这里，commitPlan 读 + 删。进程重启会丢——可接受：
+    // draft 本就是临时方案，用户重提即可。
+    const draftPlans = new Map();
+    // -- Decompose.split plan store（S33 v3，同型 per-MCP-process Map）--
+    // decompose.split 第一次调用写入，第二次（confirm_token）读 + 删。
+    const decomposePlans = new Map();
+    // -- Internal helpers --
+    function getTaskRow(id) {
+        return db
+            .prepare("SELECT * FROM tasks WHERE id = ? AND deleted_at IS NULL")
+            .get(id);
+    }
+    function buildSubtree(parentId) {
+        const rows = db
+            .prepare("SELECT * FROM tasks WHERE parent_id = ? AND deleted_at IS NULL ORDER BY order_index, created_at")
+            .all(parentId);
+        return rows.map((row) => {
+            const task = rowToTask(row);
+            return {
+                ...task,
+                children: buildSubtree(task.id),
+            };
+        });
+    }
+    return {
+        async createTask(input) {
+            // Validate title
+            if (!input.title || input.title.trim() === "") {
+                throw new Error("任务名不能为空");
+            }
+            const userId = input.target_user_id ?? input.user_id;
+            const gate = assertProfileConfirmed(db, userId);
+            if (gate)
+                return gate;
+            // Validate parent exists (if provided)
+            if (input.parent_id !== undefined) {
+                const parent = getTaskRow(input.parent_id);
+                if (!parent) {
+                    throw new Error("父任务不存在");
+                }
+            }
+            const id = crypto.randomUUID();
+            const now = nowStr();
+            // S46: difficulty/priority 默认 medium，校验入参合法值
+            const difficulty = normalizeDiff(input.difficulty);
+            const priority = normalizePrio(input.priority);
+            // S46 fix: 同 parent 下 order_index 单调递增（避免 created_at 精度问题导致排序 flaky）
+            const parentFilter = input.parent_id ? "AND parent_id = ?" : "AND parent_id IS NULL";
+            const parentParams = input.parent_id ? [input.parent_id] : [];
+            const maxOrderRow = db
+                .prepare(`SELECT COALESCE(MAX(order_index), -1) as max_idx FROM tasks WHERE user_id = ? ${parentFilter} AND deleted_at IS NULL`)
+                .get(userId, ...parentParams);
+            const orderIndex = maxOrderRow.max_idx + 1;
+            db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+         VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, ?, ?, ?, ?, NULL)`).run(id, userId, input.parent_id ?? null, input.title, input.est_minutes ?? null, orderIndex, difficulty, priority, now, now);
+            const row = getTaskRow(id);
+            return {
+                ...rowToTask(row),
+                target_user_label: lookupTargetUserLabel(db, userId),
+            };
+        },
+        async getTask(id) {
+            const row = getTaskRow(id);
+            if (!row)
+                return null;
+            const task = rowToTask(row);
+            return {
+                ...task,
+                children: buildSubtree(task.id),
+            };
+        },
+        async listTasks(filters) {
+            const userId = filters.target_user_id ?? filters.user_id;
+            let sql = "SELECT * FROM tasks WHERE user_id = ? AND deleted_at IS NULL";
+            const params = [userId];
+            if (filters.parent_id === null) {
+                sql += " AND parent_id IS NULL";
+            }
+            else if (filters.parent_id !== undefined) {
+                sql += " AND parent_id = ?";
+                params.push(filters.parent_id);
+            }
+            sql += " ORDER BY order_index, created_at";
+            const rows = db.prepare(sql).all(...params);
+            return rows.map(rowToTask);
+        },
+        async updateTask(id, patch) {
+            // Check existence (exclude soft-deleted)
+            const existing = getTaskRow(id);
+            if (!existing) {
+                throw new Error("任务不存在");
+            }
+            // Status transition validation
+            if (patch.status !== undefined) {
+                const currentStatus = existing.status;
+                if (!isValidTransition(currentStatus, patch.status)) {
+                    throw new Error("非法状态流转");
+                }
+            }
+            // Build SET clauses
+            const sets = [];
+            const params = [];
+            if (patch.title !== undefined) {
+                sets.push("title = ?");
+                params.push(patch.title);
+            }
+            if (patch.est_minutes !== undefined) {
+                sets.push("est_minutes = ?");
+                params.push(patch.est_minutes);
+            }
+            if (patch.status !== undefined) {
+                sets.push("status = ?");
+                params.push(patch.status);
+            }
+            // S46: difficulty/priority 可独立更新
+            if (patch.difficulty !== undefined) {
+                sets.push("difficulty = ?");
+                params.push(normalizeDiff(patch.difficulty));
+            }
+            if (patch.priority !== undefined) {
+                sets.push("priority = ?");
+                params.push(normalizePrio(patch.priority));
+            }
+            // Always refresh updated_at
+            sets.push("updated_at = ?");
+            params.push(nowStr());
+            params.push(id);
+            db.prepare(`UPDATE tasks SET ${sets.join(", ")} WHERE id = ?`).run(...params);
+            const row = getTaskRow(id);
+            return rowToTask(row);
+        },
+        async linkTimeblock(taskId, blockId) {
+            // Check task exists (exclude soft-deleted)
+            const task = getTaskRow(taskId);
+            if (!task) {
+                throw new Error("任务不存在");
+            }
+            // Check time_block exists
+            const block = db
+                .prepare("SELECT id FROM time_blocks WHERE id = ?")
+                .get(blockId);
+            if (!block) {
+                throw new Error("时间块不存在");
+            }
+            const now = nowStr();
+            db.prepare("UPDATE tasks SET linked_timeblock_id = ?, updated_at = ? WHERE id = ?").run(blockId, now, taskId);
+            const row = getTaskRow(taskId);
+            return rowToTask(row);
+        },
+        /** S46: 仅更新 difficulty/priority（用户主动调整） */
+        async updateDifficulty(taskId, patch) {
+            const existing = getTaskRow(taskId);
+            if (!existing) {
+                throw new Error("任务不存在");
+            }
+            if (patch.difficulty === undefined && patch.priority === undefined) {
+                throw new Error("至少传一个字段 difficulty 或 priority");
+            }
+            const sets = [];
+            const params = [];
+            if (patch.difficulty !== undefined) {
+                sets.push("difficulty = ?");
+                params.push(normalizeDiff(patch.difficulty));
+            }
+            if (patch.priority !== undefined) {
+                sets.push("priority = ?");
+                params.push(normalizePrio(patch.priority));
+            }
+            sets.push("updated_at = ?");
+            params.push(nowStr());
+            params.push(taskId);
+            db.prepare(`UPDATE tasks SET ${sets.join(", ")} WHERE id = ?`).run(...params);
+            const row = getTaskRow(taskId);
+            return rowToTask(row);
+        },
+        async findPlan(input) {
+            // exact-match a startable root task (aligned/executing) by title
+            const rootRow = db
+                .prepare("SELECT * FROM tasks WHERE user_id = ? AND parent_id IS NULL AND title = ? AND status IN ('aligned','executing') AND deleted_at IS NULL LIMIT 1")
+                .get(input.user_id, input.title);
+            if (!rootRow)
+                return null;
+            // first undone subtask (skip done/abandoned)
+            const subRow = db
+                .prepare("SELECT * FROM tasks WHERE parent_id = ? AND status NOT IN ('done','abandoned') AND deleted_at IS NULL ORDER BY order_index, created_at LIMIT 1")
+                .get(rootRow.id);
+            if (!subRow)
+                return null;
+            return { root: rowToTask(rootRow), nextSubtask: rowToTask(subRow) };
+        },
+        // ── 拆解"先对齐再落地"契约（事一 / task-split-align-before-commit）──
+        // draftPlan 出方案不写 DB；commitPlan 用户确认后原子写根(aligned)+子(draft)。
+        // 现有 createTask 不动（向后兼容）；decompose SKILL 第四步改走 draft→STOP→commit。
+        async draftPlan(input) {
+            if (!input.root_title || input.root_title.trim() === "") {
+                throw new Error("根任务名不能为空");
+            }
+            const user = db
+                .prepare("SELECT id FROM user_profile WHERE id = ?")
+                .get(input.user_id);
+            if (!user) {
+                throw new Error("用户不存在");
+            }
+            if (!input.children || input.children.length === 0) {
+                throw new Error("子任务不能为空");
+            }
+            for (const c of input.children) {
+                if (!c.title || c.title.trim() === "") {
+                    throw new Error("子任务名不能为空");
+                }
+            }
+            const plan_id = crypto.randomUUID();
+            const plan = {
+                plan_id,
+                user_id: input.user_id,
+                root_title: input.root_title,
+                children: input.children.map((c) => ({
+                    title: c.title,
+                    est_minutes: c.est_minutes ?? null,
+                })),
+                created_at: nowStr(),
+            };
+            draftPlans.set(plan_id, plan);
+            const totalMin = plan.children.reduce((s, c) => s + (c.est_minutes ?? 0), 0);
+            const lines = plan.children.map((c, i) => `${i + 1}. ${c.title}${c.est_minutes ? ` — ${c.est_minutes} 分钟` : ""}`);
+            const summary = `📝 待确认方案：「${plan.root_title}」（${plan.children.length} 个子任务` +
+                `${totalMin ? `，共 ${totalMin} 分钟` : ""}）\n` +
+                `${lines.join("\n")}\n\n请确认，或告诉我怎么调整。`;
+            return {
+                plan_id,
+                root_title: plan.root_title,
+                children: plan.children,
+                summary,
+            };
+        },
+        async commitPlan(input) {
+            const plan = draftPlans.get(input.plan_id);
+            if (!plan) {
+                throw new Error("方案不存在或已落地（plan_id 无效）");
+            }
+            if (plan.user_id !== input.user_id) {
+                throw new Error("方案不属于该用户");
+            }
+            // 原子写：根(aligned = 已确认) + N 子(draft = 待开工)，单个事务包裹，
+            // 要么全落要么全不落。
+            const result = db.transaction(() => {
+                const rootId = crypto.randomUUID();
+                const now = nowStr();
+                db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+           VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, NULL, 0, 'medium', 'medium', ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, now, now);
+                const children = plan.children.map((c, i) => {
+                    const childId = crypto.randomUUID();
+                    const cnow = nowStr();
+                    db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+             VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, 'medium', 'medium', ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
+                    return rowToTask(getTaskRow(childId));
+                });
+                return { root: rowToTask(getTaskRow(rootId)), children };
+            })();
+            // 一次性：已确认的方案不能重复提交。
+            draftPlans.delete(input.plan_id);
+            return result;
+        },
+        // ── S33 v3：decompose.split —— 拆解唯一入口 ──
+        // 状态机：第一次（无 confirm_token）出方案不写库；第二次（带 confirm_token）原子写
+        // root(aligned, 挂 timeblock) + children(draft, 挂 root)。
+        // 错误用 DecomposeErrorResult 返回（不 throw），让 MCP 层包 isError content——避 hermes 熔断。
+        async splitDecompose(input) {
+            // 通用校验：user 必须存在
+            const user = db
+                .prepare("SELECT id FROM user_profile WHERE id = ?")
+                .get(input.user_id);
+            if (!user) {
+                return { ok: false, error: "用户不存在" };
+            }
+            // 校验 children（zod 已 min(1)，但这里也兜底）
+            if (!input.children || input.children.length === 0) {
+                return { ok: false, error: "子任务不能为空" };
+            }
+            for (const c of input.children) {
+                if (!c.title || c.title.trim() === "") {
+                    return { ok: false, error: "子任务名不能为空" };
+                }
+            }
+            // 校验 timeblock 存在 + 派生 root_title
+            const tb = db
+                .prepare("SELECT id, user_id, title FROM time_blocks WHERE id = ? AND deleted_at IS NULL")
+                .get(input.timeblock_id);
+            if (!tb) {
+                return { ok: false, error: "时间块不存在" };
+            }
+            const rootTitle = tb.title;
+            // ── 分支 A：第一次调用（无 confirm_token）→ 出方案不写库 ──
+            if (!input.confirm_token) {
+                const plan_id = crypto.randomUUID();
+                const plan = {
+                    plan_id,
+                    user_id: input.user_id,
+                    timeblock_id: input.timeblock_id,
+                    root_title: rootTitle,
+                    children: input.children.map((c) => ({
+                        title: c.title,
+                        est_minutes: c.est_minutes ?? null,
+                    })),
+                    created_at: nowStr(),
+                };
+                decomposePlans.set(plan_id, plan);
+                const totalMin = plan.children.reduce((s, c) => s + (c.est_minutes ?? 0), 0);
+                const lines = plan.children.map((c, i) => `${i + 1}. ${c.title}${c.est_minutes ? ` — ${c.est_minutes} 分钟` : ""}`);
+                const summary = `📝 待确认方案：「${plan.root_title}」（${plan.children.length} 个子任务` +
+                    `${totalMin ? `，共 ${totalMin} 分钟` : ""}）\n` +
+                    `${lines.join("\n")}\n\n请确认，或告诉我怎么调整。`;
+                return {
+                    plan_id,
+                    status: "awaiting_confirmation",
+                    summary,
+                    next_step: "请把方案呈现给用户，等用户明确确认后调本工具并带 confirm_token（=返回的 plan_id）落地",
+                };
+            }
+            // ── 分支 B：第二次调用（带 confirm_token）→ 落地 ──
+            const plan = decomposePlans.get(input.confirm_token);
+            if (!plan) {
+                return {
+                    ok: false,
+                    error: "方案不存在或已落地（confirm_token 无效或已被消费）",
+                };
+            }
+            if (plan.user_id !== input.user_id) {
+                return { ok: false, error: "方案不属于该用户" };
+            }
+            if (plan.timeblock_id !== input.timeblock_id) {
+                return {
+                    ok: false,
+                    error: "timeblock_id 与方案不匹配（拆解方案绑定到该 timeblock）",
+                };
+            }
+            // 原子写：root(aligned, 挂 timeblock) + N 子(draft, 挂 root)。
+            // 复用 commitPlan 同型事务模式（db.transaction 包裹）。
+            const result = db.transaction(() => {
+                const rootId = crypto.randomUUID();
+                const now = nowStr();
+                db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+           VALUES (?, ?, NULL, ?, 'aligned', NULL, NULL, ?, 0, 'medium', 'medium', ?, ?, NULL)`).run(rootId, plan.user_id, plan.root_title, plan.timeblock_id, now, now);
+                const children = plan.children.map((c, i) => {
+                    const childId = crypto.randomUUID();
+                    const cnow = nowStr();
+                    db.prepare(`INSERT INTO tasks (id, user_id, parent_id, title, status, est_minutes, category_id, linked_timeblock_id, order_index, difficulty, priority, created_at, updated_at, deleted_at)
+             VALUES (?, ?, ?, ?, 'draft', ?, NULL, NULL, ?, 'medium', 'medium', ?, ?, NULL)`).run(childId, plan.user_id, rootId, c.title, c.est_minutes, i, cnow, cnow);
+                    return {
+                        id: childId,
+                        title: c.title,
+                        est_minutes: c.est_minutes,
+                    };
+                });
+                return { root_task_id: rootId, children };
+            })();
+            // 一次性：已消费的 token 不能再用
+            decomposePlans.delete(input.confirm_token);
+            return { status: "committed", ...result };
+        },
+    };
+}