wotann 0.5.0 → 0.5.39

package/dist/orchestration/adversarial-cut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adversarial-cut.d.ts","sourceRoot":"","sources":["../../src/orchestration/adversarial-cut.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAIH,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,YAAY,GAAG,OAAO,CAAC;AAE9D,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC;CAChC;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACpD;;OAEG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,CAAC;IACvC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAID,qBAAa,wBAAyB,SAAQ,KAAK;IACjD,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;gBACT,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAKxC;AAyID;;;;;;;;GAQG;AACH,wBAAsB,cAAc,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAoC/F"}

package/dist/orchestration/adversarial-cut.js

@@ -0,0 +1,222 @@
+/**
+ * adversarial-cut — Generalizable artifact-shrinking primitive.
+ *
+ * Inspired by autonovel's adversarial-cut loop: take any text artifact
+ * (prompt, plan, spec, doc, summary) and iteratively ask an injected
+ * judge model to identify spans to cut, classify each cut as
+ * `cosmetic | structural | lossy`, then apply the cuts and re-evaluate
+ * until a target length is met or cycles exhausted.
+ *
+ * Pure, vendor-agnostic API:
+ *   - Caller supplies a `judge: (prompt: string) => Promise<string>`
+ *     callback. The judge returns JSON of the form
+ *     `[{start, end, reason, category}, ...]`.
+ *   - The module owns: prompt construction, JSON parsing, span
+ *     application (non-overlapping, sorted), cycle bookkeeping,
+ *     immutable result construction.
+ *
+ * Quality bars:
+ *   - QB#1 immutable: result.cuts is frozen + readonly, input text
+ *     is never mutated (string operations always return new strings).
+ *   - QB#6 honest failures: malformed judge output throws a clear
+ *     `AdversarialCutParseError`; empty cuts list returns the
+ *     original unchanged rather than silently faking progress.
+ *   - QB#7 stateless: every `adversarialCut()` call owns its own
+ *     working buffer + cuts list; no module-level globals.
+ *
+ * Use cases:
+ *   - Shrink an over-long system prompt before sending to a paid API.
+ *   - Tighten a feature spec after a draft review.
+ *   - Compress a meeting summary while flagging lossy cuts.
+ *   - Drop boilerplate from a generated README.
+ */
+// ── Errors ───────────────────────────────────────────────────────────
+export class AdversarialCutParseError extends Error {
+    raw;
+    constructor(raw, detail) {
+        super(`adversarial-cut: failed to parse judge response (${detail})`);
+        this.name = "AdversarialCutParseError";
+        this.raw = raw;
+    }
+}
+// ── Helpers ──────────────────────────────────────────────────────────
+function wordCount(s) {
+    const trimmed = s.trim();
+    if (trimmed.length === 0)
+        return 0;
+    return trimmed.split(/\s+/u).length;
+}
+function buildJudgePrompt(text, targetWords) {
+    const currentWords = wordCount(text);
+    const goal = targetWords === null
+        ? "Cut anything redundant, repetitive, or low-value."
+        : `Reduce from ~${currentWords} words to ≤${targetWords} words.`;
+    return [
+        "You are an adversarial editor. Identify spans of the following text to CUT.",
+        goal,
+        "Return STRICT JSON: an array of objects with keys `start`, `end`, `reason`, `category`.",
+        "`start` and `end` are character indices (end exclusive).",
+        "`category` must be one of: `cosmetic` (whitespace/filler), `structural` (reordering/duplicates), `lossy` (drops information).",
+        "Do NOT include any text outside the JSON array. Return [] if no cuts are warranted.",
+        "",
+        "TEXT:",
+        text,
+    ].join("\n");
+}
+function parseJudgeResponse(raw) {
+    const trimmed = raw.trim();
+    if (trimmed.length === 0) {
+        throw new AdversarialCutParseError(raw, "empty response");
+    }
+    // Allow judge to wrap response in code fences.
+    const stripped = trimmed
+        .replace(/^```(?:json)?\s*/iu, "")
+        .replace(/```\s*$/u, "")
+        .trim();
+    let parsed;
+    try {
+        parsed = JSON.parse(stripped);
+    }
+    catch (err) {
+        const message = err instanceof Error ? err.message : String(err);
+        throw new AdversarialCutParseError(raw, `invalid JSON: ${message}`);
+    }
+    if (!Array.isArray(parsed)) {
+        throw new AdversarialCutParseError(raw, "expected JSON array");
+    }
+    const out = [];
+    for (let i = 0; i < parsed.length; i += 1) {
+        const entry = parsed[i];
+        if (!entry || typeof entry !== "object") {
+            throw new AdversarialCutParseError(raw, `entry ${i} is not an object`);
+        }
+        const start = entry.start;
+        const end = entry.end;
+        const reason = entry.reason;
+        const category = entry.category;
+        if (typeof start !== "number" || !Number.isInteger(start) || start < 0) {
+            throw new AdversarialCutParseError(raw, `entry ${i} has invalid start`);
+        }
+        if (typeof end !== "number" || !Number.isInteger(end) || end <= start) {
+            throw new AdversarialCutParseError(raw, `entry ${i} has invalid end`);
+        }
+        if (typeof reason !== "string") {
+            throw new AdversarialCutParseError(raw, `entry ${i} has non-string reason`);
+        }
+        if (category !== "cosmetic" && category !== "structural" && category !== "lossy") {
+            throw new AdversarialCutParseError(raw, `entry ${i} has invalid category`);
+        }
+        out.push(Object.freeze({ startIndex: start, endIndex: end, reason, category }));
+    }
+    return Object.freeze(out);
+}
+/**
+ * Apply non-overlapping cuts to `text`. Cuts are sorted by start
+ * descending so that index math stays valid across multiple deletions.
+ * Overlapping cuts are merged (kept-largest-range, classified as the
+ * most-severe category of the merged set: lossy > structural > cosmetic).
+ */
+function applyCuts(text, cuts) {
+    if (cuts.length === 0)
+        return text;
+    // Clamp + filter invalid ranges.
+    const clamped = [];
+    for (const c of cuts) {
+        const start = Math.max(0, Math.min(c.startIndex, text.length));
+        const end = Math.max(0, Math.min(c.endIndex, text.length));
+        if (end <= start)
+            continue;
+        clamped.push({ ...c, startIndex: start, endIndex: end });
+    }
+    if (clamped.length === 0)
+        return text;
+    // Sort ascending to merge overlaps.
+    clamped.sort((a, b) => a.startIndex - b.startIndex);
+    const merged = [];
+    for (const c of clamped) {
+        const last = merged[merged.length - 1];
+        if (last && c.startIndex <= last.endIndex) {
+            merged[merged.length - 1] = {
+                ...last,
+                endIndex: Math.max(last.endIndex, c.endIndex),
+                category: severerCategory(last.category, c.category),
+            };
+        }
+        else {
+            merged.push(c);
+        }
+    }
+    // Apply in descending order so earlier indices remain valid.
+    merged.sort((a, b) => b.startIndex - a.startIndex);
+    let out = text;
+    for (const c of merged) {
+        out = out.slice(0, c.startIndex) + out.slice(c.endIndex);
+    }
+    return out;
+}
+function severerCategory(a, b) {
+    const rank = { cosmetic: 0, structural: 1, lossy: 2 };
+    return rank[a] >= rank[b] ? a : b;
+}
+function targetMet(text, original, opts) {
+    const currentWords = wordCount(text);
+    const originalWords = wordCount(original);
+    const wordsOk = opts.targetWords === undefined || currentWords <= opts.targetWords;
+    const pctOk = opts.targetPctCut === undefined ||
+        (originalWords > 0 && (originalWords - currentWords) / originalWords >= opts.targetPctCut);
+    // If neither metric is supplied, treat as "one cycle is enough" — let
+    // the cycle cap govern.
+    if (opts.targetWords === undefined && opts.targetPctCut === undefined)
+        return true;
+    return wordsOk && pctOk;
+}
+// ── Main API ─────────────────────────────────────────────────────────
+/**
+ * Iteratively shrink `text` by asking the judge to identify spans to
+ * cut. Runs at most `cycles` rounds; terminates early when the target
+ * length is met or the judge returns no cuts.
+ *
+ * Throws `AdversarialCutParseError` if the judge returns malformed
+ * output. Otherwise always returns a valid result (input is never
+ * mutated; if no cuts are made, `shrunk === original`).
+ */
+export async function adversarialCut(opts) {
+    const cycles = Math.max(1, opts.cycles ?? 1);
+    const original = opts.text;
+    let current = original;
+    const allCuts = [];
+    let iterations = 0;
+    for (let i = 0; i < cycles; i += 1) {
+        iterations += 1;
+        if (targetMet(current, original, opts) && i > 0)
+            break;
+        const prompt = buildJudgePrompt(current, opts.targetWords ?? null);
+        const raw = await opts.judge(prompt);
+        const cuts = parseJudgeResponse(raw);
+        if (cuts.length === 0)
+            break;
+        const next = applyCuts(current, cuts);
+        // Re-base cuts onto absolute indices in the CURRENT pre-cut text.
+        // The caller sees the cuts as a record of what the judge flagged
+        // in each round; we tag each cut's reason with its round so that
+        // overlapping rounds don't conflate.
+        for (const c of cuts) {
+            allCuts.push(Object.freeze({
+                ...c,
+                reason: cycles > 1 ? `[round ${i + 1}] ${c.reason}` : c.reason,
+            }));
+        }
+        if (next === current)
+            break;
+        current = next;
+        if (targetMet(current, original, opts))
+            break;
+    }
+    return Object.freeze({
+        original,
+        shrunk: current,
+        cuts: Object.freeze(allCuts),
+        iterations,
+    });
+}
+//# sourceMappingURL=adversarial-cut.js.map

