pi-optchat 0.7.1 → 0.8.0

package/src/inspector.ts

@@ -60,6 +60,8 @@ export class Inspector implements Component, Focusable {
   private lineCount = 0;
   private hintLines = 1;
   private range: UsageRange = 'This session';
+  private confirmDelete?: string;
+  private notice = '';
   private ended = false;
   private readonly unsubscribe: (() => void)[];
   private readonly timer: ReturnType<typeof setInterval>;
@@ -87,6 +89,7 @@ export class Inspector implements Component, Focusable {
   handleInput(data: string) {
     if (this.ended) return;
     if (matchesKey(data, 'escape') || matchesKey(data, 'ctrl+c')) return this.finish();
+    const deleting = this.confirmDelete; this.confirmDelete = undefined; this.notice = '';
     if (matchesKey(data, 'tab')) {
       this.page = nextPage(this.page); this.scroll = 0;
     } else if (this.page === 'activity') this.scrollInput(data);
@@ -103,10 +106,22 @@ export class Inspector implements Component, Focusable {
       else if (matchesKey(data, 'home')) this.select(-Infinity);
       else if (matchesKey(data, 'end')) this.select(Infinity);
       else if (data === 'm') return this.finish('model');
+      else if ((data === 'd' || matchesKey(data, 'delete')) && this.selected) {
+        if (deleting === this.selected) this.remove(this.selected);
+        else this.confirmDelete = this.selected;
+      }
       else if (matchesKey(data, 'return') && this.selected) return this.finish({ open: this.selected });
     }
     this.options.redraw();
   }
+  /** Once the run is gone, the cursor moves to the next row that is not, else the one above. */
+  private remove(id: string) {
+    const { children } = this.options, list = children.history.list(), doomed = new Set([id, ...children.history.descendants(id).map(r => r.id)]);
+    const index = list.findIndex(r => r.id === id), next = list.slice(index).find(r => !doomed.has(r.id)) ?? list.slice(0, index).findLast(r => !doomed.has(r.id));
+    children.remove(id).then(() => { if (!children.history.records.has(this.selected ?? '')) this.selected = next?.id; },
+      (error: unknown) => { this.notice = `Not deleted: ${error instanceof Error ? error.message : String(error)}`; })
+      .finally(() => { if (!this.ended) this.options.redraw(); });
+  }
   private scrollInput(data: string) {
     const delta = matchesKey(data, 'up') ? -1 : matchesKey(data, 'down') ? 1 : matchesKey(data, 'pageUp') ? -this.height : matchesKey(data, 'pageDown') ? this.height : 0;
     if (delta || matchesKey(data, 'home') || matchesKey(data, 'end')) {
@@ -191,10 +206,12 @@ export class Inspector implements Component, Focusable {
       });
       if (!body.length) body.push(color('muted', 'No agents yet. Ask the main agent to delegate a task.'));
       info = `${list.filter(isActiveRun).length} active · ${list.length} saved${list.length ? ` · ${cursor + 1}/${list.length}` : ''}`;
-      hint = '↑↓ select · Enter open · m model · Tab usage · Esc close';
+      hint = this.confirmDelete ? `Press d again to ${children.live(this.confirmDelete) ? 'stop and delete' : 'delete'} this agent and the agents it started`
+        : this.notice || '↑↓ select · Enter open · m model · d delete · Tab usage · Esc close';
     }
     title = fit(title, Math.max(1, inner - visibleWidth(info) - 2));
-    const footer = wrapTextWithAnsi(hint, inner).map(line => color('dim', line));
+    const tone = this.page !== 'agents' ? 'dim' : this.confirmDelete ? 'warning' : this.notice ? 'error' : 'dim';
+    const footer = wrapTextWithAnsi(hint, inner).map(line => color(tone, line));
     this.hintLines = footer.length;
     const rule = color('border', '─'.repeat(Math.max(1, width)));
     // Same layout as Pi's own selectors: rules above and below, content indented by one column.

package/src/memory.ts

@@ -1,19 +1,25 @@
-import { closeSync, existsSync, fstatSync, fsyncSync, mkdirSync, openSync, readFileSync, readSync, readdirSync, statSync, writeSync } from 'node:fs';
-import { dirname, join } from 'node:path';
+import { closeSync, existsSync, fstatSync, fsyncSync, mkdirSync, openSync, readFileSync, readSync, readdirSync, renameSync, statSync, writeFileSync, writeSync } from 'node:fs';
+import { dirname, join, resolve } from 'node:path';
 import { EventEmitter } from 'node:events';
 
 export const NODE = 512;
 export const VIEW = 128_000;
 export const CAP = 30_000;
-export type Kind = 'user' | 'talk' | 'tool' | 'echo' | 'note';
-export interface Origin { source: 'claude' | 'claude-memory' | 'codex' | 'chatgpt'; conversation: string; message: string; title: string; project?: string }
+/** The most characters one zoom into a message returns, so a page stays under the tool output CAP instead of losing its middle. */
+export const PAGE = 25_000;
+export const KINDS = ['user', 'talk', 'tool', 'echo', 'note', 'work'] as const;
+export type Kind = typeof KINDS[number];
+export interface Origin { source: 'claude' | 'claude-memory' | 'codex' | 'pi' | 'chatgpt'; conversation: string; message: string; title: string; project?: string }
 export interface Entry { i: number; kind: Kind; text: string; size: number; date: string; receipt?: string; origin?: Origin }
 export interface Part { l: number; i: number }
 export interface Summary extends Part { text: string; size: number }
-export interface Compression { context: string; source: string; merge: boolean; historical?: boolean }
+/** `part` is the node to build: a message's leaf, or the merge of its two halves. */
+export interface Compression { context: string; source: string; part: Part; historical?: boolean }
 export type Compressor = (input: Compression, signal: AbortSignal) => Promise<string>;
 const key = ({ l, i }: Part) => l * 2 ** 40 + i;
 const UNBUILT = '(not summarized yet: zoom it)';
+/** A message's node starts once fewer than this many lines before it are unbuilt (recipe §4). */
+const AHEAD = 8;
 export const start = ({ l, i }: Part) => i * 2 ** l;
 export const end = (part: Part) => start(part) + 2 ** part.l;
 export const bytes = (s: string) => Buffer.byteLength(s, 'utf8');
@@ -33,6 +39,63 @@ export function cap(text: string, limit = CAP) {
 export function localDay(date = new Date()) {
   return `${date.getFullYear()}-${String(date.getMonth() + 1).padStart(2, '0')}-${String(date.getDate()).padStart(2, '0')}`;
 }
+export function atomicWrite(file: string, text: string | Uint8Array) {
+  mkdirSync(resolve(file, '..'), { recursive: true, mode: 0o700 });
+  const temporary = `${file}.${process.pid}.tmp`;
+  // One read-write handle: Windows refuses fsync on a read-only one, and it cannot open a directory at all, so there the file flush is the whole guarantee.
+  const fd = openSync(temporary, 'w+', 0o600);
+  try { writeFileSync(fd, text); fsyncSync(fd); } finally { closeSync(fd); }
+  renameSync(temporary, file);
+  if (process.platform === 'win32') return;
+  const parent = openSync(resolve(file, '..'), 'r');
+  try { fsyncSync(parent); } finally { closeSync(parent); }
+}
+/** The index of the view's most due pair of sibling lines whose parent is built, or -1 (recipe §3.2). A pair is as due as
+ * long ago it ended, in its own line size; equal pairs go oldest first. This is the order of Taelin's rollback push. */
+export function mostDue(view: readonly Part[], total: number, built: (part: Part) => boolean) {
+  let best = -1, due = -Infinity;
+  for (let j = 0; j + 1 < view.length; j++) {
+    const a = view[j], b = view[j + 1];
+    if (a.l !== b.l || a.i % 2 || b.i !== a.i + 1) continue;
+    const age = (total - (end(b) - 1)) / 2 ** a.l;
+    if (age > due && built({ l: a.l + 1, i: a.i / 2 })) { best = j; due = age; }
+  }
+  return best;
+}
+/** A view (recipe §3.2): lines that tile the log, oldest first. It grows a line per message and, once over `high` bytes or when
+ * forced, merges its most due pairs in one batch down to `low`, merging what it can at each change until then. */
+class Sawtooth {
+  readonly parts: Part[] = [];
+  private measured = 0;
+  private merging = false;
+  constructor(private readonly high: number, private readonly low: number, private readonly node: (part: Part) => Summary | undefined) {}
+  private lineSize(part: Part) { return this.node(part)?.size ?? UNBUILT_BYTES; }
+  get size() { return this.measured; }
+  push(part: Part) { this.parts.push(part); this.measured += this.lineSize(part); }
+  /** The line covering message `at`. The lines tile the log in order, so a binary search finds it. */
+  covering(at: number): Part | undefined {
+    for (let lo = 0, hi = this.parts.length - 1; lo <= hi;) {
+      const mid = (lo + hi) >> 1, p = this.parts[mid];
+      if (end(p) <= at) lo = mid + 1;
+      else if (start(p) > at) hi = mid - 1;
+      else return p;
+    }
+  }
+  /** A message got its node. Its line is usually still shown, but after a damaged tree file a saved parent can already hide it. */
+  built(i: number) { if (this.covering(i)?.l === 0) this.measured += this.lineSize({ l: 0, i }) - UNBUILT_BYTES; }
+  /** Returns whether any lines merged. */
+  fit(total: number, force = false) {
+    const lines = this.parts.length;
+    if (force || this.measured > this.high) this.merging = true;
+    for (let best: number; this.merging && this.measured > this.low && (best = mostDue(this.parts, total, part => !!this.node(part))) >= 0;) {
+      const a = this.parts[best], b = this.parts[best + 1], parent = { l: a.l + 1, i: a.i / 2 };
+      this.measured += this.lineSize(parent) - this.lineSize(a) - this.lineSize(b);
+      this.parts.splice(best, 2, parent);
+    }
+    if (this.measured <= this.low) this.merging = false;
+    return this.parts.length < lines;
+  }
+}
 const otherWriter = (file: string) => new Error(`Another process wrote ${file}. Close every other Pi on this profile and restart Pi; nothing was written.`);
 /** With `size`, refuses to append unless the file still has that size. A last line left without its newline is ended first. Returns the new size. */
 export function appendJson(file: string, value: unknown, size?: number) {
@@ -65,7 +128,7 @@ function object(value: unknown): value is Record<string, unknown> {
 }
 export function isEntry(value: unknown): value is Entry {
   return object(value) && Number.isSafeInteger(value.i) && typeof value.kind === 'string'
-    && ['user', 'talk', 'tool', 'echo', 'note'].includes(value.kind)
+    && KINDS.some(kind => kind === value.kind)
     && typeof value.text === 'string' && typeof value.date === 'string';
 }
 function isSummary(value: unknown): value is Summary {
@@ -73,31 +136,36 @@ function isSummary(value: unknown): value is Summary {
     && typeof value.text === 'string';
 }
 
-/** The log is authoritative. The tree and monotonically coarsening view follow recipe §§2–6. */
+/** The log is authoritative. The tree and the view follow the recipe: the view grows a line per message and, once it passes
+ * `budget`, merges its most due pairs in one batch down to half of it, so between batches it only grows at its end.
+ * Compactions get their own view (recipe §4): the chat's merged further, to between an eighth and a quarter of the budget,
+ * and again whenever the chat's merges, so parallel compactions read it from the cache. */
 export class Memory {
   readonly root: Entry[] = [];
   readonly tree = new Map<number, Summary>();
-  readonly view: Part[] = [];
   private readonly events = new EventEmitter();
   private readonly controller = new AbortController();
   private readonly busy = new Map<number, Promise<void>>();
   private readonly retryAt = new Map<number, number>();
   private readonly reported = new Set<number>();
   private readonly lastSeenBytes = new Map<string, number>();
-  private viewBytes = 0;
-  private leaves = 0;
-  /** Per level, every node below this index is built. */
-  private readonly low: number[] = [];
+  /** Messages without their node, and merges whose halves are built, oldest first, so the scheduler never scans the tree for work (recipe §4). */
+  private readonly unbuilt = new Set<number>();
+  private readonly merges = new Map<number, Part>();
   private retryTimer?: ReturnType<typeof setTimeout>;
   /** The most summaries owed at once since none were last owed. */
   private peak = 0;
   private scheduled = false;
   private stopped = false;
+  private readonly chat: Sawtooth;
+  private readonly compaction: Sawtooth;
   lastError?: string;
 
   constructor(readonly directory: string, private readonly compress: Compressor,
     private readonly warn: (s: string) => void = console.error,
     readonly budget = VIEW, private readonly jobs = 8, private readonly retryMs = 10_000) {
+    this.chat = new Sawtooth(budget, budget / 2, part => this.node(part));
+    this.compaction = new Sawtooth(budget / 4, budget / 8, part => this.node(part));
     for (const sub of ['main', 'tree']) mkdirSync(join(directory, sub), { recursive: true, mode: 0o700 });
     const main = join(directory, 'main'), log = records(main, warn);
     for (const name of readdirSync(main).filter(n => n.endsWith('.jsonl'))) this.lastSeenBytes.set(join(main, name), statSync(join(main, name)).size);
@@ -107,12 +175,16 @@ export class Memory {
     for (const value of records(join(directory, 'tree'), warn)) {
       if (!isSummary(value) || value.l < 0 || value.i < 0 || end(value) > this.root.length)
         throw new Error('Invalid OptChat summary record.');
-      if (value.l === 0 && !this.tree.has(key(value))) this.leaves++;
       this.tree.set(key(value), { ...value, size: lineBytes(value.text) });
     }
-    // Fold history in order; do not retile the entire log on each turn.
-    for (let i = 0; i < this.root.length; i++) { this.push(i); this.fit(i + 1); }
-    this.schedule();
+    for (const node of this.tree.values()) this.queueParent(node);
+    for (let i = 0; i < this.root.length; i++) if (!this.node({ l: 0, i })) this.unbuilt.add(i);
+    // Refolding the log gives a different view than the live one, and every cache entry would miss, so the view is saved.
+    const loaded = this.load();
+    for (const part of this.view) this.compaction.push(part);
+    this.compaction.fit(loaded, true);
+    for (let i = loaded; i < this.root.length; i++) { this.push(i); this.fit(i + 1); }
+    this.fit(); this.save(); this.schedule();
   }
   private checkLog(next: string) {
     const main = dirname(next), names = readdirSync(main).filter(n => n.endsWith('.jsonl'));
@@ -124,18 +196,48 @@ export class Memory {
     const file = join(this.directory, 'main', `${localDay()}.jsonl`);
     if (!this.lastSeenBytes.has(file)) this.checkLog(file);
     this.lastSeenBytes.set(file, appendJson(file, entry, this.lastSeenBytes.get(file) ?? 0));
-    this.root.push(entry); this.push(entry.i); this.fit(); this.schedule();
+    this.root.push(entry); this.push(entry.i); if (this.fit()) this.save(); this.schedule();
     return entry;
   }
   node(part: Part) { return this.tree.get(key(part)); }
   private text(part: Part) { return this.node(part)?.text ?? UNBUILT; }
-  private partBytes(part: Part) { return this.node(part)?.size ?? UNBUILT_BYTES; }
-  private push(i: number) { const part = { l: 0, i }; this.view.push(part); this.viewBytes += this.partBytes(part); }
+  /** Takes the saved view if it still tiles the log from the start, and returns how many messages it covers. */
+  private load() {
+    const file = join(this.directory, 'view.json');
+    if (!existsSync(file)) return 0;
+    const rebuild = () => { this.warn(`Rebuilt the memory view: ${file} does not match the log.`); return 0; };
+    let saved: unknown;
+    try { saved = JSON.parse(readFileSync(file, 'utf8')); } catch { return rebuild(); }
+    if (!Array.isArray(saved)) return rebuild();
+    const parts: Part[] = [];
+    let covered = 0;
+    for (const value of saved) {
+      const [l, i] = Array.isArray(value) ? value : [];
+      const part = { l, i };
+      if (!Number.isSafeInteger(l) || !Number.isSafeInteger(i) || l < 0 || start(part) !== covered || end(part) > this.root.length || (l > 0 && !this.node(part)))
+        return rebuild();
+      parts.push(part); covered = end(part);
+    }
+    for (const part of parts) this.chat.push(part);
+    return covered;
+  }
+  /** Saved when it merges: a view that only grew is the saved one plus a line per later message, as `load` replays it.
+   * The log stays authoritative, so a failed save only warns. */
+  private save() {
+    try { atomicWrite(join(this.directory, 'view.json'), JSON.stringify(this.view.map(p => [p.l, p.i]))); }
+    catch (error) { this.warn(`Could not save the memory view: ${error instanceof Error ? error.message : String(error)}`); }
+  }
+  private push(i: number) {
+    const part = { l: 0, i };
+    this.chat.push(part); this.compaction.push(part);
+    if (!this.node(part)) this.unbuilt.add(i);
+  }
+  get view(): readonly Part[] { return this.chat.parts; }
   render() { return `${VIEW_OPEN}${this.view.map(p => `${start(p)}+${2 ** p.l}|${flat(this.text(p))}`).join('\n')}\n</chat>`; }
   get ready() { return this.view.every(p => this.node(p)); }
-  get pending() { return this.root.length - this.leaves; }
+  get pending() { return this.unbuilt.size; }
   get active() { return this.busy.size; }
-  get size() { return this.viewBytes; }
+  get size() { return this.chat.size; }
   /** Summaries built out of the backlog since it was last empty, and when the next failed one is retried. */
   progress(now = Date.now()) {
     const due = Math.min(...[...this.retryAt.values()].filter(t => t > now));
@@ -143,34 +245,16 @@ export class Memory {
   }
   private owed() { return this.expectedNodes() - this.tree.size; }
   onChange(listener: () => void) { this.events.on('change', listener); return () => { this.events.off('change', listener); }; }
-  /** The view line covering message `at`. The view tiles the log in order, so a binary search finds it. */
-  covering(at: number): Part | undefined {
-    for (let lo = 0, hi = this.view.length - 1; lo <= hi;) {
-      const mid = (lo + hi) >> 1, p = this.view[mid];
-      if (end(p) <= at) lo = mid + 1;
-      else if (start(p) > at) hi = mid - 1;
-      else return p;
-    }
-  }
-  private visible(part: Part) { const p = this.covering(start(part)); return p?.l === part.l && p.i === part.i; }
+  /** The view line covering message `at`. */
+  covering(at: number) { return this.chat.covering(at); }
+  /** Returns whether the chat's view merged. */
   private fit(total = this.root.length) {
-    while (this.viewBytes > this.budget) {
-      let best = -1; let due = -Infinity;
-      for (let j = 0; j + 1 < this.view.length; j++) {
-        const a = this.view[j], b = this.view[j + 1];
-        if (a.l !== b.l || a.i % 2 || b.i !== a.i + 1) continue;
-        const age = (total - start(a)) / 2 ** (a.l + 2);
-        if (age > due && this.node({ l: a.l + 1, i: a.i / 2 })) { best = j; due = age; }
-      }
-      if (best < 0) break;
-      const a = this.view[best], b = this.view[best + 1];
-      const parent = { l: a.l + 1, i: a.i / 2 };
-      this.viewBytes += this.partBytes(parent) - this.partBytes(a) - this.partBytes(b);
-      this.view.splice(best, 2, parent);
-    }
+    const merged = this.chat.fit(total);
+    this.compaction.fit(total, merged);
     const owed = this.owed();
     this.peak = owed > 0 ? Math.max(this.peak, owed) : 0;
     this.events.emit('change');
+    return merged;
   }
   private schedule() {
     if (this.scheduled || this.stopped) return;
@@ -181,54 +265,72 @@ export class Memory {
     if (this.stopped) return;
     // One clock reading: skipping a part and arming its retry timer must agree on what is due.
     const now = Date.now();
-    const total = this.root.length;
-    const first = this.view.find(p => !this.node(p));
-    const boundary = first ? start(first) : total;
-    for (let l = 0; 2 ** l <= total; l++) {
-      let low = this.low[l] ?? 0;
-      while (this.node({ l, i: low })) low++;
-      this.low[l] = low;
-      for (let i = low; (i + 1) * 2 ** l <= total; i++) {
-        if (this.busy.size >= this.jobs) return;
-        const part = { l, i }, id = key(part);
-        if ((l === 0 ? i : end(part)) > boundary) break;
-        if (this.node(part) || this.busy.has(id) || (this.retryAt.get(id) ?? 0) > now) continue;
-        if (l && (!this.node({ l: l - 1, i: 2 * i }) || !this.node({ l: l - 1, i: 2 * i + 1 }))) continue;
-        const promise = this.build(part).catch(error => {
-          if (this.stopped) return;
-          this.lastError = error instanceof Error ? error.message : String(error);
-          if (!this.reported.has(id)) { this.reported.add(id); this.warn(`Compactor ${start(part)}+${2 ** l}: ${this.lastError}`); }
-          this.retryAt.set(id, Date.now() + this.retryMs);
-          if (!this.retryTimer) this.retryTimer = setTimeout(() => { this.retryTimer = undefined; this.schedule(); }, this.retryMs);
-        }).finally(() => { this.busy.delete(id); this.events.emit('change'); this.schedule(); });
-        this.busy.set(id, promise);
-      }
+    const run = (part: Part) => {
+      const id = key(part);
+      if (this.busy.has(id) || (this.retryAt.get(id) ?? 0) > now) return;
+      const promise = this.build(part).catch(error => {
+        if (this.stopped) return;
+        this.lastError = error instanceof Error ? error.message : String(error);
+        if (!this.reported.has(id)) { this.reported.add(id); this.warn(`Compactor ${start(part)}+${2 ** part.l}: ${this.lastError}`); }
+        this.retryAt.set(id, Date.now() + this.retryMs);
+        if (!this.retryTimer) this.retryTimer = setTimeout(() => { this.retryTimer = undefined; this.schedule(); }, this.retryMs);
+      // Schedule before telling waiters, so a turn never mistakes the gap before the next pump for a stall.
+      }).finally(() => { this.busy.delete(id); this.schedule(); this.events.emit('change'); });
+      this.busy.set(id, promise);
+    };
+    // A message's node starts once fewer than AHEAD lines before it are unbuilt; a merge, once both halves are built.
+    let ahead = 0;
+    for (const i of this.unbuilt) {
+      if (ahead++ === AHEAD) break;
+      if (this.busy.size >= this.jobs) return;
+      run({ l: 0, i });
+    }
+    for (const part of this.merges.values()) {
+      if (this.busy.size >= this.jobs) return;
+      run(part);
     }
     // A later failure can have a later deadline than the timer installed by the first.
     const deadlines = [...this.retryAt.values()].filter(t => t > now);
     if (deadlines.length && !this.retryTimer) this.retryTimer = setTimeout(() => { this.retryTimer = undefined; this.schedule(); }, Math.max(1, Math.min(...deadlines) - now));
+    if (this.stalled) this.events.emit('change');
   }
+  /** Nothing is being built, nothing more can start, and something failed: only a retry can make progress. */
+  private get stalled() { return this.busy.size === 0 && !this.scheduled && this.retryAt.size > 0; }
   private async build(part: Part) {
     const source = part.l === 0 ? `${this.root[part.i].kind}: ${this.root[part.i].text}`
       : [0, 1].map(offset => this.text({ l: part.l - 1, i: 2 * part.i + offset })).join('\n');
-    const boundary = part.l === 0 ? start(part) : end(part);
-    const context = `<chat>\n${this.view.filter(p => end(p) <= boundary).map(p => flat(this.text(p))).join('\n')}\n</chat>`;
     const mergeSource = part.l > 0 ? [0, 1].map(offset => flat(this.text({ l: part.l - 1, i: 2 * part.i + offset }))).join('\n') : source;
-    const text = bytes(source) <= NODE ? source : (await this.compress({ context, source: mergeSource, merge: part.l > 0,
+    const text = bytes(source) <= NODE ? source : (await this.compress({ context: this.compactionView(part), source: mergeSource, part,
       historical: this.root.slice(start(part), end(part)).some(entry => !!entry.origin) }, this.controller.signal)).trim();
     if (this.stopped) return;
     if (!text) throw new Error('Compactor returned an empty summary.');
     const node = { ...part, text, size: lineBytes(text) };
     appendJson(join(this.directory, 'tree', `${localDay()}.jsonl`), node);
-    this.tree.set(key(part), node); this.retryAt.delete(key(part));
-    // A leaf is usually still in the view when built, but after a damaged tree file a saved parent can already hide it.
-    if (part.l === 0) { this.leaves++; if (this.visible(part)) this.viewBytes += node.size - UNBUILT_BYTES; }
+    this.tree.set(key(part), node); this.retryAt.delete(key(part)); this.merges.delete(key(part)); this.queueParent(part);
+    if (!part.l) { this.unbuilt.delete(part.i); this.chat.built(part.i); this.compaction.built(part.i); }
     if (!this.retryAt.size) this.lastError = undefined;
-    this.fit();
+    if (this.fit()) this.save();
   }
-  /** Waits until every part of the view is built. As in the recipe, the view may run over budget until pending merges land. */
-  async settle(signal?: AbortSignal, all = false): Promise<void> {
-    const done = () => this.ready && (!all || (this.busy.size === 0 && this.tree.size === this.expectedNodes()));
+  /** The compactions' view up to the node. A line still being built shows as a placeholder instead of ending the view: an A/B on
+   * real turns (#101) found that cutting there also hid the built lines after it, such as an echo's own tool call. */
+  private compactionView(part: Part) {
+    const boundary = part.l === 0 ? start(part) : end(part), lines: string[] = [];
+    for (const p of this.compaction.parts) { if (end(p) > boundary) break; lines.push(`${start(p)}+${2 ** p.l}|${flat(this.text(p))}`); }
+    return `${VIEW_OPEN}${lines.join('\n')}\n</chat>`;
+  }
+  private queueParent({ l, i }: Part) {
+    const parent = { l: l + 1, i: Math.floor(i / 2) };
+    if (!this.node(parent) && this.node({ l, i: i % 2 ? i - 1 : i + 1 })) this.merges.set(key(parent), parent);
+  }
+  /** A 'turn' waits until every part of the view is built, or until everything pending has failed: it then goes on with placeholders
+   * for the missing lines, `lastError` says why, and the failed nodes are still retried in the background. 'tree' waits for every
+   * node, through failures. As in the recipe, the view may run over budget until pending merges land.
+   * 'ahead' (imports) waits until a new message's node would start at once. Due merges count too: messages go first, so a steady
+   * stream of them would otherwise take every worker and the views could never merge. */
+  async settle(signal?: AbortSignal, until: 'turn' | 'tree' | 'ahead' = 'turn'): Promise<void> {
+    const done = () => until === 'tree' ? this.ready && this.busy.size === 0 && this.tree.size === this.expectedNodes()
+      : until === 'ahead' ? this.unbuilt.size + this.merges.size < AHEAD
+      : this.ready || this.stalled;
     if (done()) return;
     if (this.stopped || signal?.aborted) throw new Error('Memory wait cancelled.');
     await new Promise<void>((resolve, reject) => {
@@ -243,10 +345,26 @@ export class Memory {
     for (let n = this.root.length; n > 0; n = Math.floor(n / 2)) count += n;
     return count;
   }
-  zoom(id: number, n: number) {
+  /** n = 1 gives the message whole, or, when it is longer than `limit` or `offset` is given, the page of up to `limit` characters from `offset`.
+   * Paging a message that fits in one page is allowed, but the page says so. */
+  zoom(id: number, n: number, offset?: number, limit?: number) {
     if (!Number.isSafeInteger(id) || id < 0 || !Number.isSafeInteger(n) || n < 1 || !Number.isInteger(Math.log2(n)) || id % n || id + n > this.root.length)
       throw new Error(`No line ${id}+${n}.`);
-    if (n === 1) { const entry = this.root[id]; return `${id}+0|${entry.kind}: ${entry.text}`; }
+    if (n === 1) {
+      const { kind, text } = this.root[id], page = Math.min(limit ?? PAGE, PAGE);
+      if (!Number.isSafeInteger(page) || page < 1) throw new Error('limit must be a positive integer.');
+      if (offset === undefined && text.length <= page) return `${id}+0|${kind}: ${text}`;
+      if (offset !== undefined && (!Number.isSafeInteger(offset) || offset < 0 || offset >= Math.max(1, text.length)))
+        throw new Error(`Message ${id} has ${text.length} characters; offset must be 0 to ${Math.max(0, text.length - 1)}.`);
+      // Never split a surrogate pair: a page starts on its first half and ends after its second.
+      const from = /[\udc00-\udfff]/.test(text[offset ?? 0] ?? '') ? (offset ?? 0) - 1 : offset ?? 0;
+      let to = Math.min(text.length, from + page);
+      // A one-unit page on a pair takes the whole pair, so the next offset always moves forward.
+      if (to < text.length && /[\ud800-\udbff]/.test(text[to - 1])) to += to - 1 === from ? 1 : -1;
+      const hint = text.length <= PAGE ? `\n[note: this message is only ${text.length.toLocaleString('en-US')} characters and fits in one zoom; offset/limit are for messages over ${PAGE.toLocaleString('en-US')}]` : '';
+      return `${id}+0|${kind}: ${text.slice(from, to)}\n[showing characters ${from}-${to} of ${text.length}${to < text.length ? `; next page: offset ${to}` : ''}]${hint}`;
+    }
+    if (offset !== undefined) throw new Error('offset and limit page one message: use them with n = 1.');
     const l = Math.log2(n) - 1, i = 2 * id / n;
     return [0, 1].map(offset => {
       const part = { l, i: i + offset }, node = this.node(part);

package/src/profiles.ts

@@ -1,11 +1,16 @@
-import { chmodSync, closeSync, existsSync, fsyncSync, lstatSync, mkdirSync, openSync, readFileSync, readdirSync, renameSync, statSync, unlinkSync, writeFileSync } from 'node:fs';
+import { createHash } from 'node:crypto';
+import { chmodSync, existsSync, lstatSync, mkdirSync, readFileSync, readdirSync, realpathSync, rmSync, statSync, unlinkSync, writeFileSync, type Stats } from 'node:fs';
 import { createConnection, createServer } from 'node:net';
 import { homedir } from 'node:os';
 import { join, resolve } from 'node:path';
 import type { ModelChoice } from './compactor.ts';
 import { record } from './cache.ts';
+import { atomicWrite } from './memory.ts';
 import { DEFAULT_SETTINGS, readSettings, type Settings } from './settings.ts';
 
+export const isWindows = process.platform === 'win32';
+const PIPE_PREFIX = '\\\\.\\pipe\\';
+
 export const dataHome = () => resolve(process.env.OPTCHAT_HOME ?? join(homedir(), '.optchat'));
 export interface ProfileConfig extends Settings { compactor: ModelChoice; subagent: ModelChoice }
 export const defaults: ProfileConfig = {
@@ -22,22 +27,21 @@ export function listProfiles() {
   const root = join(dataHome(), 'profiles');
   return existsSync(root) ? readdirSync(root, { withFileTypes: true }).filter(f => f.isDirectory() && /^[a-z0-9][a-z0-9_-]{0,63}$/.test(f.name)).map(f => f.name).sort() : [];
 }
-export function atomicWrite(file: string, text: string) {
-  mkdirSync(resolve(file, '..'), { recursive: true, mode: 0o700 });
-  const temporary = `${file}.${process.pid}.tmp`;
-  writeFileSync(temporary, text, { mode: 0o600 });
-  const fd = openSync(temporary, 'r');
-  try { fsyncSync(fd); } finally { closeSync(fd); }
-  renameSync(temporary, file);
-  const parent = openSync(resolve(file, '..'), 'r');
-  try { fsyncSync(parent); } finally { closeSync(parent); }
-}
 export function createProfile(name: string) {
   const dir = profilePath(name);
   if (existsSync(dir)) throw new Error(`Profile already exists: ${name}`);
-  mkdirSync(dir, { recursive: true, mode: 0o700 });
-  saveConfig(dir, defaults);
-  atomicWrite(join(dir, 'AGENTS.md'), `# ${name}\n\nThis is the ${name} profile.\nAdd your personal instructions here.\n`);
+  mkdirSync(resolve(dir, '..'), { recursive: true, mode: 0o700 });
+  // Claim the directory exclusively, so a competing creator cannot have its
+  // profile overwritten or removed by this attempt's cleanup.
+  mkdirSync(dir, { mode: 0o700 });
+  try {
+    saveConfig(dir, defaults);
+    atomicWrite(join(dir, 'AGENTS.md'), `# ${name}\n\nThis is the ${name} profile.\nAdd your personal instructions here.\n`);
+  } catch (error) {
+    try { rmSync(dir, { recursive: true, force: true, maxRetries: 3 }); }
+    catch { throw new Error(`Failed to create profile ${name}, and could not remove its incomplete directory: ${dir}`, { cause: error }); }
+    throw error;
+  }
 }
 export function saveConfig(dir: string, config: ProfileConfig) { atomicWrite(join(dir, 'config.json'), JSON.stringify(config, null, 2) + '\n'); }
 function modelChoice(value: unknown): value is ModelChoice {
@@ -60,24 +64,41 @@ export function rememberProfile(name: string) { atomicWrite(join(dataHome(), 'la
 export class ProfileBusyError extends Error {
   constructor(readonly owner: string) { super(`Profile already running: ${owner}`); }
 }
-/** Lives in the profile itself, so every Pi on this profile finds the same socket whatever its TMPDIR. Git skips sockets, so checkpoints never see it. */
-export const profileSocket = (dir: string, purpose: 'lock' | 'windows' = 'lock') => join(dir, `${purpose}.sock`);
+/** POSIX keeps a socket file in the profile itself, so every Pi on the profile finds the same one whatever its TMPDIR, and Git skips it. Windows has no Unix sockets, so the profile path is hashed into a named pipe in the machine-wide pipe namespace. */
+export function profileSocket(dir: string, purpose: 'lock' | 'windows' = 'lock') {
+  if (!isWindows) return join(dir, `${purpose}.sock`);
+  // Hash the directory's real identity, so another casing, a junction or a symlink to the same profile finds the same pipe.
+  let identity = resolve(dir); try { identity = realpathSync.native(identity); } catch {}
+  return `${PIPE_PREFIX}optchat-${createHash('sha256').update(identity.toLowerCase()).digest('hex').slice(0, 16)}-${purpose}`;
+}
 
-// sun_path is 104 bytes on macOS and 108 elsewhere, both including the NUL. Node 22 binds a truncated path instead of failing, so the length is checked before listen.
-export const SOCKET_PATH_LIMIT = process.platform === 'darwin' ? 103 : 107;
+// sun_path is 104 bytes on macOS and 108 elsewhere, both including the NUL; a Windows named pipe path is capped at 259 characters, which for the ASCII names OptChat generates is also its byte length. Node 22 binds a truncated socket instead of failing, so the length is checked before listen.
+export const SOCKET_PATH_LIMIT = process.platform === 'darwin' ? 103 : isWindows ? 259 : 107;
 export function checkSocketPath(path: string) {
   const length = Buffer.byteLength(path);
   if (length > SOCKET_PATH_LIMIT) throw new Error(`Cannot listen on the profile socket: its path is ${length} bytes, over this system's limit of ${SOCKET_PATH_LIMIT}. Set OPTCHAT_HOME to a shorter directory: ${path}`);
 }
 
-/** A socket that may be replaced; a file that only shares its name is refused, never deleted. */
-function existingSocket(path: string) {
+/** A socket that may be replaced; a file that only shares its name is refused, never deleted. A Windows pipe has no filesystem entry, so there is nothing to check or remove. */
+function existingSocket(path: string): { stat: Stats; removable: true } | { removable: false } | undefined {
+  if (isWindows) return { removable: false };
   let stat; try { stat = lstatSync(path); } catch { return undefined; }
   if (!stat.isSocket()) throw new Error(`${path} is not an OptChat socket. Move it out of the profile and try again.`);
-  return stat;
+  return { stat, removable: true };
 }
 /** Removes a dead socket left by a previous owner. */
-export function removeStaleSocket(path: string) { if (existingSocket(path)) unlinkSync(path); }
+export function removeStaleSocket(path: string) { if (existingSocket(path)?.removable) unlinkSync(path); }
+
+/** Asks the current owner who holds the socket; nothing answering means the entry is stale. A Windows pipe that has disappeared reports ENOENT instead of ECONNREFUSED. */
+function readOwner(path: string) {
+  return new Promise<string | undefined>((resolve, reject) => {
+    const socket = createConnection(path); let message = '';
+    socket.setTimeout(1500, () => { socket.destroy(); reject(new Error('Profile lock did not respond; refusing to steal it.')); });
+    socket.on('data', data => { message += data.toString(); });
+    socket.on('end', () => resolve(message || 'another Pi instance'));
+    socket.on('error', e => { if ('code' in e && (e.code === 'ECONNREFUSED' || isWindows && e.code === 'ENOENT')) resolve(undefined); else reject(e); });
+  });
+}
 
 /** OS-owned socket lifetime, no timeout-based stealing of a busy profile. */
 export async function lockProfile(dir: string, description: string) {
@@ -93,18 +114,16 @@ export async function lockProfile(dir: string, description: string) {
     if (!(error instanceof Error) || !('code' in error) || error.code !== 'EADDRINUSE') throw error;
     const before = existingSocket(socketPath);
     if (!before) throw new Error('Profile lock changed; try again.');
-    const owner = await new Promise<string | undefined>((resolve, reject) => {
-      const socket = createConnection(socketPath); let message = '';
-      socket.setTimeout(1500, () => { socket.destroy(); reject(new Error('Profile lock did not respond; refusing to steal it.')); });
-      socket.on('data', data => { message += data.toString(); });
-      socket.on('end', () => resolve(message || 'another Pi instance'));
-      socket.on('error', e => { if ('code' in e && e.code === 'ECONNREFUSED') resolve(undefined); else reject(e); });
-    });
+    const owner = await readOwner(socketPath);
     if (owner !== undefined) throw new ProfileBusyError(owner);
-    if (statSync(socketPath).ino !== before.ino) throw new Error('Profile lock changed; try again.');
-    unlinkSync(socketPath); await listen();
+    // Nothing answered, so the entry is stale. POSIX leaves a file behind that can be removed; a Windows pipe disappears with its owner, so rebinding is the whole cleanup.
+    if (before.removable) {
+      if (statSync(socketPath).ino !== before.stat.ino) throw new Error('Profile lock changed; try again.');
+      unlinkSync(socketPath);
+    }
+    await listen();
   }
   const unlock = () => new Promise<void>(resolve => server.close(() => resolve()));
-  try { chmodSync(socketPath, 0o600); } catch (error) { await unlock(); throw error; }
+  if (!isWindows) { try { chmodSync(socketPath, 0o600); } catch (error) { await unlock(); throw error; } }
   return unlock;
 }