daftari 1.13.1 → 1.15.0

package/dist/curation/tension-blast.js

@@ -0,0 +1,223 @@
+// Tension blast radius — Phase 3 of the tension graph plan (2026-05-31).
+//
+// "Blast" is the transitive closure of downstream documents that cite or
+// depend on a contested node. Given either a single document or a tension
+// cluster, this surface walks the dependency graph and reports the docs
+// exposed to that contested state.
+//
+// Two edge types (spec, Gap 5):
+//   - frontmatter `sources` array → "source" edges (primary, high-confidence).
+//   - in-vault markdown links     → "link" edges  (advisory).
+//
+// `superseded_by` is NOT a blast edge. A doc that supersedes a contested doc
+// is the *replacement*, not an inheritor — walking the blast through that
+// relationship would falsely contaminate the resolution path. The existing
+// `deprecated-still-linked` lint check covers the related-but-different
+// question of deprecated docs still being cited.
+//
+// Two confidence channels (spec, Gap 6):
+//   - `primary_blast`: count of downstream docs that have at least one
+//     incoming source edge from a visited node (a contested member or a doc
+//     already in the downstream set).
+//   - `advisory_blast`: count of downstream docs reached only via link edges.
+//
+// A doc reachable via both edge types counts as primary — higher-confidence
+// wins. The per-immediate-edge rule matches the spec's "reached via both edge
+// types" wording: from the downstream doc's perspective, does any visited
+// predecessor cite it via the `sources` frontmatter array?
+//
+// Two input modes (spec, Gap 7):
+//   - document mode: blast for a single doc. Response also identifies the
+//     containing cluster (if any) so the agent sees the broader region.
+//   - cluster mode: blast for the union of all cluster members. Seeds are
+//     never reported as downstream of themselves.
+//
+// Computation is on-demand — we build the reverse-source and reverse-link
+// maps at tool-call time from the loaded docs. There is no maintained graph.
+// Cycle protection is implicit: BFS marks nodes visited; a node is never
+// re-queued, so a sources b sources a terminates after one round trip.
+import { err, ok } from "../frontmatter/types.js";
+import { loadTensionClusters } from "./tension-clusters.js";
+import { buildPathIndexes, extractLinks, loadDocuments, resolveLink, } from "./vault-docs.js";
+// Reverse-source map: target doc → docs whose frontmatter `sources` cites
+// the target. Source paths are resolved through the same path-resolution
+// rules as in-vault links (exact match, .md suffix, relative-to-from,
+// basename), so author-written shorthand paths like `pricing/foo` line up
+// with the canonical `pricing/foo.md`. Unresolved sources (typos, links to
+// non-vault material) and self-citations are dropped.
+export function buildReverseSourceMap(docs) {
+    const reverse = new Map();
+    const { byPath, byBasename } = buildPathIndexes(docs);
+    for (const d of docs) {
+        for (const raw of d.frontmatter.sources ?? []) {
+            const target = resolveLink(raw, d.path, byPath, byBasename);
+            if (!target || target === d.path)
+                continue;
+            if (!reverse.has(target))
+                reverse.set(target, new Set());
+            reverse.get(target).add(d.path);
+        }
+    }
+    return reverse;
+}
+// Reverse-link map: target doc → docs whose body contains an in-vault
+// markdown or wikilink to the target. Mirrors lint's inbound-link map but
+// exposed as its own helper so blast and lint can't drift.
+export function buildReverseLinkMap(docs) {
+    const reverse = new Map();
+    const { byPath, byBasename } = buildPathIndexes(docs);
+    for (const d of docs) {
+        for (const raw of extractLinks(d.content)) {
+            const target = resolveLink(raw, d.path, byPath, byBasename);
+            if (!target || target === d.path)
+                continue;
+            if (!reverse.has(target))
+                reverse.set(target, new Set());
+            reverse.get(target).add(d.path);
+        }
+    }
+    return reverse;
+}
+// Pure BFS over the combined edge set. Returns the sorted downstream list,
+// the two channel counts, and the max depth observed.
+//
+// Layered BFS guarantees `distance` is the minimum hop count from any seed;
+// the `visited` set is the cycle guard, so a doc is never re-queued.
+//
+// Channel assignment is per-immediate-edge: a downstream doc D is "source"
+// iff some visited node V (a seed or another downstream doc) has D in its
+// reverse-source successor list, i.e. D's frontmatter cites V. Otherwise D
+// is "link". This matches the spec's "reached via both edge types counts as
+// primary" wording while staying decidable from the dependency graph alone.
+export function computeBlast(args) {
+    const { seeds, reverseSource, reverseLink } = args;
+    const seedSet = new Set(seeds);
+    const visited = new Set(seeds);
+    const distance = new Map();
+    let frontier = new Set(seeds);
+    let depth = 0;
+    while (frontier.size > 0) {
+        const next = new Set();
+        for (const node of frontier) {
+            const successors = new Set();
+            for (const s of reverseSource.get(node) ?? [])
+                successors.add(s);
+            for (const s of reverseLink.get(node) ?? [])
+                successors.add(s);
+            for (const succ of successors) {
+                if (visited.has(succ))
+                    continue;
+                visited.add(succ);
+                distance.set(succ, depth + 1);
+                next.add(succ);
+            }
+        }
+        frontier = next;
+        depth += 1;
+    }
+    // primaryDownstream: every doc that has at least one incoming source edge
+    // from a visited node. Built by iterating each visited node's
+    // reverse-source successors; we exclude seeds because the response only
+    // surfaces downstream-of-the-contested-set, never the contested set
+    // itself.
+    const primaryDownstream = new Set();
+    for (const v of visited) {
+        for (const child of reverseSource.get(v) ?? []) {
+            if (seedSet.has(child))
+                continue;
+            primaryDownstream.add(child);
+        }
+    }
+    const entries = [];
+    for (const [path, dist] of distance) {
+        const dependency_type = primaryDownstream.has(path) ? "source" : "link";
+        entries.push({ path, dependency_type, distance: dist });
+    }
+    entries.sort((a, b) => {
+        if (a.distance !== b.distance)
+            return a.distance - b.distance;
+        if (a.dependency_type !== b.dependency_type) {
+            return a.dependency_type === "source" ? -1 : 1;
+        }
+        return a.path < b.path ? -1 : a.path > b.path ? 1 : 0;
+    });
+    let primary_blast = 0;
+    let advisory_blast = 0;
+    let max_depth = 0;
+    for (const e of entries) {
+        if (e.dependency_type === "source")
+            primary_blast += 1;
+        else
+            advisory_blast += 1;
+        if (e.distance > max_depth)
+            max_depth = e.distance;
+    }
+    return { downstream: entries, primary_blast, advisory_blast, max_depth };
+}
+// Orchestration: validate the exactly-one-of input, load the docs and
+// clusters, resolve seeds, build the reverse maps, run the BFS, and assemble
+// the response. Returns a Result — tool handlers never throw.
+export async function computeTensionBlast(vaultRoot, input) {
+    const hasDoc = typeof input.document === "string" && input.document.length > 0;
+    const hasCluster = typeof input.cluster_id === "string" && input.cluster_id.length > 0;
+    if (hasDoc && hasCluster) {
+        return err(new Error("vault_tension_blast accepts exactly one of 'document' or 'cluster_id', not both"));
+    }
+    if (!hasDoc && !hasCluster) {
+        return err(new Error("vault_tension_blast requires exactly one of 'document' or 'cluster_id'"));
+    }
+    const docsResult = await loadDocuments(vaultRoot);
+    if (!docsResult.ok)
+        return docsResult;
+    const docs = docsResult.value;
+    const knownPaths = new Set(docs.map((d) => d.path));
+    const clustersResult = await loadTensionClusters(vaultRoot);
+    if (!clustersResult.ok)
+        return clustersResult;
+    const clusters = clustersResult.value.clusters;
+    let seeds;
+    let contested_document;
+    let cluster_id = null;
+    let cluster_documents = [];
+    if (hasDoc) {
+        const doc = input.document;
+        if (!knownPaths.has(doc)) {
+            return err(new Error(`vault_tension_blast: document not found in vault: ${doc}`));
+        }
+        contested_document = doc;
+        const containing = clusters.find((c) => c.documents.includes(doc));
+        if (containing) {
+            cluster_id = containing.id;
+            cluster_documents = [...containing.documents];
+        }
+        seeds = [doc];
+    }
+    else {
+        const id = input.cluster_id;
+        const found = clusters.find((c) => c.id === id);
+        if (!found) {
+            return err(new Error(`vault_tension_blast: cluster_id not found: ${id}`));
+        }
+        contested_document = null;
+        cluster_id = found.id;
+        cluster_documents = [...found.documents];
+        seeds = [...found.documents];
+    }
+    const reverseSource = buildReverseSourceMap(docs);
+    const reverseLink = buildReverseLinkMap(docs);
+    const { downstream, primary_blast, advisory_blast, max_depth } = computeBlast({
+        seeds,
+        reverseSource,
+        reverseLink,
+    });
+    return ok({
+        contested_document,
+        cluster_id,
+        cluster_documents,
+        downstream,
+        primary_blast,
+        advisory_blast,
+        max_depth,
+    });
+}
+//# sourceMappingURL=tension-blast.js.map

