@ixo/decision-oracle 0.0.0-stage → 0.2.1

package/dist/lib/facts/stock/unique-store.js

@@ -0,0 +1,328 @@
+/**
+ * Duplicate-detection registry: writes + candidate reads (duplicate-claim spec §3 steps 2–3),
+ * over THIS oracle's D1 — duplicate detection is oracle-side. The
+ * prior-claim scope is every claim this oracle has ingested for the collection: the registries
+ * fill as the stock producer runs, so protection starts the day a collection is watched here, and
+ * no other oracle's registry is ever visible (the D1 IS this oracle's — no oracle column).
+ *
+ * The one ordering rule that matters: **insert self BEFORE reading siblings** (spec §3.2). Two
+ * concurrent duplicates each land their own rows first, so whichever reads second — and at least
+ * one must — sees the other; neither slips through the race window. `onConflictDoNothing` on the
+ * registry PKs makes the whole call idempotent under workflow step retry.
+ *
+ * Reads are candidate COLLECTION only (spec §3.3): exact digest, attachment-CID reuse (§4 L2),
+ * near-text (§4 L3), and the bounded pHash pool (§4 L4 — hamming happens in the pure scoring
+ * layer, never in SQL). Every lane applies the rule's `countPrior` filter here, in one place:
+ * `finalVerdict IS NULL` (not yet finalized) always counts as blockable pending; a finalized
+ * verdict blocks only when listed — a rejected prior never blocks, because resubmitting a fixed
+ * claim is the honest path, and neither does a `void` one (`VOID_TOKEN`: a claim that never
+ * reached a decision — a facts-lane outcome, a content refusal, an unusable rubric, a failed
+ * ingest — is not evidence of anything, eval critique P0-6).
+ *
+ * And every lane reads only claims registered BEFORE this one (`registeredBefore`: the body row's
+ * SQLite rowid, i.e. ingest order). A retry re-runs this read (runner.ts — registry state must be
+ * fresh per attempt), so without the bound an original whose step retried after a copy landed
+ * would see the copy and be flagged too. Two racing copies still meet: the later one sees the
+ * earlier, whichever commits second.
+ *
+ * THE SQLite TRADE-OFF (vs eval-engine's Postgres + pg_trgm): D1 has no trigram index and no
+ * `similarity()`, so the L3 lane reads a BOUNDED pool of the collection's newest rows
+ * (`TRIGRAM_POOL_LIMIT`, newest first — the shape the pHash pool already had) and computes
+ * pg_trgm's own measure in JS (`trigramSimilarity`: word-padded trigram sets, Jaccard). The
+ * numbers match pg_trgm for any pair the pool holds; what is lost is recall beyond the pool — a
+ * near-copy of a claim older than the newest N is caught only by the exact and attachment lanes.
+ * Raise the limit before reaching for FTS5 (its trigram tokenizer matches substrings, it does not
+ * rank by similarity).
+ *
+ * This module runs inside the resolve phase (impure by design: it owns the registry I/O). Its
+ * output freezes into the FactSet, so everything returned is plain JSON — `createdAt` is an ISO
+ * string, not a Date. `finalVerdictUpdate` is the one write the WORKFLOWS make (the decision's
+ * own batch), never the producer: the verdict lands when the engine has decided.
+ */
+import { and, desc, eq, inArray, isNotNull, isNull, ne, or, sql } from "drizzle-orm";
+import { claimAttachmentCids, claimBodyDigests, decisions } from "../../../db/schema.js";
+/** The near-text lane's floor (spec §4 L3) — below it a candidate is not shortlisted at all. */
+export const TRIGRAM_MIN_SIMILARITY = 0.5;
+/** Bound the near-text pool the JS similarity runs over — newest rows win (header). */
+const TRIGRAM_POOL_LIMIT = 200;
+/** Bound the pHash pool the pure scorer hammings over — newest rows win (plan T6). */
+const PHASH_POOL_LIMIT = 500;
+/**
+ * D1 binds at most 100 parameters per statement. A `claim_attachment_cids` row binds one per
+ * column, `createdAt` included (`$defaultFn` binds, it does not emit `DEFAULT`) —
+ * `test/unique-store.test.ts` pins `CID_ROW_PARAMS` against the schema so a new column fails there,
+ * not on a 15-attachment claim in production. The CID read binds each CID plus the collection, the
+ * claim and the countPrior verdict list.
+ */
+const D1_MAX_PARAMS = 100;
+export const CID_ROW_PARAMS = 7;
+export const CID_ROWS_PER_INSERT = Math.floor(D1_MAX_PARAMS / CID_ROW_PARAMS);
+export const CIDS_PER_READ = 80;
+const TRIGRAM_LIMIT = 10;
+/**
+ * pg_trgm's trigram set: the string split into words on non-alphanumerics, each word padded with
+ * two leading and one trailing space, every 3-char window collected once. The registry text is
+ * already case-folded and separator-stripped (normalize.ts), so this reads the same input pg did.
+ */
+function trigramsOf(text) {
+    const out = new Set();
+    for (const word of text.split(/[^\p{L}\p{N}]+/u)) {
+        if (word.length === 0)
+            continue;
+        const padded = `  ${word} `;
+        for (let i = 0; i + 3 <= padded.length; i++)
+            out.add(padded.slice(i, i + 3));
+    }
+    return out;
+}
+/** pg_trgm's measure: |A ∩ B| / |A ∪ B| over two trigram sets, 0 when both are empty (never NaN). */
+function jaccard(a, b) {
+    let shared = 0;
+    for (const t of a)
+        if (b.has(t))
+            shared++;
+    const union = a.size + b.size - shared;
+    return union === 0 ? 0 : shared / union;
+}
+/** pg_trgm `similarity(a, b)` for two normalized texts. */
+export function trigramSimilarity(a, b) {
+    return jaccard(trigramsOf(a), trigramsOf(b));
+}
+/**
+ * Ingest order (header): the candidate's body row was inserted before this claim's. The rowid is
+ * SQLite's own insertion counter — monotonic, a stable tie-break where two `createdAt`s share a
+ * millisecond, and kept by a retry (`onConflictDoNothing` leaves the first row standing).
+ */
+function registeredBefore(input) {
+    return sql `${claimBodyDigests}.rowid < (select s.rowid from ${claimBodyDigests} s where s.collection_id = ${input.collectionId} and s.claim_id = ${input.claimId} order by s.rowid limit 1)`;
+}
+/** `countPrior` as SQL: NULL (pending) always blockable; finalized verdicts only when listed. */
+function blockableVerdict(countPrior) {
+    const verdict = claimBodyDigests.finalVerdict;
+    return countPrior.length > 0
+        ? or(isNull(verdict), inArray(verdict, countPrior))
+        : isNull(verdict);
+}
+/**
+ * Register this claim's digest + attachment rows, then read its duplicate candidates.
+ * One call per evaluation, from the resolve phase only.
+ */
+export async function registerAndFetchSiblings(db, input) {
+    // -- Step 2 (spec §3): insert self first. Losing the PK race changes nothing — the row stands.
+    const registerBody = db
+        .insert(claimBodyDigests)
+        .values({
+        collectionId: input.collectionId,
+        digest: input.digest,
+        claimId: input.claimId,
+        agentAddress: input.agentAddress,
+        normalizedText: input.normalizedText,
+    })
+        .onConflictDoNothing();
+    // -- Step 3 (spec §3): collect candidates — always excluding self, filtered by countPrior.
+    const notSelf = ne(claimBodyDigests.claimId, input.claimId);
+    const verdictFilter = blockableVerdict(input.countPrior);
+    const earlier = registeredBefore(input);
+    // The attachment lanes join the body registry for the verdict and the order; a missing body row
+    // (every register writes both, §3.2) reads as pending and in order — the fail-closed default.
+    const earlierOrUnknown = or(isNull(claimBodyDigests.claimId), earlier);
+    const exactQ = db
+        .select({
+        claimId: claimBodyDigests.claimId,
+        agentAddress: claimBodyDigests.agentAddress,
+        finalVerdict: claimBodyDigests.finalVerdict,
+        createdAt: claimBodyDigests.createdAt,
+    })
+        .from(claimBodyDigests)
+        .where(and(eq(claimBodyDigests.collectionId, input.collectionId), eq(claimBodyDigests.digest, input.digest), notSelf, verdictFilter, earlier));
+    // The near-text pool (header): the newest rows still carrying text — NULL normalizedText (erased
+    // PII) drops out of this lane by construction; the exact-digest lane still sees those rows.
+    const textPoolQ = db
+        .select({
+        claimId: claimBodyDigests.claimId,
+        agentAddress: claimBodyDigests.agentAddress,
+        finalVerdict: claimBodyDigests.finalVerdict,
+        createdAt: claimBodyDigests.createdAt,
+        normalizedText: claimBodyDigests.normalizedText,
+    })
+        .from(claimBodyDigests)
+        .where(and(eq(claimBodyDigests.collectionId, input.collectionId), notSelf, isNotNull(claimBodyDigests.normalizedText), verdictFilter, earlier))
+        .orderBy(desc(claimBodyDigests.createdAt))
+        .limit(TRIGRAM_POOL_LIMIT);
+    const poolQ = db
+        .select({
+        claimId: claimAttachmentCids.claimId,
+        agentAddress: claimAttachmentCids.agentAddress,
+        cid: claimAttachmentCids.cid,
+        phash: claimAttachmentCids.phash,
+        mediaType: claimAttachmentCids.mediaType,
+    })
+        .from(claimAttachmentCids)
+        .leftJoin(claimBodyDigests, and(eq(claimBodyDigests.collectionId, claimAttachmentCids.collectionId), eq(claimBodyDigests.claimId, claimAttachmentCids.claimId)))
+        .where(and(eq(claimAttachmentCids.collectionId, input.collectionId), ne(claimAttachmentCids.claimId, input.claimId), isNotNull(claimAttachmentCids.phash), verdictFilter, earlierOrUnknown))
+        .orderBy(desc(claimAttachmentCids.createdAt))
+        .limit(PHASH_POOL_LIMIT);
+    // ONE `db.batch` for the whole call: D1 runs a batch as one transaction IN ORDER, so "insert self
+    // BEFORE reading siblings" (header) is structural — two racing claims' batches serialize, and
+    // whichever commits second reads the other's rows.
+    const attachments = uniqueByCid(input.attachments);
+    if (attachments.length === 0) {
+        const [, exact, textPool, phashPool] = await db.batch([registerBody, exactQ, textPoolQ, poolQ]);
+        return siblingsOf(input, exact, textPool, [], phashPool);
+    }
+    // Both CID statements are split to D1's bound-parameter cap (`CID_ROWS_PER_INSERT`,
+    // `CIDS_PER_READ`): one row per attachment and nothing short of the API lane's 100 bounds how many
+    // a claim carries — a single INSERT of 15 raised a raw D1 error on every attempt, so the claim
+    // retried for hours and then failed with no decision.
+    const registerCids = chunk(attachments, CID_ROWS_PER_INSERT).map((rows) => db
+        .insert(claimAttachmentCids)
+        .values(rows.map(({ cid, phash, mediaType }) => ({
+        collectionId: input.collectionId,
+        cid,
+        claimId: input.claimId,
+        agentAddress: input.agentAddress,
+        phash,
+        mediaType,
+    })))
+        .onConflictDoNothing());
+    // CID rows carry no verdict — join the body registry (every register writes both, §3.2) so the
+    // countPrior filter applies here too. A left join keeps the fail-closed default: a missing
+    // body row reads as NULL = pending = blockable. The join rides `cbd_claim` (schema.ts).
+    const cidReads = chunk(attachments.map((a) => a.cid), CIDS_PER_READ).map((cids) => db
+        .select({
+        claimId: claimAttachmentCids.claimId,
+        agentAddress: claimAttachmentCids.agentAddress,
+        finalVerdict: claimBodyDigests.finalVerdict,
+        createdAt: claimAttachmentCids.createdAt,
+        cid: claimAttachmentCids.cid,
+        phash: claimAttachmentCids.phash,
+        mediaType: claimAttachmentCids.mediaType,
+    })
+        .from(claimAttachmentCids)
+        .leftJoin(claimBodyDigests, and(eq(claimBodyDigests.collectionId, claimAttachmentCids.collectionId), eq(claimBodyDigests.claimId, claimAttachmentCids.claimId)))
+        .where(and(eq(claimAttachmentCids.collectionId, input.collectionId), inArray(claimAttachmentCids.cid, cids), ne(claimAttachmentCids.claimId, input.claimId), verdictFilter, earlierOrUnknown)));
+    const results = await db.batch([
+        registerBody,
+        ...registerCids,
+        exactQ,
+        textPoolQ,
+        poolQ,
+        ...cidReads,
+    ]);
+    // The spreads cost `batch` its positional typing; the layout above is the one read back here.
+    const at = 1 + registerCids.length;
+    const exact = results[at];
+    const textPool = results[at + 1];
+    const phashPool = results[at + 2];
+    const cidHits = results.slice(at + 3).flat();
+    return siblingsOf(input, exact, textPool, cidHits, phashPool);
+}
+/** First occurrence wins — the same CID attached twice is one registry row either way. */
+function uniqueByCid(items) {
+    const seen = new Set();
+    return items.filter((item) => {
+        if (seen.has(item.cid))
+            return false;
+        seen.add(item.cid);
+        return true;
+    });
+}
+function chunk(items, size) {
+    const out = [];
+    for (let i = 0; i < items.length; i += size)
+        out.push(items.slice(i, i + size));
+    return out;
+}
+/** The batch's rows → the frozen sibling shape: L3 scored in JS, dates as ISO strings. */
+function siblingsOf(input, exact, textPool, cidHits, phashPool) {
+    // L3 in JS (header): score the pool, keep the floor, shortlist the top rows by similarity.
+    const selfTrigrams = trigramsOf(input.normalizedText);
+    const trigram = [];
+    for (const row of textPool) {
+        const text = row.normalizedText;
+        if (text === null)
+            continue; // narrowed by the isNotNull filter; the type doesn't know
+        const similarity = jaccard(selfTrigrams, trigramsOf(text));
+        if (similarity < TRIGRAM_MIN_SIMILARITY)
+            continue;
+        trigram.push({
+            claimId: row.claimId,
+            agentAddress: row.agentAddress,
+            finalVerdict: row.finalVerdict,
+            createdAt: row.createdAt.toISOString(),
+            similarity,
+            normalizedText: text,
+        });
+    }
+    trigram.sort((a, b) => b.similarity - a.similarity);
+    return {
+        exact: exact.map((r) => ({ ...r, createdAt: r.createdAt.toISOString() })),
+        cidHits: cidHits.map((r) => ({ ...r, createdAt: r.createdAt.toISOString() })),
+        trigram: trigram.slice(0, TRIGRAM_LIMIT),
+        // Narrowed by the isNotNull filter above; the type doesn't know.
+        phashPool: phashPool.filter((r) => r.phash !== null),
+    };
+}
+/**
+ * The token of a claim that never reached a decision: not in the rubric's `countPrior` vocabulary
+ * (`approved` / `pending_review` / `queued`), so it never blocks a later claim.
+ */
+export const VOID_TOKEN = "void";
+/**
+ * Decision verdict → the registry's countPrior token (dup spec §8/§9). Registry tokens are the
+ * rubric's `countPrior` vocabulary, NOT decision verdict words: approve/partial → `approved`
+ * (money moved — blockable under the default filter), reject → `rejected` (an honest resubmission
+ * never blocks), review → `pending_review`. Null only for the engine's `pending_review` (the fold
+ * writes the folded verdict; until then the rows stay NULL = pending = blockable). Every other row
+ * never reached a verdict — an `unusable` rubric, a facts-lane outcome (`invalid_facts`), a content
+ * refusal — and is `void` (P0-6): it used to stay NULL, so a claim that failed for our bug or an
+ * outage blocked every honest resubmission of the same evidence for ever.
+ */
+const VERDICT_TOKEN = {
+    approve: "approved",
+    partial: "approved",
+    reject: "rejected",
+    review: "pending_review",
+};
+export function registryVerdictToken(status, verdict) {
+    if (status === "pending_review")
+        return null;
+    if (status !== "decided" || !verdict)
+        return VOID_TOKEN;
+    return VERDICT_TOKEN[verdict] ?? verdict;
+}
+/**
+ * A failed ingest's registry rows (claim-ingest's terminal catch): `void`, unless the claim is
+ * waiting for review (its NULL is the real pending) or already carries a token. A rerun that does
+ * decide overwrites it in the decision's own batch. One statement; a no-op without `unique`.
+ */
+export function voidUndecidedUpdate(db, scope) {
+    return db
+        .update(claimBodyDigests)
+        .set({ finalVerdict: VOID_TOKEN })
+        .where(and(eq(claimBodyDigests.collectionId, scope.collectionId), eq(claimBodyDigests.claimId, scope.claimId), isNull(claimBodyDigests.finalVerdict), sql `not exists (select 1 from ${decisions} d where d.claim_id = ${scope.claimId} and d.status = 'pending_review')`));
+}
+/**
+ * The ONE-OFF backfill for registries written before `void` existed (owner-approved, P0-6): the
+ * same rule as `registryVerdictToken` + `voidUndecidedUpdate`, over every row at once — NULL rows
+ * whose claim has a decision row that is not `decided` / `pending_review` (a facts-lane outcome,
+ * a content refusal, `unusable`), or no decision row and a `failed` ingest. A claim still queued or
+ * processing, or waiting for review, keeps its NULL. Idempotent (it only touches NULL rows). An
+ * operator runs it with `wrangler d1 execute <DB> --remote --command "<this>"` (docs/guide.md);
+ * test/unique-store.test.ts runs this exact string; test/node/backfill-sql.test.ts holds the
+ * guide to it.
+ */
+export const VOID_UNDECIDED_BACKFILL_SQL = "UPDATE claim_body_digests SET final_verdict = 'void' WHERE final_verdict IS NULL AND (EXISTS (SELECT 1 FROM decisions d WHERE d.claim_id = claim_body_digests.claim_id AND d.status NOT IN ('decided', 'pending_review')) OR (NOT EXISTS (SELECT 1 FROM decisions d WHERE d.claim_id = claim_body_digests.claim_id) AND EXISTS (SELECT 1 FROM claim_ingests i WHERE i.claim_id = claim_body_digests.claim_id AND i.status = 'failed')));";
+/**
+ * The one UPDATE that denormalizes a final verdict onto the claim's registry rows — a `db.batch`
+ * item beside the decision write it belongs with (claim-ingest's insert, review-complete's fold),
+ * so a retry can never see the decision without its verdict token. A no-op when the claim was
+ * never registered (a rubric without `unique`): zero rows match.
+ */
+export function finalVerdictUpdate(db, scope) {
+    return db
+        .update(claimBodyDigests)
+        .set({ finalVerdict: scope.token })
+        .where(and(eq(claimBodyDigests.collectionId, scope.collectionId), eq(claimBodyDigests.claimId, scope.claimId)));
+}
+//# sourceMappingURL=unique-store.js.map

