@toon-protocol/rig 4.2.0 → 4.3.0

package/dist/chunk-TJPIE5X4.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/objects.ts","../src/repo-reader.ts","../src/object-fetch.ts","../src/read-pipeline.ts","../src/materialize.ts","../src/npub.ts","../src/routes.ts","../src/push.ts"],"sourcesContent":["/**\n * Pure git object construction and SHA-1 envelope hashing.\n *\n * Promoted from `packages/rig-web/tests/e2e/seed/lib/git-builder.ts` (#223) —\n * the proven seed pipeline builders, now the core of the Git-to-TOON write\n * path. Everything here is pure: no network, no signing, no payments.\n * Upload/publish lives with the Publisher (#226).\n *\n * Git object format: `<type> <size>\\0<content>`. The SHA-1 is computed over\n * the full envelope (header + NUL + content); the `body` (content only) is\n * what gets uploaded to Arweave.\n */\n\nimport { createHash } from 'node:crypto';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** All git object types TOON can carry. */\nexport type GitObjectType = 'blob' | 'tree' | 'commit' | 'tag';\n\nexport interface GitObject {\n  /** SHA-1 hex digest computed over full git envelope */\n  sha: string;\n  /** Full git object (header + null + content) */\n  buffer: Buffer;\n  /** Body only (content after the null byte) — this is what gets uploaded */\n  body: Buffer;\n}\n\n/**\n * The storage upstream's FREE per-item ceiling, in bytes.\n *\n * Read live from `https://upload.ardrive.io/`, which publishes it twice and\n * agreeing (2026-09-06):\n *\n *     { \"freeUploadLimitBytes\": 107520,\n *       \"freeTier\": { \"maxItemBytes\": 107520, ... } }\n *\n * The old value was `95 * 1024` (97,280) described as a \"95KB safety margin\n * under the 100KB free tier\". The service publishes no 100KB limit — the\n * figure was never upstream's — so the margin refused ~10 KiB of objects the\n * upstream would have taken for free (#102).\n *\n * This is a PRICING boundary, not a cap. An object at or under it rides the\n * free tier; a larger one is uploaded and PAID FOR through the store route's\n * per-KiB schedule (ADR 0065) — `g.toon.relay.store` advertises\n * `{price: \"1001\", pricePerKib: \"10\"}`, and that per-KiB term exists precisely\n * because size costs the serving node money. Nothing rejects on size.\n */\nexport const FREE_TIER_MAX_ITEM_BYTES = 107_520;\n\n/**\n * @deprecated Renamed to {@link FREE_TIER_MAX_ITEM_BYTES}, and no longer a\n * maximum: objects above it upload as paid writes rather than erroring. Kept\n * as an alias so the 4.x export keeps resolving.\n */\nexport const MAX_OBJECT_SIZE = FREE_TIER_MAX_ITEM_BYTES;\n\n/**\n * Git's universal empty-blob SHA-1: the object for a zero-byte file.\n *\n * It is the ONLY zero-byte object git can produce (trees, commits, and tags\n * are never empty) and it always has this exact constant value. The store\n * rejects a zero-byte kind:5094 blob upload as malformed (F00), so `rig` never\n * uploads this object — it is skipped on push and synthesized locally on\n * clone/fetch (both keyed off an ACTUAL zero-length body, never a heuristic).\n */\nexport const EMPTY_BLOB_SHA = 'e69de29bb2d1d6434b8b29ae775ad8c2e48c5391';\n\n// ---------------------------------------------------------------------------\n// Envelope hashing\n// ---------------------------------------------------------------------------\n\n/**\n * Wrap a raw object body in the git envelope (`<type> <size>\\0`) and compute\n * its SHA-1. This is exactly what `git hash-object -t <type>` does.\n */\nexport function hashGitObject(type: GitObjectType, body: Buffer): GitObject {\n  const header = Buffer.from(`${type} ${body.length}\\0`);\n  const fullObject = Buffer.concat([header, body]);\n  const sha = createHash('sha1').update(fullObject).digest('hex');\n  return { sha, buffer: fullObject, body };\n}\n\n// ---------------------------------------------------------------------------\n// Git object construction\n// ---------------------------------------------------------------------------\n\n/**\n * Construct a git blob object and compute its SHA-1.\n *\n * Format: blob <size>\\0<content>\n * SHA is over the full envelope; body is content only (for upload).\n */\nexport function createGitBlob(content: string): GitObject {\n  return hashGitObject('blob', Buffer.from(content, 'utf-8'));\n}\n\n/**\n * Construct a git tree object from sorted entries.\n *\n * Format: tree <size>\\0<entries>\n * Each entry: <mode> <name>\\0<20-byte-raw-sha1>\n * Entries MUST be sorted by name (byte-wise).\n */\nexport function createGitTree(\n  entries: { mode: string; name: string; sha: string }[]\n): GitObject {\n  // Git sorts tree entries by raw byte order (NOT locale-aware)\n  const sorted = [...entries].sort((a, b) =>\n    a.name < b.name ? -1 : a.name > b.name ? 1 : 0\n  );\n\n  const entryBuffers: Buffer[] = [];\n  for (const entry of sorted) {\n    const modeAndName = Buffer.from(`${entry.mode} ${entry.name}\\0`);\n    // Raw 20-byte SHA-1 (NOT hex)\n    const rawSha = Buffer.from(entry.sha, 'hex');\n    entryBuffers.push(Buffer.concat([modeAndName, rawSha]));\n  }\n\n  return hashGitObject('tree', Buffer.concat(entryBuffers));\n}\n\n/**\n * Construct a git commit object.\n *\n * Format: commit <size>\\0tree <tree-sha>\\n[parent ...]\\nauthor ...\\ncommitter ...\\n\\n<message>\n * Tree/parent SHAs are hex-encoded (40 chars) in commits, unlike tree entries.\n */\nexport function createGitCommit(opts: {\n  treeSha: string;\n  parentSha?: string;\n  authorName: string;\n  authorPubkey: string;\n  message: string;\n  timestamp: number;\n}): GitObject {\n  const lines = [\n    `tree ${opts.treeSha}`,\n    ...(opts.parentSha ? [`parent ${opts.parentSha}`] : []),\n    `author ${opts.authorName} <${opts.authorPubkey}@nostr> ${opts.timestamp} +0000`,\n    `committer ${opts.authorName} <${opts.authorPubkey}@nostr> ${opts.timestamp} +0000`,\n    '',\n    opts.message,\n  ];\n  return hashGitObject('commit', Buffer.from(lines.join('\\n'), 'utf-8'));\n}\n\n/**\n * Construct an annotated git tag object.\n *\n * Format: tag <size>\\0object <sha>\\ntype <type>\\ntag <name>\\ntagger ...\\n\\n<message>\n * The tagged object is usually a commit, but git allows tagging any object\n * type (including another tag).\n */\nexport function createGitTag(opts: {\n  /** SHA-1 of the object being tagged (hex, 40 chars) */\n  objectSha: string;\n  /** Type of the tagged object (usually 'commit') */\n  objectType: GitObjectType;\n  /** Tag name, e.g. 'v1.0.0' */\n  tagName: string;\n  taggerName: string;\n  taggerPubkey: string;\n  message: string;\n  timestamp: number;\n}): GitObject {\n  const lines = [\n    `object ${opts.objectSha}`,\n    `type ${opts.objectType}`,\n    `tag ${opts.tagName}`,\n    `tagger ${opts.taggerName} <${opts.taggerPubkey}@nostr> ${opts.timestamp} +0000`,\n    '',\n    opts.message,\n  ];\n  return hashGitObject('tag', Buffer.from(lines.join('\\n'), 'utf-8'));\n}\n","/**\n * GitRepoReader — read a local repository via `execFile` git plumbing.\n *\n * Real git gives perfect fidelity (packfiles, delta chains, exotic history)\n * with zero new deps — no isomorphic-git. Everything here is read-only and\n * injection-safe:\n *\n *  - child processes are spawned with `execFile`/`spawn` and argument\n *    ARRAYS — never a shell, never string interpolation;\n *  - every caller-supplied revision/range is validated against strict\n *    regexes that (among other things) reject a leading `-`, so a value\n *    like `--upload-pack=…` can never be parsed as an option;\n *  - `--` terminators are appended where git supports them so nothing\n *    user-supplied can be re-interpreted as a pathspec.\n *\n * Push planning/publishing live in follow-up tickets of epic\n * toon-client#222 — this module only reads.\n */\n\nimport { execFile, spawn } from 'node:child_process';\nimport { promisify } from 'node:util';\nimport type { GitObjectType } from './objects.js';\n\nconst execFileAsync = promisify(execFile);\n\n/** Generous cap for plumbing stdout (rev-list on big repos, format-patch). */\nconst MAX_BUFFER = 256 * 1024 * 1024;\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** A single ref from `git for-each-ref` (branches + tags). */\nexport interface GitRef {\n  /** Full refname, e.g. `refs/heads/main` or `refs/tags/v1.0.0`. */\n  refname: string;\n  /**\n   * SHA the ref points at. For annotated tags this is the TAG object's SHA\n   * (the peeled commit is in {@link peeledSha}); for branches and\n   * lightweight tags it is the commit SHA.\n   */\n  sha: string;\n  /** Type of the referenced object: `commit`, or `tag` for annotated tags. */\n  type: GitObjectType;\n  /** For annotated tags: the peeled (target) object SHA. */\n  peeledSha?: string;\n}\n\n/** Result of {@link GitRepoReader.listRefs}. */\nexport interface RepoRefs {\n  /**\n   * Full refname HEAD points at (e.g. `refs/heads/main`), or `undefined`\n   * when HEAD is detached.\n   */\n  head?: string;\n  refs: GitRef[];\n}\n\n/** One object streamed out of `git cat-file --batch`. */\nexport interface ReadGitObject {\n  /** Full 40-hex SHA-1. */\n  sha: string;\n  type: GitObjectType;\n  /** Raw object body (content only, no envelope header). May be binary. */\n  body: Buffer;\n}\n\n/** Result of {@link GitRepoReader.readObjects}. */\nexport interface ReadObjectsResult {\n  /** Objects found, in input order (minus missing ones). */\n  objects: ReadGitObject[];\n  /** Requested SHAs not present in the repository. */\n  missing: string[];\n}\n\n/** One object from `rev-list --objects`: SHA plus the path it was reached by. */\nexport interface ObjectWithPath {\n  /** Full 40-hex SHA-1. */\n  sha: string;\n  /**\n   * Path the object was first reached by (blobs and non-root trees);\n   * `undefined` for commits, root trees, and tag objects.\n   */\n  path?: string;\n}\n\n/** One object's metadata from `cat-file --batch-check`. */\nexport interface ObjectStat {\n  sha: string;\n  type: GitObjectType;\n  /** Object body size in bytes (content only, no envelope header). */\n  size: number;\n}\n\n/** Result of {@link GitRepoReader.statObjects}. */\nexport interface StatObjectsResult {\n  /** Stats found, in input order (minus missing ones). */\n  objects: ObjectStat[];\n  /** Requested SHAs not present in the repository. */\n  missing: string[];\n}\n\n/** Error from a git child process, carrying exit code and stderr. */\nexport class GitError extends Error {\n  constructor(\n    message: string,\n    /** Process exit code (undefined when the process failed to spawn). */\n    public readonly exitCode: number | undefined,\n    /** Captured stderr, trimmed. */\n    public readonly stderr: string\n  ) {\n    super(message);\n    this.name = 'GitError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Argument validation (injection defense)\n// ---------------------------------------------------------------------------\n\n/** Full 40-hex SHA-1. */\nconst FULL_SHA_RE = /^[0-9a-f]{40}$/;\n\n/**\n * One revision token: a SHA prefix (4–40 hex) or a refname-ish word with an\n * optional `^`/`~<n>` ancestry suffix. Must start with an alphanumeric, so a\n * leading `-` (option injection) is impossible; `@{…}`, whitespace, and other\n * revspec exotica are deliberately rejected.\n */\nconst REV_TOKEN_RE = /^[A-Za-z0-9][A-Za-z0-9._/-]*(?:[~^][0-9]*)*$/;\n\nfunction isValidRevision(rev: string): boolean {\n  if (rev.length === 0 || rev.length > 1024) return false;\n  if (!REV_TOKEN_RE.test(rev)) return false;\n  // Refname rules git enforces that our charset alone doesn't:\n  if (rev.includes('..')) return false; // range separator / invalid in refnames\n  if (rev.endsWith('.lock') || rev.endsWith('/') || rev.endsWith('.')) return false;\n  return true;\n}\n\nfunction assertRevision(rev: string, what: string): void {\n  if (!isValidRevision(rev)) {\n    throw new Error(\n      `${what} is not a valid git revision (got ${JSON.stringify(rev)}); ` +\n        'expected a SHA or simple refname — options/ranges are rejected'\n    );\n  }\n}\n\nfunction assertFullSha(sha: string, what: string): void {\n  if (!FULL_SHA_RE.test(sha)) {\n    throw new Error(\n      `${what} is not a full 40-hex SHA-1 (got ${JSON.stringify(sha)})`\n    );\n  }\n}\n\n/**\n * A revision range for format-patch: `<rev>`, `<rev>..<rev>`, or\n * `<rev>...<rev>` where each side passes {@link isValidRevision}.\n */\nfunction assertRange(range: string, what: string): void {\n  const parts = range.split(/\\.{2,3}/);\n  const separators = range.match(/\\.{2,3}/g) ?? [];\n  const ok =\n    parts.length <= 2 &&\n    separators.length === parts.length - 1 &&\n    parts.every((p) => isValidRevision(p));\n  if (!ok) {\n    throw new Error(\n      `${what} is not a valid revision range (got ${JSON.stringify(range)}); ` +\n        'expected <rev>, <rev>..<rev>, or <rev>...<rev>'\n    );\n  }\n}\n\n// ---------------------------------------------------------------------------\n// cat-file --batch incremental parser\n// ---------------------------------------------------------------------------\n\nconst OBJECT_TYPES: ReadonlySet<string> = new Set(['blob', 'tree', 'commit', 'tag']);\n\n/**\n * Incremental parser for `git cat-file --batch` output:\n * `<sha> <type> <size>\\n<body>\\n` per found object, `<name> missing\\n` for\n * absent ones. Bodies are raw bytes (possibly binary) and may be split\n * across arbitrary chunk boundaries, so parsing is strictly size-driven.\n */\nclass BatchParser {\n  private buf: Buffer = Buffer.alloc(0);\n  private pending: { sha: string; type: GitObjectType; size: number } | null = null;\n\n  readonly objects: ReadGitObject[] = [];\n  readonly missing: string[] = [];\n\n  push(chunk: Buffer): void {\n    this.buf = this.buf.length === 0 ? chunk : Buffer.concat([this.buf, chunk]);\n    this.drain();\n  }\n\n  /** True when no partially-parsed record remains. */\n  isComplete(): boolean {\n    return this.pending === null && this.buf.length === 0;\n  }\n\n  private drain(): void {\n    for (;;) {\n      if (this.pending) {\n        // Need body + trailing LF before the record is complete.\n        const needed = this.pending.size + 1;\n        if (this.buf.length < needed) return;\n        const body = Buffer.from(this.buf.subarray(0, this.pending.size));\n        this.objects.push({ sha: this.pending.sha, type: this.pending.type, body });\n        this.buf = this.buf.subarray(needed);\n        this.pending = null;\n        continue;\n      }\n\n      const nl = this.buf.indexOf(0x0a);\n      if (nl === -1) return;\n      const header = this.buf.subarray(0, nl).toString('utf-8');\n      this.buf = this.buf.subarray(nl + 1);\n\n      const [name, second, third] = header.split(' ');\n      if (name && second === 'missing' && third === undefined) {\n        this.missing.push(name);\n        continue;\n      }\n      if (name && second && third !== undefined && OBJECT_TYPES.has(second)) {\n        const size = Number.parseInt(third, 10);\n        if (Number.isSafeInteger(size) && size >= 0) {\n          this.pending = { sha: name, type: second as GitObjectType, size };\n          continue;\n        }\n      }\n      throw new GitError(\n        `unexpected cat-file --batch header: ${JSON.stringify(header)}`,\n        undefined,\n        ''\n      );\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// GitRepoReader\n// ---------------------------------------------------------------------------\n\n/**\n * Read-only view of a local git repository via git plumbing commands.\n *\n * All methods throw {@link GitError} when the underlying git process fails\n * unexpectedly, and plain `Error` when a caller-supplied argument fails\n * validation (before any process is spawned).\n */\nexport class GitRepoReader {\n  constructor(\n    /** Absolute or relative path to the repository worktree (or .git dir). */\n    public readonly repoPath: string\n  ) {}\n\n  /** Run git with argument-array safety; resolves stdout as UTF-8. */\n  private async git(\n    args: string[],\n    opts: { allowExitCodes?: number[] } = {}\n  ): Promise<{ stdout: string; exitCode: number }> {\n    try {\n      const { stdout } = await execFileAsync('git', args, {\n        cwd: this.repoPath,\n        maxBuffer: MAX_BUFFER,\n        encoding: 'utf-8',\n      });\n      return { stdout, exitCode: 0 };\n    } catch (err) {\n      const e = err as NodeJS.ErrnoException & {\n        code?: number | string;\n        stdout?: string;\n        stderr?: string;\n      };\n      const exitCode = typeof e.code === 'number' ? e.code : undefined;\n      if (exitCode !== undefined && opts.allowExitCodes?.includes(exitCode)) {\n        return { stdout: e.stdout ?? '', exitCode };\n      }\n      throw new GitError(\n        `git ${args[0]} failed${exitCode !== undefined ? ` (exit ${exitCode})` : ''}: ` +\n          `${(e.stderr ?? e.message ?? '').trim()}`,\n        exitCode,\n        (e.stderr ?? '').trim()\n      );\n    }\n  }\n\n  /**\n   * List all branches and tags plus the symbolic HEAD.\n   *\n   * Annotated tags report the tag object's SHA/type with the peeled target\n   * in `peeledSha`. A detached HEAD is tolerated (`head` is `undefined`).\n   */\n  async listRefs(): Promise<RepoRefs> {\n    const format = '%(refname)%00%(objectname)%00%(objecttype)%00%(*objectname)';\n    const [refsRes, headRes] = await Promise.all([\n      this.git(['for-each-ref', `--format=${format}`, 'refs/heads', 'refs/tags']),\n      // Exit 1 = detached HEAD (or unborn branch pointer oddities) — tolerated.\n      this.git(['symbolic-ref', '--quiet', 'HEAD'], { allowExitCodes: [1] }),\n    ]);\n\n    const refs: GitRef[] = [];\n    for (const line of refsRes.stdout.split('\\n')) {\n      if (!line) continue;\n      const [refname, sha, objecttype, peeled] = line.split('\\0');\n      if (!refname || !sha || !objecttype || !OBJECT_TYPES.has(objecttype)) {\n        throw new GitError(`unexpected for-each-ref line: ${JSON.stringify(line)}`, undefined, '');\n      }\n      refs.push({\n        refname,\n        sha,\n        type: objecttype as GitObjectType,\n        ...(peeled ? { peeledSha: peeled } : {}),\n      });\n    }\n\n    const head = headRes.exitCode === 0 ? headRes.stdout.trim() || undefined : undefined;\n    return { head, refs };\n  }\n\n  /**\n   * SHAs of every object reachable from `want` but not from `have`\n   * (`git rev-list --objects <want…> --not <have…>`), i.e. the push delta.\n   *\n   * Haves that don't exist locally (e.g. remote tips we never fetched) are\n   * filtered out first via one `cat-file --batch-check` pass — rev-list\n   * would otherwise die on them.\n   */\n  async objectsBetween(want: string[], have: string[]): Promise<string[]> {\n    const objects = await this.objectsBetweenWithPaths(want, have);\n    return objects.map((o) => o.sha);\n  }\n\n  /**\n   * Like {@link objectsBetween} but keeps the path each object was reached\n   * by (`rev-list --objects` emits `<sha> <path>` for blobs and non-root\n   * trees) — used by push planning to report actionable oversize errors.\n   */\n  async objectsBetweenWithPaths(\n    want: string[],\n    have: string[]\n  ): Promise<ObjectWithPath[]> {\n    for (const w of want) assertRevision(w, 'want');\n    for (const h of have) assertRevision(h, 'have');\n    if (want.length === 0) return [];\n\n    const knownHaves = await this.filterExisting(have);\n\n    const args = ['rev-list', '--objects', ...want];\n    if (knownHaves.length > 0) args.push('--not', ...knownHaves);\n    args.push('--'); // nothing user-supplied can become a pathspec\n    const { stdout } = await this.git(args);\n\n    const objects: ObjectWithPath[] = [];\n    for (const line of stdout.split('\\n')) {\n      if (!line) continue;\n      // `--objects` lines are `<sha>` or `<sha> <path>`.\n      const spaceIdx = line.indexOf(' ');\n      if (spaceIdx === -1) {\n        objects.push({ sha: line });\n      } else {\n        const path = line.slice(spaceIdx + 1);\n        objects.push({\n          sha: line.slice(0, spaceIdx),\n          ...(path ? { path } : {}),\n        });\n      }\n    }\n    return objects;\n  }\n\n  /**\n   * List every blob (file) reachable from a ref's root tree, recursively,\n   * with the path it is served at (#368: the ar.io site manifest join key).\n   * Uses `git ls-tree -r -z` — NUL-terminated records so binary/spaced paths\n   * survive verbatim, and no path quoting to undo. Submodule (`commit`)\n   * gitlink entries and directories are excluded; only real file blobs remain.\n   */\n  async listBlobs(rev: string): Promise<{ path: string; sha: string }[]> {\n    assertRevision(rev, 'ref');\n    const { stdout } = await this.git(['ls-tree', '-r', '-z', rev, '--']);\n    const blobs: { path: string; sha: string }[] = [];\n    for (const record of stdout.split('\\0')) {\n      if (!record) continue;\n      // `<mode> SP <type> SP <sha> TAB <path>`\n      const tab = record.indexOf('\\t');\n      if (tab === -1) {\n        throw new GitError(\n          `unexpected ls-tree record: ${JSON.stringify(record)}`,\n          undefined,\n          ''\n        );\n      }\n      const meta = record.slice(0, tab);\n      const path = record.slice(tab + 1);\n      const [, type, sha] = meta.split(' ');\n      if (type !== 'blob') continue; // trees are flattened by -r; skip gitlinks\n      if (!sha || !FULL_SHA_RE.test(sha)) {\n        throw new GitError(\n          `unexpected ls-tree object id: ${JSON.stringify(record)}`,\n          undefined,\n          ''\n        );\n      }\n      blobs.push({ path, sha });\n    }\n    return blobs;\n  }\n\n  /** Run git feeding `input` on stdin; resolves collected stdout bytes. */\n  private runWithStdin(args: string[], input: string): Promise<Buffer> {\n    return new Promise<Buffer>((resolve, reject) => {\n      const child = spawn('git', args, {\n        cwd: this.repoPath,\n        stdio: ['pipe', 'pipe', 'pipe'],\n      });\n      const out: Buffer[] = [];\n      let stderr = '';\n      child.stdout.on('data', (chunk: Buffer) => out.push(chunk));\n      child.stderr.on('data', (chunk: Buffer) => {\n        stderr += chunk.toString('utf-8');\n      });\n      child.on('error', (err) => {\n        reject(new GitError(`failed to spawn git ${args[0]}: ${err.message}`, undefined, ''));\n      });\n      child.on('close', (code) => {\n        if (code !== 0) {\n          return reject(\n            new GitError(`git ${args[0]} failed (exit ${code}): ${stderr.trim()}`, code ?? undefined, stderr.trim())\n          );\n        }\n        resolve(Buffer.concat(out));\n      });\n      child.stdin.on('error', () => {\n        // Child died before consuming stdin; 'close' surfaces the failure.\n      });\n      child.stdin.write(input);\n      child.stdin.end();\n    });\n  }\n\n  /** Of the given revisions, keep only those resolvable locally. */\n  private async filterExisting(revs: string[]): Promise<string[]> {\n    if (revs.length === 0) return [];\n    const { missing } = await this.batchCheck(revs);\n    const missingSet = new Set(missing);\n    return revs.filter((r) => !missingSet.has(r));\n  }\n\n  /** One `cat-file --batch-check` pass; returns names reported missing. */\n  private async batchCheck(names: string[]): Promise<{ missing: string[] }> {\n    const stdout = await this.runWithStdin(\n      ['cat-file', '--batch-check'],\n      names.join('\\n') + '\\n'\n    );\n    const missing: string[] = [];\n    for (const line of stdout.toString('utf-8').split('\\n')) {\n      if (line.endsWith(' missing')) missing.push(line.slice(0, -' missing'.length));\n    }\n    return { missing };\n  }\n\n  /**\n   * Object metadata (type + body size) for a batch of SHAs via one\n   * `cat-file --batch-check` pass — no bodies are read. Missing objects are\n   * reported, not thrown.\n   */\n  async statObjects(shas: string[]): Promise<StatObjectsResult> {\n    for (const sha of shas) assertFullSha(sha, 'sha');\n    if (shas.length === 0) return { objects: [], missing: [] };\n\n    const stdout = await this.runWithStdin(\n      ['cat-file', '--batch-check'],\n      shas.join('\\n') + '\\n'\n    );\n\n    const objects: ObjectStat[] = [];\n    const missing: string[] = [];\n    for (const line of stdout.toString('utf-8').split('\\n')) {\n      if (!line) continue;\n      if (line.endsWith(' missing')) {\n        missing.push(line.slice(0, -' missing'.length));\n        continue;\n      }\n      const [sha, type, sizeStr] = line.split(' ');\n      const size = Number.parseInt(sizeStr ?? '', 10);\n      if (\n        !sha ||\n        !type ||\n        !OBJECT_TYPES.has(type) ||\n        !Number.isSafeInteger(size) ||\n        size < 0\n      ) {\n        throw new GitError(\n          `unexpected cat-file --batch-check line: ${JSON.stringify(line)}`,\n          undefined,\n          ''\n        );\n      }\n      objects.push({ sha, type: type as GitObjectType, size });\n    }\n    return { objects, missing };\n  }\n\n  /**\n   * Read raw object bodies via a single streaming `git cat-file --batch`\n   * child process. Bodies may be binary and are parsed size-driven across\n   * chunk boundaries. Missing objects are reported, not thrown.\n   */\n  async readObjects(shas: string[]): Promise<ReadObjectsResult> {\n    for (const sha of shas) assertFullSha(sha, 'sha');\n    if (shas.length === 0) return { objects: [], missing: [] };\n\n    const parser = new BatchParser();\n    await new Promise<void>((resolve, reject) => {\n      const child = spawn('git', ['cat-file', '--batch'], {\n        cwd: this.repoPath,\n        stdio: ['pipe', 'pipe', 'pipe'],\n      });\n\n      let stderr = '';\n      let parseError: Error | null = null;\n\n      child.stderr.on('data', (chunk: Buffer) => {\n        stderr += chunk.toString('utf-8');\n      });\n      child.stdout.on('data', (chunk: Buffer) => {\n        if (parseError) return;\n        try {\n          parser.push(chunk);\n        } catch (err) {\n          parseError = err as Error;\n          child.kill();\n        }\n      });\n      child.on('error', (err) => {\n        reject(new GitError(`failed to spawn git cat-file: ${err.message}`, undefined, ''));\n      });\n      child.on('close', (code) => {\n        if (parseError) return reject(parseError);\n        if (code !== 0) {\n          return reject(\n            new GitError(`git cat-file --batch failed (exit ${code}): ${stderr.trim()}`, code ?? undefined, stderr.trim())\n          );\n        }\n        if (!parser.isComplete()) {\n          return reject(\n            new GitError('git cat-file --batch output ended mid-record', code ?? undefined, stderr.trim())\n          );\n        }\n        resolve();\n      });\n\n      child.stdin.on('error', () => {\n        // Child died before consuming stdin; 'close' will surface the error.\n      });\n      child.stdin.write(shas.join('\\n') + '\\n');\n      child.stdin.end();\n    });\n\n    return { objects: parser.objects, missing: parser.missing };\n  }\n\n  /**\n   * `git merge-base --is-ancestor <a> <b>` — true when `a` is an ancestor\n   * of `b` (fast-forward check / force detection). Exit codes other than\n   * 0/1 (e.g. unknown revisions) throw.\n   */\n  async isAncestor(a: string, b: string): Promise<boolean> {\n    assertRevision(a, 'ancestor candidate');\n    assertRevision(b, 'descendant candidate');\n    const { exitCode } = await this.git(\n      ['merge-base', '--is-ancestor', a, b],\n      { allowExitCodes: [1] }\n    );\n    return exitCode === 0;\n  }\n\n  /**\n   * `git format-patch --stdout <range>` — the full mbox-formatted patch\n   * series text (empty string when the range selects no commits).\n   */\n  async formatPatch(range: string): Promise<string> {\n    assertRange(range, 'range');\n    const { stdout } = await this.git(['format-patch', '--stdout', range, '--']);\n    return stdout;\n  }\n\n  /**\n   * Parent SHAs for a batch of commit SHAs via one\n   * `git rev-list --no-walk=unsorted --parents` pass. Root commits map to an\n   * empty array. Used to derive the kind:1617 `commit`/`parent-commit` tag\n   * pairs for exactly the commits a format-patch series carries.\n   */\n  async commitParents(shas: string[]): Promise<Map<string, string[]>> {\n    for (const sha of shas) assertFullSha(sha, 'sha');\n    if (shas.length === 0) return new Map();\n    const { stdout } = await this.git([\n      'rev-list',\n      '--no-walk=unsorted',\n      '--parents',\n      ...shas,\n      '--',\n    ]);\n    const parents = new Map<string, string[]>();\n    for (const line of stdout.split('\\n')) {\n      if (!line) continue;\n      const [sha, ...rest] = line.split(' ');\n      if (!sha || !FULL_SHA_RE.test(sha) || rest.some((p) => !FULL_SHA_RE.test(p))) {\n        throw new GitError(\n          `unexpected rev-list --parents line: ${JSON.stringify(line)}`,\n          undefined,\n          ''\n        );\n      }\n      parents.set(sha, rest);\n    }\n    return parents;\n  }\n\n  /**\n   * Resolve a ref/revision to a full SHA via `git rev-parse --verify`.\n   * Throws {@link GitError} when the name doesn't resolve.\n   */\n  async resolveRef(name: string): Promise<string> {\n    assertRevision(name, 'ref name');\n    const { stdout } = await this.git(['rev-parse', '--verify', '--quiet', name]);\n    const sha = stdout.trim();\n    if (!FULL_SHA_RE.test(sha)) {\n      throw new GitError(\n        `rev-parse --verify returned unexpected output for ${JSON.stringify(name)}: ${JSON.stringify(sha)}`,\n        undefined,\n        ''\n      );\n    }\n    return sha;\n  }\n}\n","/**\n * The Git-from-TOON READ pipeline core (#278): download git object bodies\n * from Arweave gateways, verify them against their SHA-1, and walk the\n * object graph to prove a ref closure is complete.\n *\n * This is the CLI counterpart of rig-web's proven browser read path\n * (`web/arweave-client.ts` + `web/git-objects.ts` + the commit walker) — the\n * logic is mirrored, not imported, because the SPA package is not a library.\n *\n * Everything here is FREE (reads only: Arweave gateway GETs + the GraphQL\n * Git-SHA resolver) and pure of git — materializing objects into a real\n * repository lives in ./materialize.ts.\n *\n * INTEGRITY IS NON-NEGOTIABLE: an Arweave upload stores the object BODY\n * (content after the envelope NUL). Re-wrapping the body as each of the four\n * git object types and comparing the envelope SHA-1 against the expected SHA\n * both AUTHENTICATES the bytes and DISCOVERS the object's type in one step —\n * a body that matches under no type is rejected as corrupt/tampered, never\n * written.\n */\n\nimport {\n  ARWEAVE_FETCH_TIMEOUT_MS,\n  ARWEAVE_GATEWAYS,\n  isValidArweaveTxId,\n} from '@toon-protocol/arweave';\nimport { hashGitObject, type GitObjectType } from './objects.js';\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** A downloaded git object: SHA-verified body + the type that verified it. */\nexport interface FetchedObject {\n  /** Full 40-hex SHA-1 (verified against the body). */\n  sha: string;\n  type: GitObjectType;\n  /** Raw object body (content only, no envelope header). May be binary. */\n  body: Buffer;\n}\n\n/** WHATWG-fetch seam (injectable for tests). */\nexport type FetchLike = (\n  url: string,\n  init?: { signal?: AbortSignal }\n) => Promise<{\n  ok: boolean;\n  arrayBuffer(): Promise<ArrayBuffer>;\n}>;\n\nexport interface GatewayFetchOptions {\n  /** Ordered gateway base URLs (default: the shared preference list). */\n  gateways?: readonly string[];\n  /** fetch implementation (default: global fetch). */\n  fetchFn?: FetchLike;\n  /** Per-request timeout in milliseconds. */\n  timeoutMs?: number;\n}\n\nexport interface DownloadOptions extends GatewayFetchOptions {\n  /** Maximum concurrent gateway downloads (default {@link DEFAULT_CONCURRENCY}). */\n  concurrency?: number;\n  /** Progress callback, called once per finished object. */\n  onObject?: (done: number, total: number) => void;\n}\n\n/** Result of {@link downloadGitObjects}. */\nexport interface DownloadResult {\n  /** SHA → verified object, for every SHA that could be downloaded. */\n  objects: Map<string, FetchedObject>;\n  /** SHAs whose txId 404'd/errored on EVERY gateway (propagation lag). */\n  unavailable: { sha: string; txId: string }[];\n}\n\n/** Default parallel-download cap. */\nexport const DEFAULT_CONCURRENCY = 8;\n\n/**\n * A downloaded body did not hash to its expected SHA under ANY git object\n * type — corrupt or tampered content. The clone/fetch pipelines treat this\n * as a hard failure: nothing is written.\n */\nexport class ObjectIntegrityError extends Error {\n  constructor(\n    /** The objects that failed verification. */\n    public readonly objects: { sha: string; txId: string }[]\n  ) {\n    super(\n      `${objects.length} downloaded object(s) failed SHA-1 verification — ` +\n        'the gateway content does not match the announced git SHA(s): ' +\n        objects.map((o) => `${o.sha} (tx ${o.txId})`).join(', ') +\n        '. Refusing to write corrupt/tampered objects.'\n    );\n    this.name = 'ObjectIntegrityError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Verification (SHA check == type discovery)\n// ---------------------------------------------------------------------------\n\nconst OBJECT_TYPES: readonly GitObjectType[] = [\n  'blob',\n  'tree',\n  'commit',\n  'tag',\n];\n\n/**\n * Verify a downloaded body against its expected SHA-1 by trying the four git\n * envelope types. Returns the verified object, or null when no type matches\n * (corrupt/tampered bytes).\n */\nexport function verifyObjectBody(\n  expectedSha: string,\n  bytes: Uint8Array\n): FetchedObject | null {\n  const body = Buffer.from(bytes);\n  for (const type of OBJECT_TYPES) {\n    if (hashGitObject(type, body).sha === expectedSha) {\n      return { sha: expectedSha, type, body };\n    }\n  }\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Gateway download (fallback chain, mirrors rig-web's fetchArweaveObject)\n// ---------------------------------------------------------------------------\n\n/**\n * Fetch raw bytes for an Arweave tx id, trying each gateway in preference\n * order. Returns null when every gateway fails (404 / error / timeout).\n */\nexport async function fetchTxBytes(\n  txId: string,\n  options: GatewayFetchOptions = {}\n): Promise<Uint8Array | null> {\n  if (!isValidArweaveTxId(txId)) return null;\n  const gateways = options.gateways ?? ARWEAVE_GATEWAYS;\n  const fetchFn = options.fetchFn ?? (fetch as FetchLike);\n  const timeoutMs = options.timeoutMs ?? ARWEAVE_FETCH_TIMEOUT_MS;\n\n  for (const gateway of gateways) {\n    try {\n      const response = await fetchFn(`${gateway}/${txId}`, {\n        signal: AbortSignal.timeout(timeoutMs),\n      });\n      if (!response.ok) continue;\n      return new Uint8Array(await response.arrayBuffer());\n    } catch {\n      // Network error, timeout, or other failure — try the next gateway.\n    }\n  }\n  return null;\n}\n\n/**\n * Download + verify a batch of git objects (sha → Arweave txId) with a\n * concurrency cap and per-gateway fallback.\n *\n * Objects that 404 on every gateway are reported in `unavailable` (Arweave\n * propagation lag — the caller decides whether that is fatal). Objects whose\n * bytes fail SHA-1 verification throw {@link ObjectIntegrityError}: corrupt\n * content is NEVER returned.\n */\nexport async function downloadGitObjects(\n  entries: Iterable<[sha: string, txId: string]>,\n  options: DownloadOptions = {}\n): Promise<DownloadResult> {\n  const queue = [...entries];\n  const total = queue.length;\n  const concurrency = Math.max(1, options.concurrency ?? DEFAULT_CONCURRENCY);\n\n  const objects = new Map<string, FetchedObject>();\n  const unavailable: { sha: string; txId: string }[] = [];\n  const corrupt: { sha: string; txId: string }[] = [];\n  let done = 0;\n\n  const worker = async (): Promise<void> => {\n    for (;;) {\n      const next = queue.shift();\n      if (!next) return;\n      const [sha, txId] = next;\n      const bytes = await fetchTxBytes(txId, options);\n      if (bytes === null) {\n        unavailable.push({ sha, txId });\n      } else {\n        const verified = verifyObjectBody(sha, bytes);\n        if (verified === null) {\n          corrupt.push({ sha, txId });\n        } else {\n          objects.set(sha, verified);\n        }\n      }\n      done += 1;\n      options.onObject?.(done, total);\n    }\n  };\n\n  await Promise.all(\n    Array.from({ length: Math.min(concurrency, total) }, () => worker())\n  );\n\n  if (corrupt.length > 0) throw new ObjectIntegrityError(corrupt);\n  return { objects, unavailable };\n}\n\n// ---------------------------------------------------------------------------\n// Object-graph references (mirrors rig-web's git-objects parsing)\n// ---------------------------------------------------------------------------\n\nconst FULL_SHA_RE = /^[0-9a-f]{40}$/;\n\n/** Submodule (gitlink) tree-entry mode: references a commit in ANOTHER repo. */\nconst GITLINK_MODE = '160000';\n\nfunction bytesToHex(bytes: Uint8Array): string {\n  let hex = '';\n  for (const byte of bytes) hex += byte.toString(16).padStart(2, '0');\n  return hex;\n}\n\n/**\n * SHAs an object references inside the SAME repository:\n *   - commit → its tree + parents\n *   - tree   → entry SHAs, EXCEPT gitlinks (mode 160000: submodule commits\n *              live in another repository and are never present — git fsck\n *              skips them too)\n *   - tag    → the tagged object\n *   - blob   → nothing\n */\nexport function referencedShas(object: FetchedObject): string[] {\n  switch (object.type) {\n    case 'blob':\n      return [];\n    case 'tree': {\n      const refs: string[] = [];\n      const data = object.body;\n      let offset = 0;\n      while (offset < data.length) {\n        const spaceIdx = data.indexOf(0x20, offset);\n        if (spaceIdx === -1) break;\n        const mode = data.subarray(offset, spaceIdx).toString('utf-8');\n        const nulIdx = data.indexOf(0x00, spaceIdx + 1);\n        if (nulIdx === -1 || nulIdx + 21 > data.length) break;\n        const sha = bytesToHex(data.subarray(nulIdx + 1, nulIdx + 21));\n        if (mode !== GITLINK_MODE) refs.push(sha);\n        offset = nulIdx + 21;\n      }\n      return refs;\n    }\n    case 'commit': {\n      const refs: string[] = [];\n      const text = object.body.toString('utf-8');\n      const headerEnd = text.indexOf('\\n\\n');\n      const header = headerEnd === -1 ? text : text.slice(0, headerEnd);\n      for (const line of header.split('\\n')) {\n        if (line.startsWith('tree ')) refs.push(line.slice(5).trim());\n        else if (line.startsWith('parent ')) refs.push(line.slice(7).trim());\n      }\n      return refs.filter((sha) => FULL_SHA_RE.test(sha));\n    }\n    case 'tag': {\n      const text = object.body.toString('utf-8');\n      const match = /^object ([0-9a-f]{40})$/m.exec(text);\n      return match?.[1] ? [match[1]] : [];\n    }\n  }\n}\n\n/** Result of {@link walkClosure}. */\nexport interface ClosureResult {\n  /** Every SHA reachable from the tips that lives in `objects`. */\n  reachable: Set<string>;\n  /** Reachable SHAs found NEITHER in `objects` nor in `presentLocally`. */\n  missing: string[];\n}\n\n/**\n * Walk the object graph from the ref tips over the downloaded object set and\n * report which reachable SHAs are missing. `presentLocally` marks SHAs that\n * already exist in the destination repository — the walk does not descend\n * into them (a consistent local repo carries its own closure; the same\n * assumption `git fetch` makes).\n */\nexport function walkClosure(\n  tips: Iterable<string>,\n  objects: ReadonlyMap<string, FetchedObject>,\n  presentLocally: ReadonlySet<string> = new Set()\n): ClosureResult {\n  const reachable = new Set<string>();\n  const missing = new Set<string>();\n  const stack = [...new Set(tips)];\n\n  while (stack.length > 0) {\n    const sha = stack.pop() as string;\n    if (reachable.has(sha) || missing.has(sha)) continue;\n    if (presentLocally.has(sha)) continue; // local closure assumed complete\n    const object = objects.get(sha);\n    if (!object) {\n      missing.add(sha);\n      continue;\n    }\n    reachable.add(sha);\n    for (const ref of referencedShas(object)) {\n      if (!reachable.has(ref) && !missing.has(ref)) stack.push(ref);\n    }\n  }\n\n  return { reachable, missing: [...missing] };\n}\n","/**\n * The shared clone/fetch object-collection engine (#278).\n *\n * Given the remote's ref tips and its kind:30618 sha→Arweave-txId map, gather\n * every object the refs need:\n *\n *   1. download the mapped objects the destination repo doesn't already have\n *      (parallel, gateway fallback chain, SHA-verified — ./object-fetch.ts);\n *   2. walk the object graph from the tips (./object-fetch.ts walkClosure) —\n *      the local repository's objects count as present (git fetch's own\n *      assumption: a consistent repo carries its own closure);\n *   3. SHAs the map doesn't cover are resolved through the Arweave GraphQL\n *      Git-SHA resolver (RemoteState.resolveMissing) and downloaded, looping\n *      until the closure is complete or no progress can be made.\n *\n * The result separates FATAL gaps (reachable objects that could not be\n * obtained — usually Arweave gateway propagation lag, 10–20 min for fresh\n * pushes) from harmless ones (mapped-but-unreachable objects, e.g. history\n * that was force-pushed away). Corrupt objects throw ObjectIntegrityError\n * from the download layer and never surface here.\n */\n\nimport {\n  downloadGitObjects,\n  walkClosure,\n  type DownloadOptions,\n  type FetchedObject,\n} from './object-fetch.js';\nimport { EMPTY_BLOB_SHA } from './objects.js';\n\n/** A reachable object that could not be obtained. */\nexport interface MissingObject {\n  sha: string;\n  /** The txId that failed on every gateway, or null when no txId resolved. */\n  txId: string | null;\n}\n\nexport interface CollectRepoObjectsOptions extends DownloadOptions {\n  /** Ref tip SHAs (commits or annotated tags) the closure must reach. */\n  tips: string[];\n  /** kind:30618 `arweave` tag map: git SHA → Arweave txId. */\n  shaToTxId: ReadonlyMap<string, string>;\n  /** GraphQL fallback for SHAs the map doesn't cover (RemoteState.resolveMissing). */\n  resolveMissing: (shas: string[]) => Promise<Map<string, string>>;\n  /** SHAs already present in the destination repository (fetch delta). */\n  presentLocally?: ReadonlySet<string>;\n}\n\nexport interface CollectRepoObjectsResult {\n  /** Verified objects to write, keyed by SHA. */\n  objects: Map<string, FetchedObject>;\n  /** Reachable SHAs that could not be obtained — FATAL for clone/fetch. */\n  missing: MissingObject[];\n  /** Mapped-but-unreachable SHAs that failed to download — warn only. */\n  skippedUnavailable: { sha: string; txId: string }[];\n}\n\n/** Iteration cap: closure depth of NEW unmapped SHAs per pass; generous. */\nconst MAX_PASSES = 64;\n\n/** Collect (download + verify + close over) the objects the ref tips need. */\nexport async function collectRepoObjects(\n  options: CollectRepoObjectsOptions\n): Promise<CollectRepoObjectsResult> {\n  const { tips, shaToTxId, resolveMissing } = options;\n  const present = options.presentLocally ?? new Set<string>();\n\n  /** All txId knowledge: the 30618 map + GraphQL-resolved additions. */\n  const txIds = new Map<string, string>(shaToTxId);\n  /** SHAs we already asked the GraphQL resolver about (avoid re-queries). */\n  const resolverAsked = new Set<string>();\n  /** SHAs whose download failed on every gateway. */\n  const undownloadable = new Map<string, string>();\n  const objects = new Map<string, FetchedObject>();\n\n  // Pass 0: bulk-download everything the map covers that isn't local yet.\n  const initial: [string, string][] = [];\n  for (const [sha, txId] of txIds) {\n    if (!present.has(sha)) initial.push([sha, txId]);\n  }\n  const bulk = await downloadGitObjects(initial, options);\n  for (const [sha, object] of bulk.objects) objects.set(sha, object);\n  for (const { sha, txId } of bulk.unavailable) undownloadable.set(sha, txId);\n\n  // Iterate: close over the tips; resolve + download whatever is still open.\n  for (let pass = 0; pass < MAX_PASSES; pass++) {\n    const closure = walkClosure(tips, objects, present);\n    const open = closure.missing.filter((sha) => !undownloadable.has(sha));\n    if (open.length === 0) break;\n\n    // Resolve txIds for open SHAs we haven't asked the resolver about.\n    const toResolve = open.filter(\n      (sha) => !txIds.has(sha) && !resolverAsked.has(sha)\n    );\n    for (const sha of toResolve) resolverAsked.add(sha);\n    if (toResolve.length > 0) {\n      const resolved = await resolveMissing(toResolve);\n      for (const [sha, txId] of resolved) txIds.set(sha, txId);\n    }\n\n    // Download open SHAs that now have a txId and no failed attempt yet.\n    const batch: [string, string][] = [];\n    for (const sha of open) {\n      const txId = txIds.get(sha);\n      if (txId !== undefined && !objects.has(sha)) batch.push([sha, txId]);\n    }\n    if (batch.length === 0) break; // no progress possible\n    const result = await downloadGitObjects(batch, options);\n    for (const [sha, object] of result.objects) objects.set(sha, object);\n    for (const { sha, txId } of result.unavailable)\n      undownloadable.set(sha, txId);\n    if (result.objects.size === 0) break; // every attempt failed — stop\n  }\n\n  // The git empty blob is never uploaded (the store rejects zero-byte\n  // content; `rig push` skips it), so a tree that references it reports it\n  // \"missing\" here even though it is a git constant. Synthesize it locally —\n  // a zero-byte blob body always hashes to EMPTY_BLOB_SHA — instead of\n  // erroring, so an empty file reconstructs bit-identically (git fsck clean).\n  // Keyed off the EXACT constant SHA: the honest lag-error still fires for any\n  // genuinely-missing non-empty object.\n  let finalClosure = walkClosure(tips, objects, present);\n  if (\n    finalClosure.missing.includes(EMPTY_BLOB_SHA) &&\n    !present.has(EMPTY_BLOB_SHA)\n  ) {\n    objects.set(EMPTY_BLOB_SHA, {\n      sha: EMPTY_BLOB_SHA,\n      type: 'blob',\n      body: Buffer.alloc(0),\n    });\n    finalClosure = walkClosure(tips, objects, present);\n  }\n\n  // Final accounting.\n  const missing: MissingObject[] = finalClosure.missing.map((sha) => ({\n    sha,\n    txId: txIds.get(sha) ?? null,\n  }));\n  const reachable = finalClosure.reachable;\n  const skippedUnavailable = [...undownloadable]\n    .filter(\n      ([sha]) => !reachable.has(sha) && !finalClosure.missing.includes(sha)\n    )\n    .map(([sha, txId]) => ({ sha, txId }));\n\n  return { objects, missing, skippedUnavailable };\n}\n\n/**\n * The honest propagation-lag error text: which SHAs are unobtainable and why\n * retrying later is the expected remedy.\n */\nexport function missingObjectsMessage(\n  missing: MissingObject[],\n  context: string\n): string {\n  const listed = missing\n    .slice(0, 20)\n    .map(\n      (m) =>\n        `  ${m.sha}${m.txId ? `  (tx ${m.txId})` : '  (no Arweave tx found)'}`\n    )\n    .join('\\n');\n  const more =\n    missing.length > 20 ? `\\n  … and ${missing.length - 20} more` : '';\n  return (\n    `${context}: ${missing.length} required object(s) could not be downloaded:\\n` +\n    `${listed}${more}\\n` +\n    'Recently pushed objects can take 10-20 minutes to become fetchable from ' +\n    'Arweave gateways — if this repo was just pushed, retry in a few minutes. ' +\n    'Nothing was written.'\n  );\n}\n","/**\n * Materialize downloaded git objects into a REAL repository (#278).\n *\n * Objects are written through git's own plumbing — `git hash-object -w\n * --stdin -t <type>` with the raw body on stdin — so git computes, validates\n * (syntax checks for trees/commits/tags), stores (loose object + zlib), and\n * RETURNS the SHA. The returned SHA is compared against the expected one:\n * a second, independent integrity gate after ./object-fetch.ts's envelope\n * verification. Refs land via `git update-ref`, HEAD via `git symbolic-ref`.\n *\n * Same injection posture as GitRepoReader: child processes use\n * `execFile`/`spawn` with argument ARRAYS (never a shell), and refnames are\n * validated with `git check-ref-format` semantics before use.\n */\n\nimport { execFile, spawn } from 'node:child_process';\nimport { promisify } from 'node:util';\nimport type { FetchedObject } from './object-fetch.js';\n\nconst execFileAsync = promisify(execFile);\n\n/** A written object's SHA disagreed with what `git hash-object` computed. */\nexport class ObjectWriteMismatchError extends Error {\n  constructor(\n    public readonly expectedSha: string,\n    public readonly writtenSha: string\n  ) {\n    super(\n      `git hash-object wrote ${writtenSha} where ${expectedSha} was expected — ` +\n        'object content does not round-trip; aborting'\n    );\n    this.name = 'ObjectWriteMismatchError';\n  }\n}\n\n/** Full 40-hex SHA-1. */\nconst FULL_SHA_RE = /^[0-9a-f]{40}$/;\n\n/**\n * Conservative refname validation (superset-safe subset of\n * `git check-ref-format`): must start `refs/`, no component may start with\n * `-` or `.`, no `..`, no control/space/git-special characters, no trailing\n * `/`, `.`, or `.lock`. Rejecting odd-but-legal names is fine — these\n * refnames come from relay events, and a hostile relay must not be able to\n * smuggle options or path traversal into git invocations.\n */\nexport function isSafeRefname(refname: string): boolean {\n  if (!refname.startsWith('refs/') || refname.length > 1024) return false;\n  // eslint-disable-next-line no-control-regex -- explicit control-char reject\n  if (/[\\u0000-\\u0020~^:?*[\\\\\\u007f]/.test(refname)) return false;\n  if (refname.includes('..') || refname.includes('@{')) return false;\n  if (refname.endsWith('/') || refname.endsWith('.')) return false;\n  for (const part of refname.split('/')) {\n    if (part === '' || part.startsWith('.') || part.startsWith('-'))\n      return false;\n    if (part.endsWith('.lock')) return false;\n  }\n  return true;\n}\n\nfunction assertSafeRefname(refname: string): void {\n  if (!isSafeRefname(refname)) {\n    throw new Error(\n      `unsafe ref name from remote state: ${JSON.stringify(refname)} — refusing`\n    );\n  }\n}\n\nfunction assertFullSha(sha: string): void {\n  if (!FULL_SHA_RE.test(sha)) {\n    throw new Error(`not a full 40-hex SHA-1: ${JSON.stringify(sha)}`);\n  }\n}\n\n/** Run git with argument-array safety in `repoPath`. */\nexport async function runGit(\n  repoPath: string,\n  args: string[]\n): Promise<string> {\n  try {\n    const { stdout } = await execFileAsync('git', args, {\n      cwd: repoPath,\n      encoding: 'utf-8',\n      maxBuffer: 64 * 1024 * 1024,\n    });\n    return stdout;\n  } catch (err) {\n    const e = err as {\n      code?: number | string;\n      stderr?: string;\n      message?: string;\n    };\n    throw new Error(\n      `git ${args[0]} failed${typeof e.code === 'number' ? ` (exit ${e.code})` : ''}: ` +\n        `${(e.stderr ?? e.message ?? '').trim()}`\n    );\n  }\n}\n\n/**\n * Write one object via `git hash-object -w --stdin -t <type>` (binary-safe\n * stdin) and verify the SHA git computed matches the expected one.\n */\nexport async function writeGitObject(\n  repoPath: string,\n  object: FetchedObject\n): Promise<void> {\n  assertFullSha(object.sha);\n  const written = await new Promise<string>((resolve, reject) => {\n    const child = spawn(\n      'git',\n      ['hash-object', '-w', '--stdin', '-t', object.type],\n      { cwd: repoPath, stdio: ['pipe', 'pipe', 'pipe'] }\n    );\n    let stdout = '';\n    let stderr = '';\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdout += chunk.toString('utf-8');\n    });\n    child.stderr.on('data', (chunk: Buffer) => {\n      stderr += chunk.toString('utf-8');\n    });\n    child.on('error', (err) => {\n      reject(new Error(`failed to spawn git hash-object: ${err.message}`));\n    });\n    child.on('close', (code) => {\n      if (code !== 0) {\n        return reject(\n          new Error(`git hash-object failed (exit ${code}): ${stderr.trim()}`)\n        );\n      }\n      resolve(stdout.trim());\n    });\n    child.stdin.on('error', () => {\n      // Child died before consuming stdin; 'close' surfaces the failure.\n    });\n    child.stdin.write(object.body);\n    child.stdin.end();\n  });\n  if (written !== object.sha) {\n    throw new ObjectWriteMismatchError(object.sha, written);\n  }\n}\n\n/** Write a batch of verified objects into the repository (sequential). */\nexport async function writeGitObjects(\n  repoPath: string,\n  objects: Iterable<FetchedObject>\n): Promise<number> {\n  let count = 0;\n  for (const object of objects) {\n    await writeGitObject(repoPath, object);\n    count += 1;\n  }\n  return count;\n}\n\n/** `git update-ref <refname> <sha>` with refname/SHA validation. */\nexport async function updateRef(\n  repoPath: string,\n  refname: string,\n  sha: string\n): Promise<void> {\n  assertSafeRefname(refname);\n  assertFullSha(sha);\n  await runGit(repoPath, ['update-ref', refname, sha]);\n}\n\n/** Point HEAD at a branch via `git symbolic-ref HEAD <refname>`. */\nexport async function setHeadSymref(\n  repoPath: string,\n  refname: string\n): Promise<void> {\n  assertSafeRefname(refname);\n  await runGit(repoPath, ['symbolic-ref', 'HEAD', refname]);\n}\n","/**\n * Minimal bech32 npub encoding/decoding for Nostr pubkeys (BIP-173 / NIP-19),\n * dependency-free. Mirrors rig-web's proven `web/npub.ts` — the CLI must not\n * import from the SPA package, so the ~100 lines live here too (#278: `rig\n * clone` accepts `<owner-npub-or-hex>/<repo-id>` addresses).\n */\n\nconst BECH32_CHARSET = 'qpzry9x8gf2tvdw0s3jn54khce6mua7l';\n\nfunction bech32Polymod(values: number[]): number {\n  const GEN = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n  let chk = 1;\n  for (const v of values) {\n    const b = chk >> 25;\n    chk = ((chk & 0x1ffffff) << 5) ^ v;\n    for (let i = 0; i < 5; i++) {\n      chk ^= (b >> i) & 1 ? (GEN[i] as number) : 0;\n    }\n  }\n  return chk;\n}\n\nfunction bech32HrpExpand(hrp: string): number[] {\n  const ret: number[] = [];\n  for (let i = 0; i < hrp.length; i++) {\n    ret.push(hrp.charCodeAt(i) >> 5);\n  }\n  ret.push(0);\n  for (let i = 0; i < hrp.length; i++) {\n    ret.push(hrp.charCodeAt(i) & 31);\n  }\n  return ret;\n}\n\nfunction bech32CreateChecksum(hrp: string, data: number[]): number[] {\n  const values = bech32HrpExpand(hrp).concat(data).concat([0, 0, 0, 0, 0, 0]);\n  const polymod = bech32Polymod(values) ^ 1;\n  const ret: number[] = [];\n  for (let i = 0; i < 6; i++) {\n    ret.push((polymod >> (5 * (5 - i))) & 31);\n  }\n  return ret;\n}\n\nfunction convertBits(\n  data: number[],\n  fromBits: number,\n  toBits: number,\n  pad: boolean\n): number[] {\n  let acc = 0;\n  let bits = 0;\n  const ret: number[] = [];\n  const maxv = (1 << toBits) - 1;\n  for (const value of data) {\n    acc = (acc << fromBits) | value;\n    bits += fromBits;\n    while (bits >= toBits) {\n      bits -= toBits;\n      ret.push((acc >> bits) & maxv);\n    }\n  }\n  if (pad && bits > 0) {\n    ret.push((acc << (toBits - bits)) & maxv);\n  }\n  return ret;\n}\n\nfunction hexToBytes(hex: string): number[] {\n  const bytes: number[] = [];\n  for (let i = 0; i < hex.length; i += 2) {\n    bytes.push(parseInt(hex.slice(i, i + 2), 16));\n  }\n  return bytes;\n}\n\n/** Encode a 64-char hex pubkey as an `npub1…` bech32 string. */\nexport function hexToNpub(hexPubkey: string): string {\n  const hrp = 'npub';\n  const bytes = hexToBytes(hexPubkey);\n  const words = convertBits(bytes, 8, 5, true);\n  const checksum = bech32CreateChecksum(hrp, words);\n  const combined = words.concat(checksum);\n  return hrp + '1' + combined.map((d) => BECH32_CHARSET[d]).join('');\n}\n\n/**\n * Decode an `npub1…` bech32 string back to a 64-char hex pubkey.\n * Throws on malformed input (prefix, length, charset, checksum, padding).\n */\nexport function npubToHex(npub: string): string {\n  const lower = npub.toLowerCase();\n  if (lower !== npub && npub.toUpperCase() !== npub) {\n    throw new Error('npub: mixed case');\n  }\n  if (!lower.startsWith('npub1')) {\n    throw new Error('npub: invalid prefix');\n  }\n  if (lower.length !== 63) {\n    throw new Error('npub: invalid length');\n  }\n\n  const data: number[] = [];\n  for (let i = 5; i < lower.length; i++) {\n    const idx = BECH32_CHARSET.indexOf(lower[i] as string);\n    if (idx === -1) throw new Error('npub: invalid character');\n    data.push(idx);\n  }\n\n  // Verify checksum\n  const hrpExpanded = bech32HrpExpand('npub');\n  if (bech32Polymod(hrpExpanded.concat(data)) !== 1) {\n    throw new Error('npub: invalid checksum');\n  }\n\n  // Strip 6-word checksum, convert 5-bit words back to 8-bit bytes\n  const words = data.slice(0, -6);\n  const bytes = convertBits(words, 5, 8, false);\n\n  if (bytes.length !== 32) {\n    throw new Error('npub: invalid data length');\n  }\n\n  // Validate trailing bits are zero\n  const totalBits = words.length * 5;\n  const trailingBits = totalBits - bytes.length * 8;\n  if (trailingBits > 0) {\n    const lastWord = words[words.length - 1] as number;\n    const mask = (1 << trailingBits) - 1;\n    if ((lastWord & mask) !== 0) {\n      throw new Error('npub: non-zero padding bits');\n    }\n  }\n\n  return bytes.map((b) => b.toString(16).padStart(2, '0')).join('');\n}\n\nconst HEX64_RE = /^[0-9a-f]{64}$/;\n\n/**\n * Normalize a repo-owner reference to a 64-char hex pubkey: accepts lowercase\n * hex verbatim or an `npub1…` string. Throws a caller-facing error otherwise.\n */\nexport function ownerToHex(owner: string): string {\n  if (HEX64_RE.test(owner)) return owner;\n  if (owner.startsWith('npub1')) {\n    try {\n      return npubToHex(owner);\n    } catch (err) {\n      throw new Error(\n        `invalid owner ${JSON.stringify(owner)}: ${err instanceof Error ? err.message : String(err)}`\n      );\n    }\n  }\n  throw new Error(\n    `invalid owner ${JSON.stringify(owner)}: expected a 64-char lowercase hex pubkey or an npub1… string`\n  );\n}\n","/**\n * Wire shapes of the toon-clientd `/git/*` control routes (epic #222).\n *\n * These are the JSON request/response types the daemon serves (bigints as\n * decimal strings, Maps as plain records) — defined HERE, in the dependency\n * root, so both sides of the route can share them: the `rig` CLI (#229)\n * consumes them as a plain-fetch client, and `@toon-protocol/client-mcp`\n * (which depends on this package for the planner — the reverse import would\n * be circular) can adopt them for its `control-api.ts` declarations. TYPES\n * ONLY plus two pure serializers; no transport code lives here.\n *\n * Keep in byte-for-byte sync with\n * `packages/client-mcp/src/control-api.ts` (`Git*` shapes) and\n * `packages/client-mcp/src/daemon/routes.ts` (error envelopes: 409\n * `non_fast_forward` carries `refs`, 413 `oversize_objects` carries\n * `objects`, 503 `bootstrapping` / 402 `insufficient_gas` are retryable).\n */\n\nimport type { PublishReceipt } from './publisher.js';\nimport type { PlannedObject, PushPlan, PushResult, RefUpdate } from './push.js';\n\n/** One planned ref update (JSON-safe as-is). */\nexport type GitRefUpdate = RefUpdate;\n\n/** One object scheduled for upload (JSON-safe as-is). */\nexport type GitPlannedObject = PlannedObject;\n\n/**\n * `POST /git/estimate` — plan a push (local git plumbing + remote-state read)\n * and price it WITHOUT paying anything. The same body (plus `confirm`) drives\n * `POST /git/push`.\n */\nexport interface GitEstimateRequest {\n  /** Path to the local git repository (worktree or .git dir). Must exist. */\n  repoPath: string;\n  /** Repository identifier (NIP-34 `d` tag). The daemon identity is the owner. */\n  repoId: string;\n  /**\n   * Full refnames to push (e.g. `[\"refs/heads/main\"]`). Default: every local\n   * branch and tag.\n   */\n  refspecs?: string[];\n  /** Allow non-fast-forward updates (default false → 409 `non_fast_forward`). */\n  force?: boolean;\n  /**\n   * Relay URLs to read remote state from and publish to. Plural from day one\n   * (forward-compat); defaults to the daemon's config-seeded relay.\n   */\n  relayUrls?: string[];\n  /** Repo name/description for the first-push kind:30617 announcement. */\n  announcement?: { name?: string; description?: string };\n}\n\n/** Pre-push fee table (all fees in base/micro units, decimal strings). */\nexport interface GitFeeEstimate {\n  objectCount: number;\n  totalObjectBytes: number;\n  /** objectCount × the store route's flat price. */\n  uploadFee: string;\n  /** Events to publish (refs event + announcement on first push). */\n  eventCount: number;\n  /** eventCount × per-event fee. */\n  eventFees: string;\n  /** uploadFee + eventFees. */\n  totalFee: string;\n  /**\n   * Zero-byte objects (the git empty blob) excluded from the upload — the\n   * store rejects zero-byte content as malformed, so they are skipped on push\n   * and reconstructed on clone/fetch. Optional for wire compatibility with\n   * daemons predating the empty-blob handling. Default 0.\n   */\n  skippedEmptyCount?: number;\n}\n\n/** Serialized `PushPlan` — everything a confirm UI needs. */\nexport interface GitEstimateResponse {\n  repoId: string;\n  refUpdates: GitRefUpdate[];\n  /** Full new ref state to publish (HEAD target first). */\n  newRefs: Record<string, string>;\n  headSymref: string | null;\n  objects: GitPlannedObject[];\n  /** sha→txId hints known WITHOUT uploading (remote tags + resolver finds). */\n  knownShaToTxId: Record<string, string>;\n  /** True when no kind:30617 exists yet — the push announces first. */\n  announceNeeded: boolean;\n  announcement: { name: string; description: string };\n  estimate: GitFeeEstimate;\n}\n\n/**\n * `POST /git/push` — plan + execute: upload the delta to Arweave and publish\n * the cumulative kind:30618 (+ kind:30617 on first push). PERMANENT + PAID.\n */\nexport interface GitPushRequest extends GitEstimateRequest {\n  /** Must be literally `true` — a push spends channel funds irreversibly. */\n  confirm: boolean;\n}\n\n/** One object-upload step result. */\nexport interface GitUploadStep {\n  sha: string;\n  txId: string;\n  /** '0' when skipped (already on Arweave — content-addressed resume). */\n  feePaid: string;\n  skipped: boolean;\n}\n\n/** Receipt for one published event. */\nexport interface GitPublishReceipt {\n  eventId: string;\n  feePaid: string;\n}\n\n/** Serialized `PushResult` — per-step receipts + total fees actually paid. */\nexport interface GitPushResponse {\n  repoId: string;\n  refUpdates: GitRefUpdate[];\n  /** Per-object results, in plan order. */\n  uploads: GitUploadStep[];\n  /** kind:30617 receipt, or null when the repo was already announced. */\n  announceReceipt: GitPublishReceipt | null;\n  /** kind:30618 (cumulative refs + arweave map) receipt. */\n  refsReceipt: GitPublishReceipt;\n  /** Full sha→txId map published in the refs event. */\n  arweaveMap: Record<string, string>;\n  /** Total fees actually paid (uploads + events), base units, decimal. */\n  totalFeePaid: string;\n  /** The pre-push estimate the push ran under (compare against totalFeePaid). */\n  estimate: GitFeeEstimate;\n}\n\n// ---------------------------------------------------------------------------\n// Single-event git publishes (`/git/issue|comment|patch|status`, #231)\n// ---------------------------------------------------------------------------\n\n/** NIP-34 repository address: the owner+id pair behind `a` tags. */\nexport interface GitRepoAddr {\n  /** Repository owner's Nostr pubkey (64-char hex) — author of kind:30617/30618. */\n  ownerPubkey: string;\n  /** Repository identifier (NIP-34 `d` tag). */\n  repoId: string;\n}\n\n/** `POST /git/issue` — publish a kind:1621 issue against a repo. PAID. */\nexport interface GitIssueRequest {\n  repoAddr: GitRepoAddr;\n  /** Issue title (`subject` tag). */\n  title: string;\n  /** Issue body (Markdown content). */\n  body: string;\n  /** Labels (`t` tags). */\n  labels?: string[];\n}\n\n/** `POST /git/comment` — publish a kind:1622 comment on an issue/patch. PAID. */\nexport interface GitCommentRequest {\n  repoAddr: GitRepoAddr;\n  /** Event id of the issue or patch being commented on. */\n  rootEventId: string;\n  /** Comment body (Markdown content). */\n  body: string;\n  /**\n   * Pubkey of the TARGET event's author (NIP-34 `p` threading tag — not the\n   * comment author). Defaults to the repo owner.\n   */\n  parentAuthorPubkey?: string;\n  /** `e`-tag marker (default 'root': commenting directly on the issue/patch). */\n  marker?: 'root' | 'reply';\n}\n\n/**\n * `POST /git/patch` — publish a kind:1617 patch. Supply EXACTLY ONE of\n * `patchText` (literal `git format-patch` output) or `repoPath`+`range`\n * (the daemon runs `git format-patch --stdout <range>` locally). PAID.\n */\nexport interface GitPatchRequest {\n  repoAddr: GitRepoAddr;\n  /** Patch/PR title (`subject` tag). */\n  title: string;\n  /**\n   * PR body/cover text (`description` tag). Kept OUT of the event content so\n   * `git am` still consumes the patch text verbatim (#280).\n   */\n  description?: string;\n  /** Literal patch text. Mutually exclusive with `repoPath`+`range`. */\n  patchText?: string;\n  /** Local repository to run format-patch in. Requires `range`. */\n  repoPath?: string;\n  /** Revision range for format-patch (`<rev>`, `<rev>..<rev>`, `<rev>...<rev>`). */\n  range?: string;\n  /** Commit/parent pairs for `commit`/`parent-commit` tags. */\n  commits?: { sha: string; parentSha: string }[];\n  /** Branch name for the `t` tag. */\n  branch?: string;\n}\n\nexport type GitStatusValue = 'open' | 'applied' | 'closed' | 'draft';\n\n/** `POST /git/status` — publish a kind:1630-1633 status event. PAID. */\nexport interface GitStatusRequest {\n  repoAddr: GitRepoAddr;\n  /** Event id of the issue/patch whose status is being set. */\n  targetEventId: string;\n  /** open → 1630, applied → 1631, closed → 1632, draft → 1633. */\n  status: GitStatusValue;\n  /** Pubkey of the target event's author (`p` tag), when known. */\n  targetPubkey?: string;\n}\n\n/**\n * Response of the single-event git publishes (issue/comment/patch/status):\n * a publish receipt plus the NIP-34 kind that was published. Daemon\n * responses extend the full `POST /publish` receipt, so the channel fields\n * (`channelId`/`nonce`/…) are present there; they are optional here because\n * the CLI's standalone path publishes through the embedded client and has\n * no channel wire shape to report.\n */\nexport interface GitEventResponse {\n  /** Event ID as accepted by the relay. */\n  eventId: string;\n  /** Fee actually paid for this publish, base units, decimal string. */\n  feePaid: string;\n  /** The NIP-34 kind that was published. */\n  kind: number;\n  /** Channel the claim was signed against (daemon responses). */\n  channelId?: string;\n  /** Channel nonce after this publish (daemon responses). */\n  nonce?: number;\n  /** FULFILL response data (base64), when the backend returned any. */\n  data?: string;\n  /** Spendable channel balance after this write, when known. */\n  channelBalanceAfter?: string;\n}\n\n/**\n * Uniform error envelope of non-2xx control-route responses. Structured\n * errors put extra fields at the top level: `non_fast_forward` (409) adds\n * `refs`, `oversize_objects` (413) adds `objects`.\n */\nexport interface GitErrorEnvelope {\n  error: string;\n  detail?: string;\n  /** True when the caller should retry (e.g. daemon still bootstrapping). */\n  retryable?: boolean;\n  [extra: string]: unknown;\n}\n\n// ---------------------------------------------------------------------------\n// Serializers (pure) — the exact mapping the daemon routes apply; used by the\n// CLI's standalone mode so both surfaces emit identical wire JSON.\n// ---------------------------------------------------------------------------\n\n/** Serialize a plan's fee estimate onto the wire (bigints → strings). */\nexport function serializeFeeEstimate(plan: PushPlan): GitFeeEstimate {\n  return {\n    objectCount: plan.estimate.objectCount,\n    totalObjectBytes: plan.estimate.totalObjectBytes,\n    uploadFee: plan.estimate.uploadFee.toString(),\n    eventCount: plan.estimate.eventCount,\n    eventFees: plan.estimate.eventFees.toString(),\n    totalFee: plan.estimate.totalFee.toString(),\n    ...(plan.estimate.skippedEmptyCount > 0\n      ? { skippedEmptyCount: plan.estimate.skippedEmptyCount }\n      : {}),\n  };\n}\n\n/** Serialize a PushPlan onto the wire (bigints → strings, Maps → records). */\nexport function serializePushPlan(plan: PushPlan): GitEstimateResponse {\n  return {\n    repoId: plan.repoId,\n    refUpdates: plan.refUpdates,\n    newRefs: plan.newRefs,\n    headSymref: plan.headSymref,\n    objects: plan.objects,\n    knownShaToTxId: Object.fromEntries(plan.knownShaToTxId),\n    announceNeeded: plan.announceNeeded,\n    announcement: plan.announcement,\n    estimate: serializeFeeEstimate(plan),\n  };\n}\n\n/**\n * Serialize a standalone {@link PublishReceipt} into the wire shape the\n * daemon's single-event `/git/*` routes answer with, so `--json` consumers\n * see one `GitEventResponse` shape regardless of publisher mode.\n */\nexport function serializeEventReceipt(\n  kind: number,\n  receipt: PublishReceipt\n): GitEventResponse {\n  return {\n    eventId: receipt.eventId,\n    feePaid: receipt.feePaid.toString(),\n    kind,\n  };\n}\n\n/** Serialize a PushResult onto the wire (bigints → strings, Maps → records). */\nexport function serializePushResult(\n  plan: PushPlan,\n  result: PushResult\n): GitPushResponse {\n  return {\n    repoId: plan.repoId,\n    refUpdates: plan.refUpdates,\n    uploads: result.uploads.map((u) => ({\n      sha: u.sha,\n      txId: u.txId,\n      feePaid: u.feePaid.toString(),\n      skipped: u.skipped,\n    })),\n    announceReceipt: result.announceReceipt\n      ? {\n          eventId: result.announceReceipt.eventId,\n          feePaid: result.announceReceipt.feePaid.toString(),\n        }\n      : null,\n    refsReceipt: {\n      eventId: result.refsReceipt.eventId,\n      feePaid: result.refsReceipt.feePaid.toString(),\n    },\n    arweaveMap: Object.fromEntries(result.arweaveMap),\n    totalFeePaid: result.totalFeePaid.toString(),\n    estimate: serializeFeeEstimate(plan),\n  };\n}\n","/**\n * Push planner/executor — the core of `rig push` (epic #222, ticket #226).\n *\n * `planPush` is network-free (relay/Arweave-wise — it only runs local git\n * plumbing through GitRepoReader plus one injectable async resolver step):\n * it classifies every ref update, computes the object delta against what the\n * remote already stores, hard-errors on oversize objects, and prices the\n * push. The returned {@link PushPlan} carries everything a confirm UI needs.\n *\n * `executePush` spends money: it uploads the planned objects through a\n * {@link Publisher} (ref-tip objects last, so a crashed push never leads to\n * a state where a discoverable tip's history is missing), then publishes ONE\n * cumulative kind:30618 whose `arweave` tags are the MERGE of the remote's\n * existing sha→txId map and the new uploads — kind:30618 is NIP-33\n * replaceable, so dropping prior tags would orphan earlier hints — and whose\n * `r` tags are the full new ref state. On a first push it publishes the\n * kind:30617 announcement before the refs event.\n *\n * Resume safety: uploads are content-addressed (Git-SHA-tagged), so re-running\n * `executePush` after a crash is safe — it consults the merged\n * remote + planned sha→txId map before paying for any upload, and a re-plan\n * with fresh remote state (whose `resolveMissing` finds the already-uploaded\n * objects via GraphQL) skips them entirely.\n */\n\nimport { buildRepoAnnouncement, buildRepoRefs } from './nip34-events.js';\nimport {\n  EMPTY_BLOB_SHA,\n  MAX_OBJECT_SIZE,\n  type GitObjectType,\n} from './objects.js';\nimport {\n  uploadChargeFor,\n  type FeeRates,\n  type PublishReceipt,\n  type Publisher,\n} from './publisher.js';\nimport { GitError, type GitRef, type GitRepoReader } from './repo-reader.js';\nimport type { RemoteState } from './remote-state.js';\n\n// ---------------------------------------------------------------------------\n// Errors\n// ---------------------------------------------------------------------------\n\n/** A ref update rejected because it is not a fast-forward. */\nexport interface RejectedRefUpdate {\n  refname: string;\n  localSha: string;\n  remoteSha: string;\n}\n\n/** Thrown by {@link planPush} when a non-fast-forward update lacks `force`. */\nexport class NonFastForwardError extends Error {\n  constructor(\n    /** The refs that would need `--force` to update. */\n    public readonly refs: RejectedRefUpdate[]\n  ) {\n    super(\n      `non-fast-forward update rejected for ${refs\n        .map((r) => r.refname)\n        .join(', ')} — re-run with force to overwrite the remote ref(s)`\n    );\n    this.name = 'NonFastForwardError';\n  }\n}\n\n/**\n * One object exceeding the old hard upload cap.\n *\n * @deprecated Nothing produces this any more (#102). Size is priced, not\n * refused, so there is no \"oversize\" class of object to report. Retained so\n * the 4.x type export keeps resolving.\n */\nexport interface OversizeObject {\n  sha: string;\n  type: GitObjectType;\n  /** Body size in bytes. */\n  size: number;\n  /** Path the object was reached by (blobs / non-root trees), if known. */\n  path?: string;\n}\n\n/**\n * @deprecated NEVER THROWN as of #102. `planPush` used to reject any object\n * over a hard 95 KiB cap; the store route prices per KiB, so a large object is\n * now a more expensive upload rather than a refusal, and there is nothing left\n * to throw. Retained so the 4.x export keeps resolving — a `catch` for it is\n * dead code and can be removed.\n */\nexport class OversizeObjectsError extends Error {\n  constructor(\n    /** The offending objects with paths and sizes. */\n    public readonly objects: OversizeObject[]\n  ) {\n    super(\n      `${objects.length} object(s) exceed the ${MAX_OBJECT_SIZE} byte upload limit: ` +\n        objects.map((o) => `${o.path ?? o.sha} (${o.size} bytes)`).join(', ')\n    );\n    this.name = 'OversizeObjectsError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Plan types\n// ---------------------------------------------------------------------------\n\n/** How a ref moves relative to the remote. */\nexport type RefUpdateKind =\n  /** Ref does not exist on the remote yet. */\n  | 'new'\n  /** Remote tip is an ancestor of the local tip. */\n  | 'fast-forward'\n  /** Non-fast-forward, allowed because `force` was set. */\n  | 'forced'\n  /** Local and remote tips already match — nothing to push. */\n  | 'up-to-date';\n\n/** One planned ref update (deletions are out of scope in v1). */\nexport interface RefUpdate {\n  /** Full refname, e.g. `refs/heads/main`. */\n  refname: string;\n  /** Local tip SHA (tag object SHA for annotated tags). */\n  localSha: string;\n  /** Remote tip SHA, or null when the ref is new. */\n  remoteSha: string | null;\n  kind: RefUpdateKind;\n}\n\n/** One object scheduled for upload. */\nexport interface PlannedObject {\n  sha: string;\n  type: GitObjectType;\n  /** Body size in bytes (what the upload fee is charged on). */\n  size: number;\n  /** Path the object was reached by, if any (blobs / non-root trees). */\n  path?: string;\n  /** True when this SHA is the tip of a planned ref update (uploaded last). */\n  isRefTip: boolean;\n}\n\n/** Pre-push fee estimate — render this in the confirm table. */\nexport interface PushFeeEstimate {\n  /** Number of objects to upload. */\n  objectCount: number;\n  /** Total bytes across all planned object bodies. */\n  totalObjectBytes: number;\n  /** objectCount × the store route's flat price — smallest asset unit. */\n  uploadFee: bigint;\n  /** Number of events to publish (refs event + announcement on first push). */\n  eventCount: number;\n  /** eventCount × eventFee (smallest asset unit). */\n  eventFees: bigint;\n  /** uploadFee + eventFees. */\n  totalFee: bigint;\n  /**\n   * Objects excluded from the upload because their body is zero bytes — the\n   * git empty blob, which the store rejects as malformed (F00). Reconstructed\n   * locally on clone/fetch, so nothing is lost; surfaced here so the fee table\n   * can report the skip honestly.\n   */\n  skippedEmptyCount: number;\n}\n\n/** Everything `executePush` (and a confirm UI) needs. */\nexport interface PushPlan {\n  repoId: string;\n  /** Every considered ref with its classification (incl. up-to-date). */\n  refUpdates: RefUpdate[];\n  /**\n   * Full new ref state to publish as `r` tags: the remote's refs overlaid\n   * with the planned updates (refs not being pushed are preserved — v1\n   * never deletes). Ordered with the HEAD target first, which is what\n   * `buildRepoRefs` derives the HEAD symref tag from.\n   */\n  newRefs: Record<string, string>;\n  /** HEAD symref target for the new state (first key of {@link newRefs}). */\n  headSymref: string | null;\n  /**\n   * Objects to upload, dependency-safe order: ref-tip objects last so a\n   * crashed push never uploads a tip whose history is missing.\n   */\n  objects: PlannedObject[];\n  /**\n   * Zero-byte objects (the git empty blob) excluded from {@link objects}: the\n   * store rejects a zero-byte kind:5094 upload as malformed (F00), so `rig`\n   * never uploads it — the commit/tree still references it and clone/fetch\n   * synthesizes it locally. Kept for honest receipts, never uploaded.\n   */\n  skippedEmptyObjects: PlannedObject[];\n  /**\n   * sha→txId hints known WITHOUT uploading: the remote's `arweave` tags\n   * plus anything `resolveMissing` found. Merged into the published\n   * kind:30618 so prior hints are never dropped.\n   */\n  knownShaToTxId: Map<string, string>;\n  /** True when no kind:30617 exists yet — executePush announces first. */\n  announceNeeded: boolean;\n  /** Announcement metadata used when {@link announceNeeded}. */\n  announcement: { name: string; description: string };\n  estimate: PushFeeEstimate;\n}\n\nexport interface PlanPushOptions {\n  repoReader: GitRepoReader;\n  remoteState: RemoteState;\n  /** Fee rates from `Publisher.getFeeRates()`. */\n  feeRates: FeeRates;\n  /** Repository identifier (NIP-34 `d` tag). */\n  repoId: string;\n  /**\n   * Full refnames to push (e.g. `['refs/heads/main']`). Defaults to every\n   * local branch and tag. Refs that don't exist locally are an error\n   * (deletions are out of scope in v1).\n   */\n  refs?: string[];\n  /** Allow non-fast-forward updates (default false → hard error). */\n  force?: boolean;\n  /** Repo name/description for the first-push announcement. */\n  announcement?: { name?: string; description?: string };\n  /**\n   * Async resolver for SHAs the remote's `arweave` tags don't cover —\n   * consulted before deciding to re-upload. Defaults to\n   * `remoteState.resolveMissing` (GraphQL fallback); injectable so the\n   * planner core stays testable without network.\n   */\n  resolveMissing?: (shas: string[]) => Promise<Map<string, string>>;\n}\n\n// ---------------------------------------------------------------------------\n// planPush\n// ---------------------------------------------------------------------------\n\n/**\n * Classify ref updates, compute the object delta, enforce the size limit,\n * and price the push. Throws {@link NonFastForwardError} /\n * {@link OversizeObjectsError} (both carry structured data for UIs).\n */\nexport async function planPush(options: PlanPushOptions): Promise<PushPlan> {\n  const { repoReader, remoteState, feeRates, repoId, force = false } = options;\n  const resolveMissing =\n    options.resolveMissing ?? remoteState.resolveMissing.bind(remoteState);\n\n  // 1. Select and classify refs. -------------------------------------------\n  const { head, refs: localRefs } = await repoReader.listRefs();\n  const localByName = new Map(localRefs.map((r) => [r.refname, r]));\n\n  let selected: GitRef[];\n  if (options.refs !== undefined) {\n    selected = options.refs.map((name) => {\n      const ref = localByName.get(name);\n      if (!ref) {\n        throw new Error(\n          `ref ${JSON.stringify(name)} does not exist locally ` +\n            '(ref deletion is out of scope in v1)'\n        );\n      }\n      return ref;\n    });\n  } else {\n    selected = localRefs;\n  }\n\n  const refUpdates: RefUpdate[] = [];\n  const rejected: RejectedRefUpdate[] = [];\n  for (const ref of selected) {\n    const remoteSha = remoteState.refs.get(ref.refname) ?? null;\n    if (remoteSha === null) {\n      refUpdates.push({\n        refname: ref.refname,\n        localSha: ref.sha,\n        remoteSha,\n        kind: 'new',\n      });\n      continue;\n    }\n    if (remoteSha === ref.sha) {\n      refUpdates.push({\n        refname: ref.refname,\n        localSha: ref.sha,\n        remoteSha,\n        kind: 'up-to-date',\n      });\n      continue;\n    }\n    let fastForward = false;\n    try {\n      fastForward = await repoReader.isAncestor(remoteSha, ref.sha);\n    } catch (err) {\n      // Remote tip unknown locally (never fetched) or not a commit-ish —\n      // we can't prove ancestry, so treat it as non-fast-forward.\n      if (!(err instanceof GitError)) throw err;\n      fastForward = false;\n    }\n    if (fastForward) {\n      refUpdates.push({\n        refname: ref.refname,\n        localSha: ref.sha,\n        remoteSha,\n        kind: 'fast-forward',\n      });\n    } else if (force) {\n      refUpdates.push({\n        refname: ref.refname,\n        localSha: ref.sha,\n        remoteSha,\n        kind: 'forced',\n      });\n    } else {\n      rejected.push({ refname: ref.refname, localSha: ref.sha, remoteSha });\n    }\n  }\n  if (rejected.length > 0) throw new NonFastForwardError(rejected);\n\n  const updates = refUpdates.filter((u) => u.kind !== 'up-to-date');\n\n  // 2. Object delta: reachable from the new tips, minus what the remote has.\n  const wantTips = [...new Set(updates.map((u) => u.localSha))];\n  const haveTips = [...new Set(remoteState.refs.values())];\n  const delta =\n    wantTips.length > 0\n      ? await repoReader.objectsBetweenWithPaths(wantTips, haveTips)\n      : [];\n\n  const knownShaToTxId = new Map(remoteState.shaToTxId);\n  let candidates = delta.filter((o) => !knownShaToTxId.has(o.sha));\n  if (candidates.length > 0) {\n    // The remote's `arweave` tags may lag reality (e.g. a crashed push\n    // uploaded objects but never published the refs event) — resolve the\n    // gaps before paying to re-upload content-addressed data.\n    const resolved = await resolveMissing(candidates.map((o) => o.sha));\n    for (const [sha, txId] of resolved) knownShaToTxId.set(sha, txId);\n    candidates = candidates.filter((o) => !knownShaToTxId.has(o.sha));\n  }\n\n  // 3. Sizes + oversize hard error. -----------------------------------------\n  const pathBySha = new Map(candidates.map((c) => [c.sha, c.path]));\n  const { objects: stats, missing } = await repoReader.statObjects(\n    candidates.map((c) => c.sha)\n  );\n  if (missing.length > 0) {\n    throw new Error(\n      `objects vanished from the local repository during planning: ${missing.join(', ')}`\n    );\n  }\n\n  // No size gate. An object larger than FREE_TIER_MAX_ITEM_BYTES is not an\n  // error — it is simply a paid upload: the store route prices per KiB\n  // (ADR 0065), so size is charged for rather than refused (#102). The fee\n  // table the caller confirms already reflects the per-KiB cost, so an\n  // expensive object is visible before anything is spent.\n\n  // 4. Split off the empty blob, then order the rest ref-tips-last. ----------\n  // The git empty blob uploads as an empty kind:5094 `i` value, which the\n  // store rejects as malformed (F00). Skip it: it is reconstructed locally on\n  // clone/fetch. Keyed off the EXACT empty-blob constant SHA — NOT a\n  // `size === 0` heuristic, which would also match the (distinct, valid) empty\n  // TREE object `4b825dc6…` and silently drop it (it is not synthesized on\n  // read). An object whose SHA is EMPTY_BLOB_SHA is provably the empty blob.\n  const tipShas = new Set(updates.map((u) => u.localSha));\n  const planned: PlannedObject[] = [];\n  const skippedEmptyObjects: PlannedObject[] = [];\n  for (const stat of stats) {\n    const path = pathBySha.get(stat.sha);\n    const object: PlannedObject = {\n      ...stat,\n      ...(path ? { path } : {}),\n      isRefTip: tipShas.has(stat.sha),\n    };\n    if (stat.sha === EMPTY_BLOB_SHA) skippedEmptyObjects.push(object);\n    else planned.push(object);\n  }\n  const objects = [\n    ...planned.filter((o) => !o.isRefTip),\n    ...planned.filter((o) => o.isRefTip),\n  ];\n\n  // 5. Full new ref state (remote refs overlaid with updates), HEAD first. --\n  const newRefsMap = new Map(remoteState.refs);\n  for (const update of updates) newRefsMap.set(update.refname, update.localSha);\n\n  const headSymref =\n    head && newRefsMap.has(head)\n      ? head\n      : remoteState.headSymref && newRefsMap.has(remoteState.headSymref)\n        ? remoteState.headSymref\n        : ([...newRefsMap.keys()][0] ?? null);\n\n  const newRefs: Record<string, string> = {};\n  const headSha = headSymref ? newRefsMap.get(headSymref) : undefined;\n  if (headSymref && headSha) newRefs[headSymref] = headSha;\n  for (const [refname, sha] of newRefsMap) {\n    if (refname !== headSymref) newRefs[refname] = sha;\n  }\n\n  // 6. Fee estimate. ---------------------------------------------------------\n  // A price is a schedule per route (ADR 0065): a flat base per packet, plus\n  // an optional per-KiB slope a metered store route publishes. `uploadChargeFor`\n  // is the one rule for both, so the confirm table equals what is paid.\n  const announceNeeded = !remoteState.announced;\n  const totalObjectBytes = objects.reduce((sum, o) => sum + o.size, 0);\n  // Per object: the store route's base price plus, on a metered route (ADR\n  // 0065 schedule), its per-KiB rate over the sealed payload — the same rule\n  // the client applies to the claim, so the table still equals what is paid.\n  const uploadFee = objects.reduce(\n    (sum, o) => sum + uploadChargeFor(feeRates, o.size),\n    0n\n  );\n  const eventCount = 1 + (announceNeeded ? 1 : 0);\n  const eventFees = BigInt(eventCount) * feeRates.eventFee;\n\n  return {\n    repoId,\n    refUpdates,\n    newRefs,\n    headSymref,\n    objects,\n    skippedEmptyObjects,\n    knownShaToTxId,\n    announceNeeded,\n    announcement: {\n      name: options.announcement?.name ?? repoId,\n      description: options.announcement?.description ?? '',\n    },\n    estimate: {\n      objectCount: objects.length,\n      totalObjectBytes,\n      uploadFee,\n      eventCount,\n      eventFees,\n      totalFee: uploadFee + eventFees,\n      skippedEmptyCount: skippedEmptyObjects.length,\n    },\n  };\n}\n\n// ---------------------------------------------------------------------------\n// executePush\n// ---------------------------------------------------------------------------\n\n/** Result of one object-upload step. */\nexport interface UploadStepResult {\n  sha: string;\n  txId: string;\n  /** 0n when skipped (already uploaded — content-addressed resume). */\n  feePaid: bigint;\n  /** True when the object was already on Arweave and nothing was paid. */\n  skipped: boolean;\n}\n\n/** Result of the whole push. */\nexport interface PushResult {\n  /** Per-object results, in plan order. */\n  uploads: UploadStepResult[];\n  /** kind:30617 receipt, or null when the repo was already announced. */\n  announceReceipt: PublishReceipt | null;\n  /** kind:30618 (cumulative refs + arweave map) receipt. */\n  refsReceipt: PublishReceipt;\n  /**\n   * The full sha→txId map published in the refs event: remote hints +\n   * resolver finds + this push's uploads.\n   */\n  arweaveMap: Map<string, string>;\n  /** Total fees actually paid (uploads + events), smallest asset unit. */\n  totalFeePaid: bigint;\n}\n\nexport interface ExecutePushOptions {\n  plan: PushPlan;\n  publisher: Publisher;\n  /**\n   * Remote state — pass a FRESH fetch when resuming after a crash so its\n   * `shaToTxId` (and `announced`) reflect what the previous attempt already\n   * paid for.\n   */\n  remoteState: RemoteState;\n  repoReader: GitRepoReader;\n  /** Relay URLs to publish events to (plural from day one; size 1 today). */\n  relayUrls: string[];\n}\n\n/** How many object bodies to hold in memory at once between read and upload. */\nconst READ_BATCH_SIZE = 100;\n\n/**\n * Execute a {@link PushPlan}: upload objects (ref tips last), then publish\n * the kind:30617 announcement (first push only) and ONE cumulative\n * kind:30618 whose `arweave` tags merge every known sha→txId hint with the\n * new uploads and whose `r` tags carry the full new ref state.\n *\n * Safe to re-run after a crash: SHAs already present in the merged\n * remote + plan map are skipped without paying.\n */\nexport async function executePush(\n  options: ExecutePushOptions\n): Promise<PushResult> {\n  const { plan, publisher, remoteState, repoReader, relayUrls } = options;\n\n  // Merged sha→txId map: remote hints (fresh on resume) + plan-time finds.\n  // Consulted before every upload — this is the resume-safety check.\n  const merged = new Map([...remoteState.shaToTxId, ...plan.knownShaToTxId]);\n\n  const resultBySha = new Map<string, UploadStepResult>();\n  let totalFeePaid = 0n;\n\n  const pending: PlannedObject[] = [];\n  for (const object of plan.objects) {\n    const knownTxId = merged.get(object.sha);\n    if (knownTxId !== undefined) {\n      resultBySha.set(object.sha, {\n        sha: object.sha,\n        txId: knownTxId,\n        feePaid: 0n,\n        skipped: true,\n      });\n    } else {\n      pending.push(object);\n    }\n  }\n\n  // Upload in plan order (ref tips are already last), reading bodies in\n  // batches so memory stays bounded on large pushes.\n  for (let i = 0; i < pending.length; i += READ_BATCH_SIZE) {\n    const batch = pending.slice(i, i + READ_BATCH_SIZE);\n    const { objects: read, missing } = await repoReader.readObjects(\n      batch.map((o) => o.sha)\n    );\n    if (missing.length > 0) {\n      throw new Error(\n        `objects vanished from the local repository during push: ${missing.join(', ')}`\n      );\n    }\n    const bodyBySha = new Map(read.map((r) => [r.sha, r.body]));\n    for (const object of batch) {\n      const body = bodyBySha.get(object.sha);\n      if (!body) {\n        throw new Error(\n          `internal: cat-file returned no body for ${object.sha}`\n        );\n      }\n      const receipt = await publisher.uploadGitObject({\n        sha: object.sha,\n        type: object.type,\n        body,\n        repoId: plan.repoId,\n        // #368: the path the blob was reached by drives its Content-Type; a\n        // non-blob object (no path) uploads as octet-stream.\n        ...(object.path ? { path: object.path } : {}),\n      });\n      merged.set(object.sha, receipt.txId);\n      totalFeePaid += receipt.feePaid;\n      resultBySha.set(object.sha, {\n        sha: object.sha,\n        txId: receipt.txId,\n        feePaid: receipt.feePaid,\n        skipped: false,\n      });\n    }\n  }\n\n  // Announcement (first push only) goes before the refs event so a repo is\n  // never referenced by an `a` tag before its kind:30617 exists. Re-check\n  // the (fresh-on-resume) remote state so a crashed push doesn't announce\n  // twice.\n  let announceReceipt: PublishReceipt | null = null;\n  if (plan.announceNeeded && !remoteState.announced) {\n    const announceEvent = buildRepoAnnouncement(\n      plan.repoId,\n      plan.announcement.name,\n      plan.announcement.description\n    );\n    announceReceipt = await publisher.publishEvent(announceEvent, relayUrls);\n    totalFeePaid += announceReceipt.feePaid;\n  }\n\n  // ONE cumulative kind:30618: full ref state + MERGED arweave map (NIP-33\n  // replaceable — dropping prior tags would orphan earlier sha→txId hints).\n  const refsEvent = buildRepoRefs(\n    plan.repoId,\n    plan.newRefs,\n    Object.fromEntries(merged)\n  );\n  const refsReceipt = await publisher.publishEvent(refsEvent, relayUrls);\n  totalFeePaid += refsReceipt.feePaid;\n\n  const uploads = plan.objects.map((o) => {\n    const step = resultBySha.get(o.sha);\n    if (!step) {\n      throw new Error(`internal: no upload result recorded for ${o.sha}`);\n    }\n    return step;\n  });\n\n  return {\n    uploads,\n    announceReceipt,\n    refsReceipt,\n    arweaveMap: merged,\n    totalFeePaid,\n  };\n}\n"],"mappings":";;;;;;;;;;;;AAaA,SAAS,kBAAkB;AAsCpB,IAAM,2BAA2B;AAOjC,IAAM,kBAAkB;AAWxB,IAAM,iBAAiB;AAUvB,SAAS,cAAc,MAAqB,MAAyB;AAC1E,QAAM,SAAS,OAAO,KAAK,GAAG,IAAI,IAAI,KAAK,MAAM,IAAI;AACrD,QAAM,aAAa,OAAO,OAAO,CAAC,QAAQ,IAAI,CAAC;AAC/C,QAAM,MAAM,WAAW,MAAM,EAAE,OAAO,UAAU,EAAE,OAAO,KAAK;AAC9D,SAAO,EAAE,KAAK,QAAQ,YAAY,KAAK;AACzC;AAYO,SAAS,cAAc,SAA4B;AACxD,SAAO,cAAc,QAAQ,OAAO,KAAK,SAAS,OAAO,CAAC;AAC5D;AASO,SAAS,cACd,SACW;AAEX,QAAM,SAAS,CAAC,GAAG,OAAO,EAAE;AAAA,IAAK,CAAC,GAAG,MACnC,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI;AAAA,EAC/C;AAEA,QAAM,eAAyB,CAAC;AAChC,aAAW,SAAS,QAAQ;AAC1B,UAAM,cAAc,OAAO,KAAK,GAAG,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI;AAE/D,UAAM,SAAS,OAAO,KAAK,MAAM,KAAK,KAAK;AAC3C,iBAAa,KAAK,OAAO,OAAO,CAAC,aAAa,MAAM,CAAC,CAAC;AAAA,EACxD;AAEA,SAAO,cAAc,QAAQ,OAAO,OAAO,YAAY,CAAC;AAC1D;AAQO,SAAS,gBAAgB,MAOlB;AACZ,QAAM,QAAQ;AAAA,IACZ,QAAQ,KAAK,OAAO;AAAA,IACpB,GAAI,KAAK,YAAY,CAAC,UAAU,KAAK,SAAS,EAAE,IAAI,CAAC;AAAA,IACrD,UAAU,KAAK,UAAU,KAAK,KAAK,YAAY,WAAW,KAAK,SAAS;AAAA,IACxE,aAAa,KAAK,UAAU,KAAK,KAAK,YAAY,WAAW,KAAK,SAAS;AAAA,IAC3E;AAAA,IACA,KAAK;AAAA,EACP;AACA,SAAO,cAAc,UAAU,OAAO,KAAK,MAAM,KAAK,IAAI,GAAG,OAAO,CAAC;AACvE;AASO,SAAS,aAAa,MAWf;AACZ,QAAM,QAAQ;AAAA,IACZ,UAAU,KAAK,SAAS;AAAA,IACxB,QAAQ,KAAK,UAAU;AAAA,IACvB,OAAO,KAAK,OAAO;AAAA,IACnB,UAAU,KAAK,UAAU,KAAK,KAAK,YAAY,WAAW,KAAK,SAAS;AAAA,IACxE;AAAA,IACA,KAAK;AAAA,EACP;AACA,SAAO,cAAc,OAAO,OAAO,KAAK,MAAM,KAAK,IAAI,GAAG,OAAO,CAAC;AACpE;;;AChKA,SAAS,UAAU,aAAa;AAChC,SAAS,iBAAiB;AAG1B,IAAM,gBAAgB,UAAU,QAAQ;AAGxC,IAAM,aAAa,MAAM,OAAO;AA6EzB,IAAM,WAAN,cAAuB,MAAM;AAAA,EAClC,YACE,SAEgB,UAEA,QAChB;AACA,UAAM,OAAO;AAJG;AAEA;AAGhB,SAAK,OAAO;AAAA,EACd;AAAA,EANkB;AAAA,EAEA;AAKpB;AAOA,IAAM,cAAc;AAQpB,IAAM,eAAe;AAErB,SAAS,gBAAgB,KAAsB;AAC7C,MAAI,IAAI,WAAW,KAAK,IAAI,SAAS,KAAM,QAAO;AAClD,MAAI,CAAC,aAAa,KAAK,GAAG,EAAG,QAAO;AAEpC,MAAI,IAAI,SAAS,IAAI,EAAG,QAAO;AAC/B,MAAI,IAAI,SAAS,OAAO,KAAK,IAAI,SAAS,GAAG,KAAK,IAAI,SAAS,GAAG,EAAG,QAAO;AAC5E,SAAO;AACT;AAEA,SAAS,eAAe,KAAa,MAAoB;AACvD,MAAI,CAAC,gBAAgB,GAAG,GAAG;AACzB,UAAM,IAAI;AAAA,MACR,GAAG,IAAI,qCAAqC,KAAK,UAAU,GAAG,CAAC;AAAA,IAEjE;AAAA,EACF;AACF;AAEA,SAAS,cAAc,KAAa,MAAoB;AACtD,MAAI,CAAC,YAAY,KAAK,GAAG,GAAG;AAC1B,UAAM,IAAI;AAAA,MACR,GAAG,IAAI,oCAAoC,KAAK,UAAU,GAAG,CAAC;AAAA,IAChE;AAAA,EACF;AACF;AAMA,SAAS,YAAY,OAAe,MAAoB;AACtD,QAAM,QAAQ,MAAM,MAAM,SAAS;AACnC,QAAM,aAAa,MAAM,MAAM,UAAU,KAAK,CAAC;AAC/C,QAAM,KACJ,MAAM,UAAU,KAChB,WAAW,WAAW,MAAM,SAAS,KACrC,MAAM,MAAM,CAAC,MAAM,gBAAgB,CAAC,CAAC;AACvC,MAAI,CAAC,IAAI;AACP,UAAM,IAAI;AAAA,MACR,GAAG,IAAI,uCAAuC,KAAK,UAAU,KAAK,CAAC;AAAA,IAErE;AAAA,EACF;AACF;AAMA,IAAM,eAAoC,oBAAI,IAAI,CAAC,QAAQ,QAAQ,UAAU,KAAK,CAAC;AAQnF,IAAM,cAAN,MAAkB;AAAA,EACR,MAAc,OAAO,MAAM,CAAC;AAAA,EAC5B,UAAqE;AAAA,EAEpE,UAA2B,CAAC;AAAA,EAC5B,UAAoB,CAAC;AAAA,EAE9B,KAAK,OAAqB;AACxB,SAAK,MAAM,KAAK,IAAI,WAAW,IAAI,QAAQ,OAAO,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC;AAC1E,SAAK,MAAM;AAAA,EACb;AAAA;AAAA,EAGA,aAAsB;AACpB,WAAO,KAAK,YAAY,QAAQ,KAAK,IAAI,WAAW;AAAA,EACtD;AAAA,EAEQ,QAAc;AACpB,eAAS;AACP,UAAI,KAAK,SAAS;AAEhB,cAAM,SAAS,KAAK,QAAQ,OAAO;AACnC,YAAI,KAAK,IAAI,SAAS,OAAQ;AAC9B,cAAM,OAAO,OAAO,KAAK,KAAK,IAAI,SAAS,GAAG,KAAK,QAAQ,IAAI,CAAC;AAChE,aAAK,QAAQ,KAAK,EAAE,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK,QAAQ,MAAM,KAAK,CAAC;AAC1E,aAAK,MAAM,KAAK,IAAI,SAAS,MAAM;AACnC,aAAK,UAAU;AACf;AAAA,MACF;AAEA,YAAM,KAAK,KAAK,IAAI,QAAQ,EAAI;AAChC,UAAI,OAAO,GAAI;AACf,YAAM,SAAS,KAAK,IAAI,SAAS,GAAG,EAAE,EAAE,SAAS,OAAO;AACxD,WAAK,MAAM,KAAK,IAAI,SAAS,KAAK,CAAC;AAEnC,YAAM,CAAC,MAAM,QAAQ,KAAK,IAAI,OAAO,MAAM,GAAG;AAC9C,UAAI,QAAQ,WAAW,aAAa,UAAU,QAAW;AACvD,aAAK,QAAQ,KAAK,IAAI;AACtB;AAAA,MACF;AACA,UAAI,QAAQ,UAAU,UAAU,UAAa,aAAa,IAAI,MAAM,GAAG;AACrE,cAAM,OAAO,OAAO,SAAS,OAAO,EAAE;AACtC,YAAI,OAAO,cAAc,IAAI,KAAK,QAAQ,GAAG;AAC3C,eAAK,UAAU,EAAE,KAAK,MAAM,MAAM,QAAyB,KAAK;AAChE;AAAA,QACF;AAAA,MACF;AACA,YAAM,IAAI;AAAA,QACR,uCAAuC,KAAK,UAAU,MAAM,CAAC;AAAA,QAC7D;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAaO,IAAM,gBAAN,MAAoB;AAAA,EACzB,YAEkB,UAChB;AADgB;AAAA,EACf;AAAA,EADe;AAAA;AAAA,EAIlB,MAAc,IACZ,MACA,OAAsC,CAAC,GACQ;AAC/C,QAAI;AACF,YAAM,EAAE,OAAO,IAAI,MAAM,cAAc,OAAO,MAAM;AAAA,QAClD,KAAK,KAAK;AAAA,QACV,WAAW;AAAA,QACX,UAAU;AAAA,MACZ,CAAC;AACD,aAAO,EAAE,QAAQ,UAAU,EAAE;AAAA,IAC/B,SAAS,KAAK;AACZ,YAAM,IAAI;AAKV,YAAM,WAAW,OAAO,EAAE,SAAS,WAAW,EAAE,OAAO;AACvD,UAAI,aAAa,UAAa,KAAK,gBAAgB,SAAS,QAAQ,GAAG;AACrE,eAAO,EAAE,QAAQ,EAAE,UAAU,IAAI,SAAS;AAAA,MAC5C;AACA,YAAM,IAAI;AAAA,QACR,OAAO,KAAK,CAAC,CAAC,UAAU,aAAa,SAAY,UAAU,QAAQ,MAAM,EAAE,MACrE,EAAE,UAAU,EAAE,WAAW,IAAI,KAAK,CAAC;AAAA,QACzC;AAAA,SACC,EAAE,UAAU,IAAI,KAAK;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,WAA8B;AAClC,UAAM,SAAS;AACf,UAAM,CAAC,SAAS,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC3C,KAAK,IAAI,CAAC,gBAAgB,YAAY,MAAM,IAAI,cAAc,WAAW,CAAC;AAAA;AAAA,MAE1E,KAAK,IAAI,CAAC,gBAAgB,WAAW,MAAM,GAAG,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC;AAAA,IACvE,CAAC;AAED,UAAM,OAAiB,CAAC;AACxB,eAAW,QAAQ,QAAQ,OAAO,MAAM,IAAI,GAAG;AAC7C,UAAI,CAAC,KAAM;AACX,YAAM,CAAC,SAAS,KAAK,YAAY,MAAM,IAAI,KAAK,MAAM,IAAI;AAC1D,UAAI,CAAC,WAAW,CAAC,OAAO,CAAC,cAAc,CAAC,aAAa,IAAI,UAAU,GAAG;AACpE,cAAM,IAAI,SAAS,iCAAiC,KAAK,UAAU,IAAI,CAAC,IAAI,QAAW,EAAE;AAAA,MAC3F;AACA,WAAK,KAAK;AAAA,QACR;AAAA,QACA;AAAA,QACA,MAAM;AAAA,QACN,GAAI,SAAS,EAAE,WAAW,OAAO,IAAI,CAAC;AAAA,MACxC,CAAC;AAAA,IACH;AAEA,UAAM,OAAO,QAAQ,aAAa,IAAI,QAAQ,OAAO,KAAK,KAAK,SAAY;AAC3E,WAAO,EAAE,MAAM,KAAK;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,eAAe,MAAgB,MAAmC;AACtE,UAAM,UAAU,MAAM,KAAK,wBAAwB,MAAM,IAAI;AAC7D,WAAO,QAAQ,IAAI,CAAC,MAAM,EAAE,GAAG;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,wBACJ,MACA,MAC2B;AAC3B,eAAW,KAAK,KAAM,gBAAe,GAAG,MAAM;AAC9C,eAAW,KAAK,KAAM,gBAAe,GAAG,MAAM;AAC9C,QAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/B,UAAM,aAAa,MAAM,KAAK,eAAe,IAAI;AAEjD,UAAM,OAAO,CAAC,YAAY,aAAa,GAAG,IAAI;AAC9C,QAAI,WAAW,SAAS,EAAG,MAAK,KAAK,SAAS,GAAG,UAAU;AAC3D,SAAK,KAAK,IAAI;AACd,UAAM,EAAE,OAAO,IAAI,MAAM,KAAK,IAAI,IAAI;AAEtC,UAAM,UAA4B,CAAC;AACnC,eAAW,QAAQ,OAAO,MAAM,IAAI,GAAG;AACrC,UAAI,CAAC,KAAM;AAEX,YAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,UAAI,aAAa,IAAI;AACnB,gBAAQ,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,MAC5B,OAAO;AACL,cAAM,OAAO,KAAK,MAAM,WAAW,CAAC;AACpC,gBAAQ,KAAK;AAAA,UACX,KAAK,KAAK,MAAM,GAAG,QAAQ;AAAA,UAC3B,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,QACzB,CAAC;AAAA,MACH;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,UAAU,KAAuD;AACrE,mBAAe,KAAK,KAAK;AACzB,UAAM,EAAE,OAAO,IAAI,MAAM,KAAK,IAAI,CAAC,WAAW,MAAM,MAAM,KAAK,IAAI,CAAC;AACpE,UAAM,QAAyC,CAAC;AAChD,eAAW,UAAU,OAAO,MAAM,IAAI,GAAG;AACvC,UAAI,CAAC,OAAQ;AAEb,YAAM,MAAM,OAAO,QAAQ,GAAI;AAC/B,UAAI,QAAQ,IAAI;AACd,cAAM,IAAI;AAAA,UACR,8BAA8B,KAAK,UAAU,MAAM,CAAC;AAAA,UACpD;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,YAAM,OAAO,OAAO,MAAM,GAAG,GAAG;AAChC,YAAM,OAAO,OAAO,MAAM,MAAM,CAAC;AACjC,YAAM,CAAC,EAAE,MAAM,GAAG,IAAI,KAAK,MAAM,GAAG;AACpC,UAAI,SAAS,OAAQ;AACrB,UAAI,CAAC,OAAO,CAAC,YAAY,KAAK,GAAG,GAAG;AAClC,cAAM,IAAI;AAAA,UACR,iCAAiC,KAAK,UAAU,MAAM,CAAC;AAAA,UACvD;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,YAAM,KAAK,EAAE,MAAM,IAAI,CAAC;AAAA,IAC1B;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,aAAa,MAAgB,OAAgC;AACnE,WAAO,IAAI,QAAgB,CAAC,SAAS,WAAW;AAC9C,YAAM,QAAQ,MAAM,OAAO,MAAM;AAAA,QAC/B,KAAK,KAAK;AAAA,QACV,OAAO,CAAC,QAAQ,QAAQ,MAAM;AAAA,MAChC,CAAC;AACD,YAAM,MAAgB,CAAC;AACvB,UAAI,SAAS;AACb,YAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB,IAAI,KAAK,KAAK,CAAC;AAC1D,YAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,kBAAU,MAAM,SAAS,OAAO;AAAA,MAClC,CAAC;AACD,YAAM,GAAG,SAAS,CAAC,QAAQ;AACzB,eAAO,IAAI,SAAS,uBAAuB,KAAK,CAAC,CAAC,KAAK,IAAI,OAAO,IAAI,QAAW,EAAE,CAAC;AAAA,MACtF,CAAC;AACD,YAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,YAAI,SAAS,GAAG;AACd,iBAAO;AAAA,YACL,IAAI,SAAS,OAAO,KAAK,CAAC,CAAC,iBAAiB,IAAI,MAAM,OAAO,KAAK,CAAC,IAAI,QAAQ,QAAW,OAAO,KAAK,CAAC;AAAA,UACzG;AAAA,QACF;AACA,gBAAQ,OAAO,OAAO,GAAG,CAAC;AAAA,MAC5B,CAAC;AACD,YAAM,MAAM,GAAG,SAAS,MAAM;AAAA,MAE9B,CAAC;AACD,YAAM,MAAM,MAAM,KAAK;AACvB,YAAM,MAAM,IAAI;AAAA,IAClB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAc,eAAe,MAAmC;AAC9D,QAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAC/B,UAAM,EAAE,QAAQ,IAAI,MAAM,KAAK,WAAW,IAAI;AAC9C,UAAM,aAAa,IAAI,IAAI,OAAO;AAClC,WAAO,KAAK,OAAO,CAAC,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;AAAA,EAC9C;AAAA;AAAA,EAGA,MAAc,WAAW,OAAiD;AACxE,UAAM,SAAS,MAAM,KAAK;AAAA,MACxB,CAAC,YAAY,eAAe;AAAA,MAC5B,MAAM,KAAK,IAAI,IAAI;AAAA,IACrB;AACA,UAAM,UAAoB,CAAC;AAC3B,eAAW,QAAQ,OAAO,SAAS,OAAO,EAAE,MAAM,IAAI,GAAG;AACvD,UAAI,KAAK,SAAS,UAAU,EAAG,SAAQ,KAAK,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,CAAC;AAAA,IAC/E;AACA,WAAO,EAAE,QAAQ;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,YAAY,MAA4C;AAC5D,eAAW,OAAO,KAAM,eAAc,KAAK,KAAK;AAChD,QAAI,KAAK,WAAW,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,SAAS,CAAC,EAAE;AAEzD,UAAM,SAAS,MAAM,KAAK;AAAA,MACxB,CAAC,YAAY,eAAe;AAAA,MAC5B,KAAK,KAAK,IAAI,IAAI;AAAA,IACpB;AAEA,UAAM,UAAwB,CAAC;AAC/B,UAAM,UAAoB,CAAC;AAC3B,eAAW,QAAQ,OAAO,SAAS,OAAO,EAAE,MAAM,IAAI,GAAG;AACvD,UAAI,CAAC,KAAM;AACX,UAAI,KAAK,SAAS,UAAU,GAAG;AAC7B,gBAAQ,KAAK,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,CAAC;AAC9C;AAAA,MACF;AACA,YAAM,CAAC,KAAK,MAAM,OAAO,IAAI,KAAK,MAAM,GAAG;AAC3C,YAAM,OAAO,OAAO,SAAS,WAAW,IAAI,EAAE;AAC9C,UACE,CAAC,OACD,CAAC,QACD,CAAC,aAAa,IAAI,IAAI,KACtB,CAAC,OAAO,cAAc,IAAI,KAC1B,OAAO,GACP;AACA,cAAM,IAAI;AAAA,UACR,2CAA2C,KAAK,UAAU,IAAI,CAAC;AAAA,UAC/D;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,cAAQ,KAAK,EAAE,KAAK,MAA6B,KAAK,CAAC;AAAA,IACzD;AACA,WAAO,EAAE,SAAS,QAAQ;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,YAAY,MAA4C;AAC5D,eAAW,OAAO,KAAM,eAAc,KAAK,KAAK;AAChD,QAAI,KAAK,WAAW,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,SAAS,CAAC,EAAE;AAEzD,UAAM,SAAS,IAAI,YAAY;AAC/B,UAAM,IAAI,QAAc,CAAC,SAAS,WAAW;AAC3C,YAAM,QAAQ,MAAM,OAAO,CAAC,YAAY,SAAS,GAAG;AAAA,QAClD,KAAK,KAAK;AAAA,QACV,OAAO,CAAC,QAAQ,QAAQ,MAAM;AAAA,MAChC,CAAC;AAED,UAAI,SAAS;AACb,UAAI,aAA2B;AAE/B,YAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,kBAAU,MAAM,SAAS,OAAO;AAAA,MAClC,CAAC;AACD,YAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,YAAI,WAAY;AAChB,YAAI;AACF,iBAAO,KAAK,KAAK;AAAA,QACnB,SAAS,KAAK;AACZ,uBAAa;AACb,gBAAM,KAAK;AAAA,QACb;AAAA,MACF,CAAC;AACD,YAAM,GAAG,SAAS,CAAC,QAAQ;AACzB,eAAO,IAAI,SAAS,iCAAiC,IAAI,OAAO,IAAI,QAAW,EAAE,CAAC;AAAA,MACpF,CAAC;AACD,YAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,YAAI,WAAY,QAAO,OAAO,UAAU;AACxC,YAAI,SAAS,GAAG;AACd,iBAAO;AAAA,YACL,IAAI,SAAS,qCAAqC,IAAI,MAAM,OAAO,KAAK,CAAC,IAAI,QAAQ,QAAW,OAAO,KAAK,CAAC;AAAA,UAC/G;AAAA,QACF;AACA,YAAI,CAAC,OAAO,WAAW,GAAG;AACxB,iBAAO;AAAA,YACL,IAAI,SAAS,gDAAgD,QAAQ,QAAW,OAAO,KAAK,CAAC;AAAA,UAC/F;AAAA,QACF;AACA,gBAAQ;AAAA,MACV,CAAC;AAED,YAAM,MAAM,GAAG,SAAS,MAAM;AAAA,MAE9B,CAAC;AACD,YAAM,MAAM,MAAM,KAAK,KAAK,IAAI,IAAI,IAAI;AACxC,YAAM,MAAM,IAAI;AAAA,IAClB,CAAC;AAED,WAAO,EAAE,SAAS,OAAO,SAAS,SAAS,OAAO,QAAQ;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,WAAW,GAAW,GAA6B;AACvD,mBAAe,GAAG,oBAAoB;AACtC,mBAAe,GAAG,sBAAsB;AACxC,UAAM,EAAE,SAAS,IAAI,MAAM,KAAK;AAAA,MAC9B,CAAC,cAAc,iBAAiB,GAAG,CAAC;AAAA,MACpC,EAAE,gBAAgB,CAAC,CAAC,EAAE;AAAA,IACxB;AACA,WAAO,aAAa;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YAAY,OAAgC;AAChD,gBAAY,OAAO,OAAO;AAC1B,UAAM,EAAE,OAAO,IAAI,MAAM,KAAK,IAAI,CAAC,gBAAgB,YAAY,OAAO,IAAI,CAAC;AAC3E,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,cAAc,MAAgD;AAClE,eAAW,OAAO,KAAM,eAAc,KAAK,KAAK;AAChD,QAAI,KAAK,WAAW,EAAG,QAAO,oBAAI,IAAI;AACtC,UAAM,EAAE,OAAO,IAAI,MAAM,KAAK,IAAI;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH;AAAA,IACF,CAAC;AACD,UAAM,UAAU,oBAAI,IAAsB;AAC1C,eAAW,QAAQ,OAAO,MAAM,IAAI,GAAG;AACrC,UAAI,CAAC,KAAM;AACX,YAAM,CAAC,KAAK,GAAG,IAAI,IAAI,KAAK,MAAM,GAAG;AACrC,UAAI,CAAC,OAAO,CAAC,YAAY,KAAK,GAAG,KAAK,KAAK,KAAK,CAAC,MAAM,CAAC,YAAY,KAAK,CAAC,CAAC,GAAG;AAC5E,cAAM,IAAI;AAAA,UACR,uCAAuC,KAAK,UAAU,IAAI,CAAC;AAAA,UAC3D;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,cAAQ,IAAI,KAAK,IAAI;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WAAW,MAA+B;AAC9C,mBAAe,MAAM,UAAU;AAC/B,UAAM,EAAE,OAAO,IAAI,MAAM,KAAK,IAAI,CAAC,aAAa,YAAY,WAAW,IAAI,CAAC;AAC5E,UAAM,MAAM,OAAO,KAAK;AACxB,QAAI,CAAC,YAAY,KAAK,GAAG,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,qDAAqD,KAAK,UAAU,IAAI,CAAC,KAAK,KAAK,UAAU,GAAG,CAAC;AAAA,QACjG;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;;;ACvjBO,IAAM,sBAAsB;AAO5B,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAC9C,YAEkB,SAChB;AACA;AAAA,MACE,GAAG,QAAQ,MAAM,yHAEf,QAAQ,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,QAAQ,EAAE,IAAI,GAAG,EAAE,KAAK,IAAI,IACvD;AAAA,IACJ;AAPgB;AAQhB,SAAK,OAAO;AAAA,EACd;AAAA,EATkB;AAUpB;AAMA,IAAMA,gBAAyC;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAOO,SAAS,iBACd,aACA,OACsB;AACtB,QAAM,OAAO,OAAO,KAAK,KAAK;AAC9B,aAAW,QAAQA,eAAc;AAC/B,QAAI,cAAc,MAAM,IAAI,EAAE,QAAQ,aAAa;AACjD,aAAO,EAAE,KAAK,aAAa,MAAM,KAAK;AAAA,IACxC;AAAA,EACF;AACA,SAAO;AACT;AAUA,eAAsB,aACpB,MACA,UAA+B,CAAC,GACJ;AAC5B,MAAI,CAAC,mBAAmB,IAAI,EAAG,QAAO;AACtC,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,UAAU,QAAQ,WAAY;AACpC,QAAM,YAAY,QAAQ,aAAa;AAEvC,aAAW,WAAW,UAAU;AAC9B,QAAI;AACF,YAAM,WAAW,MAAM,QAAQ,GAAG,OAAO,IAAI,IAAI,IAAI;AAAA,QACnD,QAAQ,YAAY,QAAQ,SAAS;AAAA,MACvC,CAAC;AACD,UAAI,CAAC,SAAS,GAAI;AAClB,aAAO,IAAI,WAAW,MAAM,SAAS,YAAY,CAAC;AAAA,IACpD,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAWA,eAAsB,mBACpB,SACA,UAA2B,CAAC,GACH;AACzB,QAAM,QAAQ,CAAC,GAAG,OAAO;AACzB,QAAM,QAAQ,MAAM;AACpB,QAAM,cAAc,KAAK,IAAI,GAAG,QAAQ,eAAe,mBAAmB;AAE1E,QAAM,UAAU,oBAAI,IAA2B;AAC/C,QAAM,cAA+C,CAAC;AACtD,QAAM,UAA2C,CAAC;AAClD,MAAI,OAAO;AAEX,QAAM,SAAS,YAA2B;AACxC,eAAS;AACP,YAAM,OAAO,MAAM,MAAM;AACzB,UAAI,CAAC,KAAM;AACX,YAAM,CAAC,KAAK,IAAI,IAAI;AACpB,YAAM,QAAQ,MAAM,aAAa,MAAM,OAAO;AAC9C,UAAI,UAAU,MAAM;AAClB,oBAAY,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,MAChC,OAAO;AACL,cAAM,WAAW,iBAAiB,KAAK,KAAK;AAC5C,YAAI,aAAa,MAAM;AACrB,kBAAQ,KAAK,EAAE,KAAK,KAAK,CAAC;AAAA,QAC5B,OAAO;AACL,kBAAQ,IAAI,KAAK,QAAQ;AAAA,QAC3B;AAAA,MACF;AACA,cAAQ;AACR,cAAQ,WAAW,MAAM,KAAK;AAAA,IAChC;AAAA,EACF;AAEA,QAAM,QAAQ;AAAA,IACZ,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,aAAa,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC;AAAA,EACrE;AAEA,MAAI,QAAQ,SAAS,EAAG,OAAM,IAAI,qBAAqB,OAAO;AAC9D,SAAO,EAAE,SAAS,YAAY;AAChC;AAMA,IAAMC,eAAc;AAGpB,IAAM,eAAe;AAErB,SAAS,WAAW,OAA2B;AAC7C,MAAI,MAAM;AACV,aAAW,QAAQ,MAAO,QAAO,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAClE,SAAO;AACT;AAWO,SAAS,eAAe,QAAiC;AAC9D,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aAAO,CAAC;AAAA,IACV,KAAK,QAAQ;AACX,YAAM,OAAiB,CAAC;AACxB,YAAM,OAAO,OAAO;AACpB,UAAI,SAAS;AACb,aAAO,SAAS,KAAK,QAAQ;AAC3B,cAAM,WAAW,KAAK,QAAQ,IAAM,MAAM;AAC1C,YAAI,aAAa,GAAI;AACrB,cAAM,OAAO,KAAK,SAAS,QAAQ,QAAQ,EAAE,SAAS,OAAO;AAC7D,cAAM,SAAS,KAAK,QAAQ,GAAM,WAAW,CAAC;AAC9C,YAAI,WAAW,MAAM,SAAS,KAAK,KAAK,OAAQ;AAChD,cAAM,MAAM,WAAW,KAAK,SAAS,SAAS,GAAG,SAAS,EAAE,CAAC;AAC7D,YAAI,SAAS,aAAc,MAAK,KAAK,GAAG;AACxC,iBAAS,SAAS;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAAA,IACA,KAAK,UAAU;AACb,YAAM,OAAiB,CAAC;AACxB,YAAM,OAAO,OAAO,KAAK,SAAS,OAAO;AACzC,YAAM,YAAY,KAAK,QAAQ,MAAM;AACrC,YAAM,SAAS,cAAc,KAAK,OAAO,KAAK,MAAM,GAAG,SAAS;AAChE,iBAAW,QAAQ,OAAO,MAAM,IAAI,GAAG;AACrC,YAAI,KAAK,WAAW,OAAO,EAAG,MAAK,KAAK,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,iBACnD,KAAK,WAAW,SAAS,EAAG,MAAK,KAAK,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,MACrE;AACA,aAAO,KAAK,OAAO,CAAC,QAAQA,aAAY,KAAK,GAAG,CAAC;AAAA,IACnD;AAAA,IACA,KAAK,OAAO;AACV,YAAM,OAAO,OAAO,KAAK,SAAS,OAAO;AACzC,YAAM,QAAQ,2BAA2B,KAAK,IAAI;AAClD,aAAO,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AACF;AAiBO,SAAS,YACd,MACA,SACA,iBAAsC,oBAAI,IAAI,GAC/B;AACf,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;AAE/B,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,UAAU,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,EAAG;AAC5C,QAAI,eAAe,IAAI,GAAG,EAAG;AAC7B,UAAM,SAAS,QAAQ,IAAI,GAAG;AAC9B,QAAI,CAAC,QAAQ;AACX,cAAQ,IAAI,GAAG;AACf;AAAA,IACF;AACA,cAAU,IAAI,GAAG;AACjB,eAAW,OAAO,eAAe,MAAM,GAAG;AACxC,UAAI,CAAC,UAAU,IAAI,GAAG,KAAK,CAAC,QAAQ,IAAI,GAAG,EAAG,OAAM,KAAK,GAAG;AAAA,IAC9D;AAAA,EACF;AAEA,SAAO,EAAE,WAAW,SAAS,CAAC,GAAG,OAAO,EAAE;AAC5C;;;AC7PA,IAAM,aAAa;AAGnB,eAAsB,mBACpB,SACmC;AACnC,QAAM,EAAE,MAAM,WAAW,eAAe,IAAI;AAC5C,QAAM,UAAU,QAAQ,kBAAkB,oBAAI,IAAY;AAG1D,QAAM,QAAQ,IAAI,IAAoB,SAAS;AAE/C,QAAM,gBAAgB,oBAAI,IAAY;AAEtC,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,QAAM,UAAU,oBAAI,IAA2B;AAG/C,QAAM,UAA8B,CAAC;AACrC,aAAW,CAAC,KAAK,IAAI,KAAK,OAAO;AAC/B,QAAI,CAAC,QAAQ,IAAI,GAAG,EAAG,SAAQ,KAAK,CAAC,KAAK,IAAI,CAAC;AAAA,EACjD;AACA,QAAM,OAAO,MAAM,mBAAmB,SAAS,OAAO;AACtD,aAAW,CAAC,KAAK,MAAM,KAAK,KAAK,QAAS,SAAQ,IAAI,KAAK,MAAM;AACjE,aAAW,EAAE,KAAK,KAAK,KAAK,KAAK,YAAa,gBAAe,IAAI,KAAK,IAAI;AAG1E,WAAS,OAAO,GAAG,OAAO,YAAY,QAAQ;AAC5C,UAAM,UAAU,YAAY,MAAM,SAAS,OAAO;AAClD,UAAM,OAAO,QAAQ,QAAQ,OAAO,CAAC,QAAQ,CAAC,eAAe,IAAI,GAAG,CAAC;AACrE,QAAI,KAAK,WAAW,EAAG;AAGvB,UAAM,YAAY,KAAK;AAAA,MACrB,CAAC,QAAQ,CAAC,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,IAAI,GAAG;AAAA,IACpD;AACA,eAAW,OAAO,UAAW,eAAc,IAAI,GAAG;AAClD,QAAI,UAAU,SAAS,GAAG;AACxB,YAAM,WAAW,MAAM,eAAe,SAAS;AAC/C,iBAAW,CAAC,KAAK,IAAI,KAAK,SAAU,OAAM,IAAI,KAAK,IAAI;AAAA,IACzD;AAGA,UAAM,QAA4B,CAAC;AACnC,eAAW,OAAO,MAAM;AACtB,YAAM,OAAO,MAAM,IAAI,GAAG;AAC1B,UAAI,SAAS,UAAa,CAAC,QAAQ,IAAI,GAAG,EAAG,OAAM,KAAK,CAAC,KAAK,IAAI,CAAC;AAAA,IACrE;AACA,QAAI,MAAM,WAAW,EAAG;AACxB,UAAM,SAAS,MAAM,mBAAmB,OAAO,OAAO;AACtD,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAS,SAAQ,IAAI,KAAK,MAAM;AACnE,eAAW,EAAE,KAAK,KAAK,KAAK,OAAO;AACjC,qBAAe,IAAI,KAAK,IAAI;AAC9B,QAAI,OAAO,QAAQ,SAAS,EAAG;AAAA,EACjC;AASA,MAAI,eAAe,YAAY,MAAM,SAAS,OAAO;AACrD,MACE,aAAa,QAAQ,SAAS,cAAc,KAC5C,CAAC,QAAQ,IAAI,cAAc,GAC3B;AACA,YAAQ,IAAI,gBAAgB;AAAA,MAC1B,KAAK;AAAA,MACL,MAAM;AAAA,MACN,MAAM,OAAO,MAAM,CAAC;AAAA,IACtB,CAAC;AACD,mBAAe,YAAY,MAAM,SAAS,OAAO;AAAA,EACnD;AAGA,QAAM,UAA2B,aAAa,QAAQ,IAAI,CAAC,SAAS;AAAA,IAClE;AAAA,IACA,MAAM,MAAM,IAAI,GAAG,KAAK;AAAA,EAC1B,EAAE;AACF,QAAM,YAAY,aAAa;AAC/B,QAAM,qBAAqB,CAAC,GAAG,cAAc,EAC1C;AAAA,IACC,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,IAAI,GAAG,KAAK,CAAC,aAAa,QAAQ,SAAS,GAAG;AAAA,EACtE,EACC,IAAI,CAAC,CAAC,KAAK,IAAI,OAAO,EAAE,KAAK,KAAK,EAAE;AAEvC,SAAO,EAAE,SAAS,SAAS,mBAAmB;AAChD;AAMO,SAAS,sBACd,SACA,SACQ;AACR,QAAM,SAAS,QACZ,MAAM,GAAG,EAAE,EACX;AAAA,IACC,CAAC,MACC,KAAK,EAAE,GAAG,GAAG,EAAE,OAAO,SAAS,EAAE,IAAI,MAAM,yBAAyB;AAAA,EACxE,EACC,KAAK,IAAI;AACZ,QAAM,OACJ,QAAQ,SAAS,KAAK;AAAA,eAAa,QAAQ,SAAS,EAAE,UAAU;AAClE,SACE,GAAG,OAAO,KAAK,QAAQ,MAAM;AAAA,EAC1B,MAAM,GAAG,IAAI;AAAA;AAKpB;;;AC9JA,SAAS,YAAAC,WAAU,SAAAC,cAAa;AAChC,SAAS,aAAAC,kBAAiB;AAG1B,IAAMC,iBAAgBD,WAAUF,SAAQ;AAGjC,IAAM,2BAAN,cAAuC,MAAM;AAAA,EAClD,YACkB,aACA,YAChB;AACA;AAAA,MACE,yBAAyB,UAAU,UAAU,WAAW;AAAA,IAE1D;AANgB;AACA;AAMhB,SAAK,OAAO;AAAA,EACd;AAAA,EARkB;AAAA,EACA;AAQpB;AAGA,IAAMI,eAAc;AAUb,SAAS,cAAc,SAA0B;AACtD,MAAI,CAAC,QAAQ,WAAW,OAAO,KAAK,QAAQ,SAAS,KAAM,QAAO;AAElE,MAAI,gCAAgC,KAAK,OAAO,EAAG,QAAO;AAC1D,MAAI,QAAQ,SAAS,IAAI,KAAK,QAAQ,SAAS,IAAI,EAAG,QAAO;AAC7D,MAAI,QAAQ,SAAS,GAAG,KAAK,QAAQ,SAAS,GAAG,EAAG,QAAO;AAC3D,aAAW,QAAQ,QAAQ,MAAM,GAAG,GAAG;AACrC,QAAI,SAAS,MAAM,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,GAAG;AAC5D,aAAO;AACT,QAAI,KAAK,SAAS,OAAO,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,SAAuB;AAChD,MAAI,CAAC,cAAc,OAAO,GAAG;AAC3B,UAAM,IAAI;AAAA,MACR,sCAAsC,KAAK,UAAU,OAAO,CAAC;AAAA,IAC/D;AAAA,EACF;AACF;AAEA,SAASC,eAAc,KAAmB;AACxC,MAAI,CAACD,aAAY,KAAK,GAAG,GAAG;AAC1B,UAAM,IAAI,MAAM,4BAA4B,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,EACnE;AACF;AAGA,eAAsB,OACpB,UACA,MACiB;AACjB,MAAI;AACF,UAAM,EAAE,OAAO,IAAI,MAAMD,eAAc,OAAO,MAAM;AAAA,MAClD,KAAK;AAAA,MACL,UAAU;AAAA,MACV,WAAW,KAAK,OAAO;AAAA,IACzB,CAAC;AACD,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,UAAM,IAAI;AAKV,UAAM,IAAI;AAAA,MACR,OAAO,KAAK,CAAC,CAAC,UAAU,OAAO,EAAE,SAAS,WAAW,UAAU,EAAE,IAAI,MAAM,EAAE,MACvE,EAAE,UAAU,EAAE,WAAW,IAAI,KAAK,CAAC;AAAA,IAC3C;AAAA,EACF;AACF;AAMA,eAAsB,eACpB,UACA,QACe;AACf,EAAAE,eAAc,OAAO,GAAG;AACxB,QAAM,UAAU,MAAM,IAAI,QAAgB,CAAC,SAAS,WAAW;AAC7D,UAAM,QAAQJ;AAAA,MACZ;AAAA,MACA,CAAC,eAAe,MAAM,WAAW,MAAM,OAAO,IAAI;AAAA,MAClD,EAAE,KAAK,UAAU,OAAO,CAAC,QAAQ,QAAQ,MAAM,EAAE;AAAA,IACnD;AACA,QAAI,SAAS;AACb,QAAI,SAAS;AACb,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,OAAO;AAAA,IAClC,CAAC;AACD,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,OAAO;AAAA,IAClC,CAAC;AACD,UAAM,GAAG,SAAS,CAAC,QAAQ;AACzB,aAAO,IAAI,MAAM,oCAAoC,IAAI,OAAO,EAAE,CAAC;AAAA,IACrE,CAAC;AACD,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,SAAS,GAAG;AACd,eAAO;AAAA,UACL,IAAI,MAAM,gCAAgC,IAAI,MAAM,OAAO,KAAK,CAAC,EAAE;AAAA,QACrE;AAAA,MACF;AACA,cAAQ,OAAO,KAAK,CAAC;AAAA,IACvB,CAAC;AACD,UAAM,MAAM,GAAG,SAAS,MAAM;AAAA,IAE9B,CAAC;AACD,UAAM,MAAM,MAAM,OAAO,IAAI;AAC7B,UAAM,MAAM,IAAI;AAAA,EAClB,CAAC;AACD,MAAI,YAAY,OAAO,KAAK;AAC1B,UAAM,IAAI,yBAAyB,OAAO,KAAK,OAAO;AAAA,EACxD;AACF;AAGA,eAAsB,gBACpB,UACA,SACiB;AACjB,MAAI,QAAQ;AACZ,aAAW,UAAU,SAAS;AAC5B,UAAM,eAAe,UAAU,MAAM;AACrC,aAAS;AAAA,EACX;AACA,SAAO;AACT;AAGA,eAAsB,UACpB,UACA,SACA,KACe;AACf,oBAAkB,OAAO;AACzB,EAAAI,eAAc,GAAG;AACjB,QAAM,OAAO,UAAU,CAAC,cAAc,SAAS,GAAG,CAAC;AACrD;AAGA,eAAsB,cACpB,UACA,SACe;AACf,oBAAkB,OAAO;AACzB,QAAM,OAAO,UAAU,CAAC,gBAAgB,QAAQ,OAAO,CAAC;AAC1D;;;ACxKA,IAAM,iBAAiB;AAEvB,SAAS,cAAc,QAA0B;AAC/C,QAAM,MAAM,CAAC,WAAY,WAAY,WAAY,YAAY,SAAU;AACvE,MAAI,MAAM;AACV,aAAW,KAAK,QAAQ;AACtB,UAAM,IAAI,OAAO;AACjB,WAAQ,MAAM,aAAc,IAAK;AACjC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAQ,KAAK,IAAK,IAAK,IAAI,CAAC,IAAe;AAAA,IAC7C;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,KAAuB;AAC9C,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,KAAK,IAAI,WAAW,CAAC,KAAK,CAAC;AAAA,EACjC;AACA,MAAI,KAAK,CAAC;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,KAAK,IAAI,WAAW,CAAC,IAAI,EAAE;AAAA,EACjC;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,KAAa,MAA0B;AACnE,QAAM,SAAS,gBAAgB,GAAG,EAAE,OAAO,IAAI,EAAE,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;AAC1E,QAAM,UAAU,cAAc,MAAM,IAAI;AACxC,QAAM,MAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,KAAM,WAAY,KAAK,IAAI,KAAO,EAAE;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,YACP,MACA,UACA,QACA,KACU;AACV,MAAI,MAAM;AACV,MAAI,OAAO;AACX,QAAM,MAAgB,CAAC;AACvB,QAAM,QAAQ,KAAK,UAAU;AAC7B,aAAW,SAAS,MAAM;AACxB,UAAO,OAAO,WAAY;AAC1B,YAAQ;AACR,WAAO,QAAQ,QAAQ;AACrB,cAAQ;AACR,UAAI,KAAM,OAAO,OAAQ,IAAI;AAAA,IAC/B;AAAA,EACF;AACA,MAAI,OAAO,OAAO,GAAG;AACnB,QAAI,KAAM,OAAQ,SAAS,OAAS,IAAI;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,WAAW,KAAuB;AACzC,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG;AACtC,UAAM,KAAK,SAAS,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AAAA,EAC9C;AACA,SAAO;AACT;AAGO,SAAS,UAAU,WAA2B;AACnD,QAAM,MAAM;AACZ,QAAM,QAAQ,WAAW,SAAS;AAClC,QAAM,QAAQ,YAAY,OAAO,GAAG,GAAG,IAAI;AAC3C,QAAM,WAAW,qBAAqB,KAAK,KAAK;AAChD,QAAM,WAAW,MAAM,OAAO,QAAQ;AACtC,SAAO,MAAM,MAAM,SAAS,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE;AACnE;AAMO,SAAS,UAAU,MAAsB;AAC9C,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,UAAU,QAAQ,KAAK,YAAY,MAAM,MAAM;AACjD,UAAM,IAAI,MAAM,kBAAkB;AAAA,EACpC;AACA,MAAI,CAAC,MAAM,WAAW,OAAO,GAAG;AAC9B,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AACA,MAAI,MAAM,WAAW,IAAI;AACvB,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC;AAEA,QAAM,OAAiB,CAAC;AACxB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,MAAM,eAAe,QAAQ,MAAM,CAAC,CAAW;AACrD,QAAI,QAAQ,GAAI,OAAM,IAAI,MAAM,yBAAyB;AACzD,SAAK,KAAK,GAAG;AAAA,EACf;AAGA,QAAM,cAAc,gBAAgB,MAAM;AAC1C,MAAI,cAAc,YAAY,OAAO,IAAI,CAAC,MAAM,GAAG;AACjD,UAAM,IAAI,MAAM,wBAAwB;AAAA,EAC1C;AAGA,QAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;AAC9B,QAAM,QAAQ,YAAY,OAAO,GAAG,GAAG,KAAK;AAE5C,MAAI,MAAM,WAAW,IAAI;AACvB,UAAM,IAAI,MAAM,2BAA2B;AAAA,EAC7C;AAGA,QAAM,YAAY,MAAM,SAAS;AACjC,QAAM,eAAe,YAAY,MAAM,SAAS;AAChD,MAAI,eAAe,GAAG;AACpB,UAAM,WAAW,MAAM,MAAM,SAAS,CAAC;AACvC,UAAM,QAAQ,KAAK,gBAAgB;AACnC,SAAK,WAAW,UAAU,GAAG;AAC3B,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AAAA,EACF;AAEA,SAAO,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAClE;AAEA,IAAM,WAAW;AAMV,SAAS,WAAW,OAAuB;AAChD,MAAI,SAAS,KAAK,KAAK,EAAG,QAAO;AACjC,MAAI,MAAM,WAAW,OAAO,GAAG;AAC7B,QAAI;AACF,aAAO,UAAU,KAAK;AAAA,IACxB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,iBAAiB,KAAK,UAAU,KAAK,CAAC,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC7F;AAAA,IACF;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR,iBAAiB,KAAK,UAAU,KAAK,CAAC;AAAA,EACxC;AACF;;;ACiGO,SAAS,qBAAqB,MAAgC;AACnE,SAAO;AAAA,IACL,aAAa,KAAK,SAAS;AAAA,IAC3B,kBAAkB,KAAK,SAAS;AAAA,IAChC,WAAW,KAAK,SAAS,UAAU,SAAS;AAAA,IAC5C,YAAY,KAAK,SAAS;AAAA,IAC1B,WAAW,KAAK,SAAS,UAAU,SAAS;AAAA,IAC5C,UAAU,KAAK,SAAS,SAAS,SAAS;AAAA,IAC1C,GAAI,KAAK,SAAS,oBAAoB,IAClC,EAAE,mBAAmB,KAAK,SAAS,kBAAkB,IACrD,CAAC;AAAA,EACP;AACF;AAGO,SAAS,kBAAkB,MAAqC;AACrE,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb,YAAY,KAAK;AAAA,IACjB,SAAS,KAAK;AAAA,IACd,YAAY,KAAK;AAAA,IACjB,SAAS,KAAK;AAAA,IACd,gBAAgB,OAAO,YAAY,KAAK,cAAc;AAAA,IACtD,gBAAgB,KAAK;AAAA,IACrB,cAAc,KAAK;AAAA,IACnB,UAAU,qBAAqB,IAAI;AAAA,EACrC;AACF;AAOO,SAAS,sBACd,MACA,SACkB;AAClB,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB,SAAS,QAAQ,QAAQ,SAAS;AAAA,IAClC;AAAA,EACF;AACF;AAGO,SAAS,oBACd,MACA,QACiB;AACjB,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb,YAAY,KAAK;AAAA,IACjB,SAAS,OAAO,QAAQ,IAAI,CAAC,OAAO;AAAA,MAClC,KAAK,EAAE;AAAA,MACP,MAAM,EAAE;AAAA,MACR,SAAS,EAAE,QAAQ,SAAS;AAAA,MAC5B,SAAS,EAAE;AAAA,IACb,EAAE;AAAA,IACF,iBAAiB,OAAO,kBACpB;AAAA,MACE,SAAS,OAAO,gBAAgB;AAAA,MAChC,SAAS,OAAO,gBAAgB,QAAQ,SAAS;AAAA,IACnD,IACA;AAAA,IACJ,aAAa;AAAA,MACX,SAAS,OAAO,YAAY;AAAA,MAC5B,SAAS,OAAO,YAAY,QAAQ,SAAS;AAAA,IAC/C;AAAA,IACA,YAAY,OAAO,YAAY,OAAO,UAAU;AAAA,IAChD,cAAc,OAAO,aAAa,SAAS;AAAA,IAC3C,UAAU,qBAAqB,IAAI;AAAA,EACrC;AACF;;;ACnRO,IAAM,sBAAN,cAAkC,MAAM;AAAA,EAC7C,YAEkB,MAChB;AACA;AAAA,MACE,wCAAwC,KACrC,IAAI,CAAC,MAAM,EAAE,OAAO,EACpB,KAAK,IAAI,CAAC;AAAA,IACf;AANgB;AAOhB,SAAK,OAAO;AAAA,EACd;AAAA,EARkB;AASpB;AAyBO,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAC9C,YAEkB,SAChB;AACA;AAAA,MACE,GAAG,QAAQ,MAAM,yBAAyB,eAAe,yBACvD,QAAQ,IAAI,CAAC,MAAM,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,EAAE,IAAI,SAAS,EAAE,KAAK,IAAI;AAAA,IACxE;AALgB;AAMhB,SAAK,OAAO;AAAA,EACd;AAAA,EAPkB;AAQpB;AAyIA,eAAsB,SAAS,SAA6C;AAC1E,QAAM,EAAE,YAAY,aAAa,UAAU,QAAQ,QAAQ,MAAM,IAAI;AACrE,QAAM,iBACJ,QAAQ,kBAAkB,YAAY,eAAe,KAAK,WAAW;AAGvE,QAAM,EAAE,MAAM,MAAM,UAAU,IAAI,MAAM,WAAW,SAAS;AAC5D,QAAM,cAAc,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;AAEhE,MAAI;AACJ,MAAI,QAAQ,SAAS,QAAW;AAC9B,eAAW,QAAQ,KAAK,IAAI,CAAC,SAAS;AACpC,YAAM,MAAM,YAAY,IAAI,IAAI;AAChC,UAAI,CAAC,KAAK;AACR,cAAM,IAAI;AAAA,UACR,OAAO,KAAK,UAAU,IAAI,CAAC;AAAA,QAE7B;AAAA,MACF;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH,OAAO;AACL,eAAW;AAAA,EACb;AAEA,QAAM,aAA0B,CAAC;AACjC,QAAM,WAAgC,CAAC;AACvC,aAAW,OAAO,UAAU;AAC1B,UAAM,YAAY,YAAY,KAAK,IAAI,IAAI,OAAO,KAAK;AACvD,QAAI,cAAc,MAAM;AACtB,iBAAW,KAAK;AAAA,QACd,SAAS,IAAI;AAAA,QACb,UAAU,IAAI;AAAA,QACd;AAAA,QACA,MAAM;AAAA,MACR,CAAC;AACD;AAAA,IACF;AACA,QAAI,cAAc,IAAI,KAAK;AACzB,iBAAW,KAAK;AAAA,QACd,SAAS,IAAI;AAAA,QACb,UAAU,IAAI;AAAA,QACd;AAAA,QACA,MAAM;AAAA,MACR,CAAC;AACD;AAAA,IACF;AACA,QAAI,cAAc;AAClB,QAAI;AACF,oBAAc,MAAM,WAAW,WAAW,WAAW,IAAI,GAAG;AAAA,IAC9D,SAAS,KAAK;AAGZ,UAAI,EAAE,eAAe,UAAW,OAAM;AACtC,oBAAc;AAAA,IAChB;AACA,QAAI,aAAa;AACf,iBAAW,KAAK;AAAA,QACd,SAAS,IAAI;AAAA,QACb,UAAU,IAAI;AAAA,QACd;AAAA,QACA,MAAM;AAAA,MACR,CAAC;AAAA,IACH,WAAW,OAAO;AAChB,iBAAW,KAAK;AAAA,QACd,SAAS,IAAI;AAAA,QACb,UAAU,IAAI;AAAA,QACd;AAAA,QACA,MAAM;AAAA,MACR,CAAC;AAAA,IACH,OAAO;AACL,eAAS,KAAK,EAAE,SAAS,IAAI,SAAS,UAAU,IAAI,KAAK,UAAU,CAAC;AAAA,IACtE;AAAA,EACF;AACA,MAAI,SAAS,SAAS,EAAG,OAAM,IAAI,oBAAoB,QAAQ;AAE/D,QAAM,UAAU,WAAW,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAGhE,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAC5D,QAAM,WAAW,CAAC,GAAG,IAAI,IAAI,YAAY,KAAK,OAAO,CAAC,CAAC;AACvD,QAAM,QACJ,SAAS,SAAS,IACd,MAAM,WAAW,wBAAwB,UAAU,QAAQ,IAC3D,CAAC;AAEP,QAAM,iBAAiB,IAAI,IAAI,YAAY,SAAS;AACpD,MAAI,aAAa,MAAM,OAAO,CAAC,MAAM,CAAC,eAAe,IAAI,EAAE,GAAG,CAAC;AAC/D,MAAI,WAAW,SAAS,GAAG;AAIzB,UAAM,WAAW,MAAM,eAAe,WAAW,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AAClE,eAAW,CAAC,KAAK,IAAI,KAAK,SAAU,gBAAe,IAAI,KAAK,IAAI;AAChE,iBAAa,WAAW,OAAO,CAAC,MAAM,CAAC,eAAe,IAAI,EAAE,GAAG,CAAC;AAAA,EAClE;AAGA,QAAM,YAAY,IAAI,IAAI,WAAW,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AAChE,QAAM,EAAE,SAAS,OAAO,QAAQ,IAAI,MAAM,WAAW;AAAA,IACnD,WAAW,IAAI,CAAC,MAAM,EAAE,GAAG;AAAA,EAC7B;AACA,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI;AAAA,MACR,+DAA+D,QAAQ,KAAK,IAAI,CAAC;AAAA,IACnF;AAAA,EACF;AAeA,QAAM,UAAU,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC;AACtD,QAAM,UAA2B,CAAC;AAClC,QAAM,sBAAuC,CAAC;AAC9C,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,UAAU,IAAI,KAAK,GAAG;AACnC,UAAM,SAAwB;AAAA,MAC5B,GAAG;AAAA,MACH,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,MACvB,UAAU,QAAQ,IAAI,KAAK,GAAG;AAAA,IAChC;AACA,QAAI,KAAK,QAAQ,eAAgB,qBAAoB,KAAK,MAAM;AAAA,QAC3D,SAAQ,KAAK,MAAM;AAAA,EAC1B;AACA,QAAM,UAAU;AAAA,IACd,GAAG,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,QAAQ;AAAA,IACpC,GAAG,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ;AAAA,EACrC;AAGA,QAAM,aAAa,IAAI,IAAI,YAAY,IAAI;AAC3C,aAAW,UAAU,QAAS,YAAW,IAAI,OAAO,SAAS,OAAO,QAAQ;AAE5E,QAAM,aACJ,QAAQ,WAAW,IAAI,IAAI,IACvB,OACA,YAAY,cAAc,WAAW,IAAI,YAAY,UAAU,IAC7D,YAAY,aACX,CAAC,GAAG,WAAW,KAAK,CAAC,EAAE,CAAC,KAAK;AAEtC,QAAM,UAAkC,CAAC;AACzC,QAAM,UAAU,aAAa,WAAW,IAAI,UAAU,IAAI;AAC1D,MAAI,cAAc,QAAS,SAAQ,UAAU,IAAI;AACjD,aAAW,CAAC,SAAS,GAAG,KAAK,YAAY;AACvC,QAAI,YAAY,WAAY,SAAQ,OAAO,IAAI;AAAA,EACjD;AAMA,QAAM,iBAAiB,CAAC,YAAY;AACpC,QAAM,mBAAmB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,MAAM,CAAC;AAInE,QAAM,YAAY,QAAQ;AAAA,IACxB,CAAC,KAAK,MAAM,MAAM,gBAAgB,UAAU,EAAE,IAAI;AAAA,IAClD;AAAA,EACF;AACA,QAAM,aAAa,KAAK,iBAAiB,IAAI;AAC7C,QAAM,YAAY,OAAO,UAAU,IAAI,SAAS;AAEhD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc;AAAA,MACZ,MAAM,QAAQ,cAAc,QAAQ;AAAA,MACpC,aAAa,QAAQ,cAAc,eAAe;AAAA,IACpD;AAAA,IACA,UAAU;AAAA,MACR,aAAa,QAAQ;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,UAAU,YAAY;AAAA,MACtB,mBAAmB,oBAAoB;AAAA,IACzC;AAAA,EACF;AACF;AAgDA,IAAM,kBAAkB;AAWxB,eAAsB,YACpB,SACqB;AACrB,QAAM,EAAE,MAAM,WAAW,aAAa,YAAY,UAAU,IAAI;AAIhE,QAAM,SAAS,IAAI,IAAI,CAAC,GAAG,YAAY,WAAW,GAAG,KAAK,cAAc,CAAC;AAEzE,QAAM,cAAc,oBAAI,IAA8B;AACtD,MAAI,eAAe;AAEnB,QAAM,UAA2B,CAAC;AAClC,aAAW,UAAU,KAAK,SAAS;AACjC,UAAM,YAAY,OAAO,IAAI,OAAO,GAAG;AACvC,QAAI,cAAc,QAAW;AAC3B,kBAAY,IAAI,OAAO,KAAK;AAAA,QAC1B,KAAK,OAAO;AAAA,QACZ,MAAM;AAAA,QACN,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AAAA,IACH,OAAO;AACL,cAAQ,KAAK,MAAM;AAAA,IACrB;AAAA,EACF;AAIA,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,iBAAiB;AACxD,UAAM,QAAQ,QAAQ,MAAM,GAAG,IAAI,eAAe;AAClD,UAAM,EAAE,SAAS,MAAM,QAAQ,IAAI,MAAM,WAAW;AAAA,MAClD,MAAM,IAAI,CAAC,MAAM,EAAE,GAAG;AAAA,IACxB;AACA,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,2DAA2D,QAAQ,KAAK,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AACA,UAAM,YAAY,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AAC1D,eAAW,UAAU,OAAO;AAC1B,YAAM,OAAO,UAAU,IAAI,OAAO,GAAG;AACrC,UAAI,CAAC,MAAM;AACT,cAAM,IAAI;AAAA,UACR,2CAA2C,OAAO,GAAG;AAAA,QACvD;AAAA,MACF;AACA,YAAM,UAAU,MAAM,UAAU,gBAAgB;AAAA,QAC9C,KAAK,OAAO;AAAA,QACZ,MAAM,OAAO;AAAA,QACb;AAAA,QACA,QAAQ,KAAK;AAAA;AAAA;AAAA,QAGb,GAAI,OAAO,OAAO,EAAE,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA,MAC7C,CAAC;AACD,aAAO,IAAI,OAAO,KAAK,QAAQ,IAAI;AACnC,sBAAgB,QAAQ;AACxB,kBAAY,IAAI,OAAO,KAAK;AAAA,QAC1B,KAAK,OAAO;AAAA,QACZ,MAAM,QAAQ;AAAA,QACd,SAAS,QAAQ;AAAA,QACjB,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AAMA,MAAI,kBAAyC;AAC7C,MAAI,KAAK,kBAAkB,CAAC,YAAY,WAAW;AACjD,UAAM,gBAAgB;AAAA,MACpB,KAAK;AAAA,MACL,KAAK,aAAa;AAAA,MAClB,KAAK,aAAa;AAAA,IACpB;AACA,sBAAkB,MAAM,UAAU,aAAa,eAAe,SAAS;AACvE,oBAAgB,gBAAgB;AAAA,EAClC;AAIA,QAAM,YAAY;AAAA,IAChB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO,YAAY,MAAM;AAAA,EAC3B;AACA,QAAM,cAAc,MAAM,UAAU,aAAa,WAAW,SAAS;AACrE,kBAAgB,YAAY;AAE5B,QAAM,UAAU,KAAK,QAAQ,IAAI,CAAC,MAAM;AACtC,UAAM,OAAO,YAAY,IAAI,EAAE,GAAG;AAClC,QAAI,CAAC,MAAM;AACT,YAAM,IAAI,MAAM,2CAA2C,EAAE,GAAG,EAAE;AAAA,IACpE;AACA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,EACF;AACF;","names":["OBJECT_TYPES","FULL_SHA_RE","execFile","spawn","promisify","execFileAsync","FULL_SHA_RE","assertFullSha"]}

