@anuma/sdk 10.6.0 → 10.6.2

package/dist/expo/index.cjs

@@ -18537,6 +18537,52 @@ async function getDecayCandidatesRawOp(ctx) {
     trustTier: raw.trust_tier ?? null
   }));
 }
+async function applyDecayTransitionsOp(ctx, candidates, opts) {
+  assertVaultScopeForSweep(ctx);
+  const byId = new Map(candidates.map((candidate) => [candidate.uniqueId, candidate]));
+  const ids = Array.from(byId.keys());
+  const changed = /* @__PURE__ */ new Set();
+  const CHUNK = 500;
+  for (let i = 0; i < ids.length; i += CHUNK) {
+    let applied = [];
+    try {
+      await ctx.database.write(async () => {
+        await assertCanWrite2(ctx);
+        const records = await ctx.vaultMemoryCollection.query(
+          import_watermelondb21.Q.where("id", import_watermelondb21.Q.oneOf(ids.slice(i, i + CHUNK))),
+          ...ctx.userId !== void 0 ? [import_watermelondb21.Q.where("user_id", ctx.userId)] : []
+        ).fetch();
+        const eligible = records.filter((record2) => {
+          if (record2.isDeleted || !isOwnedByCtxUser(ctx, record2)) return false;
+          if (opts.transition === "delete") {
+            return record2.archivedAt !== null && opts.now - record2.archivedAt > opts.hardDeleteWindowMs;
+          }
+          const candidate = byId.get(record2.id);
+          return record2.archivedAt === null && record2.updatedAt.getTime() === candidate.updatedAt && (record2.lastObservedAt ?? null) === (candidate.lastObservedAt ?? null);
+        });
+        const prepared = eligible.map(
+          (record2) => record2.prepareUpdate((row) => {
+            if (opts.transition === "archive") row._setRaw("archived_at", opts.now);
+            else row._setRaw("is_deleted", true);
+          })
+        );
+        if (prepared.length > 0) await ctx.database.batch(prepared);
+        applied = eligible.map((record2) => record2.id);
+      });
+    } catch {
+      continue;
+    }
+    for (const id2 of applied) changed.add(id2);
+    if (opts.transition === "delete" && ctx.entityCtx) {
+      try {
+        await unlinkMemoryEntitiesOp(ctx.entityCtx, applied);
+      } catch {
+        continue;
+      }
+    }
+  }
+  return changed;
+}
 async function archiveVaultMemoryOp(ctx, id2, opts) {
   try {
     const record2 = await ctx.vaultMemoryCollection.find(id2);
@@ -23137,25 +23183,8 @@ function isBorderline(input) {
 function vaultDecayBackend(vaultCtx) {
   return {
     candidates: () => getDecayCandidatesRawOp(vaultCtx),
-    archive: async (rows, now) => {
-      const archived = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) archived.add(c.uniqueId);
-      }
-      return archived;
-    },
-    hardDelete: async (rows, deleteOptions) => {
-      const deleted = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
-      }
-      return deleted;
-    }
+    archive: (rows, now) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "archive", now }),
+    hardDelete: (rows, deleteOptions) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "delete", ...deleteOptions })
   };
 }
 function createDecaySweeper(options) {
@@ -25157,6 +25186,7 @@ function createLocalMemoryStore(options) {
     "trust_tier",
     "superseded_by",
     "visibility",
+    "twin_opt_in",
     "published_at",
     "geohash",
     "topics",
@@ -26348,6 +26378,7 @@ function subscriptionState({ memory, version }) {
         memory.event_time_kind,
         memory.trust_tier,
         memory.visibility,
+        memory.twin_opt_in,
         memory.published_at,
         memory.geohash,
         memory.topics,

package/dist/expo/index.mjs

@@ -16867,6 +16867,52 @@ async function getDecayCandidatesRawOp(ctx) {
     trustTier: raw.trust_tier ?? null
   }));
 }
