@orcareplay/core 0.1.0

package/dist/blobs.d.ts

@@ -0,0 +1,21 @@
+import type { BlobRef } from '@orcareplay/schema';
+/**
+ * Content-addressed blob store, laid out as `<dir>/<first two hex>/<full hex>` (spec §2.2).
+ *
+ * Every model turn resends the whole conversation, so identical content arrives over and over.
+ * Addressing by digest is what keeps a trace O(n) in new content instead of O(n²) in turns —
+ * hence `put` of existing content must not touch the file at all.
+ */
+export declare class BlobStore {
+    #private;
+    /** @param dir The blob root, conventionally `<runDir>/blobs`. */
+    constructor(dir: string);
+    get dir(): string;
+    put(data: Uint8Array | string, mediaType?: string): Promise<BlobRef>;
+    get(ref: BlobRef | string): Promise<Uint8Array>;
+    has(digest: BlobRef | string): Promise<boolean>;
+    count(): Promise<number>;
+}
+/** SHA-256 of a whole file, streamed — this is the integrity root of a run (spec §6). */
+export declare function sha256File(path: string): Promise<string>;
+//# sourceMappingURL=blobs.d.ts.map

package/dist/blobs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blobs.d.ts","sourceRoot":"","sources":["../src/blobs.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAqBlD;;;;;;GAMG;AACH,qBAAa,SAAS;;IAGpB,iEAAiE;gBACrD,GAAG,EAAE,MAAM;IAIvB,IAAI,GAAG,IAAI,MAAM,CAEhB;IAEK,GAAG,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAkBpE,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IAY/C,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAK/C,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;CAS/B;AAED,yFAAyF;AACzF,wBAAsB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAI9D"}

package/dist/blobs.js

