@qntx/nostr 0.13.0 → 0.15.0

package/dist/event-DHtcm0jM.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"event-DHtcm0jM.mjs","names":[],"sources":["../src/core/tag.ts","../src/core/event.ts"],"sourcesContent":["import { isAddressableKind, isReplaceableKind } from \"./kind.ts\";\nimport { isHex32, lowerAscii } from \"./util.ts\";\n\n/** A NIP-01 tag: first element is the name, rest are values. */\nexport type Tag = ReadonlyArray<string>;\n\n/** Mutable tag builder input. */\nexport type TagInput = string[];\n\n/** Type guard: a non-empty array of strings. */\nexport function isTag(value: unknown): value is Tag {\n  if (!Array.isArray(value) || value.length === 0) {\n    return false;\n  }\n  for (const item of value) {\n    if (typeof item !== \"string\") {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** First element of a tag (its name). */\nexport function tagName(tag: Tag): string {\n  return tag[0] ?? \"\";\n}\n\n/** Second element of a tag (its primary value), or undefined for a bare name tag. */\nexport function tagValue(tag: Tag): string | undefined {\n  return tag[1];\n}\n\n/**\n * Push positional tag values: \"\" for absent slots before a present one, trailing absent slots\n * omitted.\n */\nfunction pushPositions(t: string[], positions: Array<string | undefined>): void {\n  let end = positions.length;\n  while (end > 0 && positions[end - 1] === undefined) {\n    end -= 1;\n  }\n  for (let i = 0; i < end; i += 1) {\n    t.push(positions[i] ?? \"\");\n  }\n}\n\n/** Construct common tags. */\nexport const Tag = {\n  e(id: string, relay?: string, marker?: string, pubkey?: string): Tag {\n    const t: string[] = [\"e\", lowerAscii(id)];\n    pushPositions(t, [relay, marker, pubkey?.toLowerCase()]);\n    return t;\n  },\n  p(pubkey: string, relay?: string, petname?: string): Tag {\n    const t: string[] = [\"p\", pubkey.toLowerCase()];\n    pushPositions(t, [relay, petname]);\n    return t;\n  },\n  a(coordinate: string, relay?: string): Tag {\n    const t: string[] = [\"a\", coordinate];\n    if (relay !== undefined) {\n      t.push(relay);\n    }\n    return t;\n  },\n  d(identifier: string): Tag {\n    return [\"d\", identifier];\n  },\n  t(hashtag: string): Tag {\n    return [\"t\", hashtag];\n  },\n  r(url: string, marker?: string): Tag {\n    const t: string[] = [\"r\", url];\n    if (marker !== undefined) {\n      t.push(marker);\n    }\n    return t;\n  },\n  k(kind: number | string): Tag {\n    return [\"k\", String(kind)];\n  },\n} as const;\n\n/** First tag value with the given name, or undefined when no such tag has a value. */\nexport function firstTagValue(tags: ReadonlyArray<Tag>, name: string): string | undefined {\n  for (const tag of tags) {\n    if (tag[0] === name && tag[1] !== undefined) {\n      return tag[1];\n    }\n  }\n  return undefined;\n}\n\n/** First `d` tag value on an event, if any. */\nexport function getDTag(tags: ReadonlyArray<Tag>): string | undefined {\n  return firstTagValue(tags, \"d\");\n}\n\n/** NIP-01 `a` tag: `kind:pubkey:identifier` (identifier may be empty and may contain extra colons). */\nexport type EventAddress = {\n  kind: number;\n  pubkey: string;\n  identifier: string;\n};\n\n/** Parse a NIP-01 addressable/replaceable coordinate. */\nexport function parseEventAddress(value: string): EventAddress | undefined {\n  const first = value.indexOf(\":\");\n  if (first <= 0) {\n    return undefined;\n  }\n  const second = value.indexOf(\":\", first + 1);\n  if (second === -1) {\n    return undefined;\n  }\n  const kindText = value.slice(0, first);\n  // Strict decimal: Number() also accepts \"1e4\", \"0x10\", \" 1\", \"+1\" — none are NIP-19 kinds.\n  if (!/^\\d{1,5}$/.test(kindText)) {\n    return undefined;\n  }\n  const kind = Number(kindText);\n  if (kind > 65535) {\n    return undefined;\n  }\n  const pubkey = value.slice(first + 1, second);\n  if (!isHex32(pubkey)) {\n    return undefined;\n  }\n  return { kind, pubkey, identifier: value.slice(second + 1) };\n}\n\n/**\n * Caller-input form of {@link parseEventAddress}: the pubkey segment accepts any hex case; the\n * case-sensitive `d` identifier stays verbatim. Protocol text must use {@link parseEventAddress},\n * which is lowercase-only.\n */\nexport function parseEventAddressInput(value: string): EventAddress | undefined {\n  const first = value.indexOf(\":\");\n  const second = first === -1 ? -1 : value.indexOf(\":\", first + 1);\n  if (second < 0) {\n    return undefined;\n  }\n  return parseEventAddress(\n    `${value.slice(0, first + 1)}${value.slice(first + 1, second).toLowerCase()}${value.slice(second)}`,\n  );\n}\n\n/** Format an address as a `kind:pubkey:dTag` coordinate string. */\nexport function formatEventAddress(kind: number, pubkey: string, identifier = \"\"): string {\n  return `${kind}:${pubkey.toLowerCase()}:${identifier}`;\n}\n\n/**\n * Coordinate for replaceable (`kind:pubkey:`) and addressable (`kind:pubkey:d`) events. Undefined\n * for regular/ephemeral kinds.\n */\nexport function eventAddress(event: {\n  kind: number;\n  pubkey: string;\n  tags: ReadonlyArray<Tag>;\n}): string | undefined {\n  if (isAddressableKind(event.kind)) {\n    return formatEventAddress(event.kind, event.pubkey, getDTag(event.tags) ?? \"\");\n  }\n  if (isReplaceableKind(event.kind)) {\n    return formatEventAddress(event.kind, event.pubkey, \"\");\n  }\n  return undefined;\n}\n","import { sha256 } from \"@noble/hashes/sha2.js\";\n\nimport { EventValidationError } from \"./error.ts\";\nimport type { Tag } from \"./tag.ts\";\nimport { isTag } from \"./tag.ts\";\nimport { bytesToHex, hasLoneSurrogate, isHex32, isHex64, isRecord, utf8Encoder } from \"./util.ts\";\n\n/** Wire event template before pubkey/id/sig. */\nexport type EventTemplate = {\n  readonly kind: number;\n  readonly tags: ReadonlyArray<Tag>;\n  readonly content: string;\n  readonly created_at: number;\n};\n\n/** Event with pubkey, ready to hash and sign. */\nexport type UnsignedEvent = EventTemplate & {\n  readonly pubkey: string;\n};\n\n/**\n * Fully formed NIP-01 event (JSON-friendly plain object). Fields are readonly at the type level;\n * wire interop remains plain JSON.\n */\nexport type Event = UnsignedEvent & {\n  readonly id: string;\n  readonly sig: string;\n};\n\n/** Cache of events whose signatures have been verified successfully. */\nconst verifiedEvents = new WeakSet<Event>();\n\n/** Cache of events known to fail verification. */\nconst failedEvents = new WeakSet<Event>();\n\n/** Cache of object identities that already passed {@link validateSignedEvent}. */\nconst validatedEvents = new WeakSet<Record<string, unknown>>();\n\nexport function markVerified(event: Event): void {\n  verifiedEvents.add(event);\n  failedEvents.delete(event);\n}\n\nexport function markUnverified(event: Event): void {\n  failedEvents.add(event);\n  verifiedEvents.delete(event);\n}\n\nexport function isMarkedVerified(event: Event): boolean {\n  return verifiedEvents.has(event);\n}\n\nexport function isMarkedFailed(event: Event): boolean {\n  return failedEvents.has(event);\n}\n\n/** Structural validation of an unsigned event (no crypto). */\nexport function validateEvent(event: unknown): event is UnsignedEvent {\n  if (!isRecord(event)) {\n    return false;\n  }\n  if (\n    typeof event[\"kind\"] !== \"number\" ||\n    !Number.isSafeInteger(event[\"kind\"]) ||\n    event[\"kind\"] < 0 ||\n    event[\"kind\"] > 65535\n  ) {\n    return false;\n  }\n  // Lone surrogates are rejected per NIP-01: after JSON.parse they differ from\n  // what serde_json (and thus Rust) can express, so the event id would diverge.\n  if (typeof event[\"content\"] !== \"string\" || hasLoneSurrogate(event[\"content\"])) {\n    return false;\n  }\n  if (\n    typeof event[\"created_at\"] !== \"number\" ||\n    !Number.isSafeInteger(event[\"created_at\"]) ||\n    event[\"created_at\"] < 0\n  ) {\n    return false;\n  }\n  if (typeof event[\"pubkey\"] !== \"string\" || !isHex32(event[\"pubkey\"])) {\n    return false;\n  }\n  if (!Array.isArray(event[\"tags\"])) {\n    return false;\n  }\n  for (const tag of event[\"tags\"]) {\n    if (!isTag(tag)) {\n      return false;\n    }\n    for (const item of tag) {\n      if (hasLoneSurrogate(item)) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\n/** Structural validation of a full event including id and sig hex shape. */\nexport function validateSignedEvent(event: unknown): event is Event {\n  if (isRecord(event) && validatedEvents.has(event)) {\n    return true;\n  }\n  if (!validateEvent(event)) {\n    return false;\n  }\n  const e = event as Record<string, unknown>;\n  if (typeof e[\"id\"] !== \"string\" || !isHex32(e[\"id\"])) {\n    return false;\n  }\n  if (typeof e[\"sig\"] !== \"string\" || !isHex64(e[\"sig\"])) {\n    return false;\n  }\n  validatedEvents.add(e);\n  return true;\n}\n\n/**\n * Canonical NIP-01 serialization used for hashing: JSON array `[0, pubkey, created_at, kind, tags,\n * content]` with no extra whitespace.\n */\nexport function serializeEvent(event: UnsignedEvent): string {\n  if (!validateEvent(event)) {\n    throw new EventValidationError(\"cannot serialize event with invalid shape\");\n  }\n  return serializeValidatedEvent(event);\n}\n\n/**\n * Canonical serialization for an event already known valid (after {@link validateEvent} or\n * {@link validateSignedEvent}); identical output to {@link serializeEvent} without re-walking the\n * structural checks.\n */\nexport function serializeValidatedEvent(event: UnsignedEvent): string {\n  return JSON.stringify([0, event.pubkey, event.created_at, event.kind, event.tags, event.content]);\n}\n\n/** SHA-256 of the canonical serialization, lowercase hex. */\nexport function getEventHash(event: UnsignedEvent): string {\n  const serialized = serializeEvent(event);\n  return bytesToHex(sha256(utf8Encoder.encode(serialized)));\n}\n\n/** Id tie-break: plain code-unit order (ids are canonical lowercase hex, so `<` is lexical). */\nfunction compareIds(a: { id: string }, b: { id: string }): number {\n  if (a.id < b.id) {\n    return -1;\n  }\n  if (a.id > b.id) {\n    return 1;\n  }\n  return 0;\n}\n\n/**\n * NIP-01 newest-first order: `created_at` descending, then `id` in plain code-unit order (ids are\n * canonical lowercase hex, so `<` is lexical order).\n */\nexport function compareEventsDesc(\n  a: { id: string; created_at: number },\n  b: { id: string; created_at: number },\n): number {\n  if (a.created_at !== b.created_at) {\n    return b.created_at - a.created_at;\n  }\n  return compareIds(a, b);\n}\n\n/**\n * Sort events reverse-chronologically by `created_at`, then by `id` lexicographically. Mutates and\n * returns the array.\n */\nexport function sortEvents(events: Event[]): Event[] {\n  return events.sort(compareEventsDesc);\n}\n\n/** Non-mutating sort; returns a new array. */\nexport function sortedEvents(events: ReadonlyArray<Event>): Event[] {\n  return [...events].sort(compareEventsDesc);\n}\n\n/**\n * Negentropy item order: `created_at` ascending, then `id` lexicographic (`<`/`>`). Time axis is\n * opposite {@link sortEvents}; id tie-break is the same direction.\n */\nexport function itemCompare(\n  a: { id: string; created_at: number },\n  b: { id: string; created_at: number },\n): number {\n  if (a.created_at !== b.created_at) {\n    return a.created_at - b.created_at;\n  }\n  return compareIds(a, b);\n}\n\n/**\n * NIP-01 replaceable/addressable winner: higher `created_at`, or equal timestamp and\n * lexicographically lower `id`.\n */\nexport function isReplaceableWinner(\n  candidate: { created_at: number; id: string },\n  incumbent: { created_at: number; id: string },\n): boolean {\n  if (candidate.created_at !== incumbent.created_at) {\n    return candidate.created_at > incumbent.created_at;\n  }\n  return candidate.id < incumbent.id;\n}\n\n/** True when a signed event is the signed form of `unsigned` (kind/tags/content/time/pubkey). */\nexport function signedMatchesUnsigned(signed: Event, unsigned: UnsignedEvent): boolean {\n  if (signed.kind !== unsigned.kind) {\n    return false;\n  }\n  if (signed.content !== unsigned.content) {\n    return false;\n  }\n  if (signed.created_at !== unsigned.created_at) {\n    return false;\n  }\n  if (JSON.stringify(signed.tags) !== JSON.stringify(unsigned.tags)) {\n    return false;\n  }\n  if (unsigned.pubkey && signed.pubkey !== unsigned.pubkey) {\n    return false;\n  }\n  return true;\n}\n"],"mappings":";;;;;AAUA,SAAgB,MAAM,OAA8B;CAClD,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAC5C,OAAO;CAET,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,SAAS,UAClB,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,QAAQ,KAAkB;CACxC,OAAO,IAAI,MAAM;AACnB;;AAGA,SAAgB,SAAS,KAA8B;CACrD,OAAO,IAAI;AACb;;;;;AAMA,SAAS,cAAc,GAAa,WAA4C;CAC9E,IAAI,MAAM,UAAU;CACpB,OAAO,MAAM,KAAK,UAAU,MAAM,OAAO,KAAA,GACvC,OAAO;CAET,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,GAC5B,EAAE,KAAK,UAAU,MAAM,EAAE;AAE7B;;AAGA,MAAa,MAAM;CACjB,EAAE,IAAY,OAAgB,QAAiB,QAAsB;EACnE,MAAM,IAAc,CAAC,KAAK,WAAW,EAAE,CAAC;EACxC,cAAc,GAAG;GAAC;GAAO;GAAQ,QAAQ,YAAY;EAAC,CAAC;EACvD,OAAO;CACT;CACA,EAAE,QAAgB,OAAgB,SAAuB;EACvD,MAAM,IAAc,CAAC,KAAK,OAAO,YAAY,CAAC;EAC9C,cAAc,GAAG,CAAC,OAAO,OAAO,CAAC;EACjC,OAAO;CACT;CACA,EAAE,YAAoB,OAAqB;EACzC,MAAM,IAAc,CAAC,KAAK,UAAU;EACpC,IAAI,UAAU,KAAA,GACZ,EAAE,KAAK,KAAK;EAEd,OAAO;CACT;CACA,EAAE,YAAyB;EACzB,OAAO,CAAC,KAAK,UAAU;CACzB;CACA,EAAE,SAAsB;EACtB,OAAO,CAAC,KAAK,OAAO;CACtB;CACA,EAAE,KAAa,QAAsB;EACnC,MAAM,IAAc,CAAC,KAAK,GAAG;EAC7B,IAAI,WAAW,KAAA,GACb,EAAE,KAAK,MAAM;EAEf,OAAO;CACT;CACA,EAAE,MAA4B;EAC5B,OAAO,CAAC,KAAK,OAAO,IAAI,CAAC;CAC3B;AACF;;AAGA,SAAgB,cAAc,MAA0B,MAAkC;CACxF,KAAK,MAAM,OAAO,MAChB,IAAI,IAAI,OAAO,QAAQ,IAAI,OAAO,KAAA,GAChC,OAAO,IAAI;AAIjB;;AAGA,SAAgB,QAAQ,MAA8C;CACpE,OAAO,cAAc,MAAM,GAAG;AAChC;;AAUA,SAAgB,kBAAkB,OAAyC;CACzE,MAAM,QAAQ,MAAM,QAAQ,GAAG;CAC/B,IAAI,SAAS,GACX;CAEF,MAAM,SAAS,MAAM,QAAQ,KAAK,QAAQ,CAAC;CAC3C,IAAI,WAAW,IACb;CAEF,MAAM,WAAW,MAAM,MAAM,GAAG,KAAK;CAErC,IAAI,CAAC,YAAY,KAAK,QAAQ,GAC5B;CAEF,MAAM,OAAO,OAAO,QAAQ;CAC5B,IAAI,OAAO,OACT;CAEF,MAAM,SAAS,MAAM,MAAM,QAAQ,GAAG,MAAM;CAC5C,IAAI,CAAC,QAAQ,MAAM,GACjB;CAEF,OAAO;EAAE;EAAM;EAAQ,YAAY,MAAM,MAAM,SAAS,CAAC;CAAE;AAC7D;;;;;;AAOA,SAAgB,uBAAuB,OAAyC;CAC9E,MAAM,QAAQ,MAAM,QAAQ,GAAG;CAC/B,MAAM,SAAS,UAAU,KAAK,KAAK,MAAM,QAAQ,KAAK,QAAQ,CAAC;CAC/D,IAAI,SAAS,GACX;CAEF,OAAO,kBACL,GAAG,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,YAAY,IAAI,MAAM,MAAM,MAAM,GAClG;AACF;;AAGA,SAAgB,mBAAmB,MAAc,QAAgB,aAAa,IAAY;CACxF,OAAO,GAAG,KAAK,GAAG,OAAO,YAAY,EAAE,GAAG;AAC5C;;;;;AAMA,SAAgB,aAAa,OAIN;CACrB,IAAI,kBAAkB,MAAM,IAAI,GAC9B,OAAO,mBAAmB,MAAM,MAAM,MAAM,QAAQ,QAAQ,MAAM,IAAI,KAAK,EAAE;CAE/E,IAAI,kBAAkB,MAAM,IAAI,GAC9B,OAAO,mBAAmB,MAAM,MAAM,MAAM,QAAQ,EAAE;AAG1D;;;;AC1IA,MAAM,iCAAiB,IAAI,QAAe;;AAG1C,MAAM,+BAAe,IAAI,QAAe;;AAGxC,MAAM,kCAAkB,IAAI,QAAiC;AAE7D,SAAgB,aAAa,OAAoB;CAC/C,eAAe,IAAI,KAAK;CACxB,aAAa,OAAO,KAAK;AAC3B;AAEA,SAAgB,eAAe,OAAoB;CACjD,aAAa,IAAI,KAAK;CACtB,eAAe,OAAO,KAAK;AAC7B;AAEA,SAAgB,iBAAiB,OAAuB;CACtD,OAAO,eAAe,IAAI,KAAK;AACjC;AAEA,SAAgB,eAAe,OAAuB;CACpD,OAAO,aAAa,IAAI,KAAK;AAC/B;;AAGA,SAAgB,cAAc,OAAwC;CACpE,IAAI,CAAC,SAAS,KAAK,GACjB,OAAO;CAET,IACE,OAAO,MAAM,YAAY,YACzB,CAAC,OAAO,cAAc,MAAM,OAAO,KACnC,MAAM,UAAU,KAChB,MAAM,UAAU,OAEhB,OAAO;CAIT,IAAI,OAAO,MAAM,eAAe,YAAY,iBAAiB,MAAM,UAAU,GAC3E,OAAO;CAET,IACE,OAAO,MAAM,kBAAkB,YAC/B,CAAC,OAAO,cAAc,MAAM,aAAa,KACzC,MAAM,gBAAgB,GAEtB,OAAO;CAET,IAAI,OAAO,MAAM,cAAc,YAAY,CAAC,QAAQ,MAAM,SAAS,GACjE,OAAO;CAET,IAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,GAC9B,OAAO;CAET,KAAK,MAAM,OAAO,MAAM,SAAS;EAC/B,IAAI,CAAC,MAAM,GAAG,GACZ,OAAO;EAET,KAAK,MAAM,QAAQ,KACjB,IAAI,iBAAiB,IAAI,GACvB,OAAO;CAGb;CACA,OAAO;AACT;;AAGA,SAAgB,oBAAoB,OAAgC;CAClE,IAAI,SAAS,KAAK,KAAK,gBAAgB,IAAI,KAAK,GAC9C,OAAO;CAET,IAAI,CAAC,cAAc,KAAK,GACtB,OAAO;CAET,MAAM,IAAI;CACV,IAAI,OAAO,EAAE,UAAU,YAAY,CAAC,QAAQ,EAAE,KAAK,GACjD,OAAO;CAET,IAAI,OAAO,EAAE,WAAW,YAAY,CAAC,QAAQ,EAAE,MAAM,GACnD,OAAO;CAET,gBAAgB,IAAI,CAAC;CACrB,OAAO;AACT;;;;;AAMA,SAAgB,eAAe,OAA8B;CAC3D,IAAI,CAAC,cAAc,KAAK,GACtB,MAAM,IAAI,qBAAqB,2CAA2C;CAE5E,OAAO,wBAAwB,KAAK;AACtC;;;;;;AAOA,SAAgB,wBAAwB,OAA8B;CACpE,OAAO,KAAK,UAAU;EAAC;EAAG,MAAM;EAAQ,MAAM;EAAY,MAAM;EAAM,MAAM;EAAM,MAAM;CAAO,CAAC;AAClG;;AAGA,SAAgB,aAAa,OAA8B;CACzD,MAAM,aAAa,eAAe,KAAK;CACvC,OAAO,WAAW,OAAO,YAAY,OAAO,UAAU,CAAC,CAAC;AAC1D;;AAGA,SAAS,WAAW,GAAmB,GAA2B;CAChE,IAAI,EAAE,KAAK,EAAE,IACX,OAAO;CAET,IAAI,EAAE,KAAK,EAAE,IACX,OAAO;CAET,OAAO;AACT;;;;;AAMA,SAAgB,kBACd,GACA,GACQ;CACR,IAAI,EAAE,eAAe,EAAE,YACrB,OAAO,EAAE,aAAa,EAAE;CAE1B,OAAO,WAAW,GAAG,CAAC;AACxB;;;;;AAMA,SAAgB,WAAW,QAA0B;CACnD,OAAO,OAAO,KAAK,iBAAiB;AACtC;;AAGA,SAAgB,aAAa,QAAuC;CAClE,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,iBAAiB;AAC3C;;;;;AAMA,SAAgB,YACd,GACA,GACQ;CACR,IAAI,EAAE,eAAe,EAAE,YACrB,OAAO,EAAE,aAAa,EAAE;CAE1B,OAAO,WAAW,GAAG,CAAC;AACxB;;;;;AAMA,SAAgB,oBACd,WACA,WACS;CACT,IAAI,UAAU,eAAe,UAAU,YACrC,OAAO,UAAU,aAAa,UAAU;CAE1C,OAAO,UAAU,KAAK,UAAU;AAClC;;AAGA,SAAgB,sBAAsB,QAAe,UAAkC;CACrF,IAAI,OAAO,SAAS,SAAS,MAC3B,OAAO;CAET,IAAI,OAAO,YAAY,SAAS,SAC9B,OAAO;CAET,IAAI,OAAO,eAAe,SAAS,YACjC,OAAO;CAET,IAAI,KAAK,UAAU,OAAO,IAAI,MAAM,KAAK,UAAU,SAAS,IAAI,GAC9D,OAAO;CAET,IAAI,SAAS,UAAU,OAAO,WAAW,SAAS,QAChD,OAAO;CAET,OAAO;AACT"}

