@imgly/codesign-mcp 0.1.0

package/dist/metrics/recorder.d.ts

@@ -0,0 +1,55 @@
+export interface MetricsRecorderOptions {
+    /** Max tool-call records kept in the recent-calls ring. Default 100. */
+    recentLimit?: number;
+    /** Max per-tool durations retained for percentile math. Default 256. */
+    sampleSize?: number;
+    /** Process-memory sampling interval in ms. Default 5000. */
+    memorySampleMs?: number;
+}
+export interface ToolStat {
+    tool: string;
+    count: number;
+    errorCount: number;
+    min: number;
+    max: number;
+    mean: number;
+    p50: number;
+    p95: number;
+}
+export interface MemorySample {
+    rss: number;
+    heapUsed: number;
+    external: number;
+    arrayBuffers: number;
+}
+export interface ToolCallRecord {
+    tool: string;
+    durationMs: number;
+    ok: boolean;
+    ts: number;
+}
+export interface MetricsSnapshot {
+    tools: ToolStat[];
+    recent: ToolCallRecord[];
+    memory: MemorySample | null;
+}
+export declare class MetricsRecorder {
+    private readonly recentLimit;
+    private readonly sampleSize;
+    private readonly memorySampleMs;
+    private readonly recent;
+    private readonly tools;
+    private memory;
+    private timer;
+    constructor(opts?: MetricsRecorderOptions);
+    record(event: {
+        tool: string;
+        durationMs: number;
+        ok: boolean;
+    }): void;
+    sampleMemory(): void;
+    start(): void;
+    stop(): void;
+    snapshot(): MetricsSnapshot;
+}
+//# sourceMappingURL=recorder.d.ts.map

package/dist/metrics/recorder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recorder.d.ts","sourceRoot":"","sources":["../../src/metrics/recorder.ts"],"names":[],"mappings":"AAeA,MAAM,WAAW,sBAAsB;IACrC,wEAAwE;IACxE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,wEAAwE;IACxE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,4DAA4D;IAC5D,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,EAAE,EAAE,OAAO,CAAC;IACZ,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;CAC7B;AAiBD,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IACxC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAwB;IAC/C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA8B;IACpD,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,KAAK,CAA+C;gBAEhD,IAAI,GAAE,sBAA2B;IAM7C,MAAM,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI;IAoBtE,YAAY,IAAI,IAAI;IAUpB,KAAK,IAAI,IAAI;IAQb,IAAI,IAAI,IAAI;IAMZ,QAAQ,IAAI,eAAe;CAmB5B"}

package/dist/metrics/recorder.js

@@ -0,0 +1,97 @@
+// packages/codesign-mcp/src/metrics/recorder.ts
+//
+// In-memory, process-global performance recorder for the MCP server. Times
+// every tool call (TOTAL wall-time only — "Approach A"), samples process
+// memory on a timer, and exposes a point-in-time snapshot for the /metrics
+// route and the dashboard SPA. Ephemeral: all state lives in memory and resets
+// on restart. No persistence, no time-series, no secrets.
+//
+// APPROACH-A LIMITATION (deliberate, design §3): the recorder is fed by a
+// single wrapper AROUND each tool call (see server.ts), so it observes only
+// total wall-time. It cannot split engine-lock wait from execution, nor detect
+// a cold engine reload — those happen INSIDE the call and are invisible to an
+// outer wrapper. The deeper splits are a future addition (design §8) and must
+// NOT couple Mutex / EngineSession to this recorder.
+/** Nearest-rank percentile over an ascending-sorted sample. */
+function percentile(sorted, p) {
+    if (sorted.length === 0)
+        return 0;
+    const rank = Math.ceil((p / 100) * sorted.length);
+    const idx = Math.min(sorted.length - 1, Math.max(0, rank - 1));
+    return sorted[idx];
+}
+export class MetricsRecorder {
+    constructor(opts = {}) {
+        this.recent = [];
+        this.tools = new Map();
+        this.memory = null;
+        this.timer = null;
+        this.recentLimit = opts.recentLimit ?? 100;
+        this.sampleSize = opts.sampleSize ?? 256;
+        this.memorySampleMs = opts.memorySampleMs ?? 5000;
+    }
+    record(event) {
+        this.recent.push({
+            tool: event.tool,
+            durationMs: event.durationMs,
+            ok: event.ok,
+            ts: Date.now()
+        });
+        if (this.recent.length > this.recentLimit)
+            this.recent.shift();
+        let agg = this.tools.get(event.tool);
+        if (!agg) {
+            agg = { count: 0, errorCount: 0, durations: [] };
+            this.tools.set(event.tool, agg);
+        }
+        agg.count += 1;
+        if (!event.ok)
+            agg.errorCount += 1;
+        agg.durations.push(event.durationMs);
+        if (agg.durations.length > this.sampleSize)
+            agg.durations.shift();
+    }
+    sampleMemory() {
+        const m = process.memoryUsage();
+        this.memory = {
+            rss: m.rss,
+            heapUsed: m.heapUsed,
+            external: m.external,
+            arrayBuffers: m.arrayBuffers
+        };
+    }
+    start() {
+        if (this.timer)
+            return;
+        this.sampleMemory(); // seed so the first snapshot isn't null
+        this.timer = setInterval(() => this.sampleMemory(), this.memorySampleMs);
+        // Never keep the event loop alive on the metrics timer alone.
+        this.timer.unref();
+    }
+    stop() {
+        if (!this.timer)
+            return;
+        clearInterval(this.timer);
+        this.timer = null;
+    }
+    snapshot() {
+        const tools = [];
+        for (const [tool, agg] of this.tools) {
+            const sorted = [...agg.durations].sort((a, b) => a - b);
+            const n = sorted.length;
+            const sum = sorted.reduce((s, d) => s + d, 0);
+            tools.push({
+                tool,
+                count: agg.count,
+                errorCount: agg.errorCount,
+                min: n ? sorted[0] : 0,
+                max: n ? sorted[n - 1] : 0,
+                mean: n ? sum / n : 0,
+                p50: percentile(sorted, 50),
+                p95: percentile(sorted, 95)
+            });
+        }
+        return { tools, recent: [...this.recent], memory: this.memory };
+    }
+}
+//# sourceMappingURL=recorder.js.map

