claude-code-infinite 1.0.33 → 1.0.35

package/dist/route-fallback.js

@@ -9,6 +9,14 @@ export function fitsFallbackBudget(inputTokens, outputTokens, budgetTokens, cont
 }
 /** How long a lane may wait for MemTree to finish indexing before refusing. */
 export const INDEX_WAIT_DEADLINE_MS = 10 * 60_000;
+/**
+ * The most a lane waits for an index whose time left the server stated (a 413's
+ * Retry-After): longer estimates refuse at once, and later ones extend a wait only to here.
+ */
+export const INDEX_WAIT_MAX_MS = 15 * 60_000;
+/** A stated time left is waited for this much longer (estimates run over: 2026-11-09). */
+export const INDEX_WAIT_MARGIN_RATIO = 0.5;
+export const INDEX_WAIT_MARGIN_MS = 2 * 60_000;
 /** Seconds Claude Code waits between retries while the index catches up. */
 export const INDEX_WAIT_RETRY_AFTER_SECONDS = 30;
 export const FINAL_REFUSAL_MESSAGE = "MemTree couldn't fit this request in the model's context window. If MemTree is " +
@@ -25,27 +33,72 @@ export const FINAL_REFUSAL_MESSAGE = "MemTree couldn't fit this request in the m
 export class RouteFallbackFailures {
     capacity;
     indexWaitMs;
+    indexWaitMaxMs;
     failures = new Map();
-    /** Lane -> when its index wait began (its deadline is fixed from then). */
+    /**
+     * Lane -> when its index wait began and when it ends; `over` once it ended but the
+     * strike table had no room to record the refusal (still refused, never extended).
+     */
     indexWaits = new Map();
-    constructor(capacity = 128, indexWaitMs = INDEX_WAIT_DEADLINE_MS) {
+    /** Lane -> when it was last seen waiting for its index; a delivery does not clear it. */
+    indexWaitSeen = new Map();
+    constructor(capacity = 128, 
+    /** A wait's length when the server stated no time left. */
+    indexWaitMs = INDEX_WAIT_DEADLINE_MS, indexWaitMaxMs = INDEX_WAIT_MAX_MS) {
         this.capacity = capacity;
         this.indexWaitMs = indexWaitMs;
+        this.indexWaitMaxMs = indexWaitMaxMs;
     }
     fail(lane, context = {}) {
         if (context.awaitingIndex) {
-            const waiting = this.waitForIndex(lane, context.now ?? Date.now());
+            const waiting = this.waitForIndex(lane, context.now ?? Date.now(), context.indexSecondsLeft, context.refusalMessage);
             if (waiting)
                 return waiting;
         }
-        return this.strike(lane);
+        return this.strike(lane, context.refusalMessage);
+    }
+    /**
+     * Note MemTree saying the lane's index is still catching up (a held request's 413):
+     * starts the lane's wait, or extends it by the stated time left. False once waiting
+     * can no longer pay off (the estimate is past the cap, the wait's deadline passed, or
+     * the lane was refused), so a held request stops asking and is refused.
+     */
+    indexWaitOpen(lane, secondsLeft, now = Date.now()) {
+        return this.track(lane, now, secondsLeft) !== "closed";
+    }
+    /**
+     * indexWaitOpen, and when the lane's wait ends: its deadline (Infinity when no slot was
+     * free to track it), or undefined once closed.
+     */
+    indexWaitDeadline(lane, secondsLeft, now = Date.now()) {
+        const state = this.track(lane, now, secondsLeft);
+        if (state === "closed")
+            return undefined;
+        return state === "untracked" ? Infinity : this.indexWaits.get(lane).deadline;
+    }
+    /** Whether the lane is waiting for its index (a wait started, not yet ended). */
+    indexWaiting(lane) {
+        const wait = this.indexWaits.get(lane);
+        return wait !== undefined && !wait.over;
+    }
+    /** Whether the lane waits for its index now, or did at any time from `since` on. */
+    indexWaitSince(lane, since) {
+        return this.indexWaiting(lane) || (this.indexWaitSeen.get(lane) ?? -Infinity) >= since;
+    }
+    /** The time left MemTree last stated for the lane's index wait, if any. */
+    indexSecondsLeft(lane) {
+        return this.indexWaits.get(lane)?.secondsLeft;
+    }
+    /** Whether a stated time left is too long to wait for at all (refused at once). */
+    hopeless(secondsLeft) {
+        return secondsLeft !== undefined && secondsLeft * 1000 > this.indexWaitMaxMs;
     }
     succeeded(lane) {
         this.failures.delete(lane);
         this.indexWaits.delete(lane);
     }
     /** The bounded three-strike episode: 503, 503, then 400 until delivery. */
-    strike(lane) {
+    strike(lane, message) {
         const previous = this.failures.get(lane);
         // Fail closed when full rather than evicting a lane and granting it
         // another retry budget. A successful lane frees its slot.
@@ -54,56 +107,118 @@ export class RouteFallbackFailures {
         if (previous !== undefined || this.failures.size < this.capacity) {
             this.failures.set(lane, attempt);
         }
-        return attempt <= 2 ? retryError(attempt, "1", RETRY_MESSAGE) : refusal(attempt);
+        return attempt <= 2 ? retryError(attempt, "1", RETRY_MESSAGE) : refusal(attempt, message);
     }
     /**
-     * A 503 while the lane's wait is within its deadline; a 400 once it passes.
-     * The deadline is fixed when the wait starts and only a delivery clears it:
-     * an expired wait becomes a terminal strike state, and an active wait is
-     * never evicted. A lane already refused, or arriving while every wait slot
-     * is active, gets no wait (undefined) and falls back to the strikes.
+     * A 503 while the lane's wait is within its deadline; a 400 once it passes, or at once
+     * for a stated time left past the cap. The deadline is set when the wait starts (the
+     * stated time plus a margin, else indexWaitMs); a later stated time may extend it up to
+     * indexWaitMaxMs from the start, and only a delivery clears it: an expired wait becomes
+     * a terminal strike state, and an active wait is never evicted. A lane already refused,
+     * or arriving while every wait slot is active, gets no wait (undefined) and falls back
+     * to the strikes.
      */
-    waitForIndex(lane, now) {
+    waitForIndex(lane, now, secondsLeft, message) {
+        const state = this.track(lane, now, secondsLeft);
+        if (state === "untracked")
+            return undefined;
+        return state === "open" ? this.indexWaitError(lane, secondsLeft) : refusal(3, message);
+    }
+    /**
+     * Start or extend the lane's wait: "open" while the index may still land in time,
+     * "closed" once it may not (and the lane is refused until a delivery), "untracked"
+     * when every wait slot is taken (the strikes decide).
+     */
+    track(lane, now, secondsLeft) {
+        const state = this.trackWait(lane, now, secondsLeft);
+        if (state !== "closed")
+            this.seen(lane, now);
+        return state;
+    }
+    /** Note the lane waiting for its index at `now` (bounded: oldest first out). */
+    seen(lane, now) {
+        this.indexWaitSeen.delete(lane);
+        this.indexWaitSeen.set(lane, now);
+        if (this.indexWaitSeen.size > this.capacity) {
+            this.indexWaitSeen.delete(this.indexWaitSeen.keys().next().value);
+        }
+    }
+    trackWait(lane, now, secondsLeft) {
+        if ((this.failures.get(lane) ?? 0) >= 3)
+            return "closed";
         const wait = this.indexWaits.get(lane);
+        if (wait?.over)
+            return "closed";
+        if (this.hopeless(secondsLeft))
+            return this.close(lane);
         if (wait === undefined) {
-            if ((this.failures.get(lane) ?? 0) >= 3)
-                return undefined;
             this.retireExpiredWaits(now);
             if (this.indexWaits.size >= this.capacity)
-                return undefined;
-            this.indexWaits.set(lane, now);
-            return this.indexWaitError(lane);
+                return "untracked";
+            this.indexWaits.set(lane, { started: now, deadline: this.deadline(now, now, secondsLeft),
+                secondsLeft });
+            return "open";
         }
-        if (now - wait < this.indexWaitMs)
-            return this.indexWaitError(lane);
-        this.retire(lane);
-        return refusal(3);
+        if (secondsLeft !== undefined) {
+            wait.secondsLeft = secondsLeft;
+            wait.deadline = Math.max(wait.deadline, this.deadline(wait.started, now, secondsLeft));
+        }
+        return now < wait.deadline ? "open" : this.close(lane);
+    }
+    /** When a wait begun at `started` ends, given the time left stated at `now`. */
+    deadline(started, now, secondsLeft) {
+        if (secondsLeft === undefined)
+            return started + this.indexWaitMs;
+        const ms = secondsLeft * 1000;
+        return Math.min(started + this.indexWaitMaxMs, now + ms + ms * INDEX_WAIT_MARGIN_RATIO + INDEX_WAIT_MARGIN_MS);
     }
-    indexWaitError(lane) {
-        return retryError(this.failures.get(lane) ?? 0, String(INDEX_WAIT_RETRY_AFTER_SECONDS), INDEX_WAIT_MESSAGE);
+    indexWaitError(lane, secondsLeft) {
+        const retryAfter = secondsLeft === undefined ? INDEX_WAIT_RETRY_AFTER_SECONDS
+            : Math.max(1, Math.min(INDEX_WAIT_RETRY_AFTER_SECONDS, Math.ceil(secondsLeft)));
+        return retryError(this.failures.get(lane) ?? 0, String(retryAfter), indexWaitStatus(secondsLeft));
     }
     /** Free the slots of waits past their deadline, keeping them refused. */
     retireExpiredWaits(now) {
-        for (const [lane, started] of this.indexWaits) {
-            if (now - started >= this.indexWaitMs)
-                this.retire(lane);
+        for (const [lane, wait] of this.indexWaits) {
+            if (now >= wait.deadline)
+                this.close(lane);
         }
     }
     /**
-     * An expired wait's lane moves to the terminal strike state. If the strike
-     * table is full the wait keeps its slot instead (still expired, still
-     * refused), so no lane can be re-admitted with a fresh deadline.
+     * End the lane's wait in the terminal strike state. If the strike table is full a wait
+     * keeps its slot instead, marked over (still refused, never extended), so no lane can
+     * be re-admitted with a fresh deadline; with neither, the refusal stands for this
+     * request only.
      */
-    retire(lane) {
-        if (!this.failures.has(lane) && this.failures.size >= this.capacity)
-            return;
-        this.failures.set(lane, 3);
-        this.indexWaits.delete(lane);
+    close(lane) {
+        if (this.failures.has(lane) || this.failures.size < this.capacity) {
+            this.failures.set(lane, 3);
+            this.indexWaits.delete(lane);
+        }
+        else {
+            const wait = this.indexWaits.get(lane);
+            if (wait)
+                wait.over = true;
+        }
+        return "closed";
     }
 }
 const RETRY_MESSAGE = "MemTree could not produce a usable compressed request; retrying within a bounded limit.";
-const INDEX_WAIT_MESSAGE = "MemTree is still indexing this conversation, so it does not fit the model's context " +
-    "window yet; retrying once indexing catches up.";
+/**
+ * The one-line status a waiting turn shows (Claude Code prints a 503's message on its
+ * retry line): how long the server expects, when it said.
+ */
+export function indexWaitStatus(secondsLeft) {
+    const left = secondsLeft === undefined ? ""
+        : `, ${timeLeftText(secondsLeft)} left by its estimate`;
+    return `MemTree is catching up on this session's index${left}. ` +
+        "This turn continues on its own once it's ready.";
+}
+/** "about 1 minute", "about 5 minutes" (whole minutes, rounded up). */
+export function timeLeftText(seconds) {
+    const minutes = Math.max(1, Math.ceil(seconds / 60));
+    return minutes === 1 ? "about 1 minute" : `about ${minutes} minutes`;
+}
 /**
  * The refusal while MemTree is paused (402): only compression could fit the
  * request, and a retry cannot pay, so it is final at once and outside the
@@ -113,6 +228,15 @@ export function pausedRefusal(message) {
     return { ...refusal(0), body: { type: "error",
             error: { type: "invalid_request_error", message } } };
 }
+/**
+ * The refusal while MemTree can't be reached (network-failure.ts): nothing says the request
+ * can't fit, so it is retryable and outside the strike episode (attempt 0). No retry-after:
+ * Claude Code backs off as for its own connection errors, giving the network time to return.
+ */
+export function unreachableRefusal(message) {
+    return { status: 503, attempt: 0, headers: { "x-should-retry": "true" },
+        body: { type: "error", error: { type: "api_error", message } } };
+}
 function retryError(attempt, retryAfter, message) {
     return {
         status: 503,
@@ -121,14 +245,14 @@ function retryError(attempt, retryAfter, message) {
         body: { type: "error", error: { type: "api_error", message } },
     };
 }
-function refusal(attempt) {
+function refusal(attempt, message = FINAL_REFUSAL_MESSAGE) {
     return {
         status: 400,
         attempt,
         headers: { "x-should-retry": "false" },
         body: {
             type: "error",
-            error: { type: "invalid_request_error", message: FINAL_REFUSAL_MESSAGE },
+            error: { type: "invalid_request_error", message },
         },
     };
 }

package/dist/route-fallback.js.map

@@ -1 +1 @@
-{"version":3,"file":"route-fallback.js","sourceRoot":"","sources":["../src/route-fallback.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACpE,OAAO,EAAE,uBAAuB,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAEhG;;oEAEoE;AACpE,MAAM,UAAU,kBAAkB,CAChC,WAAmB,EACnB,YAAoB,EACpB,YAAoB,EACpB,aAAqB,EACrB,KAAc;IAEd,OAAO,CAAC,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC,KAAK,CACnE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAChD,IAAI,UAAU,CAAC,WAAW,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,aAAa;QACzE,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC;AACtD,CAAC;AASD,+EAA+E;AAC/E,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,GAAG,MAAM,CAAC;AAClD,4EAA4E;AAC5E,MAAM,CAAC,MAAM,8BAA8B,GAAG,EAAE,CAAC;AAEjD,MAAM,CAAC,MAAM,qBAAqB,GAChC,iFAAiF;IACjF,8DAA8D,mBAAmB,GAAG;IACpF,GAAG,oBAAoB,4CAA4C;IACnE,IAAI,mBAAmB,IAAI,uBAAuB,aAAa,CAAC;AAYlE;;;;;;GAMG;AACH,MAAM,OAAO,qBAAqB;IAMb;IACA;IANF,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtD,2EAA2E;IAC1D,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExD,YACmB,WAAW,GAAG,EACd,cAAc,sBAAsB;QADpC,aAAQ,GAAR,QAAQ,CAAM;QACd,gBAAW,GAAX,WAAW,CAAyB;IACpD,CAAC;IAEJ,IAAI,CAAC,IAAY,EAAE,UAAkC,EAAE;QACrD,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YACnE,IAAI,OAAO;gBAAE,OAAO,OAAO,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,SAAS,CAAC,IAAY;QACpB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,2EAA2E;IACnE,MAAM,CAAC,IAAY;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzC,oEAAoE;QACpE,0DAA0D;QAC1D,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC3E,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACjE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACnF,CAAC;IAED;;;;;;OAMG;IACK,YAAY,CAAC,IAAY,EAAE,GAAW;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC1D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAAE,OAAO,SAAS,CAAC;YAC5D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC,WAAW;YAAE,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACpE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IAEO,cAAc,CAAC,IAAY;QACjC,OAAO,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,8BAA8B,CAAC,EACpF,kBAAkB,CAAC,CAAC;IACxB,CAAC;IAED,yEAAyE;IACjE,kBAAkB,CAAC,GAAW;QACpC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9C,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,CAAC,WAAW;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,IAAY;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAC5E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AAED,MAAM,aAAa,GACjB,yFAAyF,CAAC;AAC5F,MAAM,kBAAkB,GACtB,sFAAsF;IACtF,gDAAgD,CAAC;AAEnD;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe;IAC3C,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO;YAC3C,KAAK,EAAE,EAAE,IAAI,EAAE,uBAAuB,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,UAAU,CAAC,OAAe,EAAE,UAAkB,EAAE,OAAe;IACtE,OAAO;QACL,MAAM,EAAE,GAAG;QACX,OAAO;QACP,OAAO,EAAE,EAAE,aAAa,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE;QAChE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE;KAC/D,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,OAAe;IAC9B,OAAO;QACL,MAAM,EAAE,GAAG;QACX,OAAO;QACP,OAAO,EAAE,EAAE,gBAAgB,EAAE,OAAO,EAAE;QACtC,IAAI,EAAE;YACJ,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE,IAAI,EAAE,uBAAuB,EAAE,OAAO,EAAE,qBAAqB,EAAE;SACzE;KACF,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,GAAG,MAAM,CAAC;AAC/C,2EAA2E;AAC3E,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAEzC;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IAIN;IACA;IAJF,KAAK,GAAG,IAAI,GAAG,EAA2D,CAAC;IAE5F,YACmB,WAAW,GAAG,EACd,WAAW,oBAAoB;QAD/B,aAAQ,GAAR,QAAQ,CAAM;QACd,aAAQ,GAAR,QAAQ,CAAuB;IAC/C,CAAC;IAEJ;;;;OAIG;IACH,OAAO,CAAC,IAAY,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,SAAS,GAAG,IAAI;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,QAAQ;YACrD,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QAClD,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;QAClB,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC,CAAC;YAC5F,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,GAAG,uBAAuB;YAAE,OAAO,KAAK,CAAC;QACzF,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,IAAY;QACpB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF"}
+{"version":3,"file":"route-fallback.js","sourceRoot":"","sources":["../src/route-fallback.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACpE,OAAO,EAAE,uBAAuB,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAEhG;;oEAEoE;AACpE,MAAM,UAAU,kBAAkB,CAChC,WAAmB,EACnB,YAAoB,EACpB,YAAoB,EACpB,aAAqB,EACrB,KAAc;IAEd,OAAO,CAAC,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC,KAAK,CACnE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAChD,IAAI,UAAU,CAAC,WAAW,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,aAAa;QACzE,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC;AACtD,CAAC;AASD,+EAA+E;AAC/E,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,GAAG,MAAM,CAAC;AAClD;;;GAGG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,GAAG,MAAM,CAAC;AAC7C,0FAA0F;AAC1F,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAC3C,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,GAAG,MAAM,CAAC;AAC/C,4EAA4E;AAC5E,MAAM,CAAC,MAAM,8BAA8B,GAAG,EAAE,CAAC;AAEjD,MAAM,CAAC,MAAM,qBAAqB,GAChC,iFAAiF;IACjF,8DAA8D,mBAAmB,GAAG;IACpF,GAAG,oBAAoB,4CAA4C;IACnE,IAAI,mBAAmB,IAAI,uBAAuB,aAAa,CAAC;AAgBlE;;;;;;GAMG;AACH,MAAM,OAAO,qBAAqB;IAab;IAEA;IACA;IAfF,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtD;;;OAGG;IACc,UAAU,GACzB,IAAI,GAAG,EAAoF,CAAC;IAE9F,yFAAyF;IACxE,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3D,YACmB,WAAW,GAAG;IAC/B,2DAA2D;IAC1C,cAAc,sBAAsB,EACpC,iBAAiB,iBAAiB;QAHlC,aAAQ,GAAR,QAAQ,CAAM;QAEd,gBAAW,GAAX,WAAW,CAAyB;QACpC,mBAAc,GAAd,cAAc,CAAoB;IAClD,CAAC;IAEJ,IAAI,CAAC,IAAY,EAAE,UAAkC,EAAE;QACrD,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,OAAO,CAAC,gBAAgB,EACzF,OAAO,CAAC,cAAc,CAAC,CAAC;YAC1B,IAAI,OAAO;gBAAE,OAAO,OAAO,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,IAAY,EAAE,WAA+B,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;QAC3E,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,KAAK,QAAQ,CAAC;IACzD,CAAC;IAED;;;OAGG;IACH,iBAAiB,CACf,IAAY,EAAE,WAA+B,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;QAE/D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;QACjD,IAAI,KAAK,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACzC,OAAO,KAAK,KAAK,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,QAAQ,CAAC;IAChF,CAAC;IAED,iFAAiF;IACjF,YAAY,CAAC,IAAY;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1C,CAAC;IAED,oFAAoF;IACpF,cAAc,CAAC,IAAY,EAAE,KAAa;QACxC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;IACzF,CAAC;IAED,2EAA2E;IAC3E,gBAAgB,CAAC,IAAY;QAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC;IAChD,CAAC;IAED,mFAAmF;IACnF,QAAQ,CAAC,WAA+B;QACtC,OAAO,WAAW,KAAK,SAAS,IAAI,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;IAC/E,CAAC;IAED,SAAS,CAAC,IAAY;QACpB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,2EAA2E;IACnE,MAAM,CAAC,IAAY,EAAE,OAAgB;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzC,oEAAoE;QACpE,0DAA0D;QAC1D,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC3E,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACjE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC5F,CAAC;IAED;;;;;;;;OAQG;IACK,YAAY,CAClB,IAAY,EAAE,GAAW,EAAE,WAA+B,EAAE,OAAgB;QAE5E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;QACjD,IAAI,KAAK,KAAK,WAAW;YAAE,OAAO,SAAS,CAAC;QAC5C,OAAO,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACzF,CAAC;IAED;;;;OAIG;IACK,KAAK,CACX,IAAY,EAAE,GAAW,EAAE,WAA+B;QAE1D,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;QACrD,IAAI,KAAK,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gFAAgF;IACxE,IAAI,CAAC,IAAY,EAAE,GAAW;QACpC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5C,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAEO,SAAS,CACf,IAAY,EAAE,GAAW,EAAE,WAA+B;QAE1D,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC;QACzD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,IAAI,EAAE,IAAI;YAAE,OAAO,QAAQ,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACxD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAAE,OAAO,WAAW,CAAC;YAC9D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,WAAW,CAAC;gBACtF,WAAW,EAAE,CAAC,CAAC;YACjB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;YAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC;QACzF,CAAC;QACD,OAAO,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IAED,gFAAgF;IACxE,QAAQ,CAAC,OAAe,EAAE,GAAW,EAAE,WAA+B;QAC5E,IAAI,WAAW,KAAK,SAAS;YAAE,OAAO,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;QACjE,MAAM,EAAE,GAAG,WAAW,GAAG,IAAI,CAAC;QAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,EAC3C,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,uBAAuB,GAAG,oBAAoB,CAAC,CAAC;IACpE,CAAC;IAEO,cAAc,CAAC,IAAY,EAAE,WAA+B;QAClE,MAAM,UAAU,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,8BAA8B;YAC3E,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,8BAA8B,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAClF,OAAO,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,EAChE,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,yEAAyE;IACjE,kBAAkB,CAAC,GAAW;QACpC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,IAAI,GAAG,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,IAAY;QACxB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAC7B,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAED,MAAM,aAAa,GACjB,yFAAyF,CAAC;AAC5F;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,WAA+B;IAC7D,MAAM,IAAI,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE;QACzC,CAAC,CAAC,KAAK,YAAY,CAAC,WAAW,CAAC,uBAAuB,CAAC;IAC1D,OAAO,iDAAiD,IAAI,IAAI;QAC9D,iDAAiD,CAAC;AACtD,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,YAAY,CAAC,OAAe;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC;IACrD,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,OAAO,UAAU,CAAC;AACvE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe;IAC3C,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO;YAC3C,KAAK,EAAE,EAAE,IAAI,EAAE,uBAAuB,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;AAC1D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAe;IAChD,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,MAAM,EAAE;QACrE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;AACrE,CAAC;AAED,SAAS,UAAU,CAAC,OAAe,EAAE,UAAkB,EAAE,OAAe;IACtE,OAAO;QACL,MAAM,EAAE,GAAG;QACX,OAAO;QACP,OAAO,EAAE,EAAE,aAAa,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE;QAChE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE;KAC/D,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,OAAe,EAAE,OAAO,GAAG,qBAAqB;IAC/D,OAAO;QACL,MAAM,EAAE,GAAG;QACX,OAAO;QACP,OAAO,EAAE,EAAE,gBAAgB,EAAE,OAAO,EAAE;QACtC,IAAI,EAAE;YACJ,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,EAAE,IAAI,EAAE,uBAAuB,EAAE,OAAO,EAAE;SAClD;KACF,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,GAAG,MAAM,CAAC;AAC/C,2EAA2E;AAC3E,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAEzC;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IAIN;IACA;IAJF,KAAK,GAAG,IAAI,GAAG,EAA2D,CAAC;IAE5F,YACmB,WAAW,GAAG,EACd,WAAW,oBAAoB;QAD/B,aAAQ,GAAR,QAAQ,CAAM;QACd,aAAQ,GAAR,QAAQ,CAAuB;IAC/C,CAAC;IAEJ;;;;OAIG;IACH,OAAO,CAAC,IAAY,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,SAAS,GAAG,IAAI;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,QAAQ;YACrD,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QAClD,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;QAClB,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC,CAAC;YAC5F,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,GAAG,uBAAuB;YAAE,OAAO,KAAK,CAAC;QACzF,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,IAAY;QACpB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF"}

package/dist/route-identity.d.ts

@@ -9,6 +9,8 @@ export declare function stablePrefixMessageHash(message: Message): string;
 export declare function prefixIdentity(messages: Message[], kind: PrefixIdentity): {
     originalPrefixHashes: string[];
     originalMediaFreeHashes: string[];
+    originalPortableHashes: string[];
+    originalPortableMediaFreeHashes: string[];
 };
 /**
  * Whether `message` still stands where a prefix's message stood: unchanged, or the same
@@ -17,9 +19,11 @@ export declare function prefixIdentity(messages: Message[], kind: PrefixIdentity
  * becomes a placeholder, a top-level one is dropped, an emptied message becomes the
  * placeholder. That counts only when the message has no media left, so an attachment
  * replaced by another never matches; a removed one is indistinguishable from eviction.
- * Prefixes stored before media-free hashes existed match exactly only.
+ * A newer Claude Code can also render the same history differently on resume (see
+ * portableHash), with media kept or (no media left) evicted the same way.
+ * Prefixes stored before media-free or portable hashes existed match exactly only.
  */
-export declare function prefixMessageMatches(message: Message, kind: PrefixIdentity, exact: string, mediaFree: string | undefined): boolean;
+export declare function prefixMessageMatches(message: Message, kind: PrefixIdentity, exact: string, mediaFree: string | undefined, portable?: string, portableMediaFree?: string): boolean;
 /**
  * Whether `newer` carries everything `older` does: every message of `older` after the
  * system prompt (whose billing line changes per call), in place and unchanged apart from

package/dist/route-identity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"route-identity.d.ts","sourceRoot":"","sources":["../src/route-identity.ts"],"names":[],"mappings":"AACA,OAAO,EAA2B,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AASnE,gFAAgF;AAChF,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,QAAQ,CAAC;AAEhD,qFAAqF;AACrF,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAEzD;AAED,mFAAmF;AACnF,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAEhE;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,cAAc,GACxC;IAAE,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAAC,uBAAuB,EAAE,MAAM,EAAE,CAAA;CAAE,CAMvE;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,SAAS,GACnF,OAAO,CAKT;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,OAAO,CAK1E;AAED,sFAAsF;AACtF,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAE7D"}
+{"version":3,"file":"route-identity.d.ts","sourceRoot":"","sources":["../src/route-identity.ts"],"names":[],"mappings":"AACA,OAAO,EAA2B,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AAoBnE,gFAAgF;AAChF,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,QAAQ,CAAC;AAEhD,qFAAqF;AACrF,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAEzD;AAED,mFAAmF;AACnF,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAEhE;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,cAAc,GACxC;IACD,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAAC,uBAAuB,EAAE,MAAM,EAAE,CAAC;IAClE,sBAAsB,EAAE,MAAM,EAAE,CAAC;IAAC,+BAA+B,EAAE,MAAM,EAAE,CAAC;CAC7E,CAQA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,SAAS,EACpF,QAAQ,CAAC,EAAE,MAAM,EAAE,iBAAiB,CAAC,EAAE,MAAM,GAC5C,OAAO,CAQT;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,OAAO,CAK1E;AAED,sFAAsF;AACtF,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAE7D"}

package/dist/route-identity.js

@@ -2,17 +2,18 @@ import { createHash } from "node:crypto";
 import { stripSystemReminderText } from "./turns.js";
 // Request messages are immutable snapshots. Weak keys retain no completed request.
 // Route installation stores these digests, not the original megabytes of history.
-const routeHashes = new WeakMap();
-const stableHashes = new WeakMap();
-const routeMediaFreeHashes = new WeakMap();
-const stableMediaFreeHashes = new WeakMap();
+const hashCaches = new Map();
+/** Each message's tool input JSON strings (jsonStringFields), computed once. */
+const jsonFieldCache = new WeakMap();
+const EXACT = { media: "keep" };
+const MEDIA_FREE = { media: "drop" };
 /** Hash each incoming message once, then reuse it across route candidates/checks. */
 export function routeMessageHash(message) {
-    return messageHash(message, false, false);
+    return messageHash(message, false, EXACT);
 }
 /** Stable prefixes span turns in which Claude can omit earlier thinking blocks. */
 export function stablePrefixMessageHash(message) {
-    return messageHash(message, stableShape(message), false);
+    return messageHash(message, stableShape(message), EXACT);
 }
 /** The identities a prefix stores for the messages it stands for. */
 export function prefixIdentity(messages, kind) {
@@ -20,6 +21,8 @@ export function prefixIdentity(messages, kind) {
     return {
         originalPrefixHashes: messages.map(exact),
         originalMediaFreeHashes: messages.map((m) => mediaFreeHash(m, kind)),
+        originalPortableHashes: messages.map((m) => portableIdentity(m, kind, "keep")),
+        originalPortableMediaFreeHashes: messages.map((m) => portableIdentity(m, kind, "drop")),
     };
 }
 /**
@@ -29,14 +32,21 @@ export function prefixIdentity(messages, kind) {
  * becomes a placeholder, a top-level one is dropped, an emptied message becomes the
  * placeholder. That counts only when the message has no media left, so an attachment
  * replaced by another never matches; a removed one is indistinguishable from eviction.
- * Prefixes stored before media-free hashes existed match exactly only.
+ * A newer Claude Code can also render the same history differently on resume (see
+ * portableHash), with media kept or (no media left) evicted the same way.
+ * Prefixes stored before media-free or portable hashes existed match exactly only.
  */
-export function prefixMessageMatches(message, kind, exact, mediaFree) {
+export function prefixMessageMatches(message, kind, exact, mediaFree, portable, portableMediaFree) {
     const hash = kind === "stable" ? stablePrefixMessageHash(message) : routeMessageHash(message);
     if (hash === exact)
         return true;
-    return mediaFree !== undefined && !carriesMedia(message.content) &&
-        mediaFreeHash(message, kind) === mediaFree;
+    if (portable !== undefined && portableMatches(message, kind, "keep", portable))
+        return true;
+    if (carriesMedia(message.content))
+        return false;
+    return (mediaFree !== undefined && mediaFreeHash(message, kind) === mediaFree) ||
+        (portableMediaFree !== undefined &&
+            portableMatches(message, kind, "drop", portableMediaFree));
 }
 /**
  * Whether `newer` carries everything `older` does: every message of `older` after the
@@ -55,15 +65,84 @@ export function mediaFreeMessageHash(message) {
     return mediaFreeHash(message, "route");
 }
 function mediaFreeHash(message, kind) {
-    return messageHash(message, kind === "stable" && stableShape(message), true);
+    return messageHash(message, kind === "stable" && stableShape(message), MEDIA_FREE);
+}
+/**
+ * An identity that also ignores how Claude Code renders unchanged history, which differs
+ * between versions (2.1.302 -> 2.1.319 on 2026-11-09): a reminder inside a tool result's
+ * text or in a block of its own, a tool result's text as a string or a text block, a tool
+ * input value as the JSON string the model sent or the value a newer Claude Code parsed
+ * it to. Followed by the digests of the message's tool input JSON strings, so that one
+ * still a string is held to the very string stored (portableMatches).
+ */
+function portableIdentity(message, kind, media) {
+    const fields = jsonStringFields(message);
+    const hash = portableHash(message, kind, media);
+    return fields.size ? `${hash}|${JSON.stringify([...fields].sort())}` : hash;
+}
+/**
+ * Whether `message` matches a stored portableIdentity: the same content as rendered either
+ * way, and each tool input it still sends as a JSON string the same string as stored there
+ * (so two strings that parse alike never match); one parsed since matches by its value.
+ */
+function portableMatches(message, kind, media, stored) {
+    const split = stored.indexOf("|");
+    const hash = split === -1 ? stored : stored.slice(0, split);
+    if (portableHash(message, kind, media) !== hash)
+        return false;
+    const fields = jsonStringFields(message);
+    if (!fields.size)
+        return true;
+    let storedFields;
+    try {
+        storedFields = new Map(split === -1 ? [] : JSON.parse(stored.slice(split + 1)));
+    }
+    catch {
+        return false;
+    }
+    for (const [field, digest] of fields)
+        if (storedFields.get(field) !== digest)
+            return false;
+    return true;
+}
+function portableHash(message, kind, media) {
+    return messageHash(message, kind === "stable" && stableShape(message), { media, portable: true });
+}
+/**
+ * The message's tool input values that are JSON strings portableContent parses: tool use
+ * id and input key -> a digest of the string as sent.
+ */
+function jsonStringFields(message) {
+    const cached = jsonFieldCache.get(message);
+    if (cached)
+        return cached;
+    const fields = new Map();
+    const content = Array.isArray(message.content) ? message.content : [];
+    content.forEach((part, index) => {
+        if (part?.type !== "tool_use" || !isPlainObject(part.input))
+            return;
+        for (const [key, value] of Object.entries(part.input)) {
+            if (typeof value !== "string" || parsedJson(value) === value)
+                continue;
+            const digest = createHash("sha256").update(value, "utf16le").digest("hex");
+            fields.set(JSON.stringify([part.id ?? `#${index}`, key]), digest);
+        }
+    });
+    jsonFieldCache.set(message, fields);
+    return fields;
 }
 function stableShape(message) {
     return message.role === "assistant" && Array.isArray(message.content);
 }
-function messageHash(message, stable, mediaFree) {
-    const cache = mediaFree
-        ? (stable ? stableMediaFreeHashes : routeMediaFreeHashes)
-        : (stable ? stableHashes : routeHashes);
+function hashCache(stable, mode) {
+    const key = `${stable}:${mode.media}:${mode.portable === true}`;
+    let cache = hashCaches.get(key);
+    if (!cache)
+        hashCaches.set(key, cache = new WeakMap());
+    return cache;
+}
+function messageHash(message, stable, mode) {
+    const cache = hashCache(stable, mode);
     const cached = cache.get(message);
     if (cached !== undefined)
         return cached;
@@ -73,8 +152,10 @@ function messageHash(message, stable, mediaFree) {
     }
     const blocks = typeof content === "string" ? [{ type: "text", text: content }] : content;
     const reminded = normalizeReminders(blocks);
+    const kept = mode.media === "drop" ? withoutMedia(reminded) : reminded;
     const normalized = {
-        ...message, content: stripBlockCache(mediaFree ? withoutMedia(reminded) : reminded),
+        ...message,
+        content: stripBlockCache(mode.portable ? withoutToolLoadedNotes(portableContent(kept)) : kept),
     };
     const hash = createHash("sha256");
     updateCanonical(hash, normalized);
@@ -102,6 +183,118 @@ function normalizeReminders(content) {
         return part;
     });
 }
+/**
+ * Content with rendering choices canonicalized (portableHash): text blocks left empty by
+ * reminder removal dropped, a tool result's string as one text block, and tool input
+ * values that are JSON strings of an object or array parsed (losslessly: parsedJson).
+ */
+function portableContent(content) {
+    if (!Array.isArray(content))
+        return content;
+    return content.filter((part) => !isEmptyText(part)).map((part) => {
+        if (!part || typeof part !== "object")
+            return part;
+        if (part.type === "tool_result") {
+            const inner = typeof part.content === "string"
+                ? [{ type: "text", text: part.content }] : part.content;
+            return { ...part, content: portableContent(inner) };
+        }
+        if (part.type === "tool_use" && isPlainObject(part.input)) {
+            return { ...part, input: parsedJsonValues(part.input) };
+        }
+        return part;
+    });
+}
+/** Claude Code's note after a ToolSearch result that loaded tools; sent or not by model. */
+const TOOL_LOADED_RE = /^Tool loaded\.(?:\n\[id:[^\]\n]+\])*\n?$/;
+/**
+ * Top-level content without each "Tool loaded." note that follows the turn's tool
+ * results when one of them holds only tool references. On the same Claude Code
+ * (2.1.321), Opus 5.5 gets the note and Fable 5.2 does not, so a model switch changed
+ * old messages (2026-11-09). Mirrors polychat's rerender_match.portable_message.
+ */
+function withoutToolLoadedNotes(content) {
+    if (!Array.isArray(content))
+        return content;
+    return content.filter((part, index) => !(isToolLoadedNote(part) && followsLoadedTools(content, index)));
+}
+function isToolLoadedNote(part) {
+    return part?.type === "text" && typeof part.text === "string" &&
+        TOOL_LOADED_RE.test(part.text) &&
+        Object.keys(part).every((key) => key === "type" || key === "text" || key === "cache_control");
+}
+/**
+ * Whether the run of tool results ending just before `index` loads tools. Earlier notes
+ * are skipped: two ToolSearch calls in one turn leave two notes.
+ */
+function followsLoadedTools(content, index) {
+    for (let i = index - 1; i >= 0; i--) {
+        const part = content[i];
+        if (isToolLoadedNote(part))
+            continue;
+        if (part?.type !== "tool_result")
+            return false;
+        if (Array.isArray(part.content) && part.content.length > 0 &&
+            part.content.every((inner) => inner?.type === "tool_reference"))
+            return true;
+    }
+    return false;
+}
+function isEmptyText(part) {
+    return typeof part === "string" ? part === "" :
+        part?.type === "text" && part.text === "" &&
+            Object.keys(part).every((key) => key === "type" || key === "text" || key === "cache_control");
+}
+/** Defined properties only (Object.fromEntries keeps an own `__proto__` key as data). */
+function parsedJsonValues(input) {
+    return Object.fromEntries(Object.entries(input).map(([key, value]) => [key, parsedJson(value)]));
+}
+/**
+ * A string holding a JSON object or array, parsed, when parsing loses nothing: the string
+ * is the parse's own serialization apart from whitespace between tokens. Anything lossy
+ * (duplicate keys, numbers past double precision or written another way, escapes
+ * JSON.stringify would not write) stays the string it is, so it matches only itself.
+ */
+function parsedJson(value) {
+    if (typeof value !== "string" || !/^\s*[[{]/.test(value))
+        return value;
+    let parsed;
+    try {
+        parsed = JSON.parse(value);
+    }
+    catch {
+        return value;
+    }
+    if (!parsed || typeof parsed !== "object")
+        return value;
+    return JSON.stringify(parsed) === withoutJsonWhitespace(value) ? parsed : value;
+}
+/** JSON text without the whitespace between its tokens (strings kept as written). */
+function withoutJsonWhitespace(text) {
+    let out = "";
+    let inString = false;
+    for (let i = 0; i < text.length; i++) {
+        const ch = text[i];
+        if (inString) {
+            out += ch;
+            if (ch === "\\")
+                out += text[++i] ?? "";
+            else if (ch === '"')
+                inString = false;
+        }
+        else if (ch === '"') {
+            inString = true;
+            out += ch;
+        }
+        else if (ch !== " " && ch !== "\n" && ch !== "\r" && ch !== "\t") {
+            out += ch;
+        }
+    }
+    return out;
+}
+function isPlainObject(value) {
+    return !!value && typeof value === "object" && !Array.isArray(value);
+}
 /**
  * Claude Code's stand-ins for media it removed from its own history. After the API
  * rejects media it removes a message left empty altogether; that shifts positions and