package/dist/orchestration/adversarial-cut.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adversarial-cut.js","sourceRoot":"","sources":["../../src/orchestration/adversarial-cut.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AA8CH,wEAAwE;AAExE,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACxC,GAAG,CAAS;IACrB,YAAY,GAAW,EAAE,MAAc;QACrC,KAAK,CAAC,oDAAoD,MAAM,GAAG,CAAC,CAAC;QACrE,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;QACvC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;CACF;AAED,wEAAwE;AAExE,SAAS,SAAS,CAAC,CAAS;IAC1B,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACzB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;AACtC,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY,EAAE,WAA0B;IAChE,MAAM,YAAY,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,IAAI,GACR,WAAW,KAAK,IAAI;QAClB,CAAC,CAAC,mDAAmD;QACrD,CAAC,CAAC,gBAAgB,YAAY,cAAc,WAAW,SAAS,CAAC;IACrE,OAAO;QACL,6EAA6E;QAC7E,IAAI;QACJ,yFAAyF;QACzF,0DAA0D;QAC1D,+HAA+H;QAC/H,qFAAqF;QACrF,EAAE;QACF,OAAO;QACP,IAAI;KACL,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,SAAS,kBAAkB,CAAC,GAAW;IACrC,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;IAC5D,CAAC;IACD,+CAA+C;IAC/C,MAAM,QAAQ,GAAG,OAAO;SACrB,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC;SACjC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,IAAI,EAAE,CAAC;IACV,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjE,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,iBAAiB,OAAO,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,qBAAqB,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAmC,CAAC;QAC1D,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YACxC,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,SAAS,CAAC,mBAAmB,CAAC,CAAC;QACzE,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC;QACtB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACvE,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,SAAS,CAAC,oBAAoB,CAAC,CAAC;QAC1E,CAAC;QACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC;YACtE,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,SAAS,CAAC,kBAAkB,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC/B,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,SAAS,CAAC,wBAAwB,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,KAAK,YAAY,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;YACjF,MAAM,IAAI,wBAAwB,CAAC,GAAG,EAAE,SAAS,CAAC,uBAAuB,CAAC,CAAC;QAC7E,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,CAA4B,CAAC;AACvD,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAAC,IAAY,EAAE,IAA6B;IAC5D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,iCAAiC;IACjC,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,IAAI,GAAG,IAAI,KAAK;YAAE,SAAS;QAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,oCAAoC;IACpC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,IAAI,IAAI,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG;gBAC1B,GAAG,IAAI;gBACP,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC;gBAC7C,QAAQ,EAAE,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC;aACrD,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,6DAA6D;IAC7D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACnD,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,CAAc,EAAE,CAAc;IACrD,MAAM,IAAI,GAAgC,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IACnF,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,SAAS,CAAC,IAAY,EAAE,QAAgB,EAAE,IAA2B;IAC5E,MAAM,YAAY,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,aAAa,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,YAAY,IAAI,IAAI,CAAC,WAAW,CAAC;IACnF,MAAM,KAAK,GACT,IAAI,CAAC,YAAY,KAAK,SAAS;QAC/B,CAAC,aAAa,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,GAAG,aAAa,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC;IAC7F,sEAAsE;IACtE,wBAAwB;IACxB,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACnF,OAAO,OAAO,IAAI,KAAK,CAAC;AAC1B,CAAC;AAED,wEAAwE;AAExE;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAA2B;IAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;IAC3B,IAAI,OAAO,GAAG,QAAQ,CAAC;IACvB,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,UAAU,IAAI,CAAC,CAAC;QAChB,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM;QACvD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC;QACnE,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACtC,kEAAkE;QAClE,iEAAiE;QACjE,iEAAiE;QACjE,qCAAqC;QACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,OAAO,CAAC,IAAI,CACV,MAAM,CAAC,MAAM,CAAC;gBACZ,GAAG,CAAC;gBACJ,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;aAC/D,CAAC,CACH,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,KAAK,OAAO;YAAE,MAAM;QAC5B,OAAO,GAAG,IAAI,CAAC;QACf,IAAI,SAAS,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC;YAAE,MAAM;IAChD,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,QAAQ;QACR,MAAM,EAAE,OAAO;QACf,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAA4B;QACvD,UAAU;KACX,CAAC,CAAC;AACL,CAAC"}