package/dist/metrics/recorder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recorder.js","sourceRoot":"","sources":["../../src/metrics/recorder.ts"],"names":[],"mappings":"AAAA,gDAAgD;AAChD,EAAE;AACF,2EAA2E;AAC3E,yEAAyE;AACzE,2EAA2E;AAC3E,+EAA+E;AAC/E,0DAA0D;AAC1D,EAAE;AACF,0EAA0E;AAC1E,4EAA4E;AAC5E,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,qDAAqD;AAiDrD,+DAA+D;AAC/D,SAAS,UAAU,CAAC,MAAgB,EAAE,CAAS;IAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAClD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;AACrB,CAAC;AAED,MAAM,OAAO,eAAe;IAS1B,YAAY,OAA+B,EAAE;QAL5B,WAAM,GAAqB,EAAE,CAAC;QAC9B,UAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,WAAM,GAAwB,IAAI,CAAC;QACnC,UAAK,GAA0C,IAAI,CAAC;QAG1D,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,GAAG,CAAC;QAC3C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC;IACpD,CAAC;IAED,MAAM,CAAC,KAAwD;QAC7D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE;SACf,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW;YAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAE/D,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,EAAE;YAAE,GAAG,CAAC,UAAU,IAAI,CAAC,CAAC;QACnC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU;YAAE,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IACpE,CAAC;IAED,YAAY;QACV,MAAM,CAAC,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,MAAM,GAAG;YACZ,GAAG,EAAE,CAAC,CAAC,GAAG;YACV,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,YAAY,EAAE,CAAC,CAAC,YAAY;SAC7B,CAAC;IACJ,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,wCAAwC;QAC7D,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QACzE,8DAA8D;QAC9D,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,IAAI;QACF,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,QAAQ;QACN,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;YACxB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI;gBACJ,KAAK,EAAE,GAAG,CAAC,KAAK;gBAChB,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtB,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrB,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3B,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;aAC5B,CAAC,CAAC;QACL,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;IAClE,CAAC;CACF","sourcesContent":["// packages/codesign-mcp/src/metrics/recorder.ts\n//\n// In-memory, process-global performance recorder for the MCP server. Times\n// every tool call (TOTAL wall-time only — \"Approach A\"), samples process\n// memory on a timer, and exposes a point-in-time snapshot for the /metrics\n// route and the dashboard SPA. Ephemeral: all state lives in memory and resets\n// on restart. No persistence, no time-series, no secrets.\n//\n// APPROACH-A LIMITATION (deliberate, design §3): the recorder is fed by a\n// single wrapper AROUND each tool call (see server.ts), so it observes only\n// total wall-time. It cannot split engine-lock wait from execution, nor detect\n// a cold engine reload — those happen INSIDE the call and are invisible to an\n// outer wrapper. The deeper splits are a future addition (design §8) and must\n// NOT couple Mutex / EngineSession to this recorder.\n\nexport interface MetricsRecorderOptions {\n  /** Max tool-call records kept in the recent-calls ring. Default 100. */\n  recentLimit?: number;\n  /** Max per-tool durations retained for percentile math. Default 256. */\n  sampleSize?: number;\n  /** Process-memory sampling interval in ms. Default 5000. */\n  memorySampleMs?: number;\n}\n\nexport interface ToolStat {\n  tool: string;\n  count: number;\n  errorCount: number;\n  min: number;\n  max: number;\n  mean: number;\n  p50: number;\n  p95: number;\n}\n\nexport interface MemorySample {\n  rss: number;\n  heapUsed: number;\n  external: number;\n  arrayBuffers: number;\n}\n\nexport interface ToolCallRecord {\n  tool: string;\n  durationMs: number;\n  ok: boolean;\n  ts: number;\n}\n\nexport interface MetricsSnapshot {\n  tools: ToolStat[];\n  recent: ToolCallRecord[];\n  memory: MemorySample | null;\n}\n\n/** Per-tool running aggregate. `durations` is a bounded, most-recent sample. */\ninterface ToolAgg {\n  count: number; // lifetime\n  errorCount: number; // lifetime\n  durations: number[]; // bounded to sampleSize; oldest shifted out\n}\n\n/** Nearest-rank percentile over an ascending-sorted sample. */\nfunction percentile(sorted: number[], p: number): number {\n  if (sorted.length === 0) return 0;\n  const rank = Math.ceil((p / 100) * sorted.length);\n  const idx = Math.min(sorted.length - 1, Math.max(0, rank - 1));\n  return sorted[idx];\n}\n\nexport class MetricsRecorder {\n  private readonly recentLimit: number;\n  private readonly sampleSize: number;\n  private readonly memorySampleMs: number;\n  private readonly recent: ToolCallRecord[] = [];\n  private readonly tools = new Map<string, ToolAgg>();\n  private memory: MemorySample | null = null;\n  private timer: ReturnType<typeof setInterval> | null = null;\n\n  constructor(opts: MetricsRecorderOptions = {}) {\n    this.recentLimit = opts.recentLimit ?? 100;\n    this.sampleSize = opts.sampleSize ?? 256;\n    this.memorySampleMs = opts.memorySampleMs ?? 5000;\n  }\n\n  record(event: { tool: string; durationMs: number; ok: boolean }): void {\n    this.recent.push({\n      tool: event.tool,\n      durationMs: event.durationMs,\n      ok: event.ok,\n      ts: Date.now()\n    });\n    if (this.recent.length > this.recentLimit) this.recent.shift();\n\n    let agg = this.tools.get(event.tool);\n    if (!agg) {\n      agg = { count: 0, errorCount: 0, durations: [] };\n      this.tools.set(event.tool, agg);\n    }\n    agg.count += 1;\n    if (!event.ok) agg.errorCount += 1;\n    agg.durations.push(event.durationMs);\n    if (agg.durations.length > this.sampleSize) agg.durations.shift();\n  }\n\n  sampleMemory(): void {\n    const m = process.memoryUsage();\n    this.memory = {\n      rss: m.rss,\n      heapUsed: m.heapUsed,\n      external: m.external,\n      arrayBuffers: m.arrayBuffers\n    };\n  }\n\n  start(): void {\n    if (this.timer) return;\n    this.sampleMemory(); // seed so the first snapshot isn't null\n    this.timer = setInterval(() => this.sampleMemory(), this.memorySampleMs);\n    // Never keep the event loop alive on the metrics timer alone.\n    this.timer.unref();\n  }\n\n  stop(): void {\n    if (!this.timer) return;\n    clearInterval(this.timer);\n    this.timer = null;\n  }\n\n  snapshot(): MetricsSnapshot {\n    const tools: ToolStat[] = [];\n    for (const [tool, agg] of this.tools) {\n      const sorted = [...agg.durations].sort((a, b) => a - b);\n      const n = sorted.length;\n      const sum = sorted.reduce((s, d) => s + d, 0);\n      tools.push({\n        tool,\n        count: agg.count,\n        errorCount: agg.errorCount,\n        min: n ? sorted[0] : 0,\n        max: n ? sorted[n - 1] : 0,\n        mean: n ? sum / n : 0,\n        p50: percentile(sorted, 50),\n        p95: percentile(sorted, 95)\n      });\n    }\n    return { tools, recent: [...this.recent], memory: this.memory };\n  }\n}\n"]}