package/dist/curation/tension-blast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tension-blast.js","sourceRoot":"","sources":["../../src/curation/tension-blast.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,EAAE;AACF,yEAAyE;AACzE,0EAA0E;AAC1E,wEAAwE;AACxE,mCAAmC;AACnC,EAAE;AACF,gCAAgC;AAChC,+EAA+E;AAC/E,8DAA8D;AAC9D,EAAE;AACF,6EAA6E;AAC7E,0EAA0E;AAC1E,2EAA2E;AAC3E,wEAAwE;AACxE,iDAAiD;AACjD,EAAE;AACF,yCAAyC;AACzC,uEAAuE;AACvE,4EAA4E;AAC5E,sCAAsC;AACtC,8EAA8E;AAC9E,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,0EAA0E;AAC1E,2DAA2D;AAC3D,EAAE;AACF,iCAAiC;AACjC,0EAA0E;AAC1E,wEAAwE;AACxE,0EAA0E;AAC1E,kDAAkD;AAClD,EAAE;AACF,0EAA0E;AAC1E,6EAA6E;AAC7E,yEAAyE;AACzE,uEAAuE;AAEvE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAe,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EACL,gBAAgB,EAChB,YAAY,EAEZ,aAAa,EACb,WAAW,GACZ,MAAM,iBAAiB,CAAC;AA+BzB,0EAA0E;AAC1E,yEAAyE;AACzE,sEAAsE;AACtE,0EAA0E;AAC1E,2EAA2E;AAC3E,sDAAsD;AACtD,MAAM,UAAU,qBAAqB,CAAC,IAAiB;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,WAAW,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI;gBAAE,SAAS;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACxD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,sEAAsE;AACtE,0EAA0E;AAC1E,2DAA2D;AAC3D,MAAM,UAAU,mBAAmB,CAAC,IAAiB;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI;gBAAE,SAAS;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACxD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAeD,2EAA2E;AAC3E,sDAAsD;AACtD,EAAE;AACF,4EAA4E;AAC5E,qEAAqE;AACrE,EAAE;AACF,2EAA2E;AAC3E,0EAA0E;AAC1E,2EAA2E;AAC3E,4EAA4E;AAC5E,4EAA4E;AAC5E,MAAM,UAAU,YAAY,CAAC,IAAsB;IACjD,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjE,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IAED,0EAA0E;IAC1E,8DAA8D;IAC9D,wEAAwE;IACxE,oEAAoE;IACpE,UAAU;IACV,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YACjC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,MAAM,eAAe,GAAwB,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;QAC7F,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;YAAE,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC9D,IAAI,CAAC,CAAC,eAAe,KAAK,CAAC,CAAC,eAAe,EAAE,CAAC;YAC5C,OAAO,CAAC,CAAC,eAAe,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,eAAe,KAAK,QAAQ;YAAE,aAAa,IAAI,CAAC,CAAC;;YAClD,cAAc,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,QAAQ,GAAG,SAAS;YAAE,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC;IACrD,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,CAAC;AAC3E,CAAC;AAED,sEAAsE;AACtE,6EAA6E;AAC7E,8DAA8D;AAC9D,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,SAAiB,EACjB,KAAwB;IAExB,MAAM,MAAM,GAAG,OAAO,KAAK,CAAC,QAAQ,KAAK,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IACvF,IAAI,MAAM,IAAI,UAAU,EAAE,CAAC;QACzB,OAAO,GAAG,CACR,IAAI,KAAK,CAAC,iFAAiF,CAAC,CAC7F,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,wEAAwE,CAAC,CAAC,CAAC;IAClG,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,aAAa,CAAC,SAAS,CAAC,CAAC;IAClD,IAAI,CAAC,UAAU,CAAC,EAAE;QAAE,OAAO,UAAU,CAAC;IACtC,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC;IAC9B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEpD,MAAM,cAAc,GAAG,MAAM,mBAAmB,CAAC,SAAS,CAAC,CAAC;IAC5D,IAAI,CAAC,cAAc,CAAC,EAAE;QAAE,OAAO,cAAc,CAAC;IAC9C,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,QAAQ,CAAC;IAE/C,IAAI,KAAe,CAAC;IACpB,IAAI,kBAAiC,CAAC;IACtC,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,iBAAiB,GAAa,EAAE,CAAC;IAErC,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,KAAK,CAAC,QAAkB,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,qDAAqD,GAAG,EAAE,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,kBAAkB,GAAG,GAAG,CAAC;QACzB,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,IAAI,UAAU,EAAE,CAAC;YACf,UAAU,GAAG,UAAU,CAAC,EAAE,CAAC;YAC3B,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;SAAM,CAAC;QACN,MAAM,EAAE,GAAG,KAAK,CAAC,UAAoB,CAAC;QACtC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,8CAA8C,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5E,CAAC;QACD,kBAAkB,GAAG,IAAI,CAAC;QAC1B,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC;QACtB,iBAAiB,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;QACzC,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,aAAa,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAE9C,MAAM,EAAE,UAAU,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,GAAG,YAAY,CAAC;QAC5E,KAAK;QACL,aAAa;QACb,WAAW;KACZ,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;QACR,kBAAkB;QAClB,UAAU;QACV,iBAAiB;QACjB,UAAU;QACV,aAAa;QACb,cAAc;QACd,SAAS;KACV,CAAC,CAAC;AACL,CAAC"}