@@ -0,0 +1,97 @@
+import { createHash, randomBytes } from 'node:crypto';
+import { createReadStream } from 'node:fs';
+import { mkdir, readFile, readdir, rename, stat, writeFile } from 'node:fs/promises';
+import { join } from 'node:path';
+/** Traces are sensitive material (design §7), so nothing is group- or world-readable. */
+const FILE_MODE = 0o600;
+const DIR_MODE = 0o700;
+const HEX64 = /^[0-9a-f]{64}$/;
+const PREFIX = 'sha256:';
+/** Accepts `sha256:<hex>` or a bare hex digest and returns the bare hex. */
+function bareDigest(ref) {
+    const raw = typeof ref === 'string' ? ref : ref.$blob;
+    const hex = raw.startsWith(PREFIX) ? raw.slice(PREFIX.length) : raw;
+    if (!HEX64.test(hex))
+        throw new Error(`invalid blob digest: ${JSON.stringify(raw)}`);
+    return hex;
+}
+function toBytes(data) {
+    return typeof data === 'string' ? new Uint8Array(Buffer.from(data, 'utf8')) : data;
+}
+/**
+ * Content-addressed blob store, laid out as `<dir>/<first two hex>/<full hex>` (spec §2.2).
+ *
+ * Every model turn resends the whole conversation, so identical content arrives over and over.
+ * Addressing by digest is what keeps a trace O(n) in new content instead of O(n²) in turns —
+ * hence `put` of existing content must not touch the file at all.
+ */
+export class BlobStore {
+    #dir;
+    /** @param dir The blob root, conventionally `<runDir>/blobs`. */
+    constructor(dir) {
+        this.#dir = dir;
+    }
+    get dir() {
+        return this.#dir;
+    }
+    async put(data, mediaType) {
+        const bytes = toBytes(data);
+        const hex = createHash('sha256').update(bytes).digest('hex');
+        const ref = { $blob: `${PREFIX}${hex}`, bytes: bytes.byteLength };
+        if (mediaType !== undefined)
+            ref.media_type = mediaType;
+        const shard = join(this.#dir, hex.slice(0, 2));
+        const path = join(shard, hex);
+        if (await exists(path))
+            return ref;
+        await mkdir(shard, { recursive: true, mode: DIR_MODE });
+        // Write then rename so a reader never sees a half-written blob under its final digest.
+        const tmp = `${path}.${randomBytes(6).toString('hex')}.tmp`;
+        await writeFile(tmp, bytes, { mode: FILE_MODE });
+        await rename(tmp, path);
+        return ref;
+    }
+    async get(ref) {
+        const hex = bareDigest(ref);
+        const path = join(this.#dir, hex.slice(0, 2), hex);
+        let buf;
+        try {
+            buf = await readFile(path);
+        }
+        catch {
+            throw new Error(`blob not found: ${PREFIX}${hex} (looked in ${path})`);
+        }
+        return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);
+    }
+    async has(digest) {
+        const hex = bareDigest(digest);
+        return exists(join(this.#dir, hex.slice(0, 2), hex));
+    }
+    async count() {
+        let n = 0;
+        for (const shard of await readdir(this.#dir, { withFileTypes: true }).catch(() => [])) {
+            if (!shard.isDirectory())
+                continue;
+            const files = await readdir(join(this.#dir, shard.name)).catch(() => []);
+            n += files.filter((f) => HEX64.test(f)).length;
+        }
+        return n;
+    }
+}
+/** SHA-256 of a whole file, streamed — this is the integrity root of a run (spec §6). */
+export async function sha256File(path) {
+    const hash = createHash('sha256');
+    for await (const chunk of createReadStream(path))
+        hash.update(chunk);
+    return hash.digest('hex');
+}
+async function exists(path) {
+    try {
+        await stat(path);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+//# sourceMappingURL=blobs.js.map

package/dist/blobs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blobs.js","sourceRoot":"","sources":["../src/blobs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACrF,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,yFAAyF;AACzF,MAAM,SAAS,GAAG,KAAK,CAAC;AACxB,MAAM,QAAQ,GAAG,KAAK,CAAC;AAEvB,MAAM,KAAK,GAAG,gBAAgB,CAAC;AAC/B,MAAM,MAAM,GAAG,SAAS,CAAC;AAEzB,4EAA4E;AAC5E,SAAS,UAAU,CAAC,GAAqB;IACvC,MAAM,GAAG,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IACtD,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACpE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,IAAyB;IACxC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACrF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,SAAS;IACX,IAAI,CAAS;IAEtB,iEAAiE;IACjE,YAAY,GAAW;QACrB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IAED,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,IAAyB,EAAE,SAAkB;QACrD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAY,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;QAC3E,IAAI,SAAS,KAAK,SAAS;YAAE,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC;QAExD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,MAAM,CAAC,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;QAEnC,MAAM,KAAK,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACxD,uFAAuF;QACvF,MAAM,GAAG,GAAG,GAAG,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5D,MAAM,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACjD,MAAM,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACxB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,GAAqB;QAC7B,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnD,IAAI,GAAW,CAAC;QAChB,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,GAAG,GAAG,eAAe,IAAI,GAAG,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;IACpE,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAwB;QAChC,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAC/B,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACtF,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE;gBAAE,SAAS;YACnC,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACzE,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACjD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED,yFAAyF;AACzF,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,IAAY;IAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAClC,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,gBAAgB,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,MAAM,CAAC,KAAe,CAAC,CAAC;IAC/E,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED,KAAK,UAAU,MAAM,CAAC,IAAY;IAChC,IAAI,CAAC;QACH,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC"}

package/dist/graph.d.ts

@@ -0,0 +1,106 @@
+import type { TraceEvent } from '@orcareplay/schema';
+/** A forkable point in a run. Derived from the log, never recorded (spec §3). */
+export interface Checkpoint {
+    seq: number;
+    turn: number;
+    /** Tree id from the governing `fs.snapshot`, when it recorded one. */
+    fsTree?: string;
+}
+export interface Turn {
+    turn: number;
+    startSeq: number;
+    endSeq: number;
+    events: TraceEvent[];
+}
+export interface SnapResult {
+    checkpoint: Checkpoint;
+    /** True when the target was not itself a checkpoint and had to move back. */
+    snapped: boolean;
+}
+/**
+ * Every seq that satisfies both checkpoint conditions of spec §3: an `fs.snapshot` at or before it
+ * in the same turn, and a complete conversation prefix.
+ */
+export declare function deriveCheckpoints(events: TraceEvent[]): Checkpoint[];
+/**
+ * The checkpoint a fork of `target` must actually start from — the nearest preceding one.
+ *
+ * Never rounds forward. Forking from state the run had not reached yet would produce a child run
+ * that silently disagrees with its parent, which is worse than refusing outright.
+ */
+export declare function snapToCheckpoint(cps: Checkpoint[], target: number): SnapResult;
+/** The events of a run grouped into model turns, in turn order. */
+export declare function turnsOf(events: TraceEvent[]): Turn[];
+/** The event at `seq` and everything transitively named by `causes`, oldest first. */
+export declare function causalChain(events: TraceEvent[], seq: number): TraceEvent[];
+/** Where an edge came from. The distinction is the whole honesty mechanism — see `runGraph`. */
+export type EdgeKind = 'recorded' | 'inferred';
+export interface GraphNode {
+    seq: number;
+    turn: number;
+    type: TraceEvent['type'];
+    attrs?: Record<string, unknown>;
+}
+export interface GraphEdge {
+    /** The cause. Always less than `to`, as spec §2.1 requires of `causes`. */
+    from: number;
+    to: number;
+    kind: EdgeKind;
+    /** Why this edge exists. For an inferred edge, the rule that produced it. */
+    rule: string;
+}
+export interface RunGraph {
+    nodes: GraphNode[];
+    edges: GraphEdge[];
+}
+/**
+ * A run as nodes and edges, with every edge saying whether the trace vouches for it.
+ *
+ * Two kinds, and they are not interchangeable. A `recorded` edge came out of `causes`, which the
+ * recorder wrote because it watched the relationship happen. An `inferred` edge was derived here,
+ * just now, by the named rule — a filesystem snapshot is taken once per turn rather than once per
+ * tool call, and shell frames are bucketed into turns by wall clock, so attributing an effect to a
+ * *particular* call is a guess however good the heuristic is.
+ *
+ * Inferred edges are therefore never written back to the trace. That is the same discipline spec
+ * §3 applies to checkpoints, which are derived and never recorded, and it exists so that a field
+ * a third-party reader trusts never contains something orca made up.
+ */
+export declare function runGraph(events: TraceEvent[]): RunGraph;
+/**
+ * The sub-graph that produced `seq`: that event and everything transitively behind it.
+ *
+ * `causalChain` walks `causes` alone and so stops at the first inferred hop, which in a real run
+ * is the hop from a tool call to the shell command it ran — exactly the one a person following a
+ * failure backwards needs. This walks the derived graph instead, so it crosses both kinds.
+ */
+export declare function chainTo(graph: RunGraph, seq: number): RunGraph;
+/**
+ * The event a card about this run should be about, or undefined when nothing stands out.
+ *
+ * Which chain to draw *is* the feature. A card gets screenshotted whether or not it happens to be
+ * the interesting one, so an arbitrary pick travels further than no card at all — hence a run with
+ * nothing notable returns undefined and the caller refuses rather than drawing something.
+ *
+ * The order is failure first, then the largest visible effect: a command that exited non-zero, a
+ * tool that reported an error, an error orca itself recorded, a replay divergence, and only then
+ * the last file the run changed. Within a kind the last one wins, since that is where the run
+ * ended up.
+ */
+export declare function pickChainTarget(events: TraceEvent[]): number | undefined;
+/** Tool calls that hand work to another agent, by the argument every harness gives them. */
+export declare function isDelegation(event: TraceEvent): boolean;
+/**
+ * The delegation whose span encloses `seq`, if any.
+ *
+ * A replay that halts inside one is the hardest kind of miss to read: the distance is small, the
+ * trace is intact, and nothing on the line says why the same run asked a different question. The
+ * answer is that the harness wrote the delegate's prompt itself and writes a fresh one every time,
+ * so that request genuinely was not the recorded one. Naming the delegation turns a number into
+ * that sentence.
+ */
+export declare function enclosingDelegation(events: TraceEvent[], seq: number): {
+    seq: number;
+    subagent: string;
+} | undefined;
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD,iFAAiF;AACjF,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,sEAAsE;IACtE,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,UAAU,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,UAAU,CAAC;IACvB,6EAA6E;IAC7E,OAAO,EAAE,OAAO,CAAC;CAClB;AAyBD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,UAAU,EAAE,CAmBpE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,UAAU,CAkB9E;AAED,mEAAmE;AACnE,wBAAgB,OAAO,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,IAAI,EAAE,CAepD;AAED,sFAAsF;AACtF,wBAAgB,WAAW,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,EAAE,CAsB3E;AAED,gGAAgG;AAChG,MAAM,MAAM,QAAQ,GAAG,UAAU,GAAG,UAAU,CAAC;AAE/C,MAAM,WAAW,SAAS;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACjC;AAED,MAAM,WAAW,SAAS;IACxB,2EAA2E;IAC3E,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,CAAC;IACf,6EAA6E;IAC7E,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;CACpB;AA6GD;;;;;;;;;;;;GAYG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,QAAQ,CAgDvD;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,QAAQ,CA8B9D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,GAAG,SAAS,CAiBxE;AAOD,4FAA4F;AAC5F,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAMvD;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,UAAU,EAAE,EACpB,GAAG,EAAE,MAAM,GACV;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,CAkB/C"}

package/dist/graph.js

@@ -0,0 +1,393 @@
+function bySeq(events) {
+    return [...events].sort((a, b) => a.seq - b.seq);
+}
+/**
+ * The seq of the first `model.request` with no reply, or Infinity when the conversation is whole.
+ *
+ * Requests and responses are paired in order, so a second request that is still in flight is not
+ * excused by the first one's reply. Everything after an unanswered request is un-forkable: the
+ * model's effect on the run is unknown there.
+ */
+function firstUnansweredRequest(events) {
+    const requests = events.filter((e) => e.type === 'model.request');
+    const responses = events.filter((e) => e.type === 'model.response');
+    for (let i = 0; i < requests.length; i++) {
+        const request = requests[i];
+        const response = responses[i];
+        if (!request)
+            continue;
+        if (!response || response.seq <= request.seq)
+            return request.seq;
+    }
+    return Number.POSITIVE_INFINITY;
+}
+/**
+ * Every seq that satisfies both checkpoint conditions of spec §3: an `fs.snapshot` at or before it
+ * in the same turn, and a complete conversation prefix.
+ */
+export function deriveCheckpoints(events) {
+    const ordered = bySeq(events);
+    const cutoff = firstUnansweredRequest(ordered);
+    const checkpoints = [];
+    let snapshot;
+    for (const e of ordered) {
+        if (e.seq > cutoff)
+            break;
+        if (e.type === 'fs.snapshot') {
+            const tree = e.attrs?.['tree'];
+            snapshot = { turn: e.turn, tree: typeof tree === 'string' ? tree : undefined };
+        }
+        // A snapshot only vouches for the state of its own turn; work in a later turn has moved on.
+        if (!snapshot || snapshot.turn !== e.turn)
+            continue;
+        const checkpoint = { seq: e.seq, turn: e.turn };
+        if (snapshot.tree !== undefined)
+            checkpoint.fsTree = snapshot.tree;
+        checkpoints.push(checkpoint);
+    }
+    return checkpoints;
+}
+/**
+ * The checkpoint a fork of `target` must actually start from — the nearest preceding one.
+ *
+ * Never rounds forward. Forking from state the run had not reached yet would produce a child run
+ * that silently disagrees with its parent, which is worse than refusing outright.
+ */
+export function snapToCheckpoint(cps, target) {
+    const ordered = [...cps].sort((a, b) => a.seq - b.seq);
+    if (ordered.length === 0) {
+        throw new Error(`cannot fork at seq ${target}: this run has no checkpoints — it recorded no fs.snapshot`);
+    }
+    let found;
+    for (const cp of ordered) {
+        if (cp.seq > target)
+            break;
+        found = cp;
+    }
+    if (!found) {
+        throw new Error(`no checkpoint at or before ${target}: the earliest forkable seq is ${ordered[0]?.seq}`);
+    }
+    return { checkpoint: found, snapped: found.seq !== target };
+}
+/** The events of a run grouped into model turns, in turn order. */
+export function turnsOf(events) {
+    const byTurn = new Map();
+    for (const e of bySeq(events)) {
+        const bucket = byTurn.get(e.turn);
+        if (bucket)
+            bucket.push(e);
+        else
+            byTurn.set(e.turn, [e]);
+    }
+    return [...byTurn.entries()]
+        .sort((a, b) => a[0] - b[0])
+        .map(([turn, group]) => ({
+        turn,
+        startSeq: group[0]?.seq ?? 0,
+        endSeq: group[group.length - 1]?.seq ?? 0,
+        events: group,
+    }));
+}
+/** The event at `seq` and everything transitively named by `causes`, oldest first. */
+export function causalChain(events, seq) {
+    const index = new Map(events.map((e) => [e.seq, e]));
+    const start = index.get(seq);
+    if (!start)
+        throw new Error(`no event with seq ${seq} in this trace`);
+    const seen = new Set([seq]);
+    const queue = [start];
+    const chain = [];
+    while (queue.length > 0) {
+        const event = queue.shift();
+        if (!event)
+            break;
+        chain.push(event);
+        for (const cause of event.causes ?? []) {
+            // A cycle is malformed, and an ancestor may be missing because the reader skipped an
+            // unknown event type. Neither may stop the walk.
+            if (seen.has(cause))
+                continue;
+            seen.add(cause);
+            const parent = index.get(cause);
+            if (parent)
+                queue.push(parent);
+        }
+    }
+    return chain.sort((a, b) => a.seq - b.seq);
+}
+/**
+ * What a recorded pair means, when the pair is one orca itself writes.
+ *
+ * `causes` says *that* one event caused another and never *why*, so this is a post-hoc reading of
+ * the type pair rather than anything the trace claims. An unrecognised pair says `causes` and
+ * stops there, which is the honest answer for an edge written by a reader we do not know.
+ */
+const RECORDED_RULES = {
+    'tool.call→tool.result': 'tool result answers its call',
+    'shell.exec→shell.result': 'shell result answers its exec',
+    'net.request→net.response': 'network response answers its request',
+    'model.response→tool.call': 'tool_use block in the response',
+    'tool.result→model.request': 'tool_result block in the request',
+};
+const ARGV_RULE = 'argv matches tool input, same or previous turn';
+const PATH_RULE = 'changed path appears in tool input, same or previous turn';
+/**
+ * How many turns back an effect may reach for the call that caused it.
+ *
+ * One, not zero. A snapshot is taken when the turn's exchange is persisted, which races the agent
+ * actually running the tool — an end-to-end recording produced the edit in the turn's own snapshot
+ * on one run and in the next turn's on another. A same-turn rule therefore made the graph differ
+ * between two identical runs. Not more than one either: an effect two turns later would have been
+ * reported by the snapshot in between.
+ */
+const TURN_REACH = 1;
+/** The longest string in an argv array — in practice the command, not the shell that ran it. */
+function commandOf(argv) {
+    if (!Array.isArray(argv))
+        return '';
+    let longest = '';
+    for (const part of argv) {
+        if (typeof part === 'string' && part.length > longest.length)
+            longest = part;
+    }
+    return longest;
+}
+function inputText(call) {
+    const input = (call.attrs ?? {})['input'];
+    if (input === undefined)
+        return '';
+    try {
+        return typeof input === 'string' ? input : (JSON.stringify(input) ?? '');
+    }
+    catch {
+        return '';
+    }
+}
+/**
+ * The one tool call that can be said to have caused `effect`, or undefined when that is not
+ * exactly one call.
+ *
+ * Candidates are calls whose input names `needle`, that happened first, and that are within
+ * `TURN_REACH` turns. Of those, only the nearest turn is considered: a later call supersedes an
+ * earlier one, since a file edited twice was last edited by the most recent call to name it.
+ *
+ * Two calls in that nearest turn is the case worth dwelling on. Picking either would produce an
+ * edge indistinguishable from a true one and wrong half the time, and a wrong edge is worse than
+ * a missing one because the missing one is visible. So ambiguity yields nothing.
+ */
+function soleMatchingCall(calls, effect, needle) {
+    if (needle === '')
+        return undefined;
+    const candidates = calls.filter((call) => call.seq < effect.seq &&
+        effect.turn - call.turn >= 0 &&
+        effect.turn - call.turn <= TURN_REACH &&
+        inputText(call).includes(needle));
+    if (candidates.length === 0)
+        return undefined;
+    const nearest = Math.max(...candidates.map((c) => c.turn));
+    const inNearest = candidates.filter((c) => c.turn === nearest);
+    return inNearest.length === 1 ? inNearest[0] : undefined;
+}
+/**
+ * The longest string a graph node carries. A graph is about structure, not payloads.
+ *
+ * `orca_graph` answers an agent, and the answer lands in its context — so a `tool.call` whose
+ * `input` holds a whole file body would spend that context on something the graph never uses. The
+ * shape survives so a label can still read `input.path`; the bulk does not. `orca events` is one
+ * command away when the full value is what you want.
+ */
+const ATTR_MAX = 200;
+function clampValue(value, depth = 0) {
+    if (typeof value === 'string') {
+        return value.length <= ATTR_MAX ? value : `${value.slice(0, ATTR_MAX)}…`;
+    }
+    if (depth >= 4 || value === null || typeof value !== 'object')
+        return value;
+    if (Array.isArray(value))
+        return value.slice(0, 20).map((v) => clampValue(v, depth + 1));
+    const out = {};
+    for (const [key, v] of Object.entries(value)) {
+        out[key] = clampValue(v, depth + 1);
+    }
+    return out;
+}
+function clampAttrs(attrs) {
+    return clampValue(attrs);
+}
+/**
+ * A run as nodes and edges, with every edge saying whether the trace vouches for it.
+ *
+ * Two kinds, and they are not interchangeable. A `recorded` edge came out of `causes`, which the
+ * recorder wrote because it watched the relationship happen. An `inferred` edge was derived here,
+ * just now, by the named rule — a filesystem snapshot is taken once per turn rather than once per
+ * tool call, and shell frames are bucketed into turns by wall clock, so attributing an effect to a
+ * *particular* call is a guess however good the heuristic is.
+ *
+ * Inferred edges are therefore never written back to the trace. That is the same discipline spec
+ * §3 applies to checkpoints, which are derived and never recorded, and it exists so that a field
+ * a third-party reader trusts never contains something orca made up.
+ */
+export function runGraph(events) {
+    const ordered = bySeq(events);
+    const present = new Set(ordered.map((e) => e.seq));
+    const nodes = ordered.map((e) => ({
+        seq: e.seq,
+        turn: e.turn,
+        type: e.type,
+        ...(e.attrs === undefined ? {} : { attrs: clampAttrs(e.attrs) }),
+    }));
+    const byType = new Map(ordered.map((e) => [e.seq, e.type]));
+    const edges = [];
+    for (const event of ordered) {
+        for (const cause of event.causes ?? []) {
+            // A reader may have dropped an event type it did not know (spec §2.3), so an edge can name
+            // an ancestor that is not here. Naming a node that does not exist is worse than no edge.
+            if (!present.has(cause))
+                continue;
+            const pair = `${byType.get(cause)}→${event.type}`;
+            edges.push({
+                from: cause,
+                to: event.seq,
+                kind: 'recorded',
+                rule: RECORDED_RULES[pair] ?? 'causes',
+            });
+        }
+    }
+    const calls = ordered.filter((e) => e.type === 'tool.call');
+    if (calls.length > 0) {
+        for (const event of ordered) {
+            const attrs = event.attrs ?? {};
+            let match;
+            let rule = '';
+            if (event.type === 'shell.exec') {
+                match = soleMatchingCall(calls, event, commandOf(attrs['argv']));
+                rule = ARGV_RULE;
+            }
+            else if (event.type === 'fs.change') {
+                const path = attrs['path'];
+                match = soleMatchingCall(calls, event, typeof path === 'string' ? path : '');
+                rule = PATH_RULE;
+            }
+            if (match)
+                edges.push({ from: match.seq, to: event.seq, kind: 'inferred', rule });
+        }
+    }
+    edges.sort((a, b) => a.to - b.to || a.from - b.from);
+    return { nodes, edges };
+}
+/**
+ * The sub-graph that produced `seq`: that event and everything transitively behind it.
+ *
+ * `causalChain` walks `causes` alone and so stops at the first inferred hop, which in a real run
+ * is the hop from a tool call to the shell command it ran — exactly the one a person following a
+ * failure backwards needs. This walks the derived graph instead, so it crosses both kinds.
+ */
+export function chainTo(graph, seq) {
+    if (!graph.nodes.some((n) => n.seq === seq)) {
+        throw new Error(`no event with seq ${seq} in this graph`);
+    }
+    const incoming = new Map();
+    for (const edge of graph.edges) {
+        const bucket = incoming.get(edge.to);
+        if (bucket)
+            bucket.push(edge);
+        else
+            incoming.set(edge.to, [edge]);
+    }
+    const kept = new Set([seq]);
+    const edges = [];
+    const queue = [seq];
+    while (queue.length > 0) {
+        const at = queue.shift();
+        if (at === undefined)
+            break;
+        for (const edge of incoming.get(at) ?? []) {
+            edges.push(edge);
+            // A cycle is malformed rather than impossible, and it must not hang the walk.
+            if (kept.has(edge.from))
+                continue;
+            kept.add(edge.from);
+            queue.push(edge.from);
+        }
+    }
+    return {
+        nodes: graph.nodes.filter((n) => kept.has(n.seq)),
+        edges: edges.sort((a, b) => a.to - b.to || a.from - b.from),
+    };
+}
+/**
+ * The event a card about this run should be about, or undefined when nothing stands out.
+ *
+ * Which chain to draw *is* the feature. A card gets screenshotted whether or not it happens to be
+ * the interesting one, so an arbitrary pick travels further than no card at all — hence a run with
+ * nothing notable returns undefined and the caller refuses rather than drawing something.
+ *
+ * The order is failure first, then the largest visible effect: a command that exited non-zero, a
+ * tool that reported an error, an error orca itself recorded, a replay divergence, and only then
+ * the last file the run changed. Within a kind the last one wins, since that is where the run
+ * ended up.
+ */
+export function pickChainTarget(events) {
+    const ordered = bySeq(events);
+    const last = (match) => {
+        for (let i = ordered.length - 1; i >= 0; i--) {
+            const event = ordered[i];
+            if (event && match(event))
+                return event.seq;
+        }
+        return undefined;
+    };
+    return (last((e) => e.type === 'shell.result' && (e.attrs?.['exit_code'] ?? 0) !== 0) ??
+        last((e) => e.type === 'tool.result' && e.attrs?.['is_error'] === true) ??
+        last((e) => e.type === 'error') ??
+        last((e) => e.type === 'divergence') ??
+        last((e) => e.type === 'fs.change'));
+}
+/** Attributes as a plain record, since the envelope leaves them optional. */
+function toAttrs(event) {
+    return event.attrs ?? {};
+}
+/** Tool calls that hand work to another agent, by the argument every harness gives them. */
+export function isDelegation(event) {
+    if (event.type !== 'tool.call')
+        return false;
+    const input = toAttrs(event)['input'];
+    if (input === null || typeof input !== 'object')
+        return false;
+    const shape = input;
+    return typeof shape['subagent_type'] === 'string' || typeof shape['agent'] === 'string';
+}
+/**
+ * The delegation whose span encloses `seq`, if any.
+ *
+ * A replay that halts inside one is the hardest kind of miss to read: the distance is small, the
+ * trace is intact, and nothing on the line says why the same run asked a different question. The
+ * answer is that the harness wrote the delegate's prompt itself and writes a fresh one every time,
+ * so that request genuinely was not the recorded one. Naming the delegation turns a number into
+ * that sentence.
+ */
+export function enclosingDelegation(events, seq) {
+    const closesAt = new Map();
+    for (const event of events) {
+        if (event.type !== 'tool.result')
+            continue;
+        for (const cause of event.causes ?? [])
+            closesAt.set(cause, event.seq);
+    }
+    let found;
+    for (const event of events) {
+        if (event.seq > seq)
+            break;
+        if (!isDelegation(event))
+            continue;
+        const closes = closesAt.get(event.seq);
+        // Still open at `seq`: an unclosed delegation ran to the end of the trace.
+        if (closes !== undefined && closes < seq)
+            continue;
+        const input = toAttrs(event)['input'];
+        const subagent = String(input?.['subagent_type'] ?? input?.['agent'] ?? 'sub-agent');
+        found = { seq: event.seq, subagent };
+    }
+    return found;
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAuBA,SAAS,KAAK,CAAC,MAAoB;IACjC,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;GAMG;AACH,SAAS,sBAAsB,CAAC,MAAoB;IAClD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC;IAClE,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG;YAAE,OAAO,OAAO,CAAC,GAAG,CAAC;IACnE,CAAC;IACD,OAAO,MAAM,CAAC,iBAAiB,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAoB;IACpD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;IAC/C,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,IAAI,QAAgE,CAAC;IAErE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,GAAG,GAAG,MAAM;YAAE,MAAM;QAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC;YAC/B,QAAQ,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACjF,CAAC;QACD,4FAA4F;QAC5F,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;YAAE,SAAS;QACpD,MAAM,UAAU,GAAe,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5D,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS;YAAE,UAAU,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;QACnE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAiB,EAAE,MAAc;IAChE,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CACb,sBAAsB,MAAM,4DAA4D,CACzF,CAAC;IACJ,CAAC;IACD,IAAI,KAA6B,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,EAAE,CAAC,GAAG,GAAG,MAAM;YAAE,MAAM;QAC3B,KAAK,GAAG,EAAE,CAAC;IACb,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CACb,8BAA8B,MAAM,kCAAkC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CACxF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,KAAK,MAAM,EAAE,CAAC;AAC9D,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,OAAO,CAAC,MAAoB;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;SACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACvB,IAAI;QACJ,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;QAC5B,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC;QACzC,MAAM,EAAE,KAAK;KACd,CAAC,CAAC,CAAC;AACR,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,WAAW,CAAC,MAAoB,EAAE,GAAW;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,gBAAgB,CAAC,CAAC;IAEtE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK;YAAE,MAAM;QAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YACvC,qFAAqF;YACrF,iDAAiD;YACjD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAC9B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAChB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,MAAM;gBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7C,CAAC;AA0BD;;;;;;GAMG;AACH,MAAM,cAAc,GAA2B;IAC7C,uBAAuB,EAAE,8BAA8B;IACvD,yBAAyB,EAAE,+BAA+B;IAC1D,0BAA0B,EAAE,sCAAsC;IAClE,0BAA0B,EAAE,gCAAgC;IAC5D,2BAA2B,EAAE,kCAAkC;CAChE,CAAC;AAEF,MAAM,SAAS,GAAG,gDAAgD,CAAC;AACnE,MAAM,SAAS,GAAG,2DAA2D,CAAC;AAE9E;;;;;;;;GAQG;AACH,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB,gGAAgG;AAChG,SAAS,SAAS,CAAC,IAAa;IAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM;YAAE,OAAO,GAAG,IAAI,CAAC;IAC/E,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,SAAS,CAAC,IAAgB;IACjC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IAC1C,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,CAAC;QACH,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,gBAAgB,CACvB,KAAmB,EACnB,MAAkB,EAClB,MAAc;IAEd,IAAI,MAAM,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IACpC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAC7B,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG;QACrB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC;QAC5B,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,UAAU;QACrC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CACnC,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IAC/D,OAAO,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC3D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAG,GAAG,CAAC;AAErB,SAAS,UAAU,CAAC,KAAc,EAAE,KAAK,GAAG,CAAC;IAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,KAAK,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC;IAC3E,CAAC;IACD,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IACzF,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC,EAAE,CAAC;QACxE,GAAG,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,UAAU,CAAC,KAA8B;IAChD,OAAO,UAAU,CAAC,KAAK,CAA4B,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,QAAQ,CAAC,MAAoB;IAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAgB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7C,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;KACjE,CAAC,CAAC,CAAC;IAEJ,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YACvC,2FAA2F;YAC3F,yFAAyF;YACzF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAClC,MAAM,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAClD,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,KAAK;gBACX,EAAE,EAAE,KAAK,CAAC,GAAG;gBACb,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,IAAI,QAAQ;aACvC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;IAC5D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,KAA6B,CAAC;YAClC,IAAI,IAAI,GAAG,EAAE,CAAC;YACd,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAChC,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjE,IAAI,GAAG,SAAS,CAAC;YACnB,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC3B,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC7E,IAAI,GAAG,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAe,EAAE,GAAW;IAClD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,gBAAgB,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IACpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM;QAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,8EAA8E;YAC9E,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YAClC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;KAC5D,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,MAAoB;IAClD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,KAAiC,EAAsB,EAAE;QACrE,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC,GAAG,CAAC;QAC9C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,OAAO,CACL,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7E,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC;QACvE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC;QAC/B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;QACpC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CACpC,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,SAAS,OAAO,CAAC,KAAiB;IAChC,OAAO,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,KAAK,CAAC;IAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC;IACtC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,KAAK,GAAG,KAAgC,CAAC;IAC/C,OAAO,OAAO,KAAK,CAAC,eAAe,CAAC,KAAK,QAAQ,IAAI,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC1F,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAoB,EACpB,GAAW;IAEX,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa;YAAE,SAAS;QAC3C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE;YAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,KAAoD,CAAC;IACzD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,GAAG,GAAG,GAAG;YAAE,MAAM;QAC3B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAAE,SAAS;QACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvC,2EAA2E;QAC3E,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,GAAG,GAAG;YAAE,SAAS;QACnD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,CAAwC,CAAC;QAC7E,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,eAAe,CAAC,IAAI,KAAK,EAAE,CAAC,OAAO,CAAC,IAAI,WAAW,CAAC,CAAC;QACrF,KAAK,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}