@peerbit/document 9.4.3-fb47029 → 9.4.3

package/dist/src/most-common-query-predictor.js

@@ -1,115 +0,0 @@
-import { deserialize, serialize } from "@dao-xyz/borsh";
-import { randomBytes, toBase64 } from "@peerbit/crypto";
-/* ───────────────────── helpers ───────────────────── */
-const nullifyQuery = (query) => {
-    const cloned = deserialize(serialize(query), query.constructor);
-    cloned.id = new Uint8Array(32);
-    return cloned;
-};
-export const idAgnosticQueryKey = (query) => toBase64(serialize(nullifyQuery(query)));
-/**
- * Learns the most common recent queries and predicts the most frequent one.
- * If we just pre-empted a peer with some query, the *first* matching request
- * that arrives from that peer within `ignoreWindow` ms is ignored.
- */
-export default class MostCommonQueryPredictor {
-    threshold;
-    ttl;
-    ignoreWindow;
-    queries = new Map();
-    /**
-     * predicted:
-     * requestKey  →  Map<peerHash, timestamp>
-     */
-    predicted = new Map();
-    constructor(threshold, ttl = 10 * 60 * 1000, // 10 min
-    ignoreWindow = 5_000) {
-        this.threshold = threshold;
-        this.ttl = ttl;
-        this.ignoreWindow = ignoreWindow;
-    }
-    /* ───────── housekeeping ───────── */
-    cleanupQueries(now) {
-        for (const [key, stats] of this.queries) {
-            if (now - stats.lastSeen > this.ttl) {
-                this.queries.delete(key);
-            }
-        }
-    }
-    cleanupPredictions(now) {
-        for (const [key, peerMap] of this.predicted) {
-            for (const [peer, ts] of peerMap) {
-                if (now - ts > this.ignoreWindow) {
-                    peerMap.delete(peer);
-                }
-            }
-            if (peerMap.size === 0) {
-                this.predicted.delete(key);
-            }
-        }
-    }
-    /* ───────── public API ───────── */
-    onRequest(request, { from }) {
-        const now = Date.now();
-        const peerHash = from.hashcode();
-        const key = idAgnosticQueryKey(request);
-        /* — 1. Ignore if this (key, peer) pair was just predicted — */
-        const peerMap = this.predicted.get(key);
-        const ts = peerMap?.get(peerHash);
-        let ignore = false;
-        if (ts !== undefined && now - ts <= this.ignoreWindow) {
-            peerMap.delete(peerHash); // one-shot
-            if (peerMap.size === 0) {
-                this.predicted.delete(key);
-            }
-            ignore = true;
-        }
-        /* — 2. Learn from the request — */
-        const stats = this.queries.get(key);
-        if (stats) {
-            stats.count += 1;
-            stats.lastSeen = now;
-        }
-        else {
-            this.queries.set(key, {
-                queryBytes: serialize(request),
-                queryClazz: request.constructor,
-                count: 1,
-                lastSeen: now,
-            });
-        }
-        /* — 3. Maintenance — */
-        this.cleanupQueries(now);
-        this.cleanupPredictions(now);
-        return { ignore };
-    }
-    predictedQuery(from) {
-        const now = Date.now();
-        this.cleanupQueries(now);
-        this.cleanupPredictions(now);
-        /* pick the most frequent query meeting the threshold */
-        let winnerKey;
-        let winnerCount = 0;
-        for (const [key, { count }] of this.queries) {
-            if (count > winnerCount) {
-                winnerKey = key;
-                winnerCount = count;
-            }
-        }
-        if (!winnerKey || winnerCount < this.threshold)
-            return undefined;
-        const winner = this.queries.get(winnerKey);
-        const cloned = deserialize(winner.queryBytes, winner.queryClazz);
-        cloned.id = randomBytes(32);
-        /* remember that we pre-empted `from` with this query */
-        const peerHash = from.hashcode();
-        let peerMap = this.predicted.get(winnerKey);
-        if (!peerMap) {
-            peerMap = new Map();
-            this.predicted.set(winnerKey, peerMap);
-        }
-        peerMap.set(peerHash, now);
-        return cloned;
-    }
-}
-//# sourceMappingURL=most-common-query-predictor.js.map