package/dist/orchestration/agent-kanban.d.ts

@@ -0,0 +1,147 @@
+/**
+ * agent-kanban — Visual multi-agent orchestration board (Cline pattern).
+ *
+ * Inspired by Cline's Kanban dashboard (https://cline.bot/kanban) which
+ * displays agents as cards moving across columns:
+ *
+ *   Backlog → Planning → Active → Verifying → Done (or Failed)
+ *
+ * Each card represents one agent + task pair, with progress, status,
+ * timestamps, and PR-style reviewer comments. The board is the shared
+ * VISUAL STATE every WOTANN surface (Desktop React, TUI Ink, iOS
+ * SwiftUI) renders. Without it, every surface re-implements
+ * presentation and they drift.
+ *
+ * THIS MODULE
+ *   Pure data + pure reducer + 3 renderers. The state is immutable;
+ *   every action returns a NEW state with version+1. The caller threads
+ *   state through `applyAction` (or folds with `applyActions`). No
+ *   globals, no I/O, no clocks — timestamps are caller-supplied.
+ *
+ *   The renderers (text / markdown / json) take state + emit a string;
+ *   they never crash on empty or large states.
+ *
+ * Quality bars:
+ *   - QB#1  immutable: state, cards, comments are all readonly + frozen.
+ *   - QB#3  honest: applyAction never throws on bad action; returns the
+ *           same state with a structured note inside the new version.
+ *           Unknown actions / missing cards / duplicate IDs are no-ops
+ *           that increment version (so callers see the apply happened).
+ *   - QB#7  stateless: caller threads state; no module-level cache.
+ *   - QB#11 sibling-site: this module owns ONLY board presentation.
+ *           Task creation, agent dispatch, scheduling all live elsewhere
+ *           (autonomous.ts, crew.ts, dag-runner.ts). The kanban
+ *           consumes events; it does not manage tasks.
+ *
+ * Usage:
+ *   let state = createKanban();
+ *   state = applyAction(state, { kind: "card-created", card });
+ *   state = applyAction(state, { kind: "card-moved", id, toLane: "active", ts });
+ *   const board = renderTextBoard(state);
+ */
+export type Lane = "backlog" | "planning" | "active" | "verifying" | "done" | "failed";
+export declare const LANES: readonly Lane[];
+export type CardStatus = "queued" | "running" | "blocked" | "review" | "succeeded" | "failed";
+export interface Comment {
+    readonly id: string;
+    readonly author: string;
+    readonly body: string;
+    readonly createdAt: number;
+    readonly resolved: boolean;
+}
+export interface AgentCard {
+    readonly id: string;
+    readonly taskId: string;
+    readonly label: string;
+    readonly lane: Lane;
+    readonly status: CardStatus;
+    readonly progressPct: number;
+    readonly ownerName?: string;
+    readonly lastEventAt: number;
+    readonly pendingComments?: readonly Comment[];
+}
+export interface KanbanState {
+    readonly cards: readonly AgentCard[];
+    readonly version: number;
+}
+export type KanbanAction = {
+    readonly kind: "card-created";
+    readonly card: AgentCard;
+} | {
+    readonly kind: "card-moved";
+    readonly id: string;
+    readonly toLane: Lane;
+    readonly ts: number;
+} | {
+    readonly kind: "card-progress";
+    readonly id: string;
+    readonly pct: number;
+    readonly ts: number;
+} | {
+    readonly kind: "card-status";
+    readonly id: string;
+    readonly status: CardStatus;
+    readonly ts: number;
+} | {
+    readonly kind: "comment-added";
+    readonly cardId: string;
+    readonly comment: Comment;
+} | {
+    readonly kind: "comment-resolved";
+    readonly cardId: string;
+    readonly commentId: string;
+    readonly ts: number;
+} | {
+    readonly kind: "card-removed";
+    readonly id: string;
+};
+/** Create a fresh empty board (frozen). Version starts at 0. */
+export declare function createKanban(): KanbanState;
+/**
+ * Apply one action immutably. Returns a NEW state with version+1.
+ * Never throws — bad actions become no-ops that still bump version
+ * (so callers can detect the apply happened). QB#3 honest: never
+ * silent success; never silent crash.
+ */
+export declare function applyAction(state: KanbanState, action: KanbanAction): KanbanState;
+/** Fold a list of actions in order. Returns a single new state. */
+export declare function applyActions(state: KanbanState, actions: readonly KanbanAction[]): KanbanState;
+/** All cards in a given lane, in insertion order. */
+export declare function cardsInLane(state: KanbanState, lane: Lane): readonly AgentCard[];
+/** Lookup a card by id or null. */
+export declare function cardById(state: KanbanState, id: string): AgentCard | null;
+/** Count of cards per lane. Always returns all 6 lanes (zero-filled). */
+export declare function laneCounts(state: KanbanState): Record<Lane, number>;
+/** All unresolved comments across all cards, with their owning cardId. */
+export declare function blockingComments(state: KanbanState): readonly {
+    readonly cardId: string;
+    readonly comment: Comment;
+}[];
+/**
+ * Throughput counts since `sinceTs` (inclusive). A card "moved" if its
+ * lastEventAt >= sinceTs. "completed" = lane === done. "failed" = lane
+ * === failed. The same card can count as both moved AND
+ * completed/failed.
+ */
+export declare function throughput(state: KanbanState, sinceTs: number): {
+    readonly moved: number;
+    readonly completed: number;
+    readonly failed: number;
+};
+/**
+ * ASCII board, 6 columns. Designed to fit ~80 cols: each column is
+ * ~12 chars wide. Cards are shown as truncated labels with a progress
+ * bar. Never crashes on empty / large states.
+ */
+export declare function renderTextBoard(state: KanbanState): string;
+/**
+ * Markdown table summary. Grep-friendly + deterministic — cards are
+ * sorted by (lane index, id) so tests can assert exact strings.
+ */
+export declare function renderMarkdownBoard(state: KanbanState): string;
+/**
+ * Deterministic JSON export (sorted keys at the top level). Round-trippable
+ * with `JSON.parse`. Useful for snapshotting boards into transcripts.
+ */
+export declare function exportJson(state: KanbanState): string;
+//# sourceMappingURL=agent-kanban.d.ts.map