package/dist/revisions/hash.d.ts

@@ -0,0 +1,7 @@
+export interface RevisionIdInput {
+    scene: string;
+    parent: string | null;
+    note?: string;
+}
+export declare function revisionId(input: RevisionIdInput): Promise<string>;
+//# sourceMappingURL=hash.d.ts.map

package/dist/revisions/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/revisions/hash.ts"],"names":[],"mappings":"AAeA,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,wBAAsB,UAAU,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC,CASxE"}

package/dist/revisions/hash.js

@@ -0,0 +1,24 @@
+//
+// Revision id = first 12 hex chars of sha-256("<scene>|<parent>|<note>").
+//
+// Why 12: 48 bits = 281 trillion. Per workspace, even 1M revisions has a
+// collision probability < 2e-9 (birthday bound). Cheap to extend later — the
+// hash is opaque to callers.
+//
+// Why sha-256: ubiquitous, `globalThis.crypto.subtle` natively supports it
+// (engineering-principles §5: no CryptoProvider abstraction). blake3 would be
+// marginally faster but adds a dep for a function we call ~once per edit.
+//
+// Why include `note` in the digest: two identical edits with different notes
+// must produce distinct revisions (spec §4.3). Otherwise the second one would
+// overwrite the first's metadata file (also a constant key) silently.
+export async function revisionId(input) {
+    const buf = new TextEncoder().encode(`${input.scene}|${input.parent ?? ''}|${input.note ?? ''}`);
+    const digest = await globalThis.crypto.subtle.digest('SHA-256', buf);
+    const view = new Uint8Array(digest);
+    let hex = '';
+    for (let i = 0; i < 6; i++)
+        hex += view[i].toString(16).padStart(2, '0');
+    return hex;
+}
+//# sourceMappingURL=hash.js.map

package/dist/revisions/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/revisions/hash.ts"],"names":[],"mappings":"AAAA,EAAE;AACF,0EAA0E;AAC1E,EAAE;AACF,yEAAyE;AACzE,6EAA6E;AAC7E,6BAA6B;AAC7B,EAAE;AACF,2EAA2E;AAC3E,8EAA8E;AAC9E,0EAA0E;AAC1E,EAAE;AACF,6EAA6E;AAC7E,8EAA8E;AAC9E,sEAAsE;AAQtE,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,KAAsB;IACrD,MAAM,GAAG,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAClC,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,IAAI,KAAK,CAAC,IAAI,IAAI,EAAE,EAAE,CAC3D,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IACrE,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzE,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["//\n// Revision id = first 12 hex chars of sha-256(\"<scene>|<parent>|<note>\").\n//\n// Why 12: 48 bits = 281 trillion. Per workspace, even 1M revisions has a\n// collision probability < 2e-9 (birthday bound). Cheap to extend later — the\n// hash is opaque to callers.\n//\n// Why sha-256: ubiquitous, `globalThis.crypto.subtle` natively supports it\n// (engineering-principles §5: no CryptoProvider abstraction). blake3 would be\n// marginally faster but adds a dep for a function we call ~once per edit.\n//\n// Why include `note` in the digest: two identical edits with different notes\n// must produce distinct revisions (spec §4.3). Otherwise the second one would\n// overwrite the first's metadata file (also a constant key) silently.\n\nexport interface RevisionIdInput {\n  scene: string;\n  parent: string | null;\n  note?: string;\n}\n\nexport async function revisionId(input: RevisionIdInput): Promise<string> {\n  const buf = new TextEncoder().encode(\n    `${input.scene}|${input.parent ?? ''}|${input.note ?? ''}`\n  );\n  const digest = await globalThis.crypto.subtle.digest('SHA-256', buf);\n  const view = new Uint8Array(digest);\n  let hex = '';\n  for (let i = 0; i < 6; i++) hex += view[i].toString(16).padStart(2, '0');\n  return hex;\n}\n"]}

package/dist/revisions/index.d.ts

@@ -0,0 +1,4 @@
+export { revisionId } from './hash.js';
+export { RevisionStore, type WriteRevisionInput } from './store.js';
+export * from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/revisions/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/revisions/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,aAAa,EAAE,KAAK,kBAAkB,EAAE,MAAM,YAAY,CAAC;AACpE,cAAc,YAAY,CAAC"}

package/dist/revisions/index.js

@@ -0,0 +1,4 @@
+export { revisionId } from './hash.js';
+export { RevisionStore } from './store.js';
+export * from './types.js';
+//# sourceMappingURL=index.js.map

package/dist/revisions/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/revisions/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,aAAa,EAA2B,MAAM,YAAY,CAAC;AACpE,cAAc,YAAY,CAAC","sourcesContent":["export { revisionId } from './hash.js';\nexport { RevisionStore, type WriteRevisionInput } from './store.js';\nexport * from './types.js';\n"]}

package/dist/revisions/store.d.ts