package/dist/{filter-3jOh4uLN.mjs → filter-BbShkmc4.mjs}

@@ -1,3 +1,4 @@
+import { c as isHex32, x as FilterError } from "./util-BcRBO6o-.mjs";
 import { o as isReplaceableKind, r as isAddressableKind } from "./kind-I2Tvbe82.mjs";
 //#region src/core/filter.ts
 /** NIP-01 only defines single-letter tag conditions. */
@@ -10,30 +11,32 @@ const compiledFilters = /* @__PURE__ */ new WeakMap();
 * package; not exported from the index.
 */
 function filterTagConditions(filter) {
+	const canonical = canonicalizeFilter(filter);
 	const conditions = [];
-	for (const key of Object.keys(filter)) {
+	for (const key of Object.keys(canonical)) {
 		if (!SINGLE_LETTER_TAG.test(key)) continue;
 		const name = key.slice(1);
-		const values = filter[`#${name}`];
+		const values = canonical[`#${name}`];
 		if (values === void 0) continue;
 		conditions.push({
 			name,
-			values: name === "e" || name === "p" ? values.map((v) => v.toLowerCase()) : values
+			values
 		});
 	}
 	return conditions;
 }
 function compileFilter(filter) {
+	const canonical = canonicalizeFilter(filter);
 	return {
-		ids: filter.ids ? new Set(filter.ids.map((id) => id.toLowerCase())) : void 0,
-		kinds: filter.kinds ? new Set(filter.kinds) : void 0,
-		authors: filter.authors ? new Set(filter.authors.map((pk) => pk.toLowerCase())) : void 0,
-		tags: filterTagConditions(filter).map(({ name, values }) => ({
+		ids: canonical.ids ? new Set(canonical.ids) : void 0,
+		kinds: canonical.kinds ? new Set(canonical.kinds) : void 0,
+		authors: canonical.authors ? new Set(canonical.authors) : void 0,
+		tags: filterTagConditions(canonical).map(({ name, values }) => ({
 			name,
 			values: new Set(values)
 		})),
-		since: filter.since,
-		until: filter.until
+		since: canonical.since,
+		until: canonical.until
 	};
 }
 /** Local NIP-01 match. `search` is ignored; relays interpret NIP-50. */
@@ -64,19 +67,16 @@ function matchFilters(filters, event) {
 * 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;
+	const f = canonicalizeFilter(filter);
 	let limit = Number.POSITIVE_INFINITY;
-	if (filter.ids) limit = Math.min(limit, new Set(filter.ids.map((id) => id.toLowerCase())).size);
-	if (filter.limit !== void 0) limit = Math.min(limit, filter.limit);
-	if (filter.kinds && filter.authors) {
-		const kinds = new Set(filter.kinds);
+	if (f.ids) limit = Math.min(limit, new Set(f.ids).size);
+	if (f.limit !== void 0) limit = Math.min(limit, f.limit);
+	if (f.kinds && f.authors) {
+		const kinds = new Set(f.kinds);
 		if ([...kinds].every((k) => isReplaceableKind(k) || isAddressableKind(k))) {
-			const dTags = filter["#d"];
-			const perAuthor = dTags && dTags.length > 0 ? new Set(dTags).size : 1;
-			const authors = new Set(filter.authors.map((pk) => pk.toLowerCase())).size;
-			limit = Math.min(limit, authors * kinds.size * perAuthor);
+			const dTags = f["#d"];
+			const perAuthor = dTags === void 0 ? 1 : new Set(dTags).size;
+			limit = Math.min(limit, f.authors.length * kinds.size * perAuthor);
 		}
 	}
 	return limit;
@@ -98,9 +98,11 @@ const KNOWN_FILTER_KEYS = /* @__PURE__ */ new Set([
 	"search"
 ]);
 /**
-* Lowercase hex lists, sort and dedupe every array, and keep only the NIP-01 known fields plus
-* single-letter `#` keys — unknown keys and multi-letter `#` keys are dropped. Omits undefined so
-* `[]` stays distinct from missing.
+* The caller-input normalizer shared by `matchFilter`, the stores, `encodeClientMessage`,
+* `canonicalizeFilter` and `filterFingerprint`: known fields kept, hex lists lowercased, every list
+* sorted and deduplicated — then validated. Throws {@link FilterError} when any list is empty or
+* when an `ids`/`authors`/`#e`/`#p` value is not 64-hex (the caller-input hex profile: any case in,
+* lowercase out).
 */
 function canonicalizeFilter(filter) {
 	const raw = filter;
@@ -112,8 +114,12 @@ function canonicalizeFilter(filter) {
 		const value = raw[key];
 		if (value === void 0) continue;
 		if (Array.isArray(value)) {
-			if (HEX_LIST_KEYS.has(key)) out[key] = [...new Set(value.map((v) => String(v).toLowerCase()))].sort();
-			else if (key === "kinds") out[key] = [...new Set(value.map(Number))].sort((a, b) => a - b);
+			if (value.length === 0) throw new FilterError(`filter ${key} must not be empty`);
+			if (HEX_LIST_KEYS.has(key)) {
+				const list = [...new Set(value.map((v) => String(v).toLowerCase()))].sort();
+				if (!list.every((v) => isHex32(v))) throw new FilterError(`filter ${key} values must be 64-char hex`);
+				out[key] = list;
+			} else if (key === "kinds") out[key] = [...new Set(value.map(Number))].sort((a, b) => a - b);
 			else out[key] = [...new Set(value.map(String))].sort();
 		} else out[key] = value;
 	}
@@ -124,8 +130,8 @@ 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. Filters carry no empty list fields —
+* `canonicalizeFilter` rejects them.
 */
 function filterFingerprint(filters) {
 	const parts = filters.map((filter) => JSON.stringify(canonicalizeFilter(filter)));
@@ -135,4 +141,4 @@ function filterFingerprint(filters) {
 //#endregion
 export { getFilterLimit as a, filterTagConditions as i, canonicalizeFilters as n, matchFilter as o, filterFingerprint as r, matchFilters as s, canonicalizeFilter as t };
 
-//# sourceMappingURL=filter-3jOh4uLN.mjs.map
+//# sourceMappingURL=filter-BbShkmc4.mjs.map

package/dist/filter-BbShkmc4.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-BbShkmc4.mjs","names":[],"sources":["../src/core/filter.ts"],"sourcesContent":["import { FilterError } from \"./error.ts\";\nimport type { Event } from \"./event.ts\";\nimport { isAddressableKind, isReplaceableKind } from \"./kind.ts\";\nimport { isHex32 } from \"./util.ts\";\n\n/**\n * NIP-01 filter object (immutable-friendly; callers may still pass plain objects). Filters are\n * treated as immutable once used: `matchFilter` and the event stores cache a compiled form keyed on\n * the object, so mutating a filter after it has been matched yields stale results.\n */\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/** NIP-01 only defines single-letter tag conditions. */\nconst SINGLE_LETTER_TAG = /^#[a-zA-Z]$/;\n\ntype CompiledTagCondition = {\n  readonly name: string;\n  readonly values: ReadonlySet<string>;\n};\n\n/** `matchFilter` condition form: `Set` lookups instead of per-element scans and `toLowerCase`. */\ntype CompiledFilter = {\n  readonly ids: ReadonlySet<string> | undefined;\n  readonly kinds: ReadonlySet<number> | undefined;\n  readonly authors: ReadonlySet<string> | undefined;\n  readonly tags: ReadonlyArray<CompiledTagCondition>;\n  readonly since: number | undefined;\n  readonly until: number | undefined;\n};\n\nconst compiledFilters = new WeakMap<Filter, CompiledFilter>();\n\n/**\n * Single-letter `#x` conditions shared by `matchFilter` and the event stores: `#e`/`#p` values are\n * lowercased (they hold hex ids, same as `encodeClientMessage`), other tag values stay verbatim —\n * relays match tag values literally. Multi-letter `#` keys are outside NIP-01. Internal to the\n * package; not exported from the index.\n */\nexport function filterTagConditions(\n  filter: Filter,\n): Array<{ name: string; values: ReadonlyArray<string> }> {\n  const canonical = canonicalizeFilter(filter);\n  const conditions: Array<{ name: string; values: ReadonlyArray<string> }> = [];\n  for (const key of Object.keys(canonical)) {\n    if (!SINGLE_LETTER_TAG.test(key)) {\n      continue;\n    }\n    const name = key.slice(1);\n    const values = canonical[`#${name}`];\n    if (values === undefined) {\n      continue;\n    }\n    conditions.push({ name, values });\n  }\n  return conditions;\n}\n\nfunction compileFilter(filter: Filter): CompiledFilter {\n  const canonical = canonicalizeFilter(filter);\n  return {\n    ids: canonical.ids ? new Set(canonical.ids) : undefined,\n    kinds: canonical.kinds ? new Set(canonical.kinds) : undefined,\n    authors: canonical.authors ? new Set(canonical.authors) : undefined,\n    tags: filterTagConditions(canonical).map(({ name, values }) => ({\n      name,\n      values: new Set(values),\n    })),\n    since: canonical.since,\n    until: canonical.until,\n  };\n}\n\n/** Local NIP-01 match. `search` is ignored; relays interpret NIP-50. */\nexport function matchFilter(filter: Filter, event: Event): boolean {\n  let compiled = compiledFilters.get(filter);\n  if (compiled === undefined) {\n    compiled = compileFilter(filter);\n    compiledFilters.set(filter, compiled);\n  }\n  if (compiled.ids !== undefined && !compiled.ids.has(event.id)) {\n    return false;\n  }\n  if (compiled.kinds !== undefined && !compiled.kinds.has(event.kind)) {\n    return false;\n  }\n  if (compiled.authors !== undefined && !compiled.authors.has(event.pubkey)) {\n    return false;\n  }\n\n  for (const { name, values } of compiled.tags) {\n    const hit = event.tags.some((tag) => {\n      const [tagKey, tagValue] = tag;\n      return tagKey === name && tagValue !== undefined && values.has(tagValue);\n    });\n    if (!hit) {\n      return false;\n    }\n  }\n\n  if (compiled.since !== undefined && event.created_at < compiled.since) {\n    return false;\n  }\n  if (compiled.until !== undefined && event.created_at > compiled.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/**\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  const f = canonicalizeFilter(filter);\n  let limit = Number.POSITIVE_INFINITY;\n  if (f.ids) {\n    limit = Math.min(limit, new Set(f.ids).size);\n  }\n  if (f.limit !== undefined) {\n    limit = Math.min(limit, f.limit);\n  }\n\n  if (f.kinds && f.authors) {\n    const kinds = new Set(f.kinds);\n    const allReplaceable = [...kinds].every((k) => isReplaceableKind(k) || isAddressableKind(k));\n    if (allReplaceable) {\n      const dTags = f[\"#d\"];\n      const perAuthor = dTags === undefined ? 1 : new Set(dTags).size;\n      limit = Math.min(limit, f.authors.length * kinds.size * perAuthor);\n    }\n  }\n\n  return limit;\n}\n\nconst HEX_LIST_KEYS = new Set([\"ids\", \"authors\", \"#e\", \"#p\"]);\n\n/** NIP-01 known fields; everything else (incl. multi-letter `#` keys) is dropped. */\nconst KNOWN_FILTER_KEYS = new Set([\"ids\", \"authors\", \"kinds\", \"since\", \"until\", \"limit\", \"search\"]);\n\n/**\n * The caller-input normalizer shared by `matchFilter`, the stores, `encodeClientMessage`,\n * `canonicalizeFilter` and `filterFingerprint`: known fields kept, hex lists lowercased, every list\n * sorted and deduplicated — then validated. Throws {@link FilterError} when any list is empty or\n * when an `ids`/`authors`/`#e`/`#p` value is not 64-hex (the caller-input hex profile: any case in,\n * lowercase out).\n */\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    if (key.startsWith(\"#\")) {\n      if (!SINGLE_LETTER_TAG.test(key)) {\n        continue;\n      }\n    } else if (!KNOWN_FILTER_KEYS.has(key)) {\n      continue;\n    }\n    const value = raw[key];\n    if (value === undefined) {\n      continue;\n    }\n    if (Array.isArray(value)) {\n      if (value.length === 0) {\n        throw new FilterError(`filter ${key} must not be empty`);\n      }\n      if (HEX_LIST_KEYS.has(key)) {\n        const list = [...new Set(value.map((v) => String(v).toLowerCase()))].sort();\n        if (!list.every((v) => isHex32(v))) {\n          throw new FilterError(`filter ${key} values must be 64-char hex`);\n        }\n        out[key] = list;\n      } else if (key === \"kinds\") {\n        out[key] = [...new Set(value.map(Number))].sort((a, b) => a - b);\n      } else {\n        out[key] = [...new Set(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. Filters carry no empty list fields —\n * `canonicalizeFilter` rejects them.\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":";;;;AAuBA,MAAM,oBAAoB;AAiB1B,MAAM,kCAAkB,IAAI,QAAgC;;;;;;;AAQ5D,SAAgB,oBACd,QACwD;CACxD,MAAM,YAAY,mBAAmB,MAAM;CAC3C,MAAM,aAAqE,CAAC;CAC5E,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;EACxC,IAAI,CAAC,kBAAkB,KAAK,GAAG,GAC7B;EAEF,MAAM,OAAO,IAAI,MAAM,CAAC;EACxB,MAAM,SAAS,UAAU,IAAI;EAC7B,IAAI,WAAW,KAAA,GACb;EAEF,WAAW,KAAK;GAAE;GAAM;EAAO,CAAC;CAClC;CACA,OAAO;AACT;AAEA,SAAS,cAAc,QAAgC;CACrD,MAAM,YAAY,mBAAmB,MAAM;CAC3C,OAAO;EACL,KAAK,UAAU,MAAM,IAAI,IAAI,UAAU,GAAG,IAAI,KAAA;EAC9C,OAAO,UAAU,QAAQ,IAAI,IAAI,UAAU,KAAK,IAAI,KAAA;EACpD,SAAS,UAAU,UAAU,IAAI,IAAI,UAAU,OAAO,IAAI,KAAA;EAC1D,MAAM,oBAAoB,SAAS,CAAC,CAAC,KAAK,EAAE,MAAM,cAAc;GAC9D;GACA,QAAQ,IAAI,IAAI,MAAM;EACxB,EAAE;EACF,OAAO,UAAU;EACjB,OAAO,UAAU;CACnB;AACF;;AAGA,SAAgB,YAAY,QAAgB,OAAuB;CACjE,IAAI,WAAW,gBAAgB,IAAI,MAAM;CACzC,IAAI,aAAa,KAAA,GAAW;EAC1B,WAAW,cAAc,MAAM;EAC/B,gBAAgB,IAAI,QAAQ,QAAQ;CACtC;CACA,IAAI,SAAS,QAAQ,KAAA,KAAa,CAAC,SAAS,IAAI,IAAI,MAAM,EAAE,GAC1D,OAAO;CAET,IAAI,SAAS,UAAU,KAAA,KAAa,CAAC,SAAS,MAAM,IAAI,MAAM,IAAI,GAChE,OAAO;CAET,IAAI,SAAS,YAAY,KAAA,KAAa,CAAC,SAAS,QAAQ,IAAI,MAAM,MAAM,GACtE,OAAO;CAGT,KAAK,MAAM,EAAE,MAAM,YAAY,SAAS,MAKtC,IAAI,CAJQ,MAAM,KAAK,MAAM,QAAQ;EACnC,MAAM,CAAC,QAAQ,YAAY;EAC3B,OAAO,WAAW,QAAQ,aAAa,KAAA,KAAa,OAAO,IAAI,QAAQ;CACzE,CACO,GACL,OAAO;CAIX,IAAI,SAAS,UAAU,KAAA,KAAa,MAAM,aAAa,SAAS,OAC9D,OAAO;CAET,IAAI,SAAS,UAAU,KAAA,KAAa,MAAM,aAAa,SAAS,OAC9D,OAAO;CAGT,OAAO;AACT;;AAGA,SAAgB,aAAa,SAAgC,OAAuB;CAClF,KAAK,MAAM,UAAU,SACnB,IAAI,YAAY,QAAQ,KAAK,GAC3B,OAAO;CAGX,OAAO;AACT;;;;;AAMA,SAAgB,eAAe,QAAwB;CACrD,MAAM,IAAI,mBAAmB,MAAM;CACnC,IAAI,QAAQ,OAAO;CACnB,IAAI,EAAE,KACJ,QAAQ,KAAK,IAAI,OAAO,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI;CAE7C,IAAI,EAAE,UAAU,KAAA,GACd,QAAQ,KAAK,IAAI,OAAO,EAAE,KAAK;CAGjC,IAAI,EAAE,SAAS,EAAE,SAAS;EACxB,MAAM,QAAQ,IAAI,IAAI,EAAE,KAAK;EAE7B,IADuB,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,MAAM,kBAAkB,CAAC,KAAK,kBAAkB,CAAC,CACzE,GAAG;GAClB,MAAM,QAAQ,EAAE;GAChB,MAAM,YAAY,UAAU,KAAA,IAAY,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC;GAC3D,QAAQ,KAAK,IAAI,OAAO,EAAE,QAAQ,SAAS,MAAM,OAAO,SAAS;EACnE;CACF;CAEA,OAAO;AACT;AAEA,MAAM,gCAAgB,IAAI,IAAI;CAAC;CAAO;CAAW;CAAM;AAAI,CAAC;;AAG5D,MAAM,oCAAoB,IAAI,IAAI;CAAC;CAAO;CAAW;CAAS;CAAS;CAAS;CAAS;AAAQ,CAAC;;;;;;;;AASlG,SAAgB,mBAAmB,QAAwB;CACzD,MAAM,MAAM;CACZ,MAAM,MAA+B,CAAC;CACtC,KAAK,MAAM,OAAO,OAAO,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG;EACzC,IAAI,IAAI,WAAW,GAAG,GAChB;OAAA,CAAC,kBAAkB,KAAK,GAAG,GAC7B;EAAA,OAEG,IAAI,CAAC,kBAAkB,IAAI,GAAG,GACnC;EAEF,MAAM,QAAQ,IAAI;EAClB,IAAI,UAAU,KAAA,GACZ;EAEF,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,YAAY,UAAU,IAAI,mBAAmB;GAEzD,IAAI,cAAc,IAAI,GAAG,GAAG;IAC1B,MAAM,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;IAC1E,IAAI,CAAC,KAAK,OAAO,MAAM,QAAQ,CAAC,CAAC,GAC/B,MAAM,IAAI,YAAY,UAAU,IAAI,4BAA4B;IAElE,IAAI,OAAO;GACb,OAAO,IAAI,QAAQ,SACjB,IAAI,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;QAE/D,IAAI,OAAO,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK;EAEpD,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-oYG2zjJ3.d.mts → filter-w1R-mU63.d.mts}

@@ -26,18 +26,20 @@ declare function matchFilters(filters: ReadonlyArray<Filter>, event: Event): boo
  */
 declare function getFilterLimit(filter: Filter): number;
 /**
- * Lowercase hex lists, sort and dedupe every array, and keep only the NIP-01 known fields plus
- * single-letter `#` keys — unknown keys and multi-letter `#` keys are dropped. Omits undefined so
- * `[]` stays distinct from missing.
+ * The caller-input normalizer shared by `matchFilter`, the stores, `encodeClientMessage`,
+ * `canonicalizeFilter` and `filterFingerprint`: known fields kept, hex lists lowercased, every list
+ * sorted and deduplicated — then validated. Throws {@link FilterError} when any list is empty or
+ * when an `ids`/`authors`/`#e`/`#p` value is not 64-hex (the caller-input hex profile: any case in,
+ * lowercase out).
  */
 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.
+ * Canonical identity for live REQ coalescing. Filters carry no empty list fields —
+ * `canonicalizeFilter` rejects them.
  */
 declare function filterFingerprint(filters: ReadonlyArray<Filter>): string;
 //#endregion
 export { getFilterLimit as a, filterFingerprint as i, canonicalizeFilter as n, matchFilter as o, canonicalizeFilters as r, matchFilters as s, Filter as t };
-//# sourceMappingURL=filter-oYG2zjJ3.d.mts.map
+//# sourceMappingURL=filter-w1R-mU63.d.mts.map

package/dist/{gossip-BvCItMVZ.d.mts → gossip-C-7WhJ7v.d.mts}

@@ -1,6 +1,6 @@
 import { t as Event } from "./event-j3BwI5dF.mjs";
-import { t as Filter } from "./filter-oYG2zjJ3.mjs";
-import { t as RelayListItem } from "./nip65-CPNE0SV0.mjs";
+import { t as Filter } from "./filter-w1R-mU63.mjs";
+import { t as RelayListItem } from "./nip65-XrBjV9WM.mjs";
 //#region src/gossip/gossip.d.ts
 /** Relay routing state for one pubkey: NIP-65 outbox/inbox plus NIP-17 DM relays. */
 type PubkeyRoutes = {
@@ -82,4 +82,4 @@ declare class Gossip {
 }
 //#endregion
 export { RoutedFilter as i, GossipOptions as n, PubkeyRoutes as r, Gossip as t };
-//# sourceMappingURL=gossip-BvCItMVZ.d.mts.map
+//# sourceMappingURL=gossip-C-7WhJ7v.d.mts.map

package/dist/{gossip-CRyhK6E6.mjs → gossip-CejMm_QM.mjs}

@@ -1,6 +1,7 @@
-import { d as normalizeRelayUrls, f as normalizeURL, p as nowSeconds } from "./util-DfsyJ9nz.mjs";
+import { f as normalizeRelayUrls, m as nowSeconds, p as normalizeURL } from "./util-BcRBO6o-.mjs";
 import { t as Kind } from "./kind-I2Tvbe82.mjs";
-import { a as isReplaceableWinner } from "./event-DvM1f03b.mjs";
+import { a as isReplaceableWinner } from "./event-DHtcm0jM.mjs";
+import { t as canonicalizeFilter } from "./filter-BbShkmc4.mjs";
 import { parseRelayList } from "./nips/nip65.mjs";
 import { i as trimOldest, r as touchKey } from "./collections-DtwMc1NU.mjs";
 import { parseDmRelayList } from "./nips/nip17.mjs";
@@ -141,16 +142,17 @@ var Gossip = class {
 	* - 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 {
+		const f = canonicalizeFilter(filter);
+		const { authors } = f;
+		const pTags = f["#p"];
+		if (authors === void 0 && pTags === void 0) return {
 			perRelay: /* @__PURE__ */ new Map(),
-			remainder: filter
+			remainder: f
 		};
-		if (authors && authors.length > 0 && (!pTags || pTags.length === 0)) return this.#breakAuthors(filter, authors, "write");
-		if (pTags && pTags.length > 0 && (!authors || authors.length === 0)) {
-			const { authors: _authors, ...base } = filter;
-			return this.#breakAuthors(base, pTags, "read", (b, pubkeys) => ({
+		if (authors !== void 0 && pTags === void 0) return this.#breakAuthors(f, [...authors], "write");
+		if (pTags !== void 0 && authors === void 0) {
+			const { authors: _authors, ...base } = f;
+			return this.#breakAuthors(base, [...pTags], "read", (b, pubkeys) => ({
 				...b,
 				"#p": pubkeys
 			}));
@@ -225,4 +227,4 @@ var Gossip = class {
 //#endregion
 export { Gossip as t };
 
-//# sourceMappingURL=gossip-CRyhK6E6.mjs.map
+//# sourceMappingURL=gossip-CejMm_QM.mjs.map

package/dist/gossip-CejMm_QM.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"gossip-CejMm_QM.mjs","names":[],"sources":["../src/gossip/gossip.ts"],"sourcesContent":["import { touchKey, trimOldest } from \"../core/collections.ts\";\nimport type { Event } from \"../core/event.ts\";\nimport { isReplaceableWinner } from \"../core/event.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { canonicalizeFilter } from \"../core/filter.ts\";\nimport { Kind } from \"../core/kind.ts\";\nimport { normalizeRelayUrls, normalizeURL, nowSeconds } 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  readonly write: ReadonlyArray<string>;\n  /** Relays the user reads from (inbox). NIP-65. */\n  readonly read: ReadonlyArray<string>;\n  /** Relays for NIP-17 gift-wrap delivery. Kind 10050. */\n  readonly dm: ReadonlyArray<string>;\n  /** `created_at` of the last accepted kind:10002 list. */\n  readonly updatedAt: number;\n  /** `created_at` of the last accepted kind:10050 list. */\n  readonly dmUpdatedAt: number;\n  /** Event id of the last accepted kind:10002 (NIP-01 equal-timestamp tie-break). */\n  readonly relayListId?: string | undefined;\n  /** Event id of the last accepted kind:10050. */\n  readonly 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  readonly perRelay: ReadonlyMap<string, Filter>;\n  /**\n   * Unrouted work for the caller:\n   *\n   * - No authors and no #p: original filter (\"generic\")\n   * - Authors/#p all unrouted: original filter (\"orphan\")\n   * - Mixed: narrowed leftover (\"fallback\")\n   * - All routed: undefined\n   */\n  readonly remainder?: Filter | undefined;\n};\n\nexport type GossipOptions = {\n  /**\n   * Max relays kept per direction; the first N in list order win (NIP-65 defines no ranking).\n   * Default 4.\n   */\n  maxRelaysPerPubkey?: number | undefined;\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 | undefined;\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.\n   *\n   * - Kind:10002 → write/read (NIP-65)\n   * - Kind:10050 → dm (NIP-17)\n   *\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: ReadonlyArray<RelayListItem>,\n    updatedAt: number = nowSeconds(),\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.marker !== \"read\" && !write.includes(url)) {\n        write.push(url);\n      }\n      if (item.marker !== \"write\" && !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 = nowSeconds(),\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 = normalizeRelayUrls(relays);\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): Readonly<PubkeyRoutes> | undefined {\n    return this.#lookup(pubkey.toLowerCase());\n  }\n\n  outboxRelays(pubkey: string): ReadonlyArray<string> {\n    return this.#lookup(pubkey.toLowerCase())?.write ?? [];\n  }\n\n  inboxRelays(pubkey: string): ReadonlyArray<string> {\n    return this.#lookup(pubkey.toLowerCase())?.read ?? [];\n  }\n\n  /** NIP-17 kind:10050 delivery relays for gift-wraps. */\n  dmRelays(pubkey: string): ReadonlyArray<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.\n   *\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 f = canonicalizeFilter(filter);\n    const { authors } = f;\n    const pTags = f[\"#p\"];\n\n    if (authors === undefined && pTags === undefined) {\n      return { perRelay: new Map(), remainder: f };\n    }\n\n    if (authors !== undefined && pTags === undefined) {\n      return this.#breakAuthors(f, [...authors], \"write\");\n    }\n\n    if (pTags !== undefined && authors === undefined) {\n      const { authors: _authors, ...base } = f;\n      return this.#breakAuthors(base, [...pTags], \"read\", (b, pubkeys) => ({\n        ...b,\n        \"#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.#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      touchKey(this.#routes, 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    touchKey(this.#routes, pk, routes);\n    trimOldest(this.#routes, this.#maxPubkeys);\n  }\n}\n"],"mappings":";;;;;;;;AAyDA,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;;;;;;;;;CAUA,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,WAAW,GAC/B,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,WAAW,UAAU,CAAC,MAAM,SAAS,GAAG,GAC/C,MAAM,KAAK,GAAG;GAEhB,IAAI,KAAK,WAAW,WAAW,CAAC,KAAK,SAAS,GAAG,GAC/C,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,WAAW,GAC/B,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,KAAK,mBAAmB,MAAM;EAEpC,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,QAAoD;EAC5D,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC;CAC1C;CAEA,aAAa,QAAuC;EAClD,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC;CACvD;CAEA,YAAY,QAAuC;EACjD,OAAO,KAAK,QAAQ,OAAO,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC;CACtD;;CAGA,SAAS,QAAuC;EAC9C,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;;;;;;;;;CAUA,MAAM,QAA8B;EAClC,MAAM,IAAI,mBAAmB,MAAM;EACnC,MAAM,EAAE,YAAY;EACpB,MAAM,QAAQ,EAAE;EAEhB,IAAI,YAAY,KAAA,KAAa,UAAU,KAAA,GACrC,OAAO;GAAE,0BAAU,IAAI,IAAI;GAAG,WAAW;EAAE;EAG7C,IAAI,YAAY,KAAA,KAAa,UAAU,KAAA,GACrC,OAAO,KAAK,cAAc,GAAG,CAAC,GAAG,OAAO,GAAG,OAAO;EAGpD,IAAI,UAAU,KAAA,KAAa,YAAY,KAAA,GAAW;GAChD,MAAM,EAAE,SAAS,UAAU,GAAG,SAAS;GACvC,OAAO,KAAK,cAAc,MAAM,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,aAAa;IACnE,GAAG;IACH,MAAM;GACR,EAAE;EACJ;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,GACb,SAAS,KAAK,SAAS,IAAI,MAAM;EAEnC,OAAO;CACT;;CAGA,KAAK,IAAY,QAA4B;EAC3C,SAAS,KAAK,SAAS,IAAI,MAAM;EACjC,WAAW,KAAK,SAAS,KAAK,WAAW;CAC3C;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-BvCItMVZ.mjs";
+import { i as RoutedFilter, n as GossipOptions, r as PubkeyRoutes, t as Gossip } from "./gossip-C-7WhJ7v.mjs";
 import "./index-CaxrMD1A.mjs";
 export { Gossip, type GossipOptions, type PubkeyRoutes, type RoutedFilter };

package/dist/gossip.mjs

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

package/dist/{index-B2JlP2Jf.d.mts → index-11znTLM0.d.mts}

@@ -1,7 +1,7 @@
 import { t as Event } from "./event-j3BwI5dF.mjs";
-import { t as Filter } from "./filter-oYG2zjJ3.mjs";
-import { a as NostrError } from "./error-BPqAU5RB.mjs";
-import { _ as Closer, n as Pool } from "./pool-MehgIIzm.mjs";
+import { t as Filter } from "./filter-w1R-mU63.mjs";
+import { o as NostrError } from "./error-DE1UCZ2J.mjs";
+import { _ as Closer, n as Pool } from "./pool-BMfTQZjM.mjs";
 //#region src/relay/error.d.ts
 /** Base class for relay errors; carries the relay URL when known. */
 declare class RelayError extends NostrError {
@@ -79,4 +79,4 @@ declare function fetchRouted(pool: Pool, jobs: ReadonlyArray<RoutedJob>, opts?:
 }): Promise<Event[]>;
 //#endregion
 export { isInsecureRelayUrl as a, RelayError as c, RelayTimeoutError as d, fetchRouted as i, RelayPublishError as l, RoutedJob as n, RelayClosedError as o, fanIn as r, RelayConnectionError as s, FanInOptions as t, RelaySuspendedError as u };
-//# sourceMappingURL=index-B2JlP2Jf.d.mts.map
+//# sourceMappingURL=index-11znTLM0.d.mts.map

package/dist/{index-DzHmhHqD.d.mts → index-B7nMjbyt.d.mts}

@@ -1,6 +1,6 @@
 import { t as Event } from "./event-j3BwI5dF.mjs";
-import { t as Filter } from "./filter-oYG2zjJ3.mjs";
-import { i as PutResult, n as NegentropyItem, r as OutboxBound, t as EventStore } from "./types-DiVVyf1e.mjs";
+import { t as Filter } from "./filter-w1R-mU63.mjs";
+import { i as PutResult, n as NegentropyItem, r as OutboxBound, t as EventStore } from "./types-COupAqtN.mjs";
 //#region src/storage/memory-index.d.ts
 type MemoryIndexOptions = {
   /**
@@ -188,4 +188,4 @@ declare class SqliteEventStore implements EventStore {
 }
 //#endregion
 export { IndexedDbEventStoreOptions as a, MemoryIndexOptions as c, IndexedDbEventStore as i, SqlValue as n, MemoryEventStore as o, SqliteEventStore as r, MemoryIndex as s, SqlDriver as t };
-//# sourceMappingURL=index-DzHmhHqD.d.mts.map
+//# sourceMappingURL=index-B7nMjbyt.d.mts.map

package/dist/{index-muydfuYD.d.mts → index-BuNI8JH_.d.mts}

@@ -1,16 +1,16 @@
 import { n as EventTemplate, r as UnsignedEvent, t as Event } from "./event-j3BwI5dF.mjs";
-import { t as EventBuilder } from "./builder-C72nJITG.mjs";
-import { t as Filter } from "./filter-oYG2zjJ3.mjs";
-import { t as Gossip } from "./gossip-BvCItMVZ.mjs";
-import { a as NostrError } from "./error-BPqAU5RB.mjs";
-import { _ as Closer, a as PoolFetchResult, n as Pool, o as PoolOptions, s as PoolPublishResult } from "./pool-MehgIIzm.mjs";
-import { t as EventStore } from "./types-DiVVyf1e.mjs";
-import { t as ReactiveEventStore } from "./reactive-B7lPFgTS.mjs";
-import { a as OutboxFeed, n as Loaders } from "./index-DCobP2Jj.mjs";
-import { a as Rumor } from "./nip59-DfJ6Moeu.mjs";
-import { i as ReplyTo, r as Recipient } from "./nip17-BZvFQLcs.mjs";
-import { t as NostrSigner } from "./types-BJ4wZ7JJ.mjs";
-import { t as StorageError } from "./error-BjSUsx6M.mjs";
+import { t as EventBuilder } from "./builder-Dk00TdNf.mjs";
+import { t as Filter } from "./filter-w1R-mU63.mjs";
+import { t as Gossip } from "./gossip-C-7WhJ7v.mjs";
+import { o as NostrError } from "./error-DE1UCZ2J.mjs";
+import { _ as Closer, a as PoolFetchResult, n as Pool, o as PoolOptions, s as PoolPublishResult } from "./pool-BMfTQZjM.mjs";
+import { t as EventStore } from "./types-COupAqtN.mjs";
+import { t as ReactiveEventStore } from "./reactive-BkzOsSwU.mjs";
+import { a as OutboxFeed, n as Loaders } from "./index-DDZjqV48.mjs";
+import { a as Rumor } from "./nip59-B6Ey8L9z.mjs";
+import { i as ReplyTo, r as Recipient } from "./nip17--YwFSuph.mjs";
+import { t as NostrSigner } from "./types-DF8yT6EG.mjs";
+import { t as StorageError } from "./error-IHMcLy8-.mjs";
 //#region src/client/types.d.ts
 /** Direction of a {@link Client.sync} run: upload, download, or both. */
 declare const SyncDirection: {
@@ -290,4 +290,4 @@ declare class Client {
 }
 //#endregion
 export { SyncSummary as _, FetchEachOptions as a, PrivateMessageSendResult as c, SendPrivateMessageOptions as d, SubscribeOptions as f, SyncOptions as g, SyncDirectionName as h, ClientOptions as i, PublishOptions as l, SyncDirection as m, ClientError as n, FetchEventsOptions as o, SubscribePrivateMessagesOptions as p, ClientEventMap as r, FetchPrivateMessagesOptions as s, Client as t, ReceivedPrivateMessage as u };
-//# sourceMappingURL=index-muydfuYD.d.mts.map
+//# sourceMappingURL=index-BuNI8JH_.d.mts.map

package/dist/{index-Dpj_MUxb.d.mts → index-C5QomO2D.d.mts}

@@ -17,7 +17,14 @@ declare function bytesToHex(bytes: Uint8Array): string;
 declare function randomBytes(length: number): Uint8Array;
 /** Decode lowercase or mixed-case hex to bytes. */
 declare function hexToBytes(hex: string): Uint8Array;
-/** True when value is canonical NIP-01 lowercase hex of 32 bytes (64 chars). */
+/** `String.prototype.trim()` restricted to ASCII whitespace. */
+declare function trimAscii(value: string): string;
+/**
+ * ASCII-only lowercase — protocol tokens and identifiers fold A-Z→a-z byte-wise, matching Rust
+ * `to_ascii_lowercase`. Unicode case folding is reserved for natural-language text (NIP-51 mute
+ * words).
+ */
+declare function lowerAscii(value: string): string;
 declare function isHex32(value: string): boolean;
 /** True when value is canonical NIP-01 lowercase hex of 64 bytes (128 chars). */
 declare function isHex64(value: string): boolean;
@@ -94,5 +101,5 @@ type KindName = keyof typeof Kind;
 /** Union of the numeric kind values on {@link Kind}. */
 type KnownKind = (typeof Kind)[KindName];
 //#endregion
-export { SUBSCRIPTION_ID_MAX_CHARS as C, SIGNATURE_BYTES as S, normalizeURL as _, classifyKind as a, PUBLIC_KEY_BYTES as b, isRegularKind as c, assertSecretKeyBytes as d, bytesToHex as f, normalizeRelayUrls as g, isHex64 as h, KnownKind as i, isReplaceableKind as l, isHex32 as m, KindClassification as n, isAddressableKind as o, hexToBytes as p, KindName as r, isEphemeralKind as s, Kind as t, assertHex32 as u, randomBytes as v, SECRET_KEY_BYTES as x, EVENT_ID_BYTES as y };
-//# sourceMappingURL=index-Dpj_MUxb.d.mts.map
+export { SECRET_KEY_BYTES as C, PUBLIC_KEY_BYTES as S, SUBSCRIPTION_ID_MAX_CHARS as T, normalizeRelayUrls as _, classifyKind as a, trimAscii as b, isRegularKind as c, assertSecretKeyBytes as d, bytesToHex as f, lowerAscii as g, isHex64 as h, KnownKind as i, isReplaceableKind as l, isHex32 as m, KindClassification as n, isAddressableKind as o, hexToBytes as p, KindName as r, isEphemeralKind as s, Kind as t, assertHex32 as u, normalizeURL as v, SIGNATURE_BYTES as w, EVENT_ID_BYTES as x, randomBytes as y };
+//# sourceMappingURL=index-C5QomO2D.d.mts.map

package/dist/{index-DCobP2Jj.d.mts → index-DDZjqV48.d.mts}

@@ -1,13 +1,13 @@
 import { t as Event } from "./event-j3BwI5dF.mjs";
-import { n as ProfileMetadata } from "./builder-C72nJITG.mjs";
-import { t as RelayListItem } from "./nip65-CPNE0SV0.mjs";
-import { t as Gossip } from "./gossip-BvCItMVZ.mjs";
-import { a as NostrError } from "./error-BPqAU5RB.mjs";
-import { _ as Closer, n as Pool } from "./pool-MehgIIzm.mjs";
-import { r as OutboxBound, t as EventStore } from "./types-DiVVyf1e.mjs";
-import { t as ReactiveEventStore } from "./reactive-B7lPFgTS.mjs";
-import { i as EventPointer, t as AddressPointer } from "./nip19-D4RKn6GC.mjs";
-import { t as MuteItem } from "./nip51-C_kTYcud.mjs";
+import { n as ProfileMetadata } from "./builder-Dk00TdNf.mjs";
+import { t as RelayListItem } from "./nip65-XrBjV9WM.mjs";
+import { t as Gossip } from "./gossip-C-7WhJ7v.mjs";
+import { o as NostrError } from "./error-DE1UCZ2J.mjs";
+import { _ as Closer, n as Pool } from "./pool-BMfTQZjM.mjs";
+import { r as OutboxBound, t as EventStore } from "./types-COupAqtN.mjs";
+import { t as ReactiveEventStore } from "./reactive-BkzOsSwU.mjs";
+import { i as EventPointer, t as AddressPointer } from "./nip19-qtyc5sCl.mjs";
+import { t as MuteItem } from "./nip51-yi9w8FsM.mjs";
 //#region src/loaders/event.d.ts
 type EventRef = string | EventPointer | AddressPointer;
 /**
@@ -186,4 +186,4 @@ type CreateLoadersOptions = {
 declare function createLoaders(opts: CreateLoadersOptions): Loaders;
 //#endregion
 export { EventRef as _, OutboxFeed as a, NostrUser as c, ListLoaders as d, ListResult as f, EventLoader as g, ReplaceableLoader as h, OutboxError as i, ProfileLoader as l, ReplaceableLoadResult as m, Loaders as n, OutboxFeedOptions as o, LoadStyle as p, createLoaders as r, groupAuthorsByOutboxRelay as s, CreateLoadersOptions as t, bareNostrUser as u };
-//# sourceMappingURL=index-DCobP2Jj.d.mts.map
+//# sourceMappingURL=index-DDZjqV48.d.mts.map

package/dist/{index-YID-zPDF.d.mts → index-DYk24u9o.d.mts}

@@ -1,9 +1,10 @@
 import { n as EventTemplate, r as UnsignedEvent, t as Event } from "./event-j3BwI5dF.mjs";
-import { i as SecretKeyInput, t as Keys } from "./key-DojW2QZl.mjs";
-import { t as Filter } from "./filter-oYG2zjJ3.mjs";
-import { a as NostrError } from "./error-BPqAU5RB.mjs";
-import { t as NostrSigner } from "./types-BJ4wZ7JJ.mjs";
-import { n as ClientMetadata, t as BunkerPointer } from "./nip46-i8L8_nIm.mjs";
+import { a as SecretKeyInput, n as NostrBackend, t as Keys } from "./key-E0AJKMRB.mjs";
+import { t as Filter } from "./filter-w1R-mU63.mjs";
+import { o as NostrError } from "./error-DE1UCZ2J.mjs";
+import { a as Rumor } from "./nip59-B6Ey8L9z.mjs";
+import { t as NostrSigner } from "./types-DF8yT6EG.mjs";
+import { n as ClientMetadata, t as BunkerPointer } from "./nip46-C_ZFQprM.mjs";
 //#region src/signer/error.d.ts
 /**
  * Thrown by a lazy NIP-42 AUTH sign function when no signer is configured at challenge time.
@@ -59,7 +60,9 @@ declare class DelegatedSigner implements NostrSigner {
 /** Local secret-key signer with NIP-04 (legacy) and NIP-44 support. */
 declare class KeysSigner implements NostrSigner {
   #private;
-  constructor(secretKey: SecretKeyInput | Keys);
+  constructor(secretKey: SecretKeyInput | Keys, options?: {
+    backend?: NostrBackend | undefined;
+  });
   /**
    * The live {@link Keys} instance holding the secret material. {@link KeysSigner.dispose} zeroizes
    * it, so a reference obtained earlier reports a zeroized secret afterwards.
@@ -71,6 +74,8 @@ declare class KeysSigner implements NostrSigner {
   nip04Decrypt(peer: string, ciphertext: string): Promise<string>;
   nip44Encrypt(peer: string, plaintext: string): Promise<string>;
   nip44Decrypt(peer: string, payload: string): Promise<string>;
+  /** Unwraps each gift wrap independently — a bad wrap yields an Error, never fails the batch. */
+  unwrapGiftWraps(events: ReadonlyArray<Event>): Promise<ReadonlyArray<Rumor | Error>>;
   /**
    * Zeroize the wrapped secret key and every cached NIP-44 conversation key. All later calls reject
    * with {@link SignerDisposedError}. Idempotent.
@@ -153,8 +158,12 @@ type Nip46SignerOptions = {
   relays?: ReadonlyArray<string> | undefined;
   /** Bunker connection secret when the pointer or bunker:// URL has none. */
   secret?: string | undefined;
-  /** Local client key used to encrypt RPC (not the remote user key). */
-  clientSecretKey?: SecretKeyInput | undefined;
+  /**
+   * Local client identity used to encrypt and sign RPC (not the remote user key). Must implement
+   * `nip44Encrypt`/`nip44Decrypt` — the NIP-46 encryption layer is NIP-44. Construction rejects a
+   * signer without them.
+   */
+  clientSigner: NostrSigner;
   /** Called when bunker returns `auth_url` for a pending request. */
   onAuthUrl?: ((url: string) => void) | undefined;
   /** Per-request timeout in ms. Default 30s. */
@@ -180,25 +189,22 @@ declare class Nip46Signer implements NostrSigner {
   get clientPublicKey(): string;
   /**
    * Subscribe to an already-known bunker pointer. Does not send the `connect` RPC (reconnect
-   * without a new handshake). Requires `clientSecretKey` — reconnect must reuse the original client
-   * identity.
+   * without a new handshake). Requires `clientSigner` — reconnect must reuse the original client
+   * identity. Async because the client public key comes from the signer.
    */
-  static fromBunker(pointer: BunkerPointer, opts: Nip46SignerOptions & {
-    clientSecretKey: SecretKeyInput;
-  }): Nip46Signer;
+  static fromBunker(pointer: BunkerPointer, opts: Nip46SignerOptions): Promise<Nip46Signer>;
   /**
    * Connect using a `bunker://` URL or pre-parsed pointer. Invalid strings throw. A NIP-05
    * identifier is not a bunker pointer. When both pointer and `opts.relays` are nonempty, unique
    * `opts.relays` are appended.
    */
-  static connect(input: string | BunkerPointer, opts?: Nip46SignerOptions): Promise<Nip46Signer>;
+  static connect(input: string | BunkerPointer, opts: Nip46SignerOptions): Promise<Nip46Signer>;
   /**
    * Wait for a bunker to complete a client-initiated `nostrconnect://` handshake. Requires
-   * `clientSecretKey` whose pubkey matches the URI client pubkey (build the URI with
-   * {@link createNostrConnectURI} after generating keys).
+   * `clientSigner` whose pubkey matches the URI client pubkey (build the URI with
+   * {@link createNostrConnectURI} and the signer's public key).
    */
   static fromNostrConnectURI(connectionURI: string, opts: Nip46SignerOptions & {
-    clientSecretKey: SecretKeyInput;
     signal?: AbortSignal;
     handshakeTimeoutMs?: number;
   }): Promise<Nip46Signer>;
@@ -224,4 +230,4 @@ declare class Nip46Signer implements NostrSigner {
 }
 //#endregion
 export { Nip07Signer as a, isNip07Available as c, NostrKeyOperations as d, NoSignerError as f, Nip46Transport as i, KeysSigner as l, Nip46SignerOptions as n, WindowNostr as o, SignerDisposedError as p, Nip46SubscribeOptions as r, getWindowNostr as s, Nip46Signer as t, DelegatedSigner as u };
-//# sourceMappingURL=index-YID-zPDF.d.mts.map
+//# sourceMappingURL=index-DYk24u9o.d.mts.map