@qntx/nostr 0.0.1

package/dist/filter-BxwjEkZp.mjs

@@ -0,0 +1,113 @@
+import { o as isReplaceableKind, r as isAddressableKind } from "./kind-BLl4cLOc.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.kinds && !filter.kinds.includes(event.kind)) return false;
+	if (filter.authors && !filter.authors.some((pk) => pk.toLowerCase() === event.pubkey.toLowerCase())) return false;
+	for (const key of Object.keys(filter)) {
+		if (key[0] !== "#") 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]);
+		})) 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;
+}
+function matchFilters(filters, event) {
+	for (const filter of filters) if (matchFilter(filter, event)) return true;
+	return false;
+}
+/** Merge filters by unioning list fields; returns a new plain object. */
+function mergeFilters(...filters) {
+	const result = {};
+	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;
+		}
+		if (filter.since !== void 0) {
+			const prev = result.since;
+			if (prev === void 0 || filter.since < prev) result.since = filter.since;
+		}
+		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.
+*/
+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;
+	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) {
+		if (filter.kinds.every((k) => isReplaceableKind(k) || isAddressableKind(k))) {
+			const dTags = filter["#d"];
+			const perAuthor = dTags && dTags.length > 0 ? dTags.length : 1;
+			limit = Math.min(limit, filter.authors.length * filter.kinds.length * perAuthor);
+		}
+	}
+	return limit;
+}
+/** Shallow-clone a filter (for per-relay narrowing). */
+function cloneFilter(filter) {
+	return { ...filter };
+}
+const HEX_LIST_KEYS = /* @__PURE__ */ new Set([
+	"ids",
+	"authors",
+	"#e",
+	"#p"
+]);
+/** Lowercase hex lists and sort every array. Omits undefined so `[]` stays distinct from missing. */
+function canonicalizeFilter(filter) {
+	const raw = filter;
+	const out = {};
+	for (const key of Object.keys(raw).sort()) {
+		const value = raw[key];
+		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 out[key] = value;
+	}
+	return out;
+}
+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.
+*/
+function filterFingerprint(filters) {
+	const parts = filters.map((filter) => JSON.stringify(canonicalizeFilter(filter)));
+	parts.sort();
+	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 };
+
+//# sourceMappingURL=filter-BxwjEkZp.mjs.map