package/dist/curation/tension-clusters.d.ts

@@ -0,0 +1,18 @@
+import { type Result } from "../frontmatter/types.js";
+import { type TensionEntry, type TensionKind } from "./tension.js";
+export interface TensionCluster {
+    id: string;
+    size: number;
+    documents: string[];
+    tension_count: number;
+    kinds: Record<TensionKind, number>;
+    oldest_tension_age_days: number;
+    newest_tension_age_days: number;
+}
+export interface TensionClustersResult {
+    cluster_count: number;
+    clusters: TensionCluster[];
+}
+export declare function computeTensionClusters(tensions: TensionEntry[], now?: Date): TensionClustersResult;
+export declare function loadTensionClusters(vaultRoot: string, now?: Date): Promise<Result<TensionClustersResult, Error>>;
+//# sourceMappingURL=tension-clusters.d.ts.map

package/dist/curation/tension-clusters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tension-clusters.d.ts","sourceRoot":"","sources":["../../src/curation/tension-clusters.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAE/D,OAAO,EAA+B,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,cAAc,CAAC;AAEhG,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACnC,uBAAuB,EAAE,MAAM,CAAC;IAChC,uBAAuB,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,qBAAqB;IACpC,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,cAAc,EAAE,CAAC;CAC5B;AAuDD,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,YAAY,EAAE,EACxB,GAAG,GAAE,IAAiB,GACrB,qBAAqB,CAuEvB;AAID,wBAAsB,mBAAmB,CACvC,SAAS,EAAE,MAAM,EACjB,GAAG,GAAE,IAAiB,GACrB,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAAC,CAI/C"}

