@schoolai/shipyard 3.12.0 → 3.13.0-rc.20260615.0

package/dist/{chunk-HUTIDJIT.js → chunk-IWBDVGD2.js}

@@ -2,7 +2,7 @@
 import {
   PUBLISHED_PREVIEW_KINDS,
   PUBLISH_TTL_CHOICES
-} from "./chunk-LUKN75OT.js";
+} from "./chunk-M3WBYTB3.js";
 import {
   external_exports
 } from "./chunk-JCEWPG3R.js";
@@ -11538,11 +11538,11 @@ var fromCodePoint = (
   }
 );
 function replaceCodePoint(codePoint) {
-  var _a2;
+  var _a3;
   if (codePoint >= 55296 && codePoint <= 57343 || codePoint > 1114111) {
     return 65533;
   }
-  return (_a2 = decodeMap.get(codePoint)) !== null && _a2 !== void 0 ? _a2 : codePoint;
+  return (_a3 = decodeMap.get(codePoint)) !== null && _a3 !== void 0 ? _a3 : codePoint;
 }
 
 // ../../node_modules/.pnpm/entities@4.5.0/node_modules/entities/lib/esm/decode.js
@@ -11739,9 +11739,9 @@ var EntityDecoder = class {
    * @returns The number of characters that were consumed.
    */
   emitNumericEntity(lastCp, expectedLength) {
-    var _a2;
+    var _a3;
     if (this.consumed <= expectedLength) {
-      (_a2 = this.errors) === null || _a2 === void 0 ? void 0 : _a2.absenceOfDigitsInNumericCharacterReference(this.consumed);
+      (_a3 = this.errors) === null || _a3 === void 0 ? void 0 : _a3.absenceOfDigitsInNumericCharacterReference(this.consumed);
       return 0;
     }
     if (lastCp === CharCodes.SEMI) {
@@ -11801,11 +11801,11 @@ var EntityDecoder = class {
    * @returns The number of characters consumed.
    */
   emitNotTerminatedNamedEntity() {
-    var _a2;
+    var _a3;
     const { result, decodeTree } = this;
     const valueLength = (decodeTree[result] & BinTrieFlags.VALUE_LENGTH) >> 14;
     this.emitNamedEntityData(result, valueLength, this.consumed);
-    (_a2 = this.errors) === null || _a2 === void 0 ? void 0 : _a2.missingSemicolonAfterCharacterReference();
+    (_a3 = this.errors) === null || _a3 === void 0 ? void 0 : _a3.missingSemicolonAfterCharacterReference();
     return this.consumed;
   }
   /**
@@ -11833,7 +11833,7 @@ var EntityDecoder = class {
    * @returns The number of characters consumed.
    */
   end() {
-    var _a2;
+    var _a3;
     switch (this.state) {
       case EntityDecoderState.NamedEntity: {
         return this.result !== 0 && (this.decodeMode !== DecodingMode.Attribute || this.result === this.treeIndex) ? this.emitNotTerminatedNamedEntity() : 0;
@@ -11846,7 +11846,7 @@ var EntityDecoder = class {
         return this.emitNumericEntity(0, 3);
       }
       case EntityDecoderState.NumericStart: {
-        (_a2 = this.errors) === null || _a2 === void 0 ? void 0 : _a2.absenceOfDigitsInNumericCharacterReference(this.consumed);
+        (_a3 = this.errors) === null || _a3 === void 0 ? void 0 : _a3.absenceOfDigitsInNumericCharacterReference(this.consumed);
         return 0;
       }
       case EntityDecoderState.EntityStart: {
@@ -12842,21 +12842,21 @@ function linkify(state) {
         if (links.length > 0 && links[0].index === 0 && i > 0 && tokens[i - 1].type === "text_special") {
           links = links.slice(1);
         }
-        for (let ln = 0; ln < links.length; ln++) {
-          const url = links[ln].url;
+        for (let ln2 = 0; ln2 < links.length; ln2++) {
+          const url = links[ln2].url;
           const fullUrl = state.md.normalizeLink(url);
           if (!state.md.validateLink(fullUrl)) {
             continue;
           }
-          let urlText = links[ln].text;
-          if (!links[ln].schema) {
+          let urlText = links[ln2].text;
+          if (!links[ln2].schema) {
             urlText = state.md.normalizeLinkText("http://" + urlText).replace(/^http:\/\//, "");
-          } else if (links[ln].schema === "mailto:" && !/^mailto:/i.test(urlText)) {
+          } else if (links[ln2].schema === "mailto:" && !/^mailto:/i.test(urlText)) {
             urlText = state.md.normalizeLinkText("mailto:" + urlText).replace(/^mailto:/, "");
           } else {
             urlText = state.md.normalizeLinkText(urlText);
           }
-          const pos = links[ln].index;
+          const pos = links[ln2].index;
           if (pos > lastPos) {
             const token = new state.Token("text", "", 0);
             token.content = text2.slice(lastPos, pos);
@@ -12878,7 +12878,7 @@ function linkify(state) {
           token_c.markup = "linkify";
           token_c.info = "auto";
           nodes.push(token_c);
-          lastPos = links[ln].lastIndex;
+          lastPos = links[ln2].lastIndex;
         }
         if (lastPos < text2.length) {
           const token = new state.Token("text", "", 0);
@@ -15308,8 +15308,8 @@ function isLinkClose2(str) {
   return /^<\/a\s*>/i.test(str);
 }
 function isLetter(ch) {
-  const lc = ch | 32;
-  return lc >= 97 && lc <= 122;
+  const lc2 = ch | 32;
+  return lc2 >= 97 && lc2 <= 122;
 }
 function html_inline(state, silent) {
   if (!state.md.options.html) {
@@ -17904,6 +17904,18 @@ var PlanRepository = class {
   docIdFor(taskId) {
     return buildPlanDocId(taskId, this.#epoch);
   }
+  /**
+   * FM-2: whether this task's plan doc has on-disk chunks. Returns `null` when no
+   * storage boundary is injected (browser repos, in-memory tests) — the caller
+   * then can't distinguish transient-error from absent and falls back to its
+   * prior behavior. A non-null boolean lets the lazy rebuild treat
+   * "empty-read-but-dir-present" as a transient storage error rather than a
+   * confirmed-absent doc, so it never clobbers a real on-disk plan.
+   */
+  async hasOnDiskDoc(taskId) {
+    if (!this.#storageBoundary) return null;
+    return this.#storageBoundary.hasDoc(buildPlanDocId(taskId, this.#epoch));
+  }
   dispose() {
     this.#planDocs.clear();
     this.#subscriberCounts.clear();
@@ -19151,6 +19163,7 @@ var TokenCategoryItemSchema = external_exports.object({
 var PersistedTurnStatsSchema = external_exports.object({
   type: external_exports.literal("turn_stats"),
   taskId: external_exports.string(),
+  threadId: external_exports.string().optional(),
   totalCostUsd: external_exports.number(),
   durationMs: external_exports.number(),
   durationApiMs: external_exports.number(),
@@ -19594,6 +19607,7 @@ var TaskRecordSchema = external_exports.object({
    * `claude --resume <sessionId>`.
    */
   currentSessionId: external_exports.string().nullable().default(null),
+  clearedAtSeqNo: external_exports.number().int().nullable().default(null),
   /**
    * Drives the browser overlay shown during task bring-up. `starting_from_linear`
    * means the daemon is provisioning a worktree + first message before unmasking
@@ -21721,7 +21735,19 @@ var BrowserToDaemonControlMessageSchema = external_exports.discriminatedUnion("t
      * Optional/nullable: pre-PROTOCOL_VERSION 60 browsers omit this and the
      * daemon falls back to the cached snapshot (existing behavior).
      */
-    force: external_exports.boolean().optional()
+    force: external_exports.boolean().optional(),
+    /**
+     * The browser's PROTOCOL_VERSION, advertised on the first
+     * `request_capabilities` frame sent after the data channel opens
+     * (PROTOCOL_VERSION 139). The daemon uses this to gate per-peer
+     * deflate compression on the outbound daemon-control channel:
+     * frames ≥ 1 KB are compressed only when this value is ≥
+     * CONTROL_COMPRESSION_MIN_VERSION (= 139).
+     *
+     * Additive / optional: pre-v139 browsers omit this field; the daemon
+     * treats its absence as "compression not supported" and sends plain JSON.
+     */
+    protocolVersion: external_exports.number().int().optional()
   }),
   /**
    * Browser asks the daemon to send the current skills list (PROTOCOL_VERSION
@@ -21997,6 +22023,16 @@ var BrowserToDaemonControlMessageSchema = external_exports.discriminatedUnion("t
     ids: external_exports.array(external_exports.string())
   }),
   external_exports.object({ type: external_exports.literal("request_annotation_snapshot"), taskId: external_exports.string() }),
+  /**
+   * Browser asks the daemon to re-push the visualization HTML for a task's
+   * canvas `html` elements (PROTOCOL_VERSION 137). Mirrors
+   * `request_annotation_snapshot`: fired on control-channel open + task-switch
+   * so a reloaded browser (whose sessionStorage viz cache was cleared) re-pulls
+   * content the CRDT element references by slug. The daemon responds with the
+   * existing `viz_content_batch`. Pre-137 daemons `safeParse`-drop this and the
+   * browser falls back to the inline CRDT `data.content` (no regression).
+   */
+  external_exports.object({ type: external_exports.literal("request_viz_content_batch"), taskId: external_exports.string() }),
   /**
    * Browser asks for the heavy DOM-detail fields stripped from
    * `annotation_snapshot` / `annotation_added` (elementHtml, cssClasses,
@@ -23409,7 +23445,11 @@ var DaemonToBrowserControlMessageSchema = external_exports.discriminatedUnion("t
     /** Codex BASELINE_TOKENS (~12k) for display calculation. Absent for non-Codex runtimes. */
     nativeBaseline: external_exports.number().optional()
   }),
-  external_exports.object({ type: external_exports.literal("session_cleared"), taskId: external_exports.string() }),
+  external_exports.object({
+    type: external_exports.literal("session_cleared"),
+    taskId: external_exports.string(),
+    clearedAtSeqNo: external_exports.number().int().default(-1)
+  }),
   /**
    * Cross-runtime handoff result (PROTOCOL_VERSION 114). Emitted by the
    * daemon on each per-runtime import path (Claude sessionStore prep,
@@ -24234,9 +24274,22 @@ function parseFileUri(uri) {
 function classifyCriticality(msg) {
   switch (msg.type) {
     /**
-     * Best-effort: idempotent presence fanout. A dropped delta is corrected
-     * by the next `presence_state` snapshot. Presence staleness for <1s is
-     * imperceptible and these messages are high-frequency during agent runs.
+     * Best-effort: idempotent fanout messages that self-correct on the next
+     * emission and do not block any awaited browser action.
+     *
+     * - presence_state / presence_delta: A dropped delta is corrected by the
+     *   next snapshot. Presence staleness for <1s is imperceptible; these are
+     *   high-frequency during agent runs.
+     *
+     * - resource_batch_state: Drives the "Send now" countdown UI
+     *   (useResourceBatchStore ← batch-countdown.tsx). The snapshot is
+     *   replace-not-merge — the store self-corrects on the next live emit or
+     *   on a turn-end `flushAt: null`. A mid-turn reconnect is also covered:
+     *   the browser control-channel manager's dc close handler calls
+     *   `useResourceBatchStore.getState().clearAll()` so no stale countdown
+     *   lingers after the channel tears down. Moving out of the ALO outbox
+     *   eliminates 154 K persisted sends / 44 MB per 48 h while the browser
+     *   still receives every emission over the live channel.
      *
      * ALL other messages stay critical regardless of topic, because they are
      * `requestId`-correlated replies (browser awaits with a 30s timeout and
@@ -24245,6 +24298,7 @@ function classifyCriticality(msg) {
      */
     case "presence_state":
     case "presence_delta":
+    case "resource_batch_state":
       return "best-effort";
     /**
      * Critical: everything else. Includes (but is not limited to):
@@ -24312,7 +24366,6 @@ function classifyCriticality(msg) {
     case "plugin_cc_install_status":
     case "plugin_cc_uninstall_status":
     case "plugin_data_response":
-    case "resource_batch_state":
     case "resource_changed":
     case "resource_read_response":
     case "agent_install_status":
@@ -27287,11 +27340,30 @@ var ChunkReassembler = class {
     );
     return assembled;
   }
-  /** Try to parse raw data, handling chunked messages transparently. */
-  parseOrReassemble(data) {
+  /**
+   * Try to parse raw data, handling chunked messages and optional inflation
+   * transparently.
+   *
+   * @param data   - The raw string received from the data channel.
+   * @param inflate - Optional transform applied to the fully-assembled string
+   *   BEFORE JSON.parse. Used by the control channel to inflate compressed
+   *   frames (PROTOCOL_VERSION 139). The inflater is a no-op for plain frames
+   *   (it returns the input unchanged when no marker is present), so passing
+   *   `maybeInflateControlFrame` is safe even when compression is not in use.
+   *   Applied to both single-message and reassembled-chunk paths so that
+   *   compressed chunked messages are handled correctly.
+   */
+  parseOrReassemble(data, inflate) {
     let parsed;
+    let inflated;
+    try {
+      inflated = inflate ? inflate(data) : data;
+    } catch {
+      this.#log(`[ControlChannelManager] control frame inflate failed`);
+      return null;
+    }
     try {
-      parsed = JSON.parse(data);
+      parsed = JSON.parse(inflated);
     } catch {
       this.#log(`[ControlChannelManager] Invalid JSON from daemon`);
       return null;
@@ -27305,8 +27377,15 @@ var ChunkReassembler = class {
       };
       const reassembled = this.reassemble(chunk);
       if (!reassembled) return null;
+      let inflatedReassembled;
       try {
-        return JSON.parse(reassembled);
+        inflatedReassembled = inflate ? inflate(reassembled) : reassembled;
+      } catch {
+        this.#log(`[ControlChannelManager] control frame inflate failed`);
+        return null;
+      }
+      try {
+        return JSON.parse(inflatedReassembled);
       } catch {
         this.#log(`[ControlChannelManager] Invalid JSON after chunk reassembly`);
         return null;
@@ -27344,6 +27423,531 @@ function chunkSerializedMessage(data, opts) {
   return chunks;
 }
 
+// ../../node_modules/.pnpm/fflate@0.8.3/node_modules/fflate/esm/index.mjs
+import { createRequire } from "module";
+var require2 = createRequire("/");
+var _a2;
+var Worker;
+var isMarkedAsUntransferable;
+try {
+  _a2 = require2("worker_threads"), Worker = _a2.Worker, isMarkedAsUntransferable = _a2.isMarkedAsUntransferable;
+} catch (e) {
+}
+var u8 = Uint8Array;
+var u16 = Uint16Array;
+var i32 = Int32Array;
+var fleb = new u8([
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  1,
+  1,
+  1,
+  1,
+  2,
+  2,
+  2,
+  2,
+  3,
+  3,
+  3,
+  3,
+  4,
+  4,
+  4,
+  4,
+  5,
+  5,
+  5,
+  5,
+  0,
+  /* unused */
+  0,
+  0,
+  /* impossible */
+  0
+]);
+var fdeb = new u8([
+  0,
+  0,
+  0,
+  0,
+  1,
+  1,
+  2,
+  2,
+  3,
+  3,
+  4,
+  4,
+  5,
+  5,
+  6,
+  6,
+  7,
+  7,
+  8,
+  8,
+  9,
+  9,
+  10,
+  10,
+  11,
+  11,
+  12,
+  12,
+  13,
+  13,
+  /* unused */
+  0,
+  0
+]);
+var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
+var freb = function(eb, start) {
+  var b = new u16(31);
+  for (var i = 0; i < 31; ++i) {
+    b[i] = start += 1 << eb[i - 1];
+  }
+  var r = new i32(b[30]);
+  for (var i = 1; i < 30; ++i) {
+    for (var j = b[i]; j < b[i + 1]; ++j) {
+      r[j] = j - b[i] << 5 | i;
+    }
+  }
+  return { b, r };
+};
+var _a2 = freb(fleb, 2);
+var fl = _a2.b;
+var revfl = _a2.r;
+fl[28] = 258, revfl[258] = 28;
+var _b = freb(fdeb, 0);
+var fd = _b.b;
+var revfd = _b.r;
+var rev = new u16(32768);
+for (i = 0; i < 32768; ++i) {
+  x = (i & 43690) >> 1 | (i & 21845) << 1;
+  x = (x & 52428) >> 2 | (x & 13107) << 2;
+  x = (x & 61680) >> 4 | (x & 3855) << 4;
+  rev[i] = ((x & 65280) >> 8 | (x & 255) << 8) >> 1;
+}
+var x;
+var i;
+var hMap = (function(cd, mb, r) {
+  var s = cd.length;
+  var i = 0;
+  var l = new u16(mb);
+  for (; i < s; ++i) {
+    if (cd[i])
+      ++l[cd[i] - 1];
+  }
+  var le = new u16(mb);
+  for (i = 1; i < mb; ++i) {
+    le[i] = le[i - 1] + l[i - 1] << 1;
+  }
+  var co;
+  if (r) {
+    co = new u16(1 << mb);
+    var rvb = 15 - mb;
+    for (i = 0; i < s; ++i) {
+      if (cd[i]) {
+        var sv = i << 4 | cd[i];
+        var r_1 = mb - cd[i];
+        var v = le[cd[i] - 1]++ << r_1;
+        for (var m = v | (1 << r_1) - 1; v <= m; ++v) {
+          co[rev[v] >> rvb] = sv;
+        }
+      }
+    }
+  } else {
+    co = new u16(s);
+    for (i = 0; i < s; ++i) {
+      if (cd[i]) {
+        co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
+      }
+    }
+  }
+  return co;
+});
+var flt = new u8(288);
+for (i = 0; i < 144; ++i)
+  flt[i] = 8;
+var i;
+for (i = 144; i < 256; ++i)
+  flt[i] = 9;
+var i;
+for (i = 256; i < 280; ++i)
+  flt[i] = 7;
+var i;
+for (i = 280; i < 288; ++i)
+  flt[i] = 8;
+var i;
+var fdt = new u8(32);
+for (i = 0; i < 32; ++i)
+  fdt[i] = 5;
+var i;
+var flm = /* @__PURE__ */ hMap(flt, 9, 0);
+var fdm = /* @__PURE__ */ hMap(fdt, 5, 0);
+var shft = function(p) {
+  return (p + 7) / 8 | 0;
+};
+var slc = function(v, s, e) {
+  if (s == null || s < 0)
+    s = 0;
+  if (e == null || e > v.length)
+    e = v.length;
+  return new u8(v.subarray(s, e));
+};
+var wbits = function(d, p, v) {
+  v <<= p & 7;
+  var o = p / 8 | 0;
+  d[o] |= v;
+  d[o + 1] |= v >> 8;
+};
+var wbits16 = function(d, p, v) {
+  v <<= p & 7;
+  var o = p / 8 | 0;
+  d[o] |= v;
+  d[o + 1] |= v >> 8;
+  d[o + 2] |= v >> 16;
+};
+var hTree = function(d, mb) {
+  var t = [];
+  for (var i = 0; i < d.length; ++i) {
+    if (d[i])
+      t.push({ s: i, f: d[i] });
+  }
+  var s = t.length;
+  var t2 = t.slice();
+  if (!s)
+    return { t: et, l: 0 };
+  if (s == 1) {
+    var v = new u8(t[0].s + 1);
+    v[t[0].s] = 1;
+    return { t: v, l: 1 };
+  }
+  t.sort(function(a, b) {
+    return a.f - b.f;
+  });
+  t.push({ s: -1, f: 25001 });
+  var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
+  t[0] = { s: -1, f: l.f + r.f, l, r };
+  while (i1 != s - 1) {
+    l = t[t[i0].f < t[i2].f ? i0++ : i2++];
+    r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
+    t[i1++] = { s: -1, f: l.f + r.f, l, r };
+  }
+  var maxSym = t2[0].s;
+  for (var i = 1; i < s; ++i) {
+    if (t2[i].s > maxSym)
+      maxSym = t2[i].s;
+  }
+  var tr = new u16(maxSym + 1);
+  var mbt = ln(t[i1 - 1], tr, 0);
+  if (mbt > mb) {
+    var i = 0, dt = 0;
+    var lft = mbt - mb, cst = 1 << lft;
+    t2.sort(function(a, b) {
+      return tr[b.s] - tr[a.s] || a.f - b.f;
+    });
+    for (; i < s; ++i) {
+      var i2_1 = t2[i].s;
+      if (tr[i2_1] > mb) {
+        dt += cst - (1 << mbt - tr[i2_1]);
+        tr[i2_1] = mb;
+      } else
+        break;
+    }
+    dt >>= lft;
+    while (dt > 0) {
+      var i2_2 = t2[i].s;
+      if (tr[i2_2] < mb)
+        dt -= 1 << mb - tr[i2_2]++ - 1;
+      else
+        ++i;
+    }
+    for (; i >= 0 && dt; --i) {
+      var i2_3 = t2[i].s;
+      if (tr[i2_3] == mb) {
+        --tr[i2_3];
+        ++dt;
+      }
+    }
+    mbt = mb;
+  }
+  return { t: new u8(tr), l: mbt };
+};
+var ln = function(n, l, d) {
+  return n.s == -1 ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1)) : l[n.s] = d;
+};
+var lc = function(c) {
+  var s = c.length;
+  while (s && !c[--s])
+    ;
+  var cl = new u16(++s);
+  var cli = 0, cln = c[0], cls = 1;
+  var w = function(v) {
+    cl[cli++] = v;
+  };
+  for (var i = 1; i <= s; ++i) {
+    if (c[i] == cln && i != s)
+      ++cls;
+    else {
+      if (!cln && cls > 2) {
+        for (; cls > 138; cls -= 138)
+          w(32754);
+        if (cls > 2) {
+          w(cls > 10 ? cls - 11 << 5 | 28690 : cls - 3 << 5 | 12305);
+          cls = 0;
+        }
+      } else if (cls > 3) {
+        w(cln), --cls;
+        for (; cls > 6; cls -= 6)
+          w(8304);
+        if (cls > 2)
+          w(cls - 3 << 5 | 8208), cls = 0;
+      }
+      while (cls--)
+        w(cln);
+      cls = 1;
+      cln = c[i];
+    }
+  }
+  return { c: cl.subarray(0, cli), n: s };
+};
+var clen = function(cf, cl) {
+  var l = 0;
+  for (var i = 0; i < cl.length; ++i)
+    l += cf[i] * cl[i];
+  return l;
+};
+var wfblk = function(out, pos, dat) {
+  var s = dat.length;
+  var o = shft(pos + 2);
+  out[o] = s & 255;
+  out[o + 1] = s >> 8;
+  out[o + 2] = out[o] ^ 255;
+  out[o + 3] = out[o + 1] ^ 255;
+  for (var i = 0; i < s; ++i)
+    out[o + i + 4] = dat[i];
+  return (o + 4 + s) * 8;
+};
+var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
+  wbits(out, p++, final);
+  ++lf[256];
+  var _a3 = hTree(lf, 15), dlt = _a3.t, mlb = _a3.l;
+  var _b2 = hTree(df, 15), ddt = _b2.t, mdb = _b2.l;
+  var _c = lc(dlt), lclt = _c.c, nlc = _c.n;
+  var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;
+  var lcfreq = new u16(19);
+  for (var i = 0; i < lclt.length; ++i)
+    ++lcfreq[lclt[i] & 31];
+  for (var i = 0; i < lcdt.length; ++i)
+    ++lcfreq[lcdt[i] & 31];
+  var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;
+  var nlcc = 19;
+  for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
+    ;
+  var flen = bl + 5 << 3;
+  var ftlen = clen(lf, flt) + clen(df, fdt) + eb;
+  var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];
+  if (bs >= 0 && flen <= ftlen && flen <= dtlen)
+    return wfblk(out, p, dat.subarray(bs, bs + bl));
+  var lm, ll, dm, dl;
+  wbits(out, p, 1 + (dtlen < ftlen)), p += 2;
+  if (dtlen < ftlen) {
+    lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;
+    var llm = hMap(lct, mlcb, 0);
+    wbits(out, p, nlc - 257);
+    wbits(out, p + 5, ndc - 1);
+    wbits(out, p + 10, nlcc - 4);
+    p += 14;
+    for (var i = 0; i < nlcc; ++i)
+      wbits(out, p + 3 * i, lct[clim[i]]);
+    p += 3 * nlcc;
+    var lcts = [lclt, lcdt];
+    for (var it = 0; it < 2; ++it) {
+      var clct = lcts[it];
+      for (var i = 0; i < clct.length; ++i) {
+        var len = clct[i] & 31;
+        wbits(out, p, llm[len]), p += lct[len];
+        if (len > 15)
+          wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
+      }
+    }
+  } else {
+    lm = flm, ll = flt, dm = fdm, dl = fdt;
+  }
+  for (var i = 0; i < li; ++i) {
+    var sym = syms[i];
+    if (sym > 255) {
+      var len = sym >> 18 & 31;
+      wbits16(out, p, lm[len + 257]), p += ll[len + 257];
+      if (len > 7)
+        wbits(out, p, sym >> 23 & 31), p += fleb[len];
+      var dst = sym & 31;
+      wbits16(out, p, dm[dst]), p += dl[dst];
+      if (dst > 3)
+        wbits16(out, p, sym >> 5 & 8191), p += fdeb[dst];
+    } else {
+      wbits16(out, p, lm[sym]), p += ll[sym];
+    }
+  }
+  wbits16(out, p, lm[256]);
+  return p + ll[256];
+};
+var deo = /* @__PURE__ */ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);
+var et = /* @__PURE__ */ new u8(0);
+var dflt = function(dat, lvl, plvl, pre, post, st) {
+  var s = st.z || dat.length;
+  var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7e3)) + post);
+  var w = o.subarray(pre, o.length - post);
+  var lst = st.l;
+  var pos = (st.r || 0) & 7;
+  if (lvl) {
+    if (pos)
+      w[0] = st.r >> 3;
+    var opt = deo[lvl - 1];
+    var n = opt >> 13, c = opt & 8191;
+    var msk_1 = (1 << plvl) - 1;
+    var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
+    var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
+    var hsh = function(i2) {
+      return (dat[i2] ^ dat[i2 + 1] << bs1_1 ^ dat[i2 + 2] << bs2_1) & msk_1;
+    };
+    var syms = new i32(25e3);
+    var lf = new u16(288), df = new u16(32);
+    var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
+    for (; i + 2 < s; ++i) {
+      var hv = hsh(i);
+      var imod = i & 32767, pimod = head[hv];
+      prev[imod] = pimod;
+      head[hv] = imod;
+      if (wi <= i) {
+        var rem = s - i;
+        if ((lc_1 > 7e3 || li > 24576) && (rem > 423 || !lst)) {
+          pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
+          li = lc_1 = eb = 0, bs = i;
+          for (var j = 0; j < 286; ++j)
+            lf[j] = 0;
+          for (var j = 0; j < 30; ++j)
+            df[j] = 0;
+        }
+        var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
+        if (rem > 2 && hv == hsh(i - dif)) {
+          var maxn = Math.min(n, rem) - 1;
+          var maxd = Math.min(32767, i);
+          var ml = Math.min(258, rem);
+          while (dif <= maxd && --ch_1 && imod != pimod) {
+            if (dat[i + l] == dat[i + l - dif]) {
+              var nl = 0;
+              for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
+                ;
+              if (nl > l) {
+                l = nl, d = dif;
+                if (nl > maxn)
+                  break;
+                var mmd = Math.min(dif, nl - 2);
+                var md = 0;
+                for (var j = 0; j < mmd; ++j) {
+                  var ti = i - dif + j & 32767;
+                  var pti = prev[ti];
+                  var cd = ti - pti & 32767;
+                  if (cd > md)
+                    md = cd, pimod = ti;
+                }
+              }
+            }
+            imod = pimod, pimod = prev[imod];
+            dif += imod - pimod & 32767;
+          }
+        }
+        if (d) {
+          syms[li++] = 268435456 | revfl[l] << 18 | revfd[d];
+          var lin = revfl[l] & 31, din = revfd[d] & 31;
+          eb += fleb[lin] + fdeb[din];
+          ++lf[257 + lin];
+          ++df[din];
+          wi = i + l;
+          ++lc_1;
+        } else {
+          syms[li++] = dat[i];
+          ++lf[dat[i]];
+        }
+      }
+    }
+    for (i = Math.max(i, wi); i < s; ++i) {
+      syms[li++] = dat[i];
+      ++lf[dat[i]];
+    }
+    pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
+    if (!lst) {
+      st.r = pos & 7 | w[pos / 8 | 0] << 3;
+      pos -= 7;
+      st.h = head, st.p = prev, st.i = i, st.w = wi;
+    }
+  } else {
+    for (var i = st.w || 0; i < s + lst; i += 65535) {
+      var e = i + 65535;
+      if (e >= s) {
+        w[pos / 8 | 0] = lst;
+        e = s;
+      }
+      pos = wfblk(w, pos + 1, dat.subarray(i, e));
+    }
+    st.i = s;
+  }
+  return slc(o, 0, pre + shft(pos) + post);
+};
+var dopt = function(dat, opt, pre, post, st) {
+  if (!st) {
+    st = { l: 1 };
+    if (opt.dictionary) {
+      var dict = opt.dictionary.subarray(-32768);
+      var newDat = new u8(dict.length + dat.length);
+      newDat.set(dict);
+      newDat.set(dat, dict.length);
+      dat = newDat;
+      st.w = dict.length;
+    }
+  }
+  return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20 : 12 + opt.mem, pre, post, st);
+};
+function deflateSync(data, opts) {
+  return dopt(data, opts || {}, 0, 0);
+}
+var td = typeof TextDecoder != "undefined" && /* @__PURE__ */ new TextDecoder();
+var tds = 0;
+try {
+  td.decode(et, { stream: true });
+  tds = 1;
+} catch (e) {
+}
+
+// ../../packages/loro-schema/src/transport/control-compression.ts
+var COMPRESSION_MARKER = "";
+var DEFAULT_THRESHOLD2 = 1024;
+function compressControlFrame(json) {
+  const utf8 = new TextEncoder().encode(json);
+  const compressed = deflateSync(utf8);
+  let binary = "";
+  for (const byte of compressed) {
+    binary += String.fromCharCode(byte);
+  }
+  const base64 = btoa(binary);
+  return COMPRESSION_MARKER + base64;
+}
+function shouldCompress(json, peerSupportsCompression, threshold = DEFAULT_THRESHOLD2) {
+  return peerSupportsCompression && json.length > threshold;
+}
+function maybeCompressFrame(json, peerSupportsCompression) {
+  return shouldCompress(json, peerSupportsCompression) ? compressControlFrame(json) : json;
+}
+
 // ../../packages/loro-schema/src/transport/guarded-channel.ts
 var DEFAULT_MAX_QUEUED_BYTES = 5e5;
 var DEFAULT_HIGH_WATER_BYTES = 1048576;
@@ -28209,6 +28813,7 @@ export {
   AtLeastOnceHighWaterMarkSchema,
   AtLeastOnceShell,
   ChunkReassembler,
+  maybeCompressFrame,
   GuardedChannel,
   LOCAL_DIRECT_SUBPROTOCOL_PREFIX,
   FRAME_HELLO,
@@ -28230,4 +28835,4 @@ export {
   encodeDrain,
   decodeFrame
 };
-//# sourceMappingURL=chunk-HUTIDJIT.js.map
+//# sourceMappingURL=chunk-IWBDVGD2.js.map