package/dist/filter-BxwjEkZp.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-BxwjEkZp.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?: readonly string[];\n  readonly kinds?: readonly number[];\n  readonly authors?: readonly string[];\n  readonly since?: number;\n  readonly until?: number;\n  readonly limit?: number;\n  /**\n   * NIP-50 full-text search. Relays interpret this.\n   * Local `matchFilter` / `query` ignore it.\n   */\n  readonly search?: string;\n  readonly [key: `#${string}`]: readonly 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.toLowerCase())) {\n    return false;\n  }\n  if (filter.kinds && !filter.kinds.includes(event.kind)) return false;\n  if (\n    filter.authors &&\n    !filter.authors.some((pk) => pk.toLowerCase() === event.pubkey.toLowerCase())\n  ) {\n    return false;\n  }\n\n  for (const key of Object.keys(filter)) {\n    if (key[0] !== \"#\") continue;\n    const tagName = key.slice(1);\n    const values = filter[`#${tagName}`];\n    if (!values) continue;\n    const hexTag = tagName === \"e\" || tagName === \"p\";\n    const hit = event.tags.some((tag) => {\n      if (tag[0] !== tagName || tag[1] === undefined) return false;\n      if (hexTag) {\n        return values.some((v) => v.toLowerCase() === tag[1]!.toLowerCase());\n      }\n      return values.includes(tag[1]);\n    });\n    if (!hit) return false;\n  }\n\n  if (filter.since !== undefined && event.created_at < filter.since) return false;\n  if (filter.until !== undefined && event.created_at > filter.until) return false;\n\n  return true;\n}\n\nexport function matchFilters(filters: readonly Filter[], event: Event): boolean {\n  for (const filter of filters) {\n    if (matchFilter(filter, event)) return true;\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  for (const filter of filters) {\n    for (const [property, values] of Object.entries(filter)) {\n      if (\n        property === \"kinds\" ||\n        property === \"ids\" ||\n        property === \"authors\" ||\n        property[0] === \"#\"\n      ) {\n        const list = (result[property] as (string | number)[] | undefined) ?? [];\n        for (const value of values as readonly (string | number)[]) {\n          if (!list.includes(value)) list.push(value);\n        }\n        result[property] = list;\n      }\n    }\n    if (filter.limit !== undefined) {\n      const prev = result.limit as number | undefined;\n      if (prev === undefined || filter.limit > prev) result.limit = filter.limit;\n    }\n    if (filter.until !== undefined) {\n      const prev = result.until as number | undefined;\n      if (prev === undefined || filter.until > prev) result.until = filter.until;\n    }\n    if (filter.since !== undefined) {\n      const prev = result.since as number | undefined;\n      if (prev === undefined || filter.since < prev) result.since = filter.since;\n    }\n    if (filter.search !== undefined) {\n      result.search = filter.search;\n    }\n  }\n  return result as Filter;\n}\n\n/**\n * Intrinsic upper bound implied by the filter alone.\n * Returns a positive integer, or `Infinity` when unbounded.\n */\nexport function getFilterLimit(filter: Filter): number {\n  if (filter.ids && filter.ids.length === 0) return 0;\n  if (filter.kinds && filter.kinds.length === 0) return 0;\n  if (filter.authors && filter.authors.length === 0) return 0;\n\n  let limit = Infinity;\n  if (filter.ids) limit = Math.min(limit, filter.ids.length);\n  if (filter.limit !== undefined) limit = Math.min(limit, filter.limit);\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\n/** Shallow-clone a filter (for per-relay narrowing). */\nexport function cloneFilter(filter: Filter): Filter {\n  return { ...filter };\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) continue;\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((v) => Number(v)).sort((a, b) => a - b);\n      } else {\n        out[key] = value.map((v) => String(v)).sort();\n      }\n    } else {\n      out[key] = value;\n    }\n  }\n  return out as Filter;\n}\n\nexport function canonicalizeFilters(filters: readonly Filter[]): Filter[] {\n  return filters.map(canonicalizeFilter);\n}\n\n/**\n * Canonical identity for live REQ coalescing.\n * Relays treat a missing list key as unconstrained and `[]` as match-nothing.\n */\nexport function filterFingerprint(filters: readonly Filter[]): string {\n  const parts = filters.map((filter) => JSON.stringify(canonicalizeFilter(filter)));\n  parts.sort();\n  return `[${parts.join(\",\")}]`;\n}\n"],"mappings":";;;AAoBA,SAAgB,YAAY,QAAgB,OAAuB;CACjE,IAAI,OAAO,OAAO,CAAC,OAAO,IAAI,MAAM,OAAO,GAAG,YAAY,MAAM,MAAM,GAAG,YAAY,CAAC,GACpF,OAAO;CAET,IAAI,OAAO,SAAS,CAAC,OAAO,MAAM,SAAS,MAAM,IAAI,GAAG,OAAO;CAC/D,IACE,OAAO,WACP,CAAC,OAAO,QAAQ,MAAM,OAAO,GAAG,YAAY,MAAM,MAAM,OAAO,YAAY,CAAC,GAE5E,OAAO;CAGT,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAAG;EACrC,IAAI,IAAI,OAAO,KAAK;EACpB,MAAM,UAAU,IAAI,MAAM,CAAC;EAC3B,MAAM,SAAS,OAAO,IAAI;EAC1B,IAAI,CAAC,QAAQ;EACb,MAAM,SAAS,YAAY,OAAO,YAAY;EAQ9C,IAAI,CAPQ,MAAM,KAAK,MAAM,QAAQ;GACnC,IAAI,IAAI,OAAO,WAAW,IAAI,OAAO,KAAA,GAAW,OAAO;GACvD,IAAI,QACF,OAAO,OAAO,MAAM,MAAM,EAAE,YAAY,MAAM,IAAI,EAAE,CAAE,YAAY,CAAC;GAErE,OAAO,OAAO,SAAS,IAAI,EAAE;EAC/B,CACO,GAAG,OAAO;CACnB;CAEA,IAAI,OAAO,UAAU,KAAA,KAAa,MAAM,aAAa,OAAO,OAAO,OAAO;CAC1E,IAAI,OAAO,UAAU,KAAA,KAAa,MAAM,aAAa,OAAO,OAAO,OAAO;CAE1E,OAAO;AACT;AAEA,SAAgB,aAAa,SAA4B,OAAuB;CAC9E,KAAK,MAAM,UAAU,SACnB,IAAI,YAAY,QAAQ,KAAK,GAAG,OAAO;CAEzC,OAAO;AACT;;AAGA,SAAgB,aAAa,GAAG,SAA2B;CACzD,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,UAAU,SAAS;EAC5B,KAAK,MAAM,CAAC,UAAU,WAAW,OAAO,QAAQ,MAAM,GACpD,IACE,aAAa,WACb,aAAa,SACb,aAAa,aACb,SAAS,OAAO,KAChB;GACA,MAAM,OAAQ,OAAO,aAAiD,CAAC;GACvE,KAAK,MAAM,SAAS,QAClB,IAAI,CAAC,KAAK,SAAS,KAAK,GAAG,KAAK,KAAK,KAAK;GAE5C,OAAO,YAAY;EACrB;EAEF,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,OAAO,OAAO;GACpB,IAAI,SAAS,KAAA,KAAa,OAAO,QAAQ,MAAM,OAAO,QAAQ,OAAO;EACvE;EACA,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,OAAO,OAAO;GACpB,IAAI,SAAS,KAAA,KAAa,OAAO,QAAQ,MAAM,OAAO,QAAQ,OAAO;EACvE;EACA,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,OAAO,OAAO;GACpB,IAAI,SAAS,KAAA,KAAa,OAAO,QAAQ,MAAM,OAAO,QAAQ,OAAO;EACvE;EACA,IAAI,OAAO,WAAW,KAAA,GACpB,OAAO,SAAS,OAAO;CAE3B;CACA,OAAO;AACT;;;;;AAMA,SAAgB,eAAe,QAAwB;CACrD,IAAI,OAAO,OAAO,OAAO,IAAI,WAAW,GAAG,OAAO;CAClD,IAAI,OAAO,SAAS,OAAO,MAAM,WAAW,GAAG,OAAO;CACtD,IAAI,OAAO,WAAW,OAAO,QAAQ,WAAW,GAAG,OAAO;CAE1D,IAAI,QAAQ;CACZ,IAAI,OAAO,KAAK,QAAQ,KAAK,IAAI,OAAO,OAAO,IAAI,MAAM;CACzD,IAAI,OAAO,UAAU,KAAA,GAAW,QAAQ,KAAK,IAAI,OAAO,OAAO,KAAK;CAEpE,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;;AAGA,SAAgB,YAAY,QAAwB;CAClD,OAAO,EAAE,GAAG,OAAO;AACrB;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,GAAW;EACzB,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,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;QAE3D,IAAI,OAAO,MAAM,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK;EAEhD,OACE,IAAI,OAAO;CAEf;CACA,OAAO;AACT;AAEA,SAAgB,oBAAoB,SAAsC;CACxE,OAAO,QAAQ,IAAI,kBAAkB;AACvC;;;;;AAMA,SAAgB,kBAAkB,SAAoC;CACpE,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-DUEKP3q1.d.mts

@@ -0,0 +1,40 @@
+import { t as Event } from "./event-B5D2jxt_.mjs";
+//#region src/core/filter.d.ts
+/** NIP-01 filter object (immutable-friendly; callers may still pass plain objects). */
+type Filter = {
+  readonly ids?: readonly string[];
+  readonly kinds?: readonly number[];
+  readonly authors?: readonly string[];
+  readonly since?: number;
+  readonly until?: number;
+  readonly limit?: number;
+  /**
+   * NIP-50 full-text search. Relays interpret this.
+   * Local `matchFilter` / `query` ignore it.
+   */
+  readonly search?: string;
+  readonly [key: `#${string}`]: readonly string[] | undefined;
+};
+/** Local NIP-01 match. `search` is ignored; relays interpret NIP-50. */
+declare function matchFilter(filter: Filter, event: Event): boolean;
+declare function matchFilters(filters: readonly 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;
+/** Shallow-clone a filter (for per-relay narrowing). */
+declare function cloneFilter(filter: Filter): Filter;
+/** Lowercase hex lists and sort every array. Omits undefined so `[]` stays distinct from missing. */
+declare function canonicalizeFilter(filter: Filter): Filter;
+declare function canonicalizeFilters(filters: readonly Filter[]): Filter[];
+/**
+ * Canonical identity for live REQ coalescing.
+ * Relays treat a missing list key as unconstrained and `[]` as match-nothing.
+ */
+declare function filterFingerprint(filters: readonly Filter[]): string;
+//#endregion
+export { filterFingerprint as a, matchFilters as c, cloneFilter as i, mergeFilters as l, canonicalizeFilter as n, getFilterLimit as o, canonicalizeFilters as r, matchFilter as s, Filter as t };
+//# sourceMappingURL=filter-DUEKP3q1.d.mts.map

package/dist/gossip-3xkRRCm_.mjs

@@ -0,0 +1,220 @@
+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 { parseRelayList } from "./nips/nip65.mjs";
+import { parseDmRelayList } from "./nips/nip17.mjs";
+//#region src/gossip/gossip.ts
+function emptyRoutes() {
+	return {
+		write: [],
+		read: [],
+		dm: [],
+		updatedAt: 0,
+		dmUpdatedAt: 0
+	};
+}
+/**
+* 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;
+	constructor(opts = {}) {
+		this.#maxRelays = opts.maxRelaysPerPubkey ?? 4;
+	}
+	/**
+	* 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) {
+		if (event.kind === Kind.RelayList) {
+			let items;
+			try {
+				items = parseRelayList(event);
+			} catch {
+				return false;
+			}
+			return this.setRoutes(event.pubkey, items, event.created_at, event.id);
+		}
+		if (event.kind === Kind.DirectMessageRelaysList) {
+			let relays;
+			try {
+				relays = parseDmRelayList(event);
+			} catch {
+				return false;
+			}
+			return this.setDmRoutes(event.pubkey, relays, event.created_at, event.id);
+		}
+		return false;
+	}
+	setRoutes(pubkey, items, updatedAt = Math.floor(Date.now() / 1e3), eventId) {
+		const pk = pubkey.toLowerCase();
+		const prev = this.#routes.get(pk) ?? emptyRoutes();
+		if (prev.updatedAt > updatedAt) return false;
+		if (eventId && prev.relayListId && prev.updatedAt === updatedAt && !isReplaceableWinner({
+			created_at: updatedAt,
+			id: eventId
+		}, {
+			created_at: prev.updatedAt,
+			id: prev.relayListId
+		})) return false;
+		const write = [];
+		const read = [];
+		for (const item of items) {
+			let url;
+			try {
+				url = normalizeURL(item.url);
+			} catch {
+				continue;
+			}
+			if (item.write && !write.includes(url)) write.push(url);
+			if (item.read && !read.includes(url)) read.push(url);
+		}
+		this.#routes.set(pk, {
+			write: write.slice(0, this.#maxRelays),
+			read: read.slice(0, this.#maxRelays),
+			dm: prev.dm,
+			updatedAt,
+			dmUpdatedAt: prev.dmUpdatedAt,
+			relayListId: eventId ?? prev.relayListId,
+			dmListId: prev.dmListId
+		});
+		return true;
+	}
+	setDmRoutes(pubkey, relays, updatedAt = Math.floor(Date.now() / 1e3), eventId) {
+		const pk = pubkey.toLowerCase();
+		const prev = this.#routes.get(pk) ?? emptyRoutes();
+		if (prev.dmUpdatedAt > updatedAt) return false;
+		if (eventId && prev.dmListId && prev.dmUpdatedAt === updatedAt && !isReplaceableWinner({
+			created_at: updatedAt,
+			id: eventId
+		}, {
+			created_at: prev.dmUpdatedAt,
+			id: prev.dmListId
+		})) return false;
+		const dm = [];
+		for (const raw of relays) {
+			let url;
+			try {
+				url = normalizeURL(raw);
+			} catch {
+				continue;
+			}
+			if (!dm.includes(url)) dm.push(url);
+		}
+		this.#routes.set(pk, {
+			write: prev.write,
+			read: prev.read,
+			dm: dm.slice(0, this.#maxRelays),
+			updatedAt: prev.updatedAt,
+			dmUpdatedAt: updatedAt,
+			relayListId: prev.relayListId,
+			dmListId: eventId ?? prev.dmListId
+		});
+		return true;
+	}
+	getRoutes(pubkey) {
+		return this.#routes.get(pubkey.toLowerCase());
+	}
+	outboxRelays(pubkey) {
+		return this.#routes.get(pubkey.toLowerCase())?.write ?? [];
+	}
+	inboxRelays(pubkey) {
+		return this.#routes.get(pubkey.toLowerCase())?.read ?? [];
+	}
+	/** NIP-17 kind:10050 delivery relays for gift-wraps. */
+	dmRelays(pubkey) {
+		return this.#routes.get(pubkey.toLowerCase())?.dm ?? [];
+	}
+	clear(pubkey) {
+		if (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(filter) {
+		const authors = filter.authors?.map((a) => a.toLowerCase());
+		const pTags = filter["#p"]?.map((p) => p.toLowerCase());
+		if ((!authors || authors.length === 0) && (!pTags || pTags.length === 0)) return {
+			perRelay: /* @__PURE__ */ new Map(),
+			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
+		}));
+		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 urls = r ? [...r.write, ...r.read] : [];
+			if (urls.length === 0) {
+				anyUnrouted = true;
+				continue;
+			}
+			for (const u of urls) relays.add(u);
+		}
+		if (relays.size === 0) return {
+			perRelay: /* @__PURE__ */ new Map(),
+			remainder: filter
+		};
+		const map = /* @__PURE__ */ new Map();
+		for (const url of relays) map.set(url, { ...filter });
+		return anyUnrouted ? {
+			perRelay: map,
+			remainder: filter
+		} : { perRelay: map };
+	}
+	#breakAuthors(filter, pubkeys, direction, narrow = (base, pks) => ({
+		...base,
+		authors: pks
+	})) {
+		const perRelay = /* @__PURE__ */ new Map();
+		const unrouted = [];
+		let anyRoute = false;
+		for (const pk of pubkeys) {
+			const routes = this.#routes.get(pk);
+			const urls = direction === "write" ? routes?.write : routes?.read;
+			if (!urls || urls.length === 0) {
+				unrouted.push(pk);
+				continue;
+			}
+			anyRoute = true;
+			for (const url of urls) {
+				const list = perRelay.get(url) ?? [];
+				list.push(pk);
+				perRelay.set(url, list);
+			}
+		}
+		if (!anyRoute) return {
+			perRelay: /* @__PURE__ */ new Map(),
+			remainder: filter
+		};
+		const map = /* @__PURE__ */ new Map();
+		for (const [url, pks] of perRelay) map.set(url, narrow(filter, pks));
+		return unrouted.length > 0 ? {
+			perRelay: map,
+			remainder: narrow(filter, unrouted)
+		} : { perRelay: map };
+	}
+};
+//#endregion
+export { Gossip as t };
+
+//# sourceMappingURL=gossip-3xkRRCm_.mjs.map