package/dist/src/most-common-query-predictor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"most-common-query-predictor.js","sourceRoot":"","sources":["../../src/most-common-query-predictor.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqB,WAAW,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3E,OAAO,EAAsB,WAAW,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAG5E,yDAAyD;AAEzD,MAAM,YAAY,GAAG,CACpB,KAAuD,EACtD,EAAE;IACH,MAAM,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,WAAW,CAEjC,CAAC;IAC9B,MAAM,CAAC,EAAE,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAC/B,OAAO,MAAM,CAAC;AACf,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CACjC,KAAuD,EACtD,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAsB9C;;;;GAIG;AACH,MAAM,CAAC,OAAO,OAAO,wBAAwB;IAU1B;IACA;IACA;IAXD,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IAEzD;;;OAGG;IACc,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEpE,YACkB,SAAiB,EACjB,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,SAAS;IAC/B,eAAe,KAAK;QAFpB,cAAS,GAAT,SAAS,CAAQ;QACjB,QAAG,GAAH,GAAG,CAAiB;QACpB,iBAAY,GAAZ,YAAY,CAAQ;IACnC,CAAC;IAEJ,sCAAsC;IAC9B,cAAc,CAAC,GAAW;QACjC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACrC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;IACF,CAAC;IAEO,kBAAkB,CAAC,GAAW;QACrC,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;gBAClC,IAAI,GAAG,GAAG,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;oBAClC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACF,CAAC;YACD,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;QACF,CAAC;IACF,CAAC;IAED,oCAAoC;IAEpC,SAAS,CACR,OAAyD,EACzD,EAAE,IAAI,EAA2B;QAEjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAExC,+DAA+D;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,IAAI,GAAG,GAAG,EAAE,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACvD,OAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW;YACtC,IAAI,OAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC5B,CAAC;YACD,MAAM,GAAG,IAAI,CAAC;QACf,CAAC;QAED,mCAAmC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACX,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;YACjB,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC;QACtB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE;gBACrB,UAAU,EAAE,SAAS,CAAC,OAAO,CAAC;gBAC9B,UAAU,EAAE,OAAO,CAAC,WAAW;gBAC/B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,GAAG;aACb,CAAC,CAAC;QACJ,CAAC;QAED,wBAAwB;QACxB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAE7B,OAAO,EAAE,MAAM,EAAE,CAAC;IACnB,CAAC;IAED,cAAc,CACb,IAAmB;QAEnB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAE7B,wDAAwD;QACxD,IAAI,SAA6B,CAAC;QAClC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7C,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;gBACzB,SAAS,GAAG,GAAG,CAAC;gBAChB,WAAW,GAAG,KAAK,CAAC;YACrB,CAAC;QACF,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS;YAAE,OAAO,SAAS,CAAC;QAEjE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAElC,CAAC;QAC9B,MAAM,CAAC,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;QAE5B,wDAAwD;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,OAAO,EAAE,CAAC;YACd,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;YACpC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAE3B,OAAO,MAAM,CAAC;IACf,CAAC;CACD"}

package/dist/src/prefetch.d.ts

@@ -1,22 +0,0 @@
-import { TypedEventEmitter } from "@libp2p/interface";
-import { Cache } from "@peerbit/cache";
-import type * as types from "@peerbit/document-interface";
-import type { RPCResponse } from "@peerbit/rpc/dist/src";
-type AddEvent = {
-    consumable: RPCResponse<types.PredictedSearchRequest<any>>;
-};
-export declare class Prefetch extends TypedEventEmitter<{
-    add: CustomEvent<AddEvent>;
-}> {
-    private prefetch;
-    private searchIdTranslationMap;
-    constructor(prefetch?: Cache<RPCResponse<types.PredictedSearchRequest<any>>>, searchIdTranslationMap?: Map<string, Map<string, Uint8Array>>);
-    /** Store the prediction **and** notify listeners */
-    add(request: RPCResponse<types.PredictedSearchRequest<any>>, keyHash: string): void;
-    consume(request: types.SearchRequest | types.SearchRequestIndexed, keyHash: string): RPCResponse<types.PredictedSearchRequest<any>> | undefined;
-    clear(request: types.SearchRequest | types.SearchRequestIndexed): void;
-    getTranslationMap(request: types.SearchRequest | types.SearchRequestIndexed): Map<string, Uint8Array> | undefined;
-    get size(): number;
-}
-export {};
-//# sourceMappingURL=prefetch.d.ts.map