package/dist/lib/facts/stock/unique-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-store.js","sourceRoot":"","sources":["../../../../src/lib/facts/stock/unique-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAEH,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,EAAY,GAAG,EAAE,MAAM,aAAa,CAAC;AAG/F,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAyDtF,gGAAgG;AAChG,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAC;AAE1C,uFAAuF;AACvF,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,sFAAsF;AACtF,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B;;;;;;GAMG;AACH,MAAM,aAAa,GAAG,GAAG,CAAC;AAC1B,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAChC,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,cAAc,CAAC,CAAC;AAC9E,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC;AAEhC,MAAM,aAAa,GAAG,EAAE,CAAC;AAEzB;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChC,MAAM,MAAM,GAAG,KAAK,IAAI,GAAG,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qGAAqG;AACrG,SAAS,OAAO,CAAC,CAAc,EAAE,CAAc;IAC7C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,EAAE,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC;IACvC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;AAC1C,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,iBAAiB,CAAC,CAAS,EAAE,CAAS;IACpD,OAAO,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,KAA4D;IACpF,OAAO,GAAG,CAAA,GAAG,gBAAgB,iCAAiC,gBAAgB,8BAA8B,KAAK,CAAC,YAAY,qBAAqB,KAAK,CAAC,OAAO,4BAA4B,CAAC;AAC/L,CAAC;AAED,iGAAiG;AACjG,SAAS,gBAAgB,CAAC,UAAoB;IAC5C,MAAM,OAAO,GAAG,gBAAgB,CAAC,YAAY,CAAC;IAC9C,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC;QAC1B,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AACtB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,EAAY,EACZ,KAA0B;IAE1B,+FAA+F;IAC/F,MAAM,YAAY,GAAG,EAAE;SACpB,MAAM,CAAC,gBAAgB,CAAC;SACxB,MAAM,CAAC;QACN,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,cAAc,EAAE,KAAK,CAAC,cAAc;KACrC,CAAC;SACD,mBAAmB,EAAE,CAAC;IAEzB,2FAA2F;IAC3F,MAAM,OAAO,GAAG,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5D,MAAM,aAAa,GAAG,gBAAgB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACzD,MAAM,OAAO,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACxC,gGAAgG;IAChG,8FAA8F;IAC9F,MAAM,gBAAgB,GAAG,EAAE,CAAC,MAAM,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAEvE,MAAM,MAAM,GAAG,EAAE;SACd,MAAM,CAAC;QACN,OAAO,EAAE,gBAAgB,CAAC,OAAO;QACjC,YAAY,EAAE,gBAAgB,CAAC,YAAY;QAC3C,YAAY,EAAE,gBAAgB,CAAC,YAAY;QAC3C,SAAS,EAAE,gBAAgB,CAAC,SAAS;KACtC,CAAC;SACD,IAAI,CAAC,gBAAgB,CAAC;SACtB,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,EACrD,EAAE,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EACzC,OAAO,EACP,aAAa,EACb,OAAO,CACR,CACF,CAAC;IAEJ,iGAAiG;IACjG,4FAA4F;IAC5F,MAAM,SAAS,GAAG,EAAE;SACjB,MAAM,CAAC;QACN,OAAO,EAAE,gBAAgB,CAAC,OAAO;QACjC,YAAY,EAAE,gBAAgB,CAAC,YAAY;QAC3C,YAAY,EAAE,gBAAgB,CAAC,YAAY;QAC3C,SAAS,EAAE,gBAAgB,CAAC,SAAS;QACrC,cAAc,EAAE,gBAAgB,CAAC,cAAc;KAChD,CAAC;SACD,IAAI,CAAC,gBAAgB,CAAC;SACtB,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,EACrD,OAAO,EACP,SAAS,CAAC,gBAAgB,CAAC,cAAc,CAAC,EAC1C,aAAa,EACb,OAAO,CACR,CACF;SACA,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;SACzC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAE7B,MAAM,KAAK,GAAG,EAAE;SACb,MAAM,CAAC;QACN,OAAO,EAAE,mBAAmB,CAAC,OAAO;QACpC,YAAY,EAAE,mBAAmB,CAAC,YAAY;QAC9C,GAAG,EAAE,mBAAmB,CAAC,GAAG;QAC5B,KAAK,EAAE,mBAAmB,CAAC,KAAK;QAChC,SAAS,EAAE,mBAAmB,CAAC,SAAS;KACzC,CAAC;SACD,IAAI,CAAC,mBAAmB,CAAC;SACzB,QAAQ,CACP,gBAAgB,EAChB,GAAG,CACD,EAAE,CAAC,gBAAgB,CAAC,YAAY,EAAE,mBAAmB,CAAC,YAAY,CAAC,EACnE,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,mBAAmB,CAAC,OAAO,CAAC,CAC1D,CACF;SACA,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,mBAAmB,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,EACxD,EAAE,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EAC9C,SAAS,CAAC,mBAAmB,CAAC,KAAK,CAAC,EACpC,aAAa,EACb,gBAAgB,CACjB,CACF;SACA,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;SAC5C,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAE3B,kGAAkG;IAClG,8FAA8F;IAC9F,mDAAmD;IACnD,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACnD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;QAChG,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC;IAED,oFAAoF;IACpF,mGAAmG;IACnG,+FAA+F;IAC/F,sDAAsD;IACtD,MAAM,YAAY,GAAG,KAAK,CAAC,WAAW,EAAE,mBAAmB,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACxE,EAAE;SACC,MAAM,CAAC,mBAAmB,CAAC;SAC3B,MAAM,CACL,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;QACvC,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,GAAG;QACH,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,KAAK;QACL,SAAS;KACV,CAAC,CAAC,CACJ;SACA,mBAAmB,EAAE,CACzB,CAAC;IACF,+FAA+F;IAC/F,2FAA2F;IAC3F,wFAAwF;IACxF,MAAM,QAAQ,GAAG,KAAK,CACpB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAC7B,aAAa,CACd,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACb,EAAE;SACC,MAAM,CAAC;QACN,OAAO,EAAE,mBAAmB,CAAC,OAAO;QACpC,YAAY,EAAE,mBAAmB,CAAC,YAAY;QAC9C,YAAY,EAAE,gBAAgB,CAAC,YAAY;QAC3C,SAAS,EAAE,mBAAmB,CAAC,SAAS;QACxC,GAAG,EAAE,mBAAmB,CAAC,GAAG;QAC5B,KAAK,EAAE,mBAAmB,CAAC,KAAK;QAChC,SAAS,EAAE,mBAAmB,CAAC,SAAS;KACzC,CAAC;SACD,IAAI,CAAC,mBAAmB,CAAC;SACzB,QAAQ,CACP,gBAAgB,EAChB,GAAG,CACD,EAAE,CAAC,gBAAgB,CAAC,YAAY,EAAE,mBAAmB,CAAC,YAAY,CAAC,EACnE,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,mBAAmB,CAAC,OAAO,CAAC,CAC1D,CACF;SACA,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,mBAAmB,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,EACxD,OAAO,CAAC,mBAAmB,CAAC,GAAG,EAAE,IAAI,CAAC,EACtC,EAAE,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EAC9C,aAAa,EACb,gBAAgB,CACjB,CACF,CACJ,CAAC;IAEF,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC;QAC7B,YAAY;QACZ,GAAG,YAAY;QACf,MAAM;QACN,SAAS;QACT,KAAK;QACL,GAAG,QAAQ;KACkD,CAAC,CAAC;IACjE,8FAA8F;IAC9F,MAAM,EAAE,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;IACnC,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAA2B,CAAC;IACpD,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,GAAG,CAAC,CAA8B,CAAC;IAC9D,MAAM,SAAS,GAAG,OAAO,CAAC,EAAE,GAAG,CAAC,CAA0B,CAAC;IAC3D,MAAM,OAAO,GAAI,OAAO,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAgB,CAAC,IAAI,EAAE,CAAC;IAC7D,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;AAChE,CAAC;AAED,0FAA0F;AAC1F,SAAS,WAAW,CAA4B,KAAmB;IACjE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,KAAK,CAAI,KAAmB,EAAE,IAAY;IACjD,MAAM,GAAG,GAAU,EAAE,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChF,OAAO,GAAG,CAAC;AACb,CAAC;AAID,0FAA0F;AAC1F,SAAS,UAAU,CACjB,KAA0B,EAC1B,KAAoB,EACpB,QAA6D,EAC7D,OAA0F,EAC1F,SAMG;IAEH,2FAA2F;IAC3F,MAAM,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACtD,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,cAAc,CAAC;QAChC,IAAI,IAAI,KAAK,IAAI;YAAE,SAAS,CAAC,0DAA0D;QACvF,MAAM,UAAU,GAAG,OAAO,CAAC,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,IAAI,UAAU,GAAG,sBAAsB;YAAE,SAAS;QAClD,OAAO,CAAC,IAAI,CAAC;YACX,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,WAAW,EAAE;YACtC,UAAU;YACV,cAAc,EAAE,IAAI;SACrB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAEpD,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACzE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QAC7E,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC;QACxC,iEAAiE;QACjE,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAqC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC;KACxF,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,MAAM,CAAC;AAEjC;;;;;;;;;GASG;AACH,MAAM,aAAa,GAA2B;IAC5C,OAAO,EAAE,UAAU;IACnB,OAAO,EAAE,UAAU;IACnB,MAAM,EAAE,UAAU;IAClB,MAAM,EAAE,gBAAgB;CACzB,CAAC;AAEF,MAAM,UAAU,oBAAoB,CAAC,MAAc,EAAE,OAAsB;IACzE,IAAI,MAAM,KAAK,gBAAgB;QAAE,OAAO,IAAI,CAAC;IAC7C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO;QAAE,OAAO,UAAU,CAAC;IACxD,OAAO,aAAa,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC;AAC3C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,EAAY,EACZ,KAAgD;IAEhD,OAAO,EAAE;SACN,MAAM,CAAC,gBAAgB,CAAC;SACxB,GAAG,CAAC,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;SACjC,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,EACrD,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EAC3C,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,EACrC,GAAG,CAAA,6BAA6B,SAAS,yBAAyB,KAAK,CAAC,OAAO,mCAAmC,CACnH,CACF,CAAC;AACN,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,2BAA2B,GACtC,0aAA0a,CAAC;AAE7a;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,EAAY,EACZ,KAA+D;IAE/D,OAAO,EAAE;SACN,MAAM,CAAC,gBAAgB,CAAC;SACxB,GAAG,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;SAClC,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,EACrD,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAC5C,CACF,CAAC;AACN,CAAC"}