package/dist/gossip-3xkRRCm_.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"gossip-3xkRRCm_.mjs","names":["#routes","#maxRelays","#breakAuthors"],"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 { parseDmRelayList } from \"../nips/nip17.ts\";\nimport { parseRelayList, type RelayListItem } from \"../nips/nip65.ts\";\nimport { normalizeURL } from \"../core/util.ts\";\n\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;\n  /** Event id of the last accepted kind:10050. */\n  dmListId?: string;\n};\n\nexport type RoutedFilter = {\n  /** url → already-narrowed filter. Empty when nothing routed. */\n  perRelay: Map<string, Filter>;\n  /**\n   * Unrouted work for the caller:\n   * - no authors and no #p: original filter (today's \"generic\")\n   * - authors/#p all unrouted: original filter (today's \"orphan\")\n   * - mixed: narrowed leftover (today's fallback)\n   * - 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\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).\n * Ingest replaceable list events, then route filters into per-relay REQs.\n */\nexport class Gossip {\n  readonly #routes = new Map<string, PubkeyRoutes>();\n  readonly #maxRelays: number;\n\n  constructor(opts: GossipOptions = {}) {\n    this.#maxRelays = opts.maxRelaysPerPubkey ?? 4;\n  }\n\n  /**\n   * Ingest a routing list event.\n   * - kind:10002 → write/read (NIP-65)\n   * - 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 = Math.floor(Date.now() / 1000),\n    eventId?: string,\n  ): boolean {\n    const pk = pubkey.toLowerCase();\n    const prev = this.#routes.get(pk) ?? emptyRoutes();\n    if (prev.updatedAt > updatedAt) return false;\n    if (\n      eventId &&\n      prev.relayListId &&\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)) write.push(url);\n      if (item.read && !read.includes(url)) read.push(url);\n    }\n\n    this.#routes.set(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: readonly string[],\n    updatedAt = Math.floor(Date.now() / 1000),\n    eventId?: string,\n  ): boolean {\n    const pk = pubkey.toLowerCase();\n    const prev = this.#routes.get(pk) ?? emptyRoutes();\n    if (prev.dmUpdatedAt > updatedAt) return false;\n    if (\n      eventId &&\n      prev.dmListId &&\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)) dm.push(url);\n    }\n\n    this.#routes.set(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.#routes.get(pubkey.toLowerCase());\n  }\n\n  outboxRelays(pubkey: string): string[] {\n    return this.#routes.get(pubkey.toLowerCase())?.write ?? [];\n  }\n\n  inboxRelays(pubkey: string): string[] {\n    return this.#routes.get(pubkey.toLowerCase())?.read ?? [];\n  }\n\n  /** NIP-17 kind:10050 delivery relays for gift-wraps. */\n  dmRelays(pubkey: string): string[] {\n    return this.#routes.get(pubkey.toLowerCase())?.dm ?? [];\n  }\n\n  clear(pubkey?: string): void {\n    if (pubkey) this.#routes.delete(pubkey.toLowerCase());\n    else this.#routes.clear();\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.\n   * - authors → outbox relays, filter narrowed per relay's authors\n   * - #p only → inbox relays of those pubkeys\n   * - neither / all unrouted → remainder is the original filter\n   * - mixed → remainder is the narrowed leftover; all 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      return this.#breakAuthors(\n        { ...filter, authors: undefined },\n        pTags,\n        \"read\",\n        (base, pubkeys) => ({ ...base, \"#p\": pubkeys }),\n      );\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.#routes.get(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) relays.add(u);\n    }\n    if (relays.size === 0) return { perRelay: new Map(), remainder: filter };\n    const map = new Map<string, Filter>();\n    for (const url of relays) map.set(url, { ...filter });\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.#routes.get(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) return { perRelay: new Map(), remainder: filter };\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"],"mappings":";;;;;;AA2CA,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;CAEA,YAAY,OAAsB,CAAC,GAAG;EACpC,KAAKC,aAAa,KAAK,sBAAsB;CAC/C;;;;;;;CAQA,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,YAAY,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GACxC,SACS;EACT,MAAM,KAAK,OAAO,YAAY;EAC9B,MAAM,OAAO,KAAKD,QAAQ,IAAI,EAAE,KAAK,YAAY;EACjD,IAAI,KAAK,YAAY,WAAW,OAAO;EACvC,IACE,WACA,KAAK,eACL,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,GAAG,MAAM,KAAK,GAAG;GACtD,IAAI,KAAK,QAAQ,CAAC,KAAK,SAAS,GAAG,GAAG,KAAK,KAAK,GAAG;EACrD;EAEA,KAAKA,QAAQ,IAAI,IAAI;GACnB,OAAO,MAAM,MAAM,GAAG,KAAKC,UAAU;GACrC,MAAM,KAAK,MAAM,GAAG,KAAKA,UAAU;GACnC,IAAI,KAAK;GACT;GACA,aAAa,KAAK;GAClB,aAAa,WAAW,KAAK;GAC7B,UAAU,KAAK;EACjB,CAAC;EACD,OAAO;CACT;CAEA,YACE,QACA,QACA,YAAY,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GACxC,SACS;EACT,MAAM,KAAK,OAAO,YAAY;EAC9B,MAAM,OAAO,KAAKD,QAAQ,IAAI,EAAE,KAAK,YAAY;EACjD,IAAI,KAAK,cAAc,WAAW,OAAO;EACzC,IACE,WACA,KAAK,YACL,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,GAAG,GAAG,KAAK,GAAG;EACpC;EAEA,KAAKA,QAAQ,IAAI,IAAI;GACnB,OAAO,KAAK;GACZ,MAAM,KAAK;GACX,IAAI,GAAG,MAAM,GAAG,KAAKC,UAAU;GAC/B,WAAW,KAAK;GAChB,aAAa;GACb,aAAa,KAAK;GAClB,UAAU,WAAW,KAAK;EAC5B,CAAC;EACD,OAAO;CACT;CAEA,UAAU,QAA0C;EAClD,OAAO,KAAKD,QAAQ,IAAI,OAAO,YAAY,CAAC;CAC9C;CAEA,aAAa,QAA0B;EACrC,OAAO,KAAKA,QAAQ,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC;CAC3D;CAEA,YAAY,QAA0B;EACpC,OAAO,KAAKA,QAAQ,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC;CAC1D;;CAGA,SAAS,QAA0B;EACjC,OAAO,KAAKA,QAAQ,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC;CACxD;CAEA,MAAM,QAAuB;EAC3B,IAAI,QAAQ,KAAKA,QAAQ,OAAO,OAAO,YAAY,CAAC;OAC/C,KAAKA,QAAQ,MAAM;CAC1B;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKA,QAAQ;CACtB;;;;;;;;CASA,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,KAAKE,cAAc,QAAQ,SAAS,OAAO;EAGpD,IAAI,SAAS,MAAM,SAAS,MAAM,CAAC,WAAW,QAAQ,WAAW,IAC/D,OAAO,KAAKA,cACV;GAAE,GAAG;GAAQ,SAAS,KAAA;EAAU,GAChC,OACA,SACC,MAAM,aAAa;GAAE,GAAG;GAAM,MAAM;EAAQ,EAC/C;EAIF,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,KAAKF,QAAQ,IAAI,EAAE;GAC7B,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,MAAM,OAAO,IAAI,CAAC;EACpC;EACA,IAAI,OAAO,SAAS,GAAG,OAAO;GAAE,0BAAU,IAAI,IAAI;GAAG,WAAW;EAAO;EACvE,MAAM,sBAAM,IAAI,IAAoB;EACpC,KAAK,MAAM,OAAO,QAAQ,IAAI,IAAI,KAAK,EAAE,GAAG,OAAO,CAAC;EACpD,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,KAAKA,QAAQ,IAAI,EAAE;GAClC,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,UAAU,OAAO;GAAE,0BAAU,IAAI,IAAI;GAAG,WAAW;EAAO;EAE/D,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;AACF"}