package/dist/curation/tension-clusters.js

@@ -0,0 +1,157 @@
+// Tension clusters — Phase 2 of the tension graph plan (2026-05-31).
+//
+// A "cluster" is a connected component of the tension graph: a maximal set of
+// documents joined transitively by in-scope tensions. Clusters surface the
+// regions of the vault where contradiction is composing rather than just
+// pairwise.
+//
+// In-scope = "live contested." A tension contributes an edge iff:
+//   - `resolved: false`, AND
+//   - `resolution.kind !== "accepted"`
+//
+// The two conditions reduce to `!resolved` in the current data model
+// (resolveTension always sets resolved: true), but the spec phrases them
+// separately for forward-compatibility. We keep both for the same reason.
+//
+// Cluster IDs are content-addressed (spec, Gap 3):
+//   "cluster:" + first 8 hex chars of sha256(canonical-sorted member paths
+//   joined by "\n").
+// Same membership → identical ID across runs. Membership change → different
+// ID. A merged cluster's ID matches neither predecessor's, which is the
+// correct semantic: a different membership is genuinely a different cluster.
+import { createHash } from "node:crypto";
+import { err, ok } from "../frontmatter/types.js";
+import { ageInDays } from "./staleness.js";
+import { listTensions, TENSION_KINDS } from "./tension.js";
+// Returns true iff the tension participates in cluster formation. Spec:
+// "Cluster scope" — only unresolved, non-accepted tensions form edges.
+function inScope(entry) {
+    if (entry.resolved)
+        return false;
+    if (entry.resolution?.kind === "accepted")
+        return false;
+    // Self-loops contribute nothing to clustering and would inflate
+    // tension_count for no reason; defensive filter.
+    if (entry.sourceA === entry.sourceB)
+        return false;
+    // Either endpoint missing means a malformed entry; skip rather than crash.
+    if (!entry.sourceA || !entry.sourceB)
+        return false;
+    return true;
+}
+// Union-find with path compression. No rank tracking — at the tension-log
+// scale this is unnecessary and a class would violate the project style rule.
+function ufFind(parent, x) {
+    if (!parent.has(x)) {
+        parent.set(x, x);
+        return x;
+    }
+    let root = x;
+    while (parent.get(root) !== root) {
+        root = parent.get(root);
+    }
+    // Path compression on the second pass.
+    let cur = x;
+    while (parent.get(cur) !== root) {
+        const next = parent.get(cur);
+        parent.set(cur, root);
+        cur = next;
+    }
+    return root;
+}
+function ufUnion(parent, a, b) {
+    const ra = ufFind(parent, a);
+    const rb = ufFind(parent, b);
+    if (ra !== rb)
+        parent.set(ra, rb);
+}
+// Content-addressed cluster id. The hash input is the canonical-sorted
+// member list joined by newlines — the same canonicalization used to render
+// the `documents` field, so the ID and the visible member list cannot drift
+// out of sync.
+function clusterIdFor(sortedMembers) {
+    const canonical = sortedMembers.join("\n");
+    const digest = createHash("sha256").update(canonical).digest("hex");
+    return `cluster:${digest.slice(0, 8)}`;
+}
+// Pure computation over a tension list. Synthetic-entry tests and the vault
+// loader both go through this function so the algorithm is exercised
+// identically in either path.
+export function computeTensionClusters(tensions, now = new Date()) {
+    const scoped = tensions.filter(inScope);
+    if (scoped.length === 0)
+        return { cluster_count: 0, clusters: [] };
+    const parent = new Map();
+    for (const t of scoped) {
+        ufUnion(parent, t.sourceA, t.sourceB);
+    }
+    // Group every document by its component root. The root key itself is not
+    // user-visible — it's a UF artifact — so we re-key by the content-addressed
+    // cluster id once members are known.
+    const docsByRoot = new Map();
+    for (const doc of parent.keys()) {
+        const root = ufFind(parent, doc);
+        if (!docsByRoot.has(root))
+            docsByRoot.set(root, new Set());
+        docsByRoot.get(root).add(doc);
+    }
+    // For each component, collect every tension whose endpoints both fall in
+    // the component. (By construction every in-scope tension's endpoints share
+    // a root — but we re-check rather than assume, so the count is provably
+    // correct.)
+    const tensionsByRoot = new Map();
+    for (const t of scoped) {
+        const root = ufFind(parent, t.sourceA);
+        const otherRoot = ufFind(parent, t.sourceB);
+        if (root !== otherRoot)
+            continue;
+        if (!tensionsByRoot.has(root))
+            tensionsByRoot.set(root, []);
+        tensionsByRoot.get(root).push(t);
+    }
+    const clusters = [];
+    for (const [root, docSet] of docsByRoot) {
+        const members = [...docSet].sort();
+        const id = clusterIdFor(members);
+        const clusterTensions = tensionsByRoot.get(root) ?? [];
+        const kinds = Object.fromEntries(TENSION_KINDS.map((k) => [k, 0]));
+        let oldest = 0;
+        let newest = Number.POSITIVE_INFINITY;
+        for (const t of clusterTensions) {
+            kinds[t.kind] += 1;
+            const age = ageInDays(t.date, now);
+            if (age > oldest)
+                oldest = age;
+            if (age < newest)
+                newest = age;
+        }
+        if (!Number.isFinite(newest))
+            newest = 0;
+        clusters.push({
+            id,
+            size: members.length,
+            documents: members,
+            tension_count: clusterTensions.length,
+            kinds,
+            oldest_tension_age_days: oldest,
+            newest_tension_age_days: newest,
+        });
+    }
+    // Largest cluster first; ties broken by id ASCII ascending so the order is
+    // deterministic across runs even when sizes collide.
+    clusters.sort((a, b) => {
+        if (b.size !== a.size)
+            return b.size - a.size;
+        return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;
+    });
+    return { cluster_count: clusters.length, clusters };
+}
+// Async wrapper that reads the vault's tension log and runs the computation.
+// Mirrors the listTensions / addTension / resolveTension Result contract.
+export async function loadTensionClusters(vaultRoot, now = new Date()) {
+    const tensions = await listTensions(vaultRoot);
+    if (!tensions.ok)
+        return err(tensions.error);
+    return ok(computeTensionClusters(tensions.value, now));
+}
+//# sourceMappingURL=tension-clusters.js.map