@@ -0,0 +1,69 @@
+import type { WorkspaceFS } from '../workspace/types.js';
+import type { Revision, RevisionNode, RootEntry } from './types.js';
+export interface WriteRevisionInput {
+    scene: string;
+    parent: string | null;
+    title?: string;
+    note?: string;
+    /**
+     * Optional: the JS source that produced this revision. Persisted as a
+     * sibling `<id>.code.js` file so a future agent (via the `inspect` tool)
+     * can read what operations led to this state. Not part of `revisionId`.
+     */
+    code?: string;
+}
+export declare class RevisionStore {
+    private readonly fs;
+    constructor(fs: WorkspaceFS);
+    private objectsPath;
+    private journalPath;
+    private titlePath;
+    private appendTitle;
+    private readMeta;
+    write(input: WriteRevisionInput): Promise<Revision>;
+    /**
+     * Read the JS source that produced a revision, if it was written through
+     * the `edit` tool. Returns undefined when the revision has no associated
+     * code file (e.g. future import / convert paths). Throws ENOENT only when
+     * the revision id itself is unknown — callers should `.read(id)` first to
+     * surface that.
+     */
+    readCode(id: string): Promise<string | undefined>;
+    read(id: string): Promise<Revision>;
+    /**
+     * Current title for a lineage root = the latest `titles/<root>/` event.
+     * Falls back to "Untitled" when the root has no title events (e.g. an
+     * unknown root id). Public because the viewer renders the live title.
+     */
+    currentTitle(root: string): Promise<string>;
+    /**
+     * Reconstruct the root index by folding the journal: for each root, the
+     * entry with the greatest padded timestamp is the latest leaf. No mutable
+     * index, no roots.json. Newest-first by updatedAt.
+     */
+    listRoots(): Promise<Array<{
+        rootRevision: string;
+    } & RootEntry>>;
+    /** Walk from `revision` back to the root. Returns the chain (root first → revision last). */
+    historyOf(revision: string): Promise<Revision[]>;
+    /**
+     * Every revision in the design tree that `root` belongs to, as metadata-only
+     * nodes sorted by `createdAt` ascending. `root` may be any revision id in the
+     * design — it is resolved to its lineage root (consistent with `historyOf` /
+     * `renameRoot`). An id not present in the store yields `[]`.
+     *
+     * Walks all of `objects/`. Cheap at POC scale; a Phase-2 per-root index would
+     * replace it.
+     */
+    treeOf(root: string): Promise<RevisionNode[]>;
+    /**
+     * Rename the root of `revision`'s lineage by appending a title event.
+     * `revision` may be mid-chain — its `meta.root` points at the lineage root.
+     * Titles are append-only (immutable revisions are never rewritten); the
+     * "current" title is the latest event (see `currentTitle`).
+     */
+    renameRoot(revision: string, title: string): Promise<{
+        rootRevision: string;
+    }>;
+}
+//# sourceMappingURL=store.d.ts.map

package/dist/revisions/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/revisions/store.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,KAAK,EACV,QAAQ,EAER,YAAY,EACZ,SAAS,EACV,MAAM,YAAY,CAAC;AAapB,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,aAAa;IACZ,OAAO,CAAC,QAAQ,CAAC,EAAE;gBAAF,EAAE,EAAE,WAAW;IAE5C,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,SAAS;YAIH,WAAW;YAQX,QAAQ;IAMhB,KAAK,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO,CAAC,QAAQ,CAAC;IAgCzD;;;;;;OAMG;IACG,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAMjD,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAUzC;;;;OAIG;IACG,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IASjD;;;;OAIG;IACG,SAAS,IAAI,OAAO,CAAC,KAAK,CAAC;QAAE,YAAY,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC,CAAC;IAiBvE,6FAA6F;IACvF,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAWtD;;;;;;;;OAQG;IACG,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAqDnD;;;;;OAKG;IACG,UAAU,CACd,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC;QAAE,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;CAKrC"}

package/dist/revisions/store.js