package/dist/gossip-C5RVB1UB.d.mts

@@ -0,0 +1,71 @@
+import { t as Event } from "./event-B5D2jxt_.mjs";
+import { t as Filter } from "./filter-DUEKP3q1.mjs";
+import { t as RelayListItem } from "./nip65-Di5hZRuV.mjs";
+//#region src/gossip/gossip.d.ts
+type PubkeyRoutes = {
+  /** Relays the user writes to (outbox). NIP-65. */
+  write: string[];
+  /** Relays the user reads from (inbox). NIP-65. */
+  read: string[];
+  /** Relays for NIP-17 gift-wrap delivery. Kind 10050. */
+  dm: string[];
+  /** `created_at` of the last accepted kind:10002 list. */
+  updatedAt: number;
+  /** `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;
+  /** Event id of the last accepted kind:10050. */
+  dmListId?: string;
+};
+type RoutedFilter = {
+  /** 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
+   */
+  remainder?: Filter;
+};
+type GossipOptions = {
+  /** Max relays to keep per direction when ranking. Default 4. */
+  maxRelaysPerPubkey?: number;
+};
+/**
+ * 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)
+   * 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;
+  getRoutes(pubkey: string): PubkeyRoutes | undefined;
+  outboxRelays(pubkey: string): string[];
+  inboxRelays(pubkey: string): string[];
+  /** NIP-17 kind:10050 delivery relays for gift-wraps. */
+  dmRelays(pubkey: string): string[];
+  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(filter: Filter): RoutedFilter;
+}
+//#endregion
+export { RoutedFilter as i, GossipOptions as n, PubkeyRoutes as r, Gossip as t };
+//# sourceMappingURL=gossip-C5RVB1UB.d.mts.map