package/dist/curation/tension-clusters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tension-clusters.js","sourceRoot":"","sources":["../../src/curation/tension-clusters.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,EAAE;AACF,8EAA8E;AAC9E,2EAA2E;AAC3E,yEAAyE;AACzE,YAAY;AACZ,EAAE;AACF,kEAAkE;AAClE,6BAA6B;AAC7B,uCAAuC;AACvC,EAAE;AACF,qEAAqE;AACrE,yEAAyE;AACzE,0EAA0E;AAC1E,EAAE;AACF,mDAAmD;AACnD,2EAA2E;AAC3E,qBAAqB;AACrB,4EAA4E;AAC5E,wEAAwE;AACxE,6EAA6E;AAE7E,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,GAAG,EAAE,EAAE,EAAe,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAuC,MAAM,cAAc,CAAC;AAiBhG,wEAAwE;AACxE,uEAAuE;AACvE,SAAS,OAAO,CAAC,KAAmB;IAClC,IAAI,KAAK,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IACjC,IAAI,KAAK,CAAC,UAAU,EAAE,IAAI,KAAK,UAAU;QAAE,OAAO,KAAK,CAAC;IACxD,gEAAgE;IAChE,iDAAiD;IACjD,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAClD,2EAA2E;IAC3E,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0EAA0E;AAC1E,8EAA8E;AAC9E,SAAS,MAAM,CAAC,MAA2B,EAAE,CAAS;IACpD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACjC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAW,CAAC;IACpC,CAAC;IACD,uCAAuC;IACvC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAW,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACtB,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CAAC,MAA2B,EAAE,CAAS,EAAE,CAAS;IAChE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7B,IAAI,EAAE,KAAK,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACpC,CAAC;AAED,uEAAuE;AACvE,4EAA4E;AAC5E,4EAA4E;AAC5E,eAAe;AACf,SAAS,YAAY,CAAC,aAAuB;IAC3C,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACpE,OAAO,WAAW,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACzC,CAAC;AAED,4EAA4E;AAC5E,qEAAqE;AACrE,8BAA8B;AAC9B,MAAM,UAAU,sBAAsB,CACpC,QAAwB,EACxB,MAAY,IAAI,IAAI,EAAE;IAEtB,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAEnE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,yEAAyE;IACzE,4EAA4E;IAC5E,qCAAqC;IACrC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC1D,UAAU,CAAC,GAAG,CAAC,IAAI,CAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjD,CAAC;IAED,yEAAyE;IACzE,2EAA2E;IAC3E,wEAAwE;IACxE,YAAY;IACZ,MAAM,cAAc,GAAG,IAAI,GAAG,EAA0B,CAAC;IACzD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3D,cAAc,CAAC,GAAG,CAAC,IAAI,CAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,eAAe,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAEvD,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAGhE,CAAC;QACF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;YAChC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,GAAG,GAAG,MAAM;gBAAE,MAAM,GAAG,GAAG,CAAC;YAC/B,IAAI,GAAG,GAAG,MAAM;gBAAE,MAAM,GAAG,GAAG,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,MAAM,GAAG,CAAC,CAAC;QAEzC,QAAQ,CAAC,IAAI,CAAC;YACZ,EAAE;YACF,IAAI,EAAE,OAAO,CAAC,MAAM;YACpB,SAAS,EAAE,OAAO;YAClB,aAAa,EAAE,eAAe,CAAC,MAAM;YACrC,KAAK;YACL,uBAAuB,EAAE,MAAM;YAC/B,uBAAuB,EAAE,MAAM;SAChC,CAAC,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,qDAAqD;IACrD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;QAC9C,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,aAAa,EAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC;AACtD,CAAC;AAED,6EAA6E;AAC7E,0EAA0E;AAC1E,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,SAAiB,EACjB,MAAY,IAAI,IAAI,EAAE;IAEtB,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,SAAS,CAAC,CAAC;IAC/C,IAAI,CAAC,QAAQ,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,EAAE,CAAC,sBAAsB,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AACzD,CAAC"}

