@byollm/server 0.1.0-alpha.2 → 0.1.0-alpha.4

package/dist/index.js

@@ -1,17 +1,18 @@
 import {
   ByollmHandlers,
   SERVED_PROTOCOL_VERSION,
-  bearerFrom,
   createFetchHandler,
   generateDeviceCode,
   generateJobId,
+  generateLeaseId,
   generateRunnerId,
   generateRunnerToken,
   generateUserCode,
   hashSecret,
   routeEndpoint,
-  secretsMatch
-} from "./chunk-HL6EYHQ7.js";
+  secretsMatch,
+  signatureFrom
+} from "./chunk-MGJX6626.js";
 import {
   NoRunnerAvailableError,
   PollingDelivery,
@@ -20,17 +21,26 @@ import {
 
 // src/app.ts
 import {
+  ENVELOPE_MAX_AGE_MS,
+  KindedPayload,
+  keyId,
+  payloadTextLength,
+  publicIdentityOf,
+  seal,
+  sizeClassOf,
   backendDescriptor,
   matchAudience
 } from "@byollm/protocol";
 var DEFAULT_LIVENESS_MS = 35e3;
 var ByollmApp = class {
   #store;
+  #siteKeys;
   #now;
   #livenessMs;
   #delivery;
   constructor(options) {
     this.#store = options.store;
+    this.#siteKeys = options.siteKeys;
     this.#now = options.now ?? Date.now;
     this.#livenessMs = options.livenessMs ?? DEFAULT_LIVENESS_MS;
     const deps = {
@@ -66,7 +76,44 @@ var ByollmApp = class {
    * the app is obliged to disclose that to whoever reads it.
    */
   async enqueue(input) {
-    const record = await this.#store.create(input, this.#now());
+    const parsed = KindedPayload.safeParse({
+      kind: input.kind,
+      payload: input.payload
+    });
+    if (!parsed.success) {
+      const detail = parsed.error.issues.map((issue) => `${issue.path.join(".") || "(root)"}: ${issue.message}`).join("; ");
+      throw new Error(`invalid ${input.kind} payload \u2014 ${detail}`);
+    }
+    const createdAt = this.#now();
+    const envelopeDeadlineAt = createdAt + ENVELOPE_MAX_AGE_MS;
+    const jobId = input.id ?? generateJobId();
+    const senderKeyId = keyId(publicIdentityOf(this.#siteKeys).identity);
+    const envelope = await seal({
+      plaintext: JSON.stringify(parsed.data.payload),
+      senderKeys: this.#siteKeys,
+      recipientEncryptionPublic: this.#siteKeys.encryptionPublic,
+      context: {
+        jobId,
+        senderKeyId,
+        recipientKeyId: senderKeyId,
+        deadlineAt: envelopeDeadlineAt,
+        direction: "payload"
+      }
+    });
+    const record = await this.#store.create(
+      {
+        ...input,
+        id: jobId,
+        envelope,
+        sizeClass: sizeClassOf(
+          payloadTextLength({
+            kind: input.kind,
+            payload: parsed.data.payload
+          })
+        )
+      },
+      createdAt
+    );
     return {
       id: record.id,
       record,
@@ -136,7 +183,18 @@ var ByollmApp = class {
         {
           owner: runner.owner,
           offerScope: capability.offerScope,
-          account: backendDescriptor(capability.backendId).account,
+          // A generic backend's cost depends on its base URL, which the
+          // server never sees; assume the expensive reading (byollm_007 §4).
+          cost: backendDescriptor(capability.backendId).cost ?? "metered",
+          // Consent is the daemon's to hold, and it has already applied it:
+          // the offer scope arriving here is the *effective* one, so a
+          // metered backend nobody agreed to share advertises `self` and is
+          // refused by the scope rule above. Re-deriving consent from
+          // `false` here would instead refuse every backend an owner
+          // deliberately shared, because the server has no way to learn they
+          // did — the signal would be wrong in the direction that breaks
+          // working setups.
+          spend: { acknowledged: true },
           // Same conservative assumption the claim path makes: the server
           // cannot see a remote daemon's local allowlist (protocol §4.2).
           locallyAllows: () => true
@@ -218,6 +276,45 @@ function normalizeUserCode(input) {
   return bare.length === 8 ? `${bare.slice(0, 4)}-${bare.slice(4)}` : bare;
 }
 
+// src/keys.ts
+import { StoredKeys, generateKeys, publicIdentityOf as publicIdentityOf2 } from "@byollm/protocol";
+import { fingerprint } from "@byollm/protocol";
+var generateSiteKeys = (now = Date.now()) => generateKeys(now);
+function siteKeysFromEnv(variable = "BYOLLM_SITE_KEYS", env = process.env) {
+  const raw = env[variable];
+  if (raw === void 0 || raw === "") {
+    throw new Error(
+      `${variable} is not set. Generate a site identity once with \`npx @byollm/server keygen\` and set it as ${variable}. Do not generate keys at startup: every instance would get a different identity and daemons would pin one and be refused by another.`
+    );
+  }
+  let parsed;
+  try {
+    parsed = JSON.parse(Buffer.from(raw, "base64").toString("utf8"));
+  } catch {
+    throw new Error(
+      `${variable} is not base64-encoded JSON. It should be exactly what \`npx @byollm/server keygen\` printed.`
+    );
+  }
+  const result = StoredKeys.safeParse(parsed);
+  if (!result.success) {
+    throw new Error(
+      `${variable} does not contain a valid site identity. Regenerate it with \`npx @byollm/server keygen\` \u2014 and if this site has already paired daemons, they will need to pair again.`
+    );
+  }
+  return result.data;
+}
+function formatSiteKeys(keys) {
+  const encoded = Buffer.from(JSON.stringify(keys)).toString("base64");
+  return `# Set this as BYOLLM_SITE_KEYS. It is a secret: it is this site's
+# identity, and anything holding it can be this site.
+BYOLLM_SITE_KEYS=${encoded}
+
+# Fingerprint (not secret \u2014 show it to users so they can check what
+# their daemon pinned):
+# ${fingerprint(publicIdentityOf2(keys).identity)}
+`;
+}
+
 // src/memory.ts
 import {
   backendDescriptor as backendDescriptor2,
@@ -236,7 +333,7 @@ var MemoryStore = class {
   }
   // -- jobs ---------------------------------------------------------------
   create(input, now) {
-    const id = input.id ?? generateJobId();
+    const id = input.id;
     const existing = this.#jobs.get(id);
     if (existing) return Promise.resolve(existing);
     const dependsOn = [...input.dependsOn ?? []];
@@ -246,7 +343,8 @@ var MemoryStore = class {
     const job = {
       id,
       kind: input.kind,
-      payload: input.payload,
+      envelope: input.envelope,
+      sizeClass: input.sizeClass,
       audience: input.audience ?? "self",
       owner: input.owner,
       audienceAllow: input.audienceAllow ? [...input.audienceAllow] : void 0,
@@ -264,7 +362,7 @@ var MemoryStore = class {
       provenance: null,
       updatedAt: now
     };
-    this.#jobs.set(id, job);
+    this.#write(id, job);
     return Promise.resolve(job);
   }
   get(jobId) {
@@ -283,13 +381,16 @@ var MemoryStore = class {
         ...job,
         state: "claimed",
         lease: {
+          // A fresh id per grant. Two claims of the same job by the same
+          // runner are two different leases, and must be distinguishable.
+          id: generateLeaseId(),
           runnerId: args.runnerId,
           expiresAt: args.now + args.leaseMs
         },
         attempts: job.attempts + 1,
         updatedAt: args.now
       };
-      this.#jobs.set(job.id, updated);
+      this.#write(job.id, updated);
       claimed.push(updated);
     }
     return Promise.resolve(claimed);
@@ -313,9 +414,16 @@ var MemoryStore = class {
       {
         owner: args.runnerOwner,
         offerScope: capability.offerScope,
-        // From the registry, not a local guess — the subscription self-lock
-        // must mean the same thing on both sides of the wire.
-        account: backendDescriptor2(capability.backendId).account,
+        // From the registry, not a local guess — the cost rules must mean the
+        // same thing on both sides of the wire. The server cannot see a
+        // remote daemon's base URL, so a generic backend with no declared
+        // cost is treated as metered: the expensive side, and the daemon
+        // refuses anyway if it disagrees (byollm_007 §2).
+        cost: backendDescriptor2(capability.backendId).cost ?? "metered",
+        // Nor can it see the owner's spend consent. It offers; the daemon is
+        // the enforcing side and releases with `refused` if its own rules say
+        // no — the same shape as the `named` allowlist.
+        spend: { acknowledged: true },
         // The server cannot see a remote daemon's local allowlist and must
         // not pretend to (protocol §4.2). It admits the job here; the daemon
         // is the enforcing side and releases with `refused` if its own list
@@ -329,9 +437,9 @@ var MemoryStore = class {
     this.#expireDueSync(args.now);
     const renewed = [];
     const lost = [];
-    for (const jobId of args.jobIds) {
+    for (const { jobId, leaseId } of args.leases) {
       const job = this.#jobs.get(jobId);
-      if (!job || job.lease?.runnerId !== args.runnerId) {
+      if (!job || job.lease?.runnerId !== args.runnerId || job.lease.id !== leaseId) {
         lost.push(jobId);
         continue;
       }
@@ -340,10 +448,11 @@ var MemoryStore = class {
         continue;
       }
       const expiresAt = args.now + args.leaseMs;
-      this.#jobs.set(jobId, {
+      this.#write(jobId, {
         ...job,
         state: "running",
-        lease: { runnerId: args.runnerId, expiresAt },
+        // Renewal extends the existing grant; it does not mint a new one.
+        lease: { ...job.lease, expiresAt },
         updatedAt: args.now
       });
       renewed.push({ jobId, expiresAt });
@@ -371,7 +480,7 @@ var MemoryStore = class {
       provenance: args.provenance,
       updatedAt: args.now
     };
-    this.#jobs.set(job.id, updated);
+    this.#write(job.id, updated);
     this.#cancelRequests.delete(job.id);
     if (state === "ok") this.#unblockDependents(job.id, args.now);
     return Promise.resolve({ accepted: true, job: updated });
@@ -392,16 +501,66 @@ var MemoryStore = class {
         (depId) => this.#jobs.get(depId)?.state === "ok"
       );
       if (ready) {
-        this.#jobs.set(job.id, { ...job, claimableAt: now, updatedAt: now });
+        this.#write(job.id, { ...job, claimableAt: now, updatedAt: now });
+      }
+    }
+  }
+  /**
+   * Watchers, by job id (byollm_009 §8.3).
+   *
+   * A `Set` per job so an unsubscribe removes exactly the handler it
+   * registered — two waiters on the same job are ordinary, and removing by
+   * job id alone would silently cancel someone else's wait.
+   */
+  #watchers = /* @__PURE__ */ new Map();
+  subscribe(jobId, onChange) {
+    const existing = this.#watchers.get(jobId) ?? /* @__PURE__ */ new Set();
+    existing.add(onChange);
+    this.#watchers.set(jobId, existing);
+    let live = true;
+    return () => {
+      if (!live) return;
+      live = false;
+      const set = this.#watchers.get(jobId);
+      set?.delete(onChange);
+      if (set?.size === 0) this.#watchers.delete(jobId);
+    };
+  }
+  /**
+   * The single write path for a job.
+   *
+   * Every mutation goes through here so notification cannot be forgotten by
+   * a future one. Nine call sites existed when the push seam was added, and
+   * "remember to notify" is not a property nine call sites keep.
+   */
+  #write(jobId, record) {
+    this.#jobs.set(jobId, record);
+    this.#notify(jobId);
+  }
+  /**
+   * Tell anyone watching that a job changed.
+   *
+   * A throwing watcher must not corrupt the store's own bookkeeping, so each
+   * is isolated: this runs inside write paths, and one bad listener taking
+   * out an unrelated write would be a far worse failure than a missed
+   * notification.
+   */
+  #notify(jobId) {
+    for (const watcher of this.#watchers.get(jobId) ?? []) {
+      try {
+        watcher();
+      } catch {
       }
     }
   }
   release(args) {
     const released = [];
-    for (const jobId of args.jobIds) {
+    for (const { jobId, leaseId } of args.leases) {
       const job = this.#jobs.get(jobId);
-      if (!job || job.lease?.runnerId !== args.runnerId) continue;
-      this.#jobs.set(jobId, {
+      if (!job || job.lease?.runnerId !== args.runnerId || job.lease.id !== leaseId) {
+        continue;
+      }
+      this.#write(jobId, {
         ...job,
         state: "queued",
         lease: null,
@@ -443,7 +602,7 @@ var MemoryStore = class {
           claimableAt: now,
           updatedAt: now
         };
-        this.#jobs.set(job.id, requeued);
+        this.#write(job.id, requeued);
         changed.push(requeued);
       }
     }
@@ -458,7 +617,7 @@ var MemoryStore = class {
         lease: null,
         updatedAt: now
       };
-      this.#jobs.set(job.id, expired);
+      this.#write(job.id, expired);
       changed.push(expired);
     }
     return changed;
@@ -473,7 +632,7 @@ var MemoryStore = class {
         lease: null,
         updatedAt: now
       };
-      this.#jobs.set(jobId, canceled);
+      this.#write(jobId, canceled);
       return Promise.resolve(canceled);
     }
     if (job.state === "claimed" || job.state === "running") {
@@ -525,6 +684,9 @@ var MemoryStore = class {
       id: args.runnerId,
       owner: args.owner,
       tokenHash: args.tokenHash,
+      // Carried from the pairing, not re-supplied at approval: the user
+      // approved a specific machine, and the runner must be that machine.
+      device: pairing.device,
       label: pairing.label,
       platform: pairing.platform,
       daemonVersion: pairing.daemonVersion,
@@ -618,17 +780,20 @@ export {
   PollingDelivery,
   ResultTimeoutError,
   SERVED_PROTOCOL_VERSION,
-  bearerFrom,
   capabilityFor,
   createFetchHandler,
+  formatSiteKeys,
   generateDeviceCode,
   generateJobId,
   generateRunnerId,
   generateRunnerToken,
+  generateSiteKeys,
   generateUserCode,
   hashSecret,
   normalizeUserCode,
   routeEndpoint,
-  secretsMatch
+  secretsMatch,
+  signatureFrom,
+  siteKeysFromEnv
 };
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/app.ts","../src/memory.ts"],"sourcesContent":["import {\n  backendDescriptor,\n  matchAudience,\n  type DeliveredResult,\n  type JobKind,\n} from \"@byollm/protocol\";\nimport {\n  PollingDelivery,\n  type PollingDeliveryDeps,\n  type ResultDelivery,\n  type WaitOptions,\n} from \"./delivery.js\";\nimport { generateRunnerId, generateRunnerToken, hashSecret } from \"./ids.js\";\nimport type { EnqueueInput, JobRecord, RunnerRecord } from \"./records.js\";\nimport type { ByollmStore } from \"./store.js\";\n\n/**\n * How long since a runner's last heartbeat before it stops counting as live.\n * Three heartbeats of slack at the daemon's ~10s cadence.\n */\nconst DEFAULT_LIVENESS_MS = 35_000;\n\n/** Why a job cannot presently run. */\nexport type NoRunnerReason =\n  | \"no-runner-paired\"\n  | \"no-runner-online\"\n  | \"no-matching-capability\"\n  | \"audience-admits-nobody\";\n\n/**\n * The no-runner signal (byollm_001 Rev 1 §D).\n *\n * `available: false` means an app should fall back — hosted model, \"start\n * your runner\" prompt — rather than awaiting something that will never\n * resolve. A job still blocked on dependencies is **not** unavailable; it is\n * waiting, and saying otherwise would make every multi-job flow look broken\n * ({@link MUSTS.NO_RUNNER_SIGNAL}).\n */\nexport interface RunnerAvailability {\n  readonly available: boolean;\n  readonly reason?: NoRunnerReason;\n  /** Live runners that could take work of this shape. */\n  readonly candidates: number;\n}\n\nexport interface AvailabilityQuery {\n  readonly kind: JobKind;\n  readonly owner: string;\n  readonly audience?: \"self\" | \"named\" | \"public\";\n  readonly audienceAllow?: readonly string[];\n}\n\nexport interface ByollmAppOptions {\n  readonly store: ByollmStore;\n  /** Injectable clock. */\n  readonly now?: () => number;\n  /** Liveness window for the no-runner signal. */\n  readonly livenessMs?: number;\n  /**\n   * How the app learns a job finished. Defaults to polling the store, which\n   * is correct everywhere; the Supabase adapter substitutes Realtime.\n   */\n  readonly delivery?: (deps: PollingDeliveryDeps) => ResultDelivery;\n  /**\n   * How long a sustained no-runner signal must persist before `result()`\n   * gives up. Longer tolerates a daemon restarting; shorter fails faster.\n   */\n  readonly noRunnerGraceMs?: number;\n}\n\n/**\n * An enqueued job, with the delivery channel attached.\n *\n * `result()` is sugar over the channel — with a timeout and a\n * `noRunnerAvailable` path — never a bare promise that can hang forever\n * (byollm_003 Rev 1).\n */\nexport interface JobHandle {\n  readonly id: string;\n  /** The job as stored at enqueue time. */\n  readonly record: JobRecord;\n  /** Wait for a terminal outcome. */\n  result(options?: WaitOptions): Promise<DeliveredResult>;\n  /** Ask the runner to stop. */\n  cancel(): Promise<void>;\n}\n\n/**\n * The app-facing half of `@byollm/server`.\n *\n * The daemon talks to {@link ByollmHandlers}; the app talks to this. Keeping\n * them separate is what makes \"one door per state write\" hold — an app\n * enqueues and cancels through these methods and never writes job rows by\n * hand.\n */\nexport class ByollmApp {\n  readonly #store: ByollmStore;\n  readonly #now: () => number;\n  readonly #livenessMs: number;\n  readonly #delivery: ResultDelivery;\n\n  constructor(options: ByollmAppOptions) {\n    this.#store = options.store;\n    this.#now = options.now ?? Date.now;\n    this.#livenessMs = options.livenessMs ?? DEFAULT_LIVENESS_MS;\n\n    const deps: PollingDeliveryDeps = {\n      ...(options.noRunnerGraceMs === undefined\n        ? {}\n        : { graceMs: options.noRunnerGraceMs }),\n      read: (jobId) => this.result(jobId),\n      availability: async (jobId) => {\n        const job = await this.#store.get(jobId);\n        if (!job)\n          return { available: false, reason: \"unknown-job\", blocked: false };\n        // A job waiting on a dependency is waiting, not unavailable.\n        if (job.claimableAt === null) {\n          return { available: true, blocked: true };\n        }\n        const availability = await this.runnerAvailability({\n          kind: job.kind,\n          owner: job.owner,\n          audience: job.audience,\n          ...(job.audienceAllow === undefined\n            ? {}\n            : { audienceAllow: job.audienceAllow }),\n        });\n        return {\n          available: availability.available,\n          ...(availability.reason === undefined\n            ? {}\n            : { reason: availability.reason }),\n          blocked: false,\n        };\n      },\n    };\n    this.#delivery = options.delivery?.(deps) ?? new PollingDelivery(deps);\n  }\n\n  /**\n   * Enqueue a job.\n   *\n   * `audience` defaults to `self` — the safe direction. Widening it means the\n   * result comes back marked untrusted (see {@link ByollmApp.result}), and\n   * the app is obliged to disclose that to whoever reads it.\n   */\n  async enqueue(input: EnqueueInput): Promise<JobHandle> {\n    const record = await this.#store.create(input, this.#now());\n    return {\n      id: record.id,\n      record,\n      result: (options?: WaitOptions) =>\n        this.#delivery.waitFor(record.id, options),\n      cancel: async () => {\n        await this.cancel(record.id);\n      },\n    };\n  }\n\n  /** Read a job's current state. */\n  async job(jobId: string): Promise<JobRecord | null> {\n    await this.#store.expireDue(this.#now());\n    return this.#store.get(jobId);\n  }\n\n  /**\n   * A job's result with its provenance attached.\n   *\n   * Check `provenance.untrusted` before rendering. It is true for every\n   * `named`/`public` job, because that text came from someone else's machine\n   * and the app must not present it as its own AI's answer\n   * ({@link MUSTS.RESULT_PROVENANCE}).\n   */\n  async result(jobId: string): Promise<DeliveredResult | null> {\n    const job = await this.job(jobId);\n    if (!job) return null;\n    return {\n      jobId: job.id,\n      state: job.state,\n      ...(job.outcome === null ? {} : { outcome: job.outcome }),\n      ...(job.provenance === null ? {} : { provenance: job.provenance }),\n    };\n  }\n\n  /** Ask a runner to stop. Queued jobs cancel at once; held jobs at the next heartbeat. */\n  async cancel(jobId: string): Promise<JobRecord | null> {\n    return this.#store.cancel(jobId, this.#now());\n  }\n\n  /**\n   * Is there a live runner that could take a job of this shape?\n   *\n   * Runs the identical {@link matchAudience} rule the claim path uses, so the\n   * signal cannot promise a runner the claim would then refuse.\n   */\n  async runnerAvailability(\n    query: AvailabilityQuery,\n  ): Promise<RunnerAvailability> {\n    const now = this.#now();\n    const all = await this.#store.listRunners();\n    const live = all.filter(\n      (runner) =>\n        runner.revokedAt === null &&\n        !runner.paused &&\n        now - runner.lastHeartbeatAt <= this.#livenessMs,\n    );\n\n    if (all.length === 0) {\n      return { available: false, reason: \"no-runner-paired\", candidates: 0 };\n    }\n    if (live.length === 0) {\n      return { available: false, reason: \"no-runner-online\", candidates: 0 };\n    }\n\n    let capable = 0;\n    let admitted = 0;\n    for (const runner of live) {\n      const capability = runner.capabilities.find((c) => c.kind === query.kind);\n      if (!capability) continue;\n      capable += 1;\n\n      const match = matchAudience(\n        {\n          owner: query.owner,\n          audience: query.audience ?? \"self\",\n          audienceAllow: query.audienceAllow,\n        },\n        {\n          owner: runner.owner,\n          offerScope: capability.offerScope,\n          account: backendDescriptor(capability.backendId).account,\n          // Same conservative assumption the claim path makes: the server\n          // cannot see a remote daemon's local allowlist (protocol §4.2).\n          locallyAllows: () => true,\n        },\n      );\n      if (match.ok) admitted += 1;\n    }\n\n    if (capable === 0) {\n      return {\n        available: false,\n        reason: \"no-matching-capability\",\n        candidates: 0,\n      };\n    }\n    if (admitted === 0) {\n      return {\n        available: false,\n        reason: \"audience-admits-nobody\",\n        candidates: 0,\n      };\n    }\n    return { available: true, candidates: admitted };\n  }\n\n  /**\n   * Approve a pairing on behalf of an authenticated user.\n   *\n   * `owner` MUST come from the approving user's own session. A daemon can\n   * never assert who it is — that is the whole reason pairing is interactive\n   * ({@link MUSTS.PAIR_ONE_USER}, {@link MUSTS.PAIR_INTERACTIVE}).\n   */\n  async approvePairing(args: {\n    userCode: string;\n    owner: string;\n  }): Promise<RunnerRecord> {\n    const token = generateRunnerToken();\n    return this.#store.approvePairing({\n      userCode: normalizeUserCode(args.userCode),\n      owner: args.owner,\n      runnerId: generateRunnerId(),\n      runnerToken: token,\n      tokenHash: hashSecret(token),\n      now: this.#now(),\n    });\n  }\n\n  /** Deny a pairing the user did not initiate. */\n  async denyPairing(userCode: string): Promise<void> {\n    return this.#store.denyPairing(normalizeUserCode(userCode), this.#now());\n  }\n\n  /** What a pairing code refers to, for the approval page to show. */\n  async pendingPairing(userCode: string): Promise<{\n    label: string;\n    platform: string;\n    daemonVersion: string;\n    capabilities: readonly { kind: string; model: string }[];\n    expiresAt: number;\n  } | null> {\n    const pairing = await this.#store.getPairingByUserCode(\n      normalizeUserCode(userCode),\n    );\n    if (pairing?.state !== \"pending\") return null;\n    if (pairing.expiresAt <= this.#now()) return null;\n    return {\n      label: pairing.label,\n      platform: pairing.platform,\n      daemonVersion: pairing.daemonVersion,\n      capabilities: pairing.capabilities.map((c) => ({\n        kind: c.kind,\n        model: c.model,\n      })),\n      expiresAt: pairing.expiresAt,\n    };\n  }\n\n  /** The user's paired runners, for a settings page. */\n  async runners(owner: string): Promise<RunnerRecord[]> {\n    return this.#store.listRunners(owner);\n  }\n\n  /** Revoke a runner. It stops at its next heartbeat, mid-queue. */\n  async revokeRunner(runnerId: string): Promise<void> {\n    return this.#store.revokeRunner(runnerId, this.#now());\n  }\n\n  /** Run the expiry sweep. Idempotent; safe to call on a timer or a request. */\n  async sweep(): Promise<JobRecord[]> {\n    return this.#store.expireDue(this.#now());\n  }\n}\n\n/**\n * Accept a pairing code however the user typed it — lowercase, spaces, no\n * dash. The code is displayed as `XXXX-XXXX`; refusing `xxxxxxxx` would fail\n * a user for a formatting detail they were never told mattered.\n */\nexport function normalizeUserCode(input: string): string {\n  const bare = input.toUpperCase().replace(/[^A-Z0-9]/g, \"\");\n  return bare.length === 8 ? `${bare.slice(0, 4)}-${bare.slice(4)}` : bare;\n}\n","import {\n  backendDescriptor,\n  matchAudience,\n  type Capability,\n} from \"@byollm/protocol\";\nimport { generateJobId } from \"./ids.js\";\nimport type {\n  EnqueueInput,\n  JobRecord,\n  PairingRecord,\n  RunnerRecord,\n} from \"./records.js\";\nimport type {\n  ApproveArgs,\n  ByollmStore,\n  ClaimArgs,\n  CompleteArgs,\n  CompleteResult,\n  ReleaseArgs,\n  RenewArgs,\n  RenewResult,\n  TouchArgs,\n} from \"./store.js\";\n\n/** Tunables an embedder may want to override in tests. */\nexport interface MemoryStoreOptions {\n  /** Default TTL for a job once claimable. */\n  readonly defaultTtlMs?: number;\n}\n\nconst DEFAULT_TTL_MS = 15 * 60_000;\n\n/**\n * The reference store: everything in one process, no persistence.\n *\n * This is not a toy — it is the implementation the conformance kit certifies\n * first, so its semantics *are* the specification's semantics for anything\n * the prose leaves implicit. A SQL adapter is correct when the same kit\n * passes against it.\n *\n * Concurrency: JavaScript's single-threaded turn is the atomicity primitive.\n * `claim` performs its read-decide-write with no `await` inside the critical\n * section, which is what makes {@link MUSTS.CLAIM_ATOMIC} hold here. A SQL\n * adapter gets the same property from `FOR UPDATE SKIP LOCKED`.\n */\nexport class MemoryStore implements ByollmStore {\n  readonly #jobs = new Map<string, JobRecord>();\n  readonly #runners = new Map<string, RunnerRecord>();\n  readonly #pairings = new Map<string, PairingRecord>();\n  /** Job ids the app has asked to cancel, not yet acknowledged by a runner. */\n  readonly #cancelRequests = new Set<string>();\n  readonly #defaultTtlMs: number;\n\n  constructor(options: MemoryStoreOptions = {}) {\n    this.#defaultTtlMs = options.defaultTtlMs ?? DEFAULT_TTL_MS;\n  }\n\n  // -- jobs ---------------------------------------------------------------\n\n  create(input: EnqueueInput, now: number): Promise<JobRecord> {\n    const id = input.id ?? generateJobId();\n    const existing = this.#jobs.get(id);\n    // Idempotent by caller-supplied id: re-enqueueing the same id is a no-op,\n    // so an app's retry cannot duplicate work (the house \"one door\" rule).\n    if (existing) return Promise.resolve(existing);\n\n    const dependsOn = [...(input.dependsOn ?? [])];\n    const blocked = dependsOn.some(\n      (depId) => this.#jobs.get(depId)?.state !== \"ok\",\n    );\n\n    const job: JobRecord = {\n      id,\n      kind: input.kind,\n      payload: input.payload,\n      audience: input.audience ?? \"self\",\n      owner: input.owner,\n      audienceAllow: input.audienceAllow ? [...input.audienceAllow] : undefined,\n      dependsOn,\n      state: \"queued\",\n      lease: null,\n      createdAt: now,\n      // The TTL clock starts here only if nothing blocks the job.\n      claimableAt: blocked ? null : now,\n      ttlMs: input.ttlMs ?? this.#defaultTtlMs,\n      deadlineAt: input.deadlineAt ?? null,\n      refusedBy: [],\n      attempts: 0,\n      outcome: null,\n      provenance: null,\n      updatedAt: now,\n    };\n    this.#jobs.set(id, job);\n    return Promise.resolve(job);\n  }\n\n  get(jobId: string): Promise<JobRecord | null> {\n    return Promise.resolve(this.#jobs.get(jobId) ?? null);\n  }\n\n  claim(args: ClaimArgs): Promise<JobRecord[]> {\n    // Sweep first so an expired job is never handed out.\n    this.#expireDueSync(args.now);\n\n    const claimed: JobRecord[] = [];\n    // Oldest-claimable first: a job that has waited longest goes next.\n    const candidates = [...this.#jobs.values()].sort(\n      (a, b) => (a.claimableAt ?? Infinity) - (b.claimableAt ?? Infinity),\n    );\n\n    for (const job of candidates) {\n      if (claimed.length >= args.max) break;\n      if (!this.#isClaimable(job, args)) continue;\n\n      const updated: JobRecord = {\n        ...job,\n        state: \"claimed\",\n        lease: {\n          runnerId: args.runnerId,\n          expiresAt: args.now + args.leaseMs,\n        },\n        attempts: job.attempts + 1,\n        updatedAt: args.now,\n      };\n      this.#jobs.set(job.id, updated);\n      claimed.push(updated);\n    }\n    return Promise.resolve(claimed);\n  }\n\n  /**\n   * The claim predicate, shared by `claim` and the no-runner signal so the\n   * two can never disagree about what \"a runner that could take this\" means.\n   */\n  #isClaimable(\n    job: JobRecord,\n    args: Pick<ClaimArgs, \"runnerId\" | \"runnerOwner\" | \"capabilities\" | \"now\">,\n  ): boolean {\n    if (job.state !== \"queued\") return false;\n    if (job.claimableAt === null || job.claimableAt > args.now) return false;\n    if (job.refusedBy.includes(args.runnerId)) return false;\n\n    const capability = capabilityFor(args.capabilities, job.kind);\n    if (!capability) return false;\n\n    const match = matchAudience(\n      {\n        owner: job.owner,\n        audience: job.audience,\n        audienceAllow: job.audienceAllow,\n      },\n      {\n        owner: args.runnerOwner,\n        offerScope: capability.offerScope,\n        // From the registry, not a local guess — the subscription self-lock\n        // must mean the same thing on both sides of the wire.\n        account: backendDescriptor(capability.backendId).account,\n        // The server cannot see a remote daemon's local allowlist and must\n        // not pretend to (protocol §4.2). It admits the job here; the daemon\n        // is the enforcing side and releases with `refused` if its own list\n        // says no.\n        locallyAllows: () => true,\n      },\n    );\n    return match.ok;\n  }\n\n  renewLeases(args: RenewArgs): Promise<RenewResult> {\n    this.#expireDueSync(args.now);\n\n    const renewed: { jobId: string; expiresAt: number }[] = [];\n    const lost: string[] = [];\n\n    for (const jobId of args.jobIds) {\n      const job = this.#jobs.get(jobId);\n      if (!job || job.lease?.runnerId !== args.runnerId) {\n        // Either reclaimed by someone else or terminal — either way this\n        // runner must stop working on it.\n        lost.push(jobId);\n        continue;\n      }\n      if (job.state !== \"claimed\" && job.state !== \"running\") {\n        lost.push(jobId);\n        continue;\n      }\n      const expiresAt = args.now + args.leaseMs;\n      this.#jobs.set(jobId, {\n        ...job,\n        state: \"running\",\n        lease: { runnerId: args.runnerId, expiresAt },\n        updatedAt: args.now,\n      });\n      renewed.push({ jobId, expiresAt });\n    }\n    return Promise.resolve({ renewed, lost });\n  }\n\n  complete(args: CompleteArgs): Promise<CompleteResult> {\n    const job = this.#jobs.get(args.jobId);\n    if (!job) return Promise.resolve({ accepted: false, job: null });\n\n    // First terminal outcome wins; a later submission is discarded, not\n    // applied ({@link MUSTS.RESULT_IDEMPOTENT}).\n    if (\n      job.state === \"ok\" ||\n      job.state === \"error\" ||\n      job.state === \"canceled\"\n    ) {\n      return Promise.resolve({ accepted: false, job });\n    }\n    if (job.state === \"expired\") {\n      return Promise.resolve({ accepted: false, job });\n    }\n    // A runner that lost its lease may not write a result\n    // ({@link MUSTS.LEASE_HONORED}).\n    if (job.lease?.runnerId !== args.runnerId) {\n      return Promise.resolve({ accepted: false, job });\n    }\n\n    const state =\n      args.outcome.outcome === \"ok\"\n        ? \"ok\"\n        : args.outcome.outcome === \"canceled\"\n          ? \"canceled\"\n          : \"error\";\n\n    const updated: JobRecord = {\n      ...job,\n      state,\n      lease: null,\n      outcome: args.outcome,\n      provenance: args.provenance,\n      updatedAt: args.now,\n    };\n    this.#jobs.set(job.id, updated);\n    this.#cancelRequests.delete(job.id);\n\n    if (state === \"ok\") this.#unblockDependents(job.id, args.now);\n\n    return Promise.resolve({ accepted: true, job: updated });\n  }\n\n  /**\n   * Start the TTL clock on anything this job was blocking.\n   *\n   * Deliberately only on `ok`: a dependency that errored leaves its dependents\n   * blocked forever rather than releasing them into a run whose input never\n   * arrived. They expire at their absolute deadline if one was set, and the\n   * app sees a chain that stopped where it broke.\n   */\n  #unblockDependents(completedId: string, now: number): void {\n    for (const job of this.#jobs.values()) {\n      if (job.claimableAt !== null) continue;\n      if (!job.dependsOn.includes(completedId)) continue;\n      const ready = job.dependsOn.every(\n        (depId) => this.#jobs.get(depId)?.state === \"ok\",\n      );\n      if (ready) {\n        this.#jobs.set(job.id, { ...job, claimableAt: now, updatedAt: now });\n      }\n    }\n  }\n\n  release(args: ReleaseArgs): Promise<string[]> {\n    const released: string[] = [];\n    for (const jobId of args.jobIds) {\n      const job = this.#jobs.get(jobId);\n      if (!job || job.lease?.runnerId !== args.runnerId) continue;\n\n      this.#jobs.set(jobId, {\n        ...job,\n        state: \"queued\",\n        lease: null,\n        // Newly available again, so the TTL clock restarts here too.\n        claimableAt: args.now,\n        // A refusal is remembered, or the pair spins between claim and\n        // release forever ({@link MUSTS.REFUSAL_NOT_REOFFERED}).\n        refusedBy:\n          args.reason === \"refused\"\n            ? [...new Set([...job.refusedBy, args.runnerId])]\n            : job.refusedBy,\n        updatedAt: args.now,\n      });\n      released.push(jobId);\n    }\n    return Promise.resolve(released);\n  }\n\n  expireDue(now: number): Promise<JobRecord[]> {\n    return Promise.resolve(this.#expireDueSync(now));\n  }\n\n  /**\n   * Lease expiry and TTL expiry in one idempotent sweep.\n   *\n   * Order matters: a lease is reclaimed *before* the TTL is judged, so a job\n   * whose runner died is offered again rather than being expired for having\n   * sat in `claimed` too long.\n   */\n  #expireDueSync(now: number): JobRecord[] {\n    const changed: JobRecord[] = [];\n\n    for (const job of this.#jobs.values()) {\n      if (\n        (job.state === \"claimed\" || job.state === \"running\") &&\n        job.lease !== null &&\n        job.lease.expiresAt <= now\n      ) {\n        const requeued: JobRecord = {\n          ...job,\n          state: \"queued\",\n          lease: null,\n          // The TTL clock restarts: it measures how long a job has waited\n          // *unclaimed*, and this job has just become available again. Without\n          // this, a job whose runner died would expire for time it spent being\n          // actively worked on — losing exactly the work `kill -9` recovery\n          // exists to save. Total lifetime is bounded by `deadlineAt`, which\n          // is absolute and unaffected by reclaim.\n          claimableAt: now,\n          updatedAt: now,\n        };\n        this.#jobs.set(job.id, requeued);\n        changed.push(requeued);\n      }\n    }\n\n    for (const job of this.#jobs.values()) {\n      if (job.state !== \"queued\") continue;\n      const pastDeadline = job.deadlineAt !== null && job.deadlineAt <= now;\n      const pastTtl =\n        job.claimableAt !== null && job.claimableAt + job.ttlMs <= now;\n      if (!pastDeadline && !pastTtl) continue;\n\n      const expired: JobRecord = {\n        ...job,\n        state: \"expired\",\n        lease: null,\n        updatedAt: now,\n      };\n      this.#jobs.set(job.id, expired);\n      changed.push(expired);\n    }\n    return changed;\n  }\n\n  cancel(jobId: string, now: number): Promise<JobRecord | null> {\n    const job = this.#jobs.get(jobId);\n    if (!job) return Promise.resolve(null);\n    if (job.state === \"queued\") {\n      const canceled: JobRecord = {\n        ...job,\n        state: \"canceled\",\n        lease: null,\n        updatedAt: now,\n      };\n      this.#jobs.set(jobId, canceled);\n      return Promise.resolve(canceled);\n    }\n    if (job.state === \"claimed\" || job.state === \"running\") {\n      // Held by a runner: the cancel travels on the next heartbeat and the\n      // runner reports `canceled` itself, so the job's own state waits.\n      this.#cancelRequests.add(jobId);\n      return Promise.resolve(job);\n    }\n    return Promise.resolve(job);\n  }\n\n  listClaimedBy(runnerId: string): Promise<JobRecord[]> {\n    return Promise.resolve(\n      [...this.#jobs.values()].filter(\n        (job) => job.lease?.runnerId === runnerId,\n      ),\n    );\n  }\n\n  listCancelRequests(runnerId: string): Promise<string[]> {\n    return Promise.resolve(\n      [...this.#cancelRequests].filter(\n        (jobId) => this.#jobs.get(jobId)?.lease?.runnerId === runnerId,\n      ),\n    );\n  }\n\n  // -- pairing and runners -------------------------------------------------\n\n  createPairing(record: PairingRecord): Promise<void> {\n    this.#pairings.set(record.deviceCodeHash, record);\n    return Promise.resolve();\n  }\n\n  getPairingByDeviceCodeHash(hash: string): Promise<PairingRecord | null> {\n    return Promise.resolve(this.#pairings.get(hash) ?? null);\n  }\n\n  getPairingByUserCode(userCode: string): Promise<PairingRecord | null> {\n    for (const pairing of this.#pairings.values()) {\n      if (pairing.userCode === userCode) return Promise.resolve(pairing);\n    }\n    return Promise.resolve(null);\n  }\n\n  approvePairing(args: ApproveArgs): Promise<RunnerRecord> {\n    const pairing = [...this.#pairings.values()].find(\n      (p) => p.userCode === args.userCode,\n    );\n    if (!pairing) throw new Error(`unknown pairing code: ${args.userCode}`);\n    if (pairing.expiresAt <= args.now) {\n      throw new Error(\"pairing code has expired\");\n    }\n    if (pairing.state !== \"pending\") {\n      throw new Error(`pairing is already ${pairing.state}`);\n    }\n\n    const runner: RunnerRecord = {\n      id: args.runnerId,\n      owner: args.owner,\n      tokenHash: args.tokenHash,\n      label: pairing.label,\n      platform: pairing.platform,\n      daemonVersion: pairing.daemonVersion,\n      capabilities: pairing.capabilities,\n      paused: false,\n      revokedAt: null,\n      lastHeartbeatAt: args.now,\n      createdAt: args.now,\n    };\n    this.#runners.set(runner.id, runner);\n    this.#pairings.set(pairing.deviceCodeHash, {\n      ...pairing,\n      state: \"approved\",\n      owner: args.owner,\n      runnerId: runner.id,\n      runnerTokenOnce: args.runnerToken,\n    });\n    return Promise.resolve(runner);\n  }\n\n  denyPairing(userCode: string, _now: number): Promise<void> {\n    const pairing = [...this.#pairings.values()].find(\n      (p) => p.userCode === userCode,\n    );\n    if (pairing) {\n      this.#pairings.set(pairing.deviceCodeHash, {\n        ...pairing,\n        state: \"denied\",\n      });\n    }\n    return Promise.resolve();\n  }\n\n  consumePairingToken(deviceCodeHash: string): Promise<void> {\n    const pairing = this.#pairings.get(deviceCodeHash);\n    if (pairing) {\n      this.#pairings.set(deviceCodeHash, {\n        ...pairing,\n        runnerTokenOnce: null,\n      });\n    }\n    return Promise.resolve();\n  }\n\n  getRunnerByTokenHash(hash: string): Promise<RunnerRecord | null> {\n    for (const runner of this.#runners.values()) {\n      if (runner.tokenHash === hash) return Promise.resolve(runner);\n    }\n    return Promise.resolve(null);\n  }\n\n  getRunner(runnerId: string): Promise<RunnerRecord | null> {\n    return Promise.resolve(this.#runners.get(runnerId) ?? null);\n  }\n\n  touchRunner(args: TouchArgs): Promise<RunnerRecord | null> {\n    const runner = this.#runners.get(args.runnerId);\n    if (!runner) return Promise.resolve(null);\n    const updated: RunnerRecord = {\n      ...runner,\n      capabilities: args.capabilities,\n      daemonVersion: args.daemonVersion,\n      paused: args.paused,\n      lastHeartbeatAt: args.now,\n    };\n    this.#runners.set(runner.id, updated);\n    return Promise.resolve(updated);\n  }\n\n  revokeRunner(runnerId: string, now: number): Promise<void> {\n    const runner = this.#runners.get(runnerId);\n    // Revocation is one-way: an already-revoked runner keeps its first\n    // revocation time rather than being re-stamped.\n    if (runner?.revokedAt === null) {\n      this.#runners.set(runnerId, { ...runner, revokedAt: now });\n    }\n    return Promise.resolve();\n  }\n\n  listRunners(owner?: string): Promise<RunnerRecord[]> {\n    const all = [...this.#runners.values()];\n    return Promise.resolve(\n      owner === undefined ? all : all.filter((r) => r.owner === owner),\n    );\n  }\n\n  // -- test/demo helpers ---------------------------------------------------\n\n  /** All jobs, for demos and assertions. Not part of the store interface. */\n  allJobs(): JobRecord[] {\n    return [...this.#jobs.values()];\n  }\n}\n\n/** The capability that would serve a kind, if any. */\nexport function capabilityFor(\n  capabilities: readonly Capability[],\n  kind: string,\n): Capability | undefined {\n  return capabilities.find((c) => c.kind === kind);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;AAAA,EACE;AAAA,EACA;AAAA,OAGK;AAeP,IAAM,sBAAsB;AA2ErB,IAAM,YAAN,MAAgB;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,SAA2B;AACrC,SAAK,SAAS,QAAQ;AACtB,SAAK,OAAO,QAAQ,OAAO,KAAK;AAChC,SAAK,cAAc,QAAQ,cAAc;AAEzC,UAAM,OAA4B;AAAA,MAChC,GAAI,QAAQ,oBAAoB,SAC5B,CAAC,IACD,EAAE,SAAS,QAAQ,gBAAgB;AAAA,MACvC,MAAM,CAAC,UAAU,KAAK,OAAO,KAAK;AAAA,MAClC,cAAc,OAAO,UAAU;AAC7B,cAAM,MAAM,MAAM,KAAK,OAAO,IAAI,KAAK;AACvC,YAAI,CAAC;AACH,iBAAO,EAAE,WAAW,OAAO,QAAQ,eAAe,SAAS,MAAM;AAEnE,YAAI,IAAI,gBAAgB,MAAM;AAC5B,iBAAO,EAAE,WAAW,MAAM,SAAS,KAAK;AAAA,QAC1C;AACA,cAAM,eAAe,MAAM,KAAK,mBAAmB;AAAA,UACjD,MAAM,IAAI;AAAA,UACV,OAAO,IAAI;AAAA,UACX,UAAU,IAAI;AAAA,UACd,GAAI,IAAI,kBAAkB,SACtB,CAAC,IACD,EAAE,eAAe,IAAI,cAAc;AAAA,QACzC,CAAC;AACD,eAAO;AAAA,UACL,WAAW,aAAa;AAAA,UACxB,GAAI,aAAa,WAAW,SACxB,CAAC,IACD,EAAE,QAAQ,aAAa,OAAO;AAAA,UAClC,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AACA,SAAK,YAAY,QAAQ,WAAW,IAAI,KAAK,IAAI,gBAAgB,IAAI;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,QAAQ,OAAyC;AACrD,UAAM,SAAS,MAAM,KAAK,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC;AAC1D,WAAO;AAAA,MACL,IAAI,OAAO;AAAA,MACX;AAAA,MACA,QAAQ,CAAC,YACP,KAAK,UAAU,QAAQ,OAAO,IAAI,OAAO;AAAA,MAC3C,QAAQ,YAAY;AAClB,cAAM,KAAK,OAAO,OAAO,EAAE;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,IAAI,OAA0C;AAClD,UAAM,KAAK,OAAO,UAAU,KAAK,KAAK,CAAC;AACvC,WAAO,KAAK,OAAO,IAAI,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,OAAO,OAAgD;AAC3D,UAAM,MAAM,MAAM,KAAK,IAAI,KAAK;AAChC,QAAI,CAAC,IAAK,QAAO;AACjB,WAAO;AAAA,MACL,OAAO,IAAI;AAAA,MACX,OAAO,IAAI;AAAA,MACX,GAAI,IAAI,YAAY,OAAO,CAAC,IAAI,EAAE,SAAS,IAAI,QAAQ;AAAA,MACvD,GAAI,IAAI,eAAe,OAAO,CAAC,IAAI,EAAE,YAAY,IAAI,WAAW;AAAA,IAClE;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,OAAO,OAA0C;AACrD,WAAO,KAAK,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,mBACJ,OAC6B;AAC7B,UAAM,MAAM,KAAK,KAAK;AACtB,UAAM,MAAM,MAAM,KAAK,OAAO,YAAY;AAC1C,UAAM,OAAO,IAAI;AAAA,MACf,CAAC,WACC,OAAO,cAAc,QACrB,CAAC,OAAO,UACR,MAAM,OAAO,mBAAmB,KAAK;AAAA,IACzC;AAEA,QAAI,IAAI,WAAW,GAAG;AACpB,aAAO,EAAE,WAAW,OAAO,QAAQ,oBAAoB,YAAY,EAAE;AAAA,IACvE;AACA,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,EAAE,WAAW,OAAO,QAAQ,oBAAoB,YAAY,EAAE;AAAA,IACvE;AAEA,QAAI,UAAU;AACd,QAAI,WAAW;AACf,eAAW,UAAU,MAAM;AACzB,YAAM,aAAa,OAAO,aAAa,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM,IAAI;AACxE,UAAI,CAAC,WAAY;AACjB,iBAAW;AAEX,YAAM,QAAQ;AAAA,QACZ;AAAA,UACE,OAAO,MAAM;AAAA,UACb,UAAU,MAAM,YAAY;AAAA,UAC5B,eAAe,MAAM;AAAA,QACvB;AAAA,QACA;AAAA,UACE,OAAO,OAAO;AAAA,UACd,YAAY,WAAW;AAAA,UACvB,SAAS,kBAAkB,WAAW,SAAS,EAAE;AAAA;AAAA;AAAA,UAGjD,eAAe,MAAM;AAAA,QACvB;AAAA,MACF;AACA,UAAI,MAAM,GAAI,aAAY;AAAA,IAC5B;AAEA,QAAI,YAAY,GAAG;AACjB,aAAO;AAAA,QACL,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,aAAO;AAAA,QACL,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,IACF;AACA,WAAO,EAAE,WAAW,MAAM,YAAY,SAAS;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,eAAe,MAGK;AACxB,UAAM,QAAQ,oBAAoB;AAClC,WAAO,KAAK,OAAO,eAAe;AAAA,MAChC,UAAU,kBAAkB,KAAK,QAAQ;AAAA,MACzC,OAAO,KAAK;AAAA,MACZ,UAAU,iBAAiB;AAAA,MAC3B,aAAa;AAAA,MACb,WAAW,WAAW,KAAK;AAAA,MAC3B,KAAK,KAAK,KAAK;AAAA,IACjB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,YAAY,UAAiC;AACjD,WAAO,KAAK,OAAO,YAAY,kBAAkB,QAAQ,GAAG,KAAK,KAAK,CAAC;AAAA,EACzE;AAAA;AAAA,EAGA,MAAM,eAAe,UAMX;AACR,UAAM,UAAU,MAAM,KAAK,OAAO;AAAA,MAChC,kBAAkB,QAAQ;AAAA,IAC5B;AACA,QAAI,SAAS,UAAU,UAAW,QAAO;AACzC,QAAI,QAAQ,aAAa,KAAK,KAAK,EAAG,QAAO;AAC7C,WAAO;AAAA,MACL,OAAO,QAAQ;AAAA,MACf,UAAU,QAAQ;AAAA,MAClB,eAAe,QAAQ;AAAA,MACvB,cAAc,QAAQ,aAAa,IAAI,CAAC,OAAO;AAAA,QAC7C,MAAM,EAAE;AAAA,QACR,OAAO,EAAE;AAAA,MACX,EAAE;AAAA,MACF,WAAW,QAAQ;AAAA,IACrB;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,QAAQ,OAAwC;AACpD,WAAO,KAAK,OAAO,YAAY,KAAK;AAAA,EACtC;AAAA;AAAA,EAGA,MAAM,aAAa,UAAiC;AAClD,WAAO,KAAK,OAAO,aAAa,UAAU,KAAK,KAAK,CAAC;AAAA,EACvD;AAAA;AAAA,EAGA,MAAM,QAA8B;AAClC,WAAO,KAAK,OAAO,UAAU,KAAK,KAAK,CAAC;AAAA,EAC1C;AACF;AAOO,SAAS,kBAAkB,OAAuB;AACvD,QAAM,OAAO,MAAM,YAAY,EAAE,QAAQ,cAAc,EAAE;AACzD,SAAO,KAAK,WAAW,IAAI,GAAG,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,KAAK;AACtE;;;AC5UA;AAAA,EACE,qBAAAA;AAAA,EACA,iBAAAC;AAAA,OAEK;AA0BP,IAAM,iBAAiB,KAAK;AAerB,IAAM,cAAN,MAAyC;AAAA,EACrC,QAAQ,oBAAI,IAAuB;AAAA,EACnC,WAAW,oBAAI,IAA0B;AAAA,EACzC,YAAY,oBAAI,IAA2B;AAAA;AAAA,EAE3C,kBAAkB,oBAAI,IAAY;AAAA,EAClC;AAAA,EAET,YAAY,UAA8B,CAAC,GAAG;AAC5C,SAAK,gBAAgB,QAAQ,gBAAgB;AAAA,EAC/C;AAAA;AAAA,EAIA,OAAO,OAAqB,KAAiC;AAC3D,UAAM,KAAK,MAAM,MAAM,cAAc;AACrC,UAAM,WAAW,KAAK,MAAM,IAAI,EAAE;AAGlC,QAAI,SAAU,QAAO,QAAQ,QAAQ,QAAQ;AAE7C,UAAM,YAAY,CAAC,GAAI,MAAM,aAAa,CAAC,CAAE;AAC7C,UAAM,UAAU,UAAU;AAAA,MACxB,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG,UAAU;AAAA,IAC9C;AAEA,UAAM,MAAiB;AAAA,MACrB;AAAA,MACA,MAAM,MAAM;AAAA,MACZ,SAAS,MAAM;AAAA,MACf,UAAU,MAAM,YAAY;AAAA,MAC5B,OAAO,MAAM;AAAA,MACb,eAAe,MAAM,gBAAgB,CAAC,GAAG,MAAM,aAAa,IAAI;AAAA,MAChE;AAAA,MACA,OAAO;AAAA,MACP,OAAO;AAAA,MACP,WAAW;AAAA;AAAA,MAEX,aAAa,UAAU,OAAO;AAAA,MAC9B,OAAO,MAAM,SAAS,KAAK;AAAA,MAC3B,YAAY,MAAM,cAAc;AAAA,MAChC,WAAW,CAAC;AAAA,MACZ,UAAU;AAAA,MACV,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,WAAW;AAAA,IACb;AACA,SAAK,MAAM,IAAI,IAAI,GAAG;AACtB,WAAO,QAAQ,QAAQ,GAAG;AAAA,EAC5B;AAAA,EAEA,IAAI,OAA0C;AAC5C,WAAO,QAAQ,QAAQ,KAAK,MAAM,IAAI,KAAK,KAAK,IAAI;AAAA,EACtD;AAAA,EAEA,MAAM,MAAuC;AAE3C,SAAK,eAAe,KAAK,GAAG;AAE5B,UAAM,UAAuB,CAAC;AAE9B,UAAM,aAAa,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE;AAAA,MAC1C,CAAC,GAAG,OAAO,EAAE,eAAe,aAAa,EAAE,eAAe;AAAA,IAC5D;AAEA,eAAW,OAAO,YAAY;AAC5B,UAAI,QAAQ,UAAU,KAAK,IAAK;AAChC,UAAI,CAAC,KAAK,aAAa,KAAK,IAAI,EAAG;AAEnC,YAAM,UAAqB;AAAA,QACzB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA,UACL,UAAU,KAAK;AAAA,UACf,WAAW,KAAK,MAAM,KAAK;AAAA,QAC7B;AAAA,QACA,UAAU,IAAI,WAAW;AAAA,QACzB,WAAW,KAAK;AAAA,MAClB;AACA,WAAK,MAAM,IAAI,IAAI,IAAI,OAAO;AAC9B,cAAQ,KAAK,OAAO;AAAA,IACtB;AACA,WAAO,QAAQ,QAAQ,OAAO;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aACE,KACA,MACS;AACT,QAAI,IAAI,UAAU,SAAU,QAAO;AACnC,QAAI,IAAI,gBAAgB,QAAQ,IAAI,cAAc,KAAK,IAAK,QAAO;AACnE,QAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,EAAG,QAAO;AAElD,UAAM,aAAa,cAAc,KAAK,cAAc,IAAI,IAAI;AAC5D,QAAI,CAAC,WAAY,QAAO;AAExB,UAAM,QAAQC;AAAA,MACZ;AAAA,QACE,OAAO,IAAI;AAAA,QACX,UAAU,IAAI;AAAA,QACd,eAAe,IAAI;AAAA,MACrB;AAAA,MACA;AAAA,QACE,OAAO,KAAK;AAAA,QACZ,YAAY,WAAW;AAAA;AAAA;AAAA,QAGvB,SAASC,mBAAkB,WAAW,SAAS,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA,QAKjD,eAAe,MAAM;AAAA,MACvB;AAAA,IACF;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,YAAY,MAAuC;AACjD,SAAK,eAAe,KAAK,GAAG;AAE5B,UAAM,UAAkD,CAAC;AACzD,UAAM,OAAiB,CAAC;AAExB,eAAW,SAAS,KAAK,QAAQ;AAC/B,YAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAChC,UAAI,CAAC,OAAO,IAAI,OAAO,aAAa,KAAK,UAAU;AAGjD,aAAK,KAAK,KAAK;AACf;AAAA,MACF;AACA,UAAI,IAAI,UAAU,aAAa,IAAI,UAAU,WAAW;AACtD,aAAK,KAAK,KAAK;AACf;AAAA,MACF;AACA,YAAM,YAAY,KAAK,MAAM,KAAK;AAClC,WAAK,MAAM,IAAI,OAAO;AAAA,QACpB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO,EAAE,UAAU,KAAK,UAAU,UAAU;AAAA,QAC5C,WAAW,KAAK;AAAA,MAClB,CAAC;AACD,cAAQ,KAAK,EAAE,OAAO,UAAU,CAAC;AAAA,IACnC;AACA,WAAO,QAAQ,QAAQ,EAAE,SAAS,KAAK,CAAC;AAAA,EAC1C;AAAA,EAEA,SAAS,MAA6C;AACpD,UAAM,MAAM,KAAK,MAAM,IAAI,KAAK,KAAK;AACrC,QAAI,CAAC,IAAK,QAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,KAAK,KAAK,CAAC;AAI/D,QACE,IAAI,UAAU,QACd,IAAI,UAAU,WACd,IAAI,UAAU,YACd;AACA,aAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,IAAI,CAAC;AAAA,IACjD;AACA,QAAI,IAAI,UAAU,WAAW;AAC3B,aAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,IAAI,CAAC;AAAA,IACjD;AAGA,QAAI,IAAI,OAAO,aAAa,KAAK,UAAU;AACzC,aAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,IAAI,CAAC;AAAA,IACjD;AAEA,UAAM,QACJ,KAAK,QAAQ,YAAY,OACrB,OACA,KAAK,QAAQ,YAAY,aACvB,aACA;AAER,UAAM,UAAqB;AAAA,MACzB,GAAG;AAAA,MACH;AAAA,MACA,OAAO;AAAA,MACP,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK;AAAA,IAClB;AACA,SAAK,MAAM,IAAI,IAAI,IAAI,OAAO;AAC9B,SAAK,gBAAgB,OAAO,IAAI,EAAE;AAElC,QAAI,UAAU,KAAM,MAAK,mBAAmB,IAAI,IAAI,KAAK,GAAG;AAE5D,WAAO,QAAQ,QAAQ,EAAE,UAAU,MAAM,KAAK,QAAQ,CAAC;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,mBAAmB,aAAqB,KAAmB;AACzD,eAAW,OAAO,KAAK,MAAM,OAAO,GAAG;AACrC,UAAI,IAAI,gBAAgB,KAAM;AAC9B,UAAI,CAAC,IAAI,UAAU,SAAS,WAAW,EAAG;AAC1C,YAAM,QAAQ,IAAI,UAAU;AAAA,QAC1B,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG,UAAU;AAAA,MAC9C;AACA,UAAI,OAAO;AACT,aAAK,MAAM,IAAI,IAAI,IAAI,EAAE,GAAG,KAAK,aAAa,KAAK,WAAW,IAAI,CAAC;AAAA,MACrE;AAAA,IACF;AAAA,EACF;AAAA,EAEA,QAAQ,MAAsC;AAC5C,UAAM,WAAqB,CAAC;AAC5B,eAAW,SAAS,KAAK,QAAQ;AAC/B,YAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAChC,UAAI,CAAC,OAAO,IAAI,OAAO,aAAa,KAAK,SAAU;AAEnD,WAAK,MAAM,IAAI,OAAO;AAAA,QACpB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA;AAAA,QAEP,aAAa,KAAK;AAAA;AAAA;AAAA,QAGlB,WACE,KAAK,WAAW,YACZ,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,IAAI,WAAW,KAAK,QAAQ,CAAC,CAAC,IAC9C,IAAI;AAAA,QACV,WAAW,KAAK;AAAA,MAClB,CAAC;AACD,eAAS,KAAK,KAAK;AAAA,IACrB;AACA,WAAO,QAAQ,QAAQ,QAAQ;AAAA,EACjC;AAAA,EAEA,UAAU,KAAmC;AAC3C,WAAO,QAAQ,QAAQ,KAAK,eAAe,GAAG,CAAC;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAe,KAA0B;AACvC,UAAM,UAAuB,CAAC;AAE9B,eAAW,OAAO,KAAK,MAAM,OAAO,GAAG;AACrC,WACG,IAAI,UAAU,aAAa,IAAI,UAAU,cAC1C,IAAI,UAAU,QACd,IAAI,MAAM,aAAa,KACvB;AACA,cAAM,WAAsB;AAAA,UAC1B,GAAG;AAAA,UACH,OAAO;AAAA,UACP,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAOP,aAAa;AAAA,UACb,WAAW;AAAA,QACb;AACA,aAAK,MAAM,IAAI,IAAI,IAAI,QAAQ;AAC/B,gBAAQ,KAAK,QAAQ;AAAA,MACvB;AAAA,IACF;AAEA,eAAW,OAAO,KAAK,MAAM,OAAO,GAAG;AACrC,UAAI,IAAI,UAAU,SAAU;AAC5B,YAAM,eAAe,IAAI,eAAe,QAAQ,IAAI,cAAc;AAClE,YAAM,UACJ,IAAI,gBAAgB,QAAQ,IAAI,cAAc,IAAI,SAAS;AAC7D,UAAI,CAAC,gBAAgB,CAAC,QAAS;AAE/B,YAAM,UAAqB;AAAA,QACzB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA,QACP,WAAW;AAAA,MACb;AACA,WAAK,MAAM,IAAI,IAAI,IAAI,OAAO;AAC9B,cAAQ,KAAK,OAAO;AAAA,IACtB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,OAAe,KAAwC;AAC5D,UAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAChC,QAAI,CAAC,IAAK,QAAO,QAAQ,QAAQ,IAAI;AACrC,QAAI,IAAI,UAAU,UAAU;AAC1B,YAAM,WAAsB;AAAA,QAC1B,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA,QACP,WAAW;AAAA,MACb;AACA,WAAK,MAAM,IAAI,OAAO,QAAQ;AAC9B,aAAO,QAAQ,QAAQ,QAAQ;AAAA,IACjC;AACA,QAAI,IAAI,UAAU,aAAa,IAAI,UAAU,WAAW;AAGtD,WAAK,gBAAgB,IAAI,KAAK;AAC9B,aAAO,QAAQ,QAAQ,GAAG;AAAA,IAC5B;AACA,WAAO,QAAQ,QAAQ,GAAG;AAAA,EAC5B;AAAA,EAEA,cAAc,UAAwC;AACpD,WAAO,QAAQ;AAAA,MACb,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE;AAAA,QACvB,CAAC,QAAQ,IAAI,OAAO,aAAa;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,mBAAmB,UAAqC;AACtD,WAAO,QAAQ;AAAA,MACb,CAAC,GAAG,KAAK,eAAe,EAAE;AAAA,QACxB,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG,OAAO,aAAa;AAAA,MACxD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIA,cAAc,QAAsC;AAClD,SAAK,UAAU,IAAI,OAAO,gBAAgB,MAAM;AAChD,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,2BAA2B,MAA6C;AACtE,WAAO,QAAQ,QAAQ,KAAK,UAAU,IAAI,IAAI,KAAK,IAAI;AAAA,EACzD;AAAA,EAEA,qBAAqB,UAAiD;AACpE,eAAW,WAAW,KAAK,UAAU,OAAO,GAAG;AAC7C,UAAI,QAAQ,aAAa,SAAU,QAAO,QAAQ,QAAQ,OAAO;AAAA,IACnE;AACA,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,eAAe,MAA0C;AACvD,UAAM,UAAU,CAAC,GAAG,KAAK,UAAU,OAAO,CAAC,EAAE;AAAA,MAC3C,CAAC,MAAM,EAAE,aAAa,KAAK;AAAA,IAC7B;AACA,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,yBAAyB,KAAK,QAAQ,EAAE;AACtE,QAAI,QAAQ,aAAa,KAAK,KAAK;AACjC,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AACA,QAAI,QAAQ,UAAU,WAAW;AAC/B,YAAM,IAAI,MAAM,sBAAsB,QAAQ,KAAK,EAAE;AAAA,IACvD;AAEA,UAAM,SAAuB;AAAA,MAC3B,IAAI,KAAK;AAAA,MACT,OAAO,KAAK;AAAA,MACZ,WAAW,KAAK;AAAA,MAChB,OAAO,QAAQ;AAAA,MACf,UAAU,QAAQ;AAAA,MAClB,eAAe,QAAQ;AAAA,MACvB,cAAc,QAAQ;AAAA,MACtB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,iBAAiB,KAAK;AAAA,MACtB,WAAW,KAAK;AAAA,IAClB;AACA,SAAK,SAAS,IAAI,OAAO,IAAI,MAAM;AACnC,SAAK,UAAU,IAAI,QAAQ,gBAAgB;AAAA,MACzC,GAAG;AAAA,MACH,OAAO;AAAA,MACP,OAAO,KAAK;AAAA,MACZ,UAAU,OAAO;AAAA,MACjB,iBAAiB,KAAK;AAAA,IACxB,CAAC;AACD,WAAO,QAAQ,QAAQ,MAAM;AAAA,EAC/B;AAAA,EAEA,YAAY,UAAkB,MAA6B;AACzD,UAAM,UAAU,CAAC,GAAG,KAAK,UAAU,OAAO,CAAC,EAAE;AAAA,MAC3C,CAAC,MAAM,EAAE,aAAa;AAAA,IACxB;AACA,QAAI,SAAS;AACX,WAAK,UAAU,IAAI,QAAQ,gBAAgB;AAAA,QACzC,GAAG;AAAA,QACH,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AACA,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,oBAAoB,gBAAuC;AACzD,UAAM,UAAU,KAAK,UAAU,IAAI,cAAc;AACjD,QAAI,SAAS;AACX,WAAK,UAAU,IAAI,gBAAgB;AAAA,QACjC,GAAG;AAAA,QACH,iBAAiB;AAAA,MACnB,CAAC;AAAA,IACH;AACA,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,qBAAqB,MAA4C;AAC/D,eAAW,UAAU,KAAK,SAAS,OAAO,GAAG;AAC3C,UAAI,OAAO,cAAc,KAAM,QAAO,QAAQ,QAAQ,MAAM;AAAA,IAC9D;AACA,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,UAAU,UAAgD;AACxD,WAAO,QAAQ,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI;AAAA,EAC5D;AAAA,EAEA,YAAY,MAA+C;AACzD,UAAM,SAAS,KAAK,SAAS,IAAI,KAAK,QAAQ;AAC9C,QAAI,CAAC,OAAQ,QAAO,QAAQ,QAAQ,IAAI;AACxC,UAAM,UAAwB;AAAA,MAC5B,GAAG;AAAA,MACH,cAAc,KAAK;AAAA,MACnB,eAAe,KAAK;AAAA,MACpB,QAAQ,KAAK;AAAA,MACb,iBAAiB,KAAK;AAAA,IACxB;AACA,SAAK,SAAS,IAAI,OAAO,IAAI,OAAO;AACpC,WAAO,QAAQ,QAAQ,OAAO;AAAA,EAChC;AAAA,EAEA,aAAa,UAAkB,KAA4B;AACzD,UAAM,SAAS,KAAK,SAAS,IAAI,QAAQ;AAGzC,QAAI,QAAQ,cAAc,MAAM;AAC9B,WAAK,SAAS,IAAI,UAAU,EAAE,GAAG,QAAQ,WAAW,IAAI,CAAC;AAAA,IAC3D;AACA,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,YAAY,OAAyC;AACnD,UAAM,MAAM,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC;AACtC,WAAO,QAAQ;AAAA,MACb,UAAU,SAAY,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK;AAAA,IACjE;AAAA,EACF;AAAA;AAAA;AAAA,EAKA,UAAuB;AACrB,WAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC;AAAA,EAChC;AACF;AAGO,SAAS,cACd,cACA,MACwB;AACxB,SAAO,aAAa,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AACjD;","names":["backendDescriptor","matchAudience","matchAudience","backendDescriptor"]}
+{"version":3,"sources":["../src/app.ts","../src/keys.ts","../src/memory.ts"],"sourcesContent":["import {\n  ENVELOPE_MAX_AGE_MS,\n  KindedPayload,\n  keyId,\n  payloadTextLength,\n  publicIdentityOf,\n  seal,\n  sizeClassOf,\n  type StoredKeys,\n  backendDescriptor,\n  matchAudience,\n  type DeliveredResult,\n  type JobKind,\n} from \"@byollm/protocol\";\nimport {\n  PollingDelivery,\n  type PollingDeliveryDeps,\n  type ResultDelivery,\n  type WaitOptions,\n} from \"./delivery.js\";\nimport {\n  generateJobId,\n  generateRunnerId,\n  generateRunnerToken,\n  hashSecret,\n} from \"./ids.js\";\nimport type { EnqueueInput, JobRecord, RunnerRecord } from \"./records.js\";\nimport type { ByollmStore } from \"./store.js\";\n\n/**\n * How long since a runner's last heartbeat before it stops counting as live.\n * Three heartbeats of slack at the daemon's ~10s cadence.\n */\nconst DEFAULT_LIVENESS_MS = 35_000;\n\n/** Why a job cannot presently run. */\nexport type NoRunnerReason =\n  | \"no-runner-paired\"\n  | \"no-runner-online\"\n  | \"no-matching-capability\"\n  | \"audience-admits-nobody\";\n\n/**\n * The no-runner signal (byollm_001 Rev 1 §D).\n *\n * `available: false` means an app should fall back — hosted model, \"start\n * your runner\" prompt — rather than awaiting something that will never\n * resolve. A job still blocked on dependencies is **not** unavailable; it is\n * waiting, and saying otherwise would make every multi-job flow look broken\n * ({@link MUSTS.NO_RUNNER_SIGNAL}).\n */\nexport interface RunnerAvailability {\n  readonly available: boolean;\n  readonly reason?: NoRunnerReason;\n  /** Live runners that could take work of this shape. */\n  readonly candidates: number;\n}\n\nexport interface AvailabilityQuery {\n  readonly kind: JobKind;\n  readonly owner: string;\n  readonly audience?: \"self\" | \"named\" | \"public\";\n  readonly audienceAllow?: readonly string[];\n}\n\nexport interface ByollmAppOptions {\n  readonly store: ByollmStore;\n  /** Injectable clock. */\n  readonly now?: () => number;\n  /** Liveness window for the no-runner signal. */\n  readonly livenessMs?: number;\n  /**\n   * How the app learns a job finished. Defaults to polling the store, which\n   * is correct everywhere; the Supabase adapter substitutes Realtime.\n   */\n  readonly delivery?: (deps: PollingDeliveryDeps) => ResultDelivery;\n  /**\n   * How long a sustained no-runner signal must persist before `result()`\n   * gives up. Longer tolerates a daemon restarting; shorter fails faster.\n   */\n  readonly noRunnerGraceMs?: number;\n  /**\n   * This site's keypairs — the same ones the handlers use.\n   *\n   * The app needs them because it is the *endpoint*: it seals work on the way\n   * in and opens results on the way out. Nothing between those two points\n   * holds plaintext (byollm_009 §10).\n   */\n  readonly siteKeys: StoredKeys;\n}\n\n/**\n * An enqueued job, with the delivery channel attached.\n *\n * `result()` is sugar over the channel — with a timeout and a\n * `noRunnerAvailable` path — never a bare promise that can hang forever\n * (byollm_003 Rev 1).\n */\nexport interface JobHandle {\n  readonly id: string;\n  /** The job as stored at enqueue time. */\n  readonly record: JobRecord;\n  /** Wait for a terminal outcome. */\n  result(options?: WaitOptions): Promise<DeliveredResult>;\n  /** Ask the runner to stop. */\n  cancel(): Promise<void>;\n}\n\n/**\n * The app-facing half of `@byollm/server`.\n *\n * The daemon talks to {@link ByollmHandlers}; the app talks to this. Keeping\n * them separate is what makes \"one door per state write\" hold — an app\n * enqueues and cancels through these methods and never writes job rows by\n * hand.\n */\nexport class ByollmApp {\n  readonly #store: ByollmStore;\n  readonly #siteKeys: StoredKeys;\n  readonly #now: () => number;\n  readonly #livenessMs: number;\n  readonly #delivery: ResultDelivery;\n\n  constructor(options: ByollmAppOptions) {\n    this.#store = options.store;\n    this.#siteKeys = options.siteKeys;\n    this.#now = options.now ?? Date.now;\n    this.#livenessMs = options.livenessMs ?? DEFAULT_LIVENESS_MS;\n\n    const deps: PollingDeliveryDeps = {\n      ...(options.noRunnerGraceMs === undefined\n        ? {}\n        : { graceMs: options.noRunnerGraceMs }),\n      read: (jobId) => this.result(jobId),\n      availability: async (jobId) => {\n        const job = await this.#store.get(jobId);\n        if (!job)\n          return { available: false, reason: \"unknown-job\", blocked: false };\n        // A job waiting on a dependency is waiting, not unavailable.\n        if (job.claimableAt === null) {\n          return { available: true, blocked: true };\n        }\n        const availability = await this.runnerAvailability({\n          kind: job.kind,\n          owner: job.owner,\n          audience: job.audience,\n          ...(job.audienceAllow === undefined\n            ? {}\n            : { audienceAllow: job.audienceAllow }),\n        });\n        return {\n          available: availability.available,\n          ...(availability.reason === undefined\n            ? {}\n            : { reason: availability.reason }),\n          blocked: false,\n        };\n      },\n    };\n    this.#delivery = options.delivery?.(deps) ?? new PollingDelivery(deps);\n  }\n\n  /**\n   * Enqueue a job.\n   *\n   * `audience` defaults to `self` — the safe direction. Widening it means the\n   * result comes back marked untrusted (see {@link ByollmApp.result}), and\n   * the app is obliged to disclose that to whoever reads it.\n   */\n  async enqueue(input: EnqueueInput): Promise<JobHandle> {\n    // Validate the payload against its kind before anything stores it.\n    //\n    // The schemas are `.strict()`, so this drops a payload carrying fields\n    // the kind does not define — `command`, `argv`, `model`, `baseUrl`. Types\n    // do not survive a JSON boundary, and an app assembling a payload from\n    // user input is the ordinary case, so \"the caller is typed\" is not a\n    // check ({@link MUSTS.KIND_NO_CODE}, {@link MUSTS.NO_PAYLOAD_ROUTING}).\n    //\n    // Refusing here rather than relying on the daemon is deliberate. The\n    // daemon does re-validate and would reject this — but it parses a whole\n    // claim response at once, so one malformed job would fail the batch it\n    // arrived in and stall unrelated work. Rejecting at enqueue puts the\n    // error where the app can act on it.\n    const parsed = KindedPayload.safeParse({\n      kind: input.kind,\n      payload: input.payload,\n    });\n    if (!parsed.success) {\n      const detail = parsed.error.issues\n        .map((issue) => `${issue.path.join(\".\") || \"(root)\"}: ${issue.message}`)\n        .join(\"; \");\n      throw new Error(`invalid ${input.kind} payload — ${detail}`);\n    }\n\n    // Sealed before it is stored, to this site's own key. The app is the\n    // endpoint, so it can open its own work later; the store, its backups and\n    // anything reading them cannot.\n    // Two different deadlines, deliberately not conflated:\n    //\n    // - the *job's* deadline is the app's business, may be absent, and for a\n    //   dependent job its TTL clock does not even start until the job becomes\n    //   claimable (`TTL_EXPIRY`). Setting one here broke exactly that.\n    // - the *envelope's* deadline bounds how long a captured ciphertext is\n    //   worth keeping. It is bound into the signature, so it has to be\n    //   recomputable at open time from what the record stores — hence\n    //   creation plus TTL, which never moves.\n    // Resolved *here*, once, and passed to the store — because the envelope\n    // binds it. Letting the app default one value and the store default\n    // another produced a job whose seal and record disagreed, and therefore\n    // work nobody could open.\n    // One reading of the clock, used for both the seal and the record.\n    //\n    // Two readings passed every fake-clock test and failed against a real\n    // one: the envelope bound `createdAt + ttlMs` from the first call and the\n    // record stored `createdAt` from the second, a millisecond later, so\n    // nothing could be opened. A fixed clock returns the same number twice\n    // and hides it completely.\n    const createdAt = this.#now();\n    // Independent of the job's TTL, deliberately. Binding the envelope to\n    // `createdAt + ttl` meant the app had to decide a TTL in order to seal —\n    // which overrode the store's own default and broke every expiry test.\n    // The two answer different questions: how long the work is worth doing,\n    // and how long the ciphertext is worth keeping.\n    const envelopeDeadlineAt = createdAt + ENVELOPE_MAX_AGE_MS;\n    const jobId = input.id ?? generateJobId();\n    const senderKeyId = keyId(publicIdentityOf(this.#siteKeys).identity);\n    const envelope = await seal({\n      plaintext: JSON.stringify(parsed.data.payload),\n      senderKeys: this.#siteKeys,\n      recipientEncryptionPublic: this.#siteKeys.encryptionPublic,\n      context: {\n        jobId,\n        senderKeyId,\n        recipientKeyId: senderKeyId,\n        deadlineAt: envelopeDeadlineAt,\n        direction: \"payload\",\n      },\n    });\n\n    const record = await this.#store.create(\n      {\n        ...input,\n        id: jobId,\n        envelope,\n        sizeClass: sizeClassOf(\n          payloadTextLength({\n            kind: input.kind,\n            payload: parsed.data.payload,\n          } as Parameters<typeof payloadTextLength>[0]),\n        ),\n      },\n      createdAt,\n    );\n    return {\n      id: record.id,\n      record,\n      result: (options?: WaitOptions) =>\n        this.#delivery.waitFor(record.id, options),\n      cancel: async () => {\n        await this.cancel(record.id);\n      },\n    };\n  }\n\n  /** Read a job's current state. */\n  async job(jobId: string): Promise<JobRecord | null> {\n    await this.#store.expireDue(this.#now());\n    return this.#store.get(jobId);\n  }\n\n  /**\n   * A job's result with its provenance attached.\n   *\n   * Check `provenance.untrusted` before rendering. It is true for every\n   * `named`/`public` job, because that text came from someone else's machine\n   * and the app must not present it as its own AI's answer\n   * ({@link MUSTS.RESULT_PROVENANCE}).\n   */\n  async result(jobId: string): Promise<DeliveredResult | null> {\n    const job = await this.job(jobId);\n    if (!job) return null;\n    return {\n      jobId: job.id,\n      state: job.state,\n      ...(job.outcome === null ? {} : { outcome: job.outcome }),\n      ...(job.provenance === null ? {} : { provenance: job.provenance }),\n    };\n  }\n\n  /** Ask a runner to stop. Queued jobs cancel at once; held jobs at the next heartbeat. */\n  async cancel(jobId: string): Promise<JobRecord | null> {\n    return this.#store.cancel(jobId, this.#now());\n  }\n\n  /**\n   * Is there a live runner that could take a job of this shape?\n   *\n   * Runs the identical {@link matchAudience} rule the claim path uses, so the\n   * signal cannot promise a runner the claim would then refuse.\n   */\n  async runnerAvailability(\n    query: AvailabilityQuery,\n  ): Promise<RunnerAvailability> {\n    const now = this.#now();\n    const all = await this.#store.listRunners();\n    const live = all.filter(\n      (runner) =>\n        runner.revokedAt === null &&\n        !runner.paused &&\n        now - runner.lastHeartbeatAt <= this.#livenessMs,\n    );\n\n    if (all.length === 0) {\n      return { available: false, reason: \"no-runner-paired\", candidates: 0 };\n    }\n    if (live.length === 0) {\n      return { available: false, reason: \"no-runner-online\", candidates: 0 };\n    }\n\n    let capable = 0;\n    let admitted = 0;\n    for (const runner of live) {\n      const capability = runner.capabilities.find((c) => c.kind === query.kind);\n      if (!capability) continue;\n      capable += 1;\n\n      const match = matchAudience(\n        {\n          owner: query.owner,\n          audience: query.audience ?? \"self\",\n          audienceAllow: query.audienceAllow,\n        },\n        {\n          owner: runner.owner,\n          offerScope: capability.offerScope,\n          // A generic backend's cost depends on its base URL, which the\n          // server never sees; assume the expensive reading (byollm_007 §4).\n          cost: backendDescriptor(capability.backendId).cost ?? \"metered\",\n          // Consent is the daemon's to hold, and it has already applied it:\n          // the offer scope arriving here is the *effective* one, so a\n          // metered backend nobody agreed to share advertises `self` and is\n          // refused by the scope rule above. Re-deriving consent from\n          // `false` here would instead refuse every backend an owner\n          // deliberately shared, because the server has no way to learn they\n          // did — the signal would be wrong in the direction that breaks\n          // working setups.\n          spend: { acknowledged: true },\n          // Same conservative assumption the claim path makes: the server\n          // cannot see a remote daemon's local allowlist (protocol §4.2).\n          locallyAllows: () => true,\n        },\n      );\n      if (match.ok) admitted += 1;\n    }\n\n    if (capable === 0) {\n      return {\n        available: false,\n        reason: \"no-matching-capability\",\n        candidates: 0,\n      };\n    }\n    if (admitted === 0) {\n      return {\n        available: false,\n        reason: \"audience-admits-nobody\",\n        candidates: 0,\n      };\n    }\n    return { available: true, candidates: admitted };\n  }\n\n  /**\n   * Approve a pairing on behalf of an authenticated user.\n   *\n   * `owner` MUST come from the approving user's own session. A daemon can\n   * never assert who it is — that is the whole reason pairing is interactive\n   * ({@link MUSTS.PAIR_ONE_USER}, {@link MUSTS.PAIR_INTERACTIVE}).\n   */\n  async approvePairing(args: {\n    userCode: string;\n    owner: string;\n  }): Promise<RunnerRecord> {\n    const token = generateRunnerToken();\n    return this.#store.approvePairing({\n      userCode: normalizeUserCode(args.userCode),\n      owner: args.owner,\n      runnerId: generateRunnerId(),\n      runnerToken: token,\n      tokenHash: hashSecret(token),\n      now: this.#now(),\n    });\n  }\n\n  /** Deny a pairing the user did not initiate. */\n  async denyPairing(userCode: string): Promise<void> {\n    return this.#store.denyPairing(normalizeUserCode(userCode), this.#now());\n  }\n\n  /** What a pairing code refers to, for the approval page to show. */\n  async pendingPairing(userCode: string): Promise<{\n    label: string;\n    platform: string;\n    daemonVersion: string;\n    capabilities: readonly { kind: string; model: string }[];\n    expiresAt: number;\n  } | null> {\n    const pairing = await this.#store.getPairingByUserCode(\n      normalizeUserCode(userCode),\n    );\n    if (pairing?.state !== \"pending\") return null;\n    if (pairing.expiresAt <= this.#now()) return null;\n    return {\n      label: pairing.label,\n      platform: pairing.platform,\n      daemonVersion: pairing.daemonVersion,\n      capabilities: pairing.capabilities.map((c) => ({\n        kind: c.kind,\n        model: c.model,\n      })),\n      expiresAt: pairing.expiresAt,\n    };\n  }\n\n  /** The user's paired runners, for a settings page. */\n  async runners(owner: string): Promise<RunnerRecord[]> {\n    return this.#store.listRunners(owner);\n  }\n\n  /** Revoke a runner. It stops at its next heartbeat, mid-queue. */\n  async revokeRunner(runnerId: string): Promise<void> {\n    return this.#store.revokeRunner(runnerId, this.#now());\n  }\n\n  /** Run the expiry sweep. Idempotent; safe to call on a timer or a request. */\n  async sweep(): Promise<JobRecord[]> {\n    return this.#store.expireDue(this.#now());\n  }\n}\n\n/**\n * Accept a pairing code however the user typed it — lowercase, spaces, no\n * dash. The code is displayed as `XXXX-XXXX`; refusing `xxxxxxxx` would fail\n * a user for a formatting detail they were never told mattered.\n */\nexport function normalizeUserCode(input: string): string {\n  const bare = input.toUpperCase().replace(/[^A-Z0-9]/g, \"\");\n  return bare.length === 8 ? `${bare.slice(0, 4)}-${bare.slice(4)}` : bare;\n}\n","import { StoredKeys, generateKeys, publicIdentityOf } from \"@byollm/protocol\";\nimport { fingerprint } from \"@byollm/protocol\";\n\n/**\n * A site's keypairs — byollm_009 §5.\n *\n * **Generate once, store, supply.** Not at startup, and not per process.\n *\n * A site is usually more than one process: several instances behind a load\n * balancer, or a serverless function whose module is evaluated per cold\n * start. Keys generated at startup would give each of those a different\n * identity. A daemon pins whichever one approved its pairing, and then every\n * request routed to a different instance fails a signature check with nothing\n * in the error explaining why — a failure that appears only under\n * horizontal scale, which is to say only in production.\n *\n * So the library takes keys as an input and never invents them. That is the\n * whole reason this module is three functions rather than a lazy singleton.\n */\n\n/** Make a fresh site identity. Call this once, ever, and keep the result. */\nexport const generateSiteKeys = (now: number = Date.now()): StoredKeys =>\n  generateKeys(now);\n\n/**\n * Read site keys from an environment variable holding base64 JSON.\n *\n * The shape a deployment actually wants: one opaque secret, set the way every\n * other secret is set, with no file to mount and no key material in the\n * repository.\n *\n * @throws with a message naming the variable and the fix, because this fails\n * at boot and the person reading the log is the person who can fix it.\n */\nexport function siteKeysFromEnv(\n  variable = \"BYOLLM_SITE_KEYS\",\n  env: NodeJS.ProcessEnv = process.env,\n): StoredKeys {\n  const raw = env[variable];\n  if (raw === undefined || raw === \"\") {\n    throw new Error(\n      `${variable} is not set. Generate a site identity once with ` +\n        `\\`npx @byollm/server keygen\\` and set it as ${variable}. ` +\n        `Do not generate keys at startup: every instance would get a ` +\n        `different identity and daemons would pin one and be refused by ` +\n        `another.`,\n    );\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(Buffer.from(raw, \"base64\").toString(\"utf8\"));\n  } catch {\n    throw new Error(\n      `${variable} is not base64-encoded JSON. It should be exactly what ` +\n        `\\`npx @byollm/server keygen\\` printed.`,\n    );\n  }\n\n  const result = StoredKeys.safeParse(parsed);\n  if (!result.success) {\n    throw new Error(\n      `${variable} does not contain a valid site identity. Regenerate it ` +\n        `with \\`npx @byollm/server keygen\\` — and if this site has already ` +\n        `paired daemons, they will need to pair again.`,\n    );\n  }\n  return result.data;\n}\n\n/** What to print from `keygen`: the secret to store, and how to check it. */\nexport function formatSiteKeys(keys: StoredKeys): string {\n  const encoded = Buffer.from(JSON.stringify(keys)).toString(\"base64\");\n  return (\n    `# Set this as BYOLLM_SITE_KEYS. It is a secret: it is this site's\\n` +\n    `# identity, and anything holding it can be this site.\\n` +\n    `BYOLLM_SITE_KEYS=${encoded}\\n` +\n    `\\n` +\n    `# Fingerprint (not secret — show it to users so they can check what\\n` +\n    `# their daemon pinned):\\n` +\n    `# ${fingerprint(publicIdentityOf(keys).identity)}\\n`\n  );\n}\n","import {\n  backendDescriptor,\n  matchAudience,\n  type Capability,\n} from \"@byollm/protocol\";\nimport { generateLeaseId } from \"./ids.js\";\nimport type {\n  StoredJobInput,\n  JobRecord,\n  PairingRecord,\n  RunnerRecord,\n} from \"./records.js\";\nimport type {\n  ApproveArgs,\n  ByollmStore,\n  ClaimArgs,\n  CompleteArgs,\n  CompleteResult,\n  ReleaseArgs,\n  RenewArgs,\n  RenewResult,\n  TouchArgs,\n} from \"./store.js\";\n\n/** Tunables an embedder may want to override in tests. */\nexport interface MemoryStoreOptions {\n  /** Default TTL for a job once claimable. */\n  readonly defaultTtlMs?: number;\n}\n\nconst DEFAULT_TTL_MS = 15 * 60_000;\n\n/**\n * The reference store: everything in one process, no persistence.\n *\n * This is not a toy — it is the implementation the conformance kit certifies\n * first, so its semantics *are* the specification's semantics for anything\n * the prose leaves implicit. A SQL adapter is correct when the same kit\n * passes against it.\n *\n * Concurrency: JavaScript's single-threaded turn is the atomicity primitive.\n * `claim` performs its read-decide-write with no `await` inside the critical\n * section, which is what makes {@link MUSTS.CLAIM_ATOMIC} hold here. A SQL\n * adapter gets the same property from `FOR UPDATE SKIP LOCKED`.\n */\nexport class MemoryStore implements ByollmStore {\n  readonly #jobs = new Map<string, JobRecord>();\n  readonly #runners = new Map<string, RunnerRecord>();\n  readonly #pairings = new Map<string, PairingRecord>();\n  /** Job ids the app has asked to cancel, not yet acknowledged by a runner. */\n  readonly #cancelRequests = new Set<string>();\n  readonly #defaultTtlMs: number;\n\n  constructor(options: MemoryStoreOptions = {}) {\n    this.#defaultTtlMs = options.defaultTtlMs ?? DEFAULT_TTL_MS;\n  }\n\n  // -- jobs ---------------------------------------------------------------\n\n  create(input: StoredJobInput, now: number): Promise<JobRecord> {\n    // Required now: the app mints the id before sealing, because the\n    // envelope binds it.\n    const id = input.id;\n    const existing = this.#jobs.get(id);\n    // Idempotent by caller-supplied id: re-enqueueing the same id is a no-op,\n    // so an app's retry cannot duplicate work (the house \"one door\" rule).\n    if (existing) return Promise.resolve(existing);\n\n    const dependsOn = [...(input.dependsOn ?? [])];\n    const blocked = dependsOn.some(\n      (depId) => this.#jobs.get(depId)?.state !== \"ok\",\n    );\n\n    const job: JobRecord = {\n      id,\n      kind: input.kind,\n      envelope: input.envelope,\n      sizeClass: input.sizeClass,\n      audience: input.audience ?? \"self\",\n      owner: input.owner,\n      audienceAllow: input.audienceAllow ? [...input.audienceAllow] : undefined,\n      dependsOn,\n      state: \"queued\",\n      lease: null,\n      createdAt: now,\n      // The TTL clock starts here only if nothing blocks the job.\n      claimableAt: blocked ? null : now,\n      ttlMs: input.ttlMs ?? this.#defaultTtlMs,\n      deadlineAt: input.deadlineAt ?? null,\n      refusedBy: [],\n      attempts: 0,\n      outcome: null,\n      provenance: null,\n      updatedAt: now,\n    };\n    this.#write(id, job);\n    return Promise.resolve(job);\n  }\n\n  get(jobId: string): Promise<JobRecord | null> {\n    return Promise.resolve(this.#jobs.get(jobId) ?? null);\n  }\n\n  claim(args: ClaimArgs): Promise<JobRecord[]> {\n    // Sweep first so an expired job is never handed out.\n    this.#expireDueSync(args.now);\n\n    const claimed: JobRecord[] = [];\n    // Oldest-claimable first: a job that has waited longest goes next.\n    const candidates = [...this.#jobs.values()].sort(\n      (a, b) => (a.claimableAt ?? Infinity) - (b.claimableAt ?? Infinity),\n    );\n\n    for (const job of candidates) {\n      if (claimed.length >= args.max) break;\n      if (!this.#isClaimable(job, args)) continue;\n\n      const updated: JobRecord = {\n        ...job,\n        state: \"claimed\",\n        lease: {\n          // A fresh id per grant. Two claims of the same job by the same\n          // runner are two different leases, and must be distinguishable.\n          id: generateLeaseId(),\n          runnerId: args.runnerId,\n          expiresAt: args.now + args.leaseMs,\n        },\n        attempts: job.attempts + 1,\n        updatedAt: args.now,\n      };\n      this.#write(job.id, updated);\n      claimed.push(updated);\n    }\n    return Promise.resolve(claimed);\n  }\n\n  /**\n   * The claim predicate, shared by `claim` and the no-runner signal so the\n   * two can never disagree about what \"a runner that could take this\" means.\n   */\n  #isClaimable(\n    job: JobRecord,\n    args: Pick<ClaimArgs, \"runnerId\" | \"runnerOwner\" | \"capabilities\" | \"now\">,\n  ): boolean {\n    if (job.state !== \"queued\") return false;\n    if (job.claimableAt === null || job.claimableAt > args.now) return false;\n    if (job.refusedBy.includes(args.runnerId)) return false;\n\n    const capability = capabilityFor(args.capabilities, job.kind);\n    if (!capability) return false;\n\n    const match = matchAudience(\n      {\n        owner: job.owner,\n        audience: job.audience,\n        audienceAllow: job.audienceAllow,\n      },\n      {\n        owner: args.runnerOwner,\n        offerScope: capability.offerScope,\n        // From the registry, not a local guess — the cost rules must mean the\n        // same thing on both sides of the wire. The server cannot see a\n        // remote daemon's base URL, so a generic backend with no declared\n        // cost is treated as metered: the expensive side, and the daemon\n        // refuses anyway if it disagrees (byollm_007 §2).\n        cost: backendDescriptor(capability.backendId).cost ?? \"metered\",\n        // Nor can it see the owner's spend consent. It offers; the daemon is\n        // the enforcing side and releases with `refused` if its own rules say\n        // no — the same shape as the `named` allowlist.\n        spend: { acknowledged: true },\n        // The server cannot see a remote daemon's local allowlist and must\n        // not pretend to (protocol §4.2). It admits the job here; the daemon\n        // is the enforcing side and releases with `refused` if its own list\n        // says no.\n        locallyAllows: () => true,\n      },\n    );\n    return match.ok;\n  }\n\n  renewLeases(args: RenewArgs): Promise<RenewResult> {\n    this.#expireDueSync(args.now);\n\n    const renewed: { jobId: string; expiresAt: number }[] = [];\n    const lost: string[] = [];\n\n    for (const { jobId, leaseId } of args.leases) {\n      const job = this.#jobs.get(jobId);\n      if (\n        !job ||\n        job.lease?.runnerId !== args.runnerId ||\n        job.lease.id !== leaseId\n      ) {\n        // Reclaimed by someone else, terminal, or a different grant than the\n        // one being renewed — either way this runner must stop.\n        lost.push(jobId);\n        continue;\n      }\n      if (job.state !== \"claimed\" && job.state !== \"running\") {\n        lost.push(jobId);\n        continue;\n      }\n      const expiresAt = args.now + args.leaseMs;\n      this.#write(jobId, {\n        ...job,\n        state: \"running\",\n        // Renewal extends the existing grant; it does not mint a new one.\n        lease: { ...job.lease, expiresAt },\n        updatedAt: args.now,\n      });\n      renewed.push({ jobId, expiresAt });\n    }\n    return Promise.resolve({ renewed, lost });\n  }\n\n  complete(args: CompleteArgs): Promise<CompleteResult> {\n    const job = this.#jobs.get(args.jobId);\n    if (!job) return Promise.resolve({ accepted: false, job: null });\n\n    // First terminal outcome wins; a later submission is discarded, not\n    // applied ({@link MUSTS.RESULT_IDEMPOTENT}).\n    if (\n      job.state === \"ok\" ||\n      job.state === \"error\" ||\n      job.state === \"canceled\"\n    ) {\n      return Promise.resolve({ accepted: false, job });\n    }\n    if (job.state === \"expired\") {\n      return Promise.resolve({ accepted: false, job });\n    }\n    // A runner that lost its lease may not write a result\n    // ({@link MUSTS.LEASE_HONORED}).\n    if (job.lease?.runnerId !== args.runnerId) {\n      return Promise.resolve({ accepted: false, job });\n    }\n\n    const state =\n      args.outcome.outcome === \"ok\"\n        ? \"ok\"\n        : args.outcome.outcome === \"canceled\"\n          ? \"canceled\"\n          : \"error\";\n\n    const updated: JobRecord = {\n      ...job,\n      state,\n      lease: null,\n      outcome: args.outcome,\n      provenance: args.provenance,\n      updatedAt: args.now,\n    };\n    this.#write(job.id, updated);\n    this.#cancelRequests.delete(job.id);\n\n    if (state === \"ok\") this.#unblockDependents(job.id, args.now);\n\n    return Promise.resolve({ accepted: true, job: updated });\n  }\n\n  /**\n   * Start the TTL clock on anything this job was blocking.\n   *\n   * Deliberately only on `ok`: a dependency that errored leaves its dependents\n   * blocked forever rather than releasing them into a run whose input never\n   * arrived. They expire at their absolute deadline if one was set, and the\n   * app sees a chain that stopped where it broke.\n   */\n  #unblockDependents(completedId: string, now: number): void {\n    for (const job of this.#jobs.values()) {\n      if (job.claimableAt !== null) continue;\n      if (!job.dependsOn.includes(completedId)) continue;\n      const ready = job.dependsOn.every(\n        (depId) => this.#jobs.get(depId)?.state === \"ok\",\n      );\n      if (ready) {\n        this.#write(job.id, { ...job, claimableAt: now, updatedAt: now });\n      }\n    }\n  }\n\n  /**\n   * Watchers, by job id (byollm_009 §8.3).\n   *\n   * A `Set` per job so an unsubscribe removes exactly the handler it\n   * registered — two waiters on the same job are ordinary, and removing by\n   * job id alone would silently cancel someone else's wait.\n   */\n  readonly #watchers = new Map<string, Set<() => void>>();\n\n  subscribe(jobId: string, onChange: () => void): () => void {\n    const existing = this.#watchers.get(jobId) ?? new Set<() => void>();\n    existing.add(onChange);\n    this.#watchers.set(jobId, existing);\n    let live = true;\n    return () => {\n      // Idempotent: the contract says calling twice is safe, and a `finally`\n      // that unsubscribes after an error path already did is the normal way\n      // this gets called twice.\n      if (!live) return;\n      live = false;\n      const set = this.#watchers.get(jobId);\n      set?.delete(onChange);\n      if (set?.size === 0) this.#watchers.delete(jobId);\n    };\n  }\n\n  /**\n   * The single write path for a job.\n   *\n   * Every mutation goes through here so notification cannot be forgotten by\n   * a future one. Nine call sites existed when the push seam was added, and\n   * \"remember to notify\" is not a property nine call sites keep.\n   */\n  #write(jobId: string, record: JobRecord): void {\n    this.#jobs.set(jobId, record);\n    this.#notify(jobId);\n  }\n\n  /**\n   * Tell anyone watching that a job changed.\n   *\n   * A throwing watcher must not corrupt the store's own bookkeeping, so each\n   * is isolated: this runs inside write paths, and one bad listener taking\n   * out an unrelated write would be a far worse failure than a missed\n   * notification.\n   */\n  #notify(jobId: string): void {\n    for (const watcher of this.#watchers.get(jobId) ?? []) {\n      try {\n        watcher();\n      } catch {\n        // A watcher is a signal handler; the caller re-reads regardless.\n      }\n    }\n  }\n\n  release(args: ReleaseArgs): Promise<string[]> {\n    const released: string[] = [];\n    for (const { jobId, leaseId } of args.leases) {\n      const job = this.#jobs.get(jobId);\n      // The *grant*, not just its holder. Matching on runner id alone let a\n      // replayed release from an earlier lease drop a later one, returning a\n      // job to the queue while the daemon was still executing it.\n      if (\n        !job ||\n        job.lease?.runnerId !== args.runnerId ||\n        job.lease.id !== leaseId\n      ) {\n        continue;\n      }\n\n      this.#write(jobId, {\n        ...job,\n        state: \"queued\",\n        lease: null,\n        // Newly available again, so the TTL clock restarts here too.\n        claimableAt: args.now,\n        // A refusal is remembered, or the pair spins between claim and\n        // release forever ({@link MUSTS.REFUSAL_NOT_REOFFERED}).\n        refusedBy:\n          args.reason === \"refused\"\n            ? [...new Set([...job.refusedBy, args.runnerId])]\n            : job.refusedBy,\n        updatedAt: args.now,\n      });\n      released.push(jobId);\n    }\n    return Promise.resolve(released);\n  }\n\n  expireDue(now: number): Promise<JobRecord[]> {\n    return Promise.resolve(this.#expireDueSync(now));\n  }\n\n  /**\n   * Lease expiry and TTL expiry in one idempotent sweep.\n   *\n   * Order matters: a lease is reclaimed *before* the TTL is judged, so a job\n   * whose runner died is offered again rather than being expired for having\n   * sat in `claimed` too long.\n   */\n  #expireDueSync(now: number): JobRecord[] {\n    const changed: JobRecord[] = [];\n\n    for (const job of this.#jobs.values()) {\n      if (\n        (job.state === \"claimed\" || job.state === \"running\") &&\n        job.lease !== null &&\n        job.lease.expiresAt <= now\n      ) {\n        const requeued: JobRecord = {\n          ...job,\n          state: \"queued\",\n          lease: null,\n          // The TTL clock restarts: it measures how long a job has waited\n          // *unclaimed*, and this job has just become available again. Without\n          // this, a job whose runner died would expire for time it spent being\n          // actively worked on — losing exactly the work `kill -9` recovery\n          // exists to save. Total lifetime is bounded by `deadlineAt`, which\n          // is absolute and unaffected by reclaim.\n          claimableAt: now,\n          updatedAt: now,\n        };\n        this.#write(job.id, requeued);\n        changed.push(requeued);\n      }\n    }\n\n    for (const job of this.#jobs.values()) {\n      if (job.state !== \"queued\") continue;\n      const pastDeadline = job.deadlineAt !== null && job.deadlineAt <= now;\n      const pastTtl =\n        job.claimableAt !== null && job.claimableAt + job.ttlMs <= now;\n      if (!pastDeadline && !pastTtl) continue;\n\n      const expired: JobRecord = {\n        ...job,\n        state: \"expired\",\n        lease: null,\n        updatedAt: now,\n      };\n      this.#write(job.id, expired);\n      changed.push(expired);\n    }\n    return changed;\n  }\n\n  cancel(jobId: string, now: number): Promise<JobRecord | null> {\n    const job = this.#jobs.get(jobId);\n    if (!job) return Promise.resolve(null);\n    if (job.state === \"queued\") {\n      const canceled: JobRecord = {\n        ...job,\n        state: \"canceled\",\n        lease: null,\n        updatedAt: now,\n      };\n      this.#write(jobId, canceled);\n      return Promise.resolve(canceled);\n    }\n    if (job.state === \"claimed\" || job.state === \"running\") {\n      // Held by a runner: the cancel travels on the next heartbeat and the\n      // runner reports `canceled` itself, so the job's own state waits.\n      this.#cancelRequests.add(jobId);\n      return Promise.resolve(job);\n    }\n    return Promise.resolve(job);\n  }\n\n  listClaimedBy(runnerId: string): Promise<JobRecord[]> {\n    return Promise.resolve(\n      [...this.#jobs.values()].filter(\n        (job) => job.lease?.runnerId === runnerId,\n      ),\n    );\n  }\n\n  listCancelRequests(runnerId: string): Promise<string[]> {\n    return Promise.resolve(\n      [...this.#cancelRequests].filter(\n        (jobId) => this.#jobs.get(jobId)?.lease?.runnerId === runnerId,\n      ),\n    );\n  }\n\n  // -- pairing and runners -------------------------------------------------\n\n  createPairing(record: PairingRecord): Promise<void> {\n    this.#pairings.set(record.deviceCodeHash, record);\n    return Promise.resolve();\n  }\n\n  getPairingByDeviceCodeHash(hash: string): Promise<PairingRecord | null> {\n    return Promise.resolve(this.#pairings.get(hash) ?? null);\n  }\n\n  getPairingByUserCode(userCode: string): Promise<PairingRecord | null> {\n    for (const pairing of this.#pairings.values()) {\n      if (pairing.userCode === userCode) return Promise.resolve(pairing);\n    }\n    return Promise.resolve(null);\n  }\n\n  approvePairing(args: ApproveArgs): Promise<RunnerRecord> {\n    const pairing = [...this.#pairings.values()].find(\n      (p) => p.userCode === args.userCode,\n    );\n    if (!pairing) throw new Error(`unknown pairing code: ${args.userCode}`);\n    if (pairing.expiresAt <= args.now) {\n      throw new Error(\"pairing code has expired\");\n    }\n    if (pairing.state !== \"pending\") {\n      throw new Error(`pairing is already ${pairing.state}`);\n    }\n\n    const runner: RunnerRecord = {\n      id: args.runnerId,\n      owner: args.owner,\n      tokenHash: args.tokenHash,\n      // Carried from the pairing, not re-supplied at approval: the user\n      // approved a specific machine, and the runner must be that machine.\n      device: pairing.device,\n      label: pairing.label,\n      platform: pairing.platform,\n      daemonVersion: pairing.daemonVersion,\n      capabilities: pairing.capabilities,\n      paused: false,\n      revokedAt: null,\n      lastHeartbeatAt: args.now,\n      createdAt: args.now,\n    };\n    this.#runners.set(runner.id, runner);\n    this.#pairings.set(pairing.deviceCodeHash, {\n      ...pairing,\n      state: \"approved\",\n      owner: args.owner,\n      runnerId: runner.id,\n      runnerTokenOnce: args.runnerToken,\n    });\n    return Promise.resolve(runner);\n  }\n\n  denyPairing(userCode: string, _now: number): Promise<void> {\n    const pairing = [...this.#pairings.values()].find(\n      (p) => p.userCode === userCode,\n    );\n    if (pairing) {\n      this.#pairings.set(pairing.deviceCodeHash, {\n        ...pairing,\n        state: \"denied\",\n      });\n    }\n    return Promise.resolve();\n  }\n\n  consumePairingToken(deviceCodeHash: string): Promise<void> {\n    const pairing = this.#pairings.get(deviceCodeHash);\n    if (pairing) {\n      this.#pairings.set(deviceCodeHash, {\n        ...pairing,\n        runnerTokenOnce: null,\n      });\n    }\n    return Promise.resolve();\n  }\n\n  getRunnerByTokenHash(hash: string): Promise<RunnerRecord | null> {\n    for (const runner of this.#runners.values()) {\n      if (runner.tokenHash === hash) return Promise.resolve(runner);\n    }\n    return Promise.resolve(null);\n  }\n\n  getRunner(runnerId: string): Promise<RunnerRecord | null> {\n    return Promise.resolve(this.#runners.get(runnerId) ?? null);\n  }\n\n  touchRunner(args: TouchArgs): Promise<RunnerRecord | null> {\n    const runner = this.#runners.get(args.runnerId);\n    if (!runner) return Promise.resolve(null);\n    const updated: RunnerRecord = {\n      ...runner,\n      capabilities: args.capabilities,\n      daemonVersion: args.daemonVersion,\n      paused: args.paused,\n      lastHeartbeatAt: args.now,\n    };\n    this.#runners.set(runner.id, updated);\n    return Promise.resolve(updated);\n  }\n\n  revokeRunner(runnerId: string, now: number): Promise<void> {\n    const runner = this.#runners.get(runnerId);\n    // Revocation is one-way: an already-revoked runner keeps its first\n    // revocation time rather than being re-stamped.\n    if (runner?.revokedAt === null) {\n      this.#runners.set(runnerId, { ...runner, revokedAt: now });\n    }\n    return Promise.resolve();\n  }\n\n  listRunners(owner?: string): Promise<RunnerRecord[]> {\n    const all = [...this.#runners.values()];\n    return Promise.resolve(\n      owner === undefined ? all : all.filter((r) => r.owner === owner),\n    );\n  }\n\n  // -- test/demo helpers ---------------------------------------------------\n\n  /** All jobs, for demos and assertions. Not part of the store interface. */\n  allJobs(): JobRecord[] {\n    return [...this.#jobs.values()];\n  }\n}\n\n/** The capability that would serve a kind, if any. */\nexport function capabilityFor(\n  capabilities: readonly Capability[],\n  kind: string,\n): Capability | undefined {\n  return capabilities.find((c) => c.kind === kind);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA;AAAA,EACA;AAAA,OAGK;AAoBP,IAAM,sBAAsB;AAmFrB,IAAM,YAAN,MAAgB;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,SAA2B;AACrC,SAAK,SAAS,QAAQ;AACtB,SAAK,YAAY,QAAQ;AACzB,SAAK,OAAO,QAAQ,OAAO,KAAK;AAChC,SAAK,cAAc,QAAQ,cAAc;AAEzC,UAAM,OAA4B;AAAA,MAChC,GAAI,QAAQ,oBAAoB,SAC5B,CAAC,IACD,EAAE,SAAS,QAAQ,gBAAgB;AAAA,MACvC,MAAM,CAAC,UAAU,KAAK,OAAO,KAAK;AAAA,MAClC,cAAc,OAAO,UAAU;AAC7B,cAAM,MAAM,MAAM,KAAK,OAAO,IAAI,KAAK;AACvC,YAAI,CAAC;AACH,iBAAO,EAAE,WAAW,OAAO,QAAQ,eAAe,SAAS,MAAM;AAEnE,YAAI,IAAI,gBAAgB,MAAM;AAC5B,iBAAO,EAAE,WAAW,MAAM,SAAS,KAAK;AAAA,QAC1C;AACA,cAAM,eAAe,MAAM,KAAK,mBAAmB;AAAA,UACjD,MAAM,IAAI;AAAA,UACV,OAAO,IAAI;AAAA,UACX,UAAU,IAAI;AAAA,UACd,GAAI,IAAI,kBAAkB,SACtB,CAAC,IACD,EAAE,eAAe,IAAI,cAAc;AAAA,QACzC,CAAC;AACD,eAAO;AAAA,UACL,WAAW,aAAa;AAAA,UACxB,GAAI,aAAa,WAAW,SACxB,CAAC,IACD,EAAE,QAAQ,aAAa,OAAO;AAAA,UAClC,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AACA,SAAK,YAAY,QAAQ,WAAW,IAAI,KAAK,IAAI,gBAAgB,IAAI;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,QAAQ,OAAyC;AAcrD,UAAM,SAAS,cAAc,UAAU;AAAA,MACrC,MAAM,MAAM;AAAA,MACZ,SAAS,MAAM;AAAA,IACjB,CAAC;AACD,QAAI,CAAC,OAAO,SAAS;AACnB,YAAM,SAAS,OAAO,MAAM,OACzB,IAAI,CAAC,UAAU,GAAG,MAAM,KAAK,KAAK,GAAG,KAAK,QAAQ,KAAK,MAAM,OAAO,EAAE,EACtE,KAAK,IAAI;AACZ,YAAM,IAAI,MAAM,WAAW,MAAM,IAAI,mBAAc,MAAM,EAAE;AAAA,IAC7D;AAyBA,UAAM,YAAY,KAAK,KAAK;AAM5B,UAAM,qBAAqB,YAAY;AACvC,UAAM,QAAQ,MAAM,MAAM,cAAc;AACxC,UAAM,cAAc,MAAM,iBAAiB,KAAK,SAAS,EAAE,QAAQ;AACnE,UAAM,WAAW,MAAM,KAAK;AAAA,MAC1B,WAAW,KAAK,UAAU,OAAO,KAAK,OAAO;AAAA,MAC7C,YAAY,KAAK;AAAA,MACjB,2BAA2B,KAAK,UAAU;AAAA,MAC1C,SAAS;AAAA,QACP;AAAA,QACA;AAAA,QACA,gBAAgB;AAAA,QAChB,YAAY;AAAA,QACZ,WAAW;AAAA,MACb;AAAA,IACF,CAAC;AAED,UAAM,SAAS,MAAM,KAAK,OAAO;AAAA,MAC/B;AAAA,QACE,GAAG;AAAA,QACH,IAAI;AAAA,QACJ;AAAA,QACA,WAAW;AAAA,UACT,kBAAkB;AAAA,YAChB,MAAM,MAAM;AAAA,YACZ,SAAS,OAAO,KAAK;AAAA,UACvB,CAA4C;AAAA,QAC9C;AAAA,MACF;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL,IAAI,OAAO;AAAA,MACX;AAAA,MACA,QAAQ,CAAC,YACP,KAAK,UAAU,QAAQ,OAAO,IAAI,OAAO;AAAA,MAC3C,QAAQ,YAAY;AAClB,cAAM,KAAK,OAAO,OAAO,EAAE;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,IAAI,OAA0C;AAClD,UAAM,KAAK,OAAO,UAAU,KAAK,KAAK,CAAC;AACvC,WAAO,KAAK,OAAO,IAAI,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,OAAO,OAAgD;AAC3D,UAAM,MAAM,MAAM,KAAK,IAAI,KAAK;AAChC,QAAI,CAAC,IAAK,QAAO;AACjB,WAAO;AAAA,MACL,OAAO,IAAI;AAAA,MACX,OAAO,IAAI;AAAA,MACX,GAAI,IAAI,YAAY,OAAO,CAAC,IAAI,EAAE,SAAS,IAAI,QAAQ;AAAA,MACvD,GAAI,IAAI,eAAe,OAAO,CAAC,IAAI,EAAE,YAAY,IAAI,WAAW;AAAA,IAClE;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,OAAO,OAA0C;AACrD,WAAO,KAAK,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,mBACJ,OAC6B;AAC7B,UAAM,MAAM,KAAK,KAAK;AACtB,UAAM,MAAM,MAAM,KAAK,OAAO,YAAY;AAC1C,UAAM,OAAO,IAAI;AAAA,MACf,CAAC,WACC,OAAO,cAAc,QACrB,CAAC,OAAO,UACR,MAAM,OAAO,mBAAmB,KAAK;AAAA,IACzC;AAEA,QAAI,IAAI,WAAW,GAAG;AACpB,aAAO,EAAE,WAAW,OAAO,QAAQ,oBAAoB,YAAY,EAAE;AAAA,IACvE;AACA,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,EAAE,WAAW,OAAO,QAAQ,oBAAoB,YAAY,EAAE;AAAA,IACvE;AAEA,QAAI,UAAU;AACd,QAAI,WAAW;AACf,eAAW,UAAU,MAAM;AACzB,YAAM,aAAa,OAAO,aAAa,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM,IAAI;AACxE,UAAI,CAAC,WAAY;AACjB,iBAAW;AAEX,YAAM,QAAQ;AAAA,QACZ;AAAA,UACE,OAAO,MAAM;AAAA,UACb,UAAU,MAAM,YAAY;AAAA,UAC5B,eAAe,MAAM;AAAA,QACvB;AAAA,QACA;AAAA,UACE,OAAO,OAAO;AAAA,UACd,YAAY,WAAW;AAAA;AAAA;AAAA,UAGvB,MAAM,kBAAkB,WAAW,SAAS,EAAE,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAStD,OAAO,EAAE,cAAc,KAAK;AAAA;AAAA;AAAA,UAG5B,eAAe,MAAM;AAAA,QACvB;AAAA,MACF;AACA,UAAI,MAAM,GAAI,aAAY;AAAA,IAC5B;AAEA,QAAI,YAAY,GAAG;AACjB,aAAO;AAAA,QACL,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,IACF;AACA,QAAI,aAAa,GAAG;AAClB,aAAO;AAAA,QACL,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,IACF;AACA,WAAO,EAAE,WAAW,MAAM,YAAY,SAAS;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,eAAe,MAGK;AACxB,UAAM,QAAQ,oBAAoB;AAClC,WAAO,KAAK,OAAO,eAAe;AAAA,MAChC,UAAU,kBAAkB,KAAK,QAAQ;AAAA,MACzC,OAAO,KAAK;AAAA,MACZ,UAAU,iBAAiB;AAAA,MAC3B,aAAa;AAAA,MACb,WAAW,WAAW,KAAK;AAAA,MAC3B,KAAK,KAAK,KAAK;AAAA,IACjB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,YAAY,UAAiC;AACjD,WAAO,KAAK,OAAO,YAAY,kBAAkB,QAAQ,GAAG,KAAK,KAAK,CAAC;AAAA,EACzE;AAAA;AAAA,EAGA,MAAM,eAAe,UAMX;AACR,UAAM,UAAU,MAAM,KAAK,OAAO;AAAA,MAChC,kBAAkB,QAAQ;AAAA,IAC5B;AACA,QAAI,SAAS,UAAU,UAAW,QAAO;AACzC,QAAI,QAAQ,aAAa,KAAK,KAAK,EAAG,QAAO;AAC7C,WAAO;AAAA,MACL,OAAO,QAAQ;AAAA,MACf,UAAU,QAAQ;AAAA,MAClB,eAAe,QAAQ;AAAA,MACvB,cAAc,QAAQ,aAAa,IAAI,CAAC,OAAO;AAAA,QAC7C,MAAM,EAAE;AAAA,QACR,OAAO,EAAE;AAAA,MACX,EAAE;AAAA,MACF,WAAW,QAAQ;AAAA,IACrB;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,QAAQ,OAAwC;AACpD,WAAO,KAAK,OAAO,YAAY,KAAK;AAAA,EACtC;AAAA;AAAA,EAGA,MAAM,aAAa,UAAiC;AAClD,WAAO,KAAK,OAAO,aAAa,UAAU,KAAK,KAAK,CAAC;AAAA,EACvD;AAAA;AAAA,EAGA,MAAM,QAA8B;AAClC,WAAO,KAAK,OAAO,UAAU,KAAK,KAAK,CAAC;AAAA,EAC1C;AACF;AAOO,SAAS,kBAAkB,OAAuB;AACvD,QAAM,OAAO,MAAM,YAAY,EAAE,QAAQ,cAAc,EAAE;AACzD,SAAO,KAAK,WAAW,IAAI,GAAG,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,KAAK;AACtE;;;AChcA,SAAS,YAAY,cAAc,oBAAAA,yBAAwB;AAC3D,SAAS,mBAAmB;AAoBrB,IAAM,mBAAmB,CAAC,MAAc,KAAK,IAAI,MACtD,aAAa,GAAG;AAYX,SAAS,gBACd,WAAW,oBACX,MAAyB,QAAQ,KACrB;AACZ,QAAM,MAAM,IAAI,QAAQ;AACxB,MAAI,QAAQ,UAAa,QAAQ,IAAI;AACnC,UAAM,IAAI;AAAA,MACR,GAAG,QAAQ,+FACsC,QAAQ;AAAA,IAI3D;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,OAAO,KAAK,KAAK,QAAQ,EAAE,SAAS,MAAM,CAAC;AAAA,EACjE,QAAQ;AACN,UAAM,IAAI;AAAA,MACR,GAAG,QAAQ;AAAA,IAEb;AAAA,EACF;AAEA,QAAM,SAAS,WAAW,UAAU,MAAM;AAC1C,MAAI,CAAC,OAAO,SAAS;AACnB,UAAM,IAAI;AAAA,MACR,GAAG,QAAQ;AAAA,IAGb;AAAA,EACF;AACA,SAAO,OAAO;AAChB;AAGO,SAAS,eAAe,MAA0B;AACvD,QAAM,UAAU,OAAO,KAAK,KAAK,UAAU,IAAI,CAAC,EAAE,SAAS,QAAQ;AACnE,SACE;AAAA;AAAA,mBAEoB,OAAO;AAAA;AAAA;AAAA;AAAA,IAItB,YAAYA,kBAAiB,IAAI,EAAE,QAAQ,CAAC;AAAA;AAErD;;;AClFA;AAAA,EACE,qBAAAC;AAAA,EACA,iBAAAC;AAAA,OAEK;AA0BP,IAAM,iBAAiB,KAAK;AAerB,IAAM,cAAN,MAAyC;AAAA,EACrC,QAAQ,oBAAI,IAAuB;AAAA,EACnC,WAAW,oBAAI,IAA0B;AAAA,EACzC,YAAY,oBAAI,IAA2B;AAAA;AAAA,EAE3C,kBAAkB,oBAAI,IAAY;AAAA,EAClC;AAAA,EAET,YAAY,UAA8B,CAAC,GAAG;AAC5C,SAAK,gBAAgB,QAAQ,gBAAgB;AAAA,EAC/C;AAAA;AAAA,EAIA,OAAO,OAAuB,KAAiC;AAG7D,UAAM,KAAK,MAAM;AACjB,UAAM,WAAW,KAAK,MAAM,IAAI,EAAE;AAGlC,QAAI,SAAU,QAAO,QAAQ,QAAQ,QAAQ;AAE7C,UAAM,YAAY,CAAC,GAAI,MAAM,aAAa,CAAC,CAAE;AAC7C,UAAM,UAAU,UAAU;AAAA,MACxB,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG,UAAU;AAAA,IAC9C;AAEA,UAAM,MAAiB;AAAA,MACrB;AAAA,MACA,MAAM,MAAM;AAAA,MACZ,UAAU,MAAM;AAAA,MAChB,WAAW,MAAM;AAAA,MACjB,UAAU,MAAM,YAAY;AAAA,MAC5B,OAAO,MAAM;AAAA,MACb,eAAe,MAAM,gBAAgB,CAAC,GAAG,MAAM,aAAa,IAAI;AAAA,MAChE;AAAA,MACA,OAAO;AAAA,MACP,OAAO;AAAA,MACP,WAAW;AAAA;AAAA,MAEX,aAAa,UAAU,OAAO;AAAA,MAC9B,OAAO,MAAM,SAAS,KAAK;AAAA,MAC3B,YAAY,MAAM,cAAc;AAAA,MAChC,WAAW,CAAC;AAAA,MACZ,UAAU;AAAA,MACV,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,WAAW;AAAA,IACb;AACA,SAAK,OAAO,IAAI,GAAG;AACnB,WAAO,QAAQ,QAAQ,GAAG;AAAA,EAC5B;AAAA,EAEA,IAAI,OAA0C;AAC5C,WAAO,QAAQ,QAAQ,KAAK,MAAM,IAAI,KAAK,KAAK,IAAI;AAAA,EACtD;AAAA,EAEA,MAAM,MAAuC;AAE3C,SAAK,eAAe,KAAK,GAAG;AAE5B,UAAM,UAAuB,CAAC;AAE9B,UAAM,aAAa,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE;AAAA,MAC1C,CAAC,GAAG,OAAO,EAAE,eAAe,aAAa,EAAE,eAAe;AAAA,IAC5D;AAEA,eAAW,OAAO,YAAY;AAC5B,UAAI,QAAQ,UAAU,KAAK,IAAK;AAChC,UAAI,CAAC,KAAK,aAAa,KAAK,IAAI,EAAG;AAEnC,YAAM,UAAqB;AAAA,QACzB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA;AAAA;AAAA,UAGL,IAAI,gBAAgB;AAAA,UACpB,UAAU,KAAK;AAAA,UACf,WAAW,KAAK,MAAM,KAAK;AAAA,QAC7B;AAAA,QACA,UAAU,IAAI,WAAW;AAAA,QACzB,WAAW,KAAK;AAAA,MAClB;AACA,WAAK,OAAO,IAAI,IAAI,OAAO;AAC3B,cAAQ,KAAK,OAAO;AAAA,IACtB;AACA,WAAO,QAAQ,QAAQ,OAAO;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aACE,KACA,MACS;AACT,QAAI,IAAI,UAAU,SAAU,QAAO;AACnC,QAAI,IAAI,gBAAgB,QAAQ,IAAI,cAAc,KAAK,IAAK,QAAO;AACnE,QAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,EAAG,QAAO;AAElD,UAAM,aAAa,cAAc,KAAK,cAAc,IAAI,IAAI;AAC5D,QAAI,CAAC,WAAY,QAAO;AAExB,UAAM,QAAQC;AAAA,MACZ;AAAA,QACE,OAAO,IAAI;AAAA,QACX,UAAU,IAAI;AAAA,QACd,eAAe,IAAI;AAAA,MACrB;AAAA,MACA;AAAA,QACE,OAAO,KAAK;AAAA,QACZ,YAAY,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAMvB,MAAMC,mBAAkB,WAAW,SAAS,EAAE,QAAQ;AAAA;AAAA;AAAA;AAAA,QAItD,OAAO,EAAE,cAAc,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA,QAK5B,eAAe,MAAM;AAAA,MACvB;AAAA,IACF;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,YAAY,MAAuC;AACjD,SAAK,eAAe,KAAK,GAAG;AAE5B,UAAM,UAAkD,CAAC;AACzD,UAAM,OAAiB,CAAC;AAExB,eAAW,EAAE,OAAO,QAAQ,KAAK,KAAK,QAAQ;AAC5C,YAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAChC,UACE,CAAC,OACD,IAAI,OAAO,aAAa,KAAK,YAC7B,IAAI,MAAM,OAAO,SACjB;AAGA,aAAK,KAAK,KAAK;AACf;AAAA,MACF;AACA,UAAI,IAAI,UAAU,aAAa,IAAI,UAAU,WAAW;AACtD,aAAK,KAAK,KAAK;AACf;AAAA,MACF;AACA,YAAM,YAAY,KAAK,MAAM,KAAK;AAClC,WAAK,OAAO,OAAO;AAAA,QACjB,GAAG;AAAA,QACH,OAAO;AAAA;AAAA,QAEP,OAAO,EAAE,GAAG,IAAI,OAAO,UAAU;AAAA,QACjC,WAAW,KAAK;AAAA,MAClB,CAAC;AACD,cAAQ,KAAK,EAAE,OAAO,UAAU,CAAC;AAAA,IACnC;AACA,WAAO,QAAQ,QAAQ,EAAE,SAAS,KAAK,CAAC;AAAA,EAC1C;AAAA,EAEA,SAAS,MAA6C;AACpD,UAAM,MAAM,KAAK,MAAM,IAAI,KAAK,KAAK;AACrC,QAAI,CAAC,IAAK,QAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,KAAK,KAAK,CAAC;AAI/D,QACE,IAAI,UAAU,QACd,IAAI,UAAU,WACd,IAAI,UAAU,YACd;AACA,aAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,IAAI,CAAC;AAAA,IACjD;AACA,QAAI,IAAI,UAAU,WAAW;AAC3B,aAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,IAAI,CAAC;AAAA,IACjD;AAGA,QAAI,IAAI,OAAO,aAAa,KAAK,UAAU;AACzC,aAAO,QAAQ,QAAQ,EAAE,UAAU,OAAO,IAAI,CAAC;AAAA,IACjD;AAEA,UAAM,QACJ,KAAK,QAAQ,YAAY,OACrB,OACA,KAAK,QAAQ,YAAY,aACvB,aACA;AAER,UAAM,UAAqB;AAAA,MACzB,GAAG;AAAA,MACH;AAAA,MACA,OAAO;AAAA,MACP,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK;AAAA,IAClB;AACA,SAAK,OAAO,IAAI,IAAI,OAAO;AAC3B,SAAK,gBAAgB,OAAO,IAAI,EAAE;AAElC,QAAI,UAAU,KAAM,MAAK,mBAAmB,IAAI,IAAI,KAAK,GAAG;AAE5D,WAAO,QAAQ,QAAQ,EAAE,UAAU,MAAM,KAAK,QAAQ,CAAC;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,mBAAmB,aAAqB,KAAmB;AACzD,eAAW,OAAO,KAAK,MAAM,OAAO,GAAG;AACrC,UAAI,IAAI,gBAAgB,KAAM;AAC9B,UAAI,CAAC,IAAI,UAAU,SAAS,WAAW,EAAG;AAC1C,YAAM,QAAQ,IAAI,UAAU;AAAA,QAC1B,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG,UAAU;AAAA,MAC9C;AACA,UAAI,OAAO;AACT,aAAK,OAAO,IAAI,IAAI,EAAE,GAAG,KAAK,aAAa,KAAK,WAAW,IAAI,CAAC;AAAA,MAClE;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASS,YAAY,oBAAI,IAA6B;AAAA,EAEtD,UAAU,OAAe,UAAkC;AACzD,UAAM,WAAW,KAAK,UAAU,IAAI,KAAK,KAAK,oBAAI,IAAgB;AAClE,aAAS,IAAI,QAAQ;AACrB,SAAK,UAAU,IAAI,OAAO,QAAQ;AAClC,QAAI,OAAO;AACX,WAAO,MAAM;AAIX,UAAI,CAAC,KAAM;AACX,aAAO;AACP,YAAM,MAAM,KAAK,UAAU,IAAI,KAAK;AACpC,WAAK,OAAO,QAAQ;AACpB,UAAI,KAAK,SAAS,EAAG,MAAK,UAAU,OAAO,KAAK;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,OAAe,QAAyB;AAC7C,SAAK,MAAM,IAAI,OAAO,MAAM;AAC5B,SAAK,QAAQ,KAAK;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,OAAqB;AAC3B,eAAW,WAAW,KAAK,UAAU,IAAI,KAAK,KAAK,CAAC,GAAG;AACrD,UAAI;AACF,gBAAQ;AAAA,MACV,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA,EAEA,QAAQ,MAAsC;AAC5C,UAAM,WAAqB,CAAC;AAC5B,eAAW,EAAE,OAAO,QAAQ,KAAK,KAAK,QAAQ;AAC5C,YAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAIhC,UACE,CAAC,OACD,IAAI,OAAO,aAAa,KAAK,YAC7B,IAAI,MAAM,OAAO,SACjB;AACA;AAAA,MACF;AAEA,WAAK,OAAO,OAAO;AAAA,QACjB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA;AAAA,QAEP,aAAa,KAAK;AAAA;AAAA;AAAA,QAGlB,WACE,KAAK,WAAW,YACZ,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,IAAI,WAAW,KAAK,QAAQ,CAAC,CAAC,IAC9C,IAAI;AAAA,QACV,WAAW,KAAK;AAAA,MAClB,CAAC;AACD,eAAS,KAAK,KAAK;AAAA,IACrB;AACA,WAAO,QAAQ,QAAQ,QAAQ;AAAA,EACjC;AAAA,EAEA,UAAU,KAAmC;AAC3C,WAAO,QAAQ,QAAQ,KAAK,eAAe,GAAG,CAAC;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAe,KAA0B;AACvC,UAAM,UAAuB,CAAC;AAE9B,eAAW,OAAO,KAAK,MAAM,OAAO,GAAG;AACrC,WACG,IAAI,UAAU,aAAa,IAAI,UAAU,cAC1C,IAAI,UAAU,QACd,IAAI,MAAM,aAAa,KACvB;AACA,cAAM,WAAsB;AAAA,UAC1B,GAAG;AAAA,UACH,OAAO;AAAA,UACP,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAOP,aAAa;AAAA,UACb,WAAW;AAAA,QACb;AACA,aAAK,OAAO,IAAI,IAAI,QAAQ;AAC5B,gBAAQ,KAAK,QAAQ;AAAA,MACvB;AAAA,IACF;AAEA,eAAW,OAAO,KAAK,MAAM,OAAO,GAAG;AACrC,UAAI,IAAI,UAAU,SAAU;AAC5B,YAAM,eAAe,IAAI,eAAe,QAAQ,IAAI,cAAc;AAClE,YAAM,UACJ,IAAI,gBAAgB,QAAQ,IAAI,cAAc,IAAI,SAAS;AAC7D,UAAI,CAAC,gBAAgB,CAAC,QAAS;AAE/B,YAAM,UAAqB;AAAA,QACzB,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA,QACP,WAAW;AAAA,MACb;AACA,WAAK,OAAO,IAAI,IAAI,OAAO;AAC3B,cAAQ,KAAK,OAAO;AAAA,IACtB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,OAAe,KAAwC;AAC5D,UAAM,MAAM,KAAK,MAAM,IAAI,KAAK;AAChC,QAAI,CAAC,IAAK,QAAO,QAAQ,QAAQ,IAAI;AACrC,QAAI,IAAI,UAAU,UAAU;AAC1B,YAAM,WAAsB;AAAA,QAC1B,GAAG;AAAA,QACH,OAAO;AAAA,QACP,OAAO;AAAA,QACP,WAAW;AAAA,MACb;AACA,WAAK,OAAO,OAAO,QAAQ;AAC3B,aAAO,QAAQ,QAAQ,QAAQ;AAAA,IACjC;AACA,QAAI,IAAI,UAAU,aAAa,IAAI,UAAU,WAAW;AAGtD,WAAK,gBAAgB,IAAI,KAAK;AAC9B,aAAO,QAAQ,QAAQ,GAAG;AAAA,IAC5B;AACA,WAAO,QAAQ,QAAQ,GAAG;AAAA,EAC5B;AAAA,EAEA,cAAc,UAAwC;AACpD,WAAO,QAAQ;AAAA,MACb,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE;AAAA,QACvB,CAAC,QAAQ,IAAI,OAAO,aAAa;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,mBAAmB,UAAqC;AACtD,WAAO,QAAQ;AAAA,MACb,CAAC,GAAG,KAAK,eAAe,EAAE;AAAA,QACxB,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG,OAAO,aAAa;AAAA,MACxD;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAIA,cAAc,QAAsC;AAClD,SAAK,UAAU,IAAI,OAAO,gBAAgB,MAAM;AAChD,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,2BAA2B,MAA6C;AACtE,WAAO,QAAQ,QAAQ,KAAK,UAAU,IAAI,IAAI,KAAK,IAAI;AAAA,EACzD;AAAA,EAEA,qBAAqB,UAAiD;AACpE,eAAW,WAAW,KAAK,UAAU,OAAO,GAAG;AAC7C,UAAI,QAAQ,aAAa,SAAU,QAAO,QAAQ,QAAQ,OAAO;AAAA,IACnE;AACA,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,eAAe,MAA0C;AACvD,UAAM,UAAU,CAAC,GAAG,KAAK,UAAU,OAAO,CAAC,EAAE;AAAA,MAC3C,CAAC,MAAM,EAAE,aAAa,KAAK;AAAA,IAC7B;AACA,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,yBAAyB,KAAK,QAAQ,EAAE;AACtE,QAAI,QAAQ,aAAa,KAAK,KAAK;AACjC,YAAM,IAAI,MAAM,0BAA0B;AAAA,IAC5C;AACA,QAAI,QAAQ,UAAU,WAAW;AAC/B,YAAM,IAAI,MAAM,sBAAsB,QAAQ,KAAK,EAAE;AAAA,IACvD;AAEA,UAAM,SAAuB;AAAA,MAC3B,IAAI,KAAK;AAAA,MACT,OAAO,KAAK;AAAA,MACZ,WAAW,KAAK;AAAA;AAAA;AAAA,MAGhB,QAAQ,QAAQ;AAAA,MAChB,OAAO,QAAQ;AAAA,MACf,UAAU,QAAQ;AAAA,MAClB,eAAe,QAAQ;AAAA,MACvB,cAAc,QAAQ;AAAA,MACtB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,iBAAiB,KAAK;AAAA,MACtB,WAAW,KAAK;AAAA,IAClB;AACA,SAAK,SAAS,IAAI,OAAO,IAAI,MAAM;AACnC,SAAK,UAAU,IAAI,QAAQ,gBAAgB;AAAA,MACzC,GAAG;AAAA,MACH,OAAO;AAAA,MACP,OAAO,KAAK;AAAA,MACZ,UAAU,OAAO;AAAA,MACjB,iBAAiB,KAAK;AAAA,IACxB,CAAC;AACD,WAAO,QAAQ,QAAQ,MAAM;AAAA,EAC/B;AAAA,EAEA,YAAY,UAAkB,MAA6B;AACzD,UAAM,UAAU,CAAC,GAAG,KAAK,UAAU,OAAO,CAAC,EAAE;AAAA,MAC3C,CAAC,MAAM,EAAE,aAAa;AAAA,IACxB;AACA,QAAI,SAAS;AACX,WAAK,UAAU,IAAI,QAAQ,gBAAgB;AAAA,QACzC,GAAG;AAAA,QACH,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AACA,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,oBAAoB,gBAAuC;AACzD,UAAM,UAAU,KAAK,UAAU,IAAI,cAAc;AACjD,QAAI,SAAS;AACX,WAAK,UAAU,IAAI,gBAAgB;AAAA,QACjC,GAAG;AAAA,QACH,iBAAiB;AAAA,MACnB,CAAC;AAAA,IACH;AACA,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,qBAAqB,MAA4C;AAC/D,eAAW,UAAU,KAAK,SAAS,OAAO,GAAG;AAC3C,UAAI,OAAO,cAAc,KAAM,QAAO,QAAQ,QAAQ,MAAM;AAAA,IAC9D;AACA,WAAO,QAAQ,QAAQ,IAAI;AAAA,EAC7B;AAAA,EAEA,UAAU,UAAgD;AACxD,WAAO,QAAQ,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI;AAAA,EAC5D;AAAA,EAEA,YAAY,MAA+C;AACzD,UAAM,SAAS,KAAK,SAAS,IAAI,KAAK,QAAQ;AAC9C,QAAI,CAAC,OAAQ,QAAO,QAAQ,QAAQ,IAAI;AACxC,UAAM,UAAwB;AAAA,MAC5B,GAAG;AAAA,MACH,cAAc,KAAK;AAAA,MACnB,eAAe,KAAK;AAAA,MACpB,QAAQ,KAAK;AAAA,MACb,iBAAiB,KAAK;AAAA,IACxB;AACA,SAAK,SAAS,IAAI,OAAO,IAAI,OAAO;AACpC,WAAO,QAAQ,QAAQ,OAAO;AAAA,EAChC;AAAA,EAEA,aAAa,UAAkB,KAA4B;AACzD,UAAM,SAAS,KAAK,SAAS,IAAI,QAAQ;AAGzC,QAAI,QAAQ,cAAc,MAAM;AAC9B,WAAK,SAAS,IAAI,UAAU,EAAE,GAAG,QAAQ,WAAW,IAAI,CAAC;AAAA,IAC3D;AACA,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,YAAY,OAAyC;AACnD,UAAM,MAAM,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC;AACtC,WAAO,QAAQ;AAAA,MACb,UAAU,SAAY,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK;AAAA,IACjE;AAAA,EACF;AAAA;AAAA;AAAA,EAKA,UAAuB;AACrB,WAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC;AAAA,EAChC;AACF;AAGO,SAAS,cACd,cACA,MACwB;AACxB,SAAO,aAAa,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AACjD;","names":["publicIdentityOf","backendDescriptor","matchAudience","matchAudience","backendDescriptor"]}