+async function applyDecayTransitionsOp(ctx, candidates, opts) {
+  assertVaultScopeForSweep(ctx);
+  const byId = new Map(candidates.map((candidate) => [candidate.uniqueId, candidate]));
+  const ids = Array.from(byId.keys());
+  const changed = /* @__PURE__ */ new Set();
+  const CHUNK = 500;
+  for (let i = 0; i < ids.length; i += CHUNK) {
+    let applied = [];
+    try {
+      await ctx.database.write(async () => {
+        await assertCanWrite2(ctx);
+        const records = await ctx.vaultMemoryCollection.query(
+          Q6.where("id", Q6.oneOf(ids.slice(i, i + CHUNK))),
+          ...ctx.userId !== void 0 ? [Q6.where("user_id", ctx.userId)] : []
+        ).fetch();
+        const eligible = records.filter((record2) => {
+          if (record2.isDeleted || !isOwnedByCtxUser(ctx, record2)) return false;
+          if (opts.transition === "delete") {
+            return record2.archivedAt !== null && opts.now - record2.archivedAt > opts.hardDeleteWindowMs;
+          }
+          const candidate = byId.get(record2.id);
+          return record2.archivedAt === null && record2.updatedAt.getTime() === candidate.updatedAt && (record2.lastObservedAt ?? null) === (candidate.lastObservedAt ?? null);
+        });
+        const prepared = eligible.map(
+          (record2) => record2.prepareUpdate((row) => {
+            if (opts.transition === "archive") row._setRaw("archived_at", opts.now);
+            else row._setRaw("is_deleted", true);
+          })
+        );
+        if (prepared.length > 0) await ctx.database.batch(prepared);
+        applied = eligible.map((record2) => record2.id);
+      });
+    } catch {
+      continue;
+    }
+    for (const id2 of applied) changed.add(id2);
+    if (opts.transition === "delete" && ctx.entityCtx) {
+      try {
+        await unlinkMemoryEntitiesOp(ctx.entityCtx, applied);
+      } catch {
+        continue;
+      }
+    }
+  }
+  return changed;
+}
 async function archiveVaultMemoryOp(ctx, id2, opts) {
   try {
     const record2 = await ctx.vaultMemoryCollection.find(id2);
@@ -21436,25 +21482,8 @@ function isBorderline(input) {
 function vaultDecayBackend(vaultCtx) {
   return {
     candidates: () => getDecayCandidatesRawOp(vaultCtx),
-    archive: async (rows, now) => {
-      const archived = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) archived.add(c.uniqueId);
-      }
-      return archived;
-    },
-    hardDelete: async (rows, deleteOptions) => {
-      const deleted = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
-      }
-      return deleted;
-    }
+    archive: (rows, now) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "archive", now }),
+    hardDelete: (rows, deleteOptions) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "delete", ...deleteOptions })
   };
 }
 function createDecaySweeper(options) {
@@ -23441,6 +23470,7 @@ function createLocalMemoryStore(options) {
     "trust_tier",
     "superseded_by",
     "visibility",
+    "twin_opt_in",
     "published_at",
     "geohash",
     "topics",
@@ -24627,6 +24657,7 @@ function subscriptionState({ memory, version }) {
         memory.event_time_kind,
         memory.trust_tier,
         memory.visibility,
+        memory.twin_opt_in,
         memory.published_at,
         memory.geohash,
         memory.topics,

package/dist/pii/transformers.cjs

@@ -42,20 +42,24 @@ var DEFAULT_TAG_MAP = {
   MISC: void 0
 };
 function placeTokens(tokens, text) {
-  const placed = [];
+  return tokens.map((token) => {
+    const { start = -1, end = -1 } = token;
+    return Number.isInteger(start) && Number.isInteger(end) && start >= 0 && end > start && end <= text.length ? { ...token, start, end } : { ...token, start: -1, end: -1 };
+  });
+}
+function tokenOffsets(text, tokenizer) {
+  const { input_ids } = tokenizer(text, { return_tensor: false, truncation: true });
   let cursor = 0;
-  for (const t of tokens) {
-    const surface = t.word.startsWith("##") ? t.word.slice(2) : t.word;
+  return input_ids.map((id) => {
+    const word = tokenizer.decode([id], { skip_special_tokens: true });
+    const surface = word.startsWith("##") ? word.slice(2) : word;
+    if (!surface) return { start: -1, end: -1 };
     const start = text.indexOf(surface, cursor);
-    if (start < 0) {
-      placed.push({ ...t, start: -1, end: -1 });
-      continue;
-    }
+    if (start < 0) return { start: -1, end: -1 };
     const end = start + surface.length;
-    placed.push({ ...t, start, end });
     cursor = end;
-  }
-  return placed;
+    return { start, end };
+  });
 }
 function aggregateTokens(tokens, text, tagMap, minScore) {
   const placed = placeTokens(tokens, text);
@@ -115,7 +119,14 @@ function createTransformersNerDetector(options = {}) {
       if (!text) return [];
       const classify = await load();
       const tokens = await classify(text);
-      return aggregateTokens(tokens, text, tagMap, minScore);
+      if (!tokens.length) return [];
+      const offsets = tokenOffsets(text, classify.tokenizer);
+      return aggregateTokens(
+        tokens.map((token) => ({ ...token, ...offsets[token.index] })),
+        text,
+        tagMap,
+        minScore
+      );
     }
   };
 }

package/dist/pii/transformers.d.mts

@@ -54,13 +54,10 @@ interface RawToken {
     score: number;
     index: number;
     word: string;
+    start?: number;
+    end?: number;
 }
-/**
- * Aggregate B-/I- subword tokens into whole-entity spans. A new entity starts
- * on a `B-` tag or a tag change; contiguous `I-` tokens (and WordPiece "##"
- * continuations) of the same base tag extend it. (The SDK additionally snaps
- * spans to word boundaries, so dropped trailing subwords are recovered there.)
- */
+/** Aggregate classified tokens with character offsets into whole-entity spans. */
 declare function aggregateTokens(tokens: RawToken[], text: string, tagMap: Record<string, string | undefined>, minScore: number): PiiSpan[];
 /**
  * Create a Transformers.js-backed {@link NerDetector}. The returned detector

package/dist/pii/transformers.d.ts

@@ -54,13 +54,10 @@ interface RawToken {
     score: number;
     index: number;
     word: string;
+    start?: number;
+    end?: number;
 }
-/**
- * Aggregate B-/I- subword tokens into whole-entity spans. A new entity starts
- * on a `B-` tag or a tag change; contiguous `I-` tokens (and WordPiece "##"
- * continuations) of the same base tag extend it. (The SDK additionally snaps
- * spans to word boundaries, so dropped trailing subwords are recovered there.)
- */
+/** Aggregate classified tokens with character offsets into whole-entity spans. */
 declare function aggregateTokens(tokens: RawToken[], text: string, tagMap: Record<string, string | undefined>, minScore: number): PiiSpan[];
 /**
  * Create a Transformers.js-backed {@link NerDetector}. The returned detector

package/dist/pii/transformers.mjs

@@ -7,20 +7,24 @@ var DEFAULT_TAG_MAP = {
   MISC: void 0
 };
 function placeTokens(tokens, text) {
-  const placed = [];
+  return tokens.map((token) => {
+    const { start = -1, end = -1 } = token;
+    return Number.isInteger(start) && Number.isInteger(end) && start >= 0 && end > start && end <= text.length ? { ...token, start, end } : { ...token, start: -1, end: -1 };
+  });
+}
+function tokenOffsets(text, tokenizer) {
+  const { input_ids } = tokenizer(text, { return_tensor: false, truncation: true });
   let cursor = 0;
-  for (const t of tokens) {
-    const surface = t.word.startsWith("##") ? t.word.slice(2) : t.word;
+  return input_ids.map((id) => {
+    const word = tokenizer.decode([id], { skip_special_tokens: true });
+    const surface = word.startsWith("##") ? word.slice(2) : word;
+    if (!surface) return { start: -1, end: -1 };
     const start = text.indexOf(surface, cursor);
-    if (start < 0) {
-      placed.push({ ...t, start: -1, end: -1 });
-      continue;
-    }
+    if (start < 0) return { start: -1, end: -1 };
     const end = start + surface.length;
-    placed.push({ ...t, start, end });
     cursor = end;
-  }
-  return placed;
+    return { start, end };
+  });
 }
 function aggregateTokens(tokens, text, tagMap, minScore) {
   const placed = placeTokens(tokens, text);
@@ -80,7 +84,14 @@ function createTransformersNerDetector(options = {}) {
       if (!text) return [];
       const classify = await load();
       const tokens = await classify(text);
-      return aggregateTokens(tokens, text, tagMap, minScore);
+      if (!tokens.length) return [];
+      const offsets = tokenOffsets(text, classify.tokenizer);
+      return aggregateTokens(
+        tokens.map((token) => ({ ...token, ...offsets[token.index] })),
+        text,
+        tagMap,
+        minScore
+      );
     }
   };
 }

package/dist/react/index.cjs

@@ -20374,6 +20374,52 @@ async function getDecayCandidatesRawOp(ctx) {
     trustTier: raw.trust_tier ?? null
   }));
 }
+async function applyDecayTransitionsOp(ctx, candidates, opts) {
+  assertVaultScopeForSweep(ctx);
+  const byId = new Map(candidates.map((candidate) => [candidate.uniqueId, candidate]));
+  const ids = Array.from(byId.keys());
+  const changed = /* @__PURE__ */ new Set();
+  const CHUNK = 500;
+  for (let i = 0; i < ids.length; i += CHUNK) {
+    let applied = [];
+    try {
+      await ctx.database.write(async () => {
+        await assertCanWrite2(ctx);
+        const records = await ctx.vaultMemoryCollection.query(
+          import_watermelondb24.Q.where("id", import_watermelondb24.Q.oneOf(ids.slice(i, i + CHUNK))),
+          ...ctx.userId !== void 0 ? [import_watermelondb24.Q.where("user_id", ctx.userId)] : []
+        ).fetch();
+        const eligible = records.filter((record2) => {
+          if (record2.isDeleted || !isOwnedByCtxUser(ctx, record2)) return false;
+          if (opts.transition === "delete") {
+            return record2.archivedAt !== null && opts.now - record2.archivedAt > opts.hardDeleteWindowMs;
+          }
+          const candidate = byId.get(record2.id);
+          return record2.archivedAt === null && record2.updatedAt.getTime() === candidate.updatedAt && (record2.lastObservedAt ?? null) === (candidate.lastObservedAt ?? null);
+        });
+        const prepared = eligible.map(
+          (record2) => record2.prepareUpdate((row) => {
+            if (opts.transition === "archive") row._setRaw("archived_at", opts.now);
+            else row._setRaw("is_deleted", true);
+          })
+        );
+        if (prepared.length > 0) await ctx.database.batch(prepared);
+        applied = eligible.map((record2) => record2.id);
+      });
+    } catch {
+      continue;
+    }
+    for (const id2 of applied) changed.add(id2);
+    if (opts.transition === "delete" && ctx.entityCtx) {
+      try {
+        await unlinkMemoryEntitiesOp(ctx.entityCtx, applied);
+      } catch {
+        continue;
+      }
+    }
+  }
+  return changed;
+}
 async function archiveVaultMemoryOp(ctx, id2, opts) {
   try {
     const record2 = await ctx.vaultMemoryCollection.find(id2);
@@ -25444,25 +25490,8 @@ function isBorderline(input) {
 function vaultDecayBackend(vaultCtx) {
   return {
     candidates: () => getDecayCandidatesRawOp(vaultCtx),
-    archive: async (rows, now) => {
-      const archived = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) archived.add(c.uniqueId);
-      }
-      return archived;
-    },
-    hardDelete: async (rows, deleteOptions) => {
-      const deleted = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
-      }
-      return deleted;
-    }
+    archive: (rows, now) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "archive", now }),
+    hardDelete: (rows, deleteOptions) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "delete", ...deleteOptions })
   };
 }
 function createDecaySweeper(options) {
@@ -27490,6 +27519,7 @@ function createLocalMemoryStore(options) {
     "trust_tier",
     "superseded_by",
     "visibility",
+    "twin_opt_in",
     "published_at",
     "geohash",
     "topics",
@@ -28681,6 +28711,7 @@ function subscriptionState({ memory, version }) {
         memory.event_time_kind,
         memory.trust_tier,
         memory.visibility,
+        memory.twin_opt_in,
         memory.published_at,
         memory.geohash,
         memory.topics,

package/dist/react/index.mjs

@@ -18500,6 +18500,52 @@ async function getDecayCandidatesRawOp(ctx) {
     trustTier: raw.trust_tier ?? null
   }));
 }