package/dist/curation/tension.d.ts

@@ -1,20 +1,44 @@
 import { type Result } from "../frontmatter/types.js";
 export declare const DEFAULT_TENSION_STATUS = "unresolved";
+export declare const RESOLVED_TENSION_STATUS = "resolved";
+export declare const TENSION_KINDS: readonly ["temporal", "factual", "interpretive", "unspecified"];
+export type TensionKind = (typeof TENSION_KINDS)[number];
+export declare const LOGGABLE_TENSION_KINDS: readonly ["temporal", "factual", "interpretive"];
+export type LoggableTensionKind = (typeof LOGGABLE_TENSION_KINDS)[number];
+export declare const RESOLUTION_KINDS: readonly ["superseded", "corrected", "accepted", "invalid"];
+export type ResolutionKind = (typeof RESOLUTION_KINDS)[number];
+export interface TensionResolution {
+    resolved_at: string;
+    resolved_by: string;
+    kind: ResolutionKind;
+    rationale?: string;
+    references?: string[];
+}
 export interface TensionEntry {
+    id?: string;
     date: string;
     title: string;
+    kind: TensionKind;
     sourceA: string;
     claimA: string;
     sourceB: string;
     claimB: string;
     status: string;
     loggedBy: string;
+    resolved: boolean;
+    resolution?: TensionResolution;
 }