package/dist/chunk-YZRR2UO6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/standalone/channel-map.ts","../src/standalone/nonce-guard.ts","../src/standalone/nostr-identity.ts","../src/mime.ts"],"sourcesContent":["/**\n * Peer→channel map for the STANDALONE embedded publisher (#262).\n *\n * Why this exists: `@toon-protocol/client`'s `ChannelManager` persists the\n * off-chain nonce/cumulative-claim watermark (its `ChannelStore`,\n * `channels.json`, keyed by channelId) but keeps the peer→channelId mapping\n * ONLY in memory. So every standalone CLI invocation used to open (and fund)\n * a FRESH on-chain channel — the #260 fresh-outsider e2e stranded five\n * deposits across five commands. This store remembers WHICH channel the\n * identity holds with each peer, keyed by\n * `identity pubkey | ILP anchor (peer/apex destination) | chain | tokenNetwork`,\n * so the next invocation resumes it via `ChannelManager.trackChannel` (which\n * rehydrates the nonce watermark from `channels.json`) with zero on-chain\n * writes.\n *\n * It is the standalone twin of the daemon's\n * `packages/client-mcp/src/daemon/apex-channel-store.ts` — same record shape\n * (channelId + the chain context `trackChannel` needs), extended with the\n * identity pubkey (rig identities come from an env/`.env` precedence chain,\n * so one state dir can serve several identities) and the tokenNetwork.\n * `@toon-protocol/rig` must not import `@toon-protocol/client-mcp` (that\n * package depends on this one — circular), hence the twin; keep the\n * semantics in sync.\n *\n * CONCURRENCY: writes happen only from paid commands, which already hold the\n * per-identity advisory lockfile (./nonce-guard.ts `NonceLock`) for their\n * whole lifetime — the same guard that serializes the claim watermark also\n * serializes this file for one identity. `rig channel list` reads only.\n *\n * COUNTERPARTY: the key names a ROUTE, not a node — an ILP name can change\n * hands (the devnet apex `g.toon` was retired and another node took over\n * `g.toon.relay`). A record therefore also carries the counterparty\n * settlement address it was opened against (`context.recipient`), which is\n * re-checked against the destination's announced address before every resume\n * ({@link counterpartyMatch}); a rotated counterparty\n * {@link ChannelMapStore.supersede}s the record instead of signing claims a\n * connector with no record of that channel refuses (`F01`).\n *\n * CORRUPTION: an unreadable/invalid map file is a hard\n * {@link ChannelMapCorruptError} — surfaced BEFORE any on-chain open — never\n * an empty fallback. Falling back to \"no channels\" would silently open (and\n * fund) a duplicate channel, which is exactly the #262 bug.\n *\n * This module is dependency-light on purpose (node:fs only): the free\n * `rig channel list` command reads it without the optional\n * `@toon-protocol/client` peer dependency installed.\n */\n\nimport { mkdirSync, readFileSync, writeFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { dirname, join } from 'node:path';\n\n// ---------------------------------------------------------------------------\n// Paths (TOON_CLIENT_HOME conventions — see nonce-guard.ts module doc)\n// ---------------------------------------------------------------------------\n\n/** Map filename under the shared client state dir. */\nexport const RIG_CHANNEL_MAP_FILENAME = 'rig-channels.json';\n\n/**\n * Resolve the two channel-state files under `TOON_CLIENT_HOME` (default\n * `~/.toon-client`): the rig peer→channel map, and the client's nonce\n * watermark store (`config.json`'s `channelStorePath`, default\n * `<dir>/channels.json` — the same resolution `cli/standalone-mode.ts` feeds\n * the embedded ToonClient).\n */\nexport function resolveChannelPaths(env: NodeJS.ProcessEnv): {\n  mapPath: string;\n  watermarkPath: string;\n} {\n  const dir = env['TOON_CLIENT_HOME'] ?? join(homedir(), '.toon-client');\n  let configured: string | undefined;\n  try {\n    const raw = readFileSync(join(dir, 'config.json'), 'utf8');\n    const parsed = JSON.parse(raw) as { channelStorePath?: unknown };\n    if (typeof parsed.channelStorePath === 'string') {\n      configured = parsed.channelStorePath;\n    }\n  } catch (err) {\n    if ((err as NodeJS.ErrnoException).code !== 'ENOENT') {\n      throw new Error(\n        `failed to read client config at ${join(dir, 'config.json')}: ` +\n          `${err instanceof Error ? err.message : String(err)}`\n      );\n    }\n  }\n  return {\n    mapPath: join(dir, RIG_CHANNEL_MAP_FILENAME),\n    watermarkPath: configured ?? join(dir, 'channels.json'),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/**\n * Chain context `ChannelManager.trackChannel` needs to resume a channel\n * (same shape the daemon's apex-channel-store persists).\n */\nexport interface PersistedChannelContext {\n  chainType: string;\n  chainId: number;\n  tokenNetworkAddress: string;\n  tokenAddress?: string;\n  /** Counterparty settlement address (required for Solana/Mina proofs). */\n  recipient?: string;\n}\n\n/** One persisted peer→channel binding. */\nexport interface ChannelMapRecord {\n  /** On-chain payment channel id. */\n  channelId: string;\n  /** Registered peer id the negotiation was keyed by (`peerNegotiations`). */\n  peerId: string;\n  /** Hex Nostr pubkey of the identity that opened the channel. */\n  identity: string;\n  /** ILP anchor destination the channel was opened against (peer/apex). */\n  destination: string;\n  /** Negotiated settlement chain, e.g. `evm:31337`. */\n  chain: string;\n  /** TokenNetwork contract address ('' when the peer announced none). */\n  tokenNetwork: string;\n  /** Context for `trackChannel` on resume. */\n  context: PersistedChannelContext;\n  /** On-chain deposit total (base units, string), when known. */\n  depositTotal?: string;\n  /** ISO timestamps. */\n  openedAt: string;\n  lastUsedAt: string;\n  /**\n   * ISO timestamp this record was RETIRED from the resume path because the\n   * destination now announces a different settlement address than the channel\n   * was opened against (see {@link counterpartyMatch} /\n   * {@link ChannelMapStore.supersede}). A superseded record is never resumed\n   * again, but stays in {@link ChannelMapStore.list} so `rig channel\n   * list/close/settle` can still reclaim whatever it holds on-chain.\n   */\n  supersededAt?: string;\n}\n\n/** The composite key a record is stored under. */\nexport interface ChannelMapKey {\n  identity: string;\n  destination: string;\n  chain: string;\n  tokenNetwork: string;\n}\n\n/**\n * One entry of the client's nonce-watermark store (`channels.json`) —\n * format DUPLICATED from `@toon-protocol/client`'s `JsonFileChannelStore`\n * (`packages/client/src/channel/ChannelStore.ts`); keep in sync.\n */\nexport interface WatermarkEntry {\n  nonce: number;\n  /** Cumulative claimed amount, base units (string-encoded bigint). */\n  cumulativeAmount: string;\n  /** Withdraw-flow timers, string-encoded unix SECONDS. */\n  closedAt?: string;\n  settleableAt?: string;\n  settledAt?: string;\n}\n\n/** The peer→channel map file is unreadable or malformed. */\nexport class ChannelMapCorruptError extends Error {\n  constructor(\n    public readonly path: string,\n    detail: string\n  ) {\n    super(\n      `channel state file ${path} is corrupt (${detail}) — refusing to ` +\n        'continue: proceeding would silently open (and fund) a duplicate ' +\n        'on-chain channel. Fix or remove the file; removing it makes rig ' +\n        'forget which channels it holds (existing deposits stay locked ' +\n        'on-chain until settled).'\n    );\n    this.name = 'ChannelMapCorruptError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Store\n// ---------------------------------------------------------------------------\n\ninterface MapFile {\n  version: 1;\n  channels: Record<string, ChannelMapRecord>;\n}\n\nfunction keyOf(key: ChannelMapKey): string {\n  return `${key.identity}|${key.destination}|${key.chain}|${key.tokenNetwork}`;\n}\n\n/**\n * Archive key a {@link ChannelMapStore.supersede}d record moves to: the live\n * key plus the channel id, so the retired record survives the fresh channel\n * being recorded under the live key (deposits it still holds stay reachable\n * from `rig channel list/close/settle`) and several supersessions of the same\n * route never collide.\n */\nfunction supersededKeyOf(record: ChannelMapRecord): string {\n  return `${keyOf(recordKey(record))}|superseded:${record.channelId}`;\n}\n\n/**\n * Compare settlement addresses. EVM addresses travel in mixed checksum case\n * (an announce may say `0xF29f…` where the record says `0xf29f…`) and are\n * compared case-insensitively; anything else (base58 Solana, base58check\n * Mina) is case-SIGNIFICANT and compared verbatim.\n */\nexport function sameSettlementAddress(a: string, b: string): boolean {\n  const normalize = (v: string): string =>\n    /^0x[0-9a-fA-F]+$/.test(v) ? v.toLowerCase() : v;\n  return normalize(a) === normalize(b);\n}\n\n/**\n * Does a recorded channel still belong to the counterparty the destination\n * announces TODAY?\n *\n * The map key is `identity|destination|chain|tokenNetwork` — it carries no\n * counterparty. When the node terminating an ILP name is REPLACED (the devnet\n * apex `g.toon` was retired and another node took over `g.toon.relay`), all\n * four key fields still match, so rig resumed a channel opened against the\n * old node and signed claims against it. The new connector holds no record of\n * that channel and refuses every packet: `F01 - claim rejected: names a\n * channel this connector has no record of`. Every paid write failed until the\n * cache entry was deleted by hand.\n *\n * - `'match'` — same counterparty, safe to resume.\n * - `'mismatch'` — the counterparty rotated: the record must be superseded and\n *   the channel re-resolved.\n * - `'unrecorded'` — nothing to compare (a record written before this field\n *   was validated, or a peer that announced no settlement address). Resume is\n *   allowed and the caller should enrich the record with what the announce\n *   says, so the NEXT run is verifiable.\n */\nexport function counterpartyMatch(\n  record: Pick<ChannelMapRecord, 'context'>,\n  announced: string | undefined\n): 'match' | 'mismatch' | 'unrecorded' {\n  const recorded = record.context.recipient;\n  if (!recorded || !announced) return 'unrecorded';\n  return sameSettlementAddress(recorded, announced) ? 'match' : 'mismatch';\n}\n\n/** The key fields of a full record. */\nexport function recordKey(record: ChannelMapRecord): ChannelMapKey {\n  return {\n    identity: record.identity,\n    destination: record.destination,\n    chain: record.chain,\n    tokenNetwork: record.tokenNetwork,\n  };\n}\n\nfunction isContext(v: unknown): v is PersistedChannelContext {\n  if (typeof v !== 'object' || v === null) return false;\n  const c = v as Record<string, unknown>;\n  return (\n    typeof c['chainType'] === 'string' &&\n    typeof c['chainId'] === 'number' &&\n    typeof c['tokenNetworkAddress'] === 'string'\n  );\n}\n\nfunction isRecord(v: unknown): v is ChannelMapRecord {\n  if (typeof v !== 'object' || v === null) return false;\n  const r = v as Record<string, unknown>;\n  return (\n    typeof r['channelId'] === 'string' &&\n    typeof r['peerId'] === 'string' &&\n    typeof r['identity'] === 'string' &&\n    typeof r['destination'] === 'string' &&\n    typeof r['chain'] === 'string' &&\n    typeof r['tokenNetwork'] === 'string' &&\n    isContext(r['context'])\n  );\n}\n\nexport interface ChannelMapStoreOptions {\n  /** The rig peer→channel map file (`rig-channels.json`). */\n  mapPath: string;\n  /** The client's nonce-watermark store (`channels.json`). */\n  watermarkPath: string;\n}\n\n/**\n * File-backed peer→channel map + read/seed access to the client's nonce\n * watermark store. Synchronous I/O (matches the client's `ChannelStore`\n * surface); see the module doc for the locking and corruption contracts.\n */\nexport class ChannelMapStore {\n  readonly mapPath: string;\n  readonly watermarkPath: string;\n\n  constructor(options: ChannelMapStoreOptions) {\n    this.mapPath = options.mapPath;\n    this.watermarkPath = options.watermarkPath;\n  }\n\n  /** All recorded channels. @throws {ChannelMapCorruptError} */\n  list(): ChannelMapRecord[] {\n    return Object.values(this.readMap().channels);\n  }\n\n  /**\n   * Recorded channels for one (identity, destination) pair — the resume\n   * candidates for a paid command. Superseded records are EXCLUDED: they are\n   * retired from the resume path for good, and only `list()` (what `rig\n   * channel` enumerates) still shows them. @throws {ChannelMapCorruptError}\n   */\n  listFor(identity: string, destination: string): ChannelMapRecord[] {\n    return this.list().filter(\n      (r) =>\n        r.identity === identity &&\n        r.destination === destination &&\n        r.supersededAt === undefined\n    );\n  }\n\n  /**\n   * Record a (freshly opened) channel. Overwrites any previous record under\n   * the same (identity, destination, chain, tokenNetwork) key — the old\n   * channel is closed/stale by then; its claim watermark stays in the\n   * watermark store.\n   */\n  record(\n    record: Omit<ChannelMapRecord, 'openedAt' | 'lastUsedAt'> &\n      Partial<Pick<ChannelMapRecord, 'openedAt' | 'lastUsedAt'>>\n  ): void {\n    const now = new Date().toISOString();\n    const full: ChannelMapRecord = {\n      ...record,\n      openedAt: record.openedAt ?? now,\n      lastUsedAt: record.lastUsedAt ?? now,\n    };\n    const data = this.readMap();\n    data.channels[keyOf(recordKey(full))] = full;\n    this.writeMap(data);\n  }\n\n  /**\n   * Bump a record's `lastUsedAt` (and optionally its known on-chain deposit,\n   * or the counterparty a pre-validation record was written without) after\n   * resuming it. Unknown keys are a no-op.\n   */\n  touch(\n    key: ChannelMapKey,\n    update?: { depositTotal?: string; recipient?: string }\n  ): void {\n    const data = this.readMap();\n    const existing = data.channels[keyOf(key)];\n    if (!existing) return;\n    existing.lastUsedAt = new Date().toISOString();\n    if (update?.depositTotal !== undefined) {\n      existing.depositTotal = update.depositTotal;\n    }\n    if (update?.recipient !== undefined) {\n      existing.context.recipient = update.recipient;\n    }\n    this.writeMap(data);\n  }\n\n  /**\n   * Retire a record from the resume path — the counterparty that terminates\n   * its destination has been REPLACED, so the channel it names is dead to the\n   * new node (`F01 - claim rejected`) even though every key field still\n   * matches (see {@link counterpartyMatch}).\n   *\n   * The record is MOVED to an archive key rather than deleted: it may still\n   * hold an on-chain deposit, and `rig channel list/close/settle` find\n   * channels by scanning `list()`, so deleting it would strand those funds\n   * behind hand-editing the JSON. Moving it also frees the live key for the\n   * re-resolved channel. Idempotent, and a no-op for an unknown record.\n   */\n  supersede(record: ChannelMapRecord): void {\n    const data = this.readMap();\n    const liveKey = keyOf(recordKey(record));\n    const existing = data.channels[liveKey];\n    const isLive =\n      existing !== undefined && existing.channelId === record.channelId;\n    const retired: ChannelMapRecord = {\n      ...(isLive && existing ? existing : record),\n      supersededAt: record.supersededAt ?? new Date().toISOString(),\n    };\n    const channels: Record<string, ChannelMapRecord> = {};\n    for (const [key, value] of Object.entries(data.channels)) {\n      // The live key is FREED (not just re-pointed): the re-resolved channel\n      // is recorded under it moments later.\n      if (isLive && key === liveKey) continue;\n      channels[key] = value;\n    }\n    channels[supersededKeyOf(retired)] = retired;\n    this.writeMap({ ...data, channels });\n  }\n\n  /**\n   * Read one channel's nonce-watermark entry from the client's\n   * `channels.json` (undefined when the file or entry is missing).\n   * @throws {ChannelMapCorruptError} when the watermark file is unreadable.\n   */\n  readWatermark(channelId: string): WatermarkEntry | undefined {\n    return this.readWatermarkFile()[channelId];\n  }\n\n  /**\n   * Seed a fresh channel's watermark entry (`nonce 0, cumulative 0`) so a\n   * later resume can tell \"never claimed against\" apart from \"watermark\n   * lost\". Never overwrites an existing entry.\n   */\n  seedWatermark(channelId: string): void {\n    const data = this.readWatermarkFile();\n    if (data[channelId]) return;\n    data[channelId] = { nonce: 0, cumulativeAmount: '0' };\n    mkdirSync(dirname(this.watermarkPath), { recursive: true });\n    writeFileSync(\n      this.watermarkPath,\n      JSON.stringify(data, null, 2),\n      'utf-8'\n    );\n  }\n\n  // ── file I/O ───────────────────────────────────────────────────────────────\n\n  private readMap(): MapFile {\n    let raw: string;\n    try {\n      raw = readFileSync(this.mapPath, 'utf8');\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === 'ENOENT') {\n        return { version: 1, channels: {} };\n      }\n      throw new ChannelMapCorruptError(\n        this.mapPath,\n        err instanceof Error ? err.message : String(err)\n      );\n    }\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(raw);\n    } catch (err) {\n      throw new ChannelMapCorruptError(\n        this.mapPath,\n        `invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n      );\n    }\n    if (\n      typeof parsed !== 'object' ||\n      parsed === null ||\n      (parsed as { version?: unknown }).version !== 1 ||\n      typeof (parsed as { channels?: unknown }).channels !== 'object' ||\n      (parsed as { channels?: unknown }).channels === null\n    ) {\n      throw new ChannelMapCorruptError(\n        this.mapPath,\n        'expected { \"version\": 1, \"channels\": { … } }'\n      );\n    }\n    const channels = (parsed as { channels: Record<string, unknown> })\n      .channels;\n    for (const [key, value] of Object.entries(channels)) {\n      if (!isRecord(value)) {\n        throw new ChannelMapCorruptError(\n          this.mapPath,\n          `entry ${JSON.stringify(key)} is missing required fields`\n        );\n      }\n    }\n    return parsed as MapFile;\n  }\n\n  private writeMap(data: MapFile): void {\n    mkdirSync(dirname(this.mapPath), { recursive: true });\n    writeFileSync(this.mapPath, JSON.stringify(data, null, 2), {\n      mode: 0o600,\n    });\n  }\n\n  private readWatermarkFile(): Record<string, WatermarkEntry> {\n    let raw: string;\n    try {\n      raw = readFileSync(this.watermarkPath, 'utf8');\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === 'ENOENT') return {};\n      throw new ChannelMapCorruptError(\n        this.watermarkPath,\n        err instanceof Error ? err.message : String(err)\n      );\n    }\n    try {\n      return JSON.parse(raw) as Record<string, WatermarkEntry>;\n    } catch (err) {\n      throw new ChannelMapCorruptError(\n        this.watermarkPath,\n        `invalid JSON: ${err instanceof Error ? err.message : String(err)}`\n      );\n    }\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Status derivation\n// ---------------------------------------------------------------------------\n\n/**\n * Where a channel sits in the withdraw journey, from its watermark timers —\n * mirrors `ChannelManager.getChannelCloseState`. A missing entry reads as\n * `open` (recorded channels are seeded at open time; a lost watermark file\n * surfaces separately as unknown claim state).\n */\nexport function channelStatus(\n  entry: WatermarkEntry | undefined,\n  nowSec: number = Math.floor(Date.now() / 1000)\n): 'open' | 'closing' | 'settleable' | 'settled' {\n  if (!entry || entry.closedAt === undefined) return 'open';\n  if (entry.settledAt !== undefined) return 'settled';\n  if (\n    entry.settleableAt !== undefined &&\n    BigInt(nowSec) >= BigInt(entry.settleableAt)\n  ) {\n    return 'settleable';\n  }\n  return 'closing';\n}\n","/**\n * Nonce-ownership guard for the STANDALONE embedded Publisher (#228).\n *\n * Why this exists: a payment channel's balance proof is a CUMULATIVE\n * watermark — the ChannelManager auto-increments the nonce and cumulative\n * amount on every `signBalanceProof`. Two writers signing claims on the same\n * channel from separate processes (a running `toon-clientd` daemon plus a\n * standalone embedded client, or two standalone processes) each keep their\n * own cumulative counter, so their claims race: the connector sees\n * non-monotonic watermarks and a re-signed claim can double-charge (the\n * hazard documented in packages/rig-web/tests/e2e/seed/lib/publish.ts).\n *\n * Two independent defenses, both keyed by the Nostr pubkey (one identity =\n * one channel set):\n *\n *  1. Daemon detection — probe the toon-clientd loopback control API\n *     (`GET /status`) and REFUSE when it reports the SAME identity. A daemon\n *     on a different identity holds different channels and is harmless.\n *     Since #279 the CLI's paid WRITE commands never get here with a\n *     same-identity daemon up — they delegate to its `/git/*` routes first\n *     (`cli/daemon-session.ts`), which achieves the same one-writer goal by\n *     handing the watermark to the daemon. This guard remains the backstop\n *     for the probe→publish race window and for operations with no daemon\n *     route (channel close/settle, explicit open).\n *  2. Advisory lockfile — an exclusive per-pubkey lockfile under the shared\n *     `~/.toon-client` state dir so two STANDALONE processes can't race each\n *     other (the daemon check only covers the daemon). Stale locks (dead pid)\n *     are reclaimed.\n *\n * The daemon port and state-dir conventions are DUPLICATED from\n * `packages/client-mcp/src/daemon/config.ts` (default port 8787 /\n * `TOON_CLIENT_HTTP_PORT`; `~/.toon-client` / `TOON_CLIENT_HOME`).\n * `@toon-protocol/rig` must not depend on `@toon-protocol/client-mcp`\n * (the daemon package depends on this one for the #227 Publisher — the\n * import would be circular), so the constants live here with this note.\n * Keep them in sync.\n */\n\nimport { mkdirSync, readFileSync, unlinkSync, writeFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\n\n// ---------------------------------------------------------------------------\n// Shared conventions (duplicated from client-mcp — see module doc)\n// ---------------------------------------------------------------------------\n\n/** Default toon-clientd loopback control API port (client-mcp `httpPort`). */\nexport const DEFAULT_DAEMON_PORT = 8787;\n\n/** Daemon control API port: `TOON_CLIENT_HTTP_PORT` env, else 8787. */\nexport function defaultDaemonPort(): number {\n  const env = process.env['TOON_CLIENT_HTTP_PORT'];\n  const parsed = env ? Number(env) : NaN;\n  return Number.isFinite(parsed) && parsed > 0 ? parsed : DEFAULT_DAEMON_PORT;\n}\n\n/**\n * Shared client state dir: `TOON_CLIENT_HOME` env, else `~/.toon-client` —\n * the same dir the daemon keeps its config/channel stores in, so daemon and\n * standalone processes agree on where the advisory locks live.\n */\nexport function defaultLockDir(): string {\n  return process.env['TOON_CLIENT_HOME'] ?? join(homedir(), '.toon-client');\n}\n\n// ---------------------------------------------------------------------------\n// Force-standalone override\n// ---------------------------------------------------------------------------\n\n/**\n * Env var (and `--standalone` / `--no-daemon` flag) that makes rig ALWAYS run\n * embedded, bypassing a running `toon-clientd` entirely — both the #279\n * daemon-delegation fast path ({@link ../cli/daemon-session.ts}) and the\n * same-identity refusal ({@link checkDaemonIdentity}, Guard 1 below).\n *\n * SAFETY: this only disables the DAEMON detection. The exclusive per-pubkey\n * advisory lockfile (Guard 2, {@link NonceLock}) still runs, so two forced\n * STANDALONE rig processes cannot race the channel's cumulative-claim\n * watermark. What it CANNOT protect against is a running daemon on the SAME\n * identity that is ALSO signing claims concurrently — the daemon does not\n * take the lockfile. So the durable, race-free way to \"always standalone\" is\n * to STOP the daemon (its pid is in `~/.toon-client/daemon.pid`); this\n * override is for the common case where the daemon is idle/in-the-way and you\n * just want rig to sign for itself.\n */\nexport const RIG_STANDALONE_ENV = 'RIG_STANDALONE';\n\n/**\n * True when {@link RIG_STANDALONE_ENV} is set to a truthy value\n * (`1`/`true`/`yes`/`on`, case-insensitive). Any other value — including an\n * explicit `0`/`false`/empty — leaves the default daemon-aware behaviour.\n */\nexport function standaloneForced(env: NodeJS.ProcessEnv): boolean {\n  const raw = env[RIG_STANDALONE_ENV];\n  if (raw === undefined) return false;\n  const v = raw.trim().toLowerCase();\n  return v === '1' || v === 'true' || v === 'yes' || v === 'on';\n}\n\n// ---------------------------------------------------------------------------\n// Errors\n// ---------------------------------------------------------------------------\n\n/** A running toon-clientd holds the same identity (channel watermark owner). */\nexport class DaemonIdentityConflictError extends Error {\n  constructor(\n    /** The shared Nostr pubkey (hex). */\n    public readonly pubkey: string,\n    /** The daemon control API URL that answered. */\n    public readonly daemonUrl: string\n  ) {\n    super(\n      `toon-clientd is running with this identity (${pubkey.slice(0, 8)}…) at ` +\n        `${daemonUrl} — paid rig writes delegate to it automatically, ` +\n        `but this operation has no daemon route (or the daemon appeared ` +\n        `mid-run): stop the daemon and re-run. Two writers on one identity ` +\n        `would race the payment channel's cumulative-claim watermark ` +\n        `(double-charge hazard).`\n    );\n    this.name = 'DaemonIdentityConflictError';\n  }\n}\n\n/** Another standalone process already holds the per-identity lock. */\nexport class StandaloneLockError extends Error {\n  constructor(\n    public readonly pubkey: string,\n    public readonly lockPath: string,\n    public readonly holderPid: number\n  ) {\n    super(\n      `another standalone process (pid ${holderPid}) already holds the ` +\n        `payment-channel lock for identity ${pubkey.slice(0, 8)}… ` +\n        `(${lockPath}) — wait for it to finish or stop it. Two writers on one ` +\n        `identity would race the cumulative-claim watermark.`\n    );\n    this.name = 'StandaloneLockError';\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Daemon detection\n// ---------------------------------------------------------------------------\n\nexport interface CheckDaemonOptions {\n  /** Control API port (default: `TOON_CLIENT_HTTP_PORT` env, else 8787). */\n  port?: number;\n  /** Probe timeout, ms (default 1500 — loopback, so fast). */\n  timeoutMs?: number;\n  /** Inject a fetch implementation (tests). Defaults to global `fetch`. */\n  fetchImpl?: typeof fetch;\n}\n\n/**\n * Probe the toon-clientd loopback control API and throw\n * {@link DaemonIdentityConflictError} when a daemon responds on `/status`\n * with `identity.nostrPubkey === pubkey`.\n *\n * Anything short of a positive identity match lets the caller proceed: no\n * listener, a timeout, a non-JSON response (some other local service on the\n * port), or a daemon on a DIFFERENT identity (its channels are keyed to its\n * own pubkey — no shared watermark).\n */\nexport async function checkDaemonIdentity(\n  pubkey: string,\n  options: CheckDaemonOptions = {}\n): Promise<void> {\n  const port = options.port ?? defaultDaemonPort();\n  const fetchImpl = options.fetchImpl ?? fetch;\n  const url = `http://127.0.0.1:${port}/status`;\n\n  let daemonPubkey: string | undefined;\n  try {\n    const res = await fetchImpl(url, {\n      signal: AbortSignal.timeout(options.timeoutMs ?? 1500),\n    });\n    if (!res.ok) return; // listening, but not a healthy daemon status\n    const body = (await res.json()) as {\n      identity?: { nostrPubkey?: unknown };\n    };\n    const candidate = body?.identity?.nostrPubkey;\n    if (typeof candidate === 'string') daemonPubkey = candidate;\n  } catch {\n    // Unreachable / timed out / not JSON → no same-identity daemon detected.\n    return;\n  }\n\n  if (daemonPubkey !== undefined && daemonPubkey === pubkey) {\n    throw new DaemonIdentityConflictError(pubkey, url);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Advisory per-identity lockfile\n// ---------------------------------------------------------------------------\n\ninterface LockFileContents {\n  pid: number;\n  pubkey: string;\n  createdAt: string;\n}\n\nexport interface AcquireLockOptions {\n  /** Directory the lockfile lives in (default: {@link defaultLockDir}). */\n  dir?: string;\n  /** Override the recorded pid (tests). Defaults to `process.pid`. */\n  pid?: number;\n}\n\n/** True when `pid` refers to a live process we can see. */\nfunction pidAlive(pid: number): boolean {\n  try {\n    process.kill(pid, 0);\n    return true;\n  } catch (err) {\n    // EPERM = alive but not ours; ESRCH (and anything else) = not running.\n    return (err as NodeJS.ErrnoException).code === 'EPERM';\n  }\n}\n\n/**\n * Exclusive advisory lock for one identity's payment-channel watermark.\n *\n * Acquired with an atomic `wx` create of `standalone-<pubkey>.lock` (JSON:\n * pid + pubkey + timestamp) under the shared state dir. A pre-existing lock\n * whose pid is dead (or whose contents are unreadable) is STALE and gets\n * reclaimed; a live holder throws {@link StandaloneLockError}. Released\n * explicitly via {@link release} and best-effort on process exit.\n */\nexport class NonceLock {\n  private released = false;\n  private readonly exitHandler: () => void;\n\n  private constructor(\n    public readonly pubkey: string,\n    public readonly lockPath: string\n  ) {\n    this.exitHandler = () => {\n      try {\n        unlinkSync(this.lockPath);\n      } catch {\n        // best-effort — the pid check makes a leftover lock reclaimable anyway\n      }\n    };\n    process.once('exit', this.exitHandler);\n  }\n\n  static async acquire(\n    pubkey: string,\n    options: AcquireLockOptions = {}\n  ): Promise<NonceLock> {\n    const dir = options.dir ?? defaultLockDir();\n    const pid = options.pid ?? process.pid;\n    const lockPath = join(dir, `standalone-${pubkey}.lock`);\n    mkdirSync(dir, { recursive: true });\n\n    const payload = JSON.stringify(\n      {\n        pid,\n        pubkey,\n        createdAt: new Date().toISOString(),\n      } satisfies LockFileContents,\n      null,\n      2\n    );\n\n    // Two attempts: initial exclusive create, then one retry after reclaiming\n    // a stale lock. A live holder on either attempt is a hard refusal.\n    for (let attempt = 0; attempt < 2; attempt++) {\n      try {\n        writeFileSync(lockPath, payload, { flag: 'wx' });\n        return new NonceLock(pubkey, lockPath);\n      } catch (err) {\n        if ((err as NodeJS.ErrnoException).code !== 'EEXIST') throw err;\n\n        let holderPid: number | undefined;\n        try {\n          const parsed = JSON.parse(\n            readFileSync(lockPath, 'utf8')\n          ) as Partial<LockFileContents>;\n          if (typeof parsed.pid === 'number') holderPid = parsed.pid;\n        } catch {\n          // Unreadable/corrupt lock → treat as stale.\n        }\n\n        // Same process re-acquiring (e.g. a retried push in one CLI run) is\n        // not a race — the ChannelManager watermark is shared in-process.\n        if (\n          holderPid !== undefined &&\n          holderPid !== pid &&\n          pidAlive(holderPid)\n        ) {\n          throw new StandaloneLockError(pubkey, lockPath, holderPid);\n        }\n\n        // Stale (dead pid / corrupt / our own pid): reclaim and retry.\n        try {\n          unlinkSync(lockPath);\n        } catch {\n          // Lost a reclaim race with another process — the retry's exclusive\n          // create settles the winner.\n        }\n      }\n    }\n    // Both attempts hit EEXIST → another process is actively (re)creating it.\n    throw new StandaloneLockError(pubkey, lockPath, -1);\n  }\n\n  /** Remove the lockfile and detach the exit hook. Idempotent. */\n  release(): void {\n    if (this.released) return;\n    this.released = true;\n    process.removeListener('exit', this.exitHandler);\n    try {\n      unlinkSync(this.lockPath);\n    } catch {\n      // already gone — fine\n    }\n  }\n}\n","/**\n * The Nostr signing key rig derives from a BIP-39 phrase.\n *\n * `@toon-protocol/client` 2.x is a pure payer and carries no Nostr identity\n * (its own words), so the derivation that lived in the 0.x client moves here,\n * unchanged: `m/44'/1237'/0'/0/<accountIndex>`. Unchanged matters — this is\n * the key every existing rig repo is owned by (`toon.owner`, the kind:30617\n * author), and it is also the secp256k1 key the client reads a phrase's EVM\n * account from under `keyDerivation: 'legacy'`, so one phrase still yields one\n * author AND the wallet its channels were funded at.\n */\n\nimport { HDKey } from '@scure/bip32';\nimport { mnemonicToSeedSync } from '@scure/bip39';\nimport { getPublicKey } from 'nostr-tools/pure';\n\n/** A BIP-32 non-hardened child index fits in 31 bits. */\nexport const MAX_ACCOUNT_INDEX = 0x7fffffff;\n\n/** The path rig has always derived its Nostr key at. */\nexport function nostrDerivationPath(accountIndex = 0): string {\n  return `m/44'/1237'/0'/0/${String(accountIndex)}`;\n}\n\nexport interface NostrKey {\n  /** 32-byte secp256k1 secret. */\n  secretKey: Uint8Array;\n  /** 32-byte x-only public key, hex. */\n  pubkey: string;\n}\n\n/**\n * Derive the Nostr key of a phrase at an account index.\n *\n * @throws when the index is out of range or the phrase yields no key.\n */\nexport function deriveNostrKeyFromMnemonic(\n  mnemonic: string,\n  accountIndex = 0\n): NostrKey {\n  if (\n    !Number.isInteger(accountIndex) ||\n    accountIndex < 0 ||\n    accountIndex > MAX_ACCOUNT_INDEX\n  ) {\n    throw new Error(\n      `account index must be an integer in [0, ${String(MAX_ACCOUNT_INDEX)}]; got ${String(accountIndex)}`\n    );\n  }\n  const seed = mnemonicToSeedSync(mnemonic.trim());\n  try {\n    const child = HDKey.fromMasterSeed(seed).derive(\n      nostrDerivationPath(accountIndex)\n    );\n    if (!child.privateKey) {\n      throw new Error('failed to derive a Nostr private key from the seed');\n    }\n    const secretKey = new Uint8Array(child.privateKey);\n    return { secretKey, pubkey: getPublicKey(secretKey) };\n  } finally {\n    seed.fill(0);\n  }\n}\n","/**\n * File-extension → MIME type derivation for permaweb site deploys (#368).\n *\n * Every `rig push` already stores a repo's raw blob bytes on Arweave; tagging\n * each blob upload with a `Content-Type` derived from its path turns a pushed\n * repo into a servable static site (a gateway returns `text/html` for\n * `index.html` instead of `application/octet-stream`). The store forwards the\n * kind:5094 `output` tag to the Turbo upload's `Content-Type` — verified\n * against `@toon-protocol/core`'s `buildBlobStorageRequest` (sets\n * `[\"output\", contentType]`) and its inverse parser (reads the `output` tag\n * back into `contentType`, defaulting to `application/octet-stream`).\n *\n * The map is deliberately small — the common static-site asset extensions —\n * and any unknown or extensionless path falls back to the octet-stream\n * default (the same default the store applies for an absent `output`), so\n * this never guesses wildly.\n */\n\n/** The universal fallback: the store's own default for an absent `output`. */\nexport const DEFAULT_CONTENT_TYPE = 'application/octet-stream';\n\n/**\n * Lowercased extension (no dot) → MIME type. Curated for static sites; extend\n * as real deploys need more. Anything absent falls back to octet-stream.\n */\nconst EXTENSION_MIME: ReadonlyMap<string, string> = new Map([\n  // Markup / documents\n  ['html', 'text/html'],\n  ['htm', 'text/html'],\n  ['xml', 'application/xml'],\n  ['txt', 'text/plain'],\n  ['md', 'text/markdown'],\n  ['csv', 'text/csv'],\n  ['pdf', 'application/pdf'],\n  // Styles / scripts\n  ['css', 'text/css'],\n  ['js', 'text/javascript'],\n  ['mjs', 'text/javascript'],\n  ['cjs', 'text/javascript'],\n  ['map', 'application/json'],\n  ['json', 'application/json'],\n  ['wasm', 'application/wasm'],\n  // Fonts\n  ['woff', 'font/woff'],\n  ['woff2', 'font/woff2'],\n  ['ttf', 'font/ttf'],\n  ['otf', 'font/otf'],\n  ['eot', 'application/vnd.ms-fontobject'],\n  // Images\n  ['png', 'image/png'],\n  ['jpg', 'image/jpeg'],\n  ['jpeg', 'image/jpeg'],\n  ['gif', 'image/gif'],\n  ['svg', 'image/svg+xml'],\n  ['webp', 'image/webp'],\n  ['avif', 'image/avif'],\n  ['ico', 'image/x-icon'],\n  ['bmp', 'image/bmp'],\n  // Media\n  ['mp3', 'audio/mpeg'],\n  ['mp4', 'video/mp4'],\n  ['webm', 'video/webm'],\n  ['ogg', 'audio/ogg'],\n  ['wav', 'audio/wav'],\n]);\n\n/** The lowercased extension of a path (no leading dot), or `undefined`. */\nfunction extensionOf(path: string): string | undefined {\n  const slash = Math.max(path.lastIndexOf('/'), path.lastIndexOf('\\\\'));\n  const base = slash >= 0 ? path.slice(slash + 1) : path;\n  const dot = base.lastIndexOf('.');\n  // A leading dot (dotfile like `.gitignore`) or no dot → no usable extension.\n  if (dot <= 0) return undefined;\n  return base.slice(dot + 1).toLowerCase();\n}\n\n/**\n * Derive a `Content-Type` from a file path's extension. Unknown/extensionless\n * paths (and `undefined`) fall back to {@link DEFAULT_CONTENT_TYPE}.\n */\nexport function contentTypeForPath(path: string | undefined): string {\n  if (!path) return DEFAULT_CONTENT_TYPE;\n  const ext = extensionOf(path);\n  if (ext === undefined) return DEFAULT_CONTENT_TYPE;\n  return EXTENSION_MIME.get(ext) ?? DEFAULT_CONTENT_TYPE;\n}\n\n/**\n * Pick a single deterministic upload path for a blob reachable by MULTIPLE\n * paths (the same content committed under different names). The store keys a\n * blob by its content, so it carries ONE `Content-Type`:\n *\n *   - all paths agree on a content type → the lexicographically-first path\n *     (deterministic across runs);\n *   - the paths DISAGREE (e.g. `a.js` and `a.txt` share bytes) → `undefined`,\n *     so the caller uploads it as {@link DEFAULT_CONTENT_TYPE} rather than\n *     silently favoring one extension over another.\n *\n * An empty list yields `undefined` (octet-stream).\n */\nexport function resolveConflictingPath(paths: string[]): string | undefined {\n  if (paths.length === 0) return undefined;\n  const sorted = [...paths].sort();\n  const types = new Set(sorted.map((p) => contentTypeForPath(p)));\n  if (types.size === 1) return sorted[0];\n  return undefined;\n}\n"],"mappings":";AAgDA,SAAS,WAAW,cAAc,qBAAqB;AACvD,SAAS,eAAe;AACxB,SAAS,SAAS,YAAY;AAOvB,IAAM,2BAA2B;AASjC,SAAS,oBAAoB,KAGlC;AACA,QAAM,MAAM,IAAI,kBAAkB,KAAK,KAAK,QAAQ,GAAG,cAAc;AACrE,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,aAAa,KAAK,KAAK,aAAa,GAAG,MAAM;AACzD,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,OAAO,qBAAqB,UAAU;AAC/C,mBAAa,OAAO;AAAA,IACtB;AAAA,EACF,SAAS,KAAK;AACZ,QAAK,IAA8B,SAAS,UAAU;AACpD,YAAM,IAAI;AAAA,QACR,mCAAmC,KAAK,KAAK,aAAa,CAAC,KACtD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACvD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL,SAAS,KAAK,KAAK,wBAAwB;AAAA,IAC3C,eAAe,cAAc,KAAK,KAAK,eAAe;AAAA,EACxD;AACF;AA2EO,IAAM,yBAAN,cAAqC,MAAM;AAAA,EAChD,YACkB,MAChB,QACA;AACA;AAAA,MACE,sBAAsB,IAAI,gBAAgB,MAAM;AAAA,IAKlD;AATgB;AAUhB,SAAK,OAAO;AAAA,EACd;AAAA,EAXkB;AAYpB;AAWA,SAAS,MAAM,KAA4B;AACzC,SAAO,GAAG,IAAI,QAAQ,IAAI,IAAI,WAAW,IAAI,IAAI,KAAK,IAAI,IAAI,YAAY;AAC5E;AASA,SAAS,gBAAgB,QAAkC;AACzD,SAAO,GAAG,MAAM,UAAU,MAAM,CAAC,CAAC,eAAe,OAAO,SAAS;AACnE;AAQO,SAAS,sBAAsB,GAAW,GAAoB;AACnE,QAAM,YAAY,CAAC,MACjB,mBAAmB,KAAK,CAAC,IAAI,EAAE,YAAY,IAAI;AACjD,SAAO,UAAU,CAAC,MAAM,UAAU,CAAC;AACrC;AAuBO,SAAS,kBACd,QACA,WACqC;AACrC,QAAM,WAAW,OAAO,QAAQ;AAChC,MAAI,CAAC,YAAY,CAAC,UAAW,QAAO;AACpC,SAAO,sBAAsB,UAAU,SAAS,IAAI,UAAU;AAChE;AAGO,SAAS,UAAU,QAAyC;AACjE,SAAO;AAAA,IACL,UAAU,OAAO;AAAA,IACjB,aAAa,OAAO;AAAA,IACpB,OAAO,OAAO;AAAA,IACd,cAAc,OAAO;AAAA,EACvB;AACF;AAEA,SAAS,UAAU,GAA0C;AAC3D,MAAI,OAAO,MAAM,YAAY,MAAM,KAAM,QAAO;AAChD,QAAM,IAAI;AACV,SACE,OAAO,EAAE,WAAW,MAAM,YAC1B,OAAO,EAAE,SAAS,MAAM,YACxB,OAAO,EAAE,qBAAqB,MAAM;AAExC;AAEA,SAAS,SAAS,GAAmC;AACnD,MAAI,OAAO,MAAM,YAAY,MAAM,KAAM,QAAO;AAChD,QAAM,IAAI;AACV,SACE,OAAO,EAAE,WAAW,MAAM,YAC1B,OAAO,EAAE,QAAQ,MAAM,YACvB,OAAO,EAAE,UAAU,MAAM,YACzB,OAAO,EAAE,aAAa,MAAM,YAC5B,OAAO,EAAE,OAAO,MAAM,YACtB,OAAO,EAAE,cAAc,MAAM,YAC7B,UAAU,EAAE,SAAS,CAAC;AAE1B;AAcO,IAAM,kBAAN,MAAsB;AAAA,EAClB;AAAA,EACA;AAAA,EAET,YAAY,SAAiC;AAC3C,SAAK,UAAU,QAAQ;AACvB,SAAK,gBAAgB,QAAQ;AAAA,EAC/B;AAAA;AAAA,EAGA,OAA2B;AACzB,WAAO,OAAO,OAAO,KAAK,QAAQ,EAAE,QAAQ;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQ,UAAkB,aAAyC;AACjE,WAAO,KAAK,KAAK,EAAE;AAAA,MACjB,CAAC,MACC,EAAE,aAAa,YACf,EAAE,gBAAgB,eAClB,EAAE,iBAAiB;AAAA,IACvB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OACE,QAEM;AACN,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,UAAM,OAAyB;AAAA,MAC7B,GAAG;AAAA,MACH,UAAU,OAAO,YAAY;AAAA,MAC7B,YAAY,OAAO,cAAc;AAAA,IACnC;AACA,UAAM,OAAO,KAAK,QAAQ;AAC1B,SAAK,SAAS,MAAM,UAAU,IAAI,CAAC,CAAC,IAAI;AACxC,SAAK,SAAS,IAAI;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MACE,KACA,QACM;AACN,UAAM,OAAO,KAAK,QAAQ;AAC1B,UAAM,WAAW,KAAK,SAAS,MAAM,GAAG,CAAC;AACzC,QAAI,CAAC,SAAU;AACf,aAAS,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC7C,QAAI,QAAQ,iBAAiB,QAAW;AACtC,eAAS,eAAe,OAAO;AAAA,IACjC;AACA,QAAI,QAAQ,cAAc,QAAW;AACnC,eAAS,QAAQ,YAAY,OAAO;AAAA,IACtC;AACA,SAAK,SAAS,IAAI;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,UAAU,QAAgC;AACxC,UAAM,OAAO,KAAK,QAAQ;AAC1B,UAAM,UAAU,MAAM,UAAU,MAAM,CAAC;AACvC,UAAM,WAAW,KAAK,SAAS,OAAO;AACtC,UAAM,SACJ,aAAa,UAAa,SAAS,cAAc,OAAO;AAC1D,UAAM,UAA4B;AAAA,MAChC,GAAI,UAAU,WAAW,WAAW;AAAA,MACpC,cAAc,OAAO,iBAAgB,oBAAI,KAAK,GAAE,YAAY;AAAA,IAC9D;AACA,UAAM,WAA6C,CAAC;AACpD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,QAAQ,GAAG;AAGxD,UAAI,UAAU,QAAQ,QAAS;AAC/B,eAAS,GAAG,IAAI;AAAA,IAClB;AACA,aAAS,gBAAgB,OAAO,CAAC,IAAI;AACrC,SAAK,SAAS,EAAE,GAAG,MAAM,SAAS,CAAC;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,WAA+C;AAC3D,WAAO,KAAK,kBAAkB,EAAE,SAAS;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,WAAyB;AACrC,UAAM,OAAO,KAAK,kBAAkB;AACpC,QAAI,KAAK,SAAS,EAAG;AACrB,SAAK,SAAS,IAAI,EAAE,OAAO,GAAG,kBAAkB,IAAI;AACpD,cAAU,QAAQ,KAAK,aAAa,GAAG,EAAE,WAAW,KAAK,CAAC;AAC1D;AAAA,MACE,KAAK;AAAA,MACL,KAAK,UAAU,MAAM,MAAM,CAAC;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIQ,UAAmB;AACzB,QAAI;AACJ,QAAI;AACF,YAAM,aAAa,KAAK,SAAS,MAAM;AAAA,IACzC,SAAS,KAAK;AACZ,UAAK,IAA8B,SAAS,UAAU;AACpD,eAAO,EAAE,SAAS,GAAG,UAAU,CAAC,EAAE;AAAA,MACpC;AACA,YAAM,IAAI;AAAA,QACR,KAAK;AAAA,QACL,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,MACjD;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,GAAG;AAAA,IACzB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,KAAK;AAAA,QACL,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACnE;AAAA,IACF;AACA,QACE,OAAO,WAAW,YAClB,WAAW,QACV,OAAiC,YAAY,KAC9C,OAAQ,OAAkC,aAAa,YACtD,OAAkC,aAAa,MAChD;AACA,YAAM,IAAI;AAAA,QACR,KAAK;AAAA,QACL;AAAA,MACF;AAAA,IACF;AACA,UAAM,WAAY,OACf;AACH,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,QAAQ,GAAG;AACnD,UAAI,CAAC,SAAS,KAAK,GAAG;AACpB,cAAM,IAAI;AAAA,UACR,KAAK;AAAA,UACL,SAAS,KAAK,UAAU,GAAG,CAAC;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,SAAS,MAAqB;AACpC,cAAU,QAAQ,KAAK,OAAO,GAAG,EAAE,WAAW,KAAK,CAAC;AACpD,kBAAc,KAAK,SAAS,KAAK,UAAU,MAAM,MAAM,CAAC,GAAG;AAAA,MACzD,MAAM;AAAA,IACR,CAAC;AAAA,EACH;AAAA,EAEQ,oBAAoD;AAC1D,QAAI;AACJ,QAAI;AACF,YAAM,aAAa,KAAK,eAAe,MAAM;AAAA,IAC/C,SAAS,KAAK;AACZ,UAAK,IAA8B,SAAS,SAAU,QAAO,CAAC;AAC9D,YAAM,IAAI;AAAA,QACR,KAAK;AAAA,QACL,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,MACjD;AAAA,IACF;AACA,QAAI;AACF,aAAO,KAAK,MAAM,GAAG;AAAA,IACvB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,KAAK;AAAA,QACL,iBAAiB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACnE;AAAA,IACF;AAAA,EACF;AACF;AAYO,SAAS,cACd,OACA,SAAiB,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GACE;AAC/C,MAAI,CAAC,SAAS,MAAM,aAAa,OAAW,QAAO;AACnD,MAAI,MAAM,cAAc,OAAW,QAAO;AAC1C,MACE,MAAM,iBAAiB,UACvB,OAAO,MAAM,KAAK,OAAO,MAAM,YAAY,GAC3C;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;;;ACveA,SAAS,aAAAA,YAAW,gBAAAC,eAAc,YAAY,iBAAAC,sBAAqB;AACnE,SAAS,WAAAC,gBAAe;AACxB,SAAS,QAAAC,aAAY;AAOd,IAAM,sBAAsB;AAG5B,SAAS,oBAA4B;AAC1C,QAAM,MAAM,QAAQ,IAAI,uBAAuB;AAC/C,QAAM,SAAS,MAAM,OAAO,GAAG,IAAI;AACnC,SAAO,OAAO,SAAS,MAAM,KAAK,SAAS,IAAI,SAAS;AAC1D;AAOO,SAAS,iBAAyB;AACvC,SAAO,QAAQ,IAAI,kBAAkB,KAAKA,MAAKD,SAAQ,GAAG,cAAc;AAC1E;AAsBO,IAAM,qBAAqB;AAO3B,SAAS,iBAAiB,KAAiC;AAChE,QAAM,MAAM,IAAI,kBAAkB;AAClC,MAAI,QAAQ,OAAW,QAAO;AAC9B,QAAM,IAAI,IAAI,KAAK,EAAE,YAAY;AACjC,SAAO,MAAM,OAAO,MAAM,UAAU,MAAM,SAAS,MAAM;AAC3D;AAOO,IAAM,8BAAN,cAA0C,MAAM;AAAA,EACrD,YAEkB,QAEA,WAChB;AACA;AAAA,MACE,+CAA+C,OAAO,MAAM,GAAG,CAAC,CAAC,cAC5D,SAAS;AAAA,IAKhB;AAXgB;AAEA;AAUhB,SAAK,OAAO;AAAA,EACd;AAAA,EAbkB;AAAA,EAEA;AAYpB;AAGO,IAAM,sBAAN,cAAkC,MAAM;AAAA,EAC7C,YACkB,QACA,UACA,WAChB;AACA;AAAA,MACE,mCAAmC,SAAS,yDACL,OAAO,MAAM,GAAG,CAAC,CAAC,WACnD,QAAQ;AAAA,IAEhB;AATgB;AACA;AACA;AAQhB,SAAK,OAAO;AAAA,EACd;AAAA,EAXkB;AAAA,EACA;AAAA,EACA;AAUpB;AAyBA,eAAsB,oBACpB,QACA,UAA8B,CAAC,GAChB;AACf,QAAM,OAAO,QAAQ,QAAQ,kBAAkB;AAC/C,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,MAAM,oBAAoB,IAAI;AAEpC,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,MAAM,UAAU,KAAK;AAAA,MAC/B,QAAQ,YAAY,QAAQ,QAAQ,aAAa,IAAI;AAAA,IACvD,CAAC;AACD,QAAI,CAAC,IAAI,GAAI;AACb,UAAM,OAAQ,MAAM,IAAI,KAAK;AAG7B,UAAM,YAAY,MAAM,UAAU;AAClC,QAAI,OAAO,cAAc,SAAU,gBAAe;AAAA,EACpD,QAAQ;AAEN;AAAA,EACF;AAEA,MAAI,iBAAiB,UAAa,iBAAiB,QAAQ;AACzD,UAAM,IAAI,4BAA4B,QAAQ,GAAG;AAAA,EACnD;AACF;AAoBA,SAAS,SAAS,KAAsB;AACtC,MAAI;AACF,YAAQ,KAAK,KAAK,CAAC;AACnB,WAAO;AAAA,EACT,SAAS,KAAK;AAEZ,WAAQ,IAA8B,SAAS;AAAA,EACjD;AACF;AAWO,IAAM,YAAN,MAAM,WAAU;AAAA,EAIb,YACU,QACA,UAChB;AAFgB;AACA;AAEhB,SAAK,cAAc,MAAM;AACvB,UAAI;AACF,mBAAW,KAAK,QAAQ;AAAA,MAC1B,QAAQ;AAAA,MAER;AAAA,IACF;AACA,YAAQ,KAAK,QAAQ,KAAK,WAAW;AAAA,EACvC;AAAA,EAXkB;AAAA,EACA;AAAA,EALV,WAAW;AAAA,EACF;AAAA,EAgBjB,aAAa,QACX,QACA,UAA8B,CAAC,GACX;AACpB,UAAM,MAAM,QAAQ,OAAO,eAAe;AAC1C,UAAM,MAAM,QAAQ,OAAO,QAAQ;AACnC,UAAM,WAAWC,MAAK,KAAK,cAAc,MAAM,OAAO;AACtD,IAAAJ,WAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAElC,UAAM,UAAU,KAAK;AAAA,MACnB;AAAA,QACE;AAAA,QACA;AAAA,QACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAIA,aAAS,UAAU,GAAG,UAAU,GAAG,WAAW;AAC5C,UAAI;AACF,QAAAE,eAAc,UAAU,SAAS,EAAE,MAAM,KAAK,CAAC;AAC/C,eAAO,IAAI,WAAU,QAAQ,QAAQ;AAAA,MACvC,SAAS,KAAK;AACZ,YAAK,IAA8B,SAAS,SAAU,OAAM;AAE5D,YAAI;AACJ,YAAI;AACF,gBAAM,SAAS,KAAK;AAAA,YAClBD,cAAa,UAAU,MAAM;AAAA,UAC/B;AACA,cAAI,OAAO,OAAO,QAAQ,SAAU,aAAY,OAAO;AAAA,QACzD,QAAQ;AAAA,QAER;AAIA,YACE,cAAc,UACd,cAAc,OACd,SAAS,SAAS,GAClB;AACA,gBAAM,IAAI,oBAAoB,QAAQ,UAAU,SAAS;AAAA,QAC3D;AAGA,YAAI;AACF,qBAAW,QAAQ;AAAA,QACrB,QAAQ;AAAA,QAGR;AAAA,MACF;AAAA,IACF;AAEA,UAAM,IAAI,oBAAoB,QAAQ,UAAU,EAAE;AAAA,EACpD;AAAA;AAAA,EAGA,UAAgB;AACd,QAAI,KAAK,SAAU;AACnB,SAAK,WAAW;AAChB,YAAQ,eAAe,QAAQ,KAAK,WAAW;AAC/C,QAAI;AACF,iBAAW,KAAK,QAAQ;AAAA,IAC1B,QAAQ;AAAA,IAER;AAAA,EACF;AACF;;;ACnTA,SAAS,aAAa;AACtB,SAAS,0BAA0B;AACnC,SAAS,oBAAoB;AAGtB,IAAM,oBAAoB;AAG1B,SAAS,oBAAoB,eAAe,GAAW;AAC5D,SAAO,oBAAoB,OAAO,YAAY,CAAC;AACjD;AAcO,SAAS,2BACd,UACA,eAAe,GACL;AACV,MACE,CAAC,OAAO,UAAU,YAAY,KAC9B,eAAe,KACf,eAAe,mBACf;AACA,UAAM,IAAI;AAAA,MACR,2CAA2C,OAAO,iBAAiB,CAAC,UAAU,OAAO,YAAY,CAAC;AAAA,IACpG;AAAA,EACF;AACA,QAAM,OAAO,mBAAmB,SAAS,KAAK,CAAC;AAC/C,MAAI;AACF,UAAM,QAAQ,MAAM,eAAe,IAAI,EAAE;AAAA,MACvC,oBAAoB,YAAY;AAAA,IAClC;AACA,QAAI,CAAC,MAAM,YAAY;AACrB,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,UAAM,YAAY,IAAI,WAAW,MAAM,UAAU;AACjD,WAAO,EAAE,WAAW,QAAQ,aAAa,SAAS,EAAE;AAAA,EACtD,UAAE;AACA,SAAK,KAAK,CAAC;AAAA,EACb;AACF;;;AC3CO,IAAM,uBAAuB;AAMpC,IAAM,iBAA8C,oBAAI,IAAI;AAAA;AAAA,EAE1D,CAAC,QAAQ,WAAW;AAAA,EACpB,CAAC,OAAO,WAAW;AAAA,EACnB,CAAC,OAAO,iBAAiB;AAAA,EACzB,CAAC,OAAO,YAAY;AAAA,EACpB,CAAC,MAAM,eAAe;AAAA,EACtB,CAAC,OAAO,UAAU;AAAA,EAClB,CAAC,OAAO,iBAAiB;AAAA;AAAA,EAEzB,CAAC,OAAO,UAAU;AAAA,EAClB,CAAC,MAAM,iBAAiB;AAAA,EACxB,CAAC,OAAO,iBAAiB;AAAA,EACzB,CAAC,OAAO,iBAAiB;AAAA,EACzB,CAAC,OAAO,kBAAkB;AAAA,EAC1B,CAAC,QAAQ,kBAAkB;AAAA,EAC3B,CAAC,QAAQ,kBAAkB;AAAA;AAAA,EAE3B,CAAC,QAAQ,WAAW;AAAA,EACpB,CAAC,SAAS,YAAY;AAAA,EACtB,CAAC,OAAO,UAAU;AAAA,EAClB,CAAC,OAAO,UAAU;AAAA,EAClB,CAAC,OAAO,+BAA+B;AAAA;AAAA,EAEvC,CAAC,OAAO,WAAW;AAAA,EACnB,CAAC,OAAO,YAAY;AAAA,EACpB,CAAC,QAAQ,YAAY;AAAA,EACrB,CAAC,OAAO,WAAW;AAAA,EACnB,CAAC,OAAO,eAAe;AAAA,EACvB,CAAC,QAAQ,YAAY;AAAA,EACrB,CAAC,QAAQ,YAAY;AAAA,EACrB,CAAC,OAAO,cAAc;AAAA,EACtB,CAAC,OAAO,WAAW;AAAA;AAAA,EAEnB,CAAC,OAAO,YAAY;AAAA,EACpB,CAAC,OAAO,WAAW;AAAA,EACnB,CAAC,QAAQ,YAAY;AAAA,EACrB,CAAC,OAAO,WAAW;AAAA,EACnB,CAAC,OAAO,WAAW;AACrB,CAAC;AAGD,SAAS,YAAY,MAAkC;AACrD,QAAM,QAAQ,KAAK,IAAI,KAAK,YAAY,GAAG,GAAG,KAAK,YAAY,IAAI,CAAC;AACpE,QAAM,OAAO,SAAS,IAAI,KAAK,MAAM,QAAQ,CAAC,IAAI;AAClD,QAAM,MAAM,KAAK,YAAY,GAAG;AAEhC,MAAI,OAAO,EAAG,QAAO;AACrB,SAAO,KAAK,MAAM,MAAM,CAAC,EAAE,YAAY;AACzC;AAMO,SAAS,mBAAmB,MAAkC;AACnE,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,MAAM,YAAY,IAAI;AAC5B,MAAI,QAAQ,OAAW,QAAO;AAC9B,SAAO,eAAe,IAAI,GAAG,KAAK;AACpC;AAeO,SAAS,uBAAuB,OAAqC;AAC1E,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,SAAS,CAAC,GAAG,KAAK,EAAE,KAAK;AAC/B,QAAM,QAAQ,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,mBAAmB,CAAC,CAAC,CAAC;AAC9D,MAAI,MAAM,SAAS,EAAG,QAAO,OAAO,CAAC;AACrC,SAAO;AACT;","names":["mkdirSync","readFileSync","writeFileSync","homedir","join"]}