package/dist/src/prefetch.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prefetch.d.ts","sourceRoot":"","sources":["../../src/prefetch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,KAAK,KAAK,KAAK,MAAM,6BAA6B,CAAC;AAC1D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIzD,KAAK,QAAQ,GAAG;IACf,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC;CAC3D,CAAC;AAQF,qBAAa,QAAS,SAAQ,iBAAiB,CAAC;IAC/C,GAAG,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC3B,CAAC;IAEA,OAAO,CAAC,QAAQ;IAMhB,OAAO,CAAC,sBAAsB;gBANtB,QAAQ,GAAE,KAAK,CACtB,WAAW,CAAC,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAI7C,EACM,sBAAsB,GAAE,GAAG,CAClC,MAAM,EACN,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CACX;IAKd,oDAAoD;IAC7C,GAAG,CACT,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,EACvD,OAAO,EAAE,MAAM,GACb,IAAI;IAQA,OAAO,CACb,OAAO,EAAE,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,oBAAoB,EACzD,OAAO,EAAE,MAAM,GACb,WAAW,CAAC,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;IAgB7D,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,oBAAoB;IAI/D,iBAAiB,CAChB,OAAO,EAAE,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,oBAAoB,GACvD,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,SAAS;IAItC,IAAI,IAAI,WAEP;CACD"}

package/dist/src/prefetch.js

@@ -1,47 +0,0 @@
-import { TypedEventEmitter } from "@libp2p/interface";
-import { Cache } from "@peerbit/cache";
-import { idAgnosticQueryKey } from "./most-common-query-predictor";
-const prefetchKey = (request, keyHash) => `${idAgnosticQueryKey(request)} - ${keyHash}`;
-// --------------------------------------------------------------------------
-export class Prefetch extends TypedEventEmitter {
-    prefetch;
-    searchIdTranslationMap;
-    constructor(prefetch = new Cache({
-        max: 100,
-        ttl: 1e4,
-    }), searchIdTranslationMap = new Map()) {
-        super();
-        this.prefetch = prefetch;
-        this.searchIdTranslationMap = searchIdTranslationMap;
-    }
-    /** Store the prediction **and** notify listeners */
-    add(request, keyHash) {
-        const key = prefetchKey(request.response.request, keyHash);
-        this.prefetch.add(key, request);
-        this.dispatchEvent(new CustomEvent("add", { detail: { consumable: request } }));
-    }
-    consume(request, keyHash) {
-        const key = prefetchKey(request, keyHash);
-        const pre = this.prefetch.get(key);
-        if (!pre)
-            return;
-        this.prefetch.del(key);
-        let peerMap = this.searchIdTranslationMap.get(request.idString);
-        if (!peerMap) {
-            peerMap = new Map();
-            this.searchIdTranslationMap.set(request.idString, peerMap);
-        }
-        peerMap.set(keyHash, pre.response.request.id);
-        return pre;
-    }
-    clear(request) {
-        this.searchIdTranslationMap.delete(request.idString);
-    }
-    getTranslationMap(request) {
-        return this.searchIdTranslationMap.get(request.idString);
-    }
-    get size() {
-        return this.prefetch.size;
-    }
-}
-//# sourceMappingURL=prefetch.js.map

package/dist/src/prefetch.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prefetch.js","sourceRoot":"","sources":["../../src/prefetch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAGvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAOnE,MAAM,WAAW,GAAG,CACnB,OAAyD,EACzD,OAAe,EACd,EAAE,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,OAAO,EAAE,CAAC;AAEnD,6EAA6E;AAC7E,MAAM,OAAO,QAAS,SAAQ,iBAE5B;IAEQ;IAMA;IAPT,YACS,WAEJ,IAAI,KAAK,CAAC;QACb,GAAG,EAAE,GAAG;QACR,GAAG,EAAE,GAAG;KACR,CAAC,EACM,yBAGJ,IAAI,GAAG,EAAE;QAEb,KAAK,EAAE,CAAC;QAXA,aAAQ,GAAR,QAAQ,CAKd;QACM,2BAAsB,GAAtB,sBAAsB,CAGjB;IAGd,CAAC;IAED,oDAAoD;IAC7C,GAAG,CACT,OAAuD,EACvD,OAAe;QAEf,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,aAAa,CACjB,IAAI,WAAW,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC,CAC3D,CAAC;IACH,CAAC;IAEM,OAAO,CACb,OAAyD,EACzD,OAAe;QAEf,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG;YAAE,OAAO;QAEjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEvB,IAAI,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChE,IAAI,CAAC,OAAO,EAAE,CAAC;YACd,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC9C,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,KAAK,CAAC,OAAyD;QAC9D,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACtD,CAAC;IAED,iBAAiB,CAChB,OAAyD;QAEzD,OAAO,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC3B,CAAC;CACD"}

