@aglyn/plugins-ai 1.0.0-beta.285 → 1.0.0-beta.287

package/src/lib/runtime/ai-dev-replay.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/runtime/ai-dev-replay.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { createHash } from 'node:crypto'\nimport { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from 'node:fs'\nimport { dirname, join } from 'node:path'\nimport { aiProviderRatesForModel, estimateAiProviderCostUsd } from '../providers/catalog'\nimport { aiCacheWriteHourSurchargeUsd } from '../providers/cache-write-hour'\nimport type {\n  AiProvider,\n  AiProviderRequest,\n  AiResult,\n  AiStreamEvent,\n  AiSystemBlock,\n  AiTool,\n} from '../providers/contract'\nimport { aiLiveBatchStats } from './ai-live-batch'\nimport { AI_REPLAY_DIR_ENV, aiDevReplayMode, type AiDevEnv as Env, type AiDevReplayMode } from './ai-dev-env'\n\n/** The key format's version: bumped when what a key covers changes, so no old answer is read under a new meaning. */\nconst KEY_VERSION = 1\n\n/**\n * THE DEVELOPMENT REPLAY CACHE (AGL-3660).\n *\n * Almost every dollar the provider bills in a month is a development run: a\n * live eval, the layout screenshots fed by one, a local guided start. Most of\n * the requests in a second run of the same eval are byte-identical to the\n * first — the change under test was to a compiler, a check or one prompt, not\n * to all of them — and each identical request bought the same sample twice.\n *\n * So, outside production only, the runtime keys each request by a hash of\n * everything that decides the answer — the provider, the model, the system\n * blocks, the tools, the messages, the ceiling, thinking and effort — and keeps\n * the provider's answer under `.cache/ai-replay/` (gitignored). The next\n * identical request is answered from disk for nothing; a request whose prompt\n * changed by one byte has a new key and goes to the provider. A replayed answer\n * is a real answer the same model gave to the same bytes, so an eval that\n * passes on replays has still seen every CHANGED prompt answered live: the\n * replay never stands in for a prompt the provider has not answered.\n *\n * `AGLYN_AI_REPLAY`:\n *  - `1` / `on`: replay what is recorded, record what is not.\n *  - `refresh`: every request live, its answer recorded over the old one.\n *  - `off` / `0`: nothing read, nothing written.\n *  - unset: on under the live-eval launcher (`AI_EVAL_LIVE_LAUNCHER`), off\n *    everywhere else, so a dev server or a spec that never asked for it\n *    behaves exactly as before.\n *\n * It never runs in a deployed server. `NODE_ENV=production`, `VERCEL_ENV`\n * of `production` or `preview`, or a Cloud Run service (`K_SERVICE`) turn it\n * off whatever the variable says, and the first request says so in the log:\n * a recorded answer handed to a customer would be another customer's page.\n *\n * Every live eval's table carries `aiDevReplayStats()`, so a run that was\n * all replays reads as one: `live: 0` is not a live pass.\n */\n\n// ── The key ──────────────────────────────────────────────────────────────\n\n/** JSON with every object's keys in sorted order: the same value, the same bytes, whatever built it. */\nexport function aiCanonicalJson(value: unknown): string {\n  return JSON.stringify(sortKeys(value))\n}\n\nfunction sortKeys(value: unknown): unknown {\n  if (Array.isArray(value)) return value.map(sortKeys)\n  if (value && typeof value === 'object') {\n    return Object.fromEntries(\n      Object.keys(value as Record<string, unknown>)\n        .sort()\n        .filter((key) => (value as Record<string, unknown>)[key] !== undefined)\n        .map((key) => [key, sortKeys((value as Record<string, unknown>)[key])]),\n    )\n  }\n  return value\n}\n\n/** What a request's answer depends on. The key, the signal and the cache lifetime are not part of it. */\nexport interface AiReplayRequest {\n  model: string\n  system: readonly AiSystemBlock[]\n  messages: AiProviderRequest['messages']\n  tools?: readonly AiTool[]\n  maxTokens: number\n  thinking?: AiProviderRequest['thinking']\n  effort?: AiProviderRequest['effort']\n}\n\n/** The request's replay key: a SHA-256 of everything that decides the answer. */\nexport function aiDevReplayKey(providerId: string, stream: boolean, request: AiReplayRequest): string {\n  return createHash('sha256')\n    .update(\n      aiCanonicalJson({\n        v: KEY_VERSION,\n        provider: providerId,\n        stream,\n        model: request.model,\n        // A breakpoint changes no answer, so the key reads the text alone.\n        system: request.system.map((block) => block.text),\n        tools: request.tools ?? [],\n        messages: request.messages,\n        maxTokens: request.maxTokens,\n        thinking: request.thinking ?? null,\n        effort: request.effort ?? null,\n      }),\n    )\n    .digest('hex')\n}\n\n/**\n * The prefix a provider caches: the model, the tools and every system block\n * through the last breakpoint. Two requests with the same prefix key read one\n * cache entry; `null` when the request marks no breakpoint.\n */\nexport function aiCachedPrefixKey(request: Pick<AiReplayRequest, 'model' | 'system' | 'tools'>): string | null {\n  const last = request.system.map((block) => Boolean(block.cacheBreakpoint)).lastIndexOf(true)\n  if (last < 0) return null\n  return createHash('sha256')\n    .update(\n      aiCanonicalJson({\n        model: request.model,\n        tools: request.tools ?? [],\n        system: request.system.slice(0, last + 1).map((block) => block.text),\n      }),\n    )\n    .digest('hex')\n}\n\n// ── The store ────────────────────────────────────────────────────────────\n\n/** The repository root: the nearest directory up from here holding `nx.json`, else the working directory. */\nfunction repositoryRoot(start: string = process.cwd()): string {\n  let dir = start\n  for (;;) {\n    if (existsSync(join(dir, 'nx.json'))) return dir\n    const parent = dirname(dir)\n    if (parent === dir) return start\n    dir = parent\n  }\n}\n\n/** Where recorded answers are kept. */\nexport function aiDevReplayDir(env: Env = process.env): string {\n  return env[AI_REPLAY_DIR_ENV] || join(repositoryRoot(), '.cache', 'ai-replay')\n}\n\ntype Recording =\n  | { v: number; key: string; model: string; recordedAt: string; kind: 'result'; result: AiResult }\n  | { v: number; key: string; model: string; recordedAt: string; kind: 'stream'; events: AiStreamEvent[] }\n\nfunction pathFor(dir: string, key: string): string {\n  return join(dir, key.slice(0, 2), `${key}.json`)\n}\n\nfunction readRecording(dir: string, key: string): Recording | null {\n  const path = pathFor(dir, key)\n  if (!existsSync(path)) return null\n  try {\n    const parsed = JSON.parse(readFileSync(path, 'utf8')) as Recording\n    return parsed?.v === KEY_VERSION && parsed.key === key ? parsed : null\n  } catch {\n    return null\n  }\n}\n\nfunction writeRecording(dir: string, recording: Recording): void {\n  const path = pathFor(dir, recording.key)\n  mkdirSync(dirname(path), { recursive: true })\n  // Written aside and renamed, so a run killed mid-write leaves no half file to replay.\n  const temp = `${path}.${process.pid}.tmp`\n  writeFileSync(temp, JSON.stringify(recording))\n  renameSync(temp, path)\n}\n\n// ── What a run did ───────────────────────────────────────────────────────\n\n/** How many of this process's requests were sent, and how many were answered from disk. */\nexport interface AiDevReplayStats {\n  mode: AiDevReplayMode\n  /** Requests sent to the provider. */\n  live: number\n  /** Requests answered from a recording. */\n  replayed: number\n  /** What the live requests cost at the provider's list rates. */\n  liveProviderUsd: number\n  /** What the replayed ones would have cost, had they been sent. */\n  savedProviderUsd: number\n}\n\nconst stats: AiDevReplayStats = {\n  mode: 'off',\n  live: 0,\n  replayed: 0,\n  liveProviderUsd: 0,\n  savedProviderUsd: 0,\n}\n\n/** This process's count so far: what a live eval prints beside its table. */\nexport function aiDevReplayStats(env: Env = process.env): AiDevReplayStats {\n  return {\n    ...stats,\n    mode: aiDevReplayMode(env),\n    liveProviderUsd: round(stats.liveProviderUsd),\n    savedProviderUsd: round(stats.savedProviderUsd),\n  }\n}\n\n/** Starts the count again; a spec that runs two rounds reports each. */\nexport function resetAiDevReplayStats(): void {\n  stats.live = 0\n  stats.replayed = 0\n  stats.liveProviderUsd = 0\n  stats.savedProviderUsd = 0\n}\n\nfunction round(usd: number): number {\n  return Math.round(usd * 1_000_000) / 1_000_000\n}\n\nfunction usageCost(usage: AiResult['usage'], model: string): number {\n  // A live run writes hour-long entries, billed above the rate table's write rate (AGL-3830).\n  return round(estimateAiProviderCostUsd(usage, model) + aiCacheWriteHourSurchargeUsd(usage, aiProviderRatesForModel(model)))\n}\n\n/** Counts one request a live path sent, at what the provider billed for it; `discount` is a batch's half. */\nexport function aiDevCountLive(usage: AiResult['usage'], model: string, discount = 1): void {\n  stats.live += 1\n  stats.liveProviderUsd += usageCost(usage, model) * discount\n}\n\n// ── The seam ─────────────────────────────────────────────────────────────\n\nasync function* replayEvents(events: readonly AiStreamEvent[]): AsyncGenerator<AiStreamEvent> {\n  for (const event of events) yield event\n}\n\n/** A live stream passed through as it arrives, and recorded once it is done. */\nasync function* recordEvents(\n  source: AsyncIterable<AiStreamEvent>,\n  onDone: (events: AiStreamEvent[]) => void,\n): AsyncGenerator<AiStreamEvent> {\n  const events: AiStreamEvent[] = []\n  let completed = false\n  for await (const event of source) {\n    events.push(event)\n    if (event.type === 'done') completed = true\n    yield event\n  }\n  // A stream cut short, or one that carried a provider error, is not an\n  // answer worth keeping: the next run asks again.\n  if (completed && !events.some((event) => event.type === 'error')) onDone(events)\n}\n\n/**\n * One request through the replay cache: answered from disk when recorded and\n * the mode replays, otherwise sent through `send` and recorded. `send` is the\n * live path — the provider, or the batch queue — and counts its own spend.\n */\nexport async function aiDevReplayComplete(\n  provider: Pick<AiProvider, 'id'>,\n  request: AiReplayRequest,\n  mode: Exclude<AiDevReplayMode, 'off'>,\n  send: () => Promise<AiResult>,\n  env: Env = process.env,\n): Promise<AiResult> {\n  const dir = aiDevReplayDir(env)\n  const key = aiDevReplayKey(provider.id, false, request)\n  const recorded = mode === 'replay' ? readRecording(dir, key) : null\n  if (recorded?.kind === 'result') {\n    stats.replayed += 1\n    stats.savedProviderUsd += usageCost(recorded.result.usage, request.model)\n    return recorded.result\n  }\n  const result = await send()\n  writeRecording(dir, {\n    v: KEY_VERSION,\n    key,\n    model: request.model,\n    recordedAt: new Date().toISOString(),\n    kind: 'result',\n    result,\n  })\n  return result\n}\n\n/** The streaming half of {@link aiDevReplayComplete}. */\nexport async function aiDevReplayStream(\n  provider: Pick<AiProvider, 'id'>,\n  request: AiReplayRequest,\n  mode: Exclude<AiDevReplayMode, 'off'>,\n  send: () => Promise<AsyncIterable<AiStreamEvent>>,\n  env: Env = process.env,\n): Promise<AsyncIterable<AiStreamEvent>> {\n  const dir = aiDevReplayDir(env)\n  const key = aiDevReplayKey(provider.id, true, request)\n  const recorded = mode === 'replay' ? readRecording(dir, key) : null\n  if (recorded?.kind === 'stream') {\n    stats.replayed += 1\n    const done = recorded.events.find((event) => event.type === 'done')\n    if (done?.type === 'done') stats.savedProviderUsd += usageCost(done.usage, request.model)\n    return replayEvents(recorded.events)\n  }\n  const live = await send()\n  return recordEvents(live, (events) => {\n    const done = events.find((event) => event.type === 'done')\n    if (done?.type === 'done') aiDevCountLive(done.usage, request.model)\n    writeRecording(dir, {\n      v: KEY_VERSION,\n      key,\n      model: request.model,\n      recordedAt: new Date().toISOString(),\n      kind: 'stream',\n      events,\n    })\n  })\n}\n\n// ── Warming a shared prefix before a fan-out ─────────────────────────────\n\n/**\n * A cache entry is readable only once the request that writes it has started\n * answering, so N requests sent at once over one prefix all pay to write it\n * and none reads it — which is exactly what a live eval's `Promise.all` over\n * its briefs did. In a development run the first request over a prefix goes\n * alone; the others wait for it and then read what it wrote. A prefix\n * answered within the cache's lifetime is not held again.\n *\n * Development only, like everything here: production's beat runs one step at\n * a time, and holding a customer's request behind another's would trade\n * their seconds for our cents.\n */\nconst warming = new Map<string, Promise<unknown>>()\nconst warmedAt = new Map<string, number>()\n\nexport async function aiDevWarmPrefixFirst<T>(\n  prefixKey: string | null,\n  ttlMs: number,\n  send: () => Promise<T>,\n  now: () => number = Date.now,\n): Promise<T> {\n  if (!prefixKey) return send()\n  const warmed = warmedAt.get(prefixKey)\n  if (warmed !== undefined && now() - warmed < ttlMs) return send()\n  const pending = warming.get(prefixKey)\n  if (pending) {\n    await pending.catch(() => undefined)\n    return send()\n  }\n  const first = send()\n  warming.set(prefixKey, first)\n  try {\n    const result = await first\n    warmedAt.set(prefixKey, now())\n    return result\n  } finally {\n    warming.delete(prefixKey)\n  }\n}\n\n/** Forgets every warmed prefix; for specs. */\nexport function resetAiDevWarmPrefixes(): void {\n  warming.clear()\n  warmedAt.clear()\n}\n\n// ── What a live eval prints ──────────────────────────────────────────────\n\n/**\n * The line every live eval's table carries (AGL-3660): how many of its\n * requests went to the provider and how many were answered from disk, what\n * the live ones cost at list, and how many batches carried them. A table\n * whose `live` is 0 proved nothing new — every prompt in it had been answered\n * before — and is not a live pass; `AGLYN_AI_REPLAY=refresh` asks again.\n * `batchedRequests` are the ones a batch answered, at half price;\n * `batchFallbacks` are the ones a batch left unanswered past its wait and\n * that were asked on their own, at full price (AGL-3781). Both count in `live`.\n */\nexport function aiLiveRunLedger(env: Env = process.env): AiDevReplayStats & {\n  batches: number\n  batchedRequests: number\n  batchFallbacks: number\n  allReplayed: boolean\n} {\n  const replay = aiDevReplayStats(env)\n  const batch = aiLiveBatchStats()\n  return {\n    ...replay,\n    batches: batch.batches,\n    batchedRequests: batch.requests,\n    batchFallbacks: batch.fallbacks,\n    allReplayed: replay.live === 0 && replay.replayed > 0,\n  }\n}\n"],"names":["createHash","existsSync","mkdirSync","readFileSync","renameSync","writeFileSync","dirname","join","aiProviderRatesForModel","estimateAiProviderCostUsd","aiCacheWriteHourSurchargeUsd","aiLiveBatchStats","AI_REPLAY_DIR_ENV","aiDevReplayMode","KEY_VERSION","aiCanonicalJson","value","JSON","stringify","sortKeys","Array","isArray","map","Object","fromEntries","keys","sort","filter","key","undefined","aiDevReplayKey","providerId","stream","request","update","v","provider","model","system","block","text","tools","messages","maxTokens","thinking","effort","digest","aiCachedPrefixKey","last","Boolean","cacheBreakpoint","lastIndexOf","slice","repositoryRoot","start","process","cwd","dir","parent","aiDevReplayDir","env","pathFor","readRecording","path","parsed","parse","writeRecording","recording","recursive","temp","pid","stats","mode","live","replayed","liveProviderUsd","savedProviderUsd","aiDevReplayStats","round","resetAiDevReplayStats","usd","Math","usageCost","usage","aiDevCountLive","discount","replayEvents","events","event","recordEvents","source","onDone","completed","push","type","some","aiDevReplayComplete","send","id","recorded","kind","result","recordedAt","Date","toISOString","aiDevReplayStream","done","find","warming","Map","warmedAt","aiDevWarmPrefixFirst","prefixKey","ttlMs","now","warmed","get","pending","catch","first","set","delete","resetAiDevWarmPrefixes","clear","aiLiveRunLedger","replay","batch","batches","batchedRequests","requests","batchFallbacks","fallbacks","allReplayed"],"mappings":";;;;AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,UAAU,QAAQ,cAAa;AACxC,SAASC,UAAU,EAAEC,SAAS,EAAEC,YAAY,EAAEC,UAAU,EAAEC,aAAa,QAAQ,UAAS;AACxF,SAASC,OAAO,EAAEC,IAAI,QAAQ,YAAW;AACzC,SAASC,uBAAuB,EAAEC,yBAAyB,QAAQ,0BAAsB;AACzF,SAASC,4BAA4B,QAAQ,mCAA+B;AAS5E,SAASC,gBAAgB,QAAQ,qBAAiB;AAClD,SAASC,iBAAiB,EAAEC,eAAe,QAAoD,kBAAc;AAE7G,mHAAmH,GACnH,MAAMC,cAAc;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAkCC,GAED,4EAA4E;AAE5E,sGAAsG,GACtG,OAAO,SAASC,gBAAgBC,KAAc;IAC5C,OAAOC,KAAKC,SAAS,CAACC,SAASH;AACjC;AAEA,SAASG,SAASH,KAAc;IAC9B,IAAII,MAAMC,OAAO,CAACL,QAAQ,OAAOA,MAAMM,GAAG,CAACH;IAC3C,IAAIH,SAAS,OAAOA,UAAU,UAAU;QACtC,OAAOO,OAAOC,WAAW,CACvBD,OAAOE,IAAI,CAACT,OACTU,IAAI,GACJC,MAAM,CAAC,CAACC,MAAQ,AAACZ,KAAiC,CAACY,IAAI,KAAKC,WAC5DP,GAAG,CAAC,CAACM,MAAQ;gBAACA;gBAAKT,SAAS,AAACH,KAAiC,CAACY,IAAI;aAAE;IAE5E;IACA,OAAOZ;AACT;AAaA,+EAA+E,GAC/E,OAAO,SAASc,eAAeC,UAAkB,EAAEC,MAAe,EAAEC,OAAwB;QAU7EA,gBAGGA,mBACFA;IAbd,OAAOjC,WAAW,UACfkC,MAAM,CACLnB,gBAAgB;QACdoB,GAAGrB;QACHsB,UAAUL;QACVC;QACAK,OAAOJ,QAAQI,KAAK;QACpB,mEAAmE;QACnEC,QAAQL,QAAQK,MAAM,CAAChB,GAAG,CAAC,CAACiB,QAAUA,MAAMC,IAAI;QAChDC,KAAK,GAAER,iBAAAA,QAAQQ,KAAK,YAAbR,iBAAiB,EAAE;QAC1BS,UAAUT,QAAQS,QAAQ;QAC1BC,WAAWV,QAAQU,SAAS;QAC5BC,QAAQ,GAAEX,oBAAAA,QAAQW,QAAQ,YAAhBX,oBAAoB;QAC9BY,MAAM,GAAEZ,kBAAAA,QAAQY,MAAM,YAAdZ,kBAAkB;IAC5B,IAEDa,MAAM,CAAC;AACZ;AAEA;;;;CAIC,GACD,OAAO,SAASC,kBAAkBd,OAA4D;QAO/EA;IANb,MAAMe,OAAOf,QAAQK,MAAM,CAAChB,GAAG,CAAC,CAACiB,QAAUU,QAAQV,MAAMW,eAAe,GAAGC,WAAW,CAAC;IACvF,IAAIH,OAAO,GAAG,OAAO;IACrB,OAAOhD,WAAW,UACfkC,MAAM,CACLnB,gBAAgB;QACdsB,OAAOJ,QAAQI,KAAK;QACpBI,KAAK,GAAER,iBAAAA,QAAQQ,KAAK,YAAbR,iBAAiB,EAAE;QAC1BK,QAAQL,QAAQK,MAAM,CAACc,KAAK,CAAC,GAAGJ,OAAO,GAAG1B,GAAG,CAAC,CAACiB,QAAUA,MAAMC,IAAI;IACrE,IAEDM,MAAM,CAAC;AACZ;AAEA,4EAA4E;AAE5E,2GAA2G,GAC3G,SAASO,eAAeC,QAAgBC,QAAQC,GAAG,EAAE;IACnD,IAAIC,MAAMH;IACV,OAAS;QACP,IAAIrD,WAAWM,KAAKkD,KAAK,aAAa,OAAOA;QAC7C,MAAMC,SAASpD,QAAQmD;QACvB,IAAIC,WAAWD,KAAK,OAAOH;QAC3BG,MAAMC;IACR;AACF;AAEA,qCAAqC,GACrC,OAAO,SAASC,eAAeC,MAAWL,QAAQK,GAAG;IACnD,OAAOA,GAAG,CAAChD,kBAAkB,IAAIL,KAAK8C,kBAAkB,UAAU;AACpE;AAMA,SAASQ,QAAQJ,GAAW,EAAE7B,GAAW;IACvC,OAAOrB,KAAKkD,KAAK7B,IAAIwB,KAAK,CAAC,GAAG,IAAI,GAAGxB,IAAI,KAAK,CAAC;AACjD;AAEA,SAASkC,cAAcL,GAAW,EAAE7B,GAAW;IAC7C,MAAMmC,OAAOF,QAAQJ,KAAK7B;IAC1B,IAAI,CAAC3B,WAAW8D,OAAO,OAAO;IAC9B,IAAI;QACF,MAAMC,SAAS/C,KAAKgD,KAAK,CAAC9D,aAAa4D,MAAM;QAC7C,OAAOC,CAAAA,0BAAAA,OAAQ7B,CAAC,MAAKrB,eAAekD,OAAOpC,GAAG,KAAKA,MAAMoC,SAAS;IACpE,EAAE,eAAM;QACN,OAAO;IACT;AACF;AAEA,SAASE,eAAeT,GAAW,EAAEU,SAAoB;IACvD,MAAMJ,OAAOF,QAAQJ,KAAKU,UAAUvC,GAAG;IACvC1B,UAAUI,QAAQyD,OAAO;QAAEK,WAAW;IAAK;IAC3C,sFAAsF;IACtF,MAAMC,OAAO,GAAGN,KAAK,CAAC,EAAER,QAAQe,GAAG,CAAC,IAAI,CAAC;IACzCjE,cAAcgE,MAAMpD,KAAKC,SAAS,CAACiD;IACnC/D,WAAWiE,MAAMN;AACnB;AAiBA,MAAMQ,QAA0B;IAC9BC,MAAM;IACNC,MAAM;IACNC,UAAU;IACVC,iBAAiB;IACjBC,kBAAkB;AACpB;AAEA,2EAA2E,GAC3E,OAAO,SAASC,iBAAiBjB,MAAWL,QAAQK,GAAG;IACrD,OAAO,aACFW;QACHC,MAAM3D,gBAAgB+C;QACtBe,iBAAiBG,MAAMP,MAAMI,eAAe;QAC5CC,kBAAkBE,MAAMP,MAAMK,gBAAgB;;AAElD;AAEA,sEAAsE,GACtE,OAAO,SAASG;IACdR,MAAME,IAAI,GAAG;IACbF,MAAMG,QAAQ,GAAG;IACjBH,MAAMI,eAAe,GAAG;IACxBJ,MAAMK,gBAAgB,GAAG;AAC3B;AAEA,SAASE,MAAME,GAAW;IACxB,OAAOC,KAAKH,KAAK,CAACE,MAAM,WAAa;AACvC;AAEA,SAASE,UAAUC,KAAwB,EAAE9C,KAAa;IACxD,4FAA4F;IAC5F,OAAOyC,MAAMrE,0BAA0B0E,OAAO9C,SAAS3B,6BAA6ByE,OAAO3E,wBAAwB6B;AACrH;AAEA,2GAA2G,GAC3G,OAAO,SAAS+C,eAAeD,KAAwB,EAAE9C,KAAa,EAAEgD,WAAW,CAAC;IAClFd,MAAME,IAAI,IAAI;IACdF,MAAMI,eAAe,IAAIO,UAAUC,OAAO9C,SAASgD;AACrD;AAEA,4EAA4E;AAE5E,SAAgBC,aAAaC,MAAgC;;QAC3D,KAAK,MAAMC,SAASD,OAAQ,MAAMC;IACpC;;AAEA,8EAA8E,GAC9E,SAAgBC,aACdC,MAAoC,EACpCC,MAAyC;;QAEzC,MAAMJ,SAA0B,EAAE;QAClC,IAAIK,YAAY;QAChB;;YAAA,IAAkC;gBAAlC,oCAA0BF,8IAAQ;;0BAAjBF;oBACfD,OAAOM,IAAI,CAACL;oBACZ,IAAIA,MAAMM,IAAI,KAAK,QAAQF,YAAY;oBACvC,MAAMJ;gBACR;YAAA;;;;;;;;;;;;;;QAAA;QACA,sEAAsE;QACtE,iDAAiD;QACjD,IAAII,aAAa,CAACL,OAAOQ,IAAI,CAAC,CAACP,QAAUA,MAAMM,IAAI,KAAK,UAAUH,OAAOJ;IAC3E;;AAEA;;;;CAIC,GACD,OAAO,eAAeS,oBACpB5D,QAAgC,EAChCH,OAAwB,EACxBuC,IAAqC,EACrCyB,IAA6B,EAC7BrC,MAAWL,QAAQK,GAAG;IAEtB,MAAMH,MAAME,eAAeC;IAC3B,MAAMhC,MAAME,eAAeM,SAAS8D,EAAE,EAAE,OAAOjE;IAC/C,MAAMkE,WAAW3B,SAAS,WAAWV,cAAcL,KAAK7B,OAAO;IAC/D,IAAIuE,CAAAA,4BAAAA,SAAUC,IAAI,MAAK,UAAU;QAC/B7B,MAAMG,QAAQ,IAAI;QAClBH,MAAMK,gBAAgB,IAAIM,UAAUiB,SAASE,MAAM,CAAClB,KAAK,EAAElD,QAAQI,KAAK;QACxE,OAAO8D,SAASE,MAAM;IACxB;IACA,MAAMA,SAAS,MAAMJ;IACrB/B,eAAeT,KAAK;QAClBtB,GAAGrB;QACHc;QACAS,OAAOJ,QAAQI,KAAK;QACpBiE,YAAY,IAAIC,OAAOC,WAAW;QAClCJ,MAAM;QACNC;IACF;IACA,OAAOA;AACT;AAEA,uDAAuD,GACvD,OAAO,eAAeI,kBACpBrE,QAAgC,EAChCH,OAAwB,EACxBuC,IAAqC,EACrCyB,IAAiD,EACjDrC,MAAWL,QAAQK,GAAG;IAEtB,MAAMH,MAAME,eAAeC;IAC3B,MAAMhC,MAAME,eAAeM,SAAS8D,EAAE,EAAE,MAAMjE;IAC9C,MAAMkE,WAAW3B,SAAS,WAAWV,cAAcL,KAAK7B,OAAO;IAC/D,IAAIuE,CAAAA,4BAAAA,SAAUC,IAAI,MAAK,UAAU;QAC/B7B,MAAMG,QAAQ,IAAI;QAClB,MAAMgC,OAAOP,SAASZ,MAAM,CAACoB,IAAI,CAAC,CAACnB,QAAUA,MAAMM,IAAI,KAAK;QAC5D,IAAIY,CAAAA,wBAAAA,KAAMZ,IAAI,MAAK,QAAQvB,MAAMK,gBAAgB,IAAIM,UAAUwB,KAAKvB,KAAK,EAAElD,QAAQI,KAAK;QACxF,OAAOiD,aAAaa,SAASZ,MAAM;IACrC;IACA,MAAMd,OAAO,MAAMwB;IACnB,OAAOR,aAAahB,MAAM,CAACc;QACzB,MAAMmB,OAAOnB,OAAOoB,IAAI,CAAC,CAACnB,QAAUA,MAAMM,IAAI,KAAK;QACnD,IAAIY,CAAAA,wBAAAA,KAAMZ,IAAI,MAAK,QAAQV,eAAesB,KAAKvB,KAAK,EAAElD,QAAQI,KAAK;QACnE6B,eAAeT,KAAK;YAClBtB,GAAGrB;YACHc;YACAS,OAAOJ,QAAQI,KAAK;YACpBiE,YAAY,IAAIC,OAAOC,WAAW;YAClCJ,MAAM;YACNb;QACF;IACF;AACF;AAEA,4EAA4E;AAE5E;;;;;;;;;;;CAWC,GACD,MAAMqB,UAAU,IAAIC;AACpB,MAAMC,WAAW,IAAID;AAErB,OAAO,eAAeE,qBACpBC,SAAwB,EACxBC,KAAa,EACbhB,IAAsB,EACtBiB,MAAoBX,KAAKW,GAAG;IAE5B,IAAI,CAACF,WAAW,OAAOf;IACvB,MAAMkB,SAASL,SAASM,GAAG,CAACJ;IAC5B,IAAIG,WAAWtF,aAAaqF,QAAQC,SAASF,OAAO,OAAOhB;IAC3D,MAAMoB,UAAUT,QAAQQ,GAAG,CAACJ;IAC5B,IAAIK,SAAS;QACX,MAAMA,QAAQC,KAAK,CAAC,IAAMzF;QAC1B,OAAOoE;IACT;IACA,MAAMsB,QAAQtB;IACdW,QAAQY,GAAG,CAACR,WAAWO;IACvB,IAAI;QACF,MAAMlB,SAAS,MAAMkB;QACrBT,SAASU,GAAG,CAACR,WAAWE;QACxB,OAAOb;IACT,SAAU;QACRO,QAAQa,MAAM,CAACT;IACjB;AACF;AAEA,4CAA4C,GAC5C,OAAO,SAASU;IACdd,QAAQe,KAAK;IACbb,SAASa,KAAK;AAChB;AAEA,4EAA4E;AAE5E;;;;;;;;;CASC,GACD,OAAO,SAASC,gBAAgBhE,MAAWL,QAAQK,GAAG;IAMpD,MAAMiE,SAAShD,iBAAiBjB;IAChC,MAAMkE,QAAQnH;IACd,OAAO,aACFkH;QACHE,SAASD,MAAMC,OAAO;QACtBC,iBAAiBF,MAAMG,QAAQ;QAC/BC,gBAAgBJ,MAAMK,SAAS;QAC/BC,aAAaP,OAAOpD,IAAI,KAAK,KAAKoD,OAAOnD,QAAQ,GAAG;;AAExD"}
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/runtime/ai-dev-replay.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { createHash } from 'node:crypto'\nimport { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from 'node:fs'\nimport { dirname, join } from 'node:path'\nimport { aiProviderRatesForModel, estimateAiProviderCostUsd } from '../providers/catalog'\nimport { aiCacheWriteHourSurchargeUsd } from '../providers/cache-write-hour'\nimport type {\n  AiProvider,\n  AiProviderRequest,\n  AiResult,\n  AiStreamEvent,\n  AiSystemBlock,\n  AiTool,\n} from '../providers/contract'\nimport { aiLiveBatchStats } from './ai-live-batch'\nimport { AI_REPLAY_DIR_ENV, aiDevReplayMode, type AiDevEnv as Env, type AiDevReplayMode } from './ai-dev-env'\n\n/** The key format's version: bumped when what a key covers changes, so no old answer is read under a new meaning. */\nconst KEY_VERSION = 1\n\n/**\n * THE DEVELOPMENT REPLAY CACHE (AGL-3660).\n *\n * Almost every dollar the provider bills in a month is a development run: a\n * live eval, the layout screenshots fed by one, a local guided start. Most of\n * the requests in a second run of the same eval are byte-identical to the\n * first — the change under test was to a compiler, a check or one prompt, not\n * to all of them — and each identical request bought the same sample twice.\n *\n * So, outside production only, the runtime keys each request by a hash of\n * everything that decides the answer — the provider, the model, the system\n * blocks, the tools, the messages, the ceiling, thinking and effort — and keeps\n * the provider's answer under `.cache/ai-replay/` (gitignored). The next\n * identical request is answered from disk for nothing; a request whose prompt\n * changed by one byte has a new key and goes to the provider. A replayed answer\n * is a real answer the same model gave to the same bytes, so an eval that\n * passes on replays has still seen every CHANGED prompt answered live: the\n * replay never stands in for a prompt the provider has not answered.\n *\n * `AGLYN_AI_REPLAY`:\n *  - `1` / `on`: replay what is recorded, record what is not.\n *  - `refresh`: every request live, its answer recorded over the old one.\n *  - `off` / `0`: nothing read, nothing written.\n *  - unset: on under the live-eval launcher (`AI_EVAL_LIVE_LAUNCHER`), off\n *    everywhere else, so a dev server or a spec that never asked for it\n *    behaves exactly as before.\n *\n * It never runs in a deployed server. `NODE_ENV=production`, `VERCEL_ENV`\n * of `production` or `preview`, or a Cloud Run service (`K_SERVICE`) turn it\n * off whatever the variable says, and the first request says so in the log:\n * a recorded answer handed to a customer would be another customer's page.\n *\n * Every live eval's table carries `aiDevReplayStats()`, so a run that was\n * all replays reads as one: `live: 0` is not a live pass.\n */\n\n// ── The key ──────────────────────────────────────────────────────────────\n\n/** JSON with every object's keys in sorted order: the same value, the same bytes, whatever built it. */\nexport function aiCanonicalJson(value: unknown): string {\n  return JSON.stringify(sortKeys(value))\n}\n\nfunction sortKeys(value: unknown): unknown {\n  if (Array.isArray(value)) return value.map(sortKeys)\n  if (value && typeof value === 'object') {\n    return Object.fromEntries(\n      Object.keys(value as Record<string, unknown>)\n        .sort()\n        .filter((key) => (value as Record<string, unknown>)[key] !== undefined)\n        .map((key) => [key, sortKeys((value as Record<string, unknown>)[key])]),\n    )\n  }\n  return value\n}\n\n/** What a request's answer depends on. The key, the signal and the cache lifetime are not part of it. */\nexport interface AiReplayRequest {\n  model: string\n  system: readonly AiSystemBlock[]\n  messages: AiProviderRequest['messages']\n  tools?: readonly AiTool[]\n  maxTokens: number\n  thinking?: AiProviderRequest['thinking']\n  effort?: AiProviderRequest['effort']\n  toolChoice?: AiProviderRequest['toolChoice']\n}\n\n/** The request's replay key: a SHA-256 of everything that decides the answer. */\nexport function aiDevReplayKey(providerId: string, stream: boolean, request: AiReplayRequest): string {\n  return createHash('sha256')\n    .update(\n      aiCanonicalJson({\n        v: KEY_VERSION,\n        provider: providerId,\n        stream,\n        model: request.model,\n        // A breakpoint changes no answer, so the key reads the text alone.\n        system: request.system.map((block) => block.text),\n        tools: request.tools ?? [],\n        messages: request.messages,\n        maxTokens: request.maxTokens,\n        thinking: request.thinking ?? null,\n        effort: request.effort ?? null,\n        // A named tool can change the answer (AGL-4076); keyed only when named, so no older key moves.\n        ...(request.toolChoice ? { toolChoice: request.toolChoice } : {}),\n      }),\n    )\n    .digest('hex')\n}\n\n/**\n * The prefix a provider caches: the model, the tools and every system block\n * through the last breakpoint. Two requests with the same prefix key read one\n * cache entry; `null` when the request marks no breakpoint.\n */\nexport function aiCachedPrefixKey(request: Pick<AiReplayRequest, 'model' | 'system' | 'tools'>): string | null {\n  const last = request.system.map((block) => Boolean(block.cacheBreakpoint)).lastIndexOf(true)\n  if (last < 0) return null\n  return createHash('sha256')\n    .update(\n      aiCanonicalJson({\n        model: request.model,\n        tools: request.tools ?? [],\n        system: request.system.slice(0, last + 1).map((block) => block.text),\n      }),\n    )\n    .digest('hex')\n}\n\n// ── The store ────────────────────────────────────────────────────────────\n\n/** The repository root: the nearest directory up from here holding `nx.json`, else the working directory. */\nfunction repositoryRoot(start: string = process.cwd()): string {\n  let dir = start\n  for (;;) {\n    if (existsSync(join(dir, 'nx.json'))) return dir\n    const parent = dirname(dir)\n    if (parent === dir) return start\n    dir = parent\n  }\n}\n\n/** Where recorded answers are kept. */\nexport function aiDevReplayDir(env: Env = process.env): string {\n  return env[AI_REPLAY_DIR_ENV] || join(repositoryRoot(), '.cache', 'ai-replay')\n}\n\ntype Recording =\n  | { v: number; key: string; model: string; recordedAt: string; kind: 'result'; result: AiResult }\n  | { v: number; key: string; model: string; recordedAt: string; kind: 'stream'; events: AiStreamEvent[] }\n\nfunction pathFor(dir: string, key: string): string {\n  return join(dir, key.slice(0, 2), `${key}.json`)\n}\n\nfunction readRecording(dir: string, key: string): Recording | null {\n  const path = pathFor(dir, key)\n  if (!existsSync(path)) return null\n  try {\n    const parsed = JSON.parse(readFileSync(path, 'utf8')) as Recording\n    return parsed?.v === KEY_VERSION && parsed.key === key ? parsed : null\n  } catch {\n    return null\n  }\n}\n\nfunction writeRecording(dir: string, recording: Recording): void {\n  const path = pathFor(dir, recording.key)\n  mkdirSync(dirname(path), { recursive: true })\n  // Written aside and renamed, so a run killed mid-write leaves no half file to replay.\n  const temp = `${path}.${process.pid}.tmp`\n  writeFileSync(temp, JSON.stringify(recording))\n  renameSync(temp, path)\n}\n\n// ── What a run did ───────────────────────────────────────────────────────\n\n/** How many of this process's requests were sent, and how many were answered from disk. */\nexport interface AiDevReplayStats {\n  mode: AiDevReplayMode\n  /** Requests sent to the provider. */\n  live: number\n  /** Requests answered from a recording. */\n  replayed: number\n  /** What the live requests cost at the provider's list rates. */\n  liveProviderUsd: number\n  /** What the replayed ones would have cost, had they been sent. */\n  savedProviderUsd: number\n}\n\nconst stats: AiDevReplayStats = {\n  mode: 'off',\n  live: 0,\n  replayed: 0,\n  liveProviderUsd: 0,\n  savedProviderUsd: 0,\n}\n\n/** This process's count so far: what a live eval prints beside its table. */\nexport function aiDevReplayStats(env: Env = process.env): AiDevReplayStats {\n  return {\n    ...stats,\n    mode: aiDevReplayMode(env),\n    liveProviderUsd: round(stats.liveProviderUsd),\n    savedProviderUsd: round(stats.savedProviderUsd),\n  }\n}\n\n/** Starts the count again; a spec that runs two rounds reports each. */\nexport function resetAiDevReplayStats(): void {\n  stats.live = 0\n  stats.replayed = 0\n  stats.liveProviderUsd = 0\n  stats.savedProviderUsd = 0\n}\n\nfunction round(usd: number): number {\n  return Math.round(usd * 1_000_000) / 1_000_000\n}\n\nfunction usageCost(usage: AiResult['usage'], model: string): number {\n  // A live run writes hour-long entries, billed above the rate table's write rate (AGL-3830).\n  return round(estimateAiProviderCostUsd(usage, model) + aiCacheWriteHourSurchargeUsd(usage, aiProviderRatesForModel(model)))\n}\n\n/** Counts one request a live path sent, at what the provider billed for it; `discount` is a batch's half. */\nexport function aiDevCountLive(usage: AiResult['usage'], model: string, discount = 1): void {\n  stats.live += 1\n  stats.liveProviderUsd += usageCost(usage, model) * discount\n}\n\n// ── The seam ─────────────────────────────────────────────────────────────\n\nasync function* replayEvents(events: readonly AiStreamEvent[]): AsyncGenerator<AiStreamEvent> {\n  for (const event of events) yield event\n}\n\n/** A live stream passed through as it arrives, and recorded once it is done. */\nasync function* recordEvents(\n  source: AsyncIterable<AiStreamEvent>,\n  onDone: (events: AiStreamEvent[]) => void,\n): AsyncGenerator<AiStreamEvent> {\n  const events: AiStreamEvent[] = []\n  let completed = false\n  for await (const event of source) {\n    events.push(event)\n    if (event.type === 'done') completed = true\n    yield event\n  }\n  // A stream cut short, or one that carried a provider error, is not an\n  // answer worth keeping: the next run asks again.\n  if (completed && !events.some((event) => event.type === 'error')) onDone(events)\n}\n\n/**\n * One request through the replay cache: answered from disk when recorded and\n * the mode replays, otherwise sent through `send` and recorded. `send` is the\n * live path — the provider, or the batch queue — and counts its own spend.\n */\nexport async function aiDevReplayComplete(\n  provider: Pick<AiProvider, 'id'>,\n  request: AiReplayRequest,\n  mode: Exclude<AiDevReplayMode, 'off'>,\n  send: () => Promise<AiResult>,\n  env: Env = process.env,\n): Promise<AiResult> {\n  const dir = aiDevReplayDir(env)\n  const key = aiDevReplayKey(provider.id, false, request)\n  const recorded = mode === 'replay' ? readRecording(dir, key) : null\n  if (recorded?.kind === 'result') {\n    stats.replayed += 1\n    stats.savedProviderUsd += usageCost(recorded.result.usage, request.model)\n    return recorded.result\n  }\n  const result = await send()\n  writeRecording(dir, {\n    v: KEY_VERSION,\n    key,\n    model: request.model,\n    recordedAt: new Date().toISOString(),\n    kind: 'result',\n    result,\n  })\n  return result\n}\n\n/** The streaming half of {@link aiDevReplayComplete}. */\nexport async function aiDevReplayStream(\n  provider: Pick<AiProvider, 'id'>,\n  request: AiReplayRequest,\n  mode: Exclude<AiDevReplayMode, 'off'>,\n  send: () => Promise<AsyncIterable<AiStreamEvent>>,\n  env: Env = process.env,\n): Promise<AsyncIterable<AiStreamEvent>> {\n  const dir = aiDevReplayDir(env)\n  const key = aiDevReplayKey(provider.id, true, request)\n  const recorded = mode === 'replay' ? readRecording(dir, key) : null\n  if (recorded?.kind === 'stream') {\n    stats.replayed += 1\n    const done = recorded.events.find((event) => event.type === 'done')\n    if (done?.type === 'done') stats.savedProviderUsd += usageCost(done.usage, request.model)\n    return replayEvents(recorded.events)\n  }\n  const live = await send()\n  return recordEvents(live, (events) => {\n    const done = events.find((event) => event.type === 'done')\n    if (done?.type === 'done') aiDevCountLive(done.usage, request.model)\n    writeRecording(dir, {\n      v: KEY_VERSION,\n      key,\n      model: request.model,\n      recordedAt: new Date().toISOString(),\n      kind: 'stream',\n      events,\n    })\n  })\n}\n\n// ── Warming a shared prefix before a fan-out ─────────────────────────────\n\n/**\n * A cache entry is readable only once the request that writes it has started\n * answering, so N requests sent at once over one prefix all pay to write it\n * and none reads it — which is exactly what a live eval's `Promise.all` over\n * its briefs did. In a development run the first request over a prefix goes\n * alone; the others wait for it and then read what it wrote. A prefix\n * answered within the cache's lifetime is not held again.\n *\n * Development only, like everything here: production's beat runs one step at\n * a time, and holding a customer's request behind another's would trade\n * their seconds for our cents.\n */\nconst warming = new Map<string, Promise<unknown>>()\nconst warmedAt = new Map<string, number>()\n\nexport async function aiDevWarmPrefixFirst<T>(\n  prefixKey: string | null,\n  ttlMs: number,\n  send: () => Promise<T>,\n  now: () => number = Date.now,\n): Promise<T> {\n  if (!prefixKey) return send()\n  const warmed = warmedAt.get(prefixKey)\n  if (warmed !== undefined && now() - warmed < ttlMs) return send()\n  const pending = warming.get(prefixKey)\n  if (pending) {\n    await pending.catch(() => undefined)\n    return send()\n  }\n  const first = send()\n  warming.set(prefixKey, first)\n  try {\n    const result = await first\n    warmedAt.set(prefixKey, now())\n    return result\n  } finally {\n    warming.delete(prefixKey)\n  }\n}\n\n/** Forgets every warmed prefix; for specs. */\nexport function resetAiDevWarmPrefixes(): void {\n  warming.clear()\n  warmedAt.clear()\n}\n\n// ── What a live eval prints ──────────────────────────────────────────────\n\n/**\n * The line every live eval's table carries (AGL-3660): how many of its\n * requests went to the provider and how many were answered from disk, what\n * the live ones cost at list, and how many batches carried them. A table\n * whose `live` is 0 proved nothing new — every prompt in it had been answered\n * before — and is not a live pass; `AGLYN_AI_REPLAY=refresh` asks again.\n * `batchedRequests` are the ones a batch answered, at half price;\n * `batchFallbacks` are the ones a batch left unanswered past its wait and\n * that were asked on their own, at full price (AGL-3781). Both count in `live`.\n */\nexport function aiLiveRunLedger(env: Env = process.env): AiDevReplayStats & {\n  batches: number\n  batchedRequests: number\n  batchFallbacks: number\n  allReplayed: boolean\n} {\n  const replay = aiDevReplayStats(env)\n  const batch = aiLiveBatchStats()\n  return {\n    ...replay,\n    batches: batch.batches,\n    batchedRequests: batch.requests,\n    batchFallbacks: batch.fallbacks,\n    allReplayed: replay.live === 0 && replay.replayed > 0,\n  }\n}\n"],"names":["createHash","existsSync","mkdirSync","readFileSync","renameSync","writeFileSync","dirname","join","aiProviderRatesForModel","estimateAiProviderCostUsd","aiCacheWriteHourSurchargeUsd","aiLiveBatchStats","AI_REPLAY_DIR_ENV","aiDevReplayMode","KEY_VERSION","aiCanonicalJson","value","JSON","stringify","sortKeys","Array","isArray","map","Object","fromEntries","keys","sort","filter","key","undefined","aiDevReplayKey","providerId","stream","request","update","v","provider","model","system","block","text","tools","messages","maxTokens","thinking","effort","toolChoice","digest","aiCachedPrefixKey","last","Boolean","cacheBreakpoint","lastIndexOf","slice","repositoryRoot","start","process","cwd","dir","parent","aiDevReplayDir","env","pathFor","readRecording","path","parsed","parse","writeRecording","recording","recursive","temp","pid","stats","mode","live","replayed","liveProviderUsd","savedProviderUsd","aiDevReplayStats","round","resetAiDevReplayStats","usd","Math","usageCost","usage","aiDevCountLive","discount","replayEvents","events","event","recordEvents","source","onDone","completed","push","type","some","aiDevReplayComplete","send","id","recorded","kind","result","recordedAt","Date","toISOString","aiDevReplayStream","done","find","warming","Map","warmedAt","aiDevWarmPrefixFirst","prefixKey","ttlMs","now","warmed","get","pending","catch","first","set","delete","resetAiDevWarmPrefixes","clear","aiLiveRunLedger","replay","batch","batches","batchedRequests","requests","batchFallbacks","fallbacks","allReplayed"],"mappings":";;;;AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,UAAU,QAAQ,cAAa;AACxC,SAASC,UAAU,EAAEC,SAAS,EAAEC,YAAY,EAAEC,UAAU,EAAEC,aAAa,QAAQ,UAAS;AACxF,SAASC,OAAO,EAAEC,IAAI,QAAQ,YAAW;AACzC,SAASC,uBAAuB,EAAEC,yBAAyB,QAAQ,0BAAsB;AACzF,SAASC,4BAA4B,QAAQ,mCAA+B;AAS5E,SAASC,gBAAgB,QAAQ,qBAAiB;AAClD,SAASC,iBAAiB,EAAEC,eAAe,QAAoD,kBAAc;AAE7G,mHAAmH,GACnH,MAAMC,cAAc;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAkCC,GAED,4EAA4E;AAE5E,sGAAsG,GACtG,OAAO,SAASC,gBAAgBC,KAAc;IAC5C,OAAOC,KAAKC,SAAS,CAACC,SAASH;AACjC;AAEA,SAASG,SAASH,KAAc;IAC9B,IAAII,MAAMC,OAAO,CAACL,QAAQ,OAAOA,MAAMM,GAAG,CAACH;IAC3C,IAAIH,SAAS,OAAOA,UAAU,UAAU;QACtC,OAAOO,OAAOC,WAAW,CACvBD,OAAOE,IAAI,CAACT,OACTU,IAAI,GACJC,MAAM,CAAC,CAACC,MAAQ,AAACZ,KAAiC,CAACY,IAAI,KAAKC,WAC5DP,GAAG,CAAC,CAACM,MAAQ;gBAACA;gBAAKT,SAAS,AAACH,KAAiC,CAACY,IAAI;aAAE;IAE5E;IACA,OAAOZ;AACT;AAcA,+EAA+E,GAC/E,OAAO,SAASc,eAAeC,UAAkB,EAAEC,MAAe,EAAEC,OAAwB;QAU7EA,gBAGGA,mBACFA;IAbd,OAAOjC,WAAW,UACfkC,MAAM,CACLnB,gBAAgB;QACdoB,GAAGrB;QACHsB,UAAUL;QACVC;QACAK,OAAOJ,QAAQI,KAAK;QACpB,mEAAmE;QACnEC,QAAQL,QAAQK,MAAM,CAAChB,GAAG,CAAC,CAACiB,QAAUA,MAAMC,IAAI;QAChDC,KAAK,GAAER,iBAAAA,QAAQQ,KAAK,YAAbR,iBAAiB,EAAE;QAC1BS,UAAUT,QAAQS,QAAQ;QAC1BC,WAAWV,QAAQU,SAAS;QAC5BC,QAAQ,GAAEX,oBAAAA,QAAQW,QAAQ,YAAhBX,oBAAoB;QAC9BY,MAAM,GAAEZ,kBAAAA,QAAQY,MAAM,YAAdZ,kBAAkB;OAEtBA,QAAQa,UAAU,GAAG;QAAEA,YAAYb,QAAQa,UAAU;IAAC,IAAI,CAAC,KAGlEC,MAAM,CAAC;AACZ;AAEA;;;;CAIC,GACD,OAAO,SAASC,kBAAkBf,OAA4D;QAO/EA;IANb,MAAMgB,OAAOhB,QAAQK,MAAM,CAAChB,GAAG,CAAC,CAACiB,QAAUW,QAAQX,MAAMY,eAAe,GAAGC,WAAW,CAAC;IACvF,IAAIH,OAAO,GAAG,OAAO;IACrB,OAAOjD,WAAW,UACfkC,MAAM,CACLnB,gBAAgB;QACdsB,OAAOJ,QAAQI,KAAK;QACpBI,KAAK,GAAER,iBAAAA,QAAQQ,KAAK,YAAbR,iBAAiB,EAAE;QAC1BK,QAAQL,QAAQK,MAAM,CAACe,KAAK,CAAC,GAAGJ,OAAO,GAAG3B,GAAG,CAAC,CAACiB,QAAUA,MAAMC,IAAI;IACrE,IAEDO,MAAM,CAAC;AACZ;AAEA,4EAA4E;AAE5E,2GAA2G,GAC3G,SAASO,eAAeC,QAAgBC,QAAQC,GAAG,EAAE;IACnD,IAAIC,MAAMH;IACV,OAAS;QACP,IAAItD,WAAWM,KAAKmD,KAAK,aAAa,OAAOA;QAC7C,MAAMC,SAASrD,QAAQoD;QACvB,IAAIC,WAAWD,KAAK,OAAOH;QAC3BG,MAAMC;IACR;AACF;AAEA,qCAAqC,GACrC,OAAO,SAASC,eAAeC,MAAWL,QAAQK,GAAG;IACnD,OAAOA,GAAG,CAACjD,kBAAkB,IAAIL,KAAK+C,kBAAkB,UAAU;AACpE;AAMA,SAASQ,QAAQJ,GAAW,EAAE9B,GAAW;IACvC,OAAOrB,KAAKmD,KAAK9B,IAAIyB,KAAK,CAAC,GAAG,IAAI,GAAGzB,IAAI,KAAK,CAAC;AACjD;AAEA,SAASmC,cAAcL,GAAW,EAAE9B,GAAW;IAC7C,MAAMoC,OAAOF,QAAQJ,KAAK9B;IAC1B,IAAI,CAAC3B,WAAW+D,OAAO,OAAO;IAC9B,IAAI;QACF,MAAMC,SAAShD,KAAKiD,KAAK,CAAC/D,aAAa6D,MAAM;QAC7C,OAAOC,CAAAA,0BAAAA,OAAQ9B,CAAC,MAAKrB,eAAemD,OAAOrC,GAAG,KAAKA,MAAMqC,SAAS;IACpE,EAAE,eAAM;QACN,OAAO;IACT;AACF;AAEA,SAASE,eAAeT,GAAW,EAAEU,SAAoB;IACvD,MAAMJ,OAAOF,QAAQJ,KAAKU,UAAUxC,GAAG;IACvC1B,UAAUI,QAAQ0D,OAAO;QAAEK,WAAW;IAAK;IAC3C,sFAAsF;IACtF,MAAMC,OAAO,GAAGN,KAAK,CAAC,EAAER,QAAQe,GAAG,CAAC,IAAI,CAAC;IACzClE,cAAciE,MAAMrD,KAAKC,SAAS,CAACkD;IACnChE,WAAWkE,MAAMN;AACnB;AAiBA,MAAMQ,QAA0B;IAC9BC,MAAM;IACNC,MAAM;IACNC,UAAU;IACVC,iBAAiB;IACjBC,kBAAkB;AACpB;AAEA,2EAA2E,GAC3E,OAAO,SAASC,iBAAiBjB,MAAWL,QAAQK,GAAG;IACrD,OAAO,aACFW;QACHC,MAAM5D,gBAAgBgD;QACtBe,iBAAiBG,MAAMP,MAAMI,eAAe;QAC5CC,kBAAkBE,MAAMP,MAAMK,gBAAgB;;AAElD;AAEA,sEAAsE,GACtE,OAAO,SAASG;IACdR,MAAME,IAAI,GAAG;IACbF,MAAMG,QAAQ,GAAG;IACjBH,MAAMI,eAAe,GAAG;IACxBJ,MAAMK,gBAAgB,GAAG;AAC3B;AAEA,SAASE,MAAME,GAAW;IACxB,OAAOC,KAAKH,KAAK,CAACE,MAAM,WAAa;AACvC;AAEA,SAASE,UAAUC,KAAwB,EAAE/C,KAAa;IACxD,4FAA4F;IAC5F,OAAO0C,MAAMtE,0BAA0B2E,OAAO/C,SAAS3B,6BAA6B0E,OAAO5E,wBAAwB6B;AACrH;AAEA,2GAA2G,GAC3G,OAAO,SAASgD,eAAeD,KAAwB,EAAE/C,KAAa,EAAEiD,WAAW,CAAC;IAClFd,MAAME,IAAI,IAAI;IACdF,MAAMI,eAAe,IAAIO,UAAUC,OAAO/C,SAASiD;AACrD;AAEA,4EAA4E;AAE5E,SAAgBC,aAAaC,MAAgC;;QAC3D,KAAK,MAAMC,SAASD,OAAQ,MAAMC;IACpC;;AAEA,8EAA8E,GAC9E,SAAgBC,aACdC,MAAoC,EACpCC,MAAyC;;QAEzC,MAAMJ,SAA0B,EAAE;QAClC,IAAIK,YAAY;QAChB;;YAAA,IAAkC;gBAAlC,oCAA0BF,8IAAQ;;0BAAjBF;oBACfD,OAAOM,IAAI,CAACL;oBACZ,IAAIA,MAAMM,IAAI,KAAK,QAAQF,YAAY;oBACvC,MAAMJ;gBACR;YAAA;;;;;;;;;;;;;;QAAA;QACA,sEAAsE;QACtE,iDAAiD;QACjD,IAAII,aAAa,CAACL,OAAOQ,IAAI,CAAC,CAACP,QAAUA,MAAMM,IAAI,KAAK,UAAUH,OAAOJ;IAC3E;;AAEA;;;;CAIC,GACD,OAAO,eAAeS,oBACpB7D,QAAgC,EAChCH,OAAwB,EACxBwC,IAAqC,EACrCyB,IAA6B,EAC7BrC,MAAWL,QAAQK,GAAG;IAEtB,MAAMH,MAAME,eAAeC;IAC3B,MAAMjC,MAAME,eAAeM,SAAS+D,EAAE,EAAE,OAAOlE;IAC/C,MAAMmE,WAAW3B,SAAS,WAAWV,cAAcL,KAAK9B,OAAO;IAC/D,IAAIwE,CAAAA,4BAAAA,SAAUC,IAAI,MAAK,UAAU;QAC/B7B,MAAMG,QAAQ,IAAI;QAClBH,MAAMK,gBAAgB,IAAIM,UAAUiB,SAASE,MAAM,CAAClB,KAAK,EAAEnD,QAAQI,KAAK;QACxE,OAAO+D,SAASE,MAAM;IACxB;IACA,MAAMA,SAAS,MAAMJ;IACrB/B,eAAeT,KAAK;QAClBvB,GAAGrB;QACHc;QACAS,OAAOJ,QAAQI,KAAK;QACpBkE,YAAY,IAAIC,OAAOC,WAAW;QAClCJ,MAAM;QACNC;IACF;IACA,OAAOA;AACT;AAEA,uDAAuD,GACvD,OAAO,eAAeI,kBACpBtE,QAAgC,EAChCH,OAAwB,EACxBwC,IAAqC,EACrCyB,IAAiD,EACjDrC,MAAWL,QAAQK,GAAG;IAEtB,MAAMH,MAAME,eAAeC;IAC3B,MAAMjC,MAAME,eAAeM,SAAS+D,EAAE,EAAE,MAAMlE;IAC9C,MAAMmE,WAAW3B,SAAS,WAAWV,cAAcL,KAAK9B,OAAO;IAC/D,IAAIwE,CAAAA,4BAAAA,SAAUC,IAAI,MAAK,UAAU;QAC/B7B,MAAMG,QAAQ,IAAI;QAClB,MAAMgC,OAAOP,SAASZ,MAAM,CAACoB,IAAI,CAAC,CAACnB,QAAUA,MAAMM,IAAI,KAAK;QAC5D,IAAIY,CAAAA,wBAAAA,KAAMZ,IAAI,MAAK,QAAQvB,MAAMK,gBAAgB,IAAIM,UAAUwB,KAAKvB,KAAK,EAAEnD,QAAQI,KAAK;QACxF,OAAOkD,aAAaa,SAASZ,MAAM;IACrC;IACA,MAAMd,OAAO,MAAMwB;IACnB,OAAOR,aAAahB,MAAM,CAACc;QACzB,MAAMmB,OAAOnB,OAAOoB,IAAI,CAAC,CAACnB,QAAUA,MAAMM,IAAI,KAAK;QACnD,IAAIY,CAAAA,wBAAAA,KAAMZ,IAAI,MAAK,QAAQV,eAAesB,KAAKvB,KAAK,EAAEnD,QAAQI,KAAK;QACnE8B,eAAeT,KAAK;YAClBvB,GAAGrB;YACHc;YACAS,OAAOJ,QAAQI,KAAK;YACpBkE,YAAY,IAAIC,OAAOC,WAAW;YAClCJ,MAAM;YACNb;QACF;IACF;AACF;AAEA,4EAA4E;AAE5E;;;;;;;;;;;CAWC,GACD,MAAMqB,UAAU,IAAIC;AACpB,MAAMC,WAAW,IAAID;AAErB,OAAO,eAAeE,qBACpBC,SAAwB,EACxBC,KAAa,EACbhB,IAAsB,EACtBiB,MAAoBX,KAAKW,GAAG;IAE5B,IAAI,CAACF,WAAW,OAAOf;IACvB,MAAMkB,SAASL,SAASM,GAAG,CAACJ;IAC5B,IAAIG,WAAWvF,aAAasF,QAAQC,SAASF,OAAO,OAAOhB;IAC3D,MAAMoB,UAAUT,QAAQQ,GAAG,CAACJ;IAC5B,IAAIK,SAAS;QACX,MAAMA,QAAQC,KAAK,CAAC,IAAM1F;QAC1B,OAAOqE;IACT;IACA,MAAMsB,QAAQtB;IACdW,QAAQY,GAAG,CAACR,WAAWO;IACvB,IAAI;QACF,MAAMlB,SAAS,MAAMkB;QACrBT,SAASU,GAAG,CAACR,WAAWE;QACxB,OAAOb;IACT,SAAU;QACRO,QAAQa,MAAM,CAACT;IACjB;AACF;AAEA,4CAA4C,GAC5C,OAAO,SAASU;IACdd,QAAQe,KAAK;IACbb,SAASa,KAAK;AAChB;AAEA,4EAA4E;AAE5E;;;;;;;;;CASC,GACD,OAAO,SAASC,gBAAgBhE,MAAWL,QAAQK,GAAG;IAMpD,MAAMiE,SAAShD,iBAAiBjB;IAChC,MAAMkE,QAAQpH;IACd,OAAO,aACFmH;QACHE,SAASD,MAAMC,OAAO;QACtBC,iBAAiBF,MAAMG,QAAQ;QAC/BC,gBAAgBJ,MAAMK,SAAS;QAC/BC,aAAaP,OAAOpD,IAAI,KAAK,KAAKoD,OAAOnD,QAAQ,GAAG;;AAExD"}

package/src/lib/runtime/ai-doctrine-validators.d.ts

@@ -573,6 +573,39 @@ export declare function detectUnrelatedScreenLinks(tree: AiDoctrineTree, outputK
  * check was given it, each by an id of `tree`.
  */
 export declare function detectLinksWithoutDestination(tree: AiDoctrineTree, outputKind: AiOutputKind, context?: Pick<AiDoctrineTreeContext, 'pageSections' | 'scrollTargetIds'>, written?: (id: string) => unknown, stored?: (id: string) => unknown): AiDoctrineViolation[];
+/**
+ * What a link's destination is read against when it is settled (AGL-4076):
+ * what `detectLinksWithoutDestination` reads it against, and the page being
+ * checked by every id it goes by, which a link is never sent to.
+ */
+export type AiLinkSettleContext = Pick<AiDoctrineTreeContext, 'pageSections' | 'scrollTargetIds' | 'writtenNode' | 'formScreenIds' | 'screenIds'> & {
+    ownScreenIds?: readonly string[];
+};
+/**
+ * RULE 10'S LINK THAT GOES NOWHERE, SETTLED IN CODE (AGL-4076).
+ *
+ * A Button or a Page Link with no destination (`link-without-destination`),
+ * or one sent to an anchor no section of its page has (`link-fragment`),
+ * stopped 5 of the 12 findings behind the 10/10 to 10/28 doctrine stops: the
+ * re-ask is spent, the job stops, and Try again asks the same. Each has one
+ * answer the rule itself gives, so it is applied before the check reads the
+ * tree, as `aiSettleUnrelatedScreenLinks` settles a link sent home:
+ *
+ * - a button drawn inside a Form is taken out, since the Form draws its own
+ *   send button; its words become the Form's `submitLabel` when the Form has
+ *   none of its own;
+ * - a link whose words ask a visitor to get in touch is sent to the page that
+ *   places the site's form, when the site has one that is not this page;
+ * - any other is left out: no page can be chosen for it from its words alone.
+ *
+ * A frame the link was the last thing in is taken out with it rather than
+ * left empty, up to the page's own sections, which always stay. A link to a
+ * section of its page, to a page the site has, or to any address is never
+ * touched, and nor is one whose `scrollTo` names no section, which the check
+ * re-asks as before. The root is never taken out. A tree with nothing to
+ * settle comes back as the same object; a node that is changed is copied.
+ */
+export declare function aiSettleLinksWithoutDestination<T extends AiDoctrineTree>(tree: T, outputKind: AiOutputKind, context?: AiLinkSettleContext): T;
 /**
  * Rule 13. The AI writes drafts. An answer that asks for anything to be
  * published, or to go live, is refused whatever else it got right; nothing
@@ -836,19 +869,30 @@ export declare function aiSettleCutHeadings(input: unknown): unknown;
  * - `page-text-on-band` (5): words on a band in a family's main or dark shade
  *   whose `sx` color is a page text color (`text.secondary`) are given the
  *   family's contrast text, and a List Item Text's secondary words there take
- *   the row's own color (`secondaryColor: inherit`).
+ *   the row's own color (`secondaryColor: inherit`);
+ * - `duplicated-inline-style` (16), where the style can be carried once
+ *   without changing what is drawn (AGL-4076): when the elements repeating it
+ *   are every element of one frame, its text alignment and its text color
+ *   move to that frame, which they inherit from, and a Typography's text
+ *   alignment becomes its `align`. Only where that leaves fewer repeats; a
+ *   repeated padding, size or border has no single place to go and is still
+ *   the re-ask's;
+ * - `link-without-destination` and `link-fragment` (10), given `links`, the
+ *   context the check reads links in (`aiSettleLinksWithoutDestination`).
  *
  * A tree with nothing to settle comes back as the same object, so settling is
  * idempotent; a node that is changed is copied, never edited in place.
  */
-export declare function aiSettleMechanicalRules<T extends AiDoctrineTree>(tree: T, outputKind: AiOutputKind): T;
+export declare function aiSettleMechanicalRules<T extends AiDoctrineTree>(tree: T, outputKind: AiOutputKind, links?: AiLinkSettleContext): T;
 /**
  * `aiSettleMechanicalRules` on a tree as the model wrote it, before the
  * palette validator reads it (AGL-3660), as `aiSettleWrittenGridItems` settles
  * its items. Anything that is no flat node map comes back as it was, and a
  * node whose shape is not a palette node's is read as nothing and left as written.
+ * Given `links`, a link that goes nowhere is settled too (AGL-4076), and a
+ * node that takes out is gone from the answer.
  */
-export declare function aiSettleWrittenMechanicalRules(input: unknown, outputKind: AiOutputKind): unknown;
+export declare function aiSettleWrittenMechanicalRules(input: unknown, outputKind: AiOutputKind, links?: AiLinkSettleContext): unknown;
 export interface AiDoctrineTreeReport {
     ok: boolean;
     /** The palette validator's result: the tree to store, its repairs and its id map. */

package/src/lib/runtime/ai-doctrine-validators.js

@@ -30,7 +30,7 @@ import { aiFreeSiteSectionsWithin, aiSiteHomeMinSections, aiSitePlanIsHome, aiSi
 import { aiLayoutIsShopPage, aiLayoutShopGridSection } from "../layout-language/ai-layout-listings.js";
 import { aiStorefrontSays } from "../layout-language/ai-layout-storefront.js";
 import { AI_INSTANCE_REF_PROP, validateAiNodeTree } from "./ai-node-tree.js";
-import { AI_PAGE_SCROLL_TO_PROP, aiPageLinkTarget, aiStoredScrollTargets } from "./ai-page-links.js";
+import { AI_PAGE_SCROLL_TO_PROP, aiPageLinkTarget, aiStoredScrollTargets, isAiFragmentHref } from "./ai-page-links.js";
 import { AI_EMAIL_CLIP_BYTES, AI_OUTPUT_BUDGETS, AI_OUTPUT_SURFACE, AI_TEXT_LIMITS, isHeadlineVariant } from "./ai-palette.js";
 import { AI_PALETTE, AI_SX_TOKENS } from "./ai-palette.generated.js";
 import { aiIsOnlyPlaceholders, aiPlaceholderTokens } from "./ai-placeholder-tokens.js";
@@ -2151,6 +2151,162 @@ const GRID = 'muiGrid';
     }
     return violations;
 }
+/** The longest send label a Form takes, as its palette entry bounds `submitLabel`. */ const FORM_SUBMIT_LABEL_MAX = 40;
+/** The frames a link may be the last thing in, taken out with it rather than left empty. */ const LINK_FRAMES = new Set([
+    'muiBox',
+    'muiStack',
+    'muiContainer',
+    'muiGrid',
+    'section',
+    'div',
+    'muiCardActions'
+]);
+/**
+ * The links `detectLinksWithoutDestination` would refuse as going nowhere
+ * (`link-without-destination`) or to an anchor no section has
+ * (`link-fragment`), read conservatively: a link whose `screenId` names a page
+ * the site has, whose `href` is anything but a fragment, that carries a Scroll
+ * to element interaction to a section of its page, or whose `scrollTo` the
+ * check reads on its own terms (`scroll-target-unknown`), is not one. A tree
+ * as written is read as the check will read it once the palette validator has
+ * dropped the fragment.
+ */ function linksWithoutDestination(tree, outputKind, context) {
+    var _context_pageSections;
+    if (outputKind === 'email' || outputKind === 'form') return [];
+    const sections = (_context_pageSections = context.pageSections) != null ? _context_pageSections : [];
+    const targets = context.scrollTargetIds ? new Set(context.scrollTargetIds) : null;
+    const known = context.screenIds ? new Set(context.screenIds) : null;
+    const written = (id)=>context.writtenNode ? context.writtenNode(id) : tree.nodes[id];
+    const found = [];
+    for (const visit of walkTree(tree)){
+        var _reverse_find;
+        var _node_props, _node_props1, _node_props2;
+        const { node } = visit;
+        if (!LINK_COMPONENTS.has(node.componentId)) continue;
+        const screenId = (_node_props = node.props) == null ? void 0 : _node_props['screenId'];
+        if (isFilled(screenId) && (!known || known.has(String(screenId).trim()))) continue;
+        const href = (_node_props1 = node.props) == null ? void 0 : _node_props1['href'];
+        if (isFilled(href) && !isAiFragmentHref(href)) continue;
+        const scrolls = aiStoredScrollTargets(node);
+        if (scrolls.length && (!targets || scrolls.some((target)=>targets.has(target)))) continue;
+        const target = aiPageLinkTarget(written(visit.id), sections);
+        if ((target == null ? void 0 : target.kind) === 'section' || (target == null ? void 0 : target.kind) === 'unknown' && target.via === 'scrollTo') continue;
+        const label = typeof ((_node_props2 = node.props) == null ? void 0 : _node_props2['children']) === 'string' ? node.props['children'].trim() : '';
+        const form = (_reverse_find = [
+            ...visit.ancestors
+        ].reverse().find((id)=>{
+            var _tree_nodes_id;
+            return ((_tree_nodes_id = tree.nodes[id]) == null ? void 0 : _tree_nodes_id.componentId) === 'form';
+        })) != null ? _reverse_find : null;
+        found.push({
+            id: visit.id,
+            label,
+            form
+        });
+    }
+    return found;
+}
+/**
+ * RULE 10'S LINK THAT GOES NOWHERE, SETTLED IN CODE (AGL-4076).
+ *
+ * A Button or a Page Link with no destination (`link-without-destination`),
+ * or one sent to an anchor no section of its page has (`link-fragment`),
+ * stopped 5 of the 12 findings behind the 10/10 to 10/28 doctrine stops: the
+ * re-ask is spent, the job stops, and Try again asks the same. Each has one
+ * answer the rule itself gives, so it is applied before the check reads the
+ * tree, as `aiSettleUnrelatedScreenLinks` settles a link sent home:
+ *
+ * - a button drawn inside a Form is taken out, since the Form draws its own
+ *   send button; its words become the Form's `submitLabel` when the Form has
+ *   none of its own;
+ * - a link whose words ask a visitor to get in touch is sent to the page that
+ *   places the site's form, when the site has one that is not this page;
+ * - any other is left out: no page can be chosen for it from its words alone.
+ *
+ * A frame the link was the last thing in is taken out with it rather than
+ * left empty, up to the page's own sections, which always stay. A link to a
+ * section of its page, to a page the site has, or to any address is never
+ * touched, and nor is one whose `scrollTo` names no section, which the check
+ * re-asks as before. The root is never taken out. A tree with nothing to
+ * settle comes back as the same object; a node that is changed is copied.
+ */ export function aiSettleLinksWithoutDestination(tree, outputKind, context = {}) {
+    var _context_ownScreenIds, _find, _context_formScreenIds, _tree_nodes_tree_rootId_nodes, _context_scrollTargetIds;
+    if (!tree.nodes[tree.rootId]) return tree;
+    const found = linksWithoutDestination(tree, outputKind, context);
+    if (!found.length) return tree;
+    const own = new Set((_context_ownScreenIds = context.ownScreenIds) != null ? _context_ownScreenIds : []);
+    const formScreen = (_find = ((_context_formScreenIds = context.formScreenIds) != null ? _context_formScreenIds : []).find((id)=>!own.has(id))) != null ? _find : null;
+    // A page's sections, and anything a link scrolls to, always stay.
+    const kept = new Set([
+        tree.rootId,
+        ...(_tree_nodes_tree_rootId_nodes = tree.nodes[tree.rootId].nodes) != null ? _tree_nodes_tree_rootId_nodes : [],
+        ...(_context_scrollTargetIds = context.scrollTargetIds) != null ? _context_scrollTargetIds : []
+    ]);
+    const nodes = _extends({}, tree.nodes);
+    const parents = new Map();
+    for (const visit of walkTree(tree)){
+        const parent = visit.ancestors[visit.ancestors.length - 1];
+        if (parent !== undefined) parents.set(visit.id, parent);
+    }
+    let changed = false;
+    const takeOut = (id)=>{
+        let next = id;
+        while(next !== undefined && nodes[next] && !kept.has(next)){
+            var _nodes_parent_nodes;
+            const parent = parents.get(next);
+            if (parent === undefined || !nodes[parent]) return;
+            const children = ((_nodes_parent_nodes = nodes[parent].nodes) != null ? _nodes_parent_nodes : []).filter((child)=>child !== next);
+            nodes[parent] = _extends({}, nodes[parent], {
+                nodes: children
+            });
+            changed = true;
+            const stack = [
+                next
+            ];
+            while(stack.length){
+                var _ref;
+                var _nodes_gone;
+                const gone = stack.pop();
+                stack.push(...(_ref = (_nodes_gone = nodes[gone]) == null ? void 0 : _nodes_gone.nodes) != null ? _ref : []);
+                delete nodes[gone];
+            }
+            next = !children.some((child)=>nodes[child]) && LINK_FRAMES.has(nodes[parent].componentId) ? parent : undefined;
+        }
+    };
+    for (const { id, label, form } of found){
+        if (!nodes[id]) continue;
+        if (form && nodes[form]) {
+            var _nodes_form_props;
+            if (label && label.length <= FORM_SUBMIT_LABEL_MAX && !isFilled((_nodes_form_props = nodes[form].props) == null ? void 0 : _nodes_form_props['submitLabel'])) {
+                var _nodes_form_props1;
+                nodes[form] = _extends({}, nodes[form], {
+                    props: _extends({}, (_nodes_form_props1 = nodes[form].props) != null ? _nodes_form_props1 : {}, {
+                        submitLabel: label
+                    })
+                });
+                changed = true;
+            }
+            takeOut(id);
+            continue;
+        }
+        if (formScreen && label && aiAsksToGetInTouch(label)) {
+            var _nodes_id_props;
+            const props = _extends({}, (_nodes_id_props = nodes[id].props) != null ? _nodes_id_props : {}, {
+                screenId: formScreen
+            });
+            delete props['href'];
+            nodes[id] = _extends({}, nodes[id], {
+                props
+            });
+            changed = true;
+            continue;
+        }
+        takeOut(id);
+    }
+    return changed ? _extends({}, tree, {
+        nodes
+    }) : tree;
+}
 /** Answer fields that say "publish", wherever the answer put them. */ const PUBLISH_KEYS = /^(?:publish|published|publishNow|publishAt|goLive|isLive|live|makeLive)$/i;
 /**
  * Rule 13. The AI writes drafts. An answer that asks for anything to be
@@ -2613,6 +2769,29 @@ const EMBED_COMPONENTS = new Set([
 ]);
 const DUPLICATE_SX_MIN_KEYS = 2;
 const DUPLICATE_SX_MIN_NODES = 4;
+/**
+ * Rule 16's repeated style: the elements whose `sx` is one style of at least
+ * `DUPLICATE_SX_MIN_KEYS` keys, grouped by that style, each group of at least
+ * `DUPLICATE_SX_MIN_NODES` elements, in document order.
+ */ function duplicatedSxGroups(tree) {
+    const seen = new Map();
+    for (const { id, node } of walkTree(tree)){
+        var _node_sx, _seen_get;
+        const sx = (_node_sx = node.sx) != null ? _node_sx : {};
+        if (Object.keys(sx).length < DUPLICATE_SX_MIN_KEYS) continue;
+        const key = JSON.stringify(Object.keys(sx).sort().map((name)=>[
+                name,
+                sx[name]
+            ]));
+        seen.set(key, [
+            ...(_seen_get = seen.get(key)) != null ? _seen_get : [],
+            id
+        ]);
+    }
+    return [
+        ...seen.values()
+    ].filter((ids)=>ids.length >= DUPLICATE_SX_MIN_NODES);
+}
 /**
  * Whether a third-party player is one the confirmed plan lists (AGL-3433). A
  * Video embed is admitted where the plan lists a player, playing the video
@@ -2648,11 +2827,10 @@ const DUPLICATE_SX_MIN_NODES = 4;
     const video = [];
     const embeds = [];
     const embedLinks = [];
-    const sxSeen = new Map();
     let images = 0;
     for (const { id, node } of visits){
-        var _node_nodes, _node_props, _node_sx, _node_sx1;
-        var _node_props1, _node_sx2, _node_props2, _node_props3, _node_props4, _node_props5;
+        var _node_nodes, _node_props, _node_sx;
+        var _node_props1, _node_sx1, _node_props2, _node_props3, _node_props4, _node_props5;
         const entry = AI_PALETTE[node.componentId];
         const children = ((_node_nodes = node.nodes) != null ? _node_nodes : []).filter((child)=>tree.nodes[child]);
         const ownProps = Object.entries((_node_props = node.props) != null ? _node_props : {}).filter(([name, value])=>!(name === 'component' && value === 'div'));
@@ -2663,7 +2841,7 @@ const DUPLICATE_SX_MIN_NODES = 4;
         if ((entry == null ? void 0 : entry.acceptsChildren) && !children.length && !boundForm && !OWNS_ITS_EMPTY_STATE.has(node.componentId)) {
             empty.push(id);
         }
-        if (outputKind !== 'email' && ((_node_sx2 = node.sx) == null ? void 0 : _node_sx2['fontFamily']) !== undefined) fonts.push(id);
+        if (outputKind !== 'email' && ((_node_sx1 = node.sx) == null ? void 0 : _node_sx1['fontFamily']) !== undefined) fonts.push(id);
         if (node.componentId === 'image') {
             var _node_props6;
             images += 1;
@@ -2678,22 +2856,8 @@ const DUPLICATE_SX_MIN_NODES = 4;
             if (verdict === 'unplanned') embeds.push(id);
             if (verdict === 'unplanned-link') embedLinks.push(id);
         }
-        const sx = (_node_sx1 = node.sx) != null ? _node_sx1 : {};
-        if (Object.keys(sx).length >= DUPLICATE_SX_MIN_KEYS) {
-            var _sxSeen_get;
-            const key = JSON.stringify(Object.keys(sx).sort().map((name)=>[
-                    name,
-                    sx[name]
-                ]));
-            sxSeen.set(key, [
-                ...(_sxSeen_get = sxSeen.get(key)) != null ? _sxSeen_get : [],
-                id
-            ]);
-        }
     }
-    const duplicatedSx = [
-        ...sxSeen.values()
-    ].filter((ids)=>ids.length >= DUPLICATE_SX_MIN_NODES).flat();
+    const duplicatedSx = duplicatedSxGroups(tree).flat();
     const violations = [];
     const add = (code, ids, message)=>{
         if (ids.length) violations.push({
@@ -3416,6 +3580,52 @@ const BUDGET_METRICS = [
     }) : input;
 }
 // ── Mechanical rules, settled in code (AGL-3660) ─────────────────────────
+/** The inherited styles a repeated style may be carried once in, by the frame that holds every element repeating it (AGL-4076). */ const HOISTED_SX_KEYS = [
+    'textAlign',
+    'color'
+];
+/**
+ * The elements that take each of those styles from their parent when they set
+ * none themselves, which are also the frames that may carry one for the
+ * elements they hold: none of them draws anything of its own in it.
+ */ const INHERITS_SX = {
+    // A Typography aligns as `inherit` unless its `align` says otherwise; a Card and a Paper set no alignment.
+    textAlign: new Set([
+        'muiTypography',
+        'muiBox',
+        'muiStack',
+        'muiGrid',
+        'muiContainer',
+        'section',
+        'div',
+        'muiCardContent',
+        'muiCard',
+        'muiPaper'
+    ]),
+    // A Card and a Paper paint their own text color, and a Button, a link and a list row theirs.
+    color: new Set([
+        'muiTypography',
+        'muiBox',
+        'muiStack',
+        'muiGrid',
+        'muiContainer',
+        'section',
+        'div',
+        'muiCardContent'
+    ])
+};
+/** A Typography's `align` values, which draw exactly what the same `sx` text alignment does. */ const TYPOGRAPHY_ALIGNS = new Set([
+    'inherit',
+    'left',
+    'center',
+    'right',
+    'justify'
+]);
+/** An `sx` without one key. */ function sxWithout(sx, key) {
+    const rest = _extends({}, sx != null ? sx : {});
+    delete rest[key];
+    return rest;
+}
 /**
  * THE RULES A CHECK WOULD REFUSE FOR AN ATTRIBUTE, SETTLED IN CODE (AGL-3660).
  *
@@ -3451,11 +3661,20 @@ const BUDGET_METRICS = [
  * - `page-text-on-band` (5): words on a band in a family's main or dark shade
  *   whose `sx` color is a page text color (`text.secondary`) are given the
  *   family's contrast text, and a List Item Text's secondary words there take
- *   the row's own color (`secondaryColor: inherit`).
+ *   the row's own color (`secondaryColor: inherit`);
+ * - `duplicated-inline-style` (16), where the style can be carried once
+ *   without changing what is drawn (AGL-4076): when the elements repeating it
+ *   are every element of one frame, its text alignment and its text color
+ *   move to that frame, which they inherit from, and a Typography's text
+ *   alignment becomes its `align`. Only where that leaves fewer repeats; a
+ *   repeated padding, size or border has no single place to go and is still
+ *   the re-ask's;
+ * - `link-without-destination` and `link-fragment` (10), given `links`, the
+ *   context the check reads links in (`aiSettleLinksWithoutDestination`).
  *
  * A tree with nothing to settle comes back as the same object, so settling is
  * idempotent; a node that is changed is copied, never edited in place.
- */ export function aiSettleMechanicalRules(tree, outputKind) {
+ */ export function aiSettleMechanicalRules(tree, outputKind, links) {
     if (!tree.nodes[tree.rootId]) return tree;
     const nodes = _extends({}, tree.nodes);
     const copied = new Set();
@@ -3590,25 +3809,122 @@ const BUDGET_METRICS = [
             });
         }
     }
-    return copied.size ? _extends({}, tree, {
+    // Rule 16: a style a group of elements repeats, carried once where it draws the same (AGL-4076).
+    if (framed) {
+        const parentOf = new Map();
+        for (const visit of walkTree({
+            rootId: tree.rootId,
+            nodes
+        })){
+            const parent = visit.ancestors[visit.ancestors.length - 1];
+            if (parent !== undefined) parentOf.set(visit.id, parent);
+        }
+        const heavy = ()=>detectHeavyDocument({
+                rootId: tree.rootId,
+                nodes
+            }, outputKind).reduce((sum, violation)=>{
+                var _ref;
+                var _violation_nodeIds;
+                return sum + ((_ref = (_violation_nodeIds = violation.nodeIds) == null ? void 0 : _violation_nodeIds.length) != null ? _ref : 0);
+            }, 0);
+        for (const group of duplicatedSxGroups({
+            rootId: tree.rootId,
+            nodes
+        })){
+            var _ref, _ref1;
+            var _nodes_group_, _nodes_parent;
+            const style = (_ref = (_nodes_group_ = nodes[group[0]]) == null ? void 0 : _nodes_group_.sx) != null ? _ref : {};
+            const same = JSON.stringify(Object.keys(style).sort().map((name)=>[
+                    name,
+                    style[name]
+                ]));
+            const alike = group.every((id)=>{
+                var _ref;
+                var _nodes_id;
+                const sx = (_ref = (_nodes_id = nodes[id]) == null ? void 0 : _nodes_id.sx) != null ? _ref : {};
+                return JSON.stringify(Object.keys(sx).sort().map((name)=>[
+                        name,
+                        sx[name]
+                    ])) === same;
+            });
+            if (!alike) continue;
+            const before = heavy();
+            const replaced = new Map();
+            const wasCopied = new Set(copied);
+            const put = (id, node)=>{
+                if (!replaced.has(id)) replaced.set(id, nodes[id]);
+                nodes[id] = node;
+                copied.add(id);
+            };
+            const parent = parentOf.get(group[0]);
+            const held = parent !== undefined ? ((_ref1 = (_nodes_parent = nodes[parent]) == null ? void 0 : _nodes_parent.nodes) != null ? _ref1 : []).filter((child)=>nodes[child]) : [];
+            const whole = parent !== undefined && parent !== tree.rootId && held.length === group.length && group.every((id)=>parentOf.get(id) === parent);
+            for (const key of whole ? HOISTED_SX_KEYS : []){
+                var _holder_sx, _holder_sx1;
+                var _holder_sx2;
+                const holder = nodes[parent];
+                if (style[key] === undefined || !INHERITS_SX[key].has(holder.componentId)) continue;
+                if (!group.every((id)=>INHERITS_SX[key].has(nodes[id].componentId))) continue;
+                const own = (_holder_sx2 = holder.sx) == null ? void 0 : _holder_sx2[key];
+                if (own !== undefined && JSON.stringify(own) !== JSON.stringify(style[key])) continue;
+                // A border drawn in the frame's own text color would take the new one.
+                if (key === 'color' && Object.keys((_holder_sx = holder.sx) != null ? _holder_sx : {}).some((name)=>/^(?:border|outline)/.test(name))) continue;
+                put(parent, _extends({}, holder, {
+                    sx: _extends({}, (_holder_sx1 = holder.sx) != null ? _holder_sx1 : {}, {
+                        [key]: style[key]
+                    })
+                }));
+                for (const id of group)put(id, _extends({}, nodes[id], {
+                    sx: sxWithout(nodes[id].sx, key)
+                }));
+            }
+            for (const id of group){
+                var _node_props7;
+                var _node_sx4, _node_props8;
+                const node = nodes[id];
+                const align = (_node_sx4 = node.sx) == null ? void 0 : _node_sx4['textAlign'];
+                if (node.componentId !== 'muiTypography' || typeof align !== 'string' || !TYPOGRAPHY_ALIGNS.has(align)) continue;
+                if (((_node_props8 = node.props) == null ? void 0 : _node_props8['align']) !== undefined && node.props['align'] !== 'inherit') continue;
+                put(id, _extends({}, node, {
+                    props: _extends({}, (_node_props7 = node.props) != null ? _node_props7 : {}, {
+                        align
+                    }),
+                    sx: sxWithout(node.sx, 'textAlign')
+                }));
+            }
+            // Kept only where it leaves the page lighter by the rule's own measure.
+            if (replaced.size && heavy() >= before) {
+                for (const [id, node] of replaced)nodes[id] = node;
+                copied.clear();
+                for (const id of wasCopied)copied.add(id);
+            }
+        }
+    }
+    const settled = copied.size ? _extends({}, tree, {
         nodes
     }) : tree;
+    return links ? aiSettleLinksWithoutDestination(settled, outputKind, links) : settled;
 }
 /**
  * `aiSettleMechanicalRules` on a tree as the model wrote it, before the
  * palette validator reads it (AGL-3660), as `aiSettleWrittenGridItems` settles
  * its items. Anything that is no flat node map comes back as it was, and a
  * node whose shape is not a palette node's is read as nothing and left as written.
- */ export function aiSettleWrittenMechanicalRules(input, outputKind) {
+ * Given `links`, a link that goes nowhere is settled too (AGL-4076), and a
+ * node that takes out is gone from the answer.
+ */ export function aiSettleWrittenMechanicalRules(input, outputKind, links) {
     if (!isRecord(input) || typeof input['rootId'] !== 'string' || !isRecord(input['nodes'])) return input;
     const readable = Object.entries(input['nodes']).filter(([, node])=>isRecord(node) && typeof node['componentId'] === 'string' && (node['props'] === undefined || isRecord(node['props'])) && (node['sx'] === undefined || isRecord(node['sx'])) && (node['nodes'] === undefined || Array.isArray(node['nodes']) && node['nodes'].every((child)=>typeof child === 'string')));
     const tree = {
         rootId: input['rootId'],
         nodes: Object.fromEntries(readable)
     };
-    const settled = aiSettleMechanicalRules(tree, outputKind);
-    return settled === tree ? input : _extends({}, input, {
-        nodes: _extends({}, input['nodes'], settled.nodes)
+    const settled = aiSettleMechanicalRules(tree, outputKind, links);
+    if (settled === tree) return input;
+    const nodes = _extends({}, input['nodes'], settled.nodes);
+    for (const id of Object.keys(tree.nodes))if (!settled.nodes[id]) delete nodes[id];
+    return _extends({}, input, {
+        nodes
     });
 }
 /**