@ghcrawl/api-core 0.7.1 → 0.8.0-beta.1

package/dist/cluster/build.d.ts

@@ -12,5 +12,35 @@ export declare function buildClusters(nodes: Node[], edges: SimilarityEdge[]): A
     representativeThreadId: number;
     members: number[];
 }>;
+/**
+ * Build clusters with size-bounded Union-Find.
+ *
+ * Process edges from highest to lowest score, merging components only when
+ * the combined size stays within `maxClusterSize`. Strongest connections are
+ * preserved; weaker edges that would create oversized clusters are skipped.
+ * This avoids the "threshold raising" problem where splitting mega-clusters
+ * creates many solos.
+ */
+export declare function buildSizeBoundedClusters(nodes: Node[], edges: SimilarityEdge[], options: {
+    maxClusterSize: number;
+}): Array<{
+    representativeThreadId: number;
+    members: number[];
+}>;
+/**
+ * Build clusters with iterative refinement of oversized components.
+ *
+ * 1. Run Union-Find at the base threshold (edges already filtered by minScore).
+ * 2. For any cluster above `maxClusterSize`, re-cluster its members using only
+ *    edges above a progressively higher threshold (raised by `refineStep` each
+ *    iteration) until all clusters are within limits or threshold reaches 1.0.
+ */
+export declare function buildRefinedClusters(nodes: Node[], edges: SimilarityEdge[], options: {
+    maxClusterSize: number;
+    refineStep: number;
+}): Array<{
+    representativeThreadId: number;
+    members: number[];
+}>;
 export {};
 //# sourceMappingURL=build.d.ts.map