+async function applyDecayTransitionsOp(ctx, candidates, opts) {
+  assertVaultScopeForSweep(ctx);
+  const byId = new Map(candidates.map((candidate) => [candidate.uniqueId, candidate]));
+  const ids = Array.from(byId.keys());
+  const changed = /* @__PURE__ */ new Set();
+  const CHUNK = 500;
+  for (let i = 0; i < ids.length; i += CHUNK) {
+    let applied = [];
+    try {
+      await ctx.database.write(async () => {
+        await assertCanWrite2(ctx);
+        const records = await ctx.vaultMemoryCollection.query(
+          Q9.where("id", Q9.oneOf(ids.slice(i, i + CHUNK))),
+          ...ctx.userId !== void 0 ? [Q9.where("user_id", ctx.userId)] : []
+        ).fetch();
+        const eligible = records.filter((record2) => {
+          if (record2.isDeleted || !isOwnedByCtxUser(ctx, record2)) return false;
+          if (opts.transition === "delete") {
+            return record2.archivedAt !== null && opts.now - record2.archivedAt > opts.hardDeleteWindowMs;
+          }
+          const candidate = byId.get(record2.id);
+          return record2.archivedAt === null && record2.updatedAt.getTime() === candidate.updatedAt && (record2.lastObservedAt ?? null) === (candidate.lastObservedAt ?? null);
+        });
+        const prepared = eligible.map(
+          (record2) => record2.prepareUpdate((row) => {
+            if (opts.transition === "archive") row._setRaw("archived_at", opts.now);
+            else row._setRaw("is_deleted", true);
+          })
+        );
+        if (prepared.length > 0) await ctx.database.batch(prepared);
+        applied = eligible.map((record2) => record2.id);
+      });
+    } catch {
+      continue;
+    }
+    for (const id2 of applied) changed.add(id2);
+    if (opts.transition === "delete" && ctx.entityCtx) {
+      try {
+        await unlinkMemoryEntitiesOp(ctx.entityCtx, applied);
+      } catch {
+        continue;
+      }
+    }
+  }
+  return changed;
+}
 async function archiveVaultMemoryOp(ctx, id2, opts) {
   try {
     const record2 = await ctx.vaultMemoryCollection.find(id2);
@@ -23536,25 +23582,8 @@ function isBorderline(input) {
 function vaultDecayBackend(vaultCtx) {
   return {
     candidates: () => getDecayCandidatesRawOp(vaultCtx),
-    archive: async (rows, now) => {
-      const archived = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) archived.add(c.uniqueId);
-      }
-      return archived;
-    },
-    hardDelete: async (rows, deleteOptions) => {
-      const deleted = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
-      }
-      return deleted;
-    }
+    archive: (rows, now) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "archive", now }),
+    hardDelete: (rows, deleteOptions) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "delete", ...deleteOptions })
   };
 }
 function createDecaySweeper(options) {
@@ -25567,6 +25596,7 @@ function createLocalMemoryStore(options) {
     "trust_tier",
     "superseded_by",
     "visibility",
+    "twin_opt_in",
     "published_at",
     "geohash",
     "topics",
@@ -26753,6 +26783,7 @@ function subscriptionState({ memory, version }) {
         memory.event_time_kind,
         memory.trust_tier,
         memory.visibility,
+        memory.twin_opt_in,
         memory.published_at,
         memory.geohash,
         memory.topics,

package/dist/server/index.cjs

@@ -29987,6 +29987,52 @@ async function getDecayCandidatesRawOp(ctx) {
     trustTier: raw.trust_tier ?? null
   }));
 }
