@hashtree/worker 0.2.1 → 0.2.3

package/dist/htree-url.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"htree-url.js","sourceRoot":"","sources":["../src/htree-url.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,4BAA4B,EAC5B,0BAA0B,GAE3B,MAAM,cAAc,CAAC;AAetB,SAAS,qBAAqB,CAAC,OAAe;IAC5C,IAAI,CAAC;QACH,OAAO,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,OAAO,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,IAAI;SACR,KAAK,CAAC,GAAG,CAAC;SACV,MAAM,CAAC,OAAO,CAAC;SACf,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;SAC7C,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAY;IACrC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,eAAe,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC3E,MAAM,UAAU,GAAG,eAAe,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChD,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAY;IACzC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,0BAA0B,CACjC,UAA8C,EAC9C,OAAe,EACf,aAAwC;IAExC,IAAI,aAAa;QAAE,OAAO,aAAa,CAAC;IACxC,IAAI,CAAC,OAAO;QAAE,OAAO,OAAO,CAAC;IAC7B,IAAI,4BAA4B,CAAC,UAAU,CAAC;QAAE,OAAO,OAAO,CAAC;IAC7D,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,IAAI,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACnC,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,IAAI,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAC1E,MAAM,WAAW,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE3E,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,WAAW,GAAG,EAAE,EAAE,GAAG,eAAe,CAAC,GAAG,WAAW,CAAC;YAC3D,MAAM,QAAQ,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;YACpD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,IAAI;gBACV,QAAQ;gBACR,IAAI,EAAE,eAAe,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;aAC3D,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,OAAO;gBACL,IAAI,EAAE,WAAW;gBACjB,KAAK,EAAE,IAAI;gBACX,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;aACvD,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,OAAO;YACL,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,iBAAiB,CAAC,OAAO,CAAC;YACjC,IAAI,EAAE,EAAE;SACT,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,KAA8B,EAC9B,eAAyC,OAAO;IAEhD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1B,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAClC,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACxE,IAAI,CAAC,MAAM;QAAE,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAEpE,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5D,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,YAAY,KAAK,OAAO,CAAC,CAAC,CAAC,UAAU,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QACtF,OAAO,GAAG,MAAM,IAAI,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IAC/E,CAAC;IAED,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5C,OAAO,UAAU,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AACzE,CAAC;AAED,MAAM,UAAU,sBAAsB,CACpC,KAA8B,EAC9B,UAAyC,EAAE;IAE3C,MAAM,YAAY,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACnE,IAAI,YAAY,IAAI,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;QACvD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE;QACrC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QAC3C,CAAC,CAAC,0BAA0B,CAAC;YACzB,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,eAAe,EAAE,OAAO,CAAC,eAAe;SACzC,CAAC,CAAC;IACP,MAAM,YAAY,GAAG,0BAA0B,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;IACnG,MAAM,WAAW,GAAG,qBAAqB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAE/D,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,OAAO,GAAG,WAAW,EAAE,CAAC;AACpC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,17 @@
+export { HashtreeWorkerClient } from './client.js';
+export type { WorkerFactory, P2PFetchHandler } from './client.js';
+export { RelayWorkerClient } from './relay-client.js';
+export type { TreeRootInfo as RelayTreeRootInfo, TreeRootUpdate as RelayTreeRootUpdate, RelayWorkerConfig, RelayWorkerRequest, RelayWorkerResponse, } from './relay-client.js';
+export { canUseInjectedHtreeServerUrl, canUseSameOriginHtreeProtocolStreaming, getInjectedHtreeServerUrl, resolveRuntimeHtreeBaseUrl, shouldEagerLoadMediaInNativeChildRuntime, shouldPreferSameOriginHtreeRoutes, } from './runtime.js';
+export type { HtreeRuntimeLocationLike, HtreeRuntimeWindowLike, ResolveRuntimeHtreeBaseUrlOptions, } from './runtime.js';
+export { resolveRuntimeEndpoints, } from './runtime-network.js';
+export type { ResolveRuntimeEndpointsOptions, RuntimeEndpoints, } from './runtime-network.js';
+export { createHtreeRuntime } from './app-runtime.js';
+export type { HtreeRuntime, HtreeRuntimeEndpointOverrides, HtreeRuntimeMediaPortOptions, HtreeRuntimeMediaUrlOptions, HtreeRuntimeOptions, HtreeRuntimeRequestUrlOptions, HtreeRuntimeWorkerConfigOptions, RuntimeValueSource, } from './app-runtime.js';
+export { buildHtreeRequestPath, parseHtreeUrl, resolveHtreeRequestUrl, } from './htree-url.js';
+export type { MutableHtreeRequestStyle, ParsedHtreeUrl, ResolveHtreeRequestUrlOptions, } from './htree-url.js';
+export type { HtreeClientIdStorageLike } from './client-id.js';
+export type { BlossomServerConfig, WorkerConfig, WorkerRequest, WorkerResponse, RootResolveOptions, ConnectivityState, UploadProgressState, WorkerDiagnosticEvent, WorkerDiagnosticLevel, BlossomBandwidthState, BlossomBandwidthServerStats, BlobSource, } from './protocol.js';
+export { WebRTCController, WebRTCProxy, initWebRTCProxy, getWebRTCProxy, closeWebRTCProxy, } from './p2p/index.js';
+export type { WebRTCControllerConfig } from './p2p/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnD,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,YAAY,EACV,YAAY,IAAI,iBAAiB,EACjC,cAAc,IAAI,mBAAmB,EACrC,iBAAiB,EACjB,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,4BAA4B,EAC5B,sCAAsC,EACtC,yBAAyB,EACzB,0BAA0B,EAC1B,wCAAwC,EACxC,iCAAiC,GAClC,MAAM,cAAc,CAAC;AACtB,YAAY,EACV,wBAAwB,EACxB,sBAAsB,EACtB,iCAAiC,GAClC,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,uBAAuB,GACxB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,8BAA8B,EAC9B,gBAAgB,GACjB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AACtD,YAAY,EACV,YAAY,EACZ,6BAA6B,EAC7B,4BAA4B,EAC5B,2BAA2B,EAC3B,mBAAmB,EACnB,6BAA6B,EAC7B,+BAA+B,EAC/B,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,qBAAqB,EACrB,aAAa,EACb,sBAAsB,GACvB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EACV,wBAAwB,EACxB,cAAc,EACd,6BAA6B,GAC9B,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAC/D,YAAY,EACV,mBAAmB,EACnB,YAAY,EACZ,aAAa,EACb,cAAc,EACd,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,EACnB,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,EACrB,2BAA2B,EAC3B,UAAU,GACX,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,eAAe,EACf,cAAc,EACd,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AAExB,YAAY,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/index.js

@@ -0,0 +1,8 @@
+export { HashtreeWorkerClient } from './client.js';
+export { RelayWorkerClient } from './relay-client.js';
+export { canUseInjectedHtreeServerUrl, canUseSameOriginHtreeProtocolStreaming, getInjectedHtreeServerUrl, resolveRuntimeHtreeBaseUrl, shouldEagerLoadMediaInNativeChildRuntime, shouldPreferSameOriginHtreeRoutes, } from './runtime.js';
+export { resolveRuntimeEndpoints, } from './runtime-network.js';
+export { createHtreeRuntime } from './app-runtime.js';
+export { buildHtreeRequestPath, parseHtreeUrl, resolveHtreeRequestUrl, } from './htree-url.js';
+export { WebRTCController, WebRTCProxy, initWebRTCProxy, getWebRTCProxy, closeWebRTCProxy, } from './p2p/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAEnD,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAQtD,OAAO,EACL,4BAA4B,EAC5B,sCAAsC,EACtC,yBAAyB,EACzB,0BAA0B,EAC1B,wCAAwC,EACxC,iCAAiC,GAClC,MAAM,cAAc,CAAC;AAMtB,OAAO,EACL,uBAAuB,GACxB,MAAM,sBAAsB,CAAC;AAK9B,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAWtD,OAAO,EACL,qBAAqB,EACrB,aAAa,EACb,sBAAsB,GACvB,MAAM,gBAAgB,CAAC;AAsBxB,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,eAAe,EACf,cAAc,EACd,gBAAgB,GACjB,MAAM,gBAAgB,CAAC"}

package/dist/mediaStreaming.d.ts

@@ -0,0 +1,7 @@
+import type { CID, HashTree } from '@hashtree/core';
+/**
+ * Stream a bounded byte range from a CID without materializing the whole range in memory.
+ * Output chunks are capped at `chunkSize` bytes.
+ */
+export declare function streamFileRangeChunks(tree: Pick<HashTree, 'readFileStream'>, cid: CID, start: number, endInclusive: number, chunkSize: number, prefetch?: number): AsyncGenerator<Uint8Array>;
+//# sourceMappingURL=mediaStreaming.d.ts.map

package/dist/mediaStreaming.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mediaStreaming.d.ts","sourceRoot":"","sources":["../src/mediaStreaming.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAIpD;;;GAGG;AACH,wBAAuB,qBAAqB,CAC1C,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,gBAAgB,CAAC,EACtC,GAAG,EAAE,GAAG,EACR,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,QAAQ,GAAE,MAAyB,GAClC,cAAc,CAAC,UAAU,CAAC,CA+C5B"}

package/dist/mediaStreaming.js

@@ -0,0 +1,48 @@
+const DEFAULT_PREFETCH = 2;
+/**
+ * Stream a bounded byte range from a CID without materializing the whole range in memory.
+ * Output chunks are capped at `chunkSize` bytes.
+ */
+export async function* streamFileRangeChunks(tree, cid, start, endInclusive, chunkSize, prefetch = DEFAULT_PREFETCH) {
+    if (chunkSize <= 0) {
+        throw new Error('chunkSize must be > 0');
+    }
+    if (endInclusive < start) {
+        return;
+    }
+    let remaining = endInclusive - start + 1;
+    let pending = new Uint8Array(chunkSize);
+    let pendingLength = 0;
+    for await (const sourceChunk of tree.readFileStream(cid, { offset: start, prefetch })) {
+        if (remaining <= 0)
+            break;
+        if (sourceChunk.byteLength === 0)
+            continue;
+        const consumed = Math.min(sourceChunk.byteLength, remaining);
+        const source = consumed === sourceChunk.byteLength ? sourceChunk : sourceChunk.subarray(0, consumed);
+        remaining -= consumed;
+        let cursor = 0;
+        while (cursor < source.byteLength) {
+            const available = source.byteLength - cursor;
+            if (pendingLength === 0 && available >= chunkSize) {
+                // Emit direct full-size chunks with independent buffers for transfer.
+                yield source.slice(cursor, cursor + chunkSize);
+                cursor += chunkSize;
+                continue;
+            }
+            const toCopy = Math.min(chunkSize - pendingLength, available);
+            pending.set(source.subarray(cursor, cursor + toCopy), pendingLength);
+            pendingLength += toCopy;
+            cursor += toCopy;
+            if (pendingLength === chunkSize) {
+                yield pending;
+                pending = new Uint8Array(chunkSize);
+                pendingLength = 0;
+            }
+        }
+    }
+    if (pendingLength > 0) {
+        yield pending.slice(0, pendingLength);
+    }
+}
+//# sourceMappingURL=mediaStreaming.js.map

package/dist/mediaStreaming.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mediaStreaming.js","sourceRoot":"","sources":["../src/mediaStreaming.ts"],"names":[],"mappings":"AAEA,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B;;;GAGG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,qBAAqB,CAC1C,IAAsC,EACtC,GAAQ,EACR,KAAa,EACb,YAAoB,EACpB,SAAiB,EACjB,WAAmB,gBAAgB;IAEnC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,YAAY,GAAG,KAAK,EAAE,CAAC;QACzB,OAAO;IACT,CAAC;IAED,IAAI,SAAS,GAAG,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC;IACzC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,IAAI,KAAK,EAAE,MAAM,WAAW,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QACtF,IAAI,SAAS,IAAI,CAAC;YAAE,MAAM;QAC1B,IAAI,WAAW,CAAC,UAAU,KAAK,CAAC;YAAE,SAAS;QAE3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,QAAQ,KAAK,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrG,SAAS,IAAI,QAAQ,CAAC;QAEtB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,OAAO,MAAM,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC;YAE7C,IAAI,aAAa,KAAK,CAAC,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;gBAClD,sEAAsE;gBACtE,MAAM,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;gBAC/C,MAAM,IAAI,SAAS,CAAC;gBACpB,SAAS;YACX,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,aAAa,EAAE,SAAS,CAAC,CAAC;YAC9D,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC;YACrE,aAAa,IAAI,MAAM,CAAC;YACxB,MAAM,IAAI,MAAM,CAAC;YAEjB,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAChC,MAAM,OAAO,CAAC;gBACd,OAAO,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;gBACpC,aAAa,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACxC,CAAC;AACH,CAAC"}

package/dist/p2p/boundedQueue.d.ts

@@ -0,0 +1,79 @@
+/**
+ * BoundedQueue - Memory-safe queue with size limits
+ *
+ * Prevents memory blowup by enforcing both item count and byte limits.
+ * When limits are exceeded, oldest items are dropped (FIFO eviction).
+ *
+ * Use this instead of plain arrays for queues that could grow unbounded,
+ * especially for network buffers, send queues, and work queues.
+ */
+export interface BoundedQueueOptions<T> {
+    /** Maximum number of items in queue */
+    maxItems: number;
+    /** Maximum total bytes in queue */
+    maxBytes: number;
+    /** Function to get byte size of an item */
+    getBytes: (item: T) => number;
+    /** Optional callback when items are dropped due to overflow */
+    onDrop?: (item: T, reason: 'items' | 'bytes') => void;
+}
+export declare class BoundedQueue<T> {
+    private items;
+    private bytesUsed;
+    private readonly maxItems;
+    private readonly maxBytes;
+    private readonly getBytes;
+    private readonly onDrop?;
+    constructor(options: BoundedQueueOptions<T>);
+    /**
+     * Add item to queue, dropping oldest items if limits exceeded
+     * @returns Number of items dropped to make room
+     */
+    push(item: T): number;
+    /**
+     * Add item to the front of the queue, dropping items from the back if limits are exceeded.
+     * Useful for urgent control messages that should overtake bulk background traffic.
+     */
+    unshift(item: T): number;
+    /**
+     * Remove and return oldest item, or undefined if empty
+     */
+    shift(): T | undefined;
+    /**
+     * Peek at oldest item without removing
+     */
+    peek(): T | undefined;
+    /**
+     * Clear all items
+     */
+    clear(): void;
+    /**
+     * Get current item count
+     */
+    get length(): number;
+    /**
+     * Get current byte usage
+     */
+    get bytes(): number;
+    /**
+     * Check if queue is empty
+     */
+    get isEmpty(): boolean;
+    /**
+     * Check if queue is at item capacity
+     */
+    get isFullItems(): boolean;
+    /**
+     * Check if queue is at byte capacity
+     */
+    get isFullBytes(): boolean;
+    /**
+     * Iterate over items (does not remove them)
+     */
+    [Symbol.iterator](): Iterator<T>;
+    /**
+     * Get all items as array (for iteration/reduce operations)
+     */
+    toArray(): T[];
+}
+//# sourceMappingURL=boundedQueue.d.ts.map

package/dist/p2p/boundedQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundedQueue.d.ts","sourceRoot":"","sources":["../../src/p2p/boundedQueue.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,WAAW,mBAAmB,CAAC,CAAC;IACpC,uCAAuC;IACvC,QAAQ,EAAE,MAAM,CAAC;IACjB,mCAAmC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,2CAA2C;IAC3C,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;IAC9B,+DAA+D;IAC/D,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO,KAAK,IAAI,CAAC;CACvD;AAED,qBAAa,YAAY,CAAC,CAAC;IACzB,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsB;IAC/C,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAA+C;gBAE3D,OAAO,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAO3C;;;OAGG;IACH,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM;IAyBrB;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM;IAwBxB;;OAEG;IACH,KAAK,IAAI,CAAC,GAAG,SAAS;IAQtB;;OAEG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;OAEG;IACH,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;OAEG;IACH,IAAI,OAAO,IAAI,OAAO,CAErB;IAED;;OAEG;IACH,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;OAEG;IACH,IAAI,WAAW,IAAI,OAAO,CAEzB;IAED;;OAEG;IACF,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIjC;;OAEG;IACH,OAAO,IAAI,CAAC,EAAE;CAGf"}

package/dist/p2p/boundedQueue.js

@@ -0,0 +1,134 @@
+/**
+ * BoundedQueue - Memory-safe queue with size limits
+ *
+ * Prevents memory blowup by enforcing both item count and byte limits.
+ * When limits are exceeded, oldest items are dropped (FIFO eviction).
+ *
+ * Use this instead of plain arrays for queues that could grow unbounded,
+ * especially for network buffers, send queues, and work queues.
+ */
+export class BoundedQueue {
+    items = [];
+    bytesUsed = 0;
+    maxItems;
+    maxBytes;
+    getBytes;
+    onDrop;
+    constructor(options) {
+        this.maxItems = options.maxItems;
+        this.maxBytes = options.maxBytes;
+        this.getBytes = options.getBytes;
+        this.onDrop = options.onDrop;
+    }
+    /**
+     * Add item to queue, dropping oldest items if limits exceeded
+     * @returns Number of items dropped to make room
+     */
+    push(item) {
+        const itemBytes = this.getBytes(item);
+        let dropped = 0;
+        // Drop oldest items until we have room
+        while (this.items.length > 0 &&
+            (this.items.length >= this.maxItems || this.bytesUsed + itemBytes > this.maxBytes)) {
+            const droppedItem = this.items.shift();
+            const droppedBytes = this.getBytes(droppedItem);
+            this.bytesUsed -= droppedBytes;
+            dropped++;
+            if (this.onDrop) {
+                const reason = this.items.length >= this.maxItems ? 'items' : 'bytes';
+                this.onDrop(droppedItem, reason);
+            }
+        }
+        this.items.push(item);
+        this.bytesUsed += itemBytes;
+        return dropped;
+    }
+    /**
+     * Add item to the front of the queue, dropping items from the back if limits are exceeded.
+     * Useful for urgent control messages that should overtake bulk background traffic.
+     */
+    unshift(item) {
+        const itemBytes = this.getBytes(item);
+        let dropped = 0;
+        while (this.items.length > 0 &&
+            (this.items.length >= this.maxItems || this.bytesUsed + itemBytes > this.maxBytes)) {
+            const droppedItem = this.items.pop();
+            const droppedBytes = this.getBytes(droppedItem);
+            this.bytesUsed -= droppedBytes;
+            dropped++;
+            if (this.onDrop) {
+                const reason = this.items.length >= this.maxItems ? 'items' : 'bytes';
+                this.onDrop(droppedItem, reason);
+            }
+        }
+        this.items.unshift(item);
+        this.bytesUsed += itemBytes;
+        return dropped;
+    }
+    /**
+     * Remove and return oldest item, or undefined if empty
+     */
+    shift() {
+        const item = this.items.shift();
+        if (item !== undefined) {
+            this.bytesUsed -= this.getBytes(item);
+        }
+        return item;
+    }
+    /**
+     * Peek at oldest item without removing
+     */
+    peek() {
+        return this.items[0];
+    }
+    /**
+     * Clear all items
+     */
+    clear() {
+        this.items = [];
+        this.bytesUsed = 0;
+    }
+    /**
+     * Get current item count
+     */
+    get length() {
+        return this.items.length;
+    }
+    /**
+     * Get current byte usage
+     */
+    get bytes() {
+        return this.bytesUsed;
+    }
+    /**
+     * Check if queue is empty
+     */
+    get isEmpty() {
+        return this.items.length === 0;
+    }
+    /**
+     * Check if queue is at item capacity
+     */
+    get isFullItems() {
+        return this.items.length >= this.maxItems;
+    }
+    /**
+     * Check if queue is at byte capacity
+     */
+    get isFullBytes() {
+        return this.bytesUsed >= this.maxBytes;
+    }
+    /**
+     * Iterate over items (does not remove them)
+     */
+    *[Symbol.iterator]() {
+        yield* this.items;
+    }
+    /**
+     * Get all items as array (for iteration/reduce operations)
+     */
+    toArray() {
+        return [...this.items];
+    }
+}
+//# sourceMappingURL=boundedQueue.js.map

package/dist/p2p/boundedQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundedQueue.js","sourceRoot":"","sources":["../../src/p2p/boundedQueue.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAaH,MAAM,OAAO,YAAY;IACf,KAAK,GAAQ,EAAE,CAAC;IAChB,SAAS,GAAG,CAAC,CAAC;IACL,QAAQ,CAAS;IACjB,QAAQ,CAAS;IACjB,QAAQ,CAAsB;IAC9B,MAAM,CAAgD;IAEvE,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,IAAO;QACV,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,uCAAuC;QACvC,OACE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YACrB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,GAAG,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,EAClF,CAAC;YACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAG,CAAC;YACxC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAChD,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC;YAC/B,OAAO,EAAE,CAAC;YAEV,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACtE,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAO;QACb,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,OACE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YACrB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,GAAG,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,EAClF,CAAC;YACD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;YACtC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAChD,IAAI,CAAC,SAAS,IAAI,YAAY,CAAC;YAC/B,OAAO,EAAE,CAAC;YAEV,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;gBACtE,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/p2p/errorMessage.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Extract error message from unknown error type
+ */
+export declare function getErrorMessage(err: unknown): string;
+//# sourceMappingURL=errorMessage.d.ts.map

package/dist/p2p/errorMessage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"errorMessage.d.ts","sourceRoot":"","sources":["../../src/p2p/errorMessage.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAEpD"}

package/dist/p2p/errorMessage.js

@@ -0,0 +1,7 @@
+/**
+ * Extract error message from unknown error type
+ */
+export function getErrorMessage(err) {
+    return err instanceof Error ? err.message : String(err);
+}
+//# sourceMappingURL=errorMessage.js.map

package/dist/p2p/errorMessage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errorMessage.js","sourceRoot":"","sources":["../../src/p2p/errorMessage.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,GAAY;IAC1C,OAAO,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC1D,CAAC"}

package/dist/p2p/index.d.ts

@@ -0,0 +1,8 @@
+export { WebRTCController, type WebRTCControllerConfig, } from './webrtcController.js';
+export { MeshQueryRouter, encodeForwardRequest, type MeshQueryRouterConfig, type MeshQueryRouterPeer, } from './meshQueryRouter.js';
+export { QueryForwardingMachine, type QueryForwardingMachineConfig, type ForwardDecision, type ForwardTimeoutEvent, } from './queryForwardingMachine.js';
+export { WebRTCProxy, initWebRTCProxy, getWebRTCProxy, closeWebRTCProxy, } from './webrtcProxy.js';
+export type { WebRTCCommand, WebRTCEvent, } from './protocol.js';
+export { SIGNALING_KIND, HELLO_TAG, MAX_EVENT_AGE_SEC, createSignalingFilters, sendSignalingMessage, decodeSignalingEvent, } from './signaling.js';
+export type { SignalingEventLike, GiftSeal, SignalingTemplate, SignalingInnerEvent, SignalingFilters, DecodedSignalingEvent, } from './signaling.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/p2p/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/p2p/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gBAAgB,EAChB,KAAK,sBAAsB,GAC5B,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,KAAK,qBAAqB,EAC1B,KAAK,mBAAmB,GACzB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,sBAAsB,EACtB,KAAK,4BAA4B,EACjC,KAAK,eAAe,EACpB,KAAK,mBAAmB,GACzB,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,WAAW,EACX,eAAe,EACf,cAAc,EACd,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAE1B,YAAY,EACV,aAAa,EACb,WAAW,GACZ,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,cAAc,EACd,SAAS,EACT,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,gBAAgB,CAAC;AAExB,YAAY,EACV,kBAAkB,EAClB,QAAQ,EACR,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EAChB,qBAAqB,GACtB,MAAM,gBAAgB,CAAC"}

package/dist/p2p/index.js

@@ -0,0 +1,6 @@
+export { WebRTCController, } from './webrtcController.js';
+export { MeshQueryRouter, encodeForwardRequest, } from './meshQueryRouter.js';
+export { QueryForwardingMachine, } from './queryForwardingMachine.js';
+export { WebRTCProxy, initWebRTCProxy, getWebRTCProxy, closeWebRTCProxy, } from './webrtcProxy.js';
+export { SIGNALING_KIND, HELLO_TAG, MAX_EVENT_AGE_SEC, createSignalingFilters, sendSignalingMessage, decodeSignalingEvent, } from './signaling.js';
+//# sourceMappingURL=index.js.map

package/dist/p2p/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/p2p/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gBAAgB,GAEjB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,eAAe,EACf,oBAAoB,GAGrB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,sBAAsB,GAIvB,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,WAAW,EACX,eAAe,EACf,cAAc,EACd,gBAAgB,GACjB,MAAM,kBAAkB,CAAC;AAO1B,OAAO,EACL,cAAc,EACd,SAAS,EACT,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,gBAAgB,CAAC"}

package/dist/p2p/lruCache.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Simple LRU Cache implementation
+ */
+export declare class LRUCache<K, V> {
+    private cache;
+    private maxSize;
+    constructor(maxSize?: number);
+    get(key: K): V | undefined;
+    set(key: K, value: V): void;
+    has(key: K): boolean;
+    delete(key: K): boolean;
+    clear(): void;
+    get size(): number;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V>;
+    /**
+     * Iterate over all entries (note: does not update LRU order)
+     */
+    entries(): IterableIterator<[K, V]>;
+    forEach(callback: (value: V, key: K) => void): void;
+    /**
+     * Make the cache iterable
+     */
+    [Symbol.iterator](): IterableIterator<[K, V]>;
+}
+//# sourceMappingURL=lruCache.d.ts.map

package/dist/p2p/lruCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lruCache.d.ts","sourceRoot":"","sources":["../../src/p2p/lruCache.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,QAAQ,CAAC,CAAC,EAAE,CAAC;IACxB,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,OAAO,CAAS;gBAEZ,OAAO,GAAE,MAAY;IAIjC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAU1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAe3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI7B;;OAEG;IACF,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAIpC,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAInD;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAG9C"}

package/dist/p2p/lruCache.js

@@ -0,0 +1,65 @@
+/**
+ * Simple LRU Cache implementation
+ */
+export class LRUCache {
+    cache = new Map();
+    maxSize;
+    constructor(maxSize = 100) {
+        this.maxSize = maxSize;
+    }
+    get(key) {
+        const value = this.cache.get(key);
+        if (value !== undefined) {
+            // Move to end (most recently used)
+            this.cache.delete(key);
+            this.cache.set(key, value);
+        }
+        return value;
+    }
+    set(key, value) {
+        // Delete first to reset position if exists
+        this.cache.delete(key);
+        // Evict oldest if at capacity
+        if (this.cache.size >= this.maxSize) {
+            const oldest = this.cache.keys().next().value;
+            if (oldest !== undefined) {
+                this.cache.delete(oldest);
+            }
+        }
+        this.cache.set(key, value);
+    }
+    has(key) {
+        return this.cache.has(key);
+    }
+    delete(key) {
+        return this.cache.delete(key);
+    }
+    clear() {
+        this.cache.clear();
+    }
+    get size() {
+        return this.cache.size;
+    }
+    keys() {
+        return this.cache.keys();
+    }
+    values() {
+        return this.cache.values();
+    }
+    /**
+     * Iterate over all entries (note: does not update LRU order)
+     */
+    *entries() {
+        yield* this.cache.entries();
+    }
+    forEach(callback) {
+        this.cache.forEach(callback);
+    }
+    /**
+     * Make the cache iterable
+     */
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+}
+//# sourceMappingURL=lruCache.js.map

package/dist/p2p/lruCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lruCache.js","sourceRoot":"","sources":["../../src/p2p/lruCache.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,QAAQ;IACX,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAC;IACxB,OAAO,CAAS;IAExB,YAAY,UAAkB,GAAG;QAC/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,mCAAmC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,2CAA2C;QAC3C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAEvB,8BAA8B;QAC9B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,CAAC,OAAO;QACN,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED,OAAO,CAAC,QAAoC;QAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/p2p/meshQueryRouter.d.ts

@@ -0,0 +1,57 @@
+import type { Store } from '@hashtree/core';
+import { type DataRequest, type PeerHTLConfig } from '@hashtree/nostr';
+export interface MeshQueryRouterPeer {
+    peerId: string;
+    canSend: () => boolean;
+    getHtlConfig: () => PeerHTLConfig;
+    sendRequest: (hash: Uint8Array, htl: number) => boolean;
+    sendResponse: (hash: Uint8Array, data: Uint8Array) => Promise<void>;
+    onForwardedRequest?: () => void;
+    onForwardedResolved?: () => void;
+    onForwardedSuppressed?: () => void;
+}
+export interface MeshPeerQueryOptions {
+    excludePeerId?: string;
+    htl: number;
+}
+export interface MeshQueryRouterConfig {
+    localStore: Store;
+    requestTimeoutMs: number;
+    upstreamFetch?: (hash: Uint8Array) => Promise<Uint8Array | null>;
+    queryPeers?: (hash: Uint8Array, options: MeshPeerQueryOptions) => Promise<Uint8Array | null>;
+    maxForwardsPerPeerWindow?: number;
+    forwardRateLimitWindowMs?: number;
+}
+export interface MeshForwardRateLimitConfig {
+    maxForwardsPerPeerWindow?: number;
+    windowMs?: number;
+}
+export declare class MeshQueryRouter {
+    private readonly localStore;
+    private readonly requestTimeoutMs;
+    private rateLimiter;
+    private readonly peers;
+    private readonly hashesByRequester;
+    private readonly inFlightByHash;
+    private readonly pendingUpstreamFetches;
+    private upstreamFetch?;
+    private queryPeers?;
+    constructor(config: MeshQueryRouterConfig);
+    registerPeer(peer: MeshQueryRouterPeer): void;
+    removePeer(peerId: string): void;
+    setUpstreamFetch(upstreamFetch?: (hash: Uint8Array) => Promise<Uint8Array | null>): void;
+    setForwardRateLimit(config?: MeshForwardRateLimitConfig): void;
+    hasInFlight(hashKey: string): boolean;
+    stop(): void;
+    private createRateLimiter;
+    handleRequest(requesterId: string, req: DataRequest): Promise<void>;
+    resolve(hash: Uint8Array, data: Uint8Array): Promise<void>;
+    private beginQuery;
+    private clearQuery;
+    private trackRequester;
+    private forwardRequest;
+    private startPeerQuery;
+    private startUpstreamFetch;
+}
+export declare function encodeForwardRequest(hash: Uint8Array, htl: number): Uint8Array;
+//# sourceMappingURL=meshQueryRouter.d.ts.map

package/dist/p2p/meshQueryRouter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"meshQueryRouter.d.ts","sourceRoot":"","sources":["../../src/p2p/meshQueryRouter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAQL,KAAK,WAAW,EAChB,KAAK,aAAa,EACnB,MAAM,iBAAiB,CAAC;AAIzB,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,OAAO,CAAC;IACvB,YAAY,EAAE,MAAM,aAAa,CAAC;IAClC,WAAW,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC;IACxD,YAAY,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACpE,kBAAkB,CAAC,EAAE,MAAM,IAAI,CAAC;IAChC,mBAAmB,CAAC,EAAE,MAAM,IAAI,CAAC;IACjC,qBAAqB,CAAC,EAAE,MAAM,IAAI,CAAC;CACpC;AAED,MAAM,WAAW,oBAAoB;IACnC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,qBAAqB;IACpC,UAAU,EAAE,KAAK,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACjE,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,oBAAoB,KAAK,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAC7F,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC,wBAAwB,CAAC,EAAE,MAAM,CAAC;CACnC;AAED,MAAM,WAAW,0BAA0B;IACzC,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AA+CD,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAQ;IACnC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAS;IAC1C,OAAO,CAAC,WAAW,CAA2B;IAC9C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA0C;IAChE,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAkC;IACpE,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAoC;IACnE,OAAO,CAAC,QAAQ,CAAC,sBAAsB,CAAiD;IACxF,OAAO,CAAC,aAAa,CAAC,CAAmD;IACzE,OAAO,CAAC,UAAU,CAAC,CAAkF;gBAEzF,MAAM,EAAE,qBAAqB;IAWzC,YAAY,CAAC,IAAI,EAAE,mBAAmB,GAAG,IAAI;IAI7C,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAkBhC,gBAAgB,CAAC,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,IAAI;IAIxF,mBAAmB,CAAC,MAAM,CAAC,EAAE,0BAA0B,GAAG,IAAI;IAI9D,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAIrC,IAAI,IAAI,IAAI;IASZ,OAAO,CAAC,iBAAiB;IAOnB,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAmCnE,OAAO,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBhE,OAAO,CAAC,UAAU;IAqBlB,OAAO,CAAC,UAAU;IAsBlB,OAAO,CAAC,cAAc;IAUtB,OAAO,CAAC,cAAc;IAwBtB,OAAO,CAAC,cAAc;IA6BtB,OAAO,CAAC,kBAAkB;CAmC3B;AAED,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAE9E"}