package/dist/orchestration/agent-kanban.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-kanban.d.ts","sourceRoot":"","sources":["../../src/orchestration/agent-kanban.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAIH,MAAM,MAAM,IAAI,GAAG,SAAS,GAAG,UAAU,GAAG,QAAQ,GAAG,WAAW,GAAG,MAAM,GAAG,QAAQ,CAAC;AAEvF,eAAO,MAAM,KAAK,EAAE,SAAS,IAAI,EAOtB,CAAC;AAEZ,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,WAAW,GAAG,QAAQ,CAAC;AAE9F,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IACrC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,MAAM,YAAY,GACpB;IAAE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GAC3D;IAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChG;IACE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;CAAE,GACtF;IACE,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAgC3D,gEAAgE;AAChE,wBAAgB,YAAY,IAAI,WAAW,CAK1C;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,GAAG,WAAW,CAyHjF;AAED,mEAAmE;AACnE,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,YAAY,EAAE,GAAG,WAAW,CAI9F;AAID,qDAAqD;AACrD,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,IAAI,GAAG,SAAS,SAAS,EAAE,CAEhF;AAED,mCAAmC;AACnC,wBAAgB,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAEzE;AAED,yEAAyE;AACzE,wBAAgB,UAAU,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAWnE;AAED,0EAA0E;AAC1E,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,WAAW,GACjB,SAAS;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;CAAE,EAAE,CASnE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,WAAW,EAClB,OAAO,EAAE,MAAM,GACd;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAYjF;AAID;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAmC1D;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAyC9D;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAyBrD"}