@useody/detectors 0.0.1

package/LICENSE

@@ -0,0 +1,198 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by the Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding any notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format.
+
+   Copyright 2026 Rodyr Inc.
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,42 @@
+# @useody/detectors
+
+Five pure-function detectors for finding issues in documentation knowledge graphs.
+
+## Detectors
+
+| Detector | What it finds |
+|----------|--------------|
+| `detectContradictions` | Two documents disagree on the same fact |
+| `detectDuplicates` | Same topic documented in multiple places |
+| `detectStaleness` | Processes and commitments that went quiet |
+| `detectUndocumented` | Decisions made in chat, never written down |
+| `detectTimeBombs` | Deadlines and SLAs approaching with no action |
+
+## Usage
+
+```typescript
+import { detectContradictions, detectStaleness } from '@useody/detectors';
+
+// Each detector is a pure function: (nodes, edges, llm?) -> Detection[]
+const results = await detectContradictions(nodes, edges, llm);
+```
+
+## Writing a custom detector
+
+```typescript
+import type { DetectorFn } from '@useody/platform-core';
+
+const detectMyIssue: DetectorFn = async (nodes, edges, llm) => {
+  return []; // Your detection logic
+};
+
+detectMyIssue.preFilter = { similarityThreshold: 0.6, topK: 10 };
+```
+
+## Design principles
+
+- **Pure functions** — No I/O, no side effects, no database access
+- **Optional LLM** — Every detector works in heuristic mode (no LLM) with lower accuracy
+- **Pre-filters** — Each detector declares similarity thresholds to avoid brute-force comparison
+
+Part of [ody-platform](https://github.com/ufukkaraca/ody-platform). See the root [README](../../README.md) for setup.

package/dist/claim-comparison.d.ts

@@ -0,0 +1,12 @@
+/**
+ * LLM-based claim contradiction detection.
+ * Compares extracted facts between knowledge nodes using an LLM.
+ * @module claim-comparison
+ */
+import type { Detection, KnowledgeNode, LLMProvider } from '@useody/platform-core';
+/**
+ * Detect contradictions by sending extracted facts to an LLM for comparison.
+ * Only processes nodes that have extracted facts.
+ */
+export declare function detectClaimContradictions(nodes: KnowledgeNode[], llm: LLMProvider, out: Detection[], seen: Set<string>): Promise<void>;
+//# sourceMappingURL=claim-comparison.d.ts.map

package/dist/claim-comparison.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"claim-comparison.d.ts","sourceRoot":"","sources":["../src/claim-comparison.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAEV,SAAS,EACT,aAAa,EACb,WAAW,EACZ,MAAM,uBAAuB,CAAC;AA6E/B;;;GAGG;AACH,wBAAsB,yBAAyB,CAC7C,KAAK,EAAE,aAAa,EAAE,EACtB,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,SAAS,EAAE,EAChB,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAChB,OAAO,CAAC,IAAI,CAAC,CAyDf"}

package/dist/claim-comparison.js

@@ -0,0 +1,108 @@
+import { parseLlmJsonResponse } from '@useody/platform-core';
+import { completeWithTimeout } from './helpers/llm-timeout.js';
+const MAX_LLM_CALLS = 30;
+const LLM_TIMEOUT_MS = 8_000;
+/** Build the system prompt for claim comparison. */
+function buildSystemPrompt() {
+    return [
+        'You compare knowledge claims for REAL contradictions. Be STRICT.',
+        '',
+        'A contradiction means: BOTH documents make ACTIVE, EXPLICIT claims',
+        'about the SAME specific thing, but state INCOMPATIBLE facts.',
+        '',
+        'CRITICAL — Absence is NOT contradiction:',
+        'If Doc A states something and Doc B is SILENT about that topic,',
+        'that is a gap, NOT a contradiction. The undocumented detector handles gaps.',
+        'Both documents must make active assertions that conflict.',
+        '',
+        'FALSE POSITIVES to avoid (absence-based):',
+        '- "Doc A requires Vitest" vs "Doc B doesn\'t mention a test framework" → NOT a contradiction',
+        '- "Doc A has a 250-line limit" vs "Doc B has no line limit rule" → NOT a contradiction',
+        '- "Doc A says be kind" vs "Doc B has no kindness requirement" → NOT a contradiction',
+        '',
+        'NOT a contradiction (different topics):',
+        '- Different pages covering different aspects of a topic',
+        '- Complementary information (overview vs details)',
+        '- Different resources (CPU vs GPU, memory vs storage)',
+        '- General vs specific descriptions of the same thing',
+        '',
+        'IS a contradiction (both docs actively conflict):',
+        '- "API rate limit is 1000/min" vs "API rate limit is 500/min" → REAL conflict',
+        '- "Deploy window Tue-Thu" vs "Deploy Friday 2-4pm" → REAL conflict',
+        '- "Remote-first" vs "Must work from office full-time" → REAL conflict',
+        '',
+        'When in doubt: NOT a contradiction. Be conservative.',
+        '',
+        'Reply ONLY valid JSON:',
+        '{"isContradiction":bool,"topic":"the specific thing both discuss",',
+        '"claimA":"what A says","claimB":"what B says",',
+        '"severity":"critical|warning","explanation":"one sentence"}',
+    ].join('\n');
+}
+/** Build the user prompt for a specific fact pair. */
+function buildUserPrompt(nodeA, nodeB, factsA, factsB) {
+    return [
+        `Claims from "${nodeA.title}":`,
+        factsA,
+        '',
+        `Claims from "${nodeB.title}":`,
+        factsB,
+        '',
+        'Are any of these claims about the SAME topic but contradictory?',
+    ].join('\n');
+}
+/** Canonical pair key for deduplication. */
+function pairKey(id1, id2) {
+    return id1 < id2 ? `${id1}:${id2}` : `${id2}:${id1}`;
+}
+/**
+ * Detect contradictions by sending extracted facts to an LLM for comparison.
+ * Only processes nodes that have extracted facts.
+ */
+export async function detectClaimContradictions(nodes, llm, out, seen) {
+    const nodesWithFacts = nodes.filter((n) => (n.content.facts?.length ?? 0) > 0);
+    if (nodesWithFacts.length < 2)
+        return;
+    let callCount = 0;
+    const systemMsg = buildSystemPrompt();
+    for (let i = 0; i < nodesWithFacts.length && callCount < MAX_LLM_CALLS; i++) {
+        for (let j = i + 1; j < nodesWithFacts.length && callCount < MAX_LLM_CALLS; j++) {
+            const a = nodesWithFacts[i];
+            const b = nodesWithFacts[j];
+            const key = pairKey(a.id, b.id);
+            if (seen.has(key))
+                continue;
+            const factsA = a.content.facts.join('\n');
+            const factsB = b.content.facts.join('\n');
+            const messages = [
+                { role: 'system', content: systemMsg },
+                { role: 'user', content: buildUserPrompt(a, b, factsA, factsB) },
+            ];
+            const response = await completeWithTimeout(llm, messages, { temperature: 0, maxTokens: 300 }, LLM_TIMEOUT_MS);
+            callCount++;
+            if (!response)
+                continue;
+            const parsed = parseLlmJsonResponse(response);
+            if (!parsed.data?.isContradiction)
+                continue;
+            const result = parsed.data;
+            const severity = result.severity === 'critical' ? 'critical' : 'warning';
+            seen.add(key);
+            out.push({
+                type: 'contradiction',
+                severity,
+                nodeIds: [a.id, b.id],
+                description: `When discussing ${result.topic}, ${a.title} states: '${result.claimA}'. However, ${b.title} states: '${result.claimB}'.`,
+                suggestedAction: `Review and align ${a.title} and ${b.title} on ${result.topic}.`,
+                metadata: {
+                    claimA: result.claimA,
+                    claimB: result.claimB,
+                    topic: result.topic,
+                    impact: result.explanation,
+                    confidence: severity === 'critical' ? 'high' : 'medium',
+                },
+            });
+        }
+    }
+}
+//# sourceMappingURL=claim-comparison.js.map

package/dist/claim-nli.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Claim-based contradiction detection using Natural Language Inference.
+ * Extracts atomic claims from each node, clusters by topic similarity,
+ * then does pairwise NLI: "can both claims be true simultaneously?"
+ * @module claim-nli
+ */
+import type { Detection, KnowledgeNode, LLMProvider } from '@useody/platform-core';
+/**
+ * Run claim-based NLI contradiction detection.
+ * Stage 1: Extract atomic claims from each node.
+ * Stage 2: Find related claim pairs (same topic, different sources).
+ * Stage 3: Compare each pair via LLM NLI.
+ */
+export declare function detectClaimNliContradictions(nodes: KnowledgeNode[], llm: LLMProvider, out: Detection[], seen: Set<string>): Promise<void>;
+//# sourceMappingURL=claim-nli.d.ts.map

package/dist/claim-nli.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"claim-nli.d.ts","sourceRoot":"","sources":["../src/claim-nli.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EACV,SAAS,EACT,aAAa,EACb,WAAW,EACZ,MAAM,uBAAuB,CAAC;AA2K/B;;;;;GAKG;AACH,wBAAsB,4BAA4B,CAChD,KAAK,EAAE,aAAa,EAAE,EACtB,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,SAAS,EAAE,EAChB,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAChB,OAAO,CAAC,IAAI,CAAC,CAqDf"}

package/dist/claim-nli.js

@@ -0,0 +1,181 @@
+import { parseLlmJsonResponse } from '@useody/platform-core';
+import { completeWithTimeout } from './helpers/llm-timeout.js';
+const LLM_TIMEOUT_MS = 15_000;
+const BATCH_SIZE = 5;
+const EXTRACT_CLAIMS_PROMPT = `Extract every specific factual assertion from this text.
+Each claim must be a standalone statement that could be verified as true or false.
+Focus on: numbers, policies, rules, deadlines, requirements, schedules.
+
+IMPORTANT: Only extract claims that are ACTIVELY STATED in the text.
+Do NOT invent claims about what is missing, absent, or not mentioned.
+Never produce claims like "No X specified" or "X is not mentioned."
+
+Return JSON only: {"claims":["claim1","claim2",...]}
+
+Examples:
+- "Employees can work remotely up to 3 days per week"
+- "All PRs require 2 reviewer approvals"
+- "On-call response time is 15 minutes"
+- "Annual vacation allowance is 20 days"
+- "Deployments happen on Tuesdays at 2 PM UTC"
+
+Text:
+`;
+const NLI_PROMPT = `Check if two claims from different documents contradict each other.
+Contradiction = BOTH claims make ACTIVE assertions about the SAME topic that CANNOT both be true.
+
+CRITICAL: Absence is NOT contradiction. If only one claim addresses a topic, that is a gap, not a conflict.
+Both claims must actively disagree on the same specific thing.
+
+NOT contradictions: different topics, complementary info, one-sided coverage.
+REAL contradictions: "rate limit 1000/min" vs "rate limit 500/min"; "remote-first" vs "office full-time".
+
+Claim A: "{claimA}" (Source: {sourceA})
+Claim B: "{claimB}" (Source: {sourceB})
+
+When in doubt, answer false. Reply ONLY valid JSON:
+{"contradiction":true/false,"explanation":"why they conflict or don't","severity":"critical|warning"}`;
+/**
+ * Extract atomic claims from a node's content using LLM.
+ * Returns precise, verifiable factual assertions.
+ */
+async function extractAtomicClaims(node, llm) {
+    const text = node.content.raw ?? node.content.summary;
+    const response = await completeWithTimeout(llm, [{ role: 'user', content: EXTRACT_CLAIMS_PROMPT + text }], { temperature: 0, maxTokens: 1024 }, LLM_TIMEOUT_MS);
+    if (!response)
+        return [];
+    const parsed = parseLlmJsonResponse(response);
+    if (!parsed.data?.claims || !Array.isArray(parsed.data.claims))
+        return [];
+    const sourceFile = node.content.source?.sourceId ?? '';
+    return parsed.data.claims
+        .filter((c) => typeof c === 'string' && c.length > 10)
+        .map((text) => ({
+        text,
+        nodeId: node.id,
+        nodeTitle: node.title,
+        sourceFile,
+    }));
+}
+/**
+ * Compare two claims using NLI framing.
+ * Returns whether they contradict and why.
+ */
+async function compareClaims(a, b, llm) {
+    const prompt = NLI_PROMPT
+        .replace('{claimA}', a.text)
+        .replace('{sourceA}', a.nodeTitle)
+        .replace('{claimB}', b.text)
+        .replace('{sourceB}', b.nodeTitle);
+    const response = await completeWithTimeout(llm, [{ role: 'user', content: prompt }], { temperature: 0, maxTokens: 200 }, LLM_TIMEOUT_MS);
+    if (!response)
+        return null;
+    const parsed = parseLlmJsonResponse(response);
+    return parsed.data ?? null;
+}
+/**
+ * Find claims about the same topic using keyword overlap.
+ * Returns pairs of claims from DIFFERENT source files.
+ */
+function findRelatedClaimPairs(claims) {
+    const pairs = [];
+    const STOP = new Set([
+        'the', 'and', 'for', 'are', 'with', 'per', 'our', 'all', 'must',
+        'can', 'may', 'will', 'from', 'that', 'this', 'have', 'each',
+        'not', 'but', 'should', 'any', 'been',
+    ]);
+    /** Basic stemming: remove trailing s/es/ed/ing for better matching. */
+    const stem = (w) => {
+        if (w.endsWith('ing') && w.length > 5)
+            return w.slice(0, -3);
+        if (w.endsWith('ed') && w.length > 4)
+            return w.slice(0, -2);
+        if (w.endsWith('es') && w.length > 4)
+            return w.slice(0, -2);
+        if (w.endsWith('s') && w.length > 3)
+            return w.slice(0, -1);
+        return w;
+    };
+    const keywordCache = new Map();
+    const getKw = (idx) => {
+        if (keywordCache.has(idx))
+            return keywordCache.get(idx);
+        const kw = new Set(claims[idx].text.toLowerCase()
+            .replace(/[^\w\s]/g, ' ')
+            .split(/\s+/)
+            .filter((w) => w.length > 2 && !STOP.has(w))
+            .map(stem));
+        keywordCache.set(idx, kw);
+        return kw;
+    };
+    for (let i = 0; i < claims.length; i++) {
+        for (let j = i + 1; j < claims.length; j++) {
+            const a = claims[i];
+            const b = claims[j];
+            // Only compare claims from DIFFERENT source files
+            if (a.sourceFile === b.sourceFile)
+                continue;
+            // Check keyword overlap — at least 1 meaningful shared word
+            const kwA = getKw(i);
+            const kwB = getKw(j);
+            const shared = [...kwA].filter((w) => kwB.has(w));
+            if (shared.length >= 1) {
+                pairs.push([a, b]);
+            }
+        }
+    }
+    return pairs;
+}
+/**
+ * Run claim-based NLI contradiction detection.
+ * Stage 1: Extract atomic claims from each node.
+ * Stage 2: Find related claim pairs (same topic, different sources).
+ * Stage 3: Compare each pair via LLM NLI.
+ */
+export async function detectClaimNliContradictions(nodes, llm, out, seen) {
+    // Stage 1: Extract atomic claims from all nodes
+    const allClaims = [];
+    for (let i = 0; i < nodes.length; i += BATCH_SIZE) {
+        const batch = nodes.slice(i, i + BATCH_SIZE);
+        const results = await Promise.all(batch.map((n) => extractAtomicClaims(n, llm)));
+        for (const claims of results) {
+            allClaims.push(...claims);
+        }
+    }
+    if (allClaims.length < 2)
+        return;
+    // Stage 2: Find related claim pairs
+    const pairs = findRelatedClaimPairs(allClaims);
+    // Cap at 100 LLM calls for NLI comparison
+    const MAX_NLI_CALLS = 100;
+    const pairsToCheck = pairs.slice(0, MAX_NLI_CALLS);
+    // Stage 3: NLI comparison
+    for (let i = 0; i < pairsToCheck.length; i += BATCH_SIZE) {
+        const batch = pairsToCheck.slice(i, i + BATCH_SIZE);
+        const results = await Promise.all(batch.map(([a, b]) => compareClaims(a, b, llm)));
+        for (let j = 0; j < batch.length; j++) {
+            const result = results[j];
+            const [claimA, claimB] = batch[j];
+            if (!result?.contradiction)
+                continue;
+            const key = [claimA.nodeId, claimB.nodeId].sort().join(':');
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            out.push({
+                type: 'contradiction',
+                severity: result.severity,
+                nodeIds: [claimA.nodeId, claimB.nodeId],
+                description: `${claimA.nodeTitle} states: "${claimA.text}" — but ${claimB.nodeTitle} states: "${claimB.text}"`,
+                suggestedAction: `Review and align: "${claimA.text}" vs "${claimB.text}"`,
+                metadata: {
+                    claimA: claimA.text,
+                    claimB: claimB.text,
+                    explanation: result.explanation,
+                    topic: `${claimA.nodeTitle} vs ${claimB.nodeTitle}`,
+                },
+            });
+        }
+    }
+}
+//# sourceMappingURL=claim-nli.js.map

package/dist/consensus.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Consensus voting engine for consultant analysis.
+ * Runs analysis N times, groups findings by similarity,
+ * and keeps only those appearing in a majority of passes.
+ * @module consensus
+ */
+import type { LLMProvider } from '@useody/platform-core';
+import type { AnalysisInput, AnalysisResult } from './consultant-analysis.js';
+/** Options for consensus analysis. */
+export interface ConsensusOptions {
+    /** Number of analysis passes (default 3). */
+    passes?: number;
+    /** Minimum votes (passes) a finding must appear in to survive. Default: ceil(passes/2). */
+    minVotes?: number;
+    /** Max tokens per LLM call. */
+    maxTokens?: number;
+    /** Logger callback for progress. */
+    logger?: (msg: string) => void;
+}
+/**
+ * Run consensus analysis: multiple passes with majority voting.
+ * Findings must appear in >= ceil(N/2) passes to be kept.
+ * Health scores are computed deterministically from consensus findings.
+ */
+export declare function runConsensusAnalysis(input: AnalysisInput, llm: LLMProvider, options?: ConsensusOptions): Promise<AnalysisResult>;
+//# sourceMappingURL=consensus.d.ts.map

package/dist/consensus.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consensus.d.ts","sourceRoot":"","sources":["../src/consensus.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,KAAK,EACV,aAAa,EACb,cAAc,EAGf,MAAM,0BAA0B,CAAC;AAIlC,sCAAsC;AACtC,MAAM,WAAW,gBAAgB;IAC/B,6CAA6C;IAC7C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,2FAA2F;IAC3F,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+BAA+B;IAC/B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,oCAAoC;IACpC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;CAChC;AAuKD;;;;GAIG;AACH,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,aAAa,EACpB,GAAG,EAAE,WAAW,EAChB,OAAO,CAAC,EAAE,gBAAgB,GACzB,OAAO,CAAC,cAAc,CAAC,CA4DzB"}