thinkpool-pair 0.7.67 → 0.7.69

package/bridge.mjs

@@ -39,7 +39,7 @@ import { createClient } from '@supabase/supabase-js'
 import { startClaudeSession } from './claude-session.mjs'
 import { turnInFlight } from './update-gate.mjs'
 import { saveSession, flushSession, deleteSession, loadAll, canResume, loadPtyId, savePtyId, loadNames, saveNames } from './session-store.mjs'
-import { stampEvent, makeSeqCounter, maxSeq, seqable, capReplayEvents } from './event-id.mjs'
+import { stampEvent, makeSeqCounter, maxSeq, seqable, capReplayEvents, chunkReplayEvents } from './event-id.mjs'
 import { makeThrottledTrack } from './presence.mjs'
 
 // Public client creds (the same anon values the web app ships — safe to embed).
@@ -454,8 +454,37 @@ const webPeerPresent = () => {
   return false
 }
 
+// Realtime broadcast silently DROPS frames over its size limit AND can break the
+// socket for the rest of the tick — the 2026-06-26 reload-freeze (a 5.4MB replay).
+// This is the universal backstop: ANY oversized frame (replay OR a giant live
+// tool_result/assistant blob) is (a) LOGGED loudly so it can never be a silent black
+// hole again, and (b) defanged by truncating the largest string field so the frame
+// still delivers instead of taking the channel down. capReplayEvents bounds bulk
+// replays before they reach here; this catches the single-event case + is the alarm.
+const FRAME_SOFT_LIMIT = 200000
+const defendFrame = (event, payload) => {
+  let json
+  try { json = JSON.stringify(payload) } catch { return payload }
+  if (!json || json.length <= FRAME_SOFT_LIMIT) return payload
+  process.stderr.write(`\n  ⚠ oversized ${event} frame: ${json.length}B (term ${String(payload?.term || '?').slice(0, 8)}) — truncating to fit so delivery isn't dropped\n`)
+  try {
+    const p = JSON.parse(json)
+    const evt = p.evt
+    if (evt && typeof evt === 'object') {
+      for (const k of ['text', 'content', 'output', 'stdout', 'stderr']) {
+        if (typeof evt[k] === 'string' && evt[k].length > 20000) {
+          const orig = evt[k].length
+          evt[k] = evt[k].slice(0, 20000) + `\n…[truncated ${orig - 20000} bytes — too large to broadcast]`
+        }
+      }
+    }
+    return p
+  } catch { return payload }
+}
+
 const bcast = (event, payload) => {
   if (event === 'pty-out' || event === 'code-event') lastActivity = Date.now()
+  payload = defendFrame(event, payload)
   try {
     if (channel.channelAdapter?.canPush?.() ?? true) {
       channel.send({ type: 'broadcast', event, payload })
@@ -992,11 +1021,22 @@ channel
     for (const [id, s] of sessions) {
       if (!s.log.length) continue
       const from = Number(payload?.cursors?.[id]) || 0
-      const tail = from > 0 ? s.log.filter((e) => e.seq == null || e.seq > from) : s.log
-      // Cap to a frame-safe size — the full log on a fresh-reload (empty cursor) is
-      // multi-MB and gets dropped by Realtime, freezing the terminal. See capReplayEvents.
-      const events = capReplayEvents(tail)
-      bcast('code-replay', { to: payload?.to ?? null, term: id, events })
+      const mx = maxSeq(s.log)
+      // Cursor-sanity (B-safety): if the client's cursor is AHEAD of our highest seq, the
+      // bridge restarted BEHIND the client (lost unflushed events) or a /clear reset the
+      // counter — our live seqs would all read as "already seen" and be dropped forever
+      // (the seq-divergence freeze). Replay the full recent tail and flag `reset` so the
+      // client rebuilds its cursor from our authoritative log instead of trusting its own.
+      const ahead = from > mx
+      const tail = (from > 0 && !ahead) ? s.log.filter((e) => e.seq == null || e.seq > from) : s.log
+      // Chunk the tail into ORDERED under-budget frames (A): the full log on a fresh reload
+      // (empty cursor) is multi-MB and a single frame would be dropped by Realtime, freezing
+      // the terminal. chunkReplayEvents splits it so nothing in the recent window is lost;
+      // classifyReplay applies the chunks in arrival order. Older history beyond the chunk
+      // budget is covered by the client's DB transcript snapshot.
+      for (const events of chunkReplayEvents(tail)) {
+        bcast('code-replay', { to: payload?.to ?? null, term: id, events, ...(ahead ? { reset: true } : {}) })
+      }
     }
     // Re-send any still-pending permission/question cards. They ride a one-shot
     // code-perm-req broadcast (NOT the replayed event log), so a reconnect/refresh

package/event-id.mjs

@@ -93,3 +93,34 @@ export function capReplayEvents(events, budget = REPLAY_BYTE_BUDGET) {
   }
   return i === 0 ? events : events.slice(i)
 }
+
+// A (2026-06-26 follow-up): chunk the replay tail into ORDERED, under-budget frames so
+// no event in the recent window is lost (capReplayEvents truncates; this doesn't). Each
+// returned chunk is broadcast as its own `code-replay` — seqDedup.classifyReplay applies
+// them in order (each chunk is contiguous and seq > seqHi), so the client rebuilds the
+// whole window across frames. We keep the MOST RECENT `maxChunks * budget` bytes (older
+// history is the DB transcript snapshot's job) so a giant log doesn't fan out 30+ frames.
+// Returns an array of event-arrays, oldest chunk first; [] when there's nothing to send.
+export const REPLAY_MAX_CHUNKS = 6
+export function chunkReplayEvents(events, budget = REPLAY_BYTE_BUDGET, maxChunks = REPLAY_MAX_CHUNKS) {
+  if (!Array.isArray(events) || events.length === 0) return []
+  // Walk newest→oldest accumulating into the current chunk; start a new chunk when the
+  // next event would overflow the budget. Stop once we have maxChunks. A lone event
+  // larger than the whole budget still gets its own chunk (so seqHi can advance).
+  const chunksRev = []   // newest chunk first while building
+  let cur = [], curBytes = 0
+  for (let i = events.length - 1; i >= 0; i--) {
+    const sz = JSON.stringify(events[i]).length + 1
+    if (cur.length && curBytes + sz > budget) {
+      chunksRev.push(cur)
+      if (chunksRev.length >= maxChunks) { cur = null; break }
+      cur = [], curBytes = 0
+    }
+    cur.push(events[i])   // reversed within the chunk for now
+    curBytes += sz
+  }
+  if (cur && cur.length) chunksRev.push(cur)
+  // chunksRev is newest-chunk-first, each chunk newest-event-first → reverse both axes
+  // to oldest-first so classifyReplay applies them contiguously in arrival order.
+  return chunksRev.reverse().map((c) => c.reverse())
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "thinkpool-pair",
-  "version": "0.7.67",
+  "version": "0.7.69",
   "description": "Share a local coding-agent CLI (Claude Code, Codex, Gemini, Aider, …) into a ThinkPool Code room, live.",
   "type": "module",
   "bin": {