clinkx 0.3.0 → 1.0.0

package/clinkx-workflows/dist/workspace-signature.js

@@ -0,0 +1,388 @@
+import { execFile } from "node:child_process";
+import { constants as fsConstants } from "node:fs";
+import { access, lstat, readdir, realpath, readFile, stat } from "node:fs/promises";
+import { join, relative, resolve, sep } from "node:path";
+import { promisify } from "node:util";
+import { canonicalJson, sha256 } from "./context-cache-key.js";
+import { logger } from "./logger.js";
+const execFileAsync = promisify(execFile);
+const MAX_SCAN_FILES = 10_000;
+const GIT_MAX_BUFFER_BYTES = 100 * 1024 * 1024;
+// Test-only seam: the effective scan cap is read through this mutable so tests
+// can exercise the cap boundary without materializing MAX_SCAN_FILES files.
+// Both untrackedContentHash and getSignatureCoveredPaths read the SAME effective
+// cap, keeping covered ⊆ hashed candidates. Not part of the public API.
+let currentMaxScanFiles = MAX_SCAN_FILES;
+/** Test-only: override the effective scan cap. */
+export function __setMaxScanFilesForTest(n) {
+    currentMaxScanFiles = n;
+}
+/** Test-only: restore the default scan cap. */
+export function __resetMaxScanFilesForTest() {
+    currentMaxScanFiles = MAX_SCAN_FILES;
+}
+/**
+ * Lists untracked, non-ignored files under `pathspec`, sorted and capped to
+ * `cap`. The cap-exceeded warning is emitted here exactly once. Returned paths
+ * are repo-relative (as emitted by `git ls-files`). This is the single source
+ * of truth shared by both the untracked content hash and the covered-path set,
+ * so coverage can never exceed what the signature actually hashes.
+ */
+async function listCappedUntrackedFiles(topLevel, pathspec, cap) {
+    const result = await git([
+        "-C",
+        topLevel,
+        "ls-files",
+        "--others",
+        "--exclude-standard",
+        "-z",
+        ...pathspec,
+    ]);
+    const allPaths = splitNul(result.stdout).sort();
+    const paths = allPaths.slice(0, cap);
+    if (allPaths.length > cap) {
+        logger.warn({ topLevel, total: allPaths.length, cap }, "untracked file list exceeded scan cap; signature computed over capped prefix");
+    }
+    return paths;
+}
+/**
+ * Computes a workspace content signature for cache invalidation.
+ *
+ * Git trees are content-sensitive for tracked changes, staged/index state,
+ * untracked non-ignored files, and submodule identity. Gitignored files are
+ * deliberately invisible: if a gitignored file is selected through
+ * focus_paths/search_terms, the runner's promote-on-pass realized-selection
+ * coverage gate must keep that run out of the cache (`cache_write=false`).
+ * Non-git trees are best-effort only; mtime is used as the content proxy.
+ */
+export async function workspaceSignature(roots) {
+    const signature = await signatureForRoots(roots, { visitedGitTopLevels: new Set() });
+    return signature;
+}
+export async function getSignatureCoveredPaths(roots) {
+    const resolvedRoots = await resolveRoots(roots);
+    const gitRoots = [];
+    for (const root of resolvedRoots) {
+        const topLevel = await findGitTopLevel(root);
+        if (topLevel !== undefined) {
+            gitRoots.push({ root, topLevel });
+        }
+        else {
+            // Non-git roots intentionally add no covered paths, so they never promote.
+        }
+    }
+    const covered = new Set();
+    for (const group of groupGitRoots(gitRoots)) {
+        const pathspec = ["--", ...group.roots.map((root) => relativePathspec(group.topLevel, root))];
+        const tracked = await git([
+            "-C",
+            group.topLevel,
+            "ls-files",
+            "-z",
+            ...pathspec,
+        ]);
+        // Tracked files are always captured by `git diff`, so unbounded tracked
+        // coverage is always safe.
+        for (const filePath of splitNul(tracked.stdout)) {
+            const absolute = join(group.topLevel, filePath);
+            covered.add(await normalizeExistingPath(absolute));
+        }
+        // Untracked files: use the SAME capped/sorted prefix the signature hashes
+        // (see untrackedContentHash — both pathspecs must stay in sync; the
+        // covered ⊆ hashed invariant relies on git normalizing them identically).
+        // Mirror the isFile filter ONLY, not the readFile step: an lstat-isFile but
+        // unreadable path is covered-here-but-not-hashed-there. Benign/self-healing
+        // — context_builder already read the file's bytes, so if they change the
+        // hashing readFile succeeds and the signature changes → MISS.
+        // Fail closed — a path that fails to lstat is not added.
+        const untrackedPaths = await listCappedUntrackedFiles(group.topLevel, pathspec, currentMaxScanFiles);
+        for (const filePath of untrackedPaths) {
+            const absolute = join(group.topLevel, filePath);
+            try {
+                const fileStat = await lstat(absolute);
+                if (!fileStat.isFile())
+                    continue;
+                covered.add(await normalizeExistingPath(absolute));
+            }
+            catch {
+                // Best-effort: a path that races away or is unreadable is not covered.
+                continue;
+            }
+        }
+    }
+    return covered;
+}
+function relativePathspec(topLevel, root) {
+    const rel = relative(topLevel, root);
+    return rel === "" ? "." : rel;
+}
+async function signatureForRoots(roots, options) {
+    const resolvedRoots = await resolveRoots(roots);
+    const gitRoots = [];
+    const nonGitRoots = [];
+    for (const root of resolvedRoots) {
+        const topLevel = await findGitTopLevel(root);
+        if (topLevel === undefined) {
+            nonGitRoots.push(root);
+        }
+        else {
+            gitRoots.push({ root, topLevel });
+        }
+    }
+    const entries = [];
+    for (const group of groupGitRoots(gitRoots)) {
+        entries.push(await gitSignature(group, options));
+    }
+    for (const root of nonGitRoots.sort()) {
+        entries.push(await nonGitSignature(root));
+    }
+    entries.sort((a, b) => compareCodeUnits(canonicalJson(a), canonicalJson(b)));
+    return sha256(canonicalJson(entries));
+}
+async function resolveRoots(roots) {
+    const inputRoots = roots.length === 0 ? [process.cwd()] : roots;
+    const resolved = [];
+    for (const root of inputRoots) {
+        const absolute = resolve(root);
+        try {
+            resolved.push(await realpath(absolute));
+        }
+        catch {
+            resolved.push(absolute);
+        }
+    }
+    return Array.from(new Set(resolved)).sort();
+}
+async function normalizeExistingPath(path) {
+    const absolute = resolve(path);
+    try {
+        return await realpath(absolute);
+    }
+    catch {
+        return absolute;
+    }
+}
+async function findGitTopLevel(root) {
+    try {
+        const inside = await git(["-C", root, "rev-parse", "--is-inside-work-tree"]);
+        if (inside.stdout.toString("utf8").trim() !== "true")
+            return undefined;
+        const topLevel = await git(["-C", root, "rev-parse", "--show-toplevel"]);
+        return (await realpath(topLevel.stdout.toString("utf8").trim()));
+    }
+    catch {
+        return undefined;
+    }
+}
+function groupGitRoots(gitRoots) {
+    const groups = new Map();
+    for (const gitRoot of gitRoots) {
+        const roots = groups.get(gitRoot.topLevel) ?? [];
+        roots.push(gitRoot.root);
+        groups.set(gitRoot.topLevel, roots);
+    }
+    return Array.from(groups.entries())
+        .sort(([a], [b]) => compareCodeUnits(a, b))
+        .map(([topLevel, roots]) => ({ topLevel, roots: Array.from(new Set(roots)).sort() }));
+}
+function compareCodeUnits(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+async function gitSignature(group, options) {
+    if (options.visitedGitTopLevels.has(group.topLevel)) {
+        return { kind: "git", recursive: true };
+    }
+    const visitedGitTopLevels = new Set(options.visitedGitTopLevels);
+    visitedGitTopLevels.add(group.topLevel);
+    const pathspec = ["--", ...group.roots];
+    const head = await gitHead(group.topLevel);
+    const trackedDiff = await git(["-C", group.topLevel, "diff", "--binary", ...pathspec]);
+    const cachedDiff = await git(["-C", group.topLevel, "diff", "--cached", "--binary", ...pathspec]);
+    const untracked = await untrackedContentHash(group.topLevel, pathspec);
+    const submodules = await submoduleSignatures(group, { visitedGitTopLevels });
+    return {
+        kind: "git",
+        signature: sha256(canonicalJson([
+            head,
+            sha256(trackedDiff.stdout),
+            sha256(cachedDiff.stdout),
+            untracked,
+            submodules,
+        ])),
+    };
+}
+async function gitHead(topLevel) {
+    try {
+        const result = await git(["-C", topLevel, "rev-parse", "HEAD"]);
+        return result.stdout.toString("utf8").trim();
+    }
+    catch {
+        return "";
+    }
+}
+async function untrackedContentHash(topLevel, pathspec) {
+    // Must use the SAME capped/sorted prefix via listCappedUntrackedFiles as
+    // getSignatureCoveredPaths; the covered ⊆ hashed invariant depends on git
+    // normalizing this pathspec identically on both sides — keep them in sync.
+    const paths = await listCappedUntrackedFiles(topLevel, pathspec, currentMaxScanFiles);
+    const records = [];
+    for (const filePath of paths) {
+        const absolute = join(topLevel, filePath);
+        try {
+            const fileStat = await lstat(absolute);
+            if (!fileStat.isFile())
+                continue;
+            records.push({ path: filePath, content_hash: sha256(await readFile(absolute)) });
+        }
+        catch {
+            // Best-effort: an untracked file that races away or is unreadable
+            // (EACCES/ENOENT) is skipped rather than crashing the signature.
+            continue;
+        }
+    }
+    records.sort((a, b) => compareCodeUnits(a.path, b.path));
+    return sha256(canonicalJson(records));
+}
+async function submoduleSignatures(group, options) {
+    const gitmodulesPath = join(group.topLevel, ".gitmodules");
+    try {
+        await access(gitmodulesPath, fsConstants.R_OK);
+    }
+    catch {
+        return [];
+    }
+    const result = await git([
+        "-C",
+        group.topLevel,
+        "config",
+        "-z",
+        "--file",
+        gitmodulesPath,
+        "--get-regexp",
+        "^submodule\\..*\\.path$",
+    ], { allowFailure: true });
+    if (result.exitCode !== 0)
+        return [];
+    const entries = splitNul(result.stdout);
+    const submodulePaths = [];
+    for (const entry of entries) {
+        const newlineIndex = entry.indexOf("\n");
+        if (newlineIndex === -1)
+            continue;
+        submodulePaths.push(entry.slice(newlineIndex + 1));
+    }
+    const signatures = [];
+    for (const submodulePath of submodulePaths.sort()) {
+        const absolute = resolve(group.topLevel, submodulePath);
+        if (!isUnderAnyRoot(absolute, group.roots))
+            continue;
+        try {
+            const submoduleStat = await stat(absolute);
+            if (!submoduleStat.isDirectory()) {
+                // Uninitialized submodules have no working tree to recurse into; the
+                // parent HEAD/diff still covers the gitlink identity.
+                signatures.push({ path: submodulePath, present: false });
+                continue;
+            }
+            signatures.push({
+                path: submodulePath,
+                signature: await signatureForRoots([absolute], options),
+            });
+        }
+        catch {
+            signatures.push({ path: submodulePath, present: false });
+        }
+    }
+    return signatures;
+}
+function isUnderAnyRoot(path, roots) {
+    return roots.some((root) => path === root || path.startsWith(`${root}${sep}`));
+}
+async function nonGitSignature(root) {
+    const entries = [];
+    await walkNonGit(root, root, entries);
+    entries.sort();
+    return {
+        kind: "non-git",
+        // Best-effort only: mtime is a content proxy, not a correctness-first
+        // signal. Correctness-critical non-git trees should use content hashing
+        // or bypass the cache until a stronger scanner is available.
+        signature: sha256(canonicalJson(entries)),
+        capped: entries.length >= currentMaxScanFiles,
+    };
+}
+async function walkNonGit(root, current, entries) {
+    if (entries.length >= currentMaxScanFiles)
+        return;
+    let currentStat;
+    try {
+        currentStat = await lstat(current);
+    }
+    catch {
+        // Best-effort: an unreadable or raced entry (EACCES/ENOENT) is skipped
+        // rather than crashing the walk. This also covers an unreadable child,
+        // since each child is processed by a recursive call starting here.
+        return;
+    }
+    if (currentStat.isSymbolicLink())
+        return;
+    if (currentStat.isFile()) {
+        entries.push(`${relative(root, current)}:${currentStat.size}:${currentStat.mtimeMs}`);
+        return;
+    }
+    if (!currentStat.isDirectory())
+        return;
+    let children;
+    try {
+        children = (await readdir(current)).sort();
+    }
+    catch {
+        // Unreadable directory (EACCES) — skip its subtree rather than crash.
+        return;
+    }
+    for (const child of children) {
+        if (entries.length >= currentMaxScanFiles)
+            return;
+        await walkNonGit(root, join(current, child), entries);
+    }
+}
+async function git(args, options = {}) {
+    try {
+        const result = await execFileAsync("git", args, {
+            encoding: "buffer",
+            maxBuffer: GIT_MAX_BUFFER_BYTES,
+            shell: false,
+        });
+        return {
+            stdout: result.stdout,
+            stderr: result.stderr,
+            exitCode: 0,
+        };
+    }
+    catch (err) {
+        const error = err;
+        const exitCode = typeof error.code === "number" ? error.code : 1;
+        const failure = {
+            stdout: toBuffer(error.stdout),
+            stderr: toBuffer(error.stderr),
+            exitCode,
+        };
+        if (options.allowFailure === true)
+            return failure;
+        throw err;
+    }
+}
+function splitNul(buffer) {
+    return buffer
+        .toString("utf8")
+        .split("\0")
+        .filter((entry) => entry.length > 0);
+}
+function toBuffer(value) {
+    if (Buffer.isBuffer(value))
+        return value;
+    if (typeof value === "string")
+        return Buffer.from(value, "utf8");
+    return Buffer.alloc(0);
+}
+//# sourceMappingURL=workspace-signature.js.map

package/clinkx-workflows/dist/workspace-signature.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workspace-signature.js","sourceRoot":"","sources":["../src/workspace-signature.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,SAAS,IAAI,WAAW,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACpF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AACzD,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,MAAM,aAAa,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;AAC1C,MAAM,cAAc,GAAG,MAAM,CAAC;AAC9B,MAAM,oBAAoB,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC;AAE/C,+EAA+E;AAC/E,4EAA4E;AAC5E,iFAAiF;AACjF,wEAAwE;AACxE,IAAI,mBAAmB,GAAG,cAAc,CAAC;AAEzC,kDAAkD;AAClD,MAAM,UAAU,wBAAwB,CAAC,CAAS;IAChD,mBAAmB,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,0BAA0B;IACxC,mBAAmB,GAAG,cAAc,CAAC;AACvC,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,wBAAwB,CACrC,QAAgB,EAChB,QAA2B,EAC3B,GAAW;IAEX,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC;QACvB,IAAI;QACJ,QAAQ;QACR,UAAU;QACV,UAAU;QACV,oBAAoB;QACpB,IAAI;QACJ,GAAG,QAAQ;KACZ,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,QAAQ,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CACT,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,EACzC,8EAA8E,CAC/E,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAgBD;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,KAAwB;IAC/D,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC,KAAK,EAAE,EAAE,mBAAmB,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;IACrF,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,KAAwB;IAExB,MAAM,aAAa,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,2EAA2E;QAC7E,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9F,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC;YACxB,IAAI;YACJ,KAAK,CAAC,QAAQ;YACd,UAAU;YACV,IAAI;YACJ,GAAG,QAAQ;SACZ,CAAC,CAAC;QAEH,wEAAwE;QACxE,2BAA2B;QAC3B,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAChD,OAAO,CAAC,GAAG,CAAC,MAAM,qBAAqB,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,0EAA0E;QAC1E,oEAAoE;QACpE,0EAA0E;QAC1E,4EAA4E;QAC5E,4EAA4E;QAC5E,yEAAyE;QACzE,8DAA8D;QAC9D,yDAAyD;QACzD,MAAM,cAAc,GAAG,MAAM,wBAAwB,CACnD,KAAK,CAAC,QAAQ,EACd,QAAQ,EACR,mBAAmB,CACpB,CAAC;QACF,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAChD,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACvC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;oBAAE,SAAS;gBACjC,OAAO,CAAC,GAAG,CAAC,MAAM,qBAAqB,CAAC,QAAQ,CAAC,CAAC,CAAC;YACrD,CAAC;YAAC,MAAM,CAAC;gBACP,uEAAuE;gBACvE,SAAS;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAgB,EAAE,IAAY;IACtD,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACrC,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAChC,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC9B,KAAwB,EACxB,OAAyB;IAEzB,MAAM,aAAa,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAC,MAAM,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;QACtC,OAAO,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,OAAO,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,KAAK,UAAU,YAAY,CAAC,KAAwB;IAClD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAChE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAC,MAAM,CAAC;YACP,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAC9C,CAAC;AAED,KAAK,UAAU,qBAAqB,CAAC,IAAY;IAC/C,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,CAAC;QACH,OAAO,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAC;IAClB,CAAC;AACH,CAAC;AAED,KAAK,UAAU,eAAe,CAAC,IAAY;IACzC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,CAAC,CAAC,CAAC;QAC7E,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM;YAAE,OAAO,SAAS,CAAC;QACvE,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC,CAAC;QACzE,OAAO,CAAC,MAAM,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,QAA4B;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACjD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SAChC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC1C,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;AAC1F,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAS,EAAE,CAAS;IAC5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,KAAK,UAAU,YAAY,CAAC,KAAe,EAAE,OAAyB;IACpE,IAAI,OAAO,CAAC,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAC1C,CAAC;IAED,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;IACjE,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAExC,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IACvF,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;IAClG,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACvE,MAAM,UAAU,GAAG,MAAM,mBAAmB,CAAC,KAAK,EAAE,EAAE,mBAAmB,EAAE,CAAC,CAAC;IAE7E,OAAO;QACL,IAAI,EAAE,KAAK;QACX,SAAS,EAAE,MAAM,CAAC,aAAa,CAAC;YAC9B,IAAI;YACJ,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;YAC1B,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC;YACzB,SAAS;YACT,UAAU;SACX,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,QAAgB;IACrC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,KAAK,UAAU,oBAAoB,CAAC,QAAgB,EAAE,QAA2B;IAC/E,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,MAAM,KAAK,GAAG,MAAM,wBAAwB,CAAC,QAAQ,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC;IACtF,MAAM,OAAO,GAA+D,EAAE,CAAC;IAC/E,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC1C,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAAE,SAAS;YACjC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,CAAC,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QACnF,CAAC;QAAC,MAAM,CAAC;YACP,kEAAkE;YAClE,iEAAiE;YACjE,SAAS;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,KAAK,UAAU,mBAAmB,CAChC,KAAe,EACf,OAAyB;IAEzB,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC3D,IAAI,CAAC;QACH,MAAM,MAAM,CAAC,cAAc,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC;QACvB,IAAI;QACJ,KAAK,CAAC,QAAQ;QACd,QAAQ;QACR,IAAI;QACJ,QAAQ;QACR,cAAc;QACd,cAAc;QACd,yBAAyB;KAC1B,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3B,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,YAAY,KAAK,CAAC,CAAC;YAAE,SAAS;QAClC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,UAAU,GAAc,EAAE,CAAC;IACjC,KAAK,MAAM,aAAa,IAAI,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;QACxD,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC;YAAE,SAAS;QACrD,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,EAAE,CAAC;gBACjC,qEAAqE;gBACrE,sDAAsD;gBACtD,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gBACzD,SAAS;YACX,CAAC;YACD,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,aAAa;gBACnB,SAAS,EAAE,MAAM,iBAAiB,CAAC,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;aACxD,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,cAAc,CAAC,IAAY,EAAE,KAAwB;IAC5D,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,KAAK,UAAU,eAAe,CAAC,IAAY;IACzC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IACtC,OAAO,CAAC,IAAI,EAAE,CAAC;IACf,OAAO;QACL,IAAI,EAAE,SAAS;QACf,sEAAsE;QACtE,wEAAwE;QACxE,6DAA6D;QAC7D,SAAS,EAAE,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QACzC,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,mBAAmB;KAC9C,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,IAAY,EAAE,OAAe,EAAE,OAAiB;IACxE,IAAI,OAAO,CAAC,MAAM,IAAI,mBAAmB;QAAE,OAAO;IAElD,IAAI,WAA8C,CAAC;IACnD,IAAI,CAAC;QACH,WAAW,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,uEAAuE;QACvE,uEAAuE;QACvE,mEAAmE;QACnE,OAAO;IACT,CAAC;IACD,IAAI,WAAW,CAAC,cAAc,EAAE;QAAE,OAAO;IACzC,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QACtF,OAAO;IACT,CAAC;IACD,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE;QAAE,OAAO;IAEvC,IAAI,QAAkB,CAAC;IACvB,IAAI,CAAC;QACH,QAAQ,GAAG,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,sEAAsE;QACtE,OAAO;IACT,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,IAAI,mBAAmB;YAAE,OAAO;QAClD,MAAM,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAQD,KAAK,UAAU,GAAG,CAChB,IAAuB,EACvB,UAA+C,EAAE;IAEjD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE;YAC9C,QAAQ,EAAE,QAAQ;YAClB,SAAS,EAAE,oBAAoB;YAC/B,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;QACH,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,QAAQ,EAAE,CAAC;SACZ,CAAC;IACJ,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,KAAK,GAAG,GAIb,CAAC;QACF,MAAM,QAAQ,GAAG,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,OAAO,GAAG;YACd,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;YAC9B,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;YAC9B,QAAQ;SACT,CAAC;QACF,IAAI,OAAO,CAAC,YAAY,KAAK,IAAI;YAAE,OAAO,OAAO,CAAC;QAClD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc;IAC9B,OAAO,MAAM;SACV,QAAQ,CAAC,MAAM,CAAC;SAChB,KAAK,CAAC,IAAI,CAAC;SACX,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAkC;IAClD,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACjE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC"}

package/clinkx-workflows/templates/council/answer-specialist.txt

@@ -19,7 +19,8 @@ You are a specialist answering a question. Produce a structured, well-reasoned a
 Answer the question thoroughly. Provide reasoning, note caveats, and cite sources where possible.
 - Set your ID from your call ID (e.g., member_a, specialist_b).
 - Return exactly one JSON object matching the schema below.
-- Return a single valid JSON object. Be thorough within the fields; brevity is not a goal.
+- Return a single valid JSON object. Be thorough within the fields.
+- The measured artifact is the final result file the runtime extracts — not a shorter chat recap. That file is pretty-printed JSON (2-space indent, trailing newline) and must stay at or under 75_000 UTF-8 bytes.
 - Do not wrap the JSON in markdown fences.
 - Do not output prose before or after the JSON.
 - Use empty arrays instead of placeholder strings.

package/clinkx-workflows/templates/council/code-review-chairman.txt

@@ -30,6 +30,19 @@ Use `reviewers` and `cross_review` as the JSON key names inside `considered_arti
 - Cross-review and ranking artifacts reference candidates by alias letters (A, B, C, ...) assigned in definition order of the upstream reviewer artifacts. Map A to the first reviewer, B to the second, and so on. Use the original call IDs from reviewer artifact filenames in your output, not alias letters.
 - considered_artifacts must count only artifacts actually read, not expected counts.
 - status must be one of: approved, revise, reject. Use revise when credible unresolved blocking issues remain.
+
+## Verdict Rules
+- D2 SEVERITY → VERDICT PROMOTION:
+  - Any unwaived `critical` correctness/security issue — or an unwaived `high` correctness/security issue with a concrete exploit, data-loss, or breaking-change consequence — maps to `reject`.
+  - Otherwise, credible unresolved blocking issues map to `revise`.
+  - No credible blocking issues map to `approved`.
+- D3 STRUCTURAL CAP:
+  - A structural / reuse / duplication / naming / layering smell CANNOT by itself drive `reject`; on its own it caps at `revise`.
+  - It reaches `reject` ONLY when bridge-reclassified: it demonstrably causes or masks a correctness, security, API-stability, or data-loss defect. In that case, treat it as that defect (D2 applies to the underlying defect, not the smell).
+- D1 UNKNOWN ON ABSENCE:
+  - If reviewers report `structural_findings` with status `not_assessed_due_to_context`, or any reviewer reports `context_available` is false, treat the ABSENCE of structural findings as UNKNOWN, not as evidence the code is "structurally clean".
+  - Do not upgrade the verdict (e.g. toward `approved`) on the basis of that absence.
+
 - Return exactly one JSON object matching the schema below.
 - Do not wrap the JSON in markdown fences.
 - Do not output prose before or after the JSON.

package/clinkx-workflows/templates/council/code-review-cross-reviewer.txt

@@ -31,12 +31,15 @@ Evaluate each reviewer's assessment: identify agreement/disagreement, missed iss
 - Do not wrap the JSON in markdown fences.
 - Do not output prose before or after the JSON.
 - Use empty arrays instead of placeholder strings.
+- Score each candidate BEFORE producing the ranking; the ranking must follow from the scores. A deterministic reducer downstream depends on both `ranking` and each candidate's `overall_score_100`, so always populate both.
+- Each `per_review_feedback[]` entry MAY ALSO include optional structured `missed_issue_refs` and `false_positive_refs` arrays ALONGSIDE — not replacing — the existing `missed_issues` and `false_positives` string arrays. Keep the string arrays populated as before; the `*_refs` arrays add structured detail.
+- EVIDENCE BREVITY for refs: each ref may carry at most 2 `evidence` entries; each `observation` quotes 1-2 lines and stays at or under ~240 characters; each `location` uses `path:line` form at or under 120 characters and MUST cite a file present in the diff or attached context (fabricated citations are stripped downstream).
 
 IMPORTANT: For enum fields, use ONLY the exact values shown (separated by | in the schema below). Do not use synonyms, variations, or alternative phrasings.
 Return a single valid JSON object. Be thorough within the fields; brevity is not a goal. Match this schema:
 {
   "independent_baseline": "Your concise independent code review produced in Phase 1",
-  "per_review_feedback": [{"candidate_id": "A", "agreement_level": "agree|partial|disagree", "missed_issues": ["..."], "false_positives": ["..."], "comments": "...", "overall_score_100": 80}],
+  "per_review_feedback": [{"candidate_id": "A", "agreement_level": "agree|partial|disagree", "missed_issues": ["..."], "false_positives": ["..."], "missed_issue_refs": [{"description": "...", "file": "path", "evidence": [{"location": "path:line", "observation": "1-2 quoted lines"}], "confidence": 0}], "false_positive_refs": [{"description": "...", "file": "path", "evidence": [{"location": "path:line", "observation": "1-2 quoted lines"}], "confidence": 0}], "comments": "...", "overall_score_100": 80}],
   "extra_blocking_issues": ["Any additional blocking issues not covered by other reviewers"],
   "extra_tests": ["Any additional tests that should be added"],
   "ranking": [{"candidate_id": "A", "rank": 1, "rationale": "..."}]

package/clinkx-workflows/templates/council/code-review-reviewer.txt

@@ -12,6 +12,9 @@ You are a code reviewer. Review the code changes for correctness, security, perf
 ## Rubric
 {{rubric}}
 
+## Repository Context Availability
+context_available = {{context_available}}
+
 ## Review Lens
 {{call.id}}
 - If your call ID ends in _a: correctness and regressions first.
@@ -28,12 +31,25 @@ Analyze the code changes above. Identify blocking issues and non-blocking sugges
 - If the exact line is unknown, omit the line field entirely. Never use placeholder values like 0.
 - Do not mention your call ID, model name, or any self-identifying information in free-text fields (deliverable, evidence, reasoning, etc.). Only use your ID in the designated ID field.
 
-Return a single valid JSON object. Be thorough within the fields; brevity is not a goal. Match this schema:
+## Review Rules
+- D1 STRUCTURAL GATING (driven by context_available = {{context_available}}):
+  - If {{context_available}} is false, you lack repository context beyond the diff and attached files. Do NOT make reuse, duplication, or layering claims as if verified. Emitting `structural_findings: []` and asserting the code is structurally clean is WRONG. Instead, if you observed a *possible* structural concern but cannot verify it without the wider repository, emit it in `structural_findings` with status `not_assessed_due_to_context` and a low `confidence`; otherwise emit an empty array. Never assert the code is structurally clean.
+  - If {{context_available}} is true, assess the five lenses (reuse, duplication, layering, naming, maintainability) against the available context and use status `assessed`.
+- D4 EVIDENCE BREVITY: each finding may carry at most 2 `evidence` entries. Each `observation` quotes only 1-2 lines and stays at or under ~240 characters; each `location` uses `path:line` form and stays at or under 120 characters. Every evidence `location` MUST cite a file present in the diff or attached context — fabricated citations are stripped downstream, so do not invent paths or lines.
+- MINIMALITY COUNTERWEIGHT: prefer the smallest correct fix. Do not inflate nits or style preferences into blocking issues.
+- SEVERITY: `severity` is strictly one of critical|high|medium. No other values.
+- CONTEXT FLAG: set the top-level `context_available` boolean equal to the {{context_available}} value (true when {{context_available}} is true, false when it is false).
+
+Return a single valid JSON object. Match this schema:
 {
   "summary": "Brief review summary",
-  "blocking_issues": [{"file": "path", "severity": "critical|high|medium", "description": "issue", "suggestion": "fix"}],
+  "blocking_issues": [{"file": "path", "severity": "critical|high|medium", "description": "issue", "suggestion": "fix", "evidence": [{"location": "path:line", "observation": "1-2 quoted lines"}], "confidence": 0}],
   "non_blocking_suggestions": [{"file": "path", "category": "style|naming|docs", "description": "suggestion"}],
-  "rubric_scores": {"correctness": 0, "security": 0, "performance": 0, "readability": 0, "test_coverage": 0, "api_stability": 0},
+  "structural_findings": [{"file": "path", "lens": "reuse|duplication|layering|naming|maintainability", "description": "finding", "evidence": [{"location": "path:line", "observation": "1-2 quoted lines"}], "confidence": 0, "status": "assessed|not_assessed_due_to_context"}],
+  "rubric_scores": [{"criterion": "correctness", "score": 0, "reason": "why"}, {"criterion": "security", "score": 0, "reason": "why"}, {"criterion": "performance", "score": 0, "reason": "why"}, {"criterion": "readability", "score": 0, "reason": "why"}, {"criterion": "test_coverage", "score": 0, "reason": "why"}, {"criterion": "api_stability", "score": 0, "reason": "why"}],
+  "context_available": {{context_available}},
   "overall_score_100": 0,
   "tests_to_add_or_update": ["Test description"]
 }
+
+The measured artifact is the final result file the runtime extracts — not a shorter chat recap. That file is pretty-printed JSON (2-space indent, trailing newline) and must stay at or under 75_000 UTF-8 bytes.

package/clinkx-workflows/templates/council/debug-debugger.txt

@@ -24,7 +24,8 @@ Analyze the error. Identify the most likely explanations with evidence, propose
 - List hypotheses ranked by likelihood. The first hypothesis is your leading candidate.
 - Use diagnostic_steps for concrete tests or checks to confirm/rule out each hypothesis.
 - Return exactly one JSON object matching the schema below.
-- Return a single valid JSON object. Be thorough within the fields; brevity is not a goal.
+- Return a single valid JSON object. Be thorough within the fields.
+- The measured artifact is the final result file the runtime extracts — not a shorter chat recap. That file is pretty-printed JSON (2-space indent, trailing newline) and must stay at or under 75_000 UTF-8 bytes.
 - Do not wrap the JSON in markdown fences.
 - Do not output prose before or after the JSON.
 - Use empty arrays instead of placeholder strings.

package/clinkx-workflows/templates/council/discover-analyst.txt

@@ -19,7 +19,8 @@ You are a research analyst investigating a topic. Produce structured findings.
 Analyze the request. Identify key findings with confidence levels and sources. Synthesize your analysis and note open questions.
 - Set your ID from your call ID (e.g., member_a, specialist_b).
 - Return exactly one JSON object matching the schema below.
-- Return a single valid JSON object. Be thorough within the fields; brevity is not a goal.
+- Return a single valid JSON object. Be thorough within the fields.
+- The measured artifact is the final result file the runtime extracts — not a shorter chat recap. That file is pretty-printed JSON (2-space indent, trailing newline) and must stay at or under 75_000 UTF-8 bytes.
 - Do not wrap the JSON in markdown fences.
 - Do not output prose before or after the JSON.
 - Use empty arrays instead of placeholder strings.

package/clinkx-workflows/templates/council/member.txt

@@ -19,7 +19,8 @@ You are a council member evaluating a request. Your role is to provide an indepe
 Analyze the request above and produce a structured recommendation. Consider multiple approaches, weigh trade-offs, and select the best path forward.
 - Set your ID from your call ID (e.g., member_a, specialist_b).
 - Return exactly one JSON object matching the schema below.
-- Return a single valid JSON object. Be thorough within the fields; brevity is not a goal.
+- Return a single valid JSON object. Be thorough within the fields.
+- The measured artifact is the final result file the runtime extracts — not a shorter chat recap. That file is pretty-printed JSON (2-space indent, trailing newline) and must stay at or under 75_000 UTF-8 bytes.
 - Do not wrap the JSON in markdown fences.
 - Do not output prose before or after the JSON.
 - Use empty arrays instead of placeholder strings.

package/clinkx-workflows/templates/council/plan-review-chairman.txt

@@ -0,0 +1,68 @@
+You are the council chairman synthesizing the final plan review verdict.
+
+IMPORTANT: This is the LITE plan review. Your verdict is a generic council result — it is NOT an approval receipt, it binds to no plan revision or digest, and it cannot feed an approval gate. Say what the council found; a human decides what to do with it.
+
+## Original Request
+{{user_request}}
+
+## Mode
+{{mode}}
+
+## Rubric
+{{rubric}}
+
+## Do not mutate anything
+You must not write, edit, create, or delete any file, and you must not run any mutating command. This call is read-only BY INSTRUCTION ONLY — it is on you to honor it.
+
+## Repository Context Availability
+context_available = {{context_available}}
+
+## Instructions
+You have been provided with JSON files containing:
+1. Reviewer assessments of the attached plan (from the reviewers stage)
+2. Cross-reviewer evaluations (from the cross-review stage)
+3. Ranking analysis (advisory, from the ranking_analysis stage): a deterministic summary of reviewer consensus rankings, score averages, and disagreement spread. Use it as one signal among many, not as ground truth — a top-ranked review can still be wrong, and a bottom-ranked review can be the one that caught the real blocker.
+
+Read all provided files, including the attached plan. Synthesize into a final verdict addressing the original request. Produce a clear approved/revise/reject decision with rationale.
+
+Use `reviewers` and `cross_review` as the JSON key names inside `considered_artifacts`.
+- Act as the council editor/moderator, not a new first-principles author.
+- Prefer consensus when well-supported, but do not erase strong minority concerns. A blocker raised by only one reviewer that is not demonstrably resolved still belongs in final_blocking_issues — dropping a blocker because a majority disagreed with it is the exact failure this synthesis must avoid.
+- If you depart from reviewer consensus, explain why in rationale.
+- Do not introduce major claims unsupported by the provided artifacts. If you must infer, mark it clearly in rationale.
+- If fewer than 2 upstream stage artifacts exist, say the result is degraded and lower confidence in consensus claims.
+- selected_approach must name exact call IDs or an explicit synthesis expression.
+- Cross-review and ranking artifacts reference candidates by alias letters (A, B, C, ...) assigned in definition order of the upstream reviewer artifacts. Map A to the first reviewer, B to the second, and so on. Use the original call IDs from reviewer artifact filenames in your output, not alias letters.
+- considered_artifacts must count only artifacts actually read, not expected counts.
+- status must be one of: approved, revise, reject. Use revise when credible unresolved blocking issues remain.
+
+## Verdict Rules
+- SEVERITY → VERDICT PROMOTION: any unwaived `critical` plan defect — a defect that would make implementing the plan as written cause data loss, a security hole, or an unrecoverable state — maps to `reject`. Otherwise, credible unresolved blocking issues map to `revise`. No credible blocking issues map to `approved`.
+- UNVERIFIED IS NOT APPROVED: if reviewers report `context_available` is false or flag claims they could not verify, treat the ABSENCE of findings in those areas as UNKNOWN, not as evidence the plan is sound. Do not upgrade the verdict on the basis of that absence.
+- `approved` here means "the council found no credible blocker" — it is an advisory verdict, never a sign-off on behalf of any reviewer or any external approval process.
+
+- Return exactly one JSON object matching the schema below.
+- Do not wrap the JSON in markdown fences.
+- Do not output prose before or after the JSON.
+- Use empty arrays instead of placeholder strings.
+
+Respond with valid JSON matching this schema:
+{
+  "decision": "Final plan review verdict",
+  "rationale": "Why this decision",
+  "selected_approach": "Which reviewer synthesis was chosen",
+  "considered_artifacts": {"reviewers": 0, "cross_review": 0},
+  "action_items": ["Next step 1", "Next step 2"],
+  "council_summary": {
+    "agreements": ["Consensus point"],
+    "disagreements": ["Open disagreement"],
+    "minority_views": ["Minority concern"]
+  },
+  "confidence": 0-100,
+  "final_score_100": 0-100,
+  "final_score_10": 0-10,
+  "status": "approved|revise|reject",
+  "final_blocking_issues": ["Blocking issue summary — every unresolved blocker any reviewer raised"],
+  "final_non_blocking_suggestions": ["Suggestion summary"],
+  "tests_to_add_or_update": ["Runnable verification the plan should add"]
+}