package/src/most-common-query-predictor.ts

@@ -1,161 +0,0 @@
-import { type AbstractType, deserialize, serialize } from "@dao-xyz/borsh";
-import { type PublicSignKey, randomBytes, toBase64 } from "@peerbit/crypto";
-import type * as types from "@peerbit/document-interface";
-
-/* ───────────────────── helpers ───────────────────── */
-
-const nullifyQuery = (
-	query: types.SearchRequest | types.SearchRequestIndexed,
-) => {
-	const cloned = deserialize(serialize(query), query.constructor) as
-		| types.SearchRequest
-		| types.SearchRequestIndexed;
-	cloned.id = new Uint8Array(32);
-	return cloned;
-};
-
-export const idAgnosticQueryKey = (
-	query: types.SearchRequest | types.SearchRequestIndexed,
-) => toBase64(serialize(nullifyQuery(query)));
-
-/* ───────────────────── predictor ───────────────────── */
-
-export interface QueryPredictor {
-	onRequest: (
-		request: types.SearchRequest | types.SearchRequestIndexed,
-		ctx: { from: PublicSignKey },
-	) => { ignore: boolean };
-
-	predictedQuery: (
-		from: PublicSignKey,
-	) => types.SearchRequest | types.SearchRequestIndexed | undefined;
-}
-
-interface QueryStats {
-	count: number;
-	lastSeen: number;
-	queryBytes: Uint8Array;
-	queryClazz: AbstractType<types.SearchRequest | types.SearchRequestIndexed>;
-}
-
-/**
- * Learns the most common recent queries and predicts the most frequent one.
- * If we just pre-empted a peer with some query, the *first* matching request
- * that arrives from that peer within `ignoreWindow` ms is ignored.
- */
-export default class MostCommonQueryPredictor implements QueryPredictor {
-	private readonly queries = new Map<string, QueryStats>();
-
-	/**
-	 * predicted:
-	 * requestKey  →  Map<peerHash, timestamp>
-	 */
-	private readonly predicted = new Map<string, Map<string, number>>();
-
-	constructor(
-		private readonly threshold: number,
-		private readonly ttl = 10 * 60 * 1000, // 10 min
-		private readonly ignoreWindow = 5_000, // 5 s
-	) {}
-
-	/* ───────── housekeeping ───────── */
-	private cleanupQueries(now: number) {
-		for (const [key, stats] of this.queries) {
-			if (now - stats.lastSeen > this.ttl) {
-				this.queries.delete(key);
-			}
-		}
-	}
-
-	private cleanupPredictions(now: number) {
-		for (const [key, peerMap] of this.predicted) {
-			for (const [peer, ts] of peerMap) {
-				if (now - ts > this.ignoreWindow) {
-					peerMap.delete(peer);
-				}
-			}
-			if (peerMap.size === 0) {
-				this.predicted.delete(key);
-			}
-		}
-	}
-
-	/* ───────── public API ───────── */
-
-	onRequest(
-		request: types.SearchRequest | types.SearchRequestIndexed,
-		{ from }: { from: PublicSignKey },
-	): { ignore: boolean } {
-		const now = Date.now();
-		const peerHash = from.hashcode();
-		const key = idAgnosticQueryKey(request);
-
-		/* — 1. Ignore if this (key, peer) pair was just predicted — */
-		const peerMap = this.predicted.get(key);
-		const ts = peerMap?.get(peerHash);
-		let ignore = false;
-		if (ts !== undefined && now - ts <= this.ignoreWindow) {
-			peerMap!.delete(peerHash); // one-shot
-			if (peerMap!.size === 0) {
-				this.predicted.delete(key);
-			}
-			ignore = true;
-		}
-
-		/* — 2. Learn from the request — */
-		const stats = this.queries.get(key);
-		if (stats) {
-			stats.count += 1;
-			stats.lastSeen = now;
-		} else {
-			this.queries.set(key, {
-				queryBytes: serialize(request),
-				queryClazz: request.constructor,
-				count: 1,
-				lastSeen: now,
-			});
-		}
-
-		/* — 3. Maintenance — */
-		this.cleanupQueries(now);
-		this.cleanupPredictions(now);
-
-		return { ignore };
-	}
-
-	predictedQuery(
-		from: PublicSignKey,
-	): types.SearchRequest | types.SearchRequestIndexed | undefined {
-		const now = Date.now();
-		this.cleanupQueries(now);
-		this.cleanupPredictions(now);
-
-		/* pick the most frequent query meeting the threshold */
-		let winnerKey: string | undefined;
-		let winnerCount = 0;
-		for (const [key, { count }] of this.queries) {
-			if (count > winnerCount) {
-				winnerKey = key;
-				winnerCount = count;
-			}
-		}
-		if (!winnerKey || winnerCount < this.threshold) return undefined;
-
-		const winner = this.queries.get(winnerKey)!;
-		const cloned = deserialize(winner.queryBytes, winner.queryClazz) as
-			| types.SearchRequest
-			| types.SearchRequestIndexed;
-		cloned.id = randomBytes(32);
-
-		/* remember that we pre-empted `from` with this query */
-		const peerHash = from.hashcode();
-		let peerMap = this.predicted.get(winnerKey);
-		if (!peerMap) {
-			peerMap = new Map<string, number>();
-			this.predicted.set(winnerKey, peerMap);
-		}
-		peerMap.set(peerHash, now);
-
-		return cloned;
-	}
-}