@@ -0,0 +1,196 @@
+import { revisionId } from './hash.js';
+const OBJECTS_DIR = 'objects';
+const JOURNAL_DIR = 'journal';
+const TITLES_DIR = 'titles';
+// Zero-pad createdAtMs so a lexical `readdir` sort equals chronological order.
+// 16 digits covers epoch-ms well beyond the year 5000.
+const TS_WIDTH = 16;
+function padTs(ms) {
+    return String(ms).padStart(TS_WIDTH, '0');
+}
+export class RevisionStore {
+    constructor(fs) {
+        this.fs = fs;
+    }
+    objectsPath(id, ext) {
+        return `${OBJECTS_DIR}/${id.slice(0, 2)}/${id.slice(2)}.${ext}`;
+    }
+    journalPath(root, createdAt, leaf) {
+        return `${JOURNAL_DIR}/${root}/${padTs(createdAt)}-${leaf}`;
+    }
+    titlePath(root, createdAt) {
+        return `${TITLES_DIR}/${root}/${padTs(createdAt)}`;
+    }
+    async appendTitle(root, title, createdAt) {
+        await this.fs.writeFile(this.titlePath(root, createdAt), title);
+    }
+    async readMeta(id) {
+        return JSON.parse(await this.fs.readFile(this.objectsPath(id, 'json'), 'utf8'));
+    }
+    async write(input) {
+        const id = await revisionId({
+            scene: input.scene,
+            parent: input.parent,
+            note: input.note
+        });
+        const createdAt = Date.now();
+        const root = input.parent === null ? id : (await this.readMeta(input.parent)).root;
+        const meta = {
+            parent: input.parent,
+            root,
+            createdAt,
+            ...(input.title !== undefined ? { title: input.title } : {}),
+            ...(input.note !== undefined ? { note: input.note } : {})
+        };
+        const scenePath = this.objectsPath(id, 'scene');
+        const metaPath = this.objectsPath(id, 'json');
+        await this.fs.writeFile(scenePath, input.scene);
+        await this.fs.writeFile(metaPath, JSON.stringify(meta));
+        if (input.code !== undefined) {
+            await this.fs.writeFile(this.objectsPath(id, 'code.js'), input.code);
+        }
+        // Append-only index: one write-once journal entry per revision.
+        await this.fs.writeFile(this.journalPath(root, createdAt, id), '');
+        // Seed the title tree on root creation so listRoots needs no objects reads.
+        if (input.parent === null) {
+            await this.appendTitle(root, input.title ?? 'Untitled', createdAt);
+        }
+        return { id, meta, scene: input.scene };
+    }
+    /**
+     * Read the JS source that produced a revision, if it was written through
+     * the `edit` tool. Returns undefined when the revision has no associated
+     * code file (e.g. future import / convert paths). Throws ENOENT only when
+     * the revision id itself is unknown — callers should `.read(id)` first to
+     * surface that.
+     */
+    async readCode(id) {
+        const path = this.objectsPath(id, 'code.js');
+        if (!(await this.fs.exists(path)))
+            return undefined;
+        return await this.fs.readFile(path, 'utf8');
+    }
+    async read(id) {
+        const scene = await this.fs.readFile(this.objectsPath(id, 'scene'), 'utf8');
+        const metaText = await this.fs.readFile(this.objectsPath(id, 'json'), 'utf8');
+        const meta = JSON.parse(metaText);
+        return { id, meta, scene };
+    }
+    /**
+     * Current title for a lineage root = the latest `titles/<root>/` event.
+     * Falls back to "Untitled" when the root has no title events (e.g. an
+     * unknown root id). Public because the viewer renders the live title.
+     */
+    async currentTitle(root) {
+        const dir = `${TITLES_DIR}/${root}`;
+        if (!(await this.fs.exists(dir)))
+            return 'Untitled';
+        const events = await this.fs.readdir(dir);
+        if (events.length === 0)
+            return 'Untitled';
+        events.sort(); // padded-ts filenames: lexical sort == chronological
+        return this.fs.readFile(`${dir}/${events[events.length - 1]}`, 'utf8');
+    }
+    /**
+     * Reconstruct the root index by folding the journal: for each root, the
+     * entry with the greatest padded timestamp is the latest leaf. No mutable
+     * index, no roots.json. Newest-first by updatedAt.
+     */
+    async listRoots() {
+        if (!(await this.fs.exists(JOURNAL_DIR)))
+            return [];
+        const out = [];
+        for (const root of await this.fs.readdir(JOURNAL_DIR)) {
+            const entries = await this.fs.readdir(`${JOURNAL_DIR}/${root}`);
+            if (entries.length === 0)
+                continue;
+            entries.sort(); // padded-ts filenames: lexical sort == chronological
+            const latest = entries[entries.length - 1];
+            const dash = latest.indexOf('-');
+            const updatedAt = Number(latest.slice(0, dash));
+            const latestLeaf = latest.slice(dash + 1);
+            const title = await this.currentTitle(root);
+            out.push({ rootRevision: root, title, latestLeaf, updatedAt });
+        }
+        return out.sort((a, b) => b.updatedAt - a.updatedAt);
+    }
+    /** Walk from `revision` back to the root. Returns the chain (root first → revision last). */
+    async historyOf(revision) {
+        const chain = [];
+        let cur = revision;
+        while (cur !== null) {
+            const rev = await this.read(cur);
+            chain.unshift(rev);
+            cur = rev.meta.parent;
+        }
+        return chain;
+    }
+    /**
+     * Every revision in the design tree that `root` belongs to, as metadata-only
+     * nodes sorted by `createdAt` ascending. `root` may be any revision id in the
+     * design — it is resolved to its lineage root (consistent with `historyOf` /
+     * `renameRoot`). An id not present in the store yields `[]`.
+     *
+     * Walks all of `objects/`. Cheap at POC scale; a Phase-2 per-root index would
+     * replace it.
+     */
+    async treeOf(root) {
+        if (!(await this.fs.exists(OBJECTS_DIR)))
+            return [];
+        // Read every revision's metadata into an id -> meta map.
+        const metas = new Map();
+        for (const shard of await this.fs.readdir(OBJECTS_DIR)) {
+            for (const entry of await this.fs.readdir(`${OBJECTS_DIR}/${shard}`)) {
+                if (!entry.endsWith('.json'))
+                    continue;
+                const id = shard + entry.slice(0, -'.json'.length);
+                metas.set(id, JSON.parse(await this.fs.readFile(`${OBJECTS_DIR}/${shard}/${entry}`, 'utf8')));
+            }
+        }
+        if (!metas.has(root))
+            return [];
+        // Resolve `root` to the true lineage root.
+        let lineageRoot = root;
+        for (let meta = metas.get(lineageRoot); meta?.parent != null; meta = metas.get(lineageRoot)) {
+            lineageRoot = meta.parent;
+        }
+        // Index children by parent.
+        const children = new Map();
+        for (const [id, meta] of metas) {
+            if (meta.parent != null) {
+                const siblings = children.get(meta.parent) ?? [];
+                siblings.push(id);
+                children.set(meta.parent, siblings);
+            }
+        }
+        // BFS from the lineage root; collect the connected tree.
+        const nodes = [];
+        const queue = [lineageRoot];
+        for (let id = queue.shift(); id !== undefined; id = queue.shift()) {
+            const meta = metas.get(id);
+            if (meta === undefined)
+                continue;
+            nodes.push({
+                id,
+                parent: meta.parent,
+                note: meta.note,
+                createdAt: meta.createdAt
+            });
+            queue.push(...(children.get(id) ?? []));
+        }
+        nodes.sort((a, b) => a.createdAt - b.createdAt);
+        return nodes;
+    }
+    /**
+     * Rename the root of `revision`'s lineage by appending a title event.
+     * `revision` may be mid-chain — its `meta.root` points at the lineage root.
+     * Titles are append-only (immutable revisions are never rewritten); the
+     * "current" title is the latest event (see `currentTitle`).
+     */
+    async renameRoot(revision, title) {
+        const { root } = await this.readMeta(revision);
+        await this.appendTitle(root, title, Date.now());
+        return { rootRevision: root };
+    }
+}
+//# sourceMappingURL=store.js.map

