@qntx/nostr 0.10.1 → 0.12.1

package/dist/{memory-index-D_lvlYAy.mjs.map → memory-index-Bhwe0ZdG.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"memory-index-D_lvlYAy.mjs","names":[],"sources":["../src/storage/memory-index.ts"],"sourcesContent":["import { addToSetMap, removeFromSetMap, trimOldest } from \"../core/collections.ts\";\nimport type { Event } from \"../core/event.ts\";\nimport { compareEventsDesc, itemCompare, sortEvents } from \"../core/event.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { matchFilter } from \"../core/filter.ts\";\nimport { eventAddress, formatEventAddress, parseEventAddress } from \"../core/tag.ts\";\nimport { DeletionState } from \"./deletion.ts\";\nimport { applyPutMemory, decidePut, outboxBoundKey } from \"./put.ts\";\nimport type { PutLookup } from \"./put.ts\";\nimport type { NegentropyItem, OutboxBound, PutResult } from \"./types.ts\";\n\nexport type MemoryIndexOptions = {\n  /**\n   * FIFO cap applied independently to each deletion-state collection: tombstoned event ids, pending\n   * e-tag ids, and coordinate tombstones. Default unbounded. Trade-off: once an entry is trimmed, a\n   * re-arriving old deleted event or replaceable version can be accepted again.\n   */\n  maxTombstones?: number | undefined;\n  /**\n   * FIFO cap on replaceable/addressable winner watermarks recorded by {@link evict}. A watermark\n   * keeps only `{ id, created_at }` per address so stale versions stay rejected after the winner's\n   * body is evicted, and a re-put of the watermarked id re-inserts it. Default 0 (no watermark\n   * retention); callers that evict should pass a bound. Once a watermark is trimmed, an older\n   * evicted version can be accepted again — the same trade-off as deletion tombstones.\n   */\n  maxWatermarks?: number | undefined;\n  /** Fires after every physical index insert (accept, replace, deletion event). */\n  onInsert?: ((event: Event) => void) | undefined;\n  /** Fires after every physical index remove (replace, delete, evict, remove, clear). */\n  onRemove?: ((event: Event) => void) | undefined;\n};\n\n/**\n * Synchronous in-memory event index with NIP-01 replaceable / addressable / ephemeral handling and\n * NIP-09 deletion (kind 5) application. Shared by {@link MemoryEventStore} (async facade) and\n * `ReactiveEventStore`.\n */\nexport class MemoryIndex {\n  readonly #byId = new Map<string, Event>();\n  readonly #byPubkey = new Map<string, Set<string>>();\n  readonly #byKind = new Map<number, Set<string>>();\n  readonly #byKindPubkey = new Map<string, Set<string>>(); // `${kind}:${pubkey}` → ids\n  readonly #byEpTag = new Map<string, Set<string>>(); // `${\"e\"|\"p\"}:${value.toLowerCase()}` → ids\n  readonly #replaceable = new Map<string, string>(); // address -> event id\n  // address -> last evicted winner; insertion order is the FIFO trim order\n  readonly #watermarks = new Map<string, { id: string; created_at: number }>();\n  // winner id -> address reverse index for O(1) watermark drops on deletion\n  readonly #watermarkIds = new Map<string, string>();\n  readonly #deletion = new DeletionState();\n  readonly #outboxBounds = new Map<string, OutboxBound>();\n  readonly #maxTombstones: number | undefined;\n  readonly #maxWatermarks: number;\n  readonly #onInsert: ((event: Event) => void) | undefined;\n  readonly #onRemove: ((event: Event) => void) | undefined;\n\n  constructor(opts?: MemoryIndexOptions) {\n    this.#maxTombstones = opts?.maxTombstones;\n    this.#maxWatermarks = opts?.maxWatermarks ?? 0;\n    this.#onInsert = opts?.onInsert;\n    this.#onRemove = opts?.onRemove;\n  }\n\n  put(raw: Event): PutResult {\n    const lookup: PutLookup = {\n      deletion: this.#deletion,\n      getById: (id) => this.#byId.get(id),\n      getReplaceable: (addr) => {\n        const id = this.#replaceable.get(addr);\n        const ev = id === undefined ? undefined : this.#byId.get(id);\n        if (ev) {\n          return { id: ev.id, created_at: ev.created_at };\n        }\n        const watermark = this.#watermarks.get(addr);\n        return watermark === undefined ? undefined : { ...watermark, evicted: true };\n      },\n    };\n    const decision = decidePut(raw, lookup);\n    if (decision.action === \"delete\") {\n      // Pending e-tag targets and coordinate tombstones never reach\n      // indexRemove — drop their watermarks here.\n      for (const p of decision.plan.pendingIds) {\n        this.#dropWatermarkId(p.id);\n      }\n      for (const c of decision.plan.coordinates) {\n        this.#dropWatermark(c.key);\n      }\n    }\n    const result = applyPutMemory(\n      {\n        deletion: this.#deletion,\n        indexInsert: (e) => this.#indexInsert(e),\n        indexRemove: (id) => this.#indexRemove(id),\n      },\n      decision,\n    );\n    this.#trimTombstones();\n    return result;\n  }\n\n  /** Sequential `put` in input order. */\n  putMany(events: ReadonlyArray<Event>): PutResult[] {\n    const results: PutResult[] = [];\n    for (const event of events) {\n      results.push(this.put(event));\n    }\n    return results;\n  }\n\n  get(id: string): Event | undefined {\n    const key = id.toLowerCase();\n    if (this.#deletion.ids.has(key)) {\n      return undefined;\n    }\n    return this.#byId.get(key);\n  }\n\n  /** Current event at a `kind:pubkey:d` coordinate (replaceable or addressable). */\n  getByAddress(address: string): Event | undefined {\n    const coord = parseEventAddress(address);\n    if (!coord) {\n      return undefined;\n    }\n    const id = this.#replaceable.get(\n      formatEventAddress(coord.kind, coord.pubkey, coord.identifier),\n    );\n    if (id === undefined) {\n      return undefined;\n    }\n    if (this.#deletion.ids.has(id)) {\n      return undefined;\n    }\n    return this.#byId.get(id);\n  }\n\n  query(filters: ReadonlyArray<Filter>): Event[] {\n    const seen = new Set<string>();\n    const events: Event[] = [];\n    for (const filter of filters) {\n      for (const event of this.#matchedEvents(filter)) {\n        if (seen.has(event.id)) {\n          continue;\n        }\n        seen.add(event.id);\n        events.push(event);\n      }\n    }\n    sortEvents(events);\n    return events;\n  }\n\n  count(filters: ReadonlyArray<Filter>): number {\n    const seen = new Set<string>();\n    for (const filter of filters) {\n      for (const event of this.#matchedEvents(filter)) {\n        seen.add(event.id);\n      }\n    }\n    return seen.size;\n  }\n\n  negentropyItems(filter: Filter): NegentropyItem[] {\n    if (filter.limit === 0) {\n      return [];\n    }\n    const items: NegentropyItem[] = [];\n    this.#eachCandidate(filter, (event) => {\n      if (this.#deletion.covers(event)) {\n        return;\n      }\n      if (!matchFilter(filter, event)) {\n        return;\n      }\n      items.push({ id: event.id, created_at: event.created_at });\n    });\n    if (filter.limit !== undefined) {\n      items.sort(compareEventsDesc);\n      if (items.length > filter.limit) {\n        items.length = filter.limit;\n      }\n    }\n    items.sort(itemCompare);\n    return items;\n  }\n\n  /** Remove by id and tombstone (like a local NIP-09). Returns removed count. */\n  remove(ids: ReadonlyArray<string>): number {\n    let n = 0;\n    for (const raw of ids) {\n      const id = raw.toLowerCase();\n      if (this.#indexRemove(id)) {\n        n += 1;\n      }\n      this.#deletion.ids.add(id);\n      this.#deletion.pending.delete(id);\n    }\n    this.#trimTombstones();\n    return n;\n  }\n\n  /**\n   * Remove by id without writing a tombstone (LRU eviction). When the evicted event is the current\n   * winner of a replaceable/addressable address, a `{ id, created_at }` watermark is recorded so\n   * stale versions stay rejected while the body is gone; the watermarks are FIFO-bounded by\n   * `maxWatermarks`.\n   */\n  evict(ids: ReadonlyArray<string>): number {\n    let n = 0;\n    for (const raw of ids) {\n      const id = raw.toLowerCase();\n      const event = this.#byId.get(id);\n      if (event === undefined) {\n        continue;\n      }\n      const addr = eventAddress(event);\n      const winner = addr !== undefined && this.#replaceable.get(addr) === id;\n      if (this.#indexRemove(id)) {\n        n += 1;\n      }\n      if (winner) {\n        this.#setWatermark(addr, { id, created_at: event.created_at });\n      }\n    }\n    return n;\n  }\n\n  /**\n   * True when the id is tombstoned, or the coordinate has a deletion marker that still covers the\n   * current event at that address: a replacement published after the marker's `until` clears the\n   * deletion. Coordinates are matched on the canonical lowercase pubkey.\n   */\n  isDeleted(idOrAddress: string): boolean {\n    if (this.#deletion.ids.has(idOrAddress.toLowerCase())) {\n      return true;\n    }\n    const coord = parseEventAddress(idOrAddress);\n    if (!coord) {\n      return false;\n    }\n    const address = formatEventAddress(coord.kind, coord.pubkey, coord.identifier);\n    const until = this.#deletion.coordinates.get(address);\n    if (until === undefined) {\n      return false;\n    }\n    const id = this.#replaceable.get(address);\n    if (id === undefined) {\n      return true;\n    }\n    const event = this.#byId.get(id);\n    return event === undefined || event.created_at <= until;\n  }\n\n  getOutboxBound(pubkey: string, kind: number): OutboxBound | undefined {\n    const persisted = this.#outboxBounds.get(outboxBoundKey(pubkey, kind));\n    if (persisted) {\n      return { oldest: persisted.oldest, newest: persisted.newest };\n    }\n    return this.#deriveOutboxBound(pubkey, kind);\n  }\n\n  setOutboxBound(pubkey: string, kind: number, bound: OutboxBound): void {\n    this.#outboxBounds.set(outboxBoundKey(pubkey, kind), {\n      oldest: bound.oldest,\n      newest: bound.newest,\n    });\n  }\n\n  clear(): void {\n    if (this.#onRemove) {\n      for (const event of this.#byId.values()) {\n        this.#onRemove(event);\n      }\n    }\n    this.#byId.clear();\n    this.#byPubkey.clear();\n    this.#byKind.clear();\n    this.#byKindPubkey.clear();\n    this.#byEpTag.clear();\n    this.#replaceable.clear();\n    this.#watermarks.clear();\n    this.#watermarkIds.clear();\n    this.#deletion.clear();\n    this.#outboxBounds.clear();\n  }\n\n  get size(): number {\n    return this.#byId.size;\n  }\n\n  #indexInsert(event: Event): void {\n    this.#byId.set(event.id, event);\n    const { pubkey } = event;\n    addToSetMap(this.#byPubkey, pubkey, event.id);\n    addToSetMap(this.#byKind, event.kind, event.id);\n    addToSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, event.id);\n    for (const tag of event.tags) {\n      if ((tag[0] !== \"e\" && tag[0] !== \"p\") || tag[1] === undefined) {\n        continue;\n      }\n      addToSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, event.id);\n    }\n    const addr = eventAddress(event);\n    if (addr !== undefined) {\n      this.#replaceable.set(addr, event.id);\n      this.#dropWatermark(addr);\n    }\n    this.#onInsert?.(event);\n  }\n\n  #indexRemove(id: string): boolean {\n    // A removed/deleted id must not keep a stale watermark alive; eviction\n    // re-records its winner watermark right after this call.\n    this.#dropWatermarkId(id);\n    const event = this.#byId.get(id);\n    if (!event) {\n      return false;\n    }\n    this.#byId.delete(id);\n    const { pubkey } = event;\n    removeFromSetMap(this.#byPubkey, pubkey, id);\n    removeFromSetMap(this.#byKind, event.kind, id);\n    removeFromSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, id);\n    for (const tag of event.tags) {\n      if ((tag[0] !== \"e\" && tag[0] !== \"p\") || tag[1] === undefined) {\n        continue;\n      }\n      removeFromSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, id);\n    }\n    const addr = eventAddress(event);\n    if (addr !== undefined && this.#replaceable.get(addr) === id) {\n      this.#replaceable.delete(addr);\n    }\n    this.#onRemove?.(event);\n    return true;\n  }\n\n  #matchedEvents(filter: Filter): Event[] {\n    if (filter.limit === 0) {\n      return [];\n    }\n    const matched: Event[] = [];\n    this.#eachCandidate(filter, (event) => {\n      if (this.#deletion.covers(event)) {\n        return;\n      }\n      if (!matchFilter(filter, event)) {\n        return;\n      }\n      matched.push(event);\n    });\n    sortEvents(matched);\n    return filter.limit === undefined ? matched : matched.slice(0, filter.limit);\n  }\n\n  #deriveOutboxBound(pubkey: string, kind: number): OutboxBound | undefined {\n    const byPk = this.#byPubkey.get(pubkey.toLowerCase());\n    const byKind = this.#byKind.get(kind);\n    if (!byPk || !byKind) {\n      return undefined;\n    }\n    let oldest: number | undefined;\n    let newest: number | undefined;\n    for (const id of byPk) {\n      if (!byKind.has(id) || this.#deletion.ids.has(id)) {\n        continue;\n      }\n      const event = this.#byId.get(id);\n      if (!event || this.#deletion.covers(event)) {\n        continue;\n      }\n      if (oldest === undefined || event.created_at < oldest) {\n        oldest = event.created_at;\n      }\n      if (newest === undefined || event.created_at > newest) {\n        newest = event.created_at;\n      }\n    }\n    if (oldest === undefined || newest === undefined) {\n      return undefined;\n    }\n    return { oldest, newest };\n  }\n\n  #eachCandidate(filter: Filter, visit: (event: Event) => void): void {\n    if (filter.ids) {\n      const seen = new Set<string>();\n      for (const raw of filter.ids) {\n        const event = this.#byId.get(raw.toLowerCase());\n        if (!event || seen.has(event.id)) {\n          continue;\n        }\n        seen.add(event.id);\n        visit(event);\n      }\n      return;\n    }\n\n    if (filter.authors && filter.kinds) {\n      const seen = new Set<string>();\n      for (const pk of filter.authors) {\n        const pubkey = pk.toLowerCase();\n        for (const kind of filter.kinds) {\n          const ids = this.#byKindPubkey.get(`${kind}:${pubkey}`);\n          if (!ids) {\n            continue;\n          }\n          for (const id of ids) {\n            if (seen.has(id)) {\n              continue;\n            }\n            seen.add(id);\n            const event = this.#byId.get(id);\n            if (event) {\n              visit(event);\n            }\n          }\n        }\n      }\n      return;\n    }\n\n    if (filter.authors) {\n      const seen = new Set<string>();\n      for (const pk of filter.authors) {\n        const byPk = this.#byPubkey.get(pk.toLowerCase());\n        if (!byPk) {\n          continue;\n        }\n        for (const id of byPk) {\n          if (seen.has(id)) {\n            continue;\n          }\n          seen.add(id);\n          const event = this.#byId.get(id);\n          if (event) {\n            visit(event);\n          }\n        }\n      }\n      return;\n    }\n\n    if (filter.kinds) {\n      const seen = new Set<string>();\n      for (const kind of filter.kinds) {\n        const byKind = this.#byKind.get(kind);\n        if (!byKind) {\n          continue;\n        }\n        for (const id of byKind) {\n          if (seen.has(id)) {\n            continue;\n          }\n          seen.add(id);\n          const event = this.#byId.get(id);\n          if (event) {\n            visit(event);\n          }\n        }\n      }\n      return;\n    }\n\n    const eTags = filter[\"#e\"];\n    const pTags = filter[\"#p\"];\n    if (eTags !== undefined || pTags !== undefined) {\n      const seen = new Set<string>();\n      visitEpTagIds(this.#byEpTag, this.#byId, \"e\", eTags, seen, visit);\n      visitEpTagIds(this.#byEpTag, this.#byId, \"p\", pTags, seen, visit);\n      return;\n    }\n\n    // #t/#d and other non-e/p tags are not indexed (e/p only). A generic tag\n    // store is extra put/remove amp; hashtag-only queries scan #byId.\n    for (const event of this.#byId.values()) {\n      visit(event);\n    }\n  }\n\n  #setWatermark(addr: string, watermark: { id: string; created_at: number }): void {\n    if (this.#maxWatermarks === 0) {\n      return;\n    }\n    this.#dropWatermark(addr);\n    this.#watermarks.set(addr, watermark);\n    this.#watermarkIds.set(watermark.id, addr);\n    trimOldest(this.#watermarks, this.#maxWatermarks, (a) => this.#dropWatermark(a));\n  }\n\n  #dropWatermark(addr: string): void {\n    const watermark = this.#watermarks.get(addr);\n    if (watermark === undefined) {\n      return;\n    }\n    this.#watermarks.delete(addr);\n    this.#watermarkIds.delete(watermark.id);\n  }\n\n  #dropWatermarkId(id: string): void {\n    const addr = this.#watermarkIds.get(id);\n    if (addr === undefined) {\n      return;\n    }\n    this.#watermarkIds.delete(id);\n    this.#watermarks.delete(addr);\n  }\n\n  #trimTombstones(): void {\n    const cap = this.#maxTombstones;\n    if (cap === undefined) {\n      return;\n    }\n    trimOldest(this.#deletion.ids, cap, (id) => {\n      this.#deletion.pending.delete(id);\n    });\n    trimOldest(this.#deletion.pending, cap);\n    trimOldest(this.#deletion.coordinates, cap);\n  }\n}\n\nfunction visitEpTagIds(\n  byEpTag: Map<string, Set<string>>,\n  byId: Map<string, Event>,\n  name: \"e\" | \"p\",\n  values: ReadonlyArray<string> | undefined,\n  seen: Set<string>,\n  visit: (event: Event) => void,\n): void {\n  if (values === undefined) {\n    return;\n  }\n  for (const value of values) {\n    const ids = byEpTag.get(`${name}:${value.toLowerCase()}`);\n    if (!ids) {\n      continue;\n    }\n    for (const id of ids) {\n      if (seen.has(id)) {\n        continue;\n      }\n      seen.add(id);\n      const event = byId.get(id);\n      if (event) {\n        visit(event);\n      }\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;AAqCA,IAAa,cAAb,MAAyB;CACvB,wBAAiB,IAAI,IAAmB;CACxC,4BAAqB,IAAI,IAAyB;CAClD,0BAAmB,IAAI,IAAyB;CAChD,gCAAyB,IAAI,IAAyB;CACtD,2BAAoB,IAAI,IAAyB;CACjD,+BAAwB,IAAI,IAAoB;CAEhD,8BAAuB,IAAI,IAAgD;CAE3E,gCAAyB,IAAI,IAAoB;CACjD,YAAqB,IAAI,cAAc;CACvC,gCAAyB,IAAI,IAAyB;CACtD;CACA;CACA;CACA;CAEA,YAAY,MAA2B;EACrC,KAAK,iBAAiB,MAAM;EAC5B,KAAK,iBAAiB,MAAM,iBAAiB;EAC7C,KAAK,YAAY,MAAM;EACvB,KAAK,YAAY,MAAM;CACzB;CAEA,IAAI,KAAuB;EACzB,MAAM,SAAoB;GACxB,UAAU,KAAK;GACf,UAAU,OAAO,KAAK,MAAM,IAAI,EAAE;GAClC,iBAAiB,SAAS;IACxB,MAAM,KAAK,KAAK,aAAa,IAAI,IAAI;IACrC,MAAM,KAAK,OAAO,KAAA,IAAY,KAAA,IAAY,KAAK,MAAM,IAAI,EAAE;IAC3D,IAAI,IACF,OAAO;KAAE,IAAI,GAAG;KAAI,YAAY,GAAG;IAAW;IAEhD,MAAM,YAAY,KAAK,YAAY,IAAI,IAAI;IAC3C,OAAO,cAAc,KAAA,IAAY,KAAA,IAAY;KAAE,GAAG;KAAW,SAAS;IAAK;GAC7E;EACF;EACA,MAAM,WAAW,UAAU,KAAK,MAAM;EACtC,IAAI,SAAS,WAAW,UAAU;GAGhC,KAAK,MAAM,KAAK,SAAS,KAAK,YAC5B,KAAK,iBAAiB,EAAE,EAAE;GAE5B,KAAK,MAAM,KAAK,SAAS,KAAK,aAC5B,KAAK,eAAe,EAAE,GAAG;EAE7B;EACA,MAAM,SAAS,eACb;GACE,UAAU,KAAK;GACf,cAAc,MAAM,KAAK,aAAa,CAAC;GACvC,cAAc,OAAO,KAAK,aAAa,EAAE;EAC3C,GACA,QACF;EACA,KAAK,gBAAgB;EACrB,OAAO;CACT;;CAGA,QAAQ,QAA2C;EACjD,MAAM,UAAuB,CAAC;EAC9B,KAAK,MAAM,SAAS,QAClB,QAAQ,KAAK,KAAK,IAAI,KAAK,CAAC;EAE9B,OAAO;CACT;CAEA,IAAI,IAA+B;EACjC,MAAM,MAAM,GAAG,YAAY;EAC3B,IAAI,KAAK,UAAU,IAAI,IAAI,GAAG,GAC5B;EAEF,OAAO,KAAK,MAAM,IAAI,GAAG;CAC3B;;CAGA,aAAa,SAAoC;EAC/C,MAAM,QAAQ,kBAAkB,OAAO;EACvC,IAAI,CAAC,OACH;EAEF,MAAM,KAAK,KAAK,aAAa,IAC3B,mBAAmB,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU,CAC/D;EACA,IAAI,OAAO,KAAA,GACT;EAEF,IAAI,KAAK,UAAU,IAAI,IAAI,EAAE,GAC3B;EAEF,OAAO,KAAK,MAAM,IAAI,EAAE;CAC1B;CAEA,MAAM,SAAyC;EAC7C,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,SAAkB,CAAC;EACzB,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,SAAS,KAAK,eAAe,MAAM,GAAG;GAC/C,IAAI,KAAK,IAAI,MAAM,EAAE,GACnB;GAEF,KAAK,IAAI,MAAM,EAAE;GACjB,OAAO,KAAK,KAAK;EACnB;EAEF,WAAW,MAAM;EACjB,OAAO;CACT;CAEA,MAAM,SAAwC;EAC5C,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,SAAS,KAAK,eAAe,MAAM,GAC5C,KAAK,IAAI,MAAM,EAAE;EAGrB,OAAO,KAAK;CACd;CAEA,gBAAgB,QAAkC;EAChD,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC;EAEV,MAAM,QAA0B,CAAC;EACjC,KAAK,eAAe,SAAS,UAAU;GACrC,IAAI,KAAK,UAAU,OAAO,KAAK,GAC7B;GAEF,IAAI,CAAC,YAAY,QAAQ,KAAK,GAC5B;GAEF,MAAM,KAAK;IAAE,IAAI,MAAM;IAAI,YAAY,MAAM;GAAW,CAAC;EAC3D,CAAC;EACD,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,KAAK,iBAAiB;GAC5B,IAAI,MAAM,SAAS,OAAO,OACxB,MAAM,SAAS,OAAO;EAE1B;EACA,MAAM,KAAK,WAAW;EACtB,OAAO;CACT;;CAGA,OAAO,KAAoC;EACzC,IAAI,IAAI;EACR,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,KAAK,IAAI,YAAY;GAC3B,IAAI,KAAK,aAAa,EAAE,GACtB,KAAK;GAEP,KAAK,UAAU,IAAI,IAAI,EAAE;GACzB,KAAK,UAAU,QAAQ,OAAO,EAAE;EAClC;EACA,KAAK,gBAAgB;EACrB,OAAO;CACT;;;;;;;CAQA,MAAM,KAAoC;EACxC,IAAI,IAAI;EACR,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,KAAK,IAAI,YAAY;GAC3B,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;GAC/B,IAAI,UAAU,KAAA,GACZ;GAEF,MAAM,OAAO,aAAa,KAAK;GAC/B,MAAM,SAAS,SAAS,KAAA,KAAa,KAAK,aAAa,IAAI,IAAI,MAAM;GACrE,IAAI,KAAK,aAAa,EAAE,GACtB,KAAK;GAEP,IAAI,QACF,KAAK,cAAc,MAAM;IAAE;IAAI,YAAY,MAAM;GAAW,CAAC;EAEjE;EACA,OAAO;CACT;;;;;;CAOA,UAAU,aAA8B;EACtC,IAAI,KAAK,UAAU,IAAI,IAAI,YAAY,YAAY,CAAC,GAClD,OAAO;EAET,MAAM,QAAQ,kBAAkB,WAAW;EAC3C,IAAI,CAAC,OACH,OAAO;EAET,MAAM,UAAU,mBAAmB,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;EAC7E,MAAM,QAAQ,KAAK,UAAU,YAAY,IAAI,OAAO;EACpD,IAAI,UAAU,KAAA,GACZ,OAAO;EAET,MAAM,KAAK,KAAK,aAAa,IAAI,OAAO;EACxC,IAAI,OAAO,KAAA,GACT,OAAO;EAET,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;EAC/B,OAAO,UAAU,KAAA,KAAa,MAAM,cAAc;CACpD;CAEA,eAAe,QAAgB,MAAuC;EACpE,MAAM,YAAY,KAAK,cAAc,IAAI,eAAe,QAAQ,IAAI,CAAC;EACrE,IAAI,WACF,OAAO;GAAE,QAAQ,UAAU;GAAQ,QAAQ,UAAU;EAAO;EAE9D,OAAO,KAAK,mBAAmB,QAAQ,IAAI;CAC7C;CAEA,eAAe,QAAgB,MAAc,OAA0B;EACrE,KAAK,cAAc,IAAI,eAAe,QAAQ,IAAI,GAAG;GACnD,QAAQ,MAAM;GACd,QAAQ,MAAM;EAChB,CAAC;CACH;CAEA,QAAc;EACZ,IAAI,KAAK,WACP,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,GACpC,KAAK,UAAU,KAAK;EAGxB,KAAK,MAAM,MAAM;EACjB,KAAK,UAAU,MAAM;EACrB,KAAK,QAAQ,MAAM;EACnB,KAAK,cAAc,MAAM;EACzB,KAAK,SAAS,MAAM;EACpB,KAAK,aAAa,MAAM;EACxB,KAAK,YAAY,MAAM;EACvB,KAAK,cAAc,MAAM;EACzB,KAAK,UAAU,MAAM;EACrB,KAAK,cAAc,MAAM;CAC3B;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;CAEA,aAAa,OAAoB;EAC/B,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK;EAC9B,MAAM,EAAE,WAAW;EACnB,YAAY,KAAK,WAAW,QAAQ,MAAM,EAAE;EAC5C,YAAY,KAAK,SAAS,MAAM,MAAM,MAAM,EAAE;EAC9C,YAAY,KAAK,eAAe,GAAG,MAAM,KAAK,GAAG,UAAU,MAAM,EAAE;EACnE,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAK,IAAI,OAAO,OAAO,IAAI,OAAO,OAAQ,IAAI,OAAO,KAAA,GACnD;GAEF,YAAY,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,YAAY,KAAK,MAAM,EAAE;EAC1E;EACA,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,GAAW;GACtB,KAAK,aAAa,IAAI,MAAM,MAAM,EAAE;GACpC,KAAK,eAAe,IAAI;EAC1B;EACA,KAAK,YAAY,KAAK;CACxB;CAEA,aAAa,IAAqB;EAGhC,KAAK,iBAAiB,EAAE;EACxB,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;EAC/B,IAAI,CAAC,OACH,OAAO;EAET,KAAK,MAAM,OAAO,EAAE;EACpB,MAAM,EAAE,WAAW;EACnB,iBAAiB,KAAK,WAAW,QAAQ,EAAE;EAC3C,iBAAiB,KAAK,SAAS,MAAM,MAAM,EAAE;EAC7C,iBAAiB,KAAK,eAAe,GAAG,MAAM,KAAK,GAAG,UAAU,EAAE;EAClE,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAK,IAAI,OAAO,OAAO,IAAI,OAAO,OAAQ,IAAI,OAAO,KAAA,GACnD;GAEF,iBAAiB,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,YAAY,KAAK,EAAE;EACzE;EACA,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,KAAa,KAAK,aAAa,IAAI,IAAI,MAAM,IACxD,KAAK,aAAa,OAAO,IAAI;EAE/B,KAAK,YAAY,KAAK;EACtB,OAAO;CACT;CAEA,eAAe,QAAyB;EACtC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC;EAEV,MAAM,UAAmB,CAAC;EAC1B,KAAK,eAAe,SAAS,UAAU;GACrC,IAAI,KAAK,UAAU,OAAO,KAAK,GAC7B;GAEF,IAAI,CAAC,YAAY,QAAQ,KAAK,GAC5B;GAEF,QAAQ,KAAK,KAAK;EACpB,CAAC;EACD,WAAW,OAAO;EAClB,OAAO,OAAO,UAAU,KAAA,IAAY,UAAU,QAAQ,MAAM,GAAG,OAAO,KAAK;CAC7E;CAEA,mBAAmB,QAAgB,MAAuC;EACxE,MAAM,OAAO,KAAK,UAAU,IAAI,OAAO,YAAY,CAAC;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;EACpC,IAAI,CAAC,QAAQ,CAAC,QACZ;EAEF,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,MAAM,MAAM;GACrB,IAAI,CAAC,OAAO,IAAI,EAAE,KAAK,KAAK,UAAU,IAAI,IAAI,EAAE,GAC9C;GAEF,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;GAC/B,IAAI,CAAC,SAAS,KAAK,UAAU,OAAO,KAAK,GACvC;GAEF,IAAI,WAAW,KAAA,KAAa,MAAM,aAAa,QAC7C,SAAS,MAAM;GAEjB,IAAI,WAAW,KAAA,KAAa,MAAM,aAAa,QAC7C,SAAS,MAAM;EAEnB;EACA,IAAI,WAAW,KAAA,KAAa,WAAW,KAAA,GACrC;EAEF,OAAO;GAAE;GAAQ;EAAO;CAC1B;CAEA,eAAe,QAAgB,OAAqC;EAClE,IAAI,OAAO,KAAK;GACd,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,OAAO,OAAO,KAAK;IAC5B,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC;IAC9C,IAAI,CAAC,SAAS,KAAK,IAAI,MAAM,EAAE,GAC7B;IAEF,KAAK,IAAI,MAAM,EAAE;IACjB,MAAM,KAAK;GACb;GACA;EACF;EAEA,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,OAAO,SAAS;IAC/B,MAAM,SAAS,GAAG,YAAY;IAC9B,KAAK,MAAM,QAAQ,OAAO,OAAO;KAC/B,MAAM,MAAM,KAAK,cAAc,IAAI,GAAG,KAAK,GAAG,QAAQ;KACtD,IAAI,CAAC,KACH;KAEF,KAAK,MAAM,MAAM,KAAK;MACpB,IAAI,KAAK,IAAI,EAAE,GACb;MAEF,KAAK,IAAI,EAAE;MACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;MAC/B,IAAI,OACF,MAAM,KAAK;KAEf;IACF;GACF;GACA;EACF;EAEA,IAAI,OAAO,SAAS;GAClB,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,OAAO,SAAS;IAC/B,MAAM,OAAO,KAAK,UAAU,IAAI,GAAG,YAAY,CAAC;IAChD,IAAI,CAAC,MACH;IAEF,KAAK,MAAM,MAAM,MAAM;KACrB,IAAI,KAAK,IAAI,EAAE,GACb;KAEF,KAAK,IAAI,EAAE;KACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OACF,MAAM,KAAK;IAEf;GACF;GACA;EACF;EAEA,IAAI,OAAO,OAAO;GAChB,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,QAAQ,OAAO,OAAO;IAC/B,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;IACpC,IAAI,CAAC,QACH;IAEF,KAAK,MAAM,MAAM,QAAQ;KACvB,IAAI,KAAK,IAAI,EAAE,GACb;KAEF,KAAK,IAAI,EAAE;KACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OACF,MAAM,KAAK;IAEf;GACF;GACA;EACF;EAEA,MAAM,QAAQ,OAAO;EACrB,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,KAAA,KAAa,UAAU,KAAA,GAAW;GAC9C,MAAM,uBAAO,IAAI,IAAY;GAC7B,cAAc,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK;GAChE,cAAc,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK;GAChE;EACF;EAIA,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,GACpC,MAAM,KAAK;CAEf;CAEA,cAAc,MAAc,WAAqD;EAC/E,IAAI,KAAK,mBAAmB,GAC1B;EAEF,KAAK,eAAe,IAAI;EACxB,KAAK,YAAY,IAAI,MAAM,SAAS;EACpC,KAAK,cAAc,IAAI,UAAU,IAAI,IAAI;EACzC,WAAW,KAAK,aAAa,KAAK,iBAAiB,MAAM,KAAK,eAAe,CAAC,CAAC;CACjF;CAEA,eAAe,MAAoB;EACjC,MAAM,YAAY,KAAK,YAAY,IAAI,IAAI;EAC3C,IAAI,cAAc,KAAA,GAChB;EAEF,KAAK,YAAY,OAAO,IAAI;EAC5B,KAAK,cAAc,OAAO,UAAU,EAAE;CACxC;CAEA,iBAAiB,IAAkB;EACjC,MAAM,OAAO,KAAK,cAAc,IAAI,EAAE;EACtC,IAAI,SAAS,KAAA,GACX;EAEF,KAAK,cAAc,OAAO,EAAE;EAC5B,KAAK,YAAY,OAAO,IAAI;CAC9B;CAEA,kBAAwB;EACtB,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,GACV;EAEF,WAAW,KAAK,UAAU,KAAK,MAAM,OAAO;GAC1C,KAAK,UAAU,QAAQ,OAAO,EAAE;EAClC,CAAC;EACD,WAAW,KAAK,UAAU,SAAS,GAAG;EACtC,WAAW,KAAK,UAAU,aAAa,GAAG;CAC5C;AACF;AAEA,SAAS,cACP,SACA,MACA,MACA,QACA,MACA,OACM;CACN,IAAI,WAAW,KAAA,GACb;CAEF,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,MAAM,QAAQ,IAAI,GAAG,KAAK,GAAG,MAAM,YAAY,GAAG;EACxD,IAAI,CAAC,KACH;EAEF,KAAK,MAAM,MAAM,KAAK;GACpB,IAAI,KAAK,IAAI,EAAE,GACb;GAEF,KAAK,IAAI,EAAE;GACX,MAAM,QAAQ,KAAK,IAAI,EAAE;GACzB,IAAI,OACF,MAAM,KAAK;EAEf;CACF;AACF"}
+{"version":3,"file":"memory-index-Bhwe0ZdG.mjs","names":[],"sources":["../src/storage/memory-index.ts"],"sourcesContent":["import { addToSetMap, removeFromSetMap, trimOldest } from \"../core/collections.ts\";\nimport type { Event } from \"../core/event.ts\";\nimport { compareEventsDesc, itemCompare, sortEvents } from \"../core/event.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { matchFilter } from \"../core/filter.ts\";\nimport { eventAddress, formatEventAddress, parseEventAddress } from \"../core/tag.ts\";\nimport { DeletionState } from \"./deletion.ts\";\nimport { applyPutMemory, decidePut, outboxBoundKey } from \"./put.ts\";\nimport type { PutLookup } from \"./put.ts\";\nimport type { NegentropyItem, OutboxBound, PutResult } from \"./types.ts\";\n\nexport type MemoryIndexOptions = {\n  /**\n   * FIFO cap applied independently to each deletion-state collection: tombstoned event ids, pending\n   * e-tag ids, and coordinate tombstones. Default unbounded. Trade-off: once an entry is trimmed, a\n   * re-arriving old deleted event or replaceable version can be accepted again.\n   */\n  maxTombstones?: number | undefined;\n  /**\n   * FIFO cap on replaceable/addressable winner watermarks recorded by {@link evict}. A watermark\n   * keeps only `{ id, created_at }` per address so stale versions stay rejected after the winner's\n   * body is evicted, and a re-put of the watermarked id re-inserts it. Default 0 (no watermark\n   * retention); callers that evict should pass a bound. Once a watermark is trimmed, an older\n   * evicted version can be accepted again — the same trade-off as deletion tombstones.\n   */\n  maxWatermarks?: number | undefined;\n  /** Fires after every physical index insert (accept, replace, deletion event). */\n  onInsert?: ((event: Event) => void) | undefined;\n  /** Fires after every physical index remove (replace, delete, evict, remove, clear). */\n  onRemove?: ((event: Event) => void) | undefined;\n};\n\n/**\n * Synchronous in-memory event index with NIP-01 replaceable / addressable / ephemeral handling and\n * NIP-09 deletion (kind 5) application. Shared by {@link MemoryEventStore} (async facade) and\n * `ReactiveEventStore`.\n */\nexport class MemoryIndex {\n  readonly #byId = new Map<string, Event>();\n  readonly #byPubkey = new Map<string, Set<string>>();\n  readonly #byKind = new Map<number, Set<string>>();\n  readonly #byKindPubkey = new Map<string, Set<string>>(); // `${kind}:${pubkey}` → ids\n  readonly #byEpTag = new Map<string, Set<string>>(); // `${\"e\"|\"p\"}:${value.toLowerCase()}` → ids\n  readonly #replaceable = new Map<string, string>(); // address -> event id\n  // address -> last evicted winner; insertion order is the FIFO trim order\n  readonly #watermarks = new Map<string, { id: string; created_at: number }>();\n  // winner id -> address reverse index for O(1) watermark drops on deletion\n  readonly #watermarkIds = new Map<string, string>();\n  readonly #deletion = new DeletionState();\n  readonly #outboxBounds = new Map<string, OutboxBound>();\n  readonly #maxTombstones: number | undefined;\n  readonly #maxWatermarks: number;\n  readonly #onInsert: ((event: Event) => void) | undefined;\n  readonly #onRemove: ((event: Event) => void) | undefined;\n\n  constructor(opts?: MemoryIndexOptions) {\n    this.#maxTombstones = opts?.maxTombstones;\n    this.#maxWatermarks = opts?.maxWatermarks ?? 0;\n    this.#onInsert = opts?.onInsert;\n    this.#onRemove = opts?.onRemove;\n  }\n\n  put(raw: Event): PutResult {\n    const lookup: PutLookup = {\n      deletion: this.#deletion,\n      getById: (id) => this.#byId.get(id),\n      getReplaceable: (addr) => {\n        const id = this.#replaceable.get(addr);\n        const ev = id === undefined ? undefined : this.#byId.get(id);\n        if (ev) {\n          return { id: ev.id, created_at: ev.created_at };\n        }\n        const watermark = this.#watermarks.get(addr);\n        return watermark === undefined ? undefined : { ...watermark, evicted: true };\n      },\n    };\n    const decision = decidePut(raw, lookup);\n    if (decision.action === \"delete\") {\n      // Pending e-tag targets and coordinate tombstones never reach\n      // indexRemove — drop their watermarks here.\n      for (const p of decision.plan.pendingIds) {\n        this.#dropWatermarkId(p.id);\n      }\n      for (const c of decision.plan.coordinates) {\n        this.#dropWatermark(c.key);\n      }\n    }\n    const result = applyPutMemory(\n      {\n        deletion: this.#deletion,\n        indexInsert: (e) => this.#indexInsert(e),\n        indexRemove: (id) => this.#indexRemove(id),\n      },\n      decision,\n    );\n    this.#trimTombstones();\n    return result;\n  }\n\n  /** Sequential `put` in input order. */\n  putMany(events: ReadonlyArray<Event>): PutResult[] {\n    const results: PutResult[] = [];\n    for (const event of events) {\n      results.push(this.put(event));\n    }\n    return results;\n  }\n\n  get(id: string): Event | undefined {\n    const key = id.toLowerCase();\n    if (this.#deletion.ids.has(key)) {\n      return undefined;\n    }\n    return this.#byId.get(key);\n  }\n\n  /** Current event at a `kind:pubkey:d` coordinate (replaceable or addressable). */\n  getByAddress(address: string): Event | undefined {\n    const coord = parseEventAddress(address);\n    if (!coord) {\n      return undefined;\n    }\n    const id = this.#replaceable.get(\n      formatEventAddress(coord.kind, coord.pubkey, coord.identifier),\n    );\n    if (id === undefined) {\n      return undefined;\n    }\n    if (this.#deletion.ids.has(id)) {\n      return undefined;\n    }\n    return this.#byId.get(id);\n  }\n\n  query(filters: ReadonlyArray<Filter>): Event[] {\n    const seen = new Set<string>();\n    const events: Event[] = [];\n    for (const filter of filters) {\n      for (const event of this.#matchedEvents(filter)) {\n        if (seen.has(event.id)) {\n          continue;\n        }\n        seen.add(event.id);\n        events.push(event);\n      }\n    }\n    sortEvents(events);\n    return events;\n  }\n\n  count(filters: ReadonlyArray<Filter>): number {\n    const seen = new Set<string>();\n    for (const filter of filters) {\n      for (const event of this.#matchedEvents(filter)) {\n        seen.add(event.id);\n      }\n    }\n    return seen.size;\n  }\n\n  negentropyItems(filter: Filter): NegentropyItem[] {\n    if (filter.limit === 0) {\n      return [];\n    }\n    const items: NegentropyItem[] = [];\n    this.#eachCandidate(filter, (event) => {\n      if (this.#deletion.covers(event)) {\n        return;\n      }\n      if (!matchFilter(filter, event)) {\n        return;\n      }\n      items.push({ id: event.id, created_at: event.created_at });\n    });\n    if (filter.limit !== undefined) {\n      items.sort(compareEventsDesc);\n      if (items.length > filter.limit) {\n        items.length = filter.limit;\n      }\n    }\n    items.sort(itemCompare);\n    return items;\n  }\n\n  /** Remove by id and tombstone (like a local NIP-09). Returns removed count. */\n  remove(ids: ReadonlyArray<string>): number {\n    let n = 0;\n    for (const raw of ids) {\n      const id = raw.toLowerCase();\n      if (this.#indexRemove(id)) {\n        n += 1;\n      }\n      this.#deletion.ids.add(id);\n      this.#deletion.pending.delete(id);\n    }\n    this.#trimTombstones();\n    return n;\n  }\n\n  /**\n   * Remove by id without writing a tombstone (LRU eviction). When the evicted event is the current\n   * winner of a replaceable/addressable address, a `{ id, created_at }` watermark is recorded so\n   * stale versions stay rejected while the body is gone; the watermarks are FIFO-bounded by\n   * `maxWatermarks`.\n   */\n  evict(ids: ReadonlyArray<string>): number {\n    let n = 0;\n    for (const raw of ids) {\n      const id = raw.toLowerCase();\n      const event = this.#byId.get(id);\n      if (event === undefined) {\n        continue;\n      }\n      const addr = eventAddress(event);\n      const winner = addr !== undefined && this.#replaceable.get(addr) === id;\n      if (this.#indexRemove(id)) {\n        n += 1;\n      }\n      if (winner) {\n        this.#setWatermark(addr, { id, created_at: event.created_at });\n      }\n    }\n    return n;\n  }\n\n  /**\n   * True when the id is tombstoned, or the coordinate has a deletion marker that still covers the\n   * current event at that address: a replacement published after the marker's `until` clears the\n   * deletion. Coordinates are matched on the canonical lowercase pubkey.\n   */\n  isDeleted(idOrAddress: string): boolean {\n    if (this.#deletion.ids.has(idOrAddress.toLowerCase())) {\n      return true;\n    }\n    const coord = parseEventAddress(idOrAddress);\n    if (!coord) {\n      return false;\n    }\n    const address = formatEventAddress(coord.kind, coord.pubkey, coord.identifier);\n    const until = this.#deletion.coordinates.get(address);\n    if (until === undefined) {\n      return false;\n    }\n    const id = this.#replaceable.get(address);\n    if (id === undefined) {\n      return true;\n    }\n    const event = this.#byId.get(id);\n    return event === undefined || event.created_at <= until;\n  }\n\n  getOutboxBound(pubkey: string, kind: number): OutboxBound | undefined {\n    const persisted = this.#outboxBounds.get(outboxBoundKey(pubkey, kind));\n    if (persisted) {\n      return { oldest: persisted.oldest, newest: persisted.newest };\n    }\n    return this.#deriveOutboxBound(pubkey, kind);\n  }\n\n  setOutboxBound(pubkey: string, kind: number, bound: OutboxBound): void {\n    this.#outboxBounds.set(outboxBoundKey(pubkey, kind), {\n      oldest: bound.oldest,\n      newest: bound.newest,\n    });\n  }\n\n  clear(): void {\n    if (this.#onRemove) {\n      for (const event of this.#byId.values()) {\n        this.#onRemove(event);\n      }\n    }\n    this.#byId.clear();\n    this.#byPubkey.clear();\n    this.#byKind.clear();\n    this.#byKindPubkey.clear();\n    this.#byEpTag.clear();\n    this.#replaceable.clear();\n    this.#watermarks.clear();\n    this.#watermarkIds.clear();\n    this.#deletion.clear();\n    this.#outboxBounds.clear();\n  }\n\n  get size(): number {\n    return this.#byId.size;\n  }\n\n  #indexInsert(event: Event): void {\n    this.#byId.set(event.id, event);\n    const { pubkey } = event;\n    addToSetMap(this.#byPubkey, pubkey, event.id);\n    addToSetMap(this.#byKind, event.kind, event.id);\n    addToSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, event.id);\n    for (const tag of event.tags) {\n      if ((tag[0] !== \"e\" && tag[0] !== \"p\") || tag[1] === undefined) {\n        continue;\n      }\n      addToSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, event.id);\n    }\n    const addr = eventAddress(event);\n    if (addr !== undefined) {\n      this.#replaceable.set(addr, event.id);\n      this.#dropWatermark(addr);\n    }\n    this.#onInsert?.(event);\n  }\n\n  #indexRemove(id: string): boolean {\n    // A removed/deleted id must not keep a stale watermark alive; eviction\n    // re-records its winner watermark right after this call.\n    this.#dropWatermarkId(id);\n    const event = this.#byId.get(id);\n    if (!event) {\n      return false;\n    }\n    this.#byId.delete(id);\n    const { pubkey } = event;\n    removeFromSetMap(this.#byPubkey, pubkey, id);\n    removeFromSetMap(this.#byKind, event.kind, id);\n    removeFromSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, id);\n    for (const tag of event.tags) {\n      if ((tag[0] !== \"e\" && tag[0] !== \"p\") || tag[1] === undefined) {\n        continue;\n      }\n      removeFromSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, id);\n    }\n    const addr = eventAddress(event);\n    if (addr !== undefined && this.#replaceable.get(addr) === id) {\n      this.#replaceable.delete(addr);\n    }\n    this.#onRemove?.(event);\n    return true;\n  }\n\n  #matchedEvents(filter: Filter): Event[] {\n    if (filter.limit === 0) {\n      return [];\n    }\n    const matched: Event[] = [];\n    this.#eachCandidate(filter, (event) => {\n      if (this.#deletion.covers(event)) {\n        return;\n      }\n      if (!matchFilter(filter, event)) {\n        return;\n      }\n      matched.push(event);\n    });\n    sortEvents(matched);\n    return filter.limit === undefined ? matched : matched.slice(0, filter.limit);\n  }\n\n  #deriveOutboxBound(pubkey: string, kind: number): OutboxBound | undefined {\n    const byPk = this.#byPubkey.get(pubkey.toLowerCase());\n    const byKind = this.#byKind.get(kind);\n    if (!byPk || !byKind) {\n      return undefined;\n    }\n    let oldest: number | undefined;\n    let newest: number | undefined;\n    for (const id of byPk) {\n      if (!byKind.has(id) || this.#deletion.ids.has(id)) {\n        continue;\n      }\n      const event = this.#byId.get(id);\n      if (!event || this.#deletion.covers(event)) {\n        continue;\n      }\n      if (oldest === undefined || event.created_at < oldest) {\n        oldest = event.created_at;\n      }\n      if (newest === undefined || event.created_at > newest) {\n        newest = event.created_at;\n      }\n    }\n    if (oldest === undefined || newest === undefined) {\n      return undefined;\n    }\n    return { oldest, newest };\n  }\n\n  #eachCandidate(filter: Filter, visit: (event: Event) => void): void {\n    if (filter.ids) {\n      const seen = new Set<string>();\n      for (const raw of filter.ids) {\n        const event = this.#byId.get(raw.toLowerCase());\n        if (!event || seen.has(event.id)) {\n          continue;\n        }\n        seen.add(event.id);\n        visit(event);\n      }\n      return;\n    }\n\n    if (filter.authors && filter.kinds) {\n      const seen = new Set<string>();\n      for (const pk of filter.authors) {\n        const pubkey = pk.toLowerCase();\n        for (const kind of filter.kinds) {\n          const ids = this.#byKindPubkey.get(`${kind}:${pubkey}`);\n          if (!ids) {\n            continue;\n          }\n          for (const id of ids) {\n            if (seen.has(id)) {\n              continue;\n            }\n            seen.add(id);\n            const event = this.#byId.get(id);\n            if (event) {\n              visit(event);\n            }\n          }\n        }\n      }\n      return;\n    }\n\n    if (filter.authors) {\n      const seen = new Set<string>();\n      for (const pk of filter.authors) {\n        const byPk = this.#byPubkey.get(pk.toLowerCase());\n        if (!byPk) {\n          continue;\n        }\n        for (const id of byPk) {\n          if (seen.has(id)) {\n            continue;\n          }\n          seen.add(id);\n          const event = this.#byId.get(id);\n          if (event) {\n            visit(event);\n          }\n        }\n      }\n      return;\n    }\n\n    if (filter.kinds) {\n      const seen = new Set<string>();\n      for (const kind of filter.kinds) {\n        const byKind = this.#byKind.get(kind);\n        if (!byKind) {\n          continue;\n        }\n        for (const id of byKind) {\n          if (seen.has(id)) {\n            continue;\n          }\n          seen.add(id);\n          const event = this.#byId.get(id);\n          if (event) {\n            visit(event);\n          }\n        }\n      }\n      return;\n    }\n\n    const eTags = filter[\"#e\"];\n    const pTags = filter[\"#p\"];\n    if (eTags !== undefined || pTags !== undefined) {\n      const seen = new Set<string>();\n      visitEpTagIds(this.#byEpTag, this.#byId, \"e\", eTags, seen, visit);\n      visitEpTagIds(this.#byEpTag, this.#byId, \"p\", pTags, seen, visit);\n      return;\n    }\n\n    // #t/#d and other non-e/p tags are not indexed (e/p only). A generic tag\n    // store is extra put/remove amp; hashtag-only queries scan #byId.\n    for (const event of this.#byId.values()) {\n      visit(event);\n    }\n  }\n\n  #setWatermark(addr: string, watermark: { id: string; created_at: number }): void {\n    if (this.#maxWatermarks === 0) {\n      return;\n    }\n    this.#dropWatermark(addr);\n    this.#watermarks.set(addr, watermark);\n    this.#watermarkIds.set(watermark.id, addr);\n    trimOldest(this.#watermarks, this.#maxWatermarks, (a) => this.#dropWatermark(a));\n  }\n\n  #dropWatermark(addr: string): void {\n    const watermark = this.#watermarks.get(addr);\n    if (watermark === undefined) {\n      return;\n    }\n    this.#watermarks.delete(addr);\n    this.#watermarkIds.delete(watermark.id);\n  }\n\n  #dropWatermarkId(id: string): void {\n    const addr = this.#watermarkIds.get(id);\n    if (addr === undefined) {\n      return;\n    }\n    this.#watermarkIds.delete(id);\n    this.#watermarks.delete(addr);\n  }\n\n  #trimTombstones(): void {\n    const cap = this.#maxTombstones;\n    if (cap === undefined) {\n      return;\n    }\n    trimOldest(this.#deletion.ids, cap, (id) => {\n      this.#deletion.pending.delete(id);\n    });\n    trimOldest(this.#deletion.pending, cap);\n    trimOldest(this.#deletion.coordinates, cap);\n  }\n}\n\nfunction visitEpTagIds(\n  byEpTag: Map<string, Set<string>>,\n  byId: Map<string, Event>,\n  name: \"e\" | \"p\",\n  values: ReadonlyArray<string> | undefined,\n  seen: Set<string>,\n  visit: (event: Event) => void,\n): void {\n  if (values === undefined) {\n    return;\n  }\n  for (const value of values) {\n    const ids = byEpTag.get(`${name}:${value.toLowerCase()}`);\n    if (!ids) {\n      continue;\n    }\n    for (const id of ids) {\n      if (seen.has(id)) {\n        continue;\n      }\n      seen.add(id);\n      const event = byId.get(id);\n      if (event) {\n        visit(event);\n      }\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;AAqCA,IAAa,cAAb,MAAyB;CACvB,wBAAiB,IAAI,IAAmB;CACxC,4BAAqB,IAAI,IAAyB;CAClD,0BAAmB,IAAI,IAAyB;CAChD,gCAAyB,IAAI,IAAyB;CACtD,2BAAoB,IAAI,IAAyB;CACjD,+BAAwB,IAAI,IAAoB;CAEhD,8BAAuB,IAAI,IAAgD;CAE3E,gCAAyB,IAAI,IAAoB;CACjD,YAAqB,IAAI,cAAc;CACvC,gCAAyB,IAAI,IAAyB;CACtD;CACA;CACA;CACA;CAEA,YAAY,MAA2B;EACrC,KAAK,iBAAiB,MAAM;EAC5B,KAAK,iBAAiB,MAAM,iBAAiB;EAC7C,KAAK,YAAY,MAAM;EACvB,KAAK,YAAY,MAAM;CACzB;CAEA,IAAI,KAAuB;EACzB,MAAM,SAAoB;GACxB,UAAU,KAAK;GACf,UAAU,OAAO,KAAK,MAAM,IAAI,EAAE;GAClC,iBAAiB,SAAS;IACxB,MAAM,KAAK,KAAK,aAAa,IAAI,IAAI;IACrC,MAAM,KAAK,OAAO,KAAA,IAAY,KAAA,IAAY,KAAK,MAAM,IAAI,EAAE;IAC3D,IAAI,IACF,OAAO;KAAE,IAAI,GAAG;KAAI,YAAY,GAAG;IAAW;IAEhD,MAAM,YAAY,KAAK,YAAY,IAAI,IAAI;IAC3C,OAAO,cAAc,KAAA,IAAY,KAAA,IAAY;KAAE,GAAG;KAAW,SAAS;IAAK;GAC7E;EACF;EACA,MAAM,WAAW,UAAU,KAAK,MAAM;EACtC,IAAI,SAAS,WAAW,UAAU;GAGhC,KAAK,MAAM,KAAK,SAAS,KAAK,YAC5B,KAAK,iBAAiB,EAAE,EAAE;GAE5B,KAAK,MAAM,KAAK,SAAS,KAAK,aAC5B,KAAK,eAAe,EAAE,GAAG;EAE7B;EACA,MAAM,SAAS,eACb;GACE,UAAU,KAAK;GACf,cAAc,MAAM,KAAK,aAAa,CAAC;GACvC,cAAc,OAAO,KAAK,aAAa,EAAE;EAC3C,GACA,QACF;EACA,KAAK,gBAAgB;EACrB,OAAO;CACT;;CAGA,QAAQ,QAA2C;EACjD,MAAM,UAAuB,CAAC;EAC9B,KAAK,MAAM,SAAS,QAClB,QAAQ,KAAK,KAAK,IAAI,KAAK,CAAC;EAE9B,OAAO;CACT;CAEA,IAAI,IAA+B;EACjC,MAAM,MAAM,GAAG,YAAY;EAC3B,IAAI,KAAK,UAAU,IAAI,IAAI,GAAG,GAC5B;EAEF,OAAO,KAAK,MAAM,IAAI,GAAG;CAC3B;;CAGA,aAAa,SAAoC;EAC/C,MAAM,QAAQ,kBAAkB,OAAO;EACvC,IAAI,CAAC,OACH;EAEF,MAAM,KAAK,KAAK,aAAa,IAC3B,mBAAmB,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU,CAC/D;EACA,IAAI,OAAO,KAAA,GACT;EAEF,IAAI,KAAK,UAAU,IAAI,IAAI,EAAE,GAC3B;EAEF,OAAO,KAAK,MAAM,IAAI,EAAE;CAC1B;CAEA,MAAM,SAAyC;EAC7C,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,SAAkB,CAAC;EACzB,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,SAAS,KAAK,eAAe,MAAM,GAAG;GAC/C,IAAI,KAAK,IAAI,MAAM,EAAE,GACnB;GAEF,KAAK,IAAI,MAAM,EAAE;GACjB,OAAO,KAAK,KAAK;EACnB;EAEF,WAAW,MAAM;EACjB,OAAO;CACT;CAEA,MAAM,SAAwC;EAC5C,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,SAAS,KAAK,eAAe,MAAM,GAC5C,KAAK,IAAI,MAAM,EAAE;EAGrB,OAAO,KAAK;CACd;CAEA,gBAAgB,QAAkC;EAChD,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC;EAEV,MAAM,QAA0B,CAAC;EACjC,KAAK,eAAe,SAAS,UAAU;GACrC,IAAI,KAAK,UAAU,OAAO,KAAK,GAC7B;GAEF,IAAI,CAAC,YAAY,QAAQ,KAAK,GAC5B;GAEF,MAAM,KAAK;IAAE,IAAI,MAAM;IAAI,YAAY,MAAM;GAAW,CAAC;EAC3D,CAAC;EACD,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,KAAK,iBAAiB;GAC5B,IAAI,MAAM,SAAS,OAAO,OACxB,MAAM,SAAS,OAAO;EAE1B;EACA,MAAM,KAAK,WAAW;EACtB,OAAO;CACT;;CAGA,OAAO,KAAoC;EACzC,IAAI,IAAI;EACR,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,KAAK,IAAI,YAAY;GAC3B,IAAI,KAAK,aAAa,EAAE,GACtB,KAAK;GAEP,KAAK,UAAU,IAAI,IAAI,EAAE;GACzB,KAAK,UAAU,QAAQ,OAAO,EAAE;EAClC;EACA,KAAK,gBAAgB;EACrB,OAAO;CACT;;;;;;;CAQA,MAAM,KAAoC;EACxC,IAAI,IAAI;EACR,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,KAAK,IAAI,YAAY;GAC3B,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;GAC/B,IAAI,UAAU,KAAA,GACZ;GAEF,MAAM,OAAO,aAAa,KAAK;GAC/B,MAAM,SAAS,SAAS,KAAA,KAAa,KAAK,aAAa,IAAI,IAAI,MAAM;GACrE,IAAI,KAAK,aAAa,EAAE,GACtB,KAAK;GAEP,IAAI,QACF,KAAK,cAAc,MAAM;IAAE;IAAI,YAAY,MAAM;GAAW,CAAC;EAEjE;EACA,OAAO;CACT;;;;;;CAOA,UAAU,aAA8B;EACtC,IAAI,KAAK,UAAU,IAAI,IAAI,YAAY,YAAY,CAAC,GAClD,OAAO;EAET,MAAM,QAAQ,kBAAkB,WAAW;EAC3C,IAAI,CAAC,OACH,OAAO;EAET,MAAM,UAAU,mBAAmB,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;EAC7E,MAAM,QAAQ,KAAK,UAAU,YAAY,IAAI,OAAO;EACpD,IAAI,UAAU,KAAA,GACZ,OAAO;EAET,MAAM,KAAK,KAAK,aAAa,IAAI,OAAO;EACxC,IAAI,OAAO,KAAA,GACT,OAAO;EAET,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;EAC/B,OAAO,UAAU,KAAA,KAAa,MAAM,cAAc;CACpD;CAEA,eAAe,QAAgB,MAAuC;EACpE,MAAM,YAAY,KAAK,cAAc,IAAI,eAAe,QAAQ,IAAI,CAAC;EACrE,IAAI,WACF,OAAO;GAAE,QAAQ,UAAU;GAAQ,QAAQ,UAAU;EAAO;EAE9D,OAAO,KAAK,mBAAmB,QAAQ,IAAI;CAC7C;CAEA,eAAe,QAAgB,MAAc,OAA0B;EACrE,KAAK,cAAc,IAAI,eAAe,QAAQ,IAAI,GAAG;GACnD,QAAQ,MAAM;GACd,QAAQ,MAAM;EAChB,CAAC;CACH;CAEA,QAAc;EACZ,IAAI,KAAK,WACP,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,GACpC,KAAK,UAAU,KAAK;EAGxB,KAAK,MAAM,MAAM;EACjB,KAAK,UAAU,MAAM;EACrB,KAAK,QAAQ,MAAM;EACnB,KAAK,cAAc,MAAM;EACzB,KAAK,SAAS,MAAM;EACpB,KAAK,aAAa,MAAM;EACxB,KAAK,YAAY,MAAM;EACvB,KAAK,cAAc,MAAM;EACzB,KAAK,UAAU,MAAM;EACrB,KAAK,cAAc,MAAM;CAC3B;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;CAEA,aAAa,OAAoB;EAC/B,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK;EAC9B,MAAM,EAAE,WAAW;EACnB,YAAY,KAAK,WAAW,QAAQ,MAAM,EAAE;EAC5C,YAAY,KAAK,SAAS,MAAM,MAAM,MAAM,EAAE;EAC9C,YAAY,KAAK,eAAe,GAAG,MAAM,KAAK,GAAG,UAAU,MAAM,EAAE;EACnE,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAK,IAAI,OAAO,OAAO,IAAI,OAAO,OAAQ,IAAI,OAAO,KAAA,GACnD;GAEF,YAAY,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,YAAY,KAAK,MAAM,EAAE;EAC1E;EACA,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,GAAW;GACtB,KAAK,aAAa,IAAI,MAAM,MAAM,EAAE;GACpC,KAAK,eAAe,IAAI;EAC1B;EACA,KAAK,YAAY,KAAK;CACxB;CAEA,aAAa,IAAqB;EAGhC,KAAK,iBAAiB,EAAE;EACxB,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;EAC/B,IAAI,CAAC,OACH,OAAO;EAET,KAAK,MAAM,OAAO,EAAE;EACpB,MAAM,EAAE,WAAW;EACnB,iBAAiB,KAAK,WAAW,QAAQ,EAAE;EAC3C,iBAAiB,KAAK,SAAS,MAAM,MAAM,EAAE;EAC7C,iBAAiB,KAAK,eAAe,GAAG,MAAM,KAAK,GAAG,UAAU,EAAE;EAClE,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAK,IAAI,OAAO,OAAO,IAAI,OAAO,OAAQ,IAAI,OAAO,KAAA,GACnD;GAEF,iBAAiB,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,YAAY,KAAK,EAAE;EACzE;EACA,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,KAAa,KAAK,aAAa,IAAI,IAAI,MAAM,IACxD,KAAK,aAAa,OAAO,IAAI;EAE/B,KAAK,YAAY,KAAK;EACtB,OAAO;CACT;CAEA,eAAe,QAAyB;EACtC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC;EAEV,MAAM,UAAmB,CAAC;EAC1B,KAAK,eAAe,SAAS,UAAU;GACrC,IAAI,KAAK,UAAU,OAAO,KAAK,GAC7B;GAEF,IAAI,CAAC,YAAY,QAAQ,KAAK,GAC5B;GAEF,QAAQ,KAAK,KAAK;EACpB,CAAC;EACD,WAAW,OAAO;EAClB,OAAO,OAAO,UAAU,KAAA,IAAY,UAAU,QAAQ,MAAM,GAAG,OAAO,KAAK;CAC7E;CAEA,mBAAmB,QAAgB,MAAuC;EACxE,MAAM,OAAO,KAAK,UAAU,IAAI,OAAO,YAAY,CAAC;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;EACpC,IAAI,CAAC,QAAQ,CAAC,QACZ;EAEF,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,MAAM,MAAM;GACrB,IAAI,CAAC,OAAO,IAAI,EAAE,KAAK,KAAK,UAAU,IAAI,IAAI,EAAE,GAC9C;GAEF,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;GAC/B,IAAI,CAAC,SAAS,KAAK,UAAU,OAAO,KAAK,GACvC;GAEF,IAAI,WAAW,KAAA,KAAa,MAAM,aAAa,QAC7C,SAAS,MAAM;GAEjB,IAAI,WAAW,KAAA,KAAa,MAAM,aAAa,QAC7C,SAAS,MAAM;EAEnB;EACA,IAAI,WAAW,KAAA,KAAa,WAAW,KAAA,GACrC;EAEF,OAAO;GAAE;GAAQ;EAAO;CAC1B;CAEA,eAAe,QAAgB,OAAqC;EAClE,IAAI,OAAO,KAAK;GACd,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,OAAO,OAAO,KAAK;IAC5B,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC;IAC9C,IAAI,CAAC,SAAS,KAAK,IAAI,MAAM,EAAE,GAC7B;IAEF,KAAK,IAAI,MAAM,EAAE;IACjB,MAAM,KAAK;GACb;GACA;EACF;EAEA,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,OAAO,SAAS;IAC/B,MAAM,SAAS,GAAG,YAAY;IAC9B,KAAK,MAAM,QAAQ,OAAO,OAAO;KAC/B,MAAM,MAAM,KAAK,cAAc,IAAI,GAAG,KAAK,GAAG,QAAQ;KACtD,IAAI,CAAC,KACH;KAEF,KAAK,MAAM,MAAM,KAAK;MACpB,IAAI,KAAK,IAAI,EAAE,GACb;MAEF,KAAK,IAAI,EAAE;MACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;MAC/B,IAAI,OACF,MAAM,KAAK;KAEf;IACF;GACF;GACA;EACF;EAEA,IAAI,OAAO,SAAS;GAClB,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,OAAO,SAAS;IAC/B,MAAM,OAAO,KAAK,UAAU,IAAI,GAAG,YAAY,CAAC;IAChD,IAAI,CAAC,MACH;IAEF,KAAK,MAAM,MAAM,MAAM;KACrB,IAAI,KAAK,IAAI,EAAE,GACb;KAEF,KAAK,IAAI,EAAE;KACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OACF,MAAM,KAAK;IAEf;GACF;GACA;EACF;EAEA,IAAI,OAAO,OAAO;GAChB,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,QAAQ,OAAO,OAAO;IAC/B,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;IACpC,IAAI,CAAC,QACH;IAEF,KAAK,MAAM,MAAM,QAAQ;KACvB,IAAI,KAAK,IAAI,EAAE,GACb;KAEF,KAAK,IAAI,EAAE;KACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OACF,MAAM,KAAK;IAEf;GACF;GACA;EACF;EAEA,MAAM,QAAQ,OAAO;EACrB,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,KAAA,KAAa,UAAU,KAAA,GAAW;GAC9C,MAAM,uBAAO,IAAI,IAAY;GAC7B,cAAc,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK;GAChE,cAAc,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK;GAChE;EACF;EAIA,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,GACpC,MAAM,KAAK;CAEf;CAEA,cAAc,MAAc,WAAqD;EAC/E,IAAI,KAAK,mBAAmB,GAC1B;EAEF,KAAK,eAAe,IAAI;EACxB,KAAK,YAAY,IAAI,MAAM,SAAS;EACpC,KAAK,cAAc,IAAI,UAAU,IAAI,IAAI;EACzC,WAAW,KAAK,aAAa,KAAK,iBAAiB,MAAM,KAAK,eAAe,CAAC,CAAC;CACjF;CAEA,eAAe,MAAoB;EACjC,MAAM,YAAY,KAAK,YAAY,IAAI,IAAI;EAC3C,IAAI,cAAc,KAAA,GAChB;EAEF,KAAK,YAAY,OAAO,IAAI;EAC5B,KAAK,cAAc,OAAO,UAAU,EAAE;CACxC;CAEA,iBAAiB,IAAkB;EACjC,MAAM,OAAO,KAAK,cAAc,IAAI,EAAE;EACtC,IAAI,SAAS,KAAA,GACX;EAEF,KAAK,cAAc,OAAO,EAAE;EAC5B,KAAK,YAAY,OAAO,IAAI;CAC9B;CAEA,kBAAwB;EACtB,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,GACV;EAEF,WAAW,KAAK,UAAU,KAAK,MAAM,OAAO;GAC1C,KAAK,UAAU,QAAQ,OAAO,EAAE;EAClC,CAAC;EACD,WAAW,KAAK,UAAU,SAAS,GAAG;EACtC,WAAW,KAAK,UAAU,aAAa,GAAG;CAC5C;AACF;AAEA,SAAS,cACP,SACA,MACA,MACA,QACA,MACA,OACM;CACN,IAAI,WAAW,KAAA,GACb;CAEF,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,MAAM,QAAQ,IAAI,GAAG,KAAK,GAAG,MAAM,YAAY,GAAG;EACxD,IAAI,CAAC,KACH;EAEF,KAAK,MAAM,MAAM,KAAK;GACpB,IAAI,KAAK,IAAI,EAAE,GACb;GAEF,KAAK,IAAI,EAAE;GACX,MAAM,QAAQ,KAAK,IAAI,EAAE;GACzB,IAAI,OACF,MAAM,KAAK;EAEf;CACF;AACF"}

package/dist/{message-Rd5Z_17h.mjs → message-pYfVKxPn.mjs}

@@ -1,9 +1,12 @@
-import { _ as MessageError, a as hexToBytes, c as isRecord, i as bytesToHex } from "./util-DMF9AIO0.mjs";
-import { h as validateSignedEvent } from "./event-C2eLiPpV.mjs";
+import { i as bytesToHex, l as isRecord, o as hexToBytes, v as MessageError } from "./util-DDpPkiED.mjs";
+import { h as validateSignedEvent } from "./event-B3ua2_oL.mjs";
+import { n as canonicalizeFilters, t as canonicalizeFilter } from "./filter-B16P33dz.mjs";
 //#region src/core/message.ts
-/** Validate a subscription id; throws {@link MessageError} unless 1..64 chars. */
+/** Validate a subscription id; throws {@link MessageError} unless 1..64 Unicode scalar values. */
 function assertSubscriptionId(id) {
-	if (id.length === 0 || id.length > 64) throw new MessageError(`subscription id length must be 1..64`);
+	let length = 0;
+	for (const _ of id) length += 1;
+	if (length === 0 || length > 64) throw new MessageError(`subscription id length must be 1..64`);
 	return id;
 }
 /** Validate the given id, or mint a random 16-hex-char subscription id. */
@@ -34,7 +37,24 @@ function mergeCountHll(hexes) {
 }
 /** Serialize a client->relay message to its NIP-01 JSON wire form. */
 function encodeClientMessage(message) {
-	return JSON.stringify(message);
+	switch (message[0]) {
+		case "REQ":
+		case "COUNT": {
+			const [type, id, ...filters] = message;
+			return JSON.stringify([
+				type,
+				id,
+				...canonicalizeFilters(filters)
+			]);
+		}
+		case "NEG-OPEN": return JSON.stringify([
+			"NEG-OPEN",
+			message[1],
+			canonicalizeFilter(message[2]),
+			message[3]
+		]);
+		default: return JSON.stringify(message);
+	}
 }
 /** Serialize a relay->client message to its NIP-01 JSON wire form. */
 function encodeRelayMessage(message) {
@@ -59,12 +79,12 @@ function parseClientMessage(raw) {
 			if (items.length < 3 || typeof items[1] !== "string") throw new MessageError("invalid REQ client message");
 			return [
 				"REQ",
-				items[1],
+				assertSubscriptionId(items[1]),
 				...parseWireFilters(items.slice(2), "REQ")
 			];
 		case "CLOSE":
 			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid CLOSE client message");
-			return ["CLOSE", items[1]];
+			return ["CLOSE", assertSubscriptionId(items[1])];
 		case "AUTH":
 			if (items.length !== 2 || !validateSignedEvent(items[1])) throw new MessageError("invalid AUTH client message");
 			return ["AUTH", items[1]];
@@ -72,28 +92,28 @@ function parseClientMessage(raw) {
 			if (items.length < 3 || typeof items[1] !== "string") throw new MessageError("invalid COUNT client message");
 			return [
 				"COUNT",
-				items[1],
+				assertSubscriptionId(items[1]),
 				...parseWireFilters(items.slice(2), "COUNT")
 			];
 		case "NEG-OPEN":
 			if (items.length === 5) throw new MessageError("obsolete 5-element NEG-OPEN; expected [NEG-OPEN, id, filter, hex]");
-			if (items.length !== 4 || typeof items[1] !== "string" || !isWireFilter(items[2]) || !isNegHex(items[3])) throw new MessageError("invalid NEG-OPEN client message");
+			if (items.length !== 4 || typeof items[1] !== "string" || !isRecord(items[2]) || !isNegHex(items[3])) throw new MessageError("invalid NEG-OPEN client message");
 			return [
 				"NEG-OPEN",
-				items[1],
-				items[2],
+				assertSubscriptionId(items[1]),
+				parseWireFilter(items[2], "NEG-OPEN"),
 				items[3].toLowerCase()
 			];
 		case "NEG-MSG":
 			if (items.length !== 3 || typeof items[1] !== "string" || !isNegHex(items[2])) throw new MessageError("invalid NEG-MSG client message");
 			return [
 				"NEG-MSG",
-				items[1],
+				assertSubscriptionId(items[1]),
 				items[2].toLowerCase()
 			];
 		case "NEG-CLOSE":
 			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid NEG-CLOSE client message");
-			return ["NEG-CLOSE", items[1]];
+			return ["NEG-CLOSE", assertSubscriptionId(items[1])];
 		default: throw new MessageError(`unknown client message type: ${String(type)}`);
 	}
 }
@@ -113,11 +133,11 @@ function parseRelayMessage(raw) {
 			if (items.length !== 3 || typeof items[1] !== "string" || !validateSignedEvent(items[2])) throw new MessageError("invalid EVENT relay message");
 			return [
 				"EVENT",
-				items[1],
+				assertSubscriptionId(items[1]),
 				items[2]
 			];
 		case "OK":
-			if (items.length !== 4 || typeof items[1] !== "string" || typeof items[2] !== "boolean" || typeof items[3] !== "string") throw new MessageError("invalid OK relay message");
+			if (items.length !== 4 || typeof items[1] !== "string" || !HEX64_LOWER_RE.test(items[1]) || typeof items[2] !== "boolean" || typeof items[3] !== "string") throw new MessageError("invalid OK relay message");
 			return [
 				"OK",
 				items[1],
@@ -126,12 +146,12 @@ function parseRelayMessage(raw) {
 			];
 		case "EOSE":
 			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid EOSE relay message");
-			return ["EOSE", items[1]];
+			return ["EOSE", assertSubscriptionId(items[1])];
 		case "CLOSED":
 			if (items.length !== 3 || typeof items[1] !== "string" || typeof items[2] !== "string") throw new MessageError("invalid CLOSED relay message");
 			return [
 				"CLOSED",
-				items[1],
+				assertSubscriptionId(items[1]),
 				items[2]
 			];
 		case "NOTICE":
@@ -150,7 +170,7 @@ function parseRelayMessage(raw) {
 			if (hll !== void 0) result.hll = hll;
 			return [
 				"COUNT",
-				items[1],
+				assertSubscriptionId(items[1]),
 				result
 			];
 		}
@@ -158,14 +178,14 @@ function parseRelayMessage(raw) {
 			if (items.length !== 3 || typeof items[1] !== "string" || !isNegHex(items[2])) throw new MessageError("invalid NEG-MSG relay message");
 			return [
 				"NEG-MSG",
-				items[1],
+				assertSubscriptionId(items[1]),
 				items[2].toLowerCase()
 			];
 		case "NEG-ERR":
 			if (items.length !== 3 && items.length !== 4 || typeof items[1] !== "string" || typeof items[2] !== "string") throw new MessageError("invalid NEG-ERR relay message");
 			return [
 				"NEG-ERR",
-				items[1],
+				assertSubscriptionId(items[1]),
 				items[2]
 			];
 		default: throw new MessageError(`unknown relay message type: ${String(type)}`);
@@ -175,16 +195,41 @@ function parseCountHll(value) {
 	if (typeof value !== "string" || value.length !== HLL_HEX_LEN || !HEX_RE.test(value)) return;
 	return value.toLowerCase();
 }
-function isWireFilter(value) {
-	return isRecord(value);
+const HEX64_RE = /^[0-9a-fA-F]{64}$/;
+const HEX64_LOWER_RE = /^[0-9a-f]{64}$/;
+/**
+* Validates a wire filter per NIP-01: `ids`/`authors` are 64-hex arrays (normalized lowercase),
+* `kinds` are integers in 0..=65535, `since`/`until`/`limit` non-negative integers, `search` a
+* string, and `#<single letter>` arrays of strings (`#e`/`#p` lowercased). Multi-letter `#` keys
+* and unknown non-`#` keys are dropped; wrong types throw {@link MessageError}. Duplicate keys and
+* integer spellings (`1e3`, `1.0`, `-0`) need no handling: `JSON.parse` already applied last-wins
+* and normalized the numbers before this runs (nk-core's map visitors mirror that, NK-ADR-012).
+*/
+function parseWireFilter(value, kind) {
+	if (!isRecord(value)) throw new MessageError(`invalid ${kind} filter`);
+	const fail = () => new MessageError(`invalid ${kind} filter`);
+	const out = {};
+	for (const [key, v] of Object.entries(value)) if (key.startsWith("#")) {
+		if (!/^#[a-zA-Z]$/.test(key)) continue;
+		if (!Array.isArray(v) || !v.every((x) => typeof x === "string")) throw fail();
+		out[`#${key.slice(1)}`] = key === "#e" || key === "#p" ? v.map((x) => x.toLowerCase()) : v;
+	} else if (key === "ids" || key === "authors") {
+		if (!Array.isArray(v) || !v.every((x) => typeof x === "string" && HEX64_RE.test(x))) throw fail();
+		out[key] = v.map((x) => x.toLowerCase());
+	} else if (key === "kinds") {
+		if (!Array.isArray(v) || !v.every((x) => typeof x === "number" && Number.isSafeInteger(x) && x >= 0 && x <= 65535)) throw fail();
+		out.kinds = v;
+	} else if (key === "since" || key === "until" || key === "limit") {
+		if (typeof v !== "number" || !Number.isSafeInteger(v) || v < 0) throw fail();
+		out[key] = v;
+	} else if (key === "search") {
+		if (typeof v !== "string") throw fail();
+		out.search = v;
+	}
+	return out;
 }
 function parseWireFilters(items, kind) {
-	const filters = [];
-	for (const item of items) {
-		if (!isWireFilter(item)) throw new MessageError(`invalid ${kind} filter`);
-		filters.push(item);
-	}
-	return filters;
+	return items.map((item) => parseWireFilter(item, kind));
 }
 function isNegHex(value) {
 	return typeof value === "string" && value.length > 0 && value.length % 2 === 0 && HEX_RE.test(value);
@@ -192,4 +237,4 @@ function isNegHex(value) {
 //#endregion
 export { mergeCountHll as a, encodeRelayMessage as i, createSubscriptionId as n, parseClientMessage as o, encodeClientMessage as r, parseRelayMessage as s, assertSubscriptionId as t };
 
-//# sourceMappingURL=message-Rd5Z_17h.mjs.map
+//# sourceMappingURL=message-pYfVKxPn.mjs.map

package/dist/message-pYfVKxPn.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"message-pYfVKxPn.mjs","names":[],"sources":["../src/core/message.ts"],"sourcesContent":["import { MessageError } from \"./error.ts\";\nimport type { Event } from \"./event.ts\";\nimport { validateSignedEvent } from \"./event.ts\";\nimport { canonicalizeFilter, canonicalizeFilters } from \"./filter.ts\";\nimport type { Filter } from \"./filter.ts\";\nimport { SUBSCRIPTION_ID_MAX_CHARS } from \"./limits.ts\";\nimport type { Mutable } from \"./util.ts\";\nimport { bytesToHex, hexToBytes, isRecord } from \"./util.ts\";\n\n/** NIP-01 subscription id: 1..64 chars. */\nexport type SubscriptionId = string;\n\n/** Validate a subscription id; throws {@link MessageError} unless 1..64 Unicode scalar values. */\nexport function assertSubscriptionId(id: string): SubscriptionId {\n  // Iterating a string yields code points, so astral chars count once (NIP-01's \"chars\").\n  let length = 0;\n  for (const _ of id) {\n    length += 1;\n  }\n  if (length === 0 || length > SUBSCRIPTION_ID_MAX_CHARS) {\n    throw new MessageError(`subscription id length must be 1..${SUBSCRIPTION_ID_MAX_CHARS}`);\n  }\n  return id;\n}\n\n/** Validate the given id, or mint a random 16-hex-char subscription id. */\nexport function createSubscriptionId(id?: string): SubscriptionId {\n  if (id !== undefined) {\n    return assertSubscriptionId(id);\n  }\n  const bytes = new Uint8Array(8);\n  crypto.getRandomValues(bytes);\n  return bytesToHex(bytes);\n}\n\n/** Client → relay messages (NIP-01 + NIP-42 AUTH + NIP-45 COUNT + NIP-77). */\nexport type ClientMessage =\n  | [\"EVENT\", Event]\n  | [\"REQ\", SubscriptionId, ...Filter[]]\n  | [\"CLOSE\", SubscriptionId]\n  | [\"AUTH\", Event]\n  | [\"COUNT\", SubscriptionId, ...Filter[]]\n  | [\"NEG-OPEN\", SubscriptionId, Filter, string]\n  | [\"NEG-MSG\", SubscriptionId, string]\n  | [\"NEG-CLOSE\", SubscriptionId];\n\n/** Relay → client messages. */\nexport type RelayMessage =\n  | [\"EVENT\", SubscriptionId, Event]\n  | [\"OK\", string, boolean, string]\n  | [\"EOSE\", SubscriptionId]\n  | [\"CLOSED\", SubscriptionId, string]\n  | [\"NOTICE\", string]\n  | [\"AUTH\", string]\n  | [\"COUNT\", SubscriptionId, CountResult]\n  | [\"NEG-MSG\", SubscriptionId, string]\n  | [\"NEG-ERR\", SubscriptionId, string];\n\n/** NIP-45 COUNT reply payload. */\nexport type CountResult = {\n  readonly count: number;\n  readonly approximate?: boolean | undefined;\n  /**\n   * Optional 512-char hex HyperLogLog sketch (256 registers). Merge sketches with `mergeCountHll`.\n   * Estimation is unspecified by NIP-45 and not provided.\n   */\n  readonly hll?: string | undefined;\n};\n\nconst HLL_BYTES = 256; // 512 hex chars (NIP-45; hex only, not base64)\nconst HLL_HEX_LEN = HLL_BYTES * 2;\nconst HEX_RE = /^[0-9a-fA-F]+$/;\n\n/**\n * Register-wise max of NIP-45 HyperLogLog sketches. Output is always lowercase 512 hex. Empty input\n * is the zero sketch (identity).\n */\nexport function mergeCountHll(hexes: ReadonlyArray<string>): string {\n  const merged = new Uint8Array(HLL_BYTES);\n  for (const hex of hexes) {\n    if (hex.length !== HLL_HEX_LEN || !HEX_RE.test(hex)) {\n      throw new MessageError(\"invalid NIP-45 HLL sketch: expected 512-char hex\");\n    }\n    const bytes = hexToBytes(hex);\n    for (const [i, b] of bytes.entries()) {\n      const m = merged[i];\n      if (m !== undefined && b > m) {\n        merged[i] = b;\n      }\n    }\n  }\n  return bytesToHex(merged);\n}\n\n/** Serialize a client->relay message to its NIP-01 JSON wire form. */\nexport function encodeClientMessage(message: ClientMessage): string {\n  // REQ/COUNT/NEG-OPEN filters are canonicalized so the wire form matches nk-core.\n  switch (message[0]) {\n    case \"REQ\":\n    case \"COUNT\": {\n      const [type, id, ...filters] = message;\n      return JSON.stringify([type, id, ...canonicalizeFilters(filters)]);\n    }\n    case \"NEG-OPEN\":\n      return JSON.stringify([\"NEG-OPEN\", message[1], canonicalizeFilter(message[2]), message[3]]);\n    default:\n      return JSON.stringify(message);\n  }\n}\n\n/** Serialize a relay->client message to its NIP-01 JSON wire form. */\nexport function encodeRelayMessage(message: RelayMessage): string {\n  return JSON.stringify(message);\n}\n\n/** Parse a client->relay JSON message; throws {@link MessageError} on malformed input. */\nexport function parseClientMessage(raw: string): ClientMessage {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch {\n    throw new MessageError(\"client message is not valid JSON\");\n  }\n  if (!Array.isArray(parsed) || parsed.length === 0 || typeof parsed[0] !== \"string\") {\n    throw new MessageError(\"client message must be a non-empty JSON array\");\n  }\n  const items: unknown[] = parsed;\n  const [type] = items;\n  switch (type) {\n    case \"EVENT\":\n      if (items.length !== 2 || !validateSignedEvent(items[1])) {\n        throw new MessageError(\"invalid EVENT client message\");\n      }\n      return [\"EVENT\", items[1]];\n\n    case \"REQ\":\n      if (items.length < 3 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid REQ client message\");\n      }\n      return [\"REQ\", assertSubscriptionId(items[1]), ...parseWireFilters(items.slice(2), \"REQ\")];\n\n    case \"CLOSE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid CLOSE client message\");\n      }\n      return [\"CLOSE\", assertSubscriptionId(items[1])];\n\n    case \"AUTH\":\n      if (items.length !== 2 || !validateSignedEvent(items[1])) {\n        throw new MessageError(\"invalid AUTH client message\");\n      }\n      return [\"AUTH\", items[1]];\n\n    case \"COUNT\":\n      if (items.length < 3 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid COUNT client message\");\n      }\n      return [\n        \"COUNT\",\n        assertSubscriptionId(items[1]),\n        ...parseWireFilters(items.slice(2), \"COUNT\"),\n      ];\n\n    case \"NEG-OPEN\":\n      if (items.length === 5) {\n        throw new MessageError(\"obsolete 5-element NEG-OPEN; expected [NEG-OPEN, id, filter, hex]\");\n      }\n      if (\n        items.length !== 4 ||\n        typeof items[1] !== \"string\" ||\n        !isRecord(items[2]) ||\n        !isNegHex(items[3])\n      ) {\n        throw new MessageError(\"invalid NEG-OPEN client message\");\n      }\n      return [\n        \"NEG-OPEN\",\n        assertSubscriptionId(items[1]),\n        parseWireFilter(items[2], \"NEG-OPEN\"),\n        items[3].toLowerCase(),\n      ];\n\n    case \"NEG-MSG\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || !isNegHex(items[2])) {\n        throw new MessageError(\"invalid NEG-MSG client message\");\n      }\n      return [\"NEG-MSG\", assertSubscriptionId(items[1]), items[2].toLowerCase()];\n\n    case \"NEG-CLOSE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid NEG-CLOSE client message\");\n      }\n      return [\"NEG-CLOSE\", assertSubscriptionId(items[1])];\n\n    default:\n      throw new MessageError(`unknown client message type: ${String(type)}`);\n  }\n}\n\n/** Parse a relay->client JSON message; throws {@link MessageError} on malformed input. */\nexport function parseRelayMessage(raw: string): RelayMessage {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch {\n    throw new MessageError(\"relay message is not valid JSON\");\n  }\n  if (!Array.isArray(parsed) || parsed.length === 0 || typeof parsed[0] !== \"string\") {\n    throw new MessageError(\"relay message must be a non-empty JSON array\");\n  }\n  const items: unknown[] = parsed;\n  const [type] = items;\n  switch (type) {\n    case \"EVENT\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || !validateSignedEvent(items[2])) {\n        throw new MessageError(\"invalid EVENT relay message\");\n      }\n      return [\"EVENT\", assertSubscriptionId(items[1]), items[2]];\n\n    case \"OK\":\n      if (\n        items.length !== 4 ||\n        typeof items[1] !== \"string\" ||\n        !HEX64_LOWER_RE.test(items[1]) ||\n        typeof items[2] !== \"boolean\" ||\n        typeof items[3] !== \"string\"\n      ) {\n        throw new MessageError(\"invalid OK relay message\");\n      }\n      return [\"OK\", items[1], items[2], items[3]];\n\n    case \"EOSE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid EOSE relay message\");\n      }\n      return [\"EOSE\", assertSubscriptionId(items[1])];\n\n    case \"CLOSED\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || typeof items[2] !== \"string\") {\n        throw new MessageError(\"invalid CLOSED relay message\");\n      }\n      return [\"CLOSED\", assertSubscriptionId(items[1]), items[2]];\n\n    case \"NOTICE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid NOTICE relay message\");\n      }\n      return [\"NOTICE\", items[1]];\n\n    case \"AUTH\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid AUTH relay message\");\n      }\n      return [\"AUTH\", items[1]];\n\n    case \"COUNT\": {\n      const payload = items.at(2);\n      const count = isRecord(payload) ? payload[\"count\"] : undefined;\n      if (\n        items.length !== 3 ||\n        typeof items[1] !== \"string\" ||\n        !isRecord(payload) ||\n        typeof count !== \"number\" ||\n        !Number.isSafeInteger(count) ||\n        count < 0\n      ) {\n        throw new MessageError(\"invalid COUNT relay message\");\n      }\n      const result: Mutable<CountResult> = { count };\n      if (typeof payload[\"approximate\"] === \"boolean\") {\n        result.approximate = payload[\"approximate\"];\n      }\n      const hll = parseCountHll(payload[\"hll\"]);\n      if (hll !== undefined) {\n        result.hll = hll;\n      }\n      return [\"COUNT\", assertSubscriptionId(items[1]), result];\n    }\n    case \"NEG-MSG\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || !isNegHex(items[2])) {\n        throw new MessageError(\"invalid NEG-MSG relay message\");\n      }\n      return [\"NEG-MSG\", assertSubscriptionId(items[1]), items[2].toLowerCase()];\n\n    case \"NEG-ERR\":\n      if (\n        (items.length !== 3 && items.length !== 4) ||\n        typeof items[1] !== \"string\" ||\n        typeof items[2] !== \"string\"\n      ) {\n        throw new MessageError(\"invalid NEG-ERR relay message\");\n      }\n      return [\"NEG-ERR\", assertSubscriptionId(items[1]), items[2]];\n\n    default:\n      throw new MessageError(`unknown relay message type: ${String(type)}`);\n  }\n}\n\nfunction parseCountHll(value: unknown): string | undefined {\n  if (typeof value !== \"string\" || value.length !== HLL_HEX_LEN || !HEX_RE.test(value)) {\n    return undefined;\n  }\n  return value.toLowerCase();\n}\n\nconst HEX64_RE = /^[0-9a-fA-F]{64}$/;\nconst HEX64_LOWER_RE = /^[0-9a-f]{64}$/;\n\n/**\n * Validates a wire filter per NIP-01: `ids`/`authors` are 64-hex arrays (normalized lowercase),\n * `kinds` are integers in 0..=65535, `since`/`until`/`limit` non-negative integers, `search` a\n * string, and `#<single letter>` arrays of strings (`#e`/`#p` lowercased). Multi-letter `#` keys\n * and unknown non-`#` keys are dropped; wrong types throw {@link MessageError}. Duplicate keys and\n * integer spellings (`1e3`, `1.0`, `-0`) need no handling: `JSON.parse` already applied last-wins\n * and normalized the numbers before this runs (nk-core's map visitors mirror that, NK-ADR-012).\n */\nfunction parseWireFilter(value: unknown, kind: string): Filter {\n  if (!isRecord(value)) {\n    throw new MessageError(`invalid ${kind} filter`);\n  }\n  const fail = (): MessageError => new MessageError(`invalid ${kind} filter`);\n  const out: Mutable<Filter> = {};\n  for (const [key, v] of Object.entries(value)) {\n    if (key.startsWith(\"#\")) {\n      if (!/^#[a-zA-Z]$/.test(key)) {\n        continue;\n      }\n      if (!Array.isArray(v) || !v.every((x): x is string => typeof x === \"string\")) {\n        throw fail();\n      }\n      out[`#${key.slice(1)}`] = key === \"#e\" || key === \"#p\" ? v.map((x) => x.toLowerCase()) : v;\n    } else if (key === \"ids\" || key === \"authors\") {\n      if (\n        !Array.isArray(v) ||\n        !v.every((x): x is string => typeof x === \"string\" && HEX64_RE.test(x))\n      ) {\n        throw fail();\n      }\n      out[key] = v.map((x) => x.toLowerCase());\n    } else if (key === \"kinds\") {\n      if (\n        !Array.isArray(v) ||\n        !v.every(\n          (x): x is number =>\n            typeof x === \"number\" && Number.isSafeInteger(x) && x >= 0 && x <= 65535,\n        )\n      ) {\n        throw fail();\n      }\n      out.kinds = v;\n    } else if (key === \"since\" || key === \"until\" || key === \"limit\") {\n      if (typeof v !== \"number\" || !Number.isSafeInteger(v) || v < 0) {\n        throw fail();\n      }\n      out[key] = v;\n    } else if (key === \"search\") {\n      if (typeof v !== \"string\") {\n        throw fail();\n      }\n      out.search = v;\n    }\n  }\n  return out;\n}\n\nfunction parseWireFilters(items: unknown[], kind: string): Filter[] {\n  return items.map((item) => parseWireFilter(item, kind));\n}\n\nfunction isNegHex(value: unknown): value is string {\n  return (\n    typeof value === \"string\" && value.length > 0 && value.length % 2 === 0 && HEX_RE.test(value)\n  );\n}\n"],"mappings":";;;;;AAaA,SAAgB,qBAAqB,IAA4B;CAE/D,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,IACd,UAAU;CAEZ,IAAI,WAAW,KAAK,SAAA,IAClB,MAAM,IAAI,aAAa,sCAAgE;CAEzF,OAAO;AACT;;AAGA,SAAgB,qBAAqB,IAA6B;CAChE,IAAI,OAAO,KAAA,GACT,OAAO,qBAAqB,EAAE;CAEhC,MAAM,wBAAQ,IAAI,WAAW,CAAC;CAC9B,OAAO,gBAAgB,KAAK;CAC5B,OAAO,WAAW,KAAK;AACzB;AAoCA,MAAM,YAAY;AAClB,MAAM,cAAc,YAAY;AAChC,MAAM,SAAS;;;;;AAMf,SAAgB,cAAc,OAAsC;CAClE,MAAM,SAAS,IAAI,WAAW,SAAS;CACvC,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,IAAI,WAAW,eAAe,CAAC,OAAO,KAAK,GAAG,GAChD,MAAM,IAAI,aAAa,kDAAkD;EAE3E,MAAM,QAAQ,WAAW,GAAG;EAC5B,KAAK,MAAM,CAAC,GAAG,MAAM,MAAM,QAAQ,GAAG;GACpC,MAAM,IAAI,OAAO;GACjB,IAAI,MAAM,KAAA,KAAa,IAAI,GACzB,OAAO,KAAK;EAEhB;CACF;CACA,OAAO,WAAW,MAAM;AAC1B;;AAGA,SAAgB,oBAAoB,SAAgC;CAElE,QAAQ,QAAQ,IAAhB;EACE,KAAK;EACL,KAAK,SAAS;GACZ,MAAM,CAAC,MAAM,IAAI,GAAG,WAAW;GAC/B,OAAO,KAAK,UAAU;IAAC;IAAM;IAAI,GAAG,oBAAoB,OAAO;GAAC,CAAC;EACnE;EACA,KAAK,YACH,OAAO,KAAK,UAAU;GAAC;GAAY,QAAQ;GAAI,mBAAmB,QAAQ,EAAE;GAAG,QAAQ;EAAE,CAAC;EAC5F,SACE,OAAO,KAAK,UAAU,OAAO;CACjC;AACF;;AAGA,SAAgB,mBAAmB,SAA+B;CAChE,OAAO,KAAK,UAAU,OAAO;AAC/B;;AAGA,SAAgB,mBAAmB,KAA4B;CAC7D,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,QAAQ;EACN,MAAM,IAAI,aAAa,kCAAkC;CAC3D;CACA,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,KAAK,OAAO,OAAO,OAAO,UACxE,MAAM,IAAI,aAAa,+CAA+C;CAExE,MAAM,QAAmB;CACzB,MAAM,CAAC,QAAQ;CACf,QAAQ,MAAR;EACE,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,CAAC,oBAAoB,MAAM,EAAE,GACrD,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,SAAS,MAAM,EAAE;EAE3B,KAAK;GACH,IAAI,MAAM,SAAS,KAAK,OAAO,MAAM,OAAO,UAC1C,MAAM,IAAI,aAAa,4BAA4B;GAErD,OAAO;IAAC;IAAO,qBAAqB,MAAM,EAAE;IAAG,GAAG,iBAAiB,MAAM,MAAM,CAAC,GAAG,KAAK;GAAC;EAE3F,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,SAAS,qBAAqB,MAAM,EAAE,CAAC;EAEjD,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,CAAC,oBAAoB,MAAM,EAAE,GACrD,MAAM,IAAI,aAAa,6BAA6B;GAEtD,OAAO,CAAC,QAAQ,MAAM,EAAE;EAE1B,KAAK;GACH,IAAI,MAAM,SAAS,KAAK,OAAO,MAAM,OAAO,UAC1C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO;IACL;IACA,qBAAqB,MAAM,EAAE;IAC7B,GAAG,iBAAiB,MAAM,MAAM,CAAC,GAAG,OAAO;GAC7C;EAEF,KAAK;GACH,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,aAAa,mEAAmE;GAE5F,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,SAAS,MAAM,EAAE,KAClB,CAAC,SAAS,MAAM,EAAE,GAElB,MAAM,IAAI,aAAa,iCAAiC;GAE1D,OAAO;IACL;IACA,qBAAqB,MAAM,EAAE;IAC7B,gBAAgB,MAAM,IAAI,UAAU;IACpC,MAAM,EAAE,CAAC,YAAY;GACvB;EAEF,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,SAAS,MAAM,EAAE,GAC1E,MAAM,IAAI,aAAa,gCAAgC;GAEzD,OAAO;IAAC;IAAW,qBAAqB,MAAM,EAAE;IAAG,MAAM,EAAE,CAAC,YAAY;GAAC;EAE3E,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,kCAAkC;GAE3D,OAAO,CAAC,aAAa,qBAAqB,MAAM,EAAE,CAAC;EAErD,SACE,MAAM,IAAI,aAAa,gCAAgC,OAAO,IAAI,GAAG;CACzE;AACF;;AAGA,SAAgB,kBAAkB,KAA2B;CAC3D,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,QAAQ;EACN,MAAM,IAAI,aAAa,iCAAiC;CAC1D;CACA,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,KAAK,OAAO,OAAO,OAAO,UACxE,MAAM,IAAI,aAAa,8CAA8C;CAEvE,MAAM,QAAmB;CACzB,MAAM,CAAC,QAAQ;CACf,QAAQ,MAAR;EACE,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,oBAAoB,MAAM,EAAE,GACrF,MAAM,IAAI,aAAa,6BAA6B;GAEtD,OAAO;IAAC;IAAS,qBAAqB,MAAM,EAAE;IAAG,MAAM;GAAE;EAE3D,KAAK;GACH,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,eAAe,KAAK,MAAM,EAAE,KAC7B,OAAO,MAAM,OAAO,aACpB,OAAO,MAAM,OAAO,UAEpB,MAAM,IAAI,aAAa,0BAA0B;GAEnD,OAAO;IAAC;IAAM,MAAM;IAAI,MAAM;IAAI,MAAM;GAAE;EAE5C,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,4BAA4B;GAErD,OAAO,CAAC,QAAQ,qBAAqB,MAAM,EAAE,CAAC;EAEhD,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,OAAO,MAAM,OAAO,UAC5E,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO;IAAC;IAAU,qBAAqB,MAAM,EAAE;IAAG,MAAM;GAAE;EAE5D,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,UAAU,MAAM,EAAE;EAE5B,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,4BAA4B;GAErD,OAAO,CAAC,QAAQ,MAAM,EAAE;EAE1B,KAAK,SAAS;GACZ,MAAM,UAAU,MAAM,GAAG,CAAC;GAC1B,MAAM,QAAQ,SAAS,OAAO,IAAI,QAAQ,WAAW,KAAA;GACrD,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,SAAS,OAAO,KACjB,OAAO,UAAU,YACjB,CAAC,OAAO,cAAc,KAAK,KAC3B,QAAQ,GAER,MAAM,IAAI,aAAa,6BAA6B;GAEtD,MAAM,SAA+B,EAAE,MAAM;GAC7C,IAAI,OAAO,QAAQ,mBAAmB,WACpC,OAAO,cAAc,QAAQ;GAE/B,MAAM,MAAM,cAAc,QAAQ,MAAM;GACxC,IAAI,QAAQ,KAAA,GACV,OAAO,MAAM;GAEf,OAAO;IAAC;IAAS,qBAAqB,MAAM,EAAE;IAAG;GAAM;EACzD;EACA,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,SAAS,MAAM,EAAE,GAC1E,MAAM,IAAI,aAAa,+BAA+B;GAExD,OAAO;IAAC;IAAW,qBAAqB,MAAM,EAAE;IAAG,MAAM,EAAE,CAAC,YAAY;GAAC;EAE3E,KAAK;GACH,IACG,MAAM,WAAW,KAAK,MAAM,WAAW,KACxC,OAAO,MAAM,OAAO,YACpB,OAAO,MAAM,OAAO,UAEpB,MAAM,IAAI,aAAa,+BAA+B;GAExD,OAAO;IAAC;IAAW,qBAAqB,MAAM,EAAE;IAAG,MAAM;GAAE;EAE7D,SACE,MAAM,IAAI,aAAa,+BAA+B,OAAO,IAAI,GAAG;CACxE;AACF;AAEA,SAAS,cAAc,OAAoC;CACzD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,eAAe,CAAC,OAAO,KAAK,KAAK,GACjF;CAEF,OAAO,MAAM,YAAY;AAC3B;AAEA,MAAM,WAAW;AACjB,MAAM,iBAAiB;;;;;;;;;AAUvB,SAAS,gBAAgB,OAAgB,MAAsB;CAC7D,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,aAAa,WAAW,KAAK,QAAQ;CAEjD,MAAM,aAA2B,IAAI,aAAa,WAAW,KAAK,QAAQ;CAC1E,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,CAAC,KAAK,MAAM,OAAO,QAAQ,KAAK,GACzC,IAAI,IAAI,WAAW,GAAG,GAAG;EACvB,IAAI,CAAC,cAAc,KAAK,GAAG,GACzB;EAEF,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,MAAmB,OAAO,MAAM,QAAQ,GACzE,MAAM,KAAK;EAEb,IAAI,IAAI,IAAI,MAAM,CAAC,OAAO,QAAQ,QAAQ,QAAQ,OAAO,EAAE,KAAK,MAAM,EAAE,YAAY,CAAC,IAAI;CAC3F,OAAO,IAAI,QAAQ,SAAS,QAAQ,WAAW;EAC7C,IACE,CAAC,MAAM,QAAQ,CAAC,KAChB,CAAC,EAAE,OAAO,MAAmB,OAAO,MAAM,YAAY,SAAS,KAAK,CAAC,CAAC,GAEtE,MAAM,KAAK;EAEb,IAAI,OAAO,EAAE,KAAK,MAAM,EAAE,YAAY,CAAC;CACzC,OAAO,IAAI,QAAQ,SAAS;EAC1B,IACE,CAAC,MAAM,QAAQ,CAAC,KAChB,CAAC,EAAE,OACA,MACC,OAAO,MAAM,YAAY,OAAO,cAAc,CAAC,KAAK,KAAK,KAAK,KAAK,KACvE,GAEA,MAAM,KAAK;EAEb,IAAI,QAAQ;CACd,OAAO,IAAI,QAAQ,WAAW,QAAQ,WAAW,QAAQ,SAAS;EAChE,IAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,GAC3D,MAAM,KAAK;EAEb,IAAI,OAAO;CACb,OAAO,IAAI,QAAQ,UAAU;EAC3B,IAAI,OAAO,MAAM,UACf,MAAM,KAAK;EAEb,IAAI,SAAS;CACf;CAEF,OAAO;AACT;AAEA,SAAS,iBAAiB,OAAkB,MAAwB;CAClE,OAAO,MAAM,KAAK,SAAS,gBAAgB,MAAM,IAAI,CAAC;AACxD;AAEA,SAAS,SAAS,OAAiC;CACjD,OACE,OAAO,UAAU,YAAY,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,KAAK;AAEhG"}

package/dist/{nip17-B7MI82Iq.d.mts → nip17-BM4hJYBq.d.mts}

@@ -1,7 +1,7 @@
 import { h as Tag, t as Event } from "./event-j3BwI5dF.mjs";
-import { t as EventBuilder } from "./builder-GBddxj8i.mjs";
+import { t as EventBuilder } from "./builder-BrmLOVj_.mjs";
 import { a as NostrError } from "./error-BquXDmIN.mjs";
-import { a as Rumor, l as WrapOptions, r as Nip59Crypto } from "./nip59-CdDoJptA.mjs";
+import { a as Rumor, l as WrapOptions, r as Nip59Crypto } from "./nip59-CGWfoItR.mjs";
 //#region src/nips/nip17.d.ts
 declare class Nip17Error extends NostrError {
   name: string;
@@ -28,11 +28,11 @@ declare function dmRelayListEventBuilder(relays: ReadonlyArray<string>): EventBu
 /** Accept a hex pubkey, a Recipient, or a readonly array of either. Dedup by pubkey. */
 declare function normalizeRecipients(input: string | Recipient | ReadonlyArray<string | Recipient>): Recipient[];
 declare function buildChatMessageRumor(senderPubkey: string, recipients: ReadonlyArray<Recipient>, content: string, opts?: ChatMessageOptions): Rumor;
-declare function wrapDirectMessage(crypto: Nip59Crypto, recipients: ReadonlyArray<Recipient>, rumor: Rumor, opts?: Pick<WrapOptions, "now" | "randomInt" | "timestamps" | "expiration" | "ephemeral" | "randomize">): Promise<ReadonlyArray<{
+declare function wrapDirectMessage(crypto: Nip59Crypto, recipients: ReadonlyArray<Recipient>, rumor: Rumor, opts?: Pick<WrapOptions, "now" | "randomBytes" | "timestamps" | "expiration" | "ephemeral" | "randomize">): Promise<ReadonlyArray<{
   recipient: string;
   wrap: Event;
 }>>;
 declare function requireDmRelays(pubkey: string, relays: ReadonlyArray<string>): string[];
 //#endregion
 export { buildChatMessageRumor as a, normalizeRecipients as c, wrapDirectMessage as d, ReplyTo as i, parseDmRelayList as l, Nip17Error as n, dmRelayListEventBuilder as o, Recipient as r, dmRelayListToTags as s, ChatMessageOptions as t, requireDmRelays as u };
-//# sourceMappingURL=nip17-B7MI82Iq.d.mts.map
+//# sourceMappingURL=nip17-BM4hJYBq.d.mts.map

package/dist/{nip51-O_vhOiK2.d.mts → nip51-D_bu8Hph.d.mts}

@@ -1,5 +1,5 @@
 import { t as Event } from "./event-j3BwI5dF.mjs";
-import { t as EventBuilder } from "./builder-GBddxj8i.mjs";
+import { t as EventBuilder } from "./builder-BrmLOVj_.mjs";
 //#region src/nips/nip51.d.ts
 /**
  * Structural crypto used by NIP-51 private tags. Satisfied by NostrSigner when
@@ -84,4 +84,4 @@ declare function parseFollowPack(event: Pick<Event, "kind" | "tags">): {
 };
 //#endregion
 export { encryptPrivateTags as a, parseEmojiSet as c, parseMuteList as d, parseMuteListPrivate as f, pinListEventBuilder as g, parseUserEmojiList as h, decryptPrivateTags as i, parseFavoriteRelays as l, parseRelaySet as m, Nip51Crypto as n, muteListEventBuilder as o, parsePinList as p, bookmarkListEventBuilder as r, parseBookmarkList as s, MuteItem as t, parseFollowPack as u };
-//# sourceMappingURL=nip51-O_vhOiK2.d.mts.map
+//# sourceMappingURL=nip51-D_bu8Hph.d.mts.map

package/dist/{nip59-CdDoJptA.d.mts → nip59-CGWfoItR.d.mts}

@@ -27,9 +27,17 @@ type TimestampRandomize = "wrap" | "seal+wrap";
 type WrapOptions = {
   /** Unix seconds used as the randomization window end. Default: floor(Date.now()/1000). */
   readonly now?: number | undefined;
-  /** Uniform integer in [0, maxExclusive). Default: CSPRNG via @noble/hashes randomBytes. */
-  readonly randomInt?: ((maxExclusive: number) => number) | undefined;
-  /** When set, used as-is. Overrides now/randomInt for this call. */
+  /**
+   * Entropy source replacing @noble/hashes `randomBytes` for everything `wrap`/`createGiftWrap`
+   * draws — in stream order: the ephemeral secret key (32-byte draws, redrawn while not a valid
+   * scalar), the timestamp offset (4-byte big-endian u32 draws under the [0, 2 days) rejection
+   * bound), the NIP-44 nonce (32 bytes), and the BIP-340 auxiliary randomness (32 bytes). In
+   * `createSeal` only the timestamp offset is drawn here; the seal's nonce and aux belong to the
+   * injected {@link Nip59Crypto}. `wrap` = seal draws then gift-wrap draws. Default: noble
+   * `randomBytes`.
+   */
+  readonly randomBytes?: ((n: number) => Uint8Array) | undefined;
+  /** When set, used as-is. Overrides now/randomBytes for this call. */
   readonly timestamps?: GiftWrapTimestamps | undefined;
   readonly relayHint?: string | undefined;
   /** Appended after the required wrap `p` tag. Never applied to the seal. */
@@ -47,7 +55,7 @@ type WrapOptions = {
    */
   readonly randomize?: TimestampRandomize | undefined;
 };
-type SealOptions = Pick<WrapOptions, "now" | "randomInt" | "timestamps" | "expiration" | "randomize">;
+type SealOptions = Pick<WrapOptions, "now" | "randomBytes" | "timestamps" | "expiration" | "randomize">;
 declare class Nip59Error extends NostrError {
   name: string;
 }
@@ -68,7 +76,7 @@ declare function rumorToJson(rumor: Rumor): string;
 declare function eventToJson(event: Event): string;
 declare function randomPastTimestamp(opts?: {
   now?: number | undefined;
-  randomInt?: ((maxExclusive: number) => number) | undefined;
+  randomBytes?: ((n: number) => Uint8Array) | undefined;
 }): number;
 declare function createRumor(pubkey: string, template: {
   kind: number;
@@ -82,4 +90,4 @@ declare function wrap(crypto: Nip59Crypto, recipient: string, rumor: Rumor, opts
 declare function unwrap(crypto: Nip44Decryptor, giftWrap: Event): Promise<Rumor>;
 //#endregion
 export { requireNip59Crypto as _, Rumor as a, wrap as b, TimestampRandomize as c, createRumor as d, createSeal as f, requireNip44Decryptor as g, randomPastTimestamp as h, Nip59Error as i, WrapOptions as l, isGiftWrapKind as m, Nip44Decryptor as n, SealOptions as o, eventToJson as p, Nip59Crypto as r, TWO_DAYS_SECS as s, GiftWrapTimestamps as t, createGiftWrap as u, rumorToJson as v, unwrap as y };
-//# sourceMappingURL=nip59-CdDoJptA.d.mts.map
+//# sourceMappingURL=nip59-CGWfoItR.d.mts.map

package/dist/{nip65-BL79HI8N.d.mts → nip65-DaWMg943.d.mts}

@@ -1,5 +1,5 @@
 import { h as Tag, t as Event } from "./event-j3BwI5dF.mjs";
-import { t as EventBuilder } from "./builder-GBddxj8i.mjs";
+import { t as EventBuilder } from "./builder-BrmLOVj_.mjs";
 //#region src/nips/nip65.d.ts
 /** NIP-65 `r` tag marker: read-only, write-only, or unmarked (both). */
 type RelayMarker = "read" | "write" | "both";
@@ -20,4 +20,4 @@ declare function readRelays(items: ReadonlyArray<RelayListItem>): string[];
 declare function writeRelays(items: ReadonlyArray<RelayListItem>): string[];
 //#endregion
 export { relayListEventBuilder as a, readRelays as i, RelayMarker as n, relayListToTags as o, parseRelayList as r, writeRelays as s, RelayListItem as t };
-//# sourceMappingURL=nip65-BL79HI8N.d.mts.map
+//# sourceMappingURL=nip65-DaWMg943.d.mts.map

package/dist/nips/blossom.d.mts

@@ -1,5 +1,5 @@
 import { n as EventTemplate, t as Event } from "../event-j3BwI5dF.mjs";
-import { t as EventBuilder } from "../builder-GBddxj8i.mjs";
+import { t as EventBuilder } from "../builder-BrmLOVj_.mjs";
 import { a as NostrError } from "../error-BquXDmIN.mjs";
 import { t as ManualFetch } from "../http-kwWG-V1X.mjs";
 //#region src/nips/blossom.d.ts

package/dist/nips/blossom.mjs

@@ -1,6 +1,6 @@
-import { c as isRecord, d as nowSeconds, h as EventValidationError, i as bytesToHex, n as assertHex32, p as utf8Encoder, v as NostrError } from "../util-DMF9AIO0.mjs";
+import { f as nowSeconds, g as EventValidationError, i as bytesToHex, l as isRecord, m as utf8Encoder, n as assertHex32, y as NostrError } from "../util-DDpPkiED.mjs";
 import { t as Kind } from "../kind-D8fENiiL.mjs";
-import { t as EventBuilder } from "../builder-CVRmUeNm.mjs";
+import { t as EventBuilder } from "../builder-Cf2N12CG.mjs";
 import { n as requireGlobalFetch, r as sendManual, t as fetchManual } from "../http-CuazNRIP.mjs";
 import { sha256 } from "@noble/hashes/sha2.js";
 import { base64urlnopad } from "@scure/base";

package/dist/nips/nip04.d.mts

@@ -1,7 +1,17 @@
 //#region src/nips/nip04.d.ts
 /** Encrypt plaintext to a peer pubkey (NIP-04). */
 export declare function encrypt(secretKey: string | Uint8Array, pubkey: string, text: string): string;
+/**
+ * Encrypt with the raw 32-byte ECDH x-coordinate instead of a secret key, for key holders that only
+ * expose ECDH ({@link NostrKeyOperations}).
+ */
+export declare function encryptWithSharedSecret(sharedX: Uint8Array, text: string): string;
 /** Decrypt a NIP-04 payload from a peer pubkey. */
 export declare function decrypt(secretKey: string | Uint8Array, pubkey: string, data: string): string;
+/**
+ * Decrypt a NIP-04 payload with the raw 32-byte ECDH x-coordinate instead of a secret key, for key
+ * holders that only expose ECDH ({@link NostrKeyOperations}).
+ */
+export declare function decryptWithSharedSecret(sharedX: Uint8Array, data: string): string;
 //#endregion
 //# sourceMappingURL=nip04.d.mts.map

package/dist/nips/nip04.mjs

@@ -1,4 +1,4 @@
-import { a as hexToBytes$1, f as utf8Decoder, m as CryptoError, n as assertHex32, p as utf8Encoder, r as assertSecretKeyBytes } from "../util-DMF9AIO0.mjs";
+import { h as CryptoError, m as utf8Encoder, n as assertHex32, o as hexToBytes$1, p as utf8Decoder, r as assertSecretKeyBytes, t as assertByteLength } from "../util-DDpPkiED.mjs";
 import { randomBytes } from "@noble/hashes/utils.js";
 import { secp256k1 } from "@noble/curves/secp256k1.js";
 import { cbc } from "@noble/ciphers/aes.js";
@@ -21,27 +21,57 @@ function resolveSecret(secretKey) {
 /** Encrypt plaintext to a peer pubkey (NIP-04). */
 function encrypt(secretKey, pubkey, text) {
 	const normalizedKey = normalizeSharedSecret(resolveSecret(secretKey), pubkey);
+	try {
+		return encryptWithSharedSecret(normalizedKey, text);
+	} finally {
+		normalizedKey.fill(0);
+	}
+}
+/**
+* Encrypt with the raw 32-byte ECDH x-coordinate instead of a secret key, for key holders that only
+* expose ECDH ({@link NostrKeyOperations}).
+*/
+function encryptWithSharedSecret(sharedX, text) {
+	assertByteLength(sharedX, 32, "shared secret");
 	const iv = randomBytes(16);
 	const plaintext = utf8Encoder.encode(text);
-	const ciphertext = cbc(normalizedKey, iv).encrypt(plaintext);
+	const ciphertext = cbc(sharedX, iv).encrypt(plaintext);
 	return `${base64.encode(ciphertext)}?iv=${base64.encode(iv)}`;
 }
 /** Decrypt a NIP-04 payload from a peer pubkey. */
 function decrypt(secretKey, pubkey, data) {
 	const privkey = resolveSecret(secretKey);
-	const parts = data.split("?iv=");
-	if (parts.length !== 2 || parts[0] === void 0 || parts[0] === "" || parts[1] === void 0 || parts[1] === "") throw new CryptoError("invalid NIP-04 payload: missing iv");
+	splitPayload(data);
 	const normalizedKey = normalizeSharedSecret(privkey, pubkey);
 	try {
-		const iv = base64.decode(parts[1]);
-		const ciphertext = base64.decode(parts[0]);
-		const plaintext = cbc(normalizedKey, iv).decrypt(ciphertext);
+		return decryptWithSharedSecret(normalizedKey, data);
+	} finally {
+		normalizedKey.fill(0);
+	}
+}
+function splitPayload(data) {
+	const parts = data.split("?iv=");
+	const [ciphertext, iv] = parts;
+	if (parts.length !== 2 || ciphertext === void 0 || ciphertext === "" || iv === void 0 || iv === "") throw new CryptoError("invalid NIP-04 payload: missing iv");
+	return [ciphertext, iv];
+}
+/**
+* Decrypt a NIP-04 payload with the raw 32-byte ECDH x-coordinate instead of a secret key, for key
+* holders that only expose ECDH ({@link NostrKeyOperations}).
+*/
+function decryptWithSharedSecret(sharedX, data) {
+	assertByteLength(sharedX, 32, "shared secret");
+	const [ciphertextPart, ivPart] = splitPayload(data);
+	try {
+		const iv = base64.decode(ivPart);
+		const ciphertext = base64.decode(ciphertextPart);
+		const plaintext = cbc(sharedX, iv).decrypt(ciphertext);
 		return utf8Decoder.decode(plaintext);
 	} catch (error) {
 		throw new CryptoError("invalid NIP-04 payload", { cause: error });
 	}
 }
 //#endregion
-export { decrypt, encrypt };
+export { decrypt, decryptWithSharedSecret, encrypt, encryptWithSharedSecret };
 
 //# sourceMappingURL=nip04.mjs.map

package/dist/nips/nip04.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"nip04.mjs","names":["hexToBytes"],"sources":["../../src/nips/nip04.ts"],"sourcesContent":["/** NIP-04 legacy encrypted direct messages. Prefer NIP-44 for new applications. */\nimport { cbc } from \"@noble/ciphers/aes.js\";\nimport { secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { randomBytes } from \"@noble/hashes/utils.js\";\nimport { base64 } from \"@scure/base\";\n\nimport { CryptoError } from \"../core/error.ts\";\nimport {\n  assertHex32,\n  assertSecretKeyBytes,\n  hexToBytes,\n  utf8Decoder,\n  utf8Encoder,\n} from \"../core/util.ts\";\n\nfunction normalizeSharedSecret(privkey: Uint8Array, pubkey: string): Uint8Array {\n  assertHex32(pubkey, \"public key\");\n  try {\n    const key = secp256k1.getSharedSecret(privkey, hexToBytes(`02${pubkey.toLowerCase()}`));\n    return key.slice(1, 33);\n  } catch (error) {\n    throw new CryptoError(\"invalid NIP-04 public key\", { cause: error });\n  }\n}\n\nfunction resolveSecret(secretKey: string | Uint8Array): Uint8Array {\n  if (typeof secretKey === \"string\") {\n    return hexToBytes(assertHex32(secretKey, \"secret key\"));\n  }\n  assertSecretKeyBytes(secretKey);\n  return secretKey;\n}\n\n/** Encrypt plaintext to a peer pubkey (NIP-04). */\nexport function encrypt(secretKey: string | Uint8Array, pubkey: string, text: string): string {\n  const privkey = resolveSecret(secretKey);\n  const normalizedKey = normalizeSharedSecret(privkey, pubkey);\n  const iv = randomBytes(16);\n  const plaintext = utf8Encoder.encode(text);\n  const ciphertext = cbc(normalizedKey, iv).encrypt(plaintext);\n  return `${base64.encode(ciphertext)}?iv=${base64.encode(iv)}`;\n}\n\n/** Decrypt a NIP-04 payload from a peer pubkey. */\nexport function decrypt(secretKey: string | Uint8Array, pubkey: string, data: string): string {\n  const privkey = resolveSecret(secretKey);\n  const parts = data.split(\"?iv=\");\n  if (\n    parts.length !== 2 ||\n    parts[0] === undefined ||\n    parts[0] === \"\" ||\n    parts[1] === undefined ||\n    parts[1] === \"\"\n  ) {\n    throw new CryptoError(\"invalid NIP-04 payload: missing iv\");\n  }\n  const normalizedKey = normalizeSharedSecret(privkey, pubkey);\n  try {\n    const iv = base64.decode(parts[1]);\n    const ciphertext = base64.decode(parts[0]);\n    const plaintext = cbc(normalizedKey, iv).decrypt(ciphertext);\n    return utf8Decoder.decode(plaintext);\n  } catch (error) {\n    throw new CryptoError(\"invalid NIP-04 payload\", { cause: error });\n  }\n}\n"],"mappings":";;;;;;;AAeA,SAAS,sBAAsB,SAAqB,QAA4B;CAC9E,YAAY,QAAQ,YAAY;CAChC,IAAI;EAEF,OADY,UAAU,gBAAgB,SAASA,aAAW,KAAK,OAAO,YAAY,GAAG,CAC5E,CAAC,CAAC,MAAM,GAAG,EAAE;CACxB,SAAS,OAAO;EACd,MAAM,IAAI,YAAY,6BAA6B,EAAE,OAAO,MAAM,CAAC;CACrE;AACF;AAEA,SAAS,cAAc,WAA4C;CACjE,IAAI,OAAO,cAAc,UACvB,OAAOA,aAAW,YAAY,WAAW,YAAY,CAAC;CAExD,qBAAqB,SAAS;CAC9B,OAAO;AACT;;AAGA,SAAgB,QAAQ,WAAgC,QAAgB,MAAsB;CAE5F,MAAM,gBAAgB,sBADN,cAAc,SACoB,GAAG,MAAM;CAC3D,MAAM,KAAK,YAAY,EAAE;CACzB,MAAM,YAAY,YAAY,OAAO,IAAI;CACzC,MAAM,aAAa,IAAI,eAAe,EAAE,CAAC,CAAC,QAAQ,SAAS;CAC3D,OAAO,GAAG,OAAO,OAAO,UAAU,EAAE,MAAM,OAAO,OAAO,EAAE;AAC5D;;AAGA,SAAgB,QAAQ,WAAgC,QAAgB,MAAsB;CAC5F,MAAM,UAAU,cAAc,SAAS;CACvC,MAAM,QAAQ,KAAK,MAAM,MAAM;CAC/B,IACE,MAAM,WAAW,KACjB,MAAM,OAAO,KAAA,KACb,MAAM,OAAO,MACb,MAAM,OAAO,KAAA,KACb,MAAM,OAAO,IAEb,MAAM,IAAI,YAAY,oCAAoC;CAE5D,MAAM,gBAAgB,sBAAsB,SAAS,MAAM;CAC3D,IAAI;EACF,MAAM,KAAK,OAAO,OAAO,MAAM,EAAE;EACjC,MAAM,aAAa,OAAO,OAAO,MAAM,EAAE;EACzC,MAAM,YAAY,IAAI,eAAe,EAAE,CAAC,CAAC,QAAQ,UAAU;EAC3D,OAAO,YAAY,OAAO,SAAS;CACrC,SAAS,OAAO;EACd,MAAM,IAAI,YAAY,0BAA0B,EAAE,OAAO,MAAM,CAAC;CAClE;AACF"}
+{"version":3,"file":"nip04.mjs","names":["hexToBytes"],"sources":["../../src/nips/nip04.ts"],"sourcesContent":["/** NIP-04 legacy encrypted direct messages. Prefer NIP-44 for new applications. */\nimport { cbc } from \"@noble/ciphers/aes.js\";\nimport { secp256k1 } from \"@noble/curves/secp256k1.js\";\nimport { randomBytes } from \"@noble/hashes/utils.js\";\nimport { base64 } from \"@scure/base\";\n\nimport { CryptoError } from \"../core/error.ts\";\nimport {\n  assertByteLength,\n  assertHex32,\n  assertSecretKeyBytes,\n  hexToBytes,\n  utf8Decoder,\n  utf8Encoder,\n} from \"../core/util.ts\";\n\nfunction normalizeSharedSecret(privkey: Uint8Array, pubkey: string): Uint8Array {\n  assertHex32(pubkey, \"public key\");\n  try {\n    const key = secp256k1.getSharedSecret(privkey, hexToBytes(`02${pubkey.toLowerCase()}`));\n    return key.slice(1, 33);\n  } catch (error) {\n    throw new CryptoError(\"invalid NIP-04 public key\", { cause: error });\n  }\n}\n\nfunction resolveSecret(secretKey: string | Uint8Array): Uint8Array {\n  if (typeof secretKey === \"string\") {\n    return hexToBytes(assertHex32(secretKey, \"secret key\"));\n  }\n  assertSecretKeyBytes(secretKey);\n  return secretKey;\n}\n\n/** Encrypt plaintext to a peer pubkey (NIP-04). */\nexport function encrypt(secretKey: string | Uint8Array, pubkey: string, text: string): string {\n  const privkey = resolveSecret(secretKey);\n  const normalizedKey = normalizeSharedSecret(privkey, pubkey);\n  try {\n    return encryptWithSharedSecret(normalizedKey, text);\n  } finally {\n    normalizedKey.fill(0);\n  }\n}\n\n/**\n * Encrypt with the raw 32-byte ECDH x-coordinate instead of a secret key, for key holders that only\n * expose ECDH ({@link NostrKeyOperations}).\n */\nexport function encryptWithSharedSecret(sharedX: Uint8Array, text: string): string {\n  assertByteLength(sharedX, 32, \"shared secret\");\n  const iv = randomBytes(16);\n  const plaintext = utf8Encoder.encode(text);\n  const ciphertext = cbc(sharedX, iv).encrypt(plaintext);\n  return `${base64.encode(ciphertext)}?iv=${base64.encode(iv)}`;\n}\n\n/** Decrypt a NIP-04 payload from a peer pubkey. */\nexport function decrypt(secretKey: string | Uint8Array, pubkey: string, data: string): string {\n  const privkey = resolveSecret(secretKey);\n  splitPayload(data);\n  const normalizedKey = normalizeSharedSecret(privkey, pubkey);\n  try {\n    return decryptWithSharedSecret(normalizedKey, data);\n  } finally {\n    normalizedKey.fill(0);\n  }\n}\n\nfunction splitPayload(data: string): [ciphertext: string, iv: string] {\n  const parts = data.split(\"?iv=\");\n  const [ciphertext, iv] = parts;\n  if (\n    parts.length !== 2 ||\n    ciphertext === undefined ||\n    ciphertext === \"\" ||\n    iv === undefined ||\n    iv === \"\"\n  ) {\n    throw new CryptoError(\"invalid NIP-04 payload: missing iv\");\n  }\n  return [ciphertext, iv];\n}\n\n/**\n * Decrypt a NIP-04 payload with the raw 32-byte ECDH x-coordinate instead of a secret key, for key\n * holders that only expose ECDH ({@link NostrKeyOperations}).\n */\nexport function decryptWithSharedSecret(sharedX: Uint8Array, data: string): string {\n  assertByteLength(sharedX, 32, \"shared secret\");\n  const [ciphertextPart, ivPart] = splitPayload(data);\n  try {\n    const iv = base64.decode(ivPart);\n    const ciphertext = base64.decode(ciphertextPart);\n    const plaintext = cbc(sharedX, iv).decrypt(ciphertext);\n    return utf8Decoder.decode(plaintext);\n  } catch (error) {\n    throw new CryptoError(\"invalid NIP-04 payload\", { cause: error });\n  }\n}\n"],"mappings":";;;;;;;AAgBA,SAAS,sBAAsB,SAAqB,QAA4B;CAC9E,YAAY,QAAQ,YAAY;CAChC,IAAI;EAEF,OADY,UAAU,gBAAgB,SAASA,aAAW,KAAK,OAAO,YAAY,GAAG,CAC5E,CAAC,CAAC,MAAM,GAAG,EAAE;CACxB,SAAS,OAAO;EACd,MAAM,IAAI,YAAY,6BAA6B,EAAE,OAAO,MAAM,CAAC;CACrE;AACF;AAEA,SAAS,cAAc,WAA4C;CACjE,IAAI,OAAO,cAAc,UACvB,OAAOA,aAAW,YAAY,WAAW,YAAY,CAAC;CAExD,qBAAqB,SAAS;CAC9B,OAAO;AACT;;AAGA,SAAgB,QAAQ,WAAgC,QAAgB,MAAsB;CAE5F,MAAM,gBAAgB,sBADN,cAAc,SACoB,GAAG,MAAM;CAC3D,IAAI;EACF,OAAO,wBAAwB,eAAe,IAAI;CACpD,UAAU;EACR,cAAc,KAAK,CAAC;CACtB;AACF;;;;;AAMA,SAAgB,wBAAwB,SAAqB,MAAsB;CACjF,iBAAiB,SAAS,IAAI,eAAe;CAC7C,MAAM,KAAK,YAAY,EAAE;CACzB,MAAM,YAAY,YAAY,OAAO,IAAI;CACzC,MAAM,aAAa,IAAI,SAAS,EAAE,CAAC,CAAC,QAAQ,SAAS;CACrD,OAAO,GAAG,OAAO,OAAO,UAAU,EAAE,MAAM,OAAO,OAAO,EAAE;AAC5D;;AAGA,SAAgB,QAAQ,WAAgC,QAAgB,MAAsB;CAC5F,MAAM,UAAU,cAAc,SAAS;CACvC,aAAa,IAAI;CACjB,MAAM,gBAAgB,sBAAsB,SAAS,MAAM;CAC3D,IAAI;EACF,OAAO,wBAAwB,eAAe,IAAI;CACpD,UAAU;EACR,cAAc,KAAK,CAAC;CACtB;AACF;AAEA,SAAS,aAAa,MAAgD;CACpE,MAAM,QAAQ,KAAK,MAAM,MAAM;CAC/B,MAAM,CAAC,YAAY,MAAM;CACzB,IACE,MAAM,WAAW,KACjB,eAAe,KAAA,KACf,eAAe,MACf,OAAO,KAAA,KACP,OAAO,IAEP,MAAM,IAAI,YAAY,oCAAoC;CAE5D,OAAO,CAAC,YAAY,EAAE;AACxB;;;;;AAMA,SAAgB,wBAAwB,SAAqB,MAAsB;CACjF,iBAAiB,SAAS,IAAI,eAAe;CAC7C,MAAM,CAAC,gBAAgB,UAAU,aAAa,IAAI;CAClD,IAAI;EACF,MAAM,KAAK,OAAO,OAAO,MAAM;EAC/B,MAAM,aAAa,OAAO,OAAO,cAAc;EAC/C,MAAM,YAAY,IAAI,SAAS,EAAE,CAAC,CAAC,QAAQ,UAAU;EACrD,OAAO,YAAY,OAAO,SAAS;CACrC,SAAS,OAAO;EACd,MAAM,IAAI,YAAY,0BAA0B,EAAE,OAAO,MAAM,CAAC;CAClE;AACF"}

package/dist/nips/nip05.mjs

@@ -1,4 +1,4 @@
-import { c as isRecord, o as isHex32, v as NostrError } from "../util-DMF9AIO0.mjs";
+import { l as isRecord, s as isHex32, y as NostrError } from "../util-DDpPkiED.mjs";
 import { n as requireGlobalFetch, t as fetchManual } from "../http-CuazNRIP.mjs";
 //#region src/nips/nip05.ts
 /**