@qntx/nostr 0.0.1 → 0.2.0

package/dist/{event-B5D2jxt_.d.mts → event-fU3Y01PR.d.mts}

@@ -1,10 +1,13 @@
 //#region src/core/tag.d.ts
 /** A NIP-01 tag: first element is the name, rest are values. */
-type Tag = readonly string[];
+type Tag = ReadonlyArray<string>;
 /** Mutable tag builder input. */
 type TagInput = string[];
+/** Type guard: a non-empty array of strings. */
 declare function isTag(value: unknown): value is Tag;
+/** First element of a tag (its name). */
 declare function tagName(tag: Tag): string;
+/** Second element of a tag (its primary value), or undefined for a bare name tag. */
 declare function tagValue(tag: Tag): string | undefined;
 /** Construct common tags. */
 declare const Tag: {
@@ -17,7 +20,7 @@ declare const Tag: {
   readonly k: (kind: number | string) => Tag;
 };
 /** First `d` tag value on an event, if any. */
-declare function getDTag(tags: readonly Tag[]): string | undefined;
+declare function getDTag(tags: ReadonlyArray<Tag>): string | undefined;
 /** NIP-01 `a` tag: `kind:pubkey:identifier` (identifier may be empty and may contain extra colons). */
 type EventAddress = {
   kind: number;
@@ -26,22 +29,23 @@ type EventAddress = {
 };
 /** Parse a NIP-01 addressable/replaceable coordinate. */
 declare function parseEventAddress(value: string): EventAddress | undefined;
+/** Format an address as a `kind:pubkey:dTag` coordinate string. */
 declare function formatEventAddress(kind: number, pubkey: string, identifier?: string): string;
 /**
- * Coordinate for replaceable (`kind:pubkey:`) and addressable (`kind:pubkey:d`) events.
- * Undefined for regular/ephemeral kinds.
+ * Coordinate for replaceable (`kind:pubkey:`) and addressable (`kind:pubkey:d`) events. Undefined
+ * for regular/ephemeral kinds.
  */
 declare function eventAddress(event: {
   kind: number;
   pubkey: string;
-  tags: readonly Tag[];
+  tags: ReadonlyArray<Tag>;
 }): string | undefined;
 //#endregion
 //#region src/core/event.d.ts
 /** Wire event template before pubkey/id/sig. */
 type EventTemplate = {
   readonly kind: number;
-  readonly tags: readonly Tag[];
+  readonly tags: ReadonlyArray<Tag>;
   readonly content: string;
   readonly created_at: number;
 };
@@ -50,8 +54,8 @@ type UnsignedEvent = EventTemplate & {
   readonly pubkey: string;
 };
 /**
- * Fully formed NIP-01 event (JSON-friendly plain object).
- * Fields are readonly at the type level; wire interop remains plain JSON.
+ * Fully formed NIP-01 event (JSON-friendly plain object). Fields are readonly at the type level;
+ * wire interop remains plain JSON.
  */
 type Event = UnsignedEvent & {
   readonly id: string;
@@ -59,29 +63,28 @@ type Event = UnsignedEvent & {
 };
 declare function markVerified(event: Event): void;
 declare function markUnverified(event: Event): void;
-declare function isMarkedVerified(event: Event): boolean;
 declare function isMarkedFailed(event: Event): boolean;
 /** Structural validation of an unsigned event (no crypto). */
 declare function validateEvent(event: unknown): event is UnsignedEvent;
 /** Structural validation of a full event including id and sig hex shape. */
 declare function validateSignedEvent(event: unknown): event is Event;
 /**
- * Canonical NIP-01 serialization used for hashing:
- * JSON array `[0, pubkey, created_at, kind, tags, content]` with no extra whitespace.
+ * Canonical NIP-01 serialization used for hashing: JSON array `[0, pubkey, created_at, kind, tags,
+ * content]` with no extra whitespace.
  */
 declare function serializeEvent(event: UnsignedEvent): string;
 /** SHA-256 of the canonical serialization, lowercase hex. */
 declare function getEventHash(event: UnsignedEvent): string;
 /**
- * Sort events reverse-chronologically by `created_at`, then by `id` lexicographically.
- * Mutates and returns the array.
+ * Sort events reverse-chronologically by `created_at`, then by `id` lexicographically. Mutates and
+ * returns the array.
  */
 declare function sortEvents(events: Event[]): Event[];
 /** Non-mutating sort; returns a new array. */
-declare function sortedEvents(events: readonly Event[]): Event[];
+declare function sortedEvents(events: ReadonlyArray<Event>): Event[];
 /**
- * Negentropy item order: `created_at` ascending, then `id` lexicographic (`<`/`>`).
- * Time axis is opposite {@link sortEvents}; id tie-break is the same direction.
+ * Negentropy item order: `created_at` ascending, then `id` lexicographic (`<`/`>`). Time axis is
+ * opposite {@link sortEvents}; id tie-break is the same direction.
  */
 declare function itemCompare(a: {
   id: string;
@@ -91,8 +94,8 @@ declare function itemCompare(a: {
   created_at: number;
 }): number;
 /**
- * NIP-01 replaceable/addressable winner: higher `created_at`, or equal timestamp
- * and lexicographically lower `id`.
+ * NIP-01 replaceable/addressable winner: higher `created_at`, or equal timestamp and
+ * lexicographically lower `id`.
  */
 declare function isReplaceableWinner(candidate: {
   created_at: number;
@@ -104,5 +107,5 @@ declare function isReplaceableWinner(candidate: {
 /** True when a signed event is the signed form of `unsigned` (kind/tags/content/time/pubkey). */
 declare function signedMatchesUnsigned(signed: Event, unsigned: UnsignedEvent): boolean;
 //#endregion
-export { isTag as C, tagValue as E, getDTag as S, tagName as T, EventAddress as _, isMarkedFailed as a, eventAddress as b, itemCompare as c, serializeEvent as d, signedMatchesUnsigned as f, validateSignedEvent as g, validateEvent as h, getEventHash as i, markUnverified as l, sortedEvents as m, EventTemplate as n, isMarkedVerified as o, sortEvents as p, UnsignedEvent as r, isReplaceableWinner as s, Event as t, markVerified as u, Tag as v, parseEventAddress as w, formatEventAddress as x, TagInput as y };
-//# sourceMappingURL=event-B5D2jxt_.d.mts.map
+export { parseEventAddress as C, isTag as S, tagValue as T, Tag as _, isMarkedFailed as a, formatEventAddress as b, markUnverified as c, signedMatchesUnsigned as d, sortEvents as f, EventAddress as g, validateSignedEvent as h, getEventHash as i, markVerified as l, validateEvent as m, EventTemplate as n, isReplaceableWinner as o, sortedEvents as p, UnsignedEvent as r, itemCompare as s, Event as t, serializeEvent as u, TagInput as v, tagName as w, getDTag as x, eventAddress as y };
+//# sourceMappingURL=event-fU3Y01PR.d.mts.map

package/dist/{filter-BxwjEkZp.mjs → filter-BQl3GlHt.mjs}

@@ -1,26 +1,28 @@
-import { o as isReplaceableKind, r as isAddressableKind } from "./kind-BLl4cLOc.mjs";
+import { o as isReplaceableKind, r as isAddressableKind } from "./kind-Cxwhhkx8.mjs";
 //#region src/core/filter.ts
 /** Local NIP-01 match. `search` is ignored; relays interpret NIP-50. */
 function matchFilter(filter, event) {
-	if (filter.ids && !filter.ids.some((id) => id.toLowerCase() === event.id.toLowerCase())) return false;
+	if (filter.ids && !filter.ids.some((id) => id.toLowerCase() === event.id)) return false;
 	if (filter.kinds && !filter.kinds.includes(event.kind)) return false;
-	if (filter.authors && !filter.authors.some((pk) => pk.toLowerCase() === event.pubkey.toLowerCase())) return false;
+	if (filter.authors && !filter.authors.some((pk) => pk.toLowerCase() === event.pubkey)) return false;
 	for (const key of Object.keys(filter)) {
-		if (key[0] !== "#") continue;
+		if (!key.startsWith("#")) continue;
 		const tagName = key.slice(1);
 		const values = filter[`#${tagName}`];
 		if (!values) continue;
 		const hexTag = tagName === "e" || tagName === "p";
 		if (!event.tags.some((tag) => {
-			if (tag[0] !== tagName || tag[1] === void 0) return false;
-			if (hexTag) return values.some((v) => v.toLowerCase() === tag[1].toLowerCase());
-			return values.includes(tag[1]);
+			const [tagKey, tagValue] = tag;
+			if (tagKey !== tagName || tagValue === void 0) return false;
+			if (hexTag) return values.some((v) => v.toLowerCase() === tagValue.toLowerCase());
+			return values.includes(tagValue);
 		})) return false;
 	}
 	if (filter.since !== void 0 && event.created_at < filter.since) return false;
 	if (filter.until !== void 0 && event.created_at > filter.until) return false;
 	return true;
 }
+/** True when the event matches any of the filters (NIP-01 OR semantics). */
 function matchFilters(filters, event) {
 	for (const filter of filters) if (matchFilter(filter, event)) return true;
 	return false;
@@ -28,37 +30,45 @@ function matchFilters(filters, event) {
 /** Merge filters by unioning list fields; returns a new plain object. */
 function mergeFilters(...filters) {
 	const result = {};
+	const mergeList = (property, values) => {
+		if (values === void 0) return;
+		const existing = result[property];
+		const list = Array.isArray(existing) ? [...existing] : [];
+		for (const value of values) if (!list.includes(value)) list.push(value);
+		result[property] = list;
+	};
+	const mergeMax = (property, value) => {
+		if (value === void 0) return;
+		const prev = result[property];
+		if (typeof prev !== "number" || value > prev) result[property] = value;
+	};
 	for (const filter of filters) {
-		for (const [property, values] of Object.entries(filter)) if (property === "kinds" || property === "ids" || property === "authors" || property[0] === "#") {
-			const list = result[property] ?? [];
-			for (const value of values) if (!list.includes(value)) list.push(value);
-			result[property] = list;
-		}
-		if (filter.limit !== void 0) {
-			const prev = result.limit;
-			if (prev === void 0 || filter.limit > prev) result.limit = filter.limit;
-		}
-		if (filter.until !== void 0) {
-			const prev = result.until;
-			if (prev === void 0 || filter.until > prev) result.until = filter.until;
+		mergeList("ids", filter.ids);
+		mergeList("authors", filter.authors);
+		mergeList("kinds", filter.kinds);
+		for (const key of Object.keys(filter)) {
+			if (!key.startsWith("#")) continue;
+			mergeList(key, filter[key]);
 		}
+		mergeMax("limit", filter.limit);
+		mergeMax("until", filter.until);
 		if (filter.since !== void 0) {
-			const prev = result.since;
-			if (prev === void 0 || filter.since < prev) result.since = filter.since;
+			const prev = result["since"];
+			if (typeof prev !== "number" || filter.since < prev) result["since"] = filter.since;
 		}
-		if (filter.search !== void 0) result.search = filter.search;
+		if (filter.search !== void 0) result["search"] = filter.search;
 	}
 	return result;
 }
 /**
-* Intrinsic upper bound implied by the filter alone.
-* Returns a positive integer, or `Infinity` when unbounded.
+* Intrinsic upper bound implied by the filter alone. Returns a positive integer, or `Infinity` when
+* unbounded.
 */
 function getFilterLimit(filter) {
 	if (filter.ids && filter.ids.length === 0) return 0;
 	if (filter.kinds && filter.kinds.length === 0) return 0;
 	if (filter.authors && filter.authors.length === 0) return 0;
-	let limit = Infinity;
+	let limit = Number.POSITIVE_INFINITY;
 	if (filter.ids) limit = Math.min(limit, filter.ids.length);
 	if (filter.limit !== void 0) limit = Math.min(limit, filter.limit);
 	if (filter.kinds && filter.authors) {
@@ -70,10 +80,6 @@ function getFilterLimit(filter) {
 	}
 	return limit;
 }
-/** Shallow-clone a filter (for per-relay narrowing). */
-function cloneFilter(filter) {
-	return { ...filter };
-}
 const HEX_LIST_KEYS = /* @__PURE__ */ new Set([
 	"ids",
 	"authors",
@@ -89,18 +95,19 @@ function canonicalizeFilter(filter) {
 		if (value === void 0) continue;
 		if (Array.isArray(value)) {
 			if (HEX_LIST_KEYS.has(key)) out[key] = value.map((v) => String(v).toLowerCase()).sort();
-			else if (key === "kinds") out[key] = value.map((v) => Number(v)).sort((a, b) => a - b);
-			else out[key] = value.map((v) => String(v)).sort();
+			else if (key === "kinds") out[key] = value.map(Number).sort((a, b) => a - b);
+			else out[key] = value.map(String).sort();
 		} else out[key] = value;
 	}
 	return out;
 }
+/** Apply {@link canonicalizeFilter} to each filter. */
 function canonicalizeFilters(filters) {
 	return filters.map(canonicalizeFilter);
 }
 /**
-* Canonical identity for live REQ coalescing.
-* Relays treat a missing list key as unconstrained and `[]` as match-nothing.
+* Canonical identity for live REQ coalescing. Relays treat a missing list key as unconstrained and
+* `[]` as match-nothing.
 */
 function filterFingerprint(filters) {
 	const parts = filters.map((filter) => JSON.stringify(canonicalizeFilter(filter)));
@@ -108,6 +115,6 @@ function filterFingerprint(filters) {
 	return `[${parts.join(",")}]`;
 }
 //#endregion
-export { getFilterLimit as a, mergeFilters as c, filterFingerprint as i, canonicalizeFilters as n, matchFilter as o, cloneFilter as r, matchFilters as s, canonicalizeFilter as t };
+export { matchFilter as a, getFilterLimit as i, canonicalizeFilters as n, matchFilters as o, filterFingerprint as r, mergeFilters as s, canonicalizeFilter as t };
 
-//# sourceMappingURL=filter-BxwjEkZp.mjs.map
+//# sourceMappingURL=filter-BQl3GlHt.mjs.map

package/dist/filter-BQl3GlHt.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-BQl3GlHt.mjs","names":[],"sources":["../src/core/filter.ts"],"sourcesContent":["import type { Event } from \"./event.ts\";\nimport { isAddressableKind, isReplaceableKind } from \"./kind.ts\";\n\n/** NIP-01 filter object (immutable-friendly; callers may still pass plain objects). */\nexport type Filter = {\n  readonly ids?: ReadonlyArray<string> | undefined;\n  readonly kinds?: ReadonlyArray<number> | undefined;\n  readonly authors?: ReadonlyArray<string> | undefined;\n  readonly since?: number | undefined;\n  readonly until?: number | undefined;\n  readonly limit?: number | undefined;\n  /** NIP-50 full-text search. Relays interpret this. Local `matchFilter` / `query` ignore it. */\n  readonly search?: string | undefined;\n  readonly [key: `#${string}`]: ReadonlyArray<string> | undefined;\n};\n\n/** Local NIP-01 match. `search` is ignored; relays interpret NIP-50. */\nexport function matchFilter(filter: Filter, event: Event): boolean {\n  if (filter.ids && !filter.ids.some((id) => id.toLowerCase() === event.id)) {\n    return false;\n  }\n  if (filter.kinds && !filter.kinds.includes(event.kind)) {\n    return false;\n  }\n  if (filter.authors && !filter.authors.some((pk) => pk.toLowerCase() === event.pubkey)) {\n    return false;\n  }\n\n  for (const key of Object.keys(filter)) {\n    if (!key.startsWith(\"#\")) {\n      continue;\n    }\n    const tagName = key.slice(1);\n    const values = filter[`#${tagName}`];\n    if (!values) {\n      continue;\n    }\n    const hexTag = tagName === \"e\" || tagName === \"p\";\n    const hit = event.tags.some((tag) => {\n      const [tagKey, tagValue] = tag;\n      if (tagKey !== tagName || tagValue === undefined) {\n        return false;\n      }\n      if (hexTag) {\n        return values.some((v) => v.toLowerCase() === tagValue.toLowerCase());\n      }\n      return values.includes(tagValue);\n    });\n    if (!hit) {\n      return false;\n    }\n  }\n\n  if (filter.since !== undefined && event.created_at < filter.since) {\n    return false;\n  }\n  if (filter.until !== undefined && event.created_at > filter.until) {\n    return false;\n  }\n\n  return true;\n}\n\n/** True when the event matches any of the filters (NIP-01 OR semantics). */\nexport function matchFilters(filters: ReadonlyArray<Filter>, event: Event): boolean {\n  for (const filter of filters) {\n    if (matchFilter(filter, event)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Merge filters by unioning list fields; returns a new plain object. */\nexport function mergeFilters(...filters: Filter[]): Filter {\n  const result: Record<string, unknown> = {};\n  const mergeList = (property: string, values: ReadonlyArray<unknown> | undefined): void => {\n    if (values === undefined) {\n      return;\n    }\n    const existing = result[property];\n    const list: unknown[] = Array.isArray(existing) ? [...(existing as unknown[])] : [];\n    for (const value of values) {\n      if (!list.includes(value)) {\n        list.push(value);\n      }\n    }\n    result[property] = list;\n  };\n  const mergeMax = (property: \"limit\" | \"until\", value: number | undefined): void => {\n    if (value === undefined) {\n      return;\n    }\n    const prev = result[property];\n    if (typeof prev !== \"number\" || value > prev) {\n      result[property] = value;\n    }\n  };\n  for (const filter of filters) {\n    mergeList(\"ids\", filter.ids);\n    mergeList(\"authors\", filter.authors);\n    mergeList(\"kinds\", filter.kinds);\n    for (const key of Object.keys(filter)) {\n      if (!key.startsWith(\"#\")) {\n        continue;\n      }\n      // oxlint-disable-next-line typescript/no-unsafe-type-assertion -- startsWith(\"#\") above guarantees the template key\n      mergeList(key, filter[key as `#${string}`]);\n    }\n    mergeMax(\"limit\", filter.limit);\n    mergeMax(\"until\", filter.until);\n    if (filter.since !== undefined) {\n      const prev = result[\"since\"];\n      if (typeof prev !== \"number\" || filter.since < prev) {\n        result[\"since\"] = filter.since;\n      }\n    }\n    if (filter.search !== undefined) {\n      result[\"search\"] = filter.search;\n    }\n  }\n  // oxlint-disable-next-line typescript/no-unsafe-type-assertion -- built key by key above; the record is filter-shaped by construction\n  return result as Filter;\n}\n\n/**\n * Intrinsic upper bound implied by the filter alone. Returns a positive integer, or `Infinity` when\n * unbounded.\n */\nexport function getFilterLimit(filter: Filter): number {\n  if (filter.ids && filter.ids.length === 0) {\n    return 0;\n  }\n  if (filter.kinds && filter.kinds.length === 0) {\n    return 0;\n  }\n  if (filter.authors && filter.authors.length === 0) {\n    return 0;\n  }\n\n  let limit = Number.POSITIVE_INFINITY;\n  if (filter.ids) {\n    limit = Math.min(limit, filter.ids.length);\n  }\n  if (filter.limit !== undefined) {\n    limit = Math.min(limit, filter.limit);\n  }\n\n  if (filter.kinds && filter.authors) {\n    const allReplaceable = filter.kinds.every((k) => isReplaceableKind(k) || isAddressableKind(k));\n    if (allReplaceable) {\n      const dTags = filter[\"#d\"];\n      const perAuthor = dTags && dTags.length > 0 ? dTags.length : 1;\n      limit = Math.min(limit, filter.authors.length * filter.kinds.length * perAuthor);\n    }\n  }\n\n  return limit;\n}\n\nconst HEX_LIST_KEYS = new Set([\"ids\", \"authors\", \"#e\", \"#p\"]);\n\n/** Lowercase hex lists and sort every array. Omits undefined so `[]` stays distinct from missing. */\nexport function canonicalizeFilter(filter: Filter): Filter {\n  const raw = filter as Record<string, unknown>;\n  const out: Record<string, unknown> = {};\n  for (const key of Object.keys(raw).sort()) {\n    const value = raw[key];\n    // omit undefined so a missing key is not `[]` / null\n    if (value === undefined) {\n      continue;\n    }\n    if (Array.isArray(value)) {\n      if (HEX_LIST_KEYS.has(key)) {\n        out[key] = value.map((v) => String(v).toLowerCase()).sort();\n      } else if (key === \"kinds\") {\n        out[key] = value.map(Number).sort((a, b) => a - b);\n      } else {\n        out[key] = value.map(String).sort();\n      }\n    } else {\n      out[key] = value;\n    }\n  }\n  // oxlint-disable-next-line typescript/no-unsafe-type-assertion -- built key by key above; the record is filter-shaped by construction\n  return out as Filter;\n}\n\n/** Apply {@link canonicalizeFilter} to each filter. */\nexport function canonicalizeFilters(filters: ReadonlyArray<Filter>): Filter[] {\n  return filters.map(canonicalizeFilter);\n}\n\n/**\n * Canonical identity for live REQ coalescing. Relays treat a missing list key as unconstrained and\n * `[]` as match-nothing.\n */\nexport function filterFingerprint(filters: ReadonlyArray<Filter>): string {\n  const parts = filters.map((filter) => JSON.stringify(canonicalizeFilter(filter)));\n  parts.sort();\n  return `[${parts.join(\",\")}]`;\n}\n"],"mappings":";;;AAiBA,SAAgB,YAAY,QAAgB,OAAuB;CACjE,IAAI,OAAO,OAAO,CAAC,OAAO,IAAI,MAAM,OAAO,GAAG,YAAY,MAAM,MAAM,EAAE,GACtE,OAAO;CAET,IAAI,OAAO,SAAS,CAAC,OAAO,MAAM,SAAS,MAAM,IAAI,GACnD,OAAO;CAET,IAAI,OAAO,WAAW,CAAC,OAAO,QAAQ,MAAM,OAAO,GAAG,YAAY,MAAM,MAAM,MAAM,GAClF,OAAO;CAGT,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;EACrC,IAAI,CAAC,IAAI,WAAW,GAAG,GACrB;EAEF,MAAM,UAAU,IAAI,MAAM,CAAC;EAC3B,MAAM,SAAS,OAAO,IAAI;EAC1B,IAAI,CAAC,QACH;EAEF,MAAM,SAAS,YAAY,OAAO,YAAY;EAW9C,IAAI,CAVQ,MAAM,KAAK,MAAM,QAAQ;GACnC,MAAM,CAAC,QAAQ,YAAY;GAC3B,IAAI,WAAW,WAAW,aAAa,KAAA,GACrC,OAAO;GAET,IAAI,QACF,OAAO,OAAO,MAAM,MAAM,EAAE,YAAY,MAAM,SAAS,YAAY,CAAC;GAEtE,OAAO,OAAO,SAAS,QAAQ;EACjC,CACO,GACL,OAAO;CAEX;CAEA,IAAI,OAAO,UAAU,KAAA,KAAa,MAAM,aAAa,OAAO,OAC1D,OAAO;CAET,IAAI,OAAO,UAAU,KAAA,KAAa,MAAM,aAAa,OAAO,OAC1D,OAAO;CAGT,OAAO;AACT;;AAGA,SAAgB,aAAa,SAAgC,OAAuB;CAClF,KAAK,MAAM,UAAU,SACnB,IAAI,YAAY,QAAQ,KAAK,GAC3B,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,aAAa,GAAG,SAA2B;CACzD,MAAM,SAAkC,CAAC;CACzC,MAAM,aAAa,UAAkB,WAAqD;EACxF,IAAI,WAAW,KAAA,GACb;EAEF,MAAM,WAAW,OAAO;EACxB,MAAM,OAAkB,MAAM,QAAQ,QAAQ,IAAI,CAAC,GAAI,QAAsB,IAAI,CAAC;EAClF,KAAK,MAAM,SAAS,QAClB,IAAI,CAAC,KAAK,SAAS,KAAK,GACtB,KAAK,KAAK,KAAK;EAGnB,OAAO,YAAY;CACrB;CACA,MAAM,YAAY,UAA6B,UAAoC;EACjF,IAAI,UAAU,KAAA,GACZ;EAEF,MAAM,OAAO,OAAO;EACpB,IAAI,OAAO,SAAS,YAAY,QAAQ,MACtC,OAAO,YAAY;CAEvB;CACA,KAAK,MAAM,UAAU,SAAS;EAC5B,UAAU,OAAO,OAAO,GAAG;EAC3B,UAAU,WAAW,OAAO,OAAO;EACnC,UAAU,SAAS,OAAO,KAAK;EAC/B,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;GACrC,IAAI,CAAC,IAAI,WAAW,GAAG,GACrB;GAGF,UAAU,KAAK,OAAO,IAAoB;EAC5C;EACA,SAAS,SAAS,OAAO,KAAK;EAC9B,SAAS,SAAS,OAAO,KAAK;EAC9B,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,OAAO,OAAO;GACpB,IAAI,OAAO,SAAS,YAAY,OAAO,QAAQ,MAC7C,OAAO,WAAW,OAAO;EAE7B;EACA,IAAI,OAAO,WAAW,KAAA,GACpB,OAAO,YAAY,OAAO;CAE9B;CAEA,OAAO;AACT;;;;;AAMA,SAAgB,eAAe,QAAwB;CACrD,IAAI,OAAO,OAAO,OAAO,IAAI,WAAW,GACtC,OAAO;CAET,IAAI,OAAO,SAAS,OAAO,MAAM,WAAW,GAC1C,OAAO;CAET,IAAI,OAAO,WAAW,OAAO,QAAQ,WAAW,GAC9C,OAAO;CAGT,IAAI,QAAQ,OAAO;CACnB,IAAI,OAAO,KACT,QAAQ,KAAK,IAAI,OAAO,OAAO,IAAI,MAAM;CAE3C,IAAI,OAAO,UAAU,KAAA,GACnB,QAAQ,KAAK,IAAI,OAAO,OAAO,KAAK;CAGtC,IAAI,OAAO,SAAS,OAAO,SACF;MAAA,OAAO,MAAM,OAAO,MAAM,kBAAkB,CAAC,KAAK,kBAAkB,CAAC,CAC3E,GAAG;GAClB,MAAM,QAAQ,OAAO;GACrB,MAAM,YAAY,SAAS,MAAM,SAAS,IAAI,MAAM,SAAS;GAC7D,QAAQ,KAAK,IAAI,OAAO,OAAO,QAAQ,SAAS,OAAO,MAAM,SAAS,SAAS;EACjF;;CAGF,OAAO;AACT;AAEA,MAAM,gCAAgB,IAAI,IAAI;CAAC;CAAO;CAAW;CAAM;AAAI,CAAC;;AAG5D,SAAgB,mBAAmB,QAAwB;CACzD,MAAM,MAAM;CACZ,MAAM,MAA+B,CAAC;CACtC,KAAK,MAAM,OAAO,OAAO,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG;EACzC,MAAM,QAAQ,IAAI;EAElB,IAAI,UAAU,KAAA,GACZ;EAEF,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,IAAI,cAAc,IAAI,GAAG,GACvB,IAAI,OAAO,MAAM,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK;QACrD,IAAI,QAAQ,SACjB,IAAI,OAAO,MAAM,IAAI,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;QAEjD,IAAI,OAAO,MAAM,IAAI,MAAM,CAAC,CAAC,KAAK;EAEtC,OACE,IAAI,OAAO;CAEf;CAEA,OAAO;AACT;;AAGA,SAAgB,oBAAoB,SAA0C;CAC5E,OAAO,QAAQ,IAAI,kBAAkB;AACvC;;;;;AAMA,SAAgB,kBAAkB,SAAwC;CACxE,MAAM,QAAQ,QAAQ,KAAK,WAAW,KAAK,UAAU,mBAAmB,MAAM,CAAC,CAAC;CAChF,MAAM,KAAK;CACX,OAAO,IAAI,MAAM,KAAK,GAAG,EAAE;AAC7B"}

package/dist/filter-C0IMByE3.d.mts

@@ -0,0 +1,37 @@
+import { t as Event } from "./event-fU3Y01PR.mjs";
+//#region src/core/filter.d.ts
+/** NIP-01 filter object (immutable-friendly; callers may still pass plain objects). */
+type Filter = {
+  readonly ids?: ReadonlyArray<string> | undefined;
+  readonly kinds?: ReadonlyArray<number> | undefined;
+  readonly authors?: ReadonlyArray<string> | undefined;
+  readonly since?: number | undefined;
+  readonly until?: number | undefined;
+  readonly limit?: number | undefined;
+  /** NIP-50 full-text search. Relays interpret this. Local `matchFilter` / `query` ignore it. */
+  readonly search?: string | undefined;
+  readonly [key: `#${string}`]: ReadonlyArray<string> | undefined;
+};
+/** Local NIP-01 match. `search` is ignored; relays interpret NIP-50. */
+declare function matchFilter(filter: Filter, event: Event): boolean;
+/** True when the event matches any of the filters (NIP-01 OR semantics). */
+declare function matchFilters(filters: ReadonlyArray<Filter>, event: Event): boolean;
+/** Merge filters by unioning list fields; returns a new plain object. */
+declare function mergeFilters(...filters: Filter[]): Filter;
+/**
+ * Intrinsic upper bound implied by the filter alone. Returns a positive integer, or `Infinity` when
+ * unbounded.
+ */
+declare function getFilterLimit(filter: Filter): number;
+/** Lowercase hex lists and sort every array. Omits undefined so `[]` stays distinct from missing. */
+declare function canonicalizeFilter(filter: Filter): Filter;
+/** Apply {@link canonicalizeFilter} to each filter. */
+declare function canonicalizeFilters(filters: ReadonlyArray<Filter>): Filter[];
+/**
+ * Canonical identity for live REQ coalescing. Relays treat a missing list key as unconstrained and
+ * `[]` as match-nothing.
+ */
+declare function filterFingerprint(filters: ReadonlyArray<Filter>): string;
+//#endregion
+export { getFilterLimit as a, mergeFilters as c, filterFingerprint as i, canonicalizeFilter as n, matchFilter as o, canonicalizeFilters as r, matchFilters as s, Filter as t };
+//# sourceMappingURL=filter-C0IMByE3.d.mts.map

package/dist/{gossip-C5RVB1UB.d.mts → gossip-BRQwIM_q.d.mts}

@@ -1,7 +1,8 @@
-import { t as Event } from "./event-B5D2jxt_.mjs";
-import { t as Filter } from "./filter-DUEKP3q1.mjs";
-import { t as RelayListItem } from "./nip65-Di5hZRuV.mjs";
+import { t as Event } from "./event-fU3Y01PR.mjs";
+import { t as Filter } from "./filter-C0IMByE3.mjs";
+import { t as RelayListItem } from "./nip65-DBfh2smt.mjs";
 //#region src/gossip/gossip.d.ts
+/** Relay routing state for one pubkey: NIP-65 outbox/inbox plus NIP-17 DM relays. */
 type PubkeyRoutes = {
   /** Relays the user writes to (outbox). NIP-65. */
   write: string[];
@@ -14,42 +15,44 @@ type PubkeyRoutes = {
   /** `created_at` of the last accepted kind:10050 list. */
   dmUpdatedAt: number;
   /** Event id of the last accepted kind:10002 (NIP-01 equal-timestamp tie-break). */
-  relayListId?: string;
+  relayListId?: string | undefined;
   /** Event id of the last accepted kind:10050. */
-  dmListId?: string;
+  dmListId?: string | undefined;
 };
+/** A filter split by gossip routes: per-relay narrowed filters plus the unrouted remainder. */
 type RoutedFilter = {
-  /** url → already-narrowed filter. Empty when nothing routed. */
+  /** Url → already-narrowed filter. Empty when nothing routed. */
   perRelay: Map<string, Filter>;
   /**
-   * Unrouted work for the caller:
-   * - no authors and no #p: original filter (today's "generic")
-   * - authors/#p all unrouted: original filter (today's "orphan")
-   * - mixed: narrowed leftover (today's fallback)
-   * - all routed: undefined
+   * Unrouted work for the caller: - no authors and no #p: original filter (today's "generic") -
+   * authors/#p all unrouted: original filter (today's "orphan") - mixed: narrowed leftover (today's
+   * fallback) - all routed: undefined
    */
   remainder?: Filter;
 };
 type GossipOptions = {
   /** Max relays to keep per direction when ranking. Default 4. */
   maxRelaysPerPubkey?: number;
+  /**
+   * Max pubkeys with tracked routes; the map is LRU — writes and lookups refresh recency, and
+   * inserting beyond the cap drops the oldest entry. Default 10_000.
+   */
+  maxPubkeys?: number;
 };
 /**
- * Routing table for NIP-65 (10002) and NIP-17 DM relays (10050).
- * Ingest replaceable list events, then route filters into per-relay REQs.
+ * Routing table for NIP-65 (10002) and NIP-17 DM relays (10050). Ingest replaceable list events,
+ * then route filters into per-relay REQs.
  */
 declare class Gossip {
   #private;
   constructor(opts?: GossipOptions);
   /**
-   * Ingest a routing list event.
-   * - kind:10002 → write/read (NIP-65)
-   * - kind:10050 → dm (NIP-17)
+   * Ingest a routing list event. - kind:10002 → write/read (NIP-65) - kind:10050 → dm (NIP-17)
    * Returns true if routes for that list type were updated.
    */
   ingest(event: Event): boolean;
   setRoutes(pubkey: string, items: RelayListItem[], updatedAt?: number, eventId?: string): boolean;
-  setDmRoutes(pubkey: string, relays: readonly string[], updatedAt?: number, eventId?: string): boolean;
+  setDmRoutes(pubkey: string, relays: ReadonlyArray<string>, updatedAt?: number, eventId?: string): boolean;
   getRoutes(pubkey: string): PubkeyRoutes | undefined;
   outboxRelays(pubkey: string): string[];
   inboxRelays(pubkey: string): string[];
@@ -58,14 +61,13 @@ declare class Gossip {
   clear(pubkey?: string): void;
   get size(): number;
   /**
-   * Route a user-facing filter into per-relay sub-filters plus leftover.
-   * - authors → outbox relays, filter narrowed per relay's authors
-   * - #p only → inbox relays of those pubkeys
-   * - neither / all unrouted → remainder is the original filter
-   * - mixed → remainder is the narrowed leftover; all routed → no remainder
+   * Route a user-facing filter into per-relay sub-filters plus leftover. - authors → outbox relays,
+   * filter narrowed per relay's authors - #p only → inbox relays of those pubkeys - neither / all
+   * unrouted → remainder is the original filter - mixed → remainder is the narrowed leftover; all
+   * routed → no remainder
    */
   route(filter: Filter): RoutedFilter;
 }
 //#endregion
 export { RoutedFilter as i, GossipOptions as n, PubkeyRoutes as r, Gossip as t };
-//# sourceMappingURL=gossip-C5RVB1UB.d.mts.map
+//# sourceMappingURL=gossip-BRQwIM_q.d.mts.map

package/dist/{gossip-3xkRRCm_.mjs → gossip-oloDMWEj.mjs}

@@ -1,6 +1,6 @@
-import { s as normalizeURL } from "./util-6tfLQ9JF.mjs";
-import { t as Kind } from "./kind-BLl4cLOc.mjs";
-import { i as isReplaceableWinner } from "./event-CzoQEFMF.mjs";
+import { l as normalizeURL } from "./util-LfQirgDk.mjs";
+import { t as Kind } from "./kind-Cxwhhkx8.mjs";
+import { a as isReplaceableWinner } from "./event-D8Nfoh4K.mjs";
 import { parseRelayList } from "./nips/nip65.mjs";
 import { parseDmRelayList } from "./nips/nip17.mjs";
 //#region src/gossip/gossip.ts
@@ -14,19 +14,19 @@ function emptyRoutes() {
 	};
 }
 /**
-* Routing table for NIP-65 (10002) and NIP-17 DM relays (10050).
-* Ingest replaceable list events, then route filters into per-relay REQs.
+* Routing table for NIP-65 (10002) and NIP-17 DM relays (10050). Ingest replaceable list events,
+* then route filters into per-relay REQs.
 */
 var Gossip = class {
 	#routes = /* @__PURE__ */ new Map();
 	#maxRelays;
+	#maxPubkeys;
 	constructor(opts = {}) {
 		this.#maxRelays = opts.maxRelaysPerPubkey ?? 4;
+		this.#maxPubkeys = opts.maxPubkeys ?? 1e4;
 	}
 	/**
-	* Ingest a routing list event.
-	* - kind:10002 → write/read (NIP-65)
-	* - kind:10050 → dm (NIP-17)
+	* Ingest a routing list event. - kind:10002 → write/read (NIP-65) - kind:10050 → dm (NIP-17)
 	* Returns true if routes for that list type were updated.
 	*/
 	ingest(event) {
@@ -52,9 +52,9 @@ var Gossip = class {
 	}
 	setRoutes(pubkey, items, updatedAt = Math.floor(Date.now() / 1e3), eventId) {
 		const pk = pubkey.toLowerCase();
-		const prev = this.#routes.get(pk) ?? emptyRoutes();
+		const prev = this.#lookup(pk) ?? emptyRoutes();
 		if (prev.updatedAt > updatedAt) return false;
-		if (eventId && prev.relayListId && prev.updatedAt === updatedAt && !isReplaceableWinner({
+		if (eventId !== void 0 && prev.relayListId !== void 0 && prev.updatedAt === updatedAt && !isReplaceableWinner({
 			created_at: updatedAt,
 			id: eventId
 		}, {
@@ -73,7 +73,7 @@ var Gossip = class {
 			if (item.write && !write.includes(url)) write.push(url);
 			if (item.read && !read.includes(url)) read.push(url);
 		}
-		this.#routes.set(pk, {
+		this.#put(pk, {
 			write: write.slice(0, this.#maxRelays),
 			read: read.slice(0, this.#maxRelays),
 			dm: prev.dm,
@@ -86,9 +86,9 @@ var Gossip = class {
 	}
 	setDmRoutes(pubkey, relays, updatedAt = Math.floor(Date.now() / 1e3), eventId) {
 		const pk = pubkey.toLowerCase();
-		const prev = this.#routes.get(pk) ?? emptyRoutes();
+		const prev = this.#lookup(pk) ?? emptyRoutes();
 		if (prev.dmUpdatedAt > updatedAt) return false;
-		if (eventId && prev.dmListId && prev.dmUpdatedAt === updatedAt && !isReplaceableWinner({
+		if (eventId !== void 0 && prev.dmListId !== void 0 && prev.dmUpdatedAt === updatedAt && !isReplaceableWinner({
 			created_at: updatedAt,
 			id: eventId
 		}, {
@@ -105,7 +105,7 @@ var Gossip = class {
 			}
 			if (!dm.includes(url)) dm.push(url);
 		}
-		this.#routes.set(pk, {
+		this.#put(pk, {
 			write: prev.write,
 			read: prev.read,
 			dm: dm.slice(0, this.#maxRelays),
@@ -117,31 +117,30 @@ var Gossip = class {
 		return true;
 	}
 	getRoutes(pubkey) {
-		return this.#routes.get(pubkey.toLowerCase());
+		return this.#lookup(pubkey.toLowerCase());
 	}
 	outboxRelays(pubkey) {
-		return this.#routes.get(pubkey.toLowerCase())?.write ?? [];
+		return this.#lookup(pubkey.toLowerCase())?.write ?? [];
 	}
 	inboxRelays(pubkey) {
-		return this.#routes.get(pubkey.toLowerCase())?.read ?? [];
+		return this.#lookup(pubkey.toLowerCase())?.read ?? [];
 	}
 	/** NIP-17 kind:10050 delivery relays for gift-wraps. */
 	dmRelays(pubkey) {
-		return this.#routes.get(pubkey.toLowerCase())?.dm ?? [];
+		return this.#lookup(pubkey.toLowerCase())?.dm ?? [];
 	}
 	clear(pubkey) {
-		if (pubkey) this.#routes.delete(pubkey.toLowerCase());
+		if (pubkey !== void 0 && pubkey !== "") this.#routes.delete(pubkey.toLowerCase());
 		else this.#routes.clear();
 	}
 	get size() {
 		return this.#routes.size;
 	}
 	/**
-	* Route a user-facing filter into per-relay sub-filters plus leftover.
-	* - authors → outbox relays, filter narrowed per relay's authors
-	* - #p only → inbox relays of those pubkeys
-	* - neither / all unrouted → remainder is the original filter
-	* - mixed → remainder is the narrowed leftover; all routed → no remainder
+	* Route a user-facing filter into per-relay sub-filters plus leftover. - authors → outbox relays,
+	* filter narrowed per relay's authors - #p only → inbox relays of those pubkeys - neither / all
+	* unrouted → remainder is the original filter - mixed → remainder is the narrowed leftover; all
+	* routed → no remainder
 	*/
 	route(filter) {
 		const authors = filter.authors?.map((a) => a.toLowerCase());
@@ -151,18 +150,18 @@ var Gossip = class {
 			remainder: filter
 		};
 		if (authors && authors.length > 0 && (!pTags || pTags.length === 0)) return this.#breakAuthors(filter, authors, "write");
-		if (pTags && pTags.length > 0 && (!authors || authors.length === 0)) return this.#breakAuthors({
-			...filter,
-			authors: void 0
-		}, pTags, "read", (base, pubkeys) => ({
-			...base,
-			"#p": pubkeys
-		}));
+		if (pTags && pTags.length > 0 && (!authors || authors.length === 0)) {
+			const { authors: _authors, ...base } = filter;
+			return this.#breakAuthors(base, pTags, "read", (b, pubkeys) => ({
+				...b,
+				"#p": pubkeys
+			}));
+		}
 		const unionKeys = /* @__PURE__ */ new Set([...authors ?? [], ...pTags ?? []]);
 		const relays = /* @__PURE__ */ new Set();
 		let anyUnrouted = false;
 		for (const pk of unionKeys) {
-			const r = this.#routes.get(pk);
+			const r = this.#lookup(pk);
 			const urls = r ? [...r.write, ...r.read] : [];
 			if (urls.length === 0) {
 				anyUnrouted = true;
@@ -189,7 +188,7 @@ var Gossip = class {
 		const unrouted = [];
 		let anyRoute = false;
 		for (const pk of pubkeys) {
-			const routes = this.#routes.get(pk);
+			const routes = this.#lookup(pk);
 			const urls = direction === "write" ? routes?.write : routes?.read;
 			if (!urls || urls.length === 0) {
 				unrouted.push(pk);
@@ -213,8 +212,27 @@ var Gossip = class {
 			remainder: narrow(filter, unrouted)
 		} : { perRelay: map };
 	}
+	/** Read that refreshes LRU recency. */
+	#lookup(pk) {
+		const routes = this.#routes.get(pk);
+		if (routes !== void 0) {
+			this.#routes.delete(pk);
+			this.#routes.set(pk, routes);
+		}
+		return routes;
+	}
+	/** Write at the newest LRU end, then trim the oldest beyond the cap. */
+	#put(pk, routes) {
+		this.#routes.delete(pk);
+		this.#routes.set(pk, routes);
+		while (this.#routes.size > this.#maxPubkeys) {
+			const oldest = this.#routes.keys().next().value;
+			if (oldest === void 0) break;
+			this.#routes.delete(oldest);
+		}
+	}
 };
 //#endregion
 export { Gossip as t };
 
-//# sourceMappingURL=gossip-3xkRRCm_.mjs.map
+//# sourceMappingURL=gossip-oloDMWEj.mjs.map

package/dist/gossip-oloDMWEj.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"gossip-oloDMWEj.mjs","names":[],"sources":["../src/gossip/gossip.ts"],"sourcesContent":["import type { Event } from \"../core/event.ts\";\nimport { isReplaceableWinner } from \"../core/event.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { Kind } from \"../core/kind.ts\";\nimport { normalizeURL } from \"../core/util.ts\";\nimport { parseDmRelayList } from \"../nips/nip17.ts\";\nimport { parseRelayList } from \"../nips/nip65.ts\";\nimport type { RelayListItem } from \"../nips/nip65.ts\";\n\n/** Relay routing state for one pubkey: NIP-65 outbox/inbox plus NIP-17 DM relays. */\nexport type PubkeyRoutes = {\n  /** Relays the user writes to (outbox). NIP-65. */\n  write: string[];\n  /** Relays the user reads from (inbox). NIP-65. */\n  read: string[];\n  /** Relays for NIP-17 gift-wrap delivery. Kind 10050. */\n  dm: string[];\n  /** `created_at` of the last accepted kind:10002 list. */\n  updatedAt: number;\n  /** `created_at` of the last accepted kind:10050 list. */\n  dmUpdatedAt: number;\n  /** Event id of the last accepted kind:10002 (NIP-01 equal-timestamp tie-break). */\n  relayListId?: string | undefined;\n  /** Event id of the last accepted kind:10050. */\n  dmListId?: string | undefined;\n};\n\n/** A filter split by gossip routes: per-relay narrowed filters plus the unrouted remainder. */\nexport type RoutedFilter = {\n  /** Url → already-narrowed filter. Empty when nothing routed. */\n  perRelay: Map<string, Filter>;\n  /**\n   * Unrouted work for the caller: - no authors and no #p: original filter (today's \"generic\") -\n   * authors/#p all unrouted: original filter (today's \"orphan\") - mixed: narrowed leftover (today's\n   * fallback) - all routed: undefined\n   */\n  remainder?: Filter;\n};\n\nexport type GossipOptions = {\n  /** Max relays to keep per direction when ranking. Default 4. */\n  maxRelaysPerPubkey?: number;\n  /**\n   * Max pubkeys with tracked routes; the map is LRU — writes and lookups refresh recency, and\n   * inserting beyond the cap drops the oldest entry. Default 10_000.\n   */\n  maxPubkeys?: number;\n};\n\nfunction emptyRoutes(): PubkeyRoutes {\n  return {\n    write: [],\n    read: [],\n    dm: [],\n    updatedAt: 0,\n    dmUpdatedAt: 0,\n  };\n}\n\n/**\n * Routing table for NIP-65 (10002) and NIP-17 DM relays (10050). Ingest replaceable list events,\n * then route filters into per-relay REQs.\n */\nexport class Gossip {\n  readonly #routes = new Map<string, PubkeyRoutes>();\n  readonly #maxRelays: number;\n  readonly #maxPubkeys: number;\n\n  constructor(opts: GossipOptions = {}) {\n    this.#maxRelays = opts.maxRelaysPerPubkey ?? 4;\n    this.#maxPubkeys = opts.maxPubkeys ?? 10_000;\n  }\n\n  /**\n   * Ingest a routing list event. - kind:10002 → write/read (NIP-65) - kind:10050 → dm (NIP-17)\n   * Returns true if routes for that list type were updated.\n   */\n  ingest(event: Event): boolean {\n    if (event.kind === Kind.RelayList) {\n      let items: RelayListItem[];\n      try {\n        items = parseRelayList(event);\n      } catch {\n        return false;\n      }\n      return this.setRoutes(event.pubkey, items, event.created_at, event.id);\n    }\n    if (event.kind === Kind.DirectMessageRelaysList) {\n      let relays: string[];\n      try {\n        relays = parseDmRelayList(event);\n      } catch {\n        return false;\n      }\n      return this.setDmRoutes(event.pubkey, relays, event.created_at, event.id);\n    }\n    return false;\n  }\n\n  setRoutes(\n    pubkey: string,\n    items: RelayListItem[],\n    updatedAt: number = Math.floor(Date.now() / 1000),\n    eventId?: string,\n  ): boolean {\n    const pk = pubkey.toLowerCase();\n    const prev = this.#lookup(pk) ?? emptyRoutes();\n    if (prev.updatedAt > updatedAt) {\n      return false;\n    }\n    if (\n      eventId !== undefined &&\n      prev.relayListId !== undefined &&\n      prev.updatedAt === updatedAt &&\n      !isReplaceableWinner(\n        { created_at: updatedAt, id: eventId },\n        { created_at: prev.updatedAt, id: prev.relayListId },\n      )\n    ) {\n      return false;\n    }\n\n    const write: string[] = [];\n    const read: string[] = [];\n    for (const item of items) {\n      let url: string;\n      try {\n        url = normalizeURL(item.url);\n      } catch {\n        continue;\n      }\n      if (item.write && !write.includes(url)) {\n        write.push(url);\n      }\n      if (item.read && !read.includes(url)) {\n        read.push(url);\n      }\n    }\n\n    this.#put(pk, {\n      write: write.slice(0, this.#maxRelays),\n      read: read.slice(0, this.#maxRelays),\n      dm: prev.dm,\n      updatedAt,\n      dmUpdatedAt: prev.dmUpdatedAt,\n      relayListId: eventId ?? prev.relayListId,\n      dmListId: prev.dmListId,\n    });\n    return true;\n  }\n\n  setDmRoutes(\n    pubkey: string,\n    relays: ReadonlyArray<string>,\n    updatedAt: number = Math.floor(Date.now() / 1000),\n    eventId?: string,\n  ): boolean {\n    const pk = pubkey.toLowerCase();\n    const prev = this.#lookup(pk) ?? emptyRoutes();\n    if (prev.dmUpdatedAt > updatedAt) {\n      return false;\n    }\n    if (\n      eventId !== undefined &&\n      prev.dmListId !== undefined &&\n      prev.dmUpdatedAt === updatedAt &&\n      !isReplaceableWinner(\n        { created_at: updatedAt, id: eventId },\n        { created_at: prev.dmUpdatedAt, id: prev.dmListId },\n      )\n    ) {\n      return false;\n    }\n\n    const dm: string[] = [];\n    for (const raw of relays) {\n      let url: string;\n      try {\n        url = normalizeURL(raw);\n      } catch {\n        continue;\n      }\n      if (!dm.includes(url)) {\n        dm.push(url);\n      }\n    }\n\n    this.#put(pk, {\n      write: prev.write,\n      read: prev.read,\n      dm: dm.slice(0, this.#maxRelays),\n      updatedAt: prev.updatedAt,\n      dmUpdatedAt: updatedAt,\n      relayListId: prev.relayListId,\n      dmListId: eventId ?? prev.dmListId,\n    });\n    return true;\n  }\n\n  getRoutes(pubkey: string): PubkeyRoutes | undefined {\n    return this.#lookup(pubkey.toLowerCase());\n  }\n\n  outboxRelays(pubkey: string): string[] {\n    return this.#lookup(pubkey.toLowerCase())?.write ?? [];\n  }\n\n  inboxRelays(pubkey: string): string[] {\n    return this.#lookup(pubkey.toLowerCase())?.read ?? [];\n  }\n\n  /** NIP-17 kind:10050 delivery relays for gift-wraps. */\n  dmRelays(pubkey: string): string[] {\n    return this.#lookup(pubkey.toLowerCase())?.dm ?? [];\n  }\n\n  clear(pubkey?: string): void {\n    if (pubkey !== undefined && pubkey !== \"\") {\n      this.#routes.delete(pubkey.toLowerCase());\n    } else {\n      this.#routes.clear();\n    }\n  }\n\n  get size(): number {\n    return this.#routes.size;\n  }\n\n  /**\n   * Route a user-facing filter into per-relay sub-filters plus leftover. - authors → outbox relays,\n   * filter narrowed per relay's authors - #p only → inbox relays of those pubkeys - neither / all\n   * unrouted → remainder is the original filter - mixed → remainder is the narrowed leftover; all\n   * routed → no remainder\n   */\n  route(filter: Filter): RoutedFilter {\n    const authors = filter.authors?.map((a) => a.toLowerCase());\n    const pTags = filter[\"#p\"]?.map((p) => p.toLowerCase());\n\n    if ((!authors || authors.length === 0) && (!pTags || pTags.length === 0)) {\n      return { perRelay: new Map(), remainder: filter };\n    }\n\n    if (authors && authors.length > 0 && (!pTags || pTags.length === 0)) {\n      return this.#breakAuthors(filter, authors, \"write\");\n    }\n\n    if (pTags && pTags.length > 0 && (!authors || authors.length === 0)) {\n      const { authors: _authors, ...base } = filter;\n      return this.#breakAuthors(base, pTags, \"read\", (b, pubkeys) => ({ ...b, \"#p\": pubkeys }));\n    }\n\n    // both authors and #p: send full filter to union of routes\n    const unionKeys = new Set([...(authors ?? []), ...(pTags ?? [])]);\n    const relays = new Set<string>();\n    let anyUnrouted = false;\n    for (const pk of unionKeys) {\n      const r = this.#lookup(pk);\n      const urls = r ? [...r.write, ...r.read] : [];\n      if (urls.length === 0) {\n        anyUnrouted = true;\n        continue;\n      }\n      for (const u of urls) {\n        relays.add(u);\n      }\n    }\n    if (relays.size === 0) {\n      return { perRelay: new Map(), remainder: filter };\n    }\n    const map = new Map<string, Filter>();\n    for (const url of relays) {\n      map.set(url, { ...filter });\n    }\n    return anyUnrouted ? { perRelay: map, remainder: filter } : { perRelay: map };\n  }\n\n  #breakAuthors(\n    filter: Filter,\n    pubkeys: string[],\n    direction: \"read\" | \"write\",\n    narrow: (base: Filter, pubkeys: string[]) => Filter = (base, pks) => ({\n      ...base,\n      authors: pks,\n    }),\n  ): RoutedFilter {\n    const perRelay = new Map<string, string[]>();\n    const unrouted: string[] = [];\n    let anyRoute = false;\n\n    for (const pk of pubkeys) {\n      const routes = this.#lookup(pk);\n      const urls = direction === \"write\" ? routes?.write : routes?.read;\n      if (!urls || urls.length === 0) {\n        unrouted.push(pk);\n        continue;\n      }\n      anyRoute = true;\n      for (const url of urls) {\n        const list = perRelay.get(url) ?? [];\n        list.push(pk);\n        perRelay.set(url, list);\n      }\n    }\n\n    if (!anyRoute) {\n      return { perRelay: new Map(), remainder: filter };\n    }\n\n    const map = new Map<string, Filter>();\n    for (const [url, pks] of perRelay) {\n      map.set(url, narrow(filter, pks));\n    }\n    return unrouted.length > 0\n      ? { perRelay: map, remainder: narrow(filter, unrouted) }\n      : { perRelay: map };\n  }\n\n  /** Read that refreshes LRU recency. */\n  #lookup(pk: string): PubkeyRoutes | undefined {\n    const routes = this.#routes.get(pk);\n    if (routes !== undefined) {\n      this.#routes.delete(pk);\n      this.#routes.set(pk, routes);\n    }\n    return routes;\n  }\n\n  /** Write at the newest LRU end, then trim the oldest beyond the cap. */\n  #put(pk: string, routes: PubkeyRoutes): void {\n    this.#routes.delete(pk);\n    this.#routes.set(pk, routes);\n    while (this.#routes.size > this.#maxPubkeys) {\n      const oldest = this.#routes.keys().next().value;\n      if (oldest === undefined) {\n        break;\n      }\n      this.#routes.delete(oldest);\n    }\n  }\n}\n"],"mappings":";;;;;;AAiDA,SAAS,cAA4B;CACnC,OAAO;EACL,OAAO,CAAC;EACR,MAAM,CAAC;EACP,IAAI,CAAC;EACL,WAAW;EACX,aAAa;CACf;AACF;;;;;AAMA,IAAa,SAAb,MAAoB;CAClB,0BAAmB,IAAI,IAA0B;CACjD;CACA;CAEA,YAAY,OAAsB,CAAC,GAAG;EACpC,KAAK,aAAa,KAAK,sBAAsB;EAC7C,KAAK,cAAc,KAAK,cAAc;CACxC;;;;;CAMA,OAAO,OAAuB;EAC5B,IAAI,MAAM,SAAS,KAAK,WAAW;GACjC,IAAI;GACJ,IAAI;IACF,QAAQ,eAAe,KAAK;GAC9B,QAAQ;IACN,OAAO;GACT;GACA,OAAO,KAAK,UAAU,MAAM,QAAQ,OAAO,MAAM,YAAY,MAAM,EAAE;EACvE;EACA,IAAI,MAAM,SAAS,KAAK,yBAAyB;GAC/C,IAAI;GACJ,IAAI;IACF,SAAS,iBAAiB,KAAK;GACjC,QAAQ;IACN,OAAO;GACT;GACA,OAAO,KAAK,YAAY,MAAM,QAAQ,QAAQ,MAAM,YAAY,MAAM,EAAE;EAC1E;EACA,OAAO;CACT;CAEA,UACE,QACA,OACA,YAAoB,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GAChD,SACS;EACT,MAAM,KAAK,OAAO,YAAY;EAC9B,MAAM,OAAO,KAAK,QAAQ,EAAE,KAAK,YAAY;EAC7C,IAAI,KAAK,YAAY,WACnB,OAAO;EAET,IACE,YAAY,KAAA,KACZ,KAAK,gBAAgB,KAAA,KACrB,KAAK,cAAc,aACnB,CAAC,oBACC;GAAE,YAAY;GAAW,IAAI;EAAQ,GACrC;GAAE,YAAY,KAAK;GAAW,IAAI,KAAK;EAAY,CACrD,GAEA,OAAO;EAGT,MAAM,QAAkB,CAAC;EACzB,MAAM,OAAiB,CAAC;EACxB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;GACJ,IAAI;IACF,MAAM,aAAa,KAAK,GAAG;GAC7B,QAAQ;IACN;GACF;GACA,IAAI,KAAK,SAAS,CAAC,MAAM,SAAS,GAAG,GACnC,MAAM,KAAK,GAAG;GAEhB,IAAI,KAAK,QAAQ,CAAC,KAAK,SAAS,GAAG,GACjC,KAAK,KAAK,GAAG;EAEjB;EAEA,KAAK,KAAK,IAAI;GACZ,OAAO,MAAM,MAAM,GAAG,KAAK,UAAU;GACrC,MAAM,KAAK,MAAM,GAAG,KAAK,UAAU;GACnC,IAAI,KAAK;GACT;GACA,aAAa,KAAK;GAClB,aAAa,WAAW,KAAK;GAC7B,UAAU,KAAK;EACjB,CAAC;EACD,OAAO;CACT;CAEA,YACE,QACA,QACA,YAAoB,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GAChD,SACS;EACT,MAAM,KAAK,OAAO,YAAY;EAC9B,MAAM,OAAO,KAAK,QAAQ,EAAE,KAAK,YAAY;EAC7C,IAAI,KAAK,cAAc,WACrB,OAAO;EAET,IACE,YAAY,KAAA,KACZ,KAAK,aAAa,KAAA,KAClB,KAAK,gBAAgB,aACrB,CAAC,oBACC;GAAE,YAAY;GAAW,IAAI;EAAQ,GACrC;GAAE,YAAY,KAAK;GAAa,IAAI,KAAK;EAAS,CACpD,GAEA,OAAO;EAGT,MAAM,KAAe,CAAC;EACtB,KAAK,MAAM,OAAO,QAAQ;GACxB,IAAI;GACJ,IAAI;IACF,MAAM,aAAa,GAAG;GACxB,QAAQ;IACN;GACF;GACA,IAAI,CAAC,GAAG,SAAS,GAAG,GAClB,GAAG,KAAK,GAAG;EAEf;EAEA,KAAK,KAAK,IAAI;GACZ,OAAO,KAAK;GACZ,MAAM,KAAK;GACX,IAAI,GAAG,MAAM,GAAG,KAAK,UAAU;GAC/B,WAAW,KAAK;GAChB,aAAa;GACb,aAAa,KAAK;GAClB,UAAU,WAAW,KAAK;EAC5B,CAAC;EACD,OAAO;CACT;CAEA,UAAU,QAA0C;EAClD,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC;CAC1C;CAEA,aAAa,QAA0B;EACrC,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC;CACvD;CAEA,YAAY,QAA0B;EACpC,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC;CACtD;;CAGA,SAAS,QAA0B;EACjC,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC;CACpD;CAEA,MAAM,QAAuB;EAC3B,IAAI,WAAW,KAAA,KAAa,WAAW,IACrC,KAAK,QAAQ,OAAO,OAAO,YAAY,CAAC;OAExC,KAAK,QAAQ,MAAM;CAEvB;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,QAAQ;CACtB;;;;;;;CAQA,MAAM,QAA8B;EAClC,MAAM,UAAU,OAAO,SAAS,KAAK,MAAM,EAAE,YAAY,CAAC;EAC1D,MAAM,QAAQ,OAAO,KAAK,EAAE,KAAK,MAAM,EAAE,YAAY,CAAC;EAEtD,KAAK,CAAC,WAAW,QAAQ,WAAW,OAAO,CAAC,SAAS,MAAM,WAAW,IACpE,OAAO;GAAE,0BAAU,IAAI,IAAI;GAAG,WAAW;EAAO;EAGlD,IAAI,WAAW,QAAQ,SAAS,MAAM,CAAC,SAAS,MAAM,WAAW,IAC/D,OAAO,KAAK,cAAc,QAAQ,SAAS,OAAO;EAGpD,IAAI,SAAS,MAAM,SAAS,MAAM,CAAC,WAAW,QAAQ,WAAW,IAAI;GACnE,MAAM,EAAE,SAAS,UAAU,GAAG,SAAS;GACvC,OAAO,KAAK,cAAc,MAAM,OAAO,SAAS,GAAG,aAAa;IAAE,GAAG;IAAG,MAAM;GAAQ,EAAE;EAC1F;EAGA,MAAM,4BAAY,IAAI,IAAI,CAAC,GAAI,WAAW,CAAC,GAAI,GAAI,SAAS,CAAC,CAAE,CAAC;EAChE,MAAM,yBAAS,IAAI,IAAY;EAC/B,IAAI,cAAc;EAClB,KAAK,MAAM,MAAM,WAAW;GAC1B,MAAM,IAAI,KAAK,QAAQ,EAAE;GACzB,MAAM,OAAO,IAAI,CAAC,GAAG,EAAE,OAAO,GAAG,EAAE,IAAI,IAAI,CAAC;GAC5C,IAAI,KAAK,WAAW,GAAG;IACrB,cAAc;IACd;GACF;GACA,KAAK,MAAM,KAAK,MACd,OAAO,IAAI,CAAC;EAEhB;EACA,IAAI,OAAO,SAAS,GAClB,OAAO;GAAE,0BAAU,IAAI,IAAI;GAAG,WAAW;EAAO;EAElD,MAAM,sBAAM,IAAI,IAAoB;EACpC,KAAK,MAAM,OAAO,QAChB,IAAI,IAAI,KAAK,EAAE,GAAG,OAAO,CAAC;EAE5B,OAAO,cAAc;GAAE,UAAU;GAAK,WAAW;EAAO,IAAI,EAAE,UAAU,IAAI;CAC9E;CAEA,cACE,QACA,SACA,WACA,UAAuD,MAAM,SAAS;EACpE,GAAG;EACH,SAAS;CACX,IACc;EACd,MAAM,2BAAW,IAAI,IAAsB;EAC3C,MAAM,WAAqB,CAAC;EAC5B,IAAI,WAAW;EAEf,KAAK,MAAM,MAAM,SAAS;GACxB,MAAM,SAAS,KAAK,QAAQ,EAAE;GAC9B,MAAM,OAAO,cAAc,UAAU,QAAQ,QAAQ,QAAQ;GAC7D,IAAI,CAAC,QAAQ,KAAK,WAAW,GAAG;IAC9B,SAAS,KAAK,EAAE;IAChB;GACF;GACA,WAAW;GACX,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,OAAO,SAAS,IAAI,GAAG,KAAK,CAAC;IACnC,KAAK,KAAK,EAAE;IACZ,SAAS,IAAI,KAAK,IAAI;GACxB;EACF;EAEA,IAAI,CAAC,UACH,OAAO;GAAE,0BAAU,IAAI,IAAI;GAAG,WAAW;EAAO;EAGlD,MAAM,sBAAM,IAAI,IAAoB;EACpC,KAAK,MAAM,CAAC,KAAK,QAAQ,UACvB,IAAI,IAAI,KAAK,OAAO,QAAQ,GAAG,CAAC;EAElC,OAAO,SAAS,SAAS,IACrB;GAAE,UAAU;GAAK,WAAW,OAAO,QAAQ,QAAQ;EAAE,IACrD,EAAE,UAAU,IAAI;CACtB;;CAGA,QAAQ,IAAsC;EAC5C,MAAM,SAAS,KAAK,QAAQ,IAAI,EAAE;EAClC,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,QAAQ,OAAO,EAAE;GACtB,KAAK,QAAQ,IAAI,IAAI,MAAM;EAC7B;EACA,OAAO;CACT;;CAGA,KAAK,IAAY,QAA4B;EAC3C,KAAK,QAAQ,OAAO,EAAE;EACtB,KAAK,QAAQ,IAAI,IAAI,MAAM;EAC3B,OAAO,KAAK,QAAQ,OAAO,KAAK,aAAa;GAC3C,MAAM,SAAS,KAAK,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;GAC1C,IAAI,WAAW,KAAA,GACb;GAEF,KAAK,QAAQ,OAAO,MAAM;EAC5B;CACF;AACF"}

package/dist/gossip.d.mts

@@ -1,3 +1,3 @@
-import { i as RoutedFilter, n as GossipOptions, r as PubkeyRoutes, t as Gossip } from "./gossip-C5RVB1UB.mjs";
+import { i as RoutedFilter, n as GossipOptions, r as PubkeyRoutes, t as Gossip } from "./gossip-BRQwIM_q.mjs";
 import "./index-CaxrMD1A.mjs";
 export { Gossip, type GossipOptions, type PubkeyRoutes, type RoutedFilter };

package/dist/gossip.mjs

@@ -1,2 +1,2 @@
-import { t as Gossip } from "./gossip-3xkRRCm_.mjs";
+import { t as Gossip } from "./gossip-oloDMWEj.mjs";
 export { Gossip };