package/dist/revisions/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../src/revisions/store.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAQvC,MAAM,WAAW,GAAG,SAAS,CAAC;AAC9B,MAAM,WAAW,GAAG,SAAS,CAAC;AAC9B,MAAM,UAAU,GAAG,QAAQ,CAAC;AAC5B,+EAA+E;AAC/E,uDAAuD;AACvD,MAAM,QAAQ,GAAG,EAAE,CAAC;AAEpB,SAAS,KAAK,CAAC,EAAU;IACvB,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAC5C,CAAC;AAeD,MAAM,OAAO,aAAa;IACxB,YAA6B,EAAe;QAAf,OAAE,GAAF,EAAE,CAAa;IAAG,CAAC;IAExC,WAAW,CAAC,EAAU,EAAE,GAAiC;QAC/D,OAAO,GAAG,WAAW,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;IAClE,CAAC;IAEO,WAAW,CAAC,IAAY,EAAE,SAAiB,EAAE,IAAY;QAC/D,OAAO,GAAG,WAAW,IAAI,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,IAAI,EAAE,CAAC;IAC9D,CAAC;IAEO,SAAS,CAAC,IAAY,EAAE,SAAiB;QAC/C,OAAO,GAAG,UAAU,IAAI,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;IACrD,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,IAAY,EACZ,KAAa,EACb,SAAiB;QAEjB,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,KAAK,CAAC,CAAC;IAClE,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC/B,OAAO,IAAI,CAAC,KAAK,CACf,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,CAC7C,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,KAAyB;QACnC,MAAM,EAAE,GAAG,MAAM,UAAU,CAAC;YAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,IAAI,EAAE,KAAK,CAAC,IAAI;SACjB,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,IAAI,GACR,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;QACxE,MAAM,IAAI,GAAiB;YACzB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,IAAI;YACJ,SAAS;YACT,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC1D,CAAC;QACF,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACvE,CAAC;QACD,gEAAgE;QAChE,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACnE,4EAA4E;QAC5E,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC1B,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,UAAU,EAAE,SAAS,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,QAAQ,CAAC,EAAU;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC7C,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACpD,OAAO,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAU;QACnB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;QAC5E,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CACrC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,EAC5B,MAAM,CACP,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAiB,CAAC;QAClD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,CAAC,IAAY;QAC7B,MAAM,GAAG,GAAG,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC;QACpC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAAE,OAAO,UAAU,CAAC;QACpD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,UAAU,CAAC;QAC3C,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,qDAAqD;QACpE,OAAO,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACzE,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAS;QACb,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC;QACpD,MAAM,GAAG,GAAgD,EAAE,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YACtD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,WAAW,IAAI,IAAI,EAAE,CAAC,CAAC;YAChE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,qDAAqD;YACrE,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YAChD,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IACvD,CAAC;IAED,6FAA6F;IAC7F,KAAK,CAAC,SAAS,CAAC,QAAgB;QAC9B,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,GAAG,GAAkB,QAAQ,CAAC;QAClC,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;QACxB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC;QACpD,yDAAyD;QACzD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YACvD,KAAK,MAAM,KAAK,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,WAAW,IAAI,KAAK,EAAE,CAAC,EAAE,CAAC;gBACrE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE,SAAS;gBACvC,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACnD,KAAK,CAAC,GAAG,CACP,EAAE,EACF,IAAI,CAAC,KAAK,CACR,MAAM,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,WAAW,IAAI,KAAK,IAAI,KAAK,EAAE,EAAE,MAAM,CAAC,CACnD,CAClB,CAAC;YACJ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAChC,2CAA2C;QAC3C,IAAI,WAAW,GAAG,IAAI,CAAC;QACvB,KACE,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,EACjC,IAAI,EAAE,MAAM,IAAI,IAAI,EACpB,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,EAC7B,CAAC;YACD,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,CAAC;QACD,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC7C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACjD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,yDAAyD;QACzD,MAAM,KAAK,GAAmB,EAAE,CAAC;QACjC,MAAM,KAAK,GAAa,CAAC,WAAW,CAAC,CAAC;QACtC,KAAK,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,SAAS,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YAClE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YACjC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE;gBACF,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,SAAS,EAAE,IAAI,CAAC,SAAS;aAC1B,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,UAAU,CACd,QAAgB,EAChB,KAAa;QAEb,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC/C,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAChD,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;IAChC,CAAC;CACF","sourcesContent":["//\n// RevisionStore — pure logic over a WorkspaceFS. Sharded `objects/<ab>/<rest>`\n// layout (git-style), fully immutable/content-addressed. The index is\n// append-only and event-sourced: every write appends a write-once\n// `journal/<root>/<paddedTs>-<leaf>` entry, and titles are append-only\n// `titles/<root>/<paddedTs>` events. `listRoots`/`currentTitle` reconstruct\n// state by folding a `readdir` — no mutable file, no lock, no external DB.\n//\n// Each revision can have up to three sibling files:\n//   <id>.scene  → scene bytes (always present)\n//   <id>.json   → meta {parent, note?, title?, createdAt} (always present)\n//   <id>.code.js → the JS that the `edit` tool ran to produce this revision\n//                  (present only when written through the edit tool; never\n//                  for revisions written by future import / convert paths)\n// Code is intentionally NOT in `revisionId` — the id identifies the scene\n// state, not the path that produced it. Two distinct code paths arriving at\n// the same scene with the same parent+note are the same revision.\n//\nimport type { WorkspaceFS } from '../workspace/types.js';\nimport { revisionId } from './hash.js';\nimport type {\n  Revision,\n  RevisionMeta,\n  RevisionNode,\n  RootEntry\n} from './types.js';\n\nconst OBJECTS_DIR = 'objects';\nconst JOURNAL_DIR = 'journal';\nconst TITLES_DIR = 'titles';\n// Zero-pad createdAtMs so a lexical `readdir` sort equals chronological order.\n// 16 digits covers epoch-ms well beyond the year 5000.\nconst TS_WIDTH = 16;\n\nfunction padTs(ms: number): string {\n  return String(ms).padStart(TS_WIDTH, '0');\n}\n\nexport interface WriteRevisionInput {\n  scene: string;\n  parent: string | null;\n  title?: string;\n  note?: string;\n  /**\n   * Optional: the JS source that produced this revision. Persisted as a\n   * sibling `<id>.code.js` file so a future agent (via the `inspect` tool)\n   * can read what operations led to this state. Not part of `revisionId`.\n   */\n  code?: string;\n}\n\nexport class RevisionStore {\n  constructor(private readonly fs: WorkspaceFS) {}\n\n  private objectsPath(id: string, ext: 'scene' | 'json' | 'code.js'): string {\n    return `${OBJECTS_DIR}/${id.slice(0, 2)}/${id.slice(2)}.${ext}`;\n  }\n\n  private journalPath(root: string, createdAt: number, leaf: string): string {\n    return `${JOURNAL_DIR}/${root}/${padTs(createdAt)}-${leaf}`;\n  }\n\n  private titlePath(root: string, createdAt: number): string {\n    return `${TITLES_DIR}/${root}/${padTs(createdAt)}`;\n  }\n\n  private async appendTitle(\n    root: string,\n    title: string,\n    createdAt: number\n  ): Promise<void> {\n    await this.fs.writeFile(this.titlePath(root, createdAt), title);\n  }\n\n  private async readMeta(id: string): Promise<RevisionMeta> {\n    return JSON.parse(\n      await this.fs.readFile(this.objectsPath(id, 'json'), 'utf8')\n    ) as RevisionMeta;\n  }\n\n  async write(input: WriteRevisionInput): Promise<Revision> {\n    const id = await revisionId({\n      scene: input.scene,\n      parent: input.parent,\n      note: input.note\n    });\n    const createdAt = Date.now();\n    const root =\n      input.parent === null ? id : (await this.readMeta(input.parent)).root;\n    const meta: RevisionMeta = {\n      parent: input.parent,\n      root,\n      createdAt,\n      ...(input.title !== undefined ? { title: input.title } : {}),\n      ...(input.note !== undefined ? { note: input.note } : {})\n    };\n    const scenePath = this.objectsPath(id, 'scene');\n    const metaPath = this.objectsPath(id, 'json');\n    await this.fs.writeFile(scenePath, input.scene);\n    await this.fs.writeFile(metaPath, JSON.stringify(meta));\n    if (input.code !== undefined) {\n      await this.fs.writeFile(this.objectsPath(id, 'code.js'), input.code);\n    }\n    // Append-only index: one write-once journal entry per revision.\n    await this.fs.writeFile(this.journalPath(root, createdAt, id), '');\n    // Seed the title tree on root creation so listRoots needs no objects reads.\n    if (input.parent === null) {\n      await this.appendTitle(root, input.title ?? 'Untitled', createdAt);\n    }\n    return { id, meta, scene: input.scene };\n  }\n\n  /**\n   * Read the JS source that produced a revision, if it was written through\n   * the `edit` tool. Returns undefined when the revision has no associated\n   * code file (e.g. future import / convert paths). Throws ENOENT only when\n   * the revision id itself is unknown — callers should `.read(id)` first to\n   * surface that.\n   */\n  async readCode(id: string): Promise<string | undefined> {\n    const path = this.objectsPath(id, 'code.js');\n    if (!(await this.fs.exists(path))) return undefined;\n    return await this.fs.readFile(path, 'utf8');\n  }\n\n  async read(id: string): Promise<Revision> {\n    const scene = await this.fs.readFile(this.objectsPath(id, 'scene'), 'utf8');\n    const metaText = await this.fs.readFile(\n      this.objectsPath(id, 'json'),\n      'utf8'\n    );\n    const meta = JSON.parse(metaText) as RevisionMeta;\n    return { id, meta, scene };\n  }\n\n  /**\n   * Current title for a lineage root = the latest `titles/<root>/` event.\n   * Falls back to \"Untitled\" when the root has no title events (e.g. an\n   * unknown root id). Public because the viewer renders the live title.\n   */\n  async currentTitle(root: string): Promise<string> {\n    const dir = `${TITLES_DIR}/${root}`;\n    if (!(await this.fs.exists(dir))) return 'Untitled';\n    const events = await this.fs.readdir(dir);\n    if (events.length === 0) return 'Untitled';\n    events.sort(); // padded-ts filenames: lexical sort == chronological\n    return this.fs.readFile(`${dir}/${events[events.length - 1]}`, 'utf8');\n  }\n\n  /**\n   * Reconstruct the root index by folding the journal: for each root, the\n   * entry with the greatest padded timestamp is the latest leaf. No mutable\n   * index, no roots.json. Newest-first by updatedAt.\n   */\n  async listRoots(): Promise<Array<{ rootRevision: string } & RootEntry>> {\n    if (!(await this.fs.exists(JOURNAL_DIR))) return [];\n    const out: Array<{ rootRevision: string } & RootEntry> = [];\n    for (const root of await this.fs.readdir(JOURNAL_DIR)) {\n      const entries = await this.fs.readdir(`${JOURNAL_DIR}/${root}`);\n      if (entries.length === 0) continue;\n      entries.sort(); // padded-ts filenames: lexical sort == chronological\n      const latest = entries[entries.length - 1];\n      const dash = latest.indexOf('-');\n      const updatedAt = Number(latest.slice(0, dash));\n      const latestLeaf = latest.slice(dash + 1);\n      const title = await this.currentTitle(root);\n      out.push({ rootRevision: root, title, latestLeaf, updatedAt });\n    }\n    return out.sort((a, b) => b.updatedAt - a.updatedAt);\n  }\n\n  /** Walk from `revision` back to the root. Returns the chain (root first → revision last). */\n  async historyOf(revision: string): Promise<Revision[]> {\n    const chain: Revision[] = [];\n    let cur: string | null = revision;\n    while (cur !== null) {\n      const rev = await this.read(cur);\n      chain.unshift(rev);\n      cur = rev.meta.parent;\n    }\n    return chain;\n  }\n\n  /**\n   * Every revision in the design tree that `root` belongs to, as metadata-only\n   * nodes sorted by `createdAt` ascending. `root` may be any revision id in the\n   * design — it is resolved to its lineage root (consistent with `historyOf` /\n   * `renameRoot`). An id not present in the store yields `[]`.\n   *\n   * Walks all of `objects/`. Cheap at POC scale; a Phase-2 per-root index would\n   * replace it.\n   */\n  async treeOf(root: string): Promise<RevisionNode[]> {\n    if (!(await this.fs.exists(OBJECTS_DIR))) return [];\n    // Read every revision's metadata into an id -> meta map.\n    const metas = new Map<string, RevisionMeta>();\n    for (const shard of await this.fs.readdir(OBJECTS_DIR)) {\n      for (const entry of await this.fs.readdir(`${OBJECTS_DIR}/${shard}`)) {\n        if (!entry.endsWith('.json')) continue;\n        const id = shard + entry.slice(0, -'.json'.length);\n        metas.set(\n          id,\n          JSON.parse(\n            await this.fs.readFile(`${OBJECTS_DIR}/${shard}/${entry}`, 'utf8')\n          ) as RevisionMeta\n        );\n      }\n    }\n    if (!metas.has(root)) return [];\n    // Resolve `root` to the true lineage root.\n    let lineageRoot = root;\n    for (\n      let meta = metas.get(lineageRoot);\n      meta?.parent != null;\n      meta = metas.get(lineageRoot)\n    ) {\n      lineageRoot = meta.parent;\n    }\n    // Index children by parent.\n    const children = new Map<string, string[]>();\n    for (const [id, meta] of metas) {\n      if (meta.parent != null) {\n        const siblings = children.get(meta.parent) ?? [];\n        siblings.push(id);\n        children.set(meta.parent, siblings);\n      }\n    }\n    // BFS from the lineage root; collect the connected tree.\n    const nodes: RevisionNode[] = [];\n    const queue: string[] = [lineageRoot];\n    for (let id = queue.shift(); id !== undefined; id = queue.shift()) {\n      const meta = metas.get(id);\n      if (meta === undefined) continue;\n      nodes.push({\n        id,\n        parent: meta.parent,\n        note: meta.note,\n        createdAt: meta.createdAt\n      });\n      queue.push(...(children.get(id) ?? []));\n    }\n    nodes.sort((a, b) => a.createdAt - b.createdAt);\n    return nodes;\n  }\n\n  /**\n   * Rename the root of `revision`'s lineage by appending a title event.\n   * `revision` may be mid-chain — its `meta.root` points at the lineage root.\n   * Titles are append-only (immutable revisions are never rewritten); the\n   * \"current\" title is the latest event (see `currentTitle`).\n   */\n  async renameRoot(\n    revision: string,\n    title: string\n  ): Promise<{ rootRevision: string }> {\n    const { root } = await this.readMeta(revision);\n    await this.appendTitle(root, title, Date.now());\n    return { rootRevision: root };\n  }\n}\n"]}