package/src/prefetch.ts

@@ -1,80 +0,0 @@
-import { TypedEventEmitter } from "@libp2p/interface";
-import { Cache } from "@peerbit/cache";
-import type * as types from "@peerbit/document-interface";
-import type { RPCResponse } from "@peerbit/rpc/dist/src";
-import { idAgnosticQueryKey } from "./most-common-query-predictor";
-
-// --- typed helper ---------------------------------------------------------
-type AddEvent = {
-	consumable: RPCResponse<types.PredictedSearchRequest<any>>;
-};
-
-const prefetchKey = (
-	request: types.SearchRequest | types.SearchRequestIndexed,
-	keyHash: string,
-) => `${idAgnosticQueryKey(request)} - ${keyHash}`;
-
-// --------------------------------------------------------------------------
-export class Prefetch extends TypedEventEmitter<{
-	add: CustomEvent<AddEvent>;
-}> {
-	constructor(
-		private prefetch: Cache<
-			RPCResponse<types.PredictedSearchRequest<any>>
-		> = new Cache({
-			max: 100,
-			ttl: 1e4,
-		}),
-		private searchIdTranslationMap: Map<
-			string,
-			Map<string, Uint8Array>
-		> = new Map(),
-	) {
-		super();
-	}
-
-	/** Store the prediction **and** notify listeners */
-	public add(
-		request: RPCResponse<types.PredictedSearchRequest<any>>,
-		keyHash: string,
-	): void {
-		const key = prefetchKey(request.response.request, keyHash);
-		this.prefetch.add(key, request);
-		this.dispatchEvent(
-			new CustomEvent("add", { detail: { consumable: request } }),
-		);
-	}
-
-	public consume(
-		request: types.SearchRequest | types.SearchRequestIndexed,
-		keyHash: string,
-	): RPCResponse<types.PredictedSearchRequest<any>> | undefined {
-		const key = prefetchKey(request, keyHash);
-		const pre = this.prefetch.get(key);
-		if (!pre) return;
-
-		this.prefetch.del(key);
-
-		let peerMap = this.searchIdTranslationMap.get(request.idString);
-		if (!peerMap) {
-			peerMap = new Map();
-			this.searchIdTranslationMap.set(request.idString, peerMap);
-		}
-		peerMap.set(keyHash, pre.response.request.id);
-		return pre;
-	}
-
-	clear(request: types.SearchRequest | types.SearchRequestIndexed) {
-		this.searchIdTranslationMap.delete(request.idString);
-	}
-
-	getTranslationMap(
-		request: types.SearchRequest | types.SearchRequestIndexed,
-	): Map<string, Uint8Array> | undefined {
-		return this.searchIdTranslationMap.get(request.idString);
-	}
-
-	get size() {
-		return this.prefetch.size;
-	}
-}