-export type TensionInput = Omit<TensionEntry, "date" | "status"> & {
+export type TensionInput = Omit<TensionEntry, "date" | "status" | "kind" | "id" | "resolved" | "resolution"> & {
     date?: string;
     status?: string;
+    kind: LoggableTensionKind;
 };
 export declare function tensionsPath(vaultRoot: string): string;
 export declare function addTension(vaultRoot: string, input: TensionInput): Promise<Result<TensionEntry, Error>>;
 export declare function listTensions(vaultRoot: string, status?: string): Promise<Result<TensionEntry[], Error>>;
+export declare function resolveTension(vaultRoot: string, id: string, resolution: TensionResolution): Promise<Result<TensionEntry, Error>>;
+export declare const AGING_TIERS: readonly ["fresh", "aging", "stale"];
+export type AgingTier = (typeof AGING_TIERS)[number];
+export declare const STALE_TIER_LINT_COPY: Record<Exclude<TensionKind, "unspecified">, string>;
+export declare function agingTier(entry: TensionEntry, now?: Date): AgingTier | null;
 //# sourceMappingURL=tension.d.ts.map

package/dist/curation/tension.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"tension.d.ts","sourceRoot":"","sources":["../../src/curation/tension.ts"],"names":[],"mappings":"AAaA,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAE/D,eAAO,MAAM,sBAAsB,eAAe,CAAC;AAEnD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,EAAE,MAAM,GAAG,QAAQ,CAAC,GAAG;IACjE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtD;AAiBD,wBAAsB,UAAU,CAC9B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAClB,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CA2BtC;AAsDD,wBAAsB,YAAY,CAChC,SAAS,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,KAAK,CAAC,CAAC,CAoBxC"}
+{"version":3,"file":"tension.d.ts","sourceRoot":"","sources":["../../src/curation/tension.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAW,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAG/D,eAAO,MAAM,sBAAsB,eAAe,CAAC;AACnD,eAAO,MAAM,uBAAuB,aAAa,CAAC;AAElD,eAAO,MAAM,aAAa,iEAAkE,CAAC;AAC7F,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC;AAGzD,eAAO,MAAM,sBAAsB,kDAAmD,CAAC;AACvF,MAAM,MAAM,mBAAmB,GAAG,CAAC,OAAO,sBAAsB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE1E,eAAO,MAAM,gBAAgB,6DAA8D,CAAC;AAC5F,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;AAE/D,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,cAAc,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,WAAW,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,iBAAiB,CAAC;CAChC;AAED,MAAM,MAAM,YAAY,GAAG,IAAI,CAC7B,YAAY,EACZ,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,IAAI,GAAG,UAAU,GAAG,YAAY,CAC9D,GAAG;IACF,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,mBAAmB,CAAC;CAC3B,CAAC;AAEF,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtD;AAsDD,wBAAsB,UAAU,CAC9B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,YAAY,GAClB,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAyCtC;AAwGD,wBAAsB,YAAY,CAChC,SAAS,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,KAAK,CAAC,CAAC,CAoBxC;AAMD,wBAAsB,cAAc,CAClC,SAAS,EAAE,MAAM,EACjB,EAAE,EAAE,MAAM,EACV,UAAU,EAAE,iBAAiB,GAC5B,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAiEtC;AA8BD,eAAO,MAAM,WAAW,sCAAuC,CAAC;AAChE,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC;AAKrD,eAAO,MAAM,oBAAoB,EAAE,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE,aAAa,CAAC,EAAE,MAAM,CAOpF,CAAC;AAKF,wBAAgB,SAAS,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,GAAE,IAAiB,GAAG,SAAS,GAAG,IAAI,CAQvF"}