package/dist/revisions/types.d.ts

@@ -0,0 +1,39 @@
+/** Persisted metadata for one revision (next to the .scene file). */
+export interface RevisionMeta {
+    /** Parent revision id, or null for a root revision. */
+    parent: string | null;
+    /**
+     * Lineage root revision id. For a root revision (parent === null) this
+     * equals the revision's own id. Denormalized so a child resolves its root
+     * with one parent read instead of walking the whole chain. Not part of
+     * `revisionId` (the hash is scene + parent + note).
+     */
+    root: string;
+    /** Creation-time design title — seeded ONLY on root revisions. For the live/current title (after renames) use `RevisionStore.currentTitle()`. */
+    title?: string;
+    /** Freeform note from the agent describing what this edit accomplished. */
+    note?: string;
+    /** UNIX-epoch ms when this revision was written. */
+    createdAt: number;
+}
+/** One revision as the agent + viewer see it: id + meta + scene bytes (string). */
+export interface Revision {
+    id: string;
+    meta: RevisionMeta;
+    scene: string;
+}
+/** Shape of one entry returned by `listRoots()` (reconstructed from the journal + title events). */
+export interface RootEntry {
+    title: string;
+    /** The most recently written leaf for this root (the "latest tip"). */
+    latestLeaf: string;
+    updatedAt: number;
+}
+/** One revision as the viewer's tree panel sees it: metadata only, no scene. */
+export interface RevisionNode {
+    id: string;
+    parent: string | null;
+    note?: string;
+    createdAt: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/revisions/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/revisions/types.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,MAAM,WAAW,YAAY;IAC3B,uDAAuD;IACvD,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB;;;;;OAKG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,iJAAiJ;IACjJ,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2EAA2E;IAC3E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,mFAAmF;AACnF,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,YAAY,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,oGAAoG;AACpG,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,gFAAgF;AAChF,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB"}

package/dist/revisions/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/revisions/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/revisions/types.ts"],"names":[],"mappings":"","sourcesContent":["/** Persisted metadata for one revision (next to the .scene file). */\nexport interface RevisionMeta {\n  /** Parent revision id, or null for a root revision. */\n  parent: string | null;\n  /**\n   * Lineage root revision id. For a root revision (parent === null) this\n   * equals the revision's own id. Denormalized so a child resolves its root\n   * with one parent read instead of walking the whole chain. Not part of\n   * `revisionId` (the hash is scene + parent + note).\n   */\n  root: string;\n  /** Creation-time design title — seeded ONLY on root revisions. For the live/current title (after renames) use `RevisionStore.currentTitle()`. */\n  title?: string;\n  /** Freeform note from the agent describing what this edit accomplished. */\n  note?: string;\n  /** UNIX-epoch ms when this revision was written. */\n  createdAt: number;\n}\n\n/** One revision as the agent + viewer see it: id + meta + scene bytes (string). */\nexport interface Revision {\n  id: string;\n  meta: RevisionMeta;\n  scene: string;\n}\n\n/** Shape of one entry returned by `listRoots()` (reconstructed from the journal + title events). */\nexport interface RootEntry {\n  title: string;\n  /** The most recently written leaf for this root (the \"latest tip\"). */\n  latestLeaf: string;\n  updatedAt: number;\n}\n\n/** One revision as the viewer's tree panel sees it: metadata only, no scene. */\nexport interface RevisionNode {\n  id: string;\n  parent: string | null;\n  note?: string;\n  createdAt: number;\n}\n"]}