package/dist/gossip.d.mts

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

package/dist/gossip.mjs

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

package/dist/http-6vevbBlu.d.mts

@@ -0,0 +1,22 @@
+//#region src/nips/http.d.ts
+/**
+ * Shared nips HTTP primitive. Not a pack entry (core has zero network).
+ * Callers never pass `redirect`; sendManual always sets `"manual"`.
+ */
+type ManualFetch = (url: string, init?: {
+  method?: string;
+  headers?: Record<string, string>;
+  body?: Blob | FormData | string | null;
+  signal?: AbortSignal;
+}) => Promise<{
+  ok: boolean;
+  status: number;
+  headers: {
+    get(name: string): string | null;
+  };
+  json(): Promise<unknown>;
+  arrayBuffer(): Promise<ArrayBuffer>;
+}>;
+//#endregion
+export { ManualFetch as t };
+//# sourceMappingURL=http-6vevbBlu.d.mts.map

package/dist/http-D2rhokZo.mjs

@@ -0,0 +1,24 @@
+//#region src/nips/http.ts
+function requireGlobalFetch(missing) {
+	if (typeof globalThis.fetch !== "function") throw missing();
+	return globalThis.fetch.bind(globalThis);
+}
+/** Always sets redirect:manual. Shared by fetchManual and headStatus. */
+async function sendManual(fetchImpl, url, init) {
+	return await fetchImpl(url, {
+		...init,
+		redirect: "manual"
+	});
+}
+async function fetchManual(fetchImpl, url, init, wrapNetwork) {
+	try {
+		return await sendManual(fetchImpl, url, init);
+	} catch (err) {
+		if (err instanceof Error && err.name === "AbortError") throw err;
+		throw wrapNetwork(err);
+	}
+}
+//#endregion
+export { requireGlobalFetch as n, sendManual as r, fetchManual as t };
+
+//# sourceMappingURL=http-D2rhokZo.mjs.map