package/dist/lib/facts/stock/unique.d.ts

@@ -0,0 +1,35 @@
+/**
+ * The duplicate-detection resolver (dup-detection spec §3 — order is normative) — the stock
+ * producer's `unique` fact — detection lives in the oracle (docs/ENGINE-CONTRACT.md "Fact
+ * coverage + manifest"): canonicalize → register self FIRST → collect siblings → pHash the
+ * attachment lanes → score → gray-zone AI judge → score again with the judgements folded in.
+ * Runs once, inside the resolve phase; the returned `UniqueFact` freezes into the FactSet, the
+ * ENGINE's `decide()` branches on its `band` (and on `aiOutcome: "failed"` in the AI zone), and
+ * nothing about `unique` touches network/DB/AI after.
+ *
+ * NOT ported: the PDF-render lane (eval-engine's `pdf-render.ts`, Cloudflare Browser Run). The
+ * kit has no `browser` binding, so a PDF attachment registers with its CID only (`phash: null`) —
+ * the body-digest + CID lanes still catch a resubmitted PDF byte-for-byte; a re-exported one is
+ * caught only when its text answers match. `pdfPagesRendered`/`pdfsScreened` stay on the fact,
+ * always 0, so the engine's trace shape is the same as eval-engine's.
+ *
+ * Degrade-not-throw for evidence lanes (an unfetchable attachment, a garbage judge answer
+ * contribute nothing); fail LOUDLY for our own faults (missing HMAC key or DB) — a rule the owner
+ * declared must never silently not run.
+ */
+import type { Attachment } from "../../ixo/attachments.js";
+import type { ProducerDeps } from "../producer.js";
+import type { UniqueRule } from "./rule-defaults.js";
+import { type UniqueFact } from "./unique-score.js";
+export type UniqueDeps = Pick<ProducerDeps, "config" | "logger" | "trace" | "media" | "settings" | "db" | "env" | "cache" | "aiSpend" | "aiCalls" | "factCache">;
+export interface UniqueResolveInput {
+    /** The declaration resolved to a full rule (rule-defaults.ts). */
+    rule: UniqueRule;
+    collectionId: string;
+    claimId: string;
+    agentAddress: string | null;
+    body: Record<string, unknown>;
+    attachments: Attachment[];
+}
+export declare function resolveUnique(deps: UniqueDeps, input: UniqueResolveInput): Promise<UniqueFact>;
+//# sourceMappingURL=unique.d.ts.map

package/dist/lib/facts/stock/unique.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique.d.ts","sourceRoot":"","sources":["../../../../src/lib/facts/stock/unique.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAShD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAElD,OAAO,EAAe,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAG9D,MAAM,MAAM,UAAU,GAAG,IAAI,CAC3B,YAAY,EACV,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,OAAO,GACP,UAAU,GACV,IAAI,GACJ,KAAK,GACL,OAAO,GACP,SAAS,GACT,SAAS,GACT,WAAW,CACd,CAAC;AAEF,MAAM,WAAW,kBAAkB;IACjC,kEAAkE;IAClE,IAAI,EAAE,UAAU,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,WAAW,EAAE,UAAU,EAAE,CAAC;CAC3B;AA8ID,wBAAsB,aAAa,CACjC,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,kBAAkB,GACxB,OAAO,CAAC,UAAU,CAAC,CAoMrB"}