package/dist/cluster/build.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../src/cluster/build.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,cAAc,GAAG;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,KAAK,IAAI,GAAG;IACV,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AA8BF,wBAAgB,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC;IAAE,sBAAsB,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,CAiClI"}
+{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../src/cluster/build.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,cAAc,GAAG;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,KAAK,IAAI,GAAG;IACV,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AA4DF,wBAAgB,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC;IAAE,sBAAsB,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,CAclI;AAED;;;;;;;;GAQG;AACH,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,IAAI,EAAE,EACb,KAAK,EAAE,cAAc,EAAE,EACvB,OAAO,EAAE;IAAE,cAAc,EAAE,MAAM,CAAA;CAAE,GAClC,KAAK,CAAC;IAAE,sBAAsB,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,CAuB9D;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,IAAI,EAAE,EACb,KAAK,EAAE,cAAc,EAAE,EACvB,OAAO,EAAE;IAAE,cAAc,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GACtD,KAAK,CAAC;IAAE,sBAAsB,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,CA0F9D"}

package/dist/cluster/build.js

@@ -1,28 +1,56 @@
 class UnionFind {
     parent = new Map();
+    size = new Map();
     add(value) {
-        if (!this.parent.has(value))
+        if (!this.parent.has(value)) {
             this.parent.set(value, value);
+            this.size.set(value, 1);
+        }
     }
     find(value) {
-        const parent = this.parent.get(value);
+        let parent = this.parent.get(value);
         if (parent === undefined) {
             this.parent.set(value, value);
+            this.size.set(value, 1);
             return value;
         }
-        if (parent === value)
-            return value;
-        const root = this.find(parent);
-        this.parent.set(value, root);
-        return root;
+        // Iterative path-finding to avoid stack overflow on deep chains
+        let current = value;
+        while (parent !== current) {
+            const grandparent = this.parent.get(parent) ?? parent;
+            this.parent.set(current, grandparent); // path splitting
+            current = parent;
+            parent = grandparent;
+        }
+        return current;
     }
     union(left, right) {
         const leftRoot = this.find(left);
         const rightRoot = this.find(right);
         if (leftRoot !== rightRoot) {
+            const leftSize = this.size.get(leftRoot) ?? 1;
+            const rightSize = this.size.get(rightRoot) ?? 1;
             this.parent.set(rightRoot, leftRoot);
+            this.size.set(leftRoot, leftSize + rightSize);
         }
     }
+    /** Merge only if the combined component would not exceed maxSize. Returns true if merged. */
+    unionBounded(left, right, maxSize) {
+        const leftRoot = this.find(left);
+        const rightRoot = this.find(right);
+        if (leftRoot === rightRoot)
+            return true; // already same component
+        const leftSize = this.size.get(leftRoot) ?? 1;
+        const rightSize = this.size.get(rightRoot) ?? 1;
+        if (leftSize + rightSize > maxSize)
+            return false;
+        this.parent.set(rightRoot, leftRoot);
+        this.size.set(leftRoot, leftSize + rightSize);
+        return true;
+    }
+    getSize(value) {
+        return this.size.get(this.find(value)) ?? 1;
+    }
 }
 export function buildClusters(nodes, edges) {
     const uf = new UnionFind();
@@ -37,6 +65,149 @@ export function buildClusters(nodes, edges) {
         list.push(node.threadId);
         byRoot.set(root, list);
     }
+    return formatClusters(nodes, edges, byRoot);
+}
+/**
+ * Build clusters with size-bounded Union-Find.
+ *
+ * Process edges from highest to lowest score, merging components only when
+ * the combined size stays within `maxClusterSize`. Strongest connections are
+ * preserved; weaker edges that would create oversized clusters are skipped.
+ * This avoids the "threshold raising" problem where splitting mega-clusters
+ * creates many solos.
+ */
+export function buildSizeBoundedClusters(nodes, edges, options) {
+    const uf = new UnionFind();
+    for (const node of nodes)
+        uf.add(node.threadId);
+    // Sort edges by score descending — strongest connections first
+    const sortedEdges = [...edges].sort((a, b) => b.score - a.score);
+    const keptEdges = [];
+    for (const edge of sortedEdges) {
+        if (uf.unionBounded(edge.leftThreadId, edge.rightThreadId, options.maxClusterSize)) {
+            keptEdges.push(edge);
+        }
+    }
+    const byRoot = new Map();
+    for (const node of nodes) {
+        const root = uf.find(node.threadId);
+        const list = byRoot.get(root) ?? [];
+        list.push(node.threadId);
+        byRoot.set(root, list);
+    }
+    return formatClusters(nodes, keptEdges, byRoot);
+}
+/**
+ * Build clusters with iterative refinement of oversized components.
+ *
+ * 1. Run Union-Find at the base threshold (edges already filtered by minScore).
+ * 2. For any cluster above `maxClusterSize`, re-cluster its members using only
+ *    edges above a progressively higher threshold (raised by `refineStep` each
+ *    iteration) until all clusters are within limits or threshold reaches 1.0.
+ */
+export function buildRefinedClusters(nodes, edges, options) {
+    const nodesById = new Map(nodes.map((node) => [node.threadId, node]));
+    const result = [];
+    // Initial Union-Find pass
+    const uf = new UnionFind();
+    for (const node of nodes)
+        uf.add(node.threadId);
+    for (const edge of edges)
+        uf.union(edge.leftThreadId, edge.rightThreadId);
+    const byRoot = new Map();
+    for (const node of nodes) {
+        const root = uf.find(node.threadId);
+        const list = byRoot.get(root) ?? [];
+        list.push(node.threadId);
+        byRoot.set(root, list);
+    }
+    // Build adjacency list for O(E) iteration instead of O(n²) pair scanning
+    const adjacency = new Map();
+    for (const edge of edges) {
+        let list = adjacency.get(edge.leftThreadId);
+        if (!list) {
+            list = [];
+            adjacency.set(edge.leftThreadId, list);
+        }
+        list.push(edge);
+        let rList = adjacency.get(edge.rightThreadId);
+        if (!rList) {
+            rList = [];
+            adjacency.set(edge.rightThreadId, rList);
+        }
+        rList.push(edge);
+    }
+    const workQueue = [];
+    for (const members of byRoot.values()) {
+        if (members.length <= options.maxClusterSize) {
+            const clusterNodes = members.map((id) => nodesById.get(id)).filter((n) => n !== undefined);
+            const clusterEdges = edgesWithinSet(new Set(members), adjacency);
+            result.push(...formatClusters(clusterNodes, clusterEdges, new Map([[0, members]])));
+        }
+        else {
+            workQueue.push({ memberIds: members, currentThreshold: 0 });
+        }
+    }
+    // Iteratively refine oversized clusters
+    while (workQueue.length > 0) {
+        const item = workQueue.pop();
+        const newThreshold = item.currentThreshold + options.refineStep;
+        if (newThreshold >= 1.0) {
+            for (const memberId of item.memberIds) {
+                result.push({ representativeThreadId: memberId, members: [memberId] });
+            }
+            continue;
+        }
+        // Filter edges within this component to the higher threshold
+        const memberSet = new Set(item.memberIds);
+        const filteredEdges = [];
+        for (const memberId of item.memberIds) {
+            for (const edge of adjacency.get(memberId) ?? []) {
+                const otherId = edge.leftThreadId === memberId ? edge.rightThreadId : edge.leftThreadId;
+                if (otherId > memberId && memberSet.has(otherId) && edge.score >= newThreshold) {
+                    filteredEdges.push(edge);
+                }
+            }
+        }
+        // Re-cluster with filtered edges
+        const subUf = new UnionFind();
+        for (const memberId of item.memberIds)
+            subUf.add(memberId);
+        for (const edge of filteredEdges)
+            subUf.union(edge.leftThreadId, edge.rightThreadId);
+        const subByRoot = new Map();
+        for (const memberId of item.memberIds) {
+            const root = subUf.find(memberId);
+            const list = subByRoot.get(root) ?? [];
+            list.push(memberId);
+            subByRoot.set(root, list);
+        }
+        for (const subMembers of subByRoot.values()) {
+            if (subMembers.length <= options.maxClusterSize) {
+                const clusterNodes = subMembers.map((id) => nodesById.get(id)).filter((n) => n !== undefined);
+                const clusterEdges = edgesWithinSet(new Set(subMembers), adjacency);
+                result.push(...formatClusters(clusterNodes, clusterEdges, new Map([[0, subMembers]])));
+            }
+            else {
+                workQueue.push({ memberIds: subMembers, currentThreshold: newThreshold });
+            }
+        }
+    }
+    return result.sort((left, right) => right.members.length - left.members.length);
+}
+function edgesWithinSet(memberSet, adjacency) {
+    const edges = [];
+    for (const memberId of memberSet) {
+        for (const edge of adjacency.get(memberId) ?? []) {
+            const otherId = edge.leftThreadId === memberId ? edge.rightThreadId : edge.leftThreadId;
+            if (otherId > memberId && memberSet.has(otherId)) {
+                edges.push(edge);
+            }
+        }
+    }
+    return edges;
+}
+function formatClusters(nodes, edges, byRoot) {
     const edgeCounts = new Map();
     for (const edge of edges) {
         edgeCounts.set(edge.leftThreadId, (edgeCounts.get(edge.leftThreadId) ?? 0) + 1);

package/dist/cluster/build.js.map

@@ -1 +1 @@
-{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/cluster/build.ts"],"names":[],"mappings":"AAYA,MAAM,SAAS;IACI,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEpD,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IAED,IAAI,CAAC,KAAa;QAChB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC9B,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,IAAY,EAAE,KAAa;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;CACF;AAED,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,KAAuB;IAClE,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAE1E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACtE,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;SAC/B,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QACf,MAAM,cAAc,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE;YAC3D,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACjF,IAAI,SAAS,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC;YACtC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAO,MAAM,GAAG,OAAO,CAAC;YAC7C,OAAO,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACN,OAAO,EAAE,sBAAsB,EAAE,cAAc,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;IAC1G,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AACvE,CAAC"}
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/cluster/build.ts"],"names":[],"mappings":"AAYA,MAAM,SAAS;IACI,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnC,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,IAAI,CAAC,KAAa;QAChB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,gEAAgE;QAChE,IAAI,OAAO,GAAW,KAAK,CAAC;QAC5B,OAAO,MAAM,KAAK,OAAO,EAAE,CAAC;YAC1B,MAAM,WAAW,GAAW,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC;YAC9D,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,iBAAiB;YACxD,OAAO,GAAG,MAAM,CAAC;YACjB,MAAM,GAAG,WAAW,CAAC;QACvB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAY,EAAE,KAAa;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,6FAA6F;IAC7F,YAAY,CAAC,IAAY,EAAE,KAAa,EAAE,OAAe;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,CAAC,yBAAyB;QAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,QAAQ,GAAG,SAAS,GAAG,OAAO;YAAE,OAAO,KAAK,CAAC;QACjD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,KAAa;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;CACF;AAED,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,KAAuB;IAClE,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAE1E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAAa,EACb,KAAuB,EACvB,OAAmC;IAEnC,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAEhD,+DAA+D;IAC/D,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACjE,MAAM,SAAS,GAAqB,EAAE,CAAC;IAEvC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;YACnF,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAa,EACb,KAAuB,EACvB,OAAuD;IAEvD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,MAAM,GAAiE,EAAE,CAAC;IAEhF,0BAA0B;IAC1B,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IAE1E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,yEAAyE;IACzE,MAAM,SAAS,GAAG,IAAI,GAAG,EAA4B,CAAC;IACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,EAAE,CAAC;YAAC,IAAI,GAAG,EAAE,CAAC;YAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAAC,CAAC;QACjE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;YAAC,KAAK,GAAG,EAAE,CAAC;YAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAAC,CAAC;QACrE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAID,MAAM,SAAS,GAAe,EAAE,CAAC;IAEjC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;YAC7C,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YACtG,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC;YACjE,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,YAAY,EAAE,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAG,CAAC;QAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,UAAU,CAAC;QAChE,IAAI,YAAY,IAAI,GAAG,EAAE,CAAC;YACxB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACtC,MAAM,CAAC,IAAI,CAAC,EAAE,sBAAsB,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzE,CAAC;YACD,SAAS;QACX,CAAC;QAED,6DAA6D;QAC7D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;gBACxF,IAAI,OAAO,GAAG,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,YAAY,EAAE,CAAC;oBAC/E,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC9B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS;YAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3D,KAAK,MAAM,IAAI,IAAI,aAAa;YAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAErF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC9C,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,IAAI,UAAU,CAAC,MAAM,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;gBAChD,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;gBACzG,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;gBACpE,MAAM,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,YAAY,EAAE,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzF,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,gBAAgB,EAAE,YAAY,EAAE,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AAClF,CAAC;AAED,SAAS,cAAc,CAAC,SAAsB,EAAE,SAAwC;IACtF,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;YACxF,IAAI,OAAO,GAAG,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CACrB,KAAa,EACb,KAAuB,EACvB,MAA6B;IAE7B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACtE,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;SAC/B,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QACf,MAAM,cAAc,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE;YAC3D,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACjF,IAAI,SAAS,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC;YACtC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,OAAO,MAAM,GAAG,OAAO,CAAC;YAC7C,OAAO,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACN,OAAO,EAAE,sBAAsB,EAAE,cAAc,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;IAC1G,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AACvE,CAAC"}

package/dist/cluster/perf.integration.js

@@ -5,13 +5,32 @@ import path from 'node:path';
 import { performance } from 'node:perf_hooks';
 import { fileURLToPath } from 'node:url';
 import { GHCrawlService } from '../service.js';
-const BASELINE_PATH = fileURLToPath(new URL('./perf-baseline.json', import.meta.url));
+const DEFAULT_BASELINE_PATH = fileURLToPath(new URL('./perf-baseline.json', import.meta.url));
+function getBaselinePath() {
+    const configuredPath = process.env.GHCRAWL_CLUSTER_PERF_CONFIG_PATH?.trim();
+    return configuredPath ? path.resolve(configuredPath) : DEFAULT_BASELINE_PATH;
+}
 function loadBaseline() {
-    return JSON.parse(fs.readFileSync(BASELINE_PATH, 'utf8'));
+    return JSON.parse(fs.readFileSync(getBaselinePath(), 'utf8'));
 }
 function shouldBootstrapBaseline() {
     return process.env.GHCRAWL_CLUSTER_PERF_BOOTSTRAP === '1';
 }
+function shouldIgnoreRegressionThreshold() {
+    return process.env.GHCRAWL_CLUSTER_PERF_IGNORE_THRESHOLD === '1';
+}
+function getPerfBackend() {
+    return process.env.GHCRAWL_CLUSTER_PERF_BACKEND === 'vectorlite' ? 'vectorlite' : 'exact';
+}
+function assertBenchmarkShape(result, baseline, backend) {
+    if (backend === 'exact' && baseline.fixture.assertExactClusterCount !== false) {
+        assert.equal(result.clusters, baseline.fixture.clusterCount);
+    }
+    else {
+        assert.ok(result.clusters > 0);
+    }
+    assert.ok(result.edges > baseline.fixture.clusterCount);
+}
 function formatDurationMs(durationMs) {
     if (!Number.isFinite(durationMs))
         return 'n/a';
@@ -26,6 +45,14 @@ function formatDurationMs(durationMs) {
     const seconds = totalSeconds - minutes * 60;
     return `${minutes}m ${seconds.toFixed(1)}s`;
 }
+function formatBytes(bytes) {
+    if (!Number.isFinite(bytes))
+        return 'n/a';
+    if (bytes < 1024 * 1024) {
+        return `${(bytes / 1024).toFixed(1)} KiB`;
+    }
+    return `${(bytes / (1024 * 1024)).toFixed(1)} MiB`;
+}
 function formatPercent(value) {
     const sign = value > 0 ? '+' : '';
     return `${sign}${value.toFixed(1)}%`;
@@ -38,6 +65,22 @@ function median(values) {
     }
     return sorted[middle] ?? 0;
 }
+function roundFixtureMedianMs(value) {
+    return Number(value.toFixed(1));
+}
+function roundProjectedOpenclawMs(value) {
+    return Math.round(value);
+}
+function buildSuggestedBaseline(result) {
+    const shouldSuggest = result.deltaPercent < 0 || result.baselineMedianMs === result.medianMs;
+    if (!shouldSuggest) {
+        return null;
+    }
+    return {
+        fixtureMedianMs: roundFixtureMedianMs(result.medianMs),
+        projectedOpenclawMs: roundProjectedOpenclawMs(result.projectedOpenclawMs),
+    };
+}
 function createGitHubStub() {
     return {
         checkAuth: async () => undefined,
@@ -67,6 +110,8 @@ function createService(dbPath) {
             openaiApiKeySource: 'none',
             summaryModel: 'gpt-5-mini',
             embedModel: 'text-embedding-3-large',
+            embeddingBasis: 'title_original',
+            vectorBackend: 'vectorlite',
             embedBatchSize: 2,
             embedConcurrency: 2,
             embedMaxUnread: 4,
@@ -144,26 +189,64 @@ function seedBenchmarkDatabase(dbPath, baseline) {
         service.close();
     }
 }
-async function runSingleCluster(dbPath, baseline) {
+async function runSingleCluster(dbPath, baseline, backend) {
     const service = createService(dbPath);
     try {
-        const startedAt = performance.now();
-        const result = await service.clusterRepository({
+        // clusterExperiment may not exist on older branches (e.g. base worktree in CI)
+        if (typeof service.clusterExperiment !== 'function') {
+            const startedAt = performance.now();
+            const result = await service.clusterRepository({
+                owner: 'openclaw',
+                repo: 'openclaw',
+                k: baseline.fixture.k,
+                minScore: baseline.fixture.minScore,
+            });
+            const durationMs = performance.now() - startedAt;
+            return {
+                durationMs,
+                totalDurationMs: durationMs,
+                loadMs: 0,
+                setupMs: 0,
+                edgeBuildMs: durationMs,
+                indexBuildMs: 0,
+                queryMs: 0,
+                clusterBuildMs: 0,
+                peakRssBytes: 0,
+                peakHeapUsedBytes: 0,
+                clusters: result.clusters,
+                edges: result.edges,
+            };
+        }
+        const result = service.clusterExperiment({
             owner: 'openclaw',
             repo: 'openclaw',
+            backend,
             k: baseline.fixture.k,
             minScore: baseline.fixture.minScore,
         });
-        const durationMs = performance.now() - startedAt;
-        return { durationMs, clusters: result.clusters, edges: result.edges };
+        return {
+            durationMs: result.durationMs,
+            totalDurationMs: result.totalDurationMs,
+            loadMs: result.loadMs,
+            setupMs: result.setupMs,
+            edgeBuildMs: result.edgeBuildMs,
+            indexBuildMs: result.indexBuildMs,
+            queryMs: result.queryMs,
+            clusterBuildMs: result.clusterBuildMs,
+            peakRssBytes: result.memory.peakRssBytes,
+            peakHeapUsedBytes: result.memory.peakHeapUsedBytes,
+            clusters: result.clusters,
+            edges: result.edges,
+        };
     }
     finally {
         service.close();
     }
 }
 async function measureBenchmark(baseline) {
+    const backend = getPerfBackend();
     if (baseline.baseline.fixtureMedianMs <= 0 && !shouldBootstrapBaseline()) {
-        throw new Error(`Cluster perf baseline is not set in ${BASELINE_PATH}. Run the benchmark once, then record fixtureMedianMs before enforcing regressions.`);
+        throw new Error(`Cluster perf baseline is not set in ${getBaselinePath()}. Run the benchmark once, then record fixtureMedianMs before enforcing regressions.`);
     }
     const tempRoot = fs.mkdtempSync(path.join(os.tmpdir(), 'ghcrawl-cluster-perf-'));
     const seedDbPath = path.join(tempRoot, 'seed.sqlite');
@@ -172,32 +255,76 @@ async function measureBenchmark(baseline) {
         const warmupRuns = baseline.benchmark.warmupRuns;
         const runsPerSample = baseline.benchmark.runsPerSample;
         const sampleDurationsMs = [];
+        const totalSampleDurationsMs = [];
+        const loadSampleDurationsMs = [];
+        const setupSampleDurationsMs = [];
+        const edgeBuildSampleDurationsMs = [];
+        const indexBuildSampleDurationsMs = [];
+        const querySampleDurationsMs = [];
+        const clusterBuildSampleDurationsMs = [];
+        const peakRssBytesSamples = [];
+        const peakHeapUsedBytesSamples = [];
         const benchmarkStartedAt = performance.now();
         let runCounter = 0;
         for (let warmupIndex = 0; warmupIndex < warmupRuns; warmupIndex += 1) {
             const warmupDbPath = path.join(tempRoot, `warmup-${warmupIndex}.sqlite`);
             fs.copyFileSync(seedDbPath, warmupDbPath);
-            const warmupResult = await runSingleCluster(warmupDbPath, baseline);
-            assert.equal(warmupResult.clusters, baseline.fixture.clusterCount);
-            assert.ok(warmupResult.edges > baseline.fixture.clusterCount);
+            const warmupResult = await runSingleCluster(warmupDbPath, baseline, backend);
+            assertBenchmarkShape(warmupResult, baseline, backend);
         }
         while (sampleDurationsMs.length < baseline.benchmark.maxSamples) {
-            const sampleStartedAt = performance.now();
+            let sampleDurationMs = 0;
+            let totalSampleDurationMs = 0;
+            let loadSampleDurationMs = 0;
+            let setupSampleDurationMs = 0;
+            let edgeBuildSampleDurationMs = 0;
+            let indexBuildSampleDurationMs = 0;
+            let querySampleDurationMs = 0;
+            let clusterBuildSampleDurationMs = 0;
+            let samplePeakRssBytes = 0;
+            let samplePeakHeapUsedBytes = 0;
             for (let runIndex = 0; runIndex < runsPerSample; runIndex += 1) {
                 const runDbPath = path.join(tempRoot, `run-${runCounter}.sqlite`);
                 runCounter += 1;
                 fs.copyFileSync(seedDbPath, runDbPath);
-                const result = await runSingleCluster(runDbPath, baseline);
-                assert.equal(result.clusters, baseline.fixture.clusterCount);
-                assert.ok(result.edges > baseline.fixture.clusterCount);
+                const result = await runSingleCluster(runDbPath, baseline, backend);
+                assertBenchmarkShape(result, baseline, backend);
+                sampleDurationMs += result.durationMs;
+                totalSampleDurationMs += result.totalDurationMs;
+                loadSampleDurationMs += result.loadMs;
+                setupSampleDurationMs += result.setupMs;
+                edgeBuildSampleDurationMs += result.edgeBuildMs;
+                indexBuildSampleDurationMs += result.indexBuildMs;
+                querySampleDurationMs += result.queryMs;
+                clusterBuildSampleDurationMs += result.clusterBuildMs;
+                samplePeakRssBytes = Math.max(samplePeakRssBytes, result.peakRssBytes);
+                samplePeakHeapUsedBytes = Math.max(samplePeakHeapUsedBytes, result.peakHeapUsedBytes);
             }
-            sampleDurationsMs.push(performance.now() - sampleStartedAt);
+            sampleDurationsMs.push(sampleDurationMs);
+            totalSampleDurationsMs.push(totalSampleDurationMs);
+            loadSampleDurationsMs.push(loadSampleDurationMs);
+            setupSampleDurationsMs.push(setupSampleDurationMs);
+            edgeBuildSampleDurationsMs.push(edgeBuildSampleDurationMs);
+            indexBuildSampleDurationsMs.push(indexBuildSampleDurationMs);
+            querySampleDurationsMs.push(querySampleDurationMs);
+            clusterBuildSampleDurationsMs.push(clusterBuildSampleDurationMs);
+            peakRssBytesSamples.push(samplePeakRssBytes);
+            peakHeapUsedBytesSamples.push(samplePeakHeapUsedBytes);
             const elapsedMs = performance.now() - benchmarkStartedAt;
             if (sampleDurationsMs.length >= baseline.benchmark.minSamples && elapsedMs >= baseline.benchmark.maxTotalMs) {
                 break;
             }
         }
         const medianMs = median(sampleDurationsMs);
+        const totalMedianMs = median(totalSampleDurationsMs);
+        const loadMedianMs = median(loadSampleDurationsMs);
+        const setupMedianMs = median(setupSampleDurationsMs);
+        const edgeBuildMedianMs = median(edgeBuildSampleDurationsMs);
+        const indexBuildMedianMs = median(indexBuildSampleDurationsMs);
+        const queryMedianMs = median(querySampleDurationsMs);
+        const clusterBuildMedianMs = median(clusterBuildSampleDurationsMs);
+        const medianPeakRssBytes = median(peakRssBytesSamples);
+        const medianPeakHeapUsedBytes = median(peakHeapUsedBytesSamples);
         const baselineMedianMs = baseline.baseline.fixtureMedianMs > 0 ? baseline.baseline.fixtureMedianMs : medianMs;
         const deltaMs = medianMs - baselineMedianMs;
         const deltaPercent = baselineMedianMs > 0 ? (deltaMs / baselineMedianMs) * 100 : 0;
@@ -206,8 +333,28 @@ async function measureBenchmark(baseline) {
         const projectedDeltaMs = projectedOpenclawMs - projectedBaselineOpenclawMs;
         const projectedDeltaPercent = (projectedDeltaMs / projectedBaselineOpenclawMs) * 100;
         return {
+            backend,
+            timingBasis: 'cluster-only',
             sampleDurationsMs,
+            totalSampleDurationsMs,
+            loadSampleDurationsMs,
+            setupSampleDurationsMs,
+            edgeBuildSampleDurationsMs,
+            indexBuildSampleDurationsMs,
+            querySampleDurationsMs,
+            clusterBuildSampleDurationsMs,
+            peakRssBytesSamples,
+            peakHeapUsedBytesSamples,
             medianMs,
+            totalMedianMs,
+            loadMedianMs,
+            setupMedianMs,
+            edgeBuildMedianMs,
+            indexBuildMedianMs,
+            queryMedianMs,
+            clusterBuildMedianMs,
+            medianPeakRssBytes,
+            medianPeakHeapUsedBytes,
             baselineMedianMs,
             deltaMs,
             deltaPercent,
@@ -229,14 +376,30 @@ async function measureBenchmark(baseline) {
 function buildSummary(result) {
     const status = result.deltaPercent > result.maxRegressionPercent ? 'FAIL' : 'PASS';
     const sampleList = result.sampleDurationsMs.map((value) => formatDurationMs(value)).join(', ');
+    const suggestedBaseline = buildSuggestedBaseline(result);
+    const timingLabel = 'Fixture median';
     const bootstrapLine = result.baselineMedianMs === result.medianMs
         ? '- Bootstrap mode: using the current fixture median as the provisional baseline'
         : null;
+    const suggestedBaselineLine = suggestedBaseline
+        ? `- Suggested baseline update: ${JSON.stringify(suggestedBaseline)}`
+        : null;
     return [
         '## Cluster Performance',
         '',
+        `- Backend: ${result.backend}`,
+        `- Timing basis: ${result.timingBasis}`,
         `- Status: ${status}`,
-        `- Fixture median: ${formatDurationMs(result.medianMs)} (${result.samples} samples, ${result.runsPerSample} cluster rebuilds/sample)`,
+        `- Fixture median (cluster-only): ${formatDurationMs(result.medianMs)} (${result.samples} samples, ${result.runsPerSample} cluster rebuilds/sample)`,
+        `- Fixture median (total run): ${formatDurationMs(result.totalMedianMs)}`,
+        `- Fixture median load stage: ${formatDurationMs(result.loadMedianMs)}`,
+        `- Fixture median setup stage: ${formatDurationMs(result.setupMedianMs)}`,
+        `- Fixture median exact edge-build stage: ${formatDurationMs(result.edgeBuildMedianMs)}`,
+        `- Fixture median vector index-build stage: ${formatDurationMs(result.indexBuildMedianMs)}`,
+        `- Fixture median vector query stage: ${formatDurationMs(result.queryMedianMs)}`,
+        `- Fixture median cluster-assembly stage: ${formatDurationMs(result.clusterBuildMedianMs)}`,
+        `- Median peak RSS: ${formatBytes(result.medianPeakRssBytes)}`,
+        `- Median peak heap used: ${formatBytes(result.medianPeakHeapUsedBytes)}`,
         `- Fixture baseline: ${formatDurationMs(result.baselineMedianMs)}`,
         `- Fixture delta: ${formatDurationMs(result.deltaMs)} (${formatPercent(result.deltaPercent)})`,
         `- Projected openclaw/openclaw duration: ${formatDurationMs(result.projectedOpenclawMs)}`,
@@ -245,6 +408,7 @@ function buildSummary(result) {
         `- Regression threshold: ${formatPercent(result.maxRegressionPercent)}`,
         `- Fixture shape: ${result.threadCount} threads x ${result.sourceKinds.length} source kinds`,
         `- Sample durations: ${sampleList}`,
+        suggestedBaselineLine,
         bootstrapLine,
         '',
     ]
@@ -261,6 +425,7 @@ function writeOutput(result, summary, bootstrap) {
         status: result.deltaPercent > result.maxRegressionPercent ? 'FAIL' : 'PASS',
         bootstrap,
         summary,
+        suggestedBaseline: buildSuggestedBaseline(result),
         result,
     }, null, 2) + '\n');
 }
@@ -269,10 +434,11 @@ async function main() {
     const result = await measureBenchmark(baseline);
     const summary = buildSummary(result);
     const bootstrap = shouldBootstrapBaseline();
-    const shouldFail = !bootstrap && result.deltaPercent > result.maxRegressionPercent;
+    const shouldFail = !bootstrap && !shouldIgnoreRegressionThreshold() && result.deltaPercent > result.maxRegressionPercent;
     process.stdout.write(`${summary}\n`);
-    if (bootstrap) {
-        process.stdout.write(`Suggested fixtureMedianMs: ${result.medianMs.toFixed(1)}\n`);
+    const suggestedBaseline = buildSuggestedBaseline(result);
+    if (bootstrap && suggestedBaseline) {
+        process.stdout.write(`Suggested baseline update: ${JSON.stringify(suggestedBaseline)}\n`);
     }
     const summaryPath = process.env.GITHUB_STEP_SUMMARY;
     if (summaryPath) {