package/dist/http-D2rhokZo.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"http-D2rhokZo.mjs","names":[],"sources":["../src/nips/http.ts"],"sourcesContent":["/**\n * Shared nips HTTP primitive. Not a pack entry (core has zero network).\n * Callers never pass `redirect`; sendManual always sets `\"manual\"`.\n */\n\nexport type ManualFetch = (\n  url: string,\n  init?: {\n    method?: string;\n    headers?: Record<string, string>;\n    body?: Blob | FormData | string | null;\n    signal?: AbortSignal;\n  },\n) => Promise<{\n  ok: boolean;\n  status: number;\n  headers: { get(name: string): string | null };\n  json(): Promise<unknown>;\n  arrayBuffer(): Promise<ArrayBuffer>;\n}>;\n\ntype ManualInit = NonNullable<Parameters<ManualFetch>[1]>;\n\nexport function requireGlobalFetch(missing: () => Error): ManualFetch {\n  if (typeof globalThis.fetch !== \"function\") throw missing();\n  return globalThis.fetch.bind(globalThis) as ManualFetch;\n}\n\n/** Always sets redirect:manual. Shared by fetchManual and headStatus. */\nexport async function sendManual(\n  fetchImpl: ManualFetch,\n  url: string,\n  init: ManualInit,\n): Promise<Awaited<ReturnType<ManualFetch>>> {\n  return await fetchImpl(url, { ...init, redirect: \"manual\" } as Parameters<ManualFetch>[1]);\n}\n\nexport async function fetchManual(\n  fetchImpl: ManualFetch,\n  url: string,\n  init: ManualInit,\n  wrapNetwork: (err: unknown) => Error,\n): Promise<Awaited<ReturnType<ManualFetch>>> {\n  try {\n    return await sendManual(fetchImpl, url, init);\n  } catch (err) {\n    if (err instanceof Error && err.name === \"AbortError\") throw err;\n    throw wrapNetwork(err);\n  }\n}\n"],"mappings":";AAuBA,SAAgB,mBAAmB,SAAmC;CACpE,IAAI,OAAO,WAAW,UAAU,YAAY,MAAM,QAAQ;CAC1D,OAAO,WAAW,MAAM,KAAK,UAAU;AACzC;;AAGA,eAAsB,WACpB,WACA,KACA,MAC2C;CAC3C,OAAO,MAAM,UAAU,KAAK;EAAE,GAAG;EAAM,UAAU;CAAS,CAA+B;AAC3F;AAEA,eAAsB,YACpB,WACA,KACA,MACA,aAC2C;CAC3C,IAAI;EACF,OAAO,MAAM,WAAW,WAAW,KAAK,IAAI;CAC9C,SAAS,KAAK;EACZ,IAAI,eAAe,SAAS,IAAI,SAAS,cAAc,MAAM;EAC7D,MAAM,YAAY,GAAG;CACvB;AACF"}