+async function applyDecayTransitionsOp(ctx, candidates, opts) {
+  assertVaultScopeForSweep(ctx);
+  const byId = new Map(candidates.map((candidate) => [candidate.uniqueId, candidate]));
+  const ids = Array.from(byId.keys());
+  const changed = /* @__PURE__ */ new Set();
+  const CHUNK = 500;
+  for (let i = 0; i < ids.length; i += CHUNK) {
+    let applied = [];
+    try {
+      await ctx.database.write(async () => {
+        await assertCanWrite2(ctx);
+        const records = await ctx.vaultMemoryCollection.query(
+          import_watermelondb19.Q.where("id", import_watermelondb19.Q.oneOf(ids.slice(i, i + CHUNK))),
+          ...ctx.userId !== void 0 ? [import_watermelondb19.Q.where("user_id", ctx.userId)] : []
+        ).fetch();
+        const eligible = records.filter((record) => {
+          if (record.isDeleted || !isOwnedByCtxUser(ctx, record)) return false;
+          if (opts.transition === "delete") {
+            return record.archivedAt !== null && opts.now - record.archivedAt > opts.hardDeleteWindowMs;
+          }
+          const candidate = byId.get(record.id);
+          return record.archivedAt === null && record.updatedAt.getTime() === candidate.updatedAt && (record.lastObservedAt ?? null) === (candidate.lastObservedAt ?? null);
+        });
+        const prepared = eligible.map(
+          (record) => record.prepareUpdate((row) => {
+            if (opts.transition === "archive") row._setRaw("archived_at", opts.now);
+            else row._setRaw("is_deleted", true);
+          })
+        );
+        if (prepared.length > 0) await ctx.database.batch(prepared);
+        applied = eligible.map((record) => record.id);
+      });
+    } catch {
+      continue;
+    }
+    for (const id of applied) changed.add(id);
+    if (opts.transition === "delete" && ctx.entityCtx) {
+      try {
+        await unlinkMemoryEntitiesOp(ctx.entityCtx, applied);
+      } catch {
+        continue;
+      }
+    }
+  }
+  return changed;
+}
 async function archiveVaultMemoryOp(ctx, id, opts) {
   try {
     const record = await ctx.vaultMemoryCollection.find(id);
@@ -34752,25 +34798,8 @@ function isBorderline(input) {
 function vaultDecayBackend(vaultCtx) {
   return {
     candidates: () => getDecayCandidatesRawOp(vaultCtx),
-    archive: async (rows, now) => {
-      const archived = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) archived.add(c.uniqueId);
-      }
-      return archived;
-    },
-    hardDelete: async (rows, deleteOptions) => {
-      const deleted = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
-      }
-      return deleted;
-    }
+    archive: (rows, now) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "archive", now }),
+    hardDelete: (rows, deleteOptions) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "delete", ...deleteOptions })
   };
 }
 function createDecaySweeper(options) {
@@ -36798,6 +36827,7 @@ function createLocalMemoryStore(options) {
     "trust_tier",
     "superseded_by",
     "visibility",
+    "twin_opt_in",
     "published_at",
     "geohash",
     "topics",

package/dist/server/index.mjs

@@ -28245,6 +28245,52 @@ async function getDecayCandidatesRawOp(ctx) {
     trustTier: raw.trust_tier ?? null
   }));
 }
+async function applyDecayTransitionsOp(ctx, candidates, opts) {
+  assertVaultScopeForSweep(ctx);
+  const byId = new Map(candidates.map((candidate) => [candidate.uniqueId, candidate]));
+  const ids = Array.from(byId.keys());
+  const changed = /* @__PURE__ */ new Set();
+  const CHUNK = 500;
+  for (let i = 0; i < ids.length; i += CHUNK) {
+    let applied = [];
+    try {
+      await ctx.database.write(async () => {
+        await assertCanWrite2(ctx);
+        const records = await ctx.vaultMemoryCollection.query(
+          import_watermelondb19.Q.where("id", import_watermelondb19.Q.oneOf(ids.slice(i, i + CHUNK))),
+          ...ctx.userId !== void 0 ? [import_watermelondb19.Q.where("user_id", ctx.userId)] : []
+        ).fetch();
+        const eligible = records.filter((record) => {
+          if (record.isDeleted || !isOwnedByCtxUser(ctx, record)) return false;
+          if (opts.transition === "delete") {
+            return record.archivedAt !== null && opts.now - record.archivedAt > opts.hardDeleteWindowMs;
+          }
+          const candidate = byId.get(record.id);
+          return record.archivedAt === null && record.updatedAt.getTime() === candidate.updatedAt && (record.lastObservedAt ?? null) === (candidate.lastObservedAt ?? null);
+        });
+        const prepared = eligible.map(
+          (record) => record.prepareUpdate((row) => {
+            if (opts.transition === "archive") row._setRaw("archived_at", opts.now);
+            else row._setRaw("is_deleted", true);
+          })
+        );
+        if (prepared.length > 0) await ctx.database.batch(prepared);
+        applied = eligible.map((record) => record.id);
+      });
+    } catch {
+      continue;
+    }
+    for (const id of applied) changed.add(id);
+    if (opts.transition === "delete" && ctx.entityCtx) {
+      try {
+        await unlinkMemoryEntitiesOp(ctx.entityCtx, applied);
+      } catch {
+        continue;
+      }
+    }
+  }
+  return changed;
+}
 async function archiveVaultMemoryOp(ctx, id, opts) {
   try {
     const record = await ctx.vaultMemoryCollection.find(id);
@@ -32982,25 +33028,8 @@ function isBorderline(input) {
 function vaultDecayBackend(vaultCtx) {
   return {
     candidates: () => getDecayCandidatesRawOp(vaultCtx),
-    archive: async (rows, now) => {
-      const archived = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) archived.add(c.uniqueId);
-      }
-      return archived;
-    },
-    hardDelete: async (rows, deleteOptions) => {
-      const deleted = /* @__PURE__ */ new Set();
-      for (const c of rows) {
-        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
-      }
-      return deleted;
-    }
+    archive: (rows, now) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "archive", now }),
+    hardDelete: (rows, deleteOptions) => applyDecayTransitionsOp(vaultCtx, rows, { transition: "delete", ...deleteOptions })
   };
 }
 function createDecaySweeper(options) {
@@ -35013,6 +35042,7 @@ function createLocalMemoryStore(options) {
     "trust_tier",
     "superseded_by",
     "visibility",
+    "twin_opt_in",
     "published_at",
     "geohash",
     "topics",

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@anuma/sdk",
-  "version": "10.6.0",
+  "version": "10.6.2",
   "description": "",
   "main": "./dist/index.cjs",
   "module": "./dist/index.mjs",