@milaboratories/pl-middle-layer 1.58.4 → 1.59.0

package/dist/mutator/template/template_cache.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"template_cache.cjs","names":["PlTemplateLibV1","PlTemplateSoftwareV1","PlTemplateV1","PlTemplateOverrideV1","getDebugFlags"],"sources":["../../../src/mutator/template/template_cache.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport type {\n  AnyResourceRef,\n  PlClient,\n  PlTransaction,\n  ResourceId,\n  ResourceRef,\n} from \"@milaboratories/pl-client\";\nimport {\n  ensureResourceIdNotNull,\n  field,\n  resourceType,\n  toGlobalResourceId,\n} from \"@milaboratories/pl-client\";\nimport {\n  parseTemplate,\n  PlTemplateLibV1,\n  PlTemplateOverrideV1,\n  PlTemplateSoftwareV1,\n  PlTemplateV1,\n} from \"@milaboratories/pl-model-backend\";\nimport type {\n  CompiledTemplateV3,\n  TemplateData,\n  TemplateDataV3,\n  TemplateLibData,\n  TemplateLibDataV3,\n  TemplateSoftwareData,\n  TemplateSoftwareDataV3,\n} from \"@milaboratories/pl-model-backend\";\nimport { notEmpty } from \"@milaboratories/ts-helpers\";\nimport type { BlockPackSpecPrepared } from \"../../model\";\nimport type { TemplateSpecPrepared } from \"../../model/template_spec\";\nimport { getDebugFlags } from \"../../debug\";\n\nexport const TemplateCacheType = resourceType(\"TemplateCache\", \"1\");\n\nexport const TemplateCacheFieldName = \"__templateCache\";\nconst BATCH_SIZE = 50;\n/** @internal exported for testing */\nexport const GC_ACCESS_THRESHOLD = 30;\n/** @internal exported for testing */\nexport const GC_MAX_ENTRIES = 3000;\n/** @internal exported for testing */\nexport const ACCESS_COUNT_KEY = \"_accessCount\";\n/** @internal exported for testing */\nexport const ACCESS_KEY_PREFIX = \"access_\";\n\n// ─── Stats ───────────────────────────────────────────────────────────────────\n\nexport type TemplateCacheStat = {\n  totalMs: number;\n  flattenMs: number;\n  cacheInitMs: number;\n  materializeMs: number;\n  totalNodes: number;\n  cacheHits: number;\n  cacheMisses: number;\n  batchCount: number;\n  happyPath: boolean;\n  gcTriggered: boolean;\n  retries: number;\n  templateFormat: string;\n};\n\nfunction initialStat(): TemplateCacheStat {\n  return {\n    totalMs: 0,\n    flattenMs: 0,\n    cacheInitMs: 0,\n    materializeMs: 0,\n    totalNodes: 0,\n    cacheHits: 0,\n    cacheMisses: 0,\n    batchCount: 0,\n    happyPath: false,\n    gcTriggered: false,\n    retries: 0,\n    templateFormat: \"\",\n  };\n}\n\n// ─── Tree node abstraction ───────────────────────────────────────────────────\n\ninterface CacheableNode {\n  /** SHA-256 content hash (includes all descendant content) */\n  hash: string;\n  /** Creates this node's resource in a transaction.\n   *  childRefs maps child hash → already-resolved ResourceRef or ResourceId */\n  create: (tx: PlTransaction, childRefs: ReadonlyMap<string, AnyResourceRef>) => ResourceRef;\n  /** Hashes of direct child nodes this node depends on */\n  childHashes: string[];\n}\n\n// ─── Hash computation helpers ────────────────────────────────────────────────\n\nfunction getSourceCode(name: string, sources: Record<string, string>, sourceHash: string): string {\n  return notEmpty(\n    sources[sourceHash],\n    `trying to get \"${name}\" source: sources map doesn't contain source hash ${sourceHash}`,\n  );\n}\n\n/**\n * Bottom-up hash composition: each node hashes its OWN content + child hash STRINGS.\n * This means each unique node is hashed exactly once → O(n) instead of O(n * depth).\n */\n\n// V2 leaf hashes (libs, software — no children)\n\nfunction hashLibV2(lib: TemplateLibData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.src)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV2(sw: TemplateSoftwareData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.src)\n    .digest(\"hex\");\n}\n\n// V3 leaf hashes — use sourceHash directly instead of resolving source content\n\nfunction hashLibV3(lib: TemplateLibDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.sourceHash)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV3(sw: TemplateSoftwareDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.sourceHash)\n    .digest(\"hex\");\n}\n\n// ─── Tree flattening ─────────────────────────────────────────────────────────\n\nfunction flattenV2Tree(data: TemplateData): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n\n  function processLib(lib: TemplateLibData): string {\n    const hash = hashLibV2(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(PlTemplateLibV1.fromV2Data(lib).data),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareData): string {\n    const hash = hashSoftwareV2(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV2Data(sw);\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateData): string {\n    // Process children first (bottom-up) — their hashes are computed before ours\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content)\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.src);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV2Data(tpl).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV2Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data);\n  return nodes;\n}\n\nfunction flattenV3Tree(data: CompiledTemplateV3): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n  const sources = data.hashToSource;\n\n  function processLib(lib: TemplateLibDataV3): string {\n    const hash = hashLibV3(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(\n              PlTemplateLibV1.fromV3Data(lib, getSourceCode(lib.name, sources, lib.sourceHash))\n                .data,\n            ),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareDataV3): string {\n    const hash = hashSoftwareV3(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV3Data(\n            sw,\n            getSourceCode(sw.name, sources, sw.sourceHash),\n          );\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateDataV3): string {\n    // Process children first (bottom-up)\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content).\n    // Uses sourceHash directly — it already uniquely identifies the source.\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.sourceHash);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const sourceCode = getSourceCode(tpl.name, sources, tpl.sourceHash);\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV3Data(tpl, sourceCode).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV3Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data.template);\n  return nodes;\n}\n\n/** Flatten template tree into a topologically ordered list of cacheable nodes (leaves first). */\nexport function flattenTemplateTree(data: TemplateData | CompiledTemplateV3): CacheableNode[] {\n  if (data.type === \"pl.tengo-template.v2\") {\n    return flattenV2Tree(data);\n  } else {\n    return flattenV3Tree(data);\n  }\n}\n\n// ─── Cache operations ────────────────────────────────────────────────────────\n\n/** In-memory cache for the TemplateCache ResourceId per PlClient instance. */\nconst cacheRidMap = new WeakMap<PlClient, ResourceId>();\n\n/** Clear the in-memory cacheRid entry (call on errors referencing the cache resource). */\nexport function invalidateTemplateCacheId(pl: PlClient): void {\n  cacheRidMap.delete(pl);\n}\n\n/** Find or create the TemplateCache/1 resource on user root. */\nexport async function getOrCreateTemplateCache(pl: PlClient): Promise<ResourceId> {\n  // Check in-memory cache first (0ms after first call)\n  const cached = cacheRidMap.get(pl);\n  if (cached !== undefined) return cached;\n\n  // Try read-only check\n  const existing = await pl.withReadTx(\"templateCache:check\", async (tx) => {\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    return fd ? ensureResourceIdNotNull(fd.value) : undefined;\n  });\n  if (existing) {\n    cacheRidMap.set(pl, existing);\n    return existing;\n  }\n\n  const result = await pl.withWriteTx(\"templateCache:init\", async (tx) => {\n    // Double-check inside write tx (another instance may have created it)\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    if (fd) return ensureResourceIdNotNull(fd.value);\n\n    const cache = tx.createStruct(TemplateCacheType);\n    tx.createField(field(pl.clientRoot, TemplateCacheFieldName), \"Dynamic\", cache);\n    tx.lock(cache);\n    await tx.commit();\n    return await cache.globalId;\n  });\n  cacheRidMap.set(pl, result);\n  return result;\n}\n\n/** Remove the template cache from user root. */\nexport async function dropTemplateCache(pl: PlClient): Promise<void> {\n  await pl.withWriteTx(\"templateCache:drop\", async (tx) => {\n    const cacheField = field(pl.clientRoot, TemplateCacheFieldName);\n    const fd = await tx.getFieldIfExists(cacheField);\n    if (fd) {\n      tx.removeField(cacheField);\n      await tx.commit();\n    }\n  });\n  invalidateTemplateCacheId(pl);\n}\n\n// ─── GC ──────────────────────────────────────────────────────────────────────\n\n/**\n * Run count-based garbage collection on the template cache.\n * Evicts least-recently-used entries when the cache exceeds maxEntries.\n * Always resets the access counter to 0.\n *\n * @internal exported for testing (maxEntries parameter allows low thresholds in tests)\n * @returns true if entries were evicted\n */\nexport async function runGc(\n  pl: PlClient,\n  cacheRid: ResourceId,\n  maxEntries: number = GC_MAX_ENTRIES,\n): Promise<boolean> {\n  return await pl.withWriteTx(\"templateCache:gc\", async (tx) => {\n    const kvs = await tx.listKeyValuesString(cacheRid);\n    const entries: { hash: string; timestamp: number }[] = [];\n    for (const { key, value } of kvs) {\n      if (!key.startsWith(ACCESS_KEY_PREFIX)) continue;\n      entries.push({\n        hash: key.slice(ACCESS_KEY_PREFIX.length),\n        timestamp: parseInt(value, 10),\n      });\n    }\n\n    // Always reset counter\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, \"0\");\n\n    if (entries.length <= maxEntries) {\n      await tx.commit();\n      return false;\n    }\n\n    // Sort oldest first, evict until under limit\n    entries.sort((a, b) => a.timestamp - b.timestamp);\n    const toEvict = entries.length - maxEntries;\n    for (let i = 0; i < toEvict; i++) {\n      tx.removeField(field(cacheRid, entries[i].hash));\n      tx.deleteKValue(cacheRid, ACCESS_KEY_PREFIX + entries[i].hash);\n    }\n\n    await tx.commit();\n    return true;\n  });\n}\n\n// ─── Batched materialization ─────────────────────────────────────────────────\n\n/** Create a batch of cache nodes in the current transaction. */\nfunction createBatchNodes(\n  tx: PlTransaction,\n  cacheRid: ResourceId,\n  batch: CacheableNode[],\n  resolvedIds: ReadonlyMap<string, ResourceId>,\n  newRefs: Map<string, ResourceRef>,\n  now: string,\n): void {\n  for (const node of batch) {\n    const childRefs = new Map<string, AnyResourceRef>();\n    for (const ch of node.childHashes) {\n      const resolved = resolvedIds.get(ch) ?? newRefs.get(ch);\n      if (resolved === undefined) {\n        throw new Error(`BUG: child ${ch} not resolved`);\n      }\n      childRefs.set(ch, resolved);\n    }\n    const ref = node.create(tx, childRefs);\n    newRefs.set(node.hash, ref);\n    tx.createField(field(cacheRid, node.hash), \"Dynamic\", ref);\n    tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + node.hash, now);\n  }\n}\n\n/**\n * Materialize a template tree via the cache using \"probe all + batched creation\".\n *\n * Phase 1 (single write tx):\n *   - Check existence of ALL hashes in one roundtrip\n *   - Happy path: if root cached, update access tracking and return\n *   - Otherwise: fetch ResourceIds for all cache hits, create first batch of missing nodes\n *\n * Phase 2..N (one write tx per batch):\n *   - Create remaining missing nodes in BATCH_SIZE chunks\n *\n * @returns root ResourceId and current access count (for GC decision)\n */\nasync function materialize(\n  pl: PlClient,\n  cacheRid: ResourceId,\n  rootHash: string,\n  nodes: CacheableNode[],\n  stat: TemplateCacheStat,\n): Promise<{ rootId: ResourceId; accessCount: number }> {\n  const allHashes = nodes.map((n) => n.hash);\n  const resolvedIds = new Map<string, ResourceId>();\n\n  // Phase 1: probe all + first batch\n  const phase1 = await pl.withWriteTx(\"templateCache:materialize\", async (tx) => {\n    // 1 roundtrip: check all hashes + read access count\n    const [exists, countStr] = await Promise.all([\n      Promise.all(allHashes.map((h) => tx.fieldExists(field(cacheRid, h)))),\n      tx.getKValueStringIfExists(cacheRid, ACCESS_COUNT_KEY),\n    ]);\n\n    const prevCount = countStr ? parseInt(countStr, 10) : 0;\n    const newCount = prevCount + 1;\n    const now = Date.now().toString();\n    const rootIdx = allHashes.length - 1;\n\n    // Happy path: root already cached\n    if (exists[rootIdx]) {\n      const rootFd = await tx.getField(field(cacheRid, rootHash));\n      const rootRid = ensureResourceIdNotNull(rootFd.value);\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + rootHash, now);\n      tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n      await tx.commit();\n      stat.happyPath = true;\n      stat.cacheHits = stat.totalNodes;\n      stat.batchCount = 1;\n      return { done: true as const, rootId: rootRid, accessCount: newCount };\n    }\n\n    // Fetch ResourceIds for all cache hits (1 roundtrip)\n    const hitIndices: number[] = [];\n    for (let i = 0; i < allHashes.length; i++) {\n      if (exists[i]) hitIndices.push(i);\n    }\n\n    if (hitIndices.length > 0) {\n      const hitFields = await Promise.all(\n        hitIndices.map((i) => tx.getField(field(cacheRid, allHashes[i]))),\n      );\n      for (let j = 0; j < hitIndices.length; j++) {\n        resolvedIds.set(allHashes[hitIndices[j]], ensureResourceIdNotNull(hitFields[j].value));\n      }\n    }\n    stat.cacheHits = hitIndices.length;\n\n    // Missing nodes (topo order preserved from flatten)\n    const missing = nodes.filter((n) => !resolvedIds.has(n.hash));\n    stat.cacheMisses = missing.length;\n\n    // Create first batch of missing nodes\n    const firstBatch = missing.slice(0, BATCH_SIZE);\n    const newRefs = new Map<string, ResourceRef>();\n    createBatchNodes(tx, cacheRid, firstBatch, resolvedIds, newRefs, now);\n\n    // Update access tracking for cache hits\n    for (const i of hitIndices) {\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + allHashes[i], now);\n    }\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n\n    await tx.commit();\n\n    // Resolve new refs to global IDs (after commit)\n    for (const [hash, ref] of newRefs) {\n      resolvedIds.set(hash, await toGlobalResourceId(ref));\n    }\n\n    return {\n      done: false as const,\n      remaining: missing.slice(BATCH_SIZE),\n      accessCount: newCount,\n    };\n  });\n\n  if (phase1.done) {\n    return { rootId: phase1.rootId, accessCount: phase1.accessCount };\n  }\n\n  stat.batchCount = 1;\n\n  // Phase 2+: remaining batches\n  const { remaining } = phase1;\n  for (let i = 0; i < remaining.length; i += BATCH_SIZE) {\n    const batch = remaining.slice(i, i + BATCH_SIZE);\n    stat.batchCount++;\n\n    await pl.withWriteTx(\"templateCache:create\", async (tx) => {\n      const newRefs = new Map<string, ResourceRef>();\n      const now = Date.now().toString();\n      createBatchNodes(tx, cacheRid, batch, resolvedIds, newRefs, now);\n      await tx.commit();\n\n      for (const [hash, ref] of newRefs) {\n        resolvedIds.set(hash, await toGlobalResourceId(ref));\n      }\n    });\n  }\n\n  const rootId = resolvedIds.get(rootHash);\n  if (!rootId) throw new Error(\"BUG: root hash not resolved after all batches\");\n  return { rootId, accessCount: phase1.accessCount };\n}\n\n/**\n * Materialize a template tree via the cache.\n * Manages its own transactions internally — do NOT call inside an existing tx.\n *\n * @returns concrete ResourceId of the root template\n */\nexport async function loadTemplateCached(\n  pl: PlClient,\n  spec: TemplateSpecPrepared,\n  options?: { cacheResourceId?: ResourceId },\n): Promise<ResourceId> {\n  const stat = initialStat();\n  const t0 = performance.now();\n\n  try {\n    // Parse to data if needed\n    let tplData: TemplateData | CompiledTemplateV3;\n    switch (spec.type) {\n      case \"explicit\":\n        tplData = parseTemplate(spec.content);\n        break;\n      case \"prepared\":\n        tplData = spec.data;\n        break;\n      case \"cached\":\n        return spec.resourceId;\n      case \"from-registry\":\n        throw new Error(\n          \"loadTemplateCached does not support from-registry specs; use loadTemplate instead\",\n        );\n      default: {\n        const _: never = spec;\n        throw new Error(`unexpected spec type: ${(_ as any).type}`);\n      }\n    }\n\n    stat.templateFormat = tplData.type;\n\n    // Flatten to ordered nodes\n    const tFlatten = performance.now();\n    const nodes = flattenTemplateTree(tplData);\n    stat.flattenMs = performance.now() - tFlatten;\n    if (nodes.length === 0) throw new Error(\"template tree produced no nodes\");\n\n    stat.totalNodes = nodes.length;\n    const rootHash = nodes[nodes.length - 1].hash;\n\n    // Resolve or create cache resource\n    const tCacheInit = performance.now();\n    const cacheRid = options?.cacheResourceId ?? (await getOrCreateTemplateCache(pl));\n    stat.cacheInitMs = performance.now() - tCacheInit;\n\n    // Retry loop: if a write tx fails (e.g. concurrent GC invalidated a cached resource),\n    // restart materialization from scratch.\n    const MAX_RETRIES = 3;\n    for (let attempt = 0; attempt < MAX_RETRIES; attempt++) {\n      try {\n        const tMat = performance.now();\n        const result = await materialize(pl, cacheRid, rootHash, nodes, stat);\n        stat.materializeMs = performance.now() - tMat;\n        stat.retries = attempt;\n\n        // GC in separate tx if access count exceeded threshold\n        if (result.accessCount >= GC_ACCESS_THRESHOLD) {\n          await runGc(pl, cacheRid);\n          stat.gcTriggered = true;\n        }\n\n        return result.rootId;\n      } catch (e) {\n        if (attempt === MAX_RETRIES - 1) throw e;\n        // Retry from scratch — previous batch results may reference GC'd resources\n        stat.cacheHits = 0;\n        stat.cacheMisses = 0;\n      }\n    }\n\n    throw new Error(\"BUG: unreachable\");\n  } finally {\n    stat.totalMs = performance.now() - t0;\n    if (getDebugFlags().logTemplateCacheStat) {\n      console.log(`[templateCache] ${JSON.stringify(stat)}`);\n    }\n  }\n}\n\n// ─── Caller helper ───────────────────────────────────────────────────────────\n\n/**\n * Pre-materialize a block pack's template via cache.\n * Returns a copy of the spec with the template replaced by a cached reference.\n * If the template is already cached, returns the spec unchanged.\n */\nexport async function cacheBlockPackTemplate(\n  pl: PlClient,\n  spec: BlockPackSpecPrepared,\n  options?: { cacheResourceId?: ResourceId },\n): Promise<BlockPackSpecPrepared> {\n  if (spec.template.type === \"cached\") return spec;\n\n  const resourceId = await loadTemplateCached(pl, spec.template, options);\n  return {\n    ...spec,\n    template: { type: \"cached\", resourceId },\n  };\n}\n"],"mappings":";;;;;;;AAmCA,MAAa,qBAAA,GAAA,0BAAA,cAAiC,iBAAiB,IAAI;AAEnE,MAAa,yBAAyB;AACtC,MAAM,aAAa;;AAEnB,MAAa,sBAAsB;;AAEnC,MAAa,iBAAiB;;AAE9B,MAAa,mBAAmB;;AAEhC,MAAa,oBAAoB;AAmBjC,SAAS,cAAiC;AACxC,QAAO;EACL,SAAS;EACT,WAAW;EACX,aAAa;EACb,eAAe;EACf,YAAY;EACZ,WAAW;EACX,aAAa;EACb,YAAY;EACZ,WAAW;EACX,aAAa;EACb,SAAS;EACT,gBAAgB;EACjB;;AAiBH,SAAS,cAAc,MAAc,SAAiC,YAA4B;AAChG,SAAA,GAAA,2BAAA,UACE,QAAQ,aACR,kBAAkB,KAAK,oDAAoD,aAC5E;;;;;;AAUH,SAAS,UAAU,KAA8B;AAC/C,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOA,iCAAAA,gBAAgB,KAAK,KAAK,CACjC,OAAOA,iCAAAA,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI,CACf,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAkC;AACxD,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOC,iCAAAA,qBAAqB,KAAK,KAAK,CACtC,OAAOA,iCAAAA,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,IAAI,CACd,OAAO,MAAM;;AAKlB,SAAS,UAAU,KAAgC;AACjD,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOD,iCAAAA,gBAAgB,KAAK,KAAK,CACjC,OAAOA,iCAAAA,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW,CACtB,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAoC;AAC1D,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOC,iCAAAA,qBAAqB,KAAK,KAAK,CACtC,OAAOA,iCAAAA,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,WAAW,CACrB,OAAO,MAAM;;AAKlB,SAAS,cAAc,MAAqC;CAC1D,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAE9B,SAAS,WAAW,KAA8B;EAChD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACDD,iCAAAA,gBAAgB,MAChB,KAAK,UAAUA,iCAAAA,gBAAgB,WAAW,IAAI,CAAC,KAAK,CACrD;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAkC;EACzD,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAASC,iCAAAA,qBAAqB,WAAW,GAAG;KAClD,MAAM,MAAM,GAAG,aAAaA,iCAAAA,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAKA,iCAAAA,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA2B;EAElD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGC,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAI7E,MAAM,KAAA,GAAA,YAAA,YAAe,SAAS,CAC3B,OAAOA,iCAAAA,aAAa,KAAK,KAAK,CAC9B,OAAOA,iCAAAA,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI;AAClB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,SAAS,GAAG,aAChBA,iCAAAA,aAAa,MACb,KAAK,UAAUA,iCAAAA,aAAa,WAAW,IAAI,CAAC,KAAK,CAClD;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,OAAA,GAAA,0BAAA,OAAY,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,MAAA,GAAA,2BAAA,UAAc,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrBC,iCAAAA,qBAAqB,MACrB,KAAK,UAAUA,iCAAAA,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAcA,iCAAAA,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK;AACrB,QAAO;;AAGT,SAAS,cAAc,MAA2C;CAChE,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,UAAU,KAAK;CAErB,SAAS,WAAW,KAAgC;EAClD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACDH,iCAAAA,gBAAgB,MAChB,KAAK,UACHA,iCAAAA,gBAAgB,WAAW,KAAK,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW,CAAC,CAC9E,KACJ,CACF;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAoC;EAC3D,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAASC,iCAAAA,qBAAqB,WAClC,IACA,cAAc,GAAG,MAAM,SAAS,GAAG,WAAW,CAC/C;KACD,MAAM,MAAM,GAAG,aAAaA,iCAAAA,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAKA,iCAAAA,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA6B;EAEpD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGC,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAK7E,MAAM,KAAA,GAAA,YAAA,YAAe,SAAS,CAC3B,OAAOA,iCAAAA,aAAa,KAAK,KAAK,CAC9B,OAAOA,iCAAAA,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW;AACzB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,aAAa,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW;IACnE,MAAM,SAAS,GAAG,aAChBA,iCAAAA,aAAa,MACb,KAAK,UAAUA,iCAAAA,aAAa,WAAW,KAAK,WAAW,CAAC,KAAK,CAC9D;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,OAAA,GAAA,0BAAA,OAAY,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,MAAA,GAAA,2BAAA,UAAc,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrBC,iCAAAA,qBAAqB,MACrB,KAAK,UAAUA,iCAAAA,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAcA,iCAAAA,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK,SAAS;AAC9B,QAAO;;;AAIT,SAAgB,oBAAoB,MAA0D;AAC5F,KAAI,KAAK,SAAS,uBAChB,QAAO,cAAc,KAAK;KAE1B,QAAO,cAAc,KAAK;;;AAO9B,MAAM,8BAAc,IAAI,SAA+B;;AAGvD,SAAgB,0BAA0B,IAAoB;AAC5D,aAAY,OAAO,GAAG;;;AAIxB,eAAsB,yBAAyB,IAAmC;CAEhF,MAAM,SAAS,YAAY,IAAI,GAAG;AAClC,KAAI,WAAW,KAAA,EAAW,QAAO;CAGjC,MAAM,WAAW,MAAM,GAAG,WAAW,uBAAuB,OAAO,OAAO;EACxE,MAAM,KAAK,MAAM,GAAG,kBAAA,GAAA,0BAAA,OAAuB,GAAG,YAAY,uBAAuB,CAAC;AAClF,SAAO,MAAA,GAAA,0BAAA,yBAA6B,GAAG,MAAM,GAAG,KAAA;GAChD;AACF,KAAI,UAAU;AACZ,cAAY,IAAI,IAAI,SAAS;AAC7B,SAAO;;CAGT,MAAM,SAAS,MAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EAEtE,MAAM,KAAK,MAAM,GAAG,kBAAA,GAAA,0BAAA,OAAuB,GAAG,YAAY,uBAAuB,CAAC;AAClF,MAAI,GAAI,SAAA,GAAA,0BAAA,yBAA+B,GAAG,MAAM;EAEhD,MAAM,QAAQ,GAAG,aAAa,kBAAkB;AAChD,KAAG,aAAA,GAAA,0BAAA,OAAkB,GAAG,YAAY,uBAAuB,EAAE,WAAW,MAAM;AAC9E,KAAG,KAAK,MAAM;AACd,QAAM,GAAG,QAAQ;AACjB,SAAO,MAAM,MAAM;GACnB;AACF,aAAY,IAAI,IAAI,OAAO;AAC3B,QAAO;;;AAIT,eAAsB,kBAAkB,IAA6B;AACnE,OAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EACvD,MAAM,cAAA,GAAA,0BAAA,OAAmB,GAAG,YAAY,uBAAuB;AAE/D,MADW,MAAM,GAAG,iBAAiB,WAAW,EACxC;AACN,MAAG,YAAY,WAAW;AAC1B,SAAM,GAAG,QAAQ;;GAEnB;AACF,2BAA0B,GAAG;;;;;;;;;;AAa/B,eAAsB,MACpB,IACA,UACA,aAAqB,gBACH;AAClB,QAAO,MAAM,GAAG,YAAY,oBAAoB,OAAO,OAAO;EAC5D,MAAM,MAAM,MAAM,GAAG,oBAAoB,SAAS;EAClD,MAAM,UAAiD,EAAE;AACzD,OAAK,MAAM,EAAE,KAAK,WAAW,KAAK;AAChC,OAAI,CAAC,IAAI,WAAA,UAA6B,CAAE;AACxC,WAAQ,KAAK;IACX,MAAM,IAAI,MAAM,EAAyB;IACzC,WAAW,SAAS,OAAO,GAAG;IAC/B,CAAC;;AAIJ,KAAG,UAAU,UAAU,kBAAkB,IAAI;AAE7C,MAAI,QAAQ,UAAU,YAAY;AAChC,SAAM,GAAG,QAAQ;AACjB,UAAO;;AAIT,UAAQ,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,UAAU;EACjD,MAAM,UAAU,QAAQ,SAAS;AACjC,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,MAAG,aAAA,GAAA,0BAAA,OAAkB,UAAU,QAAQ,GAAG,KAAK,CAAC;AAChD,MAAG,aAAa,UAAU,oBAAoB,QAAQ,GAAG,KAAK;;AAGhE,QAAM,GAAG,QAAQ;AACjB,SAAO;GACP;;;AAMJ,SAAS,iBACP,IACA,UACA,OACA,aACA,SACA,KACM;AACN,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,4BAAY,IAAI,KAA6B;AACnD,OAAK,MAAM,MAAM,KAAK,aAAa;GACjC,MAAM,WAAW,YAAY,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG;AACvD,OAAI,aAAa,KAAA,EACf,OAAM,IAAI,MAAM,cAAc,GAAG,eAAe;AAElD,aAAU,IAAI,IAAI,SAAS;;EAE7B,MAAM,MAAM,KAAK,OAAO,IAAI,UAAU;AACtC,UAAQ,IAAI,KAAK,MAAM,IAAI;AAC3B,KAAG,aAAA,GAAA,0BAAA,OAAkB,UAAU,KAAK,KAAK,EAAE,WAAW,IAAI;AAC1D,KAAG,UAAU,UAAU,oBAAoB,KAAK,MAAM,IAAI;;;;;;;;;;;;;;;;AAiB9D,eAAe,YACb,IACA,UACA,UACA,OACA,MACsD;CACtD,MAAM,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK;CAC1C,MAAM,8BAAc,IAAI,KAAyB;CAGjD,MAAM,SAAS,MAAM,GAAG,YAAY,6BAA6B,OAAO,OAAO;EAE7E,MAAM,CAAC,QAAQ,YAAY,MAAM,QAAQ,IAAI,CAC3C,QAAQ,IAAI,UAAU,KAAK,MAAM,GAAG,aAAA,GAAA,0BAAA,OAAkB,UAAU,EAAE,CAAC,CAAC,CAAC,EACrE,GAAG,wBAAwB,UAAU,iBAAiB,CACvD,CAAC;EAGF,MAAM,YADY,WAAW,SAAS,UAAU,GAAG,GAAG,KACzB;EAC7B,MAAM,MAAM,KAAK,KAAK,CAAC,UAAU;AAIjC,MAAI,OAHY,UAAU,SAAS,IAGd;GAEnB,MAAM,WAAA,GAAA,0BAAA,0BADS,MAAM,GAAG,UAAA,GAAA,0BAAA,OAAe,UAAU,SAAS,CAAC,EACZ,MAAM;AACrD,MAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI;AACzD,MAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAC7D,SAAM,GAAG,QAAQ;AACjB,QAAK,YAAY;AACjB,QAAK,YAAY,KAAK;AACtB,QAAK,aAAa;AAClB,UAAO;IAAE,MAAM;IAAe,QAAQ;IAAS,aAAa;IAAU;;EAIxE,MAAM,aAAuB,EAAE;AAC/B,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,IACpC,KAAI,OAAO,GAAI,YAAW,KAAK,EAAE;AAGnC,MAAI,WAAW,SAAS,GAAG;GACzB,MAAM,YAAY,MAAM,QAAQ,IAC9B,WAAW,KAAK,MAAM,GAAG,UAAA,GAAA,0BAAA,OAAe,UAAU,UAAU,GAAG,CAAC,CAAC,CAClE;AACD,QAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IACrC,aAAY,IAAI,UAAU,WAAW,MAAA,GAAA,0BAAA,yBAA6B,UAAU,GAAG,MAAM,CAAC;;AAG1F,OAAK,YAAY,WAAW;EAG5B,MAAM,UAAU,MAAM,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE,KAAK,CAAC;AAC7D,OAAK,cAAc,QAAQ;EAG3B,MAAM,aAAa,QAAQ,MAAM,GAAG,WAAW;EAC/C,MAAM,0BAAU,IAAI,KAA0B;AAC9C,mBAAiB,IAAI,UAAU,YAAY,aAAa,SAAS,IAAI;AAGrE,OAAK,MAAM,KAAK,WACd,IAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI,IAAI;AAE/D,KAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAE7D,QAAM,GAAG,QAAQ;AAGjB,OAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,OAAA,GAAA,0BAAA,oBAAyB,IAAI,CAAC;AAGtD,SAAO;GACL,MAAM;GACN,WAAW,QAAQ,MAAM,WAAW;GACpC,aAAa;GACd;GACD;AAEF,KAAI,OAAO,KACT,QAAO;EAAE,QAAQ,OAAO;EAAQ,aAAa,OAAO;EAAa;AAGnE,MAAK,aAAa;CAGlB,MAAM,EAAE,cAAc;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY;EACrD,MAAM,QAAQ,UAAU,MAAM,GAAG,IAAI,WAAW;AAChD,OAAK;AAEL,QAAM,GAAG,YAAY,wBAAwB,OAAO,OAAO;GACzD,MAAM,0BAAU,IAAI,KAA0B;AAE9C,oBAAiB,IAAI,UAAU,OAAO,aAAa,SADvC,KAAK,KAAK,CAAC,UAAU,CAC+B;AAChE,SAAM,GAAG,QAAQ;AAEjB,QAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,OAAA,GAAA,0BAAA,oBAAyB,IAAI,CAAC;IAEtD;;CAGJ,MAAM,SAAS,YAAY,IAAI,SAAS;AACxC,KAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gDAAgD;AAC7E,QAAO;EAAE;EAAQ,aAAa,OAAO;EAAa;;;;;;;;AASpD,eAAsB,mBACpB,IACA,MACA,SACqB;CACrB,MAAM,OAAO,aAAa;CAC1B,MAAM,KAAK,YAAY,KAAK;AAE5B,KAAI;EAEF,IAAI;AACJ,UAAQ,KAAK,MAAb;GACE,KAAK;AACH,eAAA,GAAA,iCAAA,eAAwB,KAAK,QAAQ;AACrC;GACF,KAAK;AACH,cAAU,KAAK;AACf;GACF,KAAK,SACH,QAAO,KAAK;GACd,KAAK,gBACH,OAAM,IAAI,MACR,oFACD;GACH,QAEE,OAAM,IAAI,MAAM,yBADC,KACmC,OAAO;;AAI/D,OAAK,iBAAiB,QAAQ;EAG9B,MAAM,WAAW,YAAY,KAAK;EAClC,MAAM,QAAQ,oBAAoB,QAAQ;AAC1C,OAAK,YAAY,YAAY,KAAK,GAAG;AACrC,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,kCAAkC;AAE1E,OAAK,aAAa,MAAM;EACxB,MAAM,WAAW,MAAM,MAAM,SAAS,GAAG;EAGzC,MAAM,aAAa,YAAY,KAAK;EACpC,MAAM,WAAW,SAAS,mBAAoB,MAAM,yBAAyB,GAAG;AAChF,OAAK,cAAc,YAAY,KAAK,GAAG;EAIvC,MAAM,cAAc;AACpB,OAAK,IAAI,UAAU,GAAG,UAAU,aAAa,UAC3C,KAAI;GACF,MAAM,OAAO,YAAY,KAAK;GAC9B,MAAM,SAAS,MAAM,YAAY,IAAI,UAAU,UAAU,OAAO,KAAK;AACrE,QAAK,gBAAgB,YAAY,KAAK,GAAG;AACzC,QAAK,UAAU;AAGf,OAAI,OAAO,eAAA,IAAoC;AAC7C,UAAM,MAAM,IAAI,SAAS;AACzB,SAAK,cAAc;;AAGrB,UAAO,OAAO;WACP,GAAG;AACV,OAAI,YAAY,cAAc,EAAG,OAAM;AAEvC,QAAK,YAAY;AACjB,QAAK,cAAc;;AAIvB,QAAM,IAAI,MAAM,mBAAmB;WAC3B;AACR,OAAK,UAAU,YAAY,KAAK,GAAG;AACnC,MAAIC,cAAAA,eAAe,CAAC,qBAClB,SAAQ,IAAI,mBAAmB,KAAK,UAAU,KAAK,GAAG;;;;;;;;AAY5D,eAAsB,uBACpB,IACA,MACA,SACgC;AAChC,KAAI,KAAK,SAAS,SAAS,SAAU,QAAO;CAE5C,MAAM,aAAa,MAAM,mBAAmB,IAAI,KAAK,UAAU,QAAQ;AACvE,QAAO;EACL,GAAG;EACH,UAAU;GAAE,MAAM;GAAU;GAAY;EACzC"}
+{"version":3,"file":"template_cache.cjs","names":["PlTemplateLibV1","PlTemplateSoftwareV1","PlTemplateV1","PlTemplateOverrideV1","getDebugFlags"],"sources":["../../../src/mutator/template/template_cache.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport type {\n  AnyResourceRef,\n  PlClient,\n  PlTransaction,\n  SignedResourceId,\n  ResourceRef,\n} from \"@milaboratories/pl-client\";\nimport {\n  ensureSignedResourceIdNotNull,\n  field,\n  resourceType,\n  toGlobalResourceId,\n} from \"@milaboratories/pl-client\";\nimport {\n  parseTemplate,\n  PlTemplateLibV1,\n  PlTemplateOverrideV1,\n  PlTemplateSoftwareV1,\n  PlTemplateV1,\n} from \"@milaboratories/pl-model-backend\";\nimport type {\n  CompiledTemplateV3,\n  TemplateData,\n  TemplateDataV3,\n  TemplateLibData,\n  TemplateLibDataV3,\n  TemplateSoftwareData,\n  TemplateSoftwareDataV3,\n} from \"@milaboratories/pl-model-backend\";\nimport { notEmpty } from \"@milaboratories/ts-helpers\";\nimport type { BlockPackSpecPrepared } from \"../../model\";\nimport type { TemplateSpecPrepared } from \"../../model/template_spec\";\nimport { getDebugFlags } from \"../../debug\";\n\nexport const TemplateCacheType = resourceType(\"TemplateCache\", \"1\");\n\nexport const TemplateCacheFieldName = \"__templateCache\";\nconst BATCH_SIZE = 50;\n/** @internal exported for testing */\nexport const GC_ACCESS_THRESHOLD = 30;\n/** @internal exported for testing */\nexport const GC_MAX_ENTRIES = 3000;\n/** @internal exported for testing */\nexport const ACCESS_COUNT_KEY = \"_accessCount\";\n/** @internal exported for testing */\nexport const ACCESS_KEY_PREFIX = \"access_\";\n\n// ─── Stats ───────────────────────────────────────────────────────────────────\n\nexport type TemplateCacheStat = {\n  totalMs: number;\n  flattenMs: number;\n  cacheInitMs: number;\n  materializeMs: number;\n  totalNodes: number;\n  cacheHits: number;\n  cacheMisses: number;\n  batchCount: number;\n  happyPath: boolean;\n  gcTriggered: boolean;\n  retries: number;\n  templateFormat: string;\n};\n\nfunction initialStat(): TemplateCacheStat {\n  return {\n    totalMs: 0,\n    flattenMs: 0,\n    cacheInitMs: 0,\n    materializeMs: 0,\n    totalNodes: 0,\n    cacheHits: 0,\n    cacheMisses: 0,\n    batchCount: 0,\n    happyPath: false,\n    gcTriggered: false,\n    retries: 0,\n    templateFormat: \"\",\n  };\n}\n\n// ─── Tree node abstraction ───────────────────────────────────────────────────\n\ninterface CacheableNode {\n  /** SHA-256 content hash (includes all descendant content) */\n  hash: string;\n  /** Creates this node's resource in a transaction.\n   *  childRefs maps child hash → already-resolved ResourceRef or SignedResourceId */\n  create: (tx: PlTransaction, childRefs: ReadonlyMap<string, AnyResourceRef>) => ResourceRef;\n  /** Hashes of direct child nodes this node depends on */\n  childHashes: string[];\n}\n\n// ─── Hash computation helpers ────────────────────────────────────────────────\n\nfunction getSourceCode(name: string, sources: Record<string, string>, sourceHash: string): string {\n  return notEmpty(\n    sources[sourceHash],\n    `trying to get \"${name}\" source: sources map doesn't contain source hash ${sourceHash}`,\n  );\n}\n\n/**\n * Bottom-up hash composition: each node hashes its OWN content + child hash STRINGS.\n * This means each unique node is hashed exactly once → O(n) instead of O(n * depth).\n */\n\n// V2 leaf hashes (libs, software — no children)\n\nfunction hashLibV2(lib: TemplateLibData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.src)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV2(sw: TemplateSoftwareData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.src)\n    .digest(\"hex\");\n}\n\n// V3 leaf hashes — use sourceHash directly instead of resolving source content\n\nfunction hashLibV3(lib: TemplateLibDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.sourceHash)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV3(sw: TemplateSoftwareDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.sourceHash)\n    .digest(\"hex\");\n}\n\n// ─── Tree flattening ─────────────────────────────────────────────────────────\n\nfunction flattenV2Tree(data: TemplateData): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n\n  function processLib(lib: TemplateLibData): string {\n    const hash = hashLibV2(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(PlTemplateLibV1.fromV2Data(lib).data),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareData): string {\n    const hash = hashSoftwareV2(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV2Data(sw);\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateData): string {\n    // Process children first (bottom-up) — their hashes are computed before ours\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content)\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.src);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV2Data(tpl).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV2Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data);\n  return nodes;\n}\n\nfunction flattenV3Tree(data: CompiledTemplateV3): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n  const sources = data.hashToSource;\n\n  function processLib(lib: TemplateLibDataV3): string {\n    const hash = hashLibV3(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(\n              PlTemplateLibV1.fromV3Data(lib, getSourceCode(lib.name, sources, lib.sourceHash))\n                .data,\n            ),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareDataV3): string {\n    const hash = hashSoftwareV3(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV3Data(\n            sw,\n            getSourceCode(sw.name, sources, sw.sourceHash),\n          );\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateDataV3): string {\n    // Process children first (bottom-up)\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content).\n    // Uses sourceHash directly — it already uniquely identifies the source.\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.sourceHash);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const sourceCode = getSourceCode(tpl.name, sources, tpl.sourceHash);\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV3Data(tpl, sourceCode).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV3Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data.template);\n  return nodes;\n}\n\n/** Flatten template tree into a topologically ordered list of cacheable nodes (leaves first). */\nexport function flattenTemplateTree(data: TemplateData | CompiledTemplateV3): CacheableNode[] {\n  if (data.type === \"pl.tengo-template.v2\") {\n    return flattenV2Tree(data);\n  } else {\n    return flattenV3Tree(data);\n  }\n}\n\n// ─── Cache operations ────────────────────────────────────────────────────────\n\n/** In-memory cache for the TemplateCache SignedResourceId per PlClient instance. */\nconst cacheRidMap = new WeakMap<PlClient, SignedResourceId>();\n\n/** Clear the in-memory cacheRid entry (call on errors referencing the cache resource). */\nexport function invalidateTemplateCacheId(pl: PlClient): void {\n  cacheRidMap.delete(pl);\n}\n\n/** Find or create the TemplateCache/1 resource on user root. */\nexport async function getOrCreateTemplateCache(pl: PlClient): Promise<SignedResourceId> {\n  // Check in-memory cache first (0ms after first call)\n  const cached = cacheRidMap.get(pl);\n  if (cached !== undefined) return cached;\n\n  // Try read-only check\n  const existing = await pl.withReadTx(\"templateCache:check\", async (tx) => {\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    return fd ? ensureSignedResourceIdNotNull(fd.value) : undefined;\n  });\n  if (existing) {\n    cacheRidMap.set(pl, existing);\n    return existing;\n  }\n\n  const result = await pl.withWriteTx(\"templateCache:init\", async (tx) => {\n    // Double-check inside write tx (another instance may have created it)\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    if (fd) return ensureSignedResourceIdNotNull(fd.value);\n\n    const cache = tx.createStruct(TemplateCacheType);\n    tx.createField(field(pl.clientRoot, TemplateCacheFieldName), \"Dynamic\", cache);\n    tx.lock(cache);\n    await tx.commit();\n    return await cache.globalId;\n  });\n  cacheRidMap.set(pl, result);\n  return result;\n}\n\n/** Remove the template cache from user root. */\nexport async function dropTemplateCache(pl: PlClient): Promise<void> {\n  await pl.withWriteTx(\"templateCache:drop\", async (tx) => {\n    const cacheField = field(pl.clientRoot, TemplateCacheFieldName);\n    const fd = await tx.getFieldIfExists(cacheField);\n    if (fd) {\n      tx.removeField(cacheField);\n      await tx.commit();\n    }\n  });\n  invalidateTemplateCacheId(pl);\n}\n\n// ─── GC ──────────────────────────────────────────────────────────────────────\n\n/**\n * Run count-based garbage collection on the template cache.\n * Evicts least-recently-used entries when the cache exceeds maxEntries.\n * Always resets the access counter to 0.\n *\n * @internal exported for testing (maxEntries parameter allows low thresholds in tests)\n * @returns true if entries were evicted\n */\nexport async function runGc(\n  pl: PlClient,\n  cacheRid: SignedResourceId,\n  maxEntries: number = GC_MAX_ENTRIES,\n): Promise<boolean> {\n  return await pl.withWriteTx(\"templateCache:gc\", async (tx) => {\n    const kvs = await tx.listKeyValuesString(cacheRid);\n    const entries: { hash: string; timestamp: number }[] = [];\n    for (const { key, value } of kvs) {\n      if (!key.startsWith(ACCESS_KEY_PREFIX)) continue;\n      entries.push({\n        hash: key.slice(ACCESS_KEY_PREFIX.length),\n        timestamp: parseInt(value, 10),\n      });\n    }\n\n    // Always reset counter\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, \"0\");\n\n    if (entries.length <= maxEntries) {\n      await tx.commit();\n      return false;\n    }\n\n    // Sort oldest first, evict until under limit\n    entries.sort((a, b) => a.timestamp - b.timestamp);\n    const toEvict = entries.length - maxEntries;\n    for (let i = 0; i < toEvict; i++) {\n      tx.removeField(field(cacheRid, entries[i].hash));\n      tx.deleteKValue(cacheRid, ACCESS_KEY_PREFIX + entries[i].hash);\n    }\n\n    await tx.commit();\n    return true;\n  });\n}\n\n// ─── Batched materialization ─────────────────────────────────────────────────\n\n/** Create a batch of cache nodes in the current transaction. */\nfunction createBatchNodes(\n  tx: PlTransaction,\n  cacheRid: SignedResourceId,\n  batch: CacheableNode[],\n  resolvedIds: ReadonlyMap<string, SignedResourceId>,\n  newRefs: Map<string, ResourceRef>,\n  now: string,\n): void {\n  for (const node of batch) {\n    const childRefs = new Map<string, AnyResourceRef>();\n    for (const ch of node.childHashes) {\n      const resolved = resolvedIds.get(ch) ?? newRefs.get(ch);\n      if (resolved === undefined) {\n        throw new Error(`BUG: child ${ch} not resolved`);\n      }\n      childRefs.set(ch, resolved);\n    }\n    const ref = node.create(tx, childRefs);\n    newRefs.set(node.hash, ref);\n    tx.createField(field(cacheRid, node.hash), \"Dynamic\", ref);\n    tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + node.hash, now);\n  }\n}\n\n/**\n * Materialize a template tree via the cache using \"probe all + batched creation\".\n *\n * Phase 1 (single write tx):\n *   - Check existence of ALL hashes in one roundtrip\n *   - Happy path: if root cached, update access tracking and return\n *   - Otherwise: fetch ResourceIds for all cache hits, create first batch of missing nodes\n *\n * Phase 2..N (one write tx per batch):\n *   - Create remaining missing nodes in BATCH_SIZE chunks\n *\n * @returns root SignedResourceId and current access count (for GC decision)\n */\nasync function materialize(\n  pl: PlClient,\n  cacheRid: SignedResourceId,\n  rootHash: string,\n  nodes: CacheableNode[],\n  stat: TemplateCacheStat,\n): Promise<{ rootId: SignedResourceId; accessCount: number }> {\n  const allHashes = nodes.map((n) => n.hash);\n  const resolvedIds = new Map<string, SignedResourceId>();\n\n  // Phase 1: probe all + first batch\n  const phase1 = await pl.withWriteTx(\"templateCache:materialize\", async (tx) => {\n    // 1 roundtrip: check all hashes + read access count\n    const [exists, countStr] = await Promise.all([\n      Promise.all(allHashes.map((h) => tx.fieldExists(field(cacheRid, h)))),\n      tx.getKValueStringIfExists(cacheRid, ACCESS_COUNT_KEY),\n    ]);\n\n    const prevCount = countStr ? parseInt(countStr, 10) : 0;\n    const newCount = prevCount + 1;\n    const now = Date.now().toString();\n    const rootIdx = allHashes.length - 1;\n\n    // Happy path: root already cached\n    if (exists[rootIdx]) {\n      const rootFd = await tx.getField(field(cacheRid, rootHash));\n      const rootRid = ensureSignedResourceIdNotNull(rootFd.value);\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + rootHash, now);\n      tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n      await tx.commit();\n      stat.happyPath = true;\n      stat.cacheHits = stat.totalNodes;\n      stat.batchCount = 1;\n      return { done: true as const, rootId: rootRid, accessCount: newCount };\n    }\n\n    // Fetch ResourceIds for all cache hits (1 roundtrip)\n    const hitIndices: number[] = [];\n    for (let i = 0; i < allHashes.length; i++) {\n      if (exists[i]) hitIndices.push(i);\n    }\n\n    if (hitIndices.length > 0) {\n      const hitFields = await Promise.all(\n        hitIndices.map((i) => tx.getField(field(cacheRid, allHashes[i]))),\n      );\n      for (let j = 0; j < hitIndices.length; j++) {\n        resolvedIds.set(\n          allHashes[hitIndices[j]],\n          ensureSignedResourceIdNotNull(hitFields[j].value),\n        );\n      }\n    }\n    stat.cacheHits = hitIndices.length;\n\n    // Missing nodes (topo order preserved from flatten)\n    const missing = nodes.filter((n) => !resolvedIds.has(n.hash));\n    stat.cacheMisses = missing.length;\n\n    // Create first batch of missing nodes\n    const firstBatch = missing.slice(0, BATCH_SIZE);\n    const newRefs = new Map<string, ResourceRef>();\n    createBatchNodes(tx, cacheRid, firstBatch, resolvedIds, newRefs, now);\n\n    // Update access tracking for cache hits\n    for (const i of hitIndices) {\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + allHashes[i], now);\n    }\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n\n    await tx.commit();\n\n    // Resolve new refs to global IDs (after commit)\n    for (const [hash, ref] of newRefs) {\n      resolvedIds.set(hash, await toGlobalResourceId(ref));\n    }\n\n    return {\n      done: false as const,\n      remaining: missing.slice(BATCH_SIZE),\n      accessCount: newCount,\n    };\n  });\n\n  if (phase1.done) {\n    return { rootId: phase1.rootId, accessCount: phase1.accessCount };\n  }\n\n  stat.batchCount = 1;\n\n  // Phase 2+: remaining batches\n  const { remaining } = phase1;\n  for (let i = 0; i < remaining.length; i += BATCH_SIZE) {\n    const batch = remaining.slice(i, i + BATCH_SIZE);\n    stat.batchCount++;\n\n    await pl.withWriteTx(\"templateCache:create\", async (tx) => {\n      const newRefs = new Map<string, ResourceRef>();\n      const now = Date.now().toString();\n      createBatchNodes(tx, cacheRid, batch, resolvedIds, newRefs, now);\n      await tx.commit();\n\n      for (const [hash, ref] of newRefs) {\n        resolvedIds.set(hash, await toGlobalResourceId(ref));\n      }\n    });\n  }\n\n  const rootId = resolvedIds.get(rootHash);\n  if (!rootId) throw new Error(\"BUG: root hash not resolved after all batches\");\n  return { rootId, accessCount: phase1.accessCount };\n}\n\n/**\n * Materialize a template tree via the cache.\n * Manages its own transactions internally — do NOT call inside an existing tx.\n *\n * @returns concrete SignedResourceId of the root template\n */\nexport async function loadTemplateCached(\n  pl: PlClient,\n  spec: TemplateSpecPrepared,\n  options?: { cacheResourceId?: SignedResourceId },\n): Promise<SignedResourceId> {\n  const stat = initialStat();\n  const t0 = performance.now();\n\n  try {\n    // Parse to data if needed\n    let tplData: TemplateData | CompiledTemplateV3;\n    switch (spec.type) {\n      case \"explicit\":\n        tplData = parseTemplate(spec.content);\n        break;\n      case \"prepared\":\n        tplData = spec.data;\n        break;\n      case \"cached\":\n        return spec.resourceId;\n      case \"from-registry\":\n        throw new Error(\n          \"loadTemplateCached does not support from-registry specs; use loadTemplate instead\",\n        );\n      default: {\n        const _: never = spec;\n        throw new Error(`unexpected spec type: ${(_ as any).type}`);\n      }\n    }\n\n    stat.templateFormat = tplData.type;\n\n    // Flatten to ordered nodes\n    const tFlatten = performance.now();\n    const nodes = flattenTemplateTree(tplData);\n    stat.flattenMs = performance.now() - tFlatten;\n    if (nodes.length === 0) throw new Error(\"template tree produced no nodes\");\n\n    stat.totalNodes = nodes.length;\n    const rootHash = nodes[nodes.length - 1].hash;\n\n    // Resolve or create cache resource\n    const tCacheInit = performance.now();\n    const cacheRid = options?.cacheResourceId ?? (await getOrCreateTemplateCache(pl));\n    stat.cacheInitMs = performance.now() - tCacheInit;\n\n    // Retry loop: if a write tx fails (e.g. concurrent GC invalidated a cached resource),\n    // restart materialization from scratch.\n    const MAX_RETRIES = 3;\n    for (let attempt = 0; attempt < MAX_RETRIES; attempt++) {\n      try {\n        const tMat = performance.now();\n        const result = await materialize(pl, cacheRid, rootHash, nodes, stat);\n        stat.materializeMs = performance.now() - tMat;\n        stat.retries = attempt;\n\n        // GC in separate tx if access count exceeded threshold\n        if (result.accessCount >= GC_ACCESS_THRESHOLD) {\n          await runGc(pl, cacheRid);\n          stat.gcTriggered = true;\n        }\n\n        return result.rootId;\n      } catch (e) {\n        if (attempt === MAX_RETRIES - 1) throw e;\n        // Retry from scratch — previous batch results may reference GC'd resources\n        stat.cacheHits = 0;\n        stat.cacheMisses = 0;\n      }\n    }\n\n    throw new Error(\"BUG: unreachable\");\n  } finally {\n    stat.totalMs = performance.now() - t0;\n    if (getDebugFlags().logTemplateCacheStat) {\n      console.log(`[templateCache] ${JSON.stringify(stat)}`);\n    }\n  }\n}\n\n// ─── Caller helper ───────────────────────────────────────────────────────────\n\n/**\n * Pre-materialize a block pack's template via cache.\n * Returns a copy of the spec with the template replaced by a cached reference.\n * If the template is already cached, returns the spec unchanged.\n */\nexport async function cacheBlockPackTemplate(\n  pl: PlClient,\n  spec: BlockPackSpecPrepared,\n  options?: { cacheResourceId?: SignedResourceId },\n): Promise<BlockPackSpecPrepared> {\n  if (spec.template.type === \"cached\") return spec;\n\n  const resourceId = await loadTemplateCached(pl, spec.template, options);\n  return {\n    ...spec,\n    template: { type: \"cached\", resourceId },\n  };\n}\n"],"mappings":";;;;;;;AAmCA,MAAa,qBAAA,GAAA,0BAAA,cAAiC,iBAAiB,IAAI;AAEnE,MAAa,yBAAyB;AACtC,MAAM,aAAa;;AAEnB,MAAa,sBAAsB;;AAEnC,MAAa,iBAAiB;;AAE9B,MAAa,mBAAmB;;AAEhC,MAAa,oBAAoB;AAmBjC,SAAS,cAAiC;AACxC,QAAO;EACL,SAAS;EACT,WAAW;EACX,aAAa;EACb,eAAe;EACf,YAAY;EACZ,WAAW;EACX,aAAa;EACb,YAAY;EACZ,WAAW;EACX,aAAa;EACb,SAAS;EACT,gBAAgB;EACjB;;AAiBH,SAAS,cAAc,MAAc,SAAiC,YAA4B;AAChG,SAAA,GAAA,2BAAA,UACE,QAAQ,aACR,kBAAkB,KAAK,oDAAoD,aAC5E;;;;;;AAUH,SAAS,UAAU,KAA8B;AAC/C,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOA,iCAAAA,gBAAgB,KAAK,KAAK,CACjC,OAAOA,iCAAAA,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI,CACf,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAkC;AACxD,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOC,iCAAAA,qBAAqB,KAAK,KAAK,CACtC,OAAOA,iCAAAA,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,IAAI,CACd,OAAO,MAAM;;AAKlB,SAAS,UAAU,KAAgC;AACjD,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOD,iCAAAA,gBAAgB,KAAK,KAAK,CACjC,OAAOA,iCAAAA,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW,CACtB,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAoC;AAC1D,SAAA,GAAA,YAAA,YAAkB,SAAS,CACxB,OAAOC,iCAAAA,qBAAqB,KAAK,KAAK,CACtC,OAAOA,iCAAAA,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,WAAW,CACrB,OAAO,MAAM;;AAKlB,SAAS,cAAc,MAAqC;CAC1D,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAE9B,SAAS,WAAW,KAA8B;EAChD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACDD,iCAAAA,gBAAgB,MAChB,KAAK,UAAUA,iCAAAA,gBAAgB,WAAW,IAAI,CAAC,KAAK,CACrD;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAkC;EACzD,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAASC,iCAAAA,qBAAqB,WAAW,GAAG;KAClD,MAAM,MAAM,GAAG,aAAaA,iCAAAA,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAKA,iCAAAA,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA2B;EAElD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGC,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAI7E,MAAM,KAAA,GAAA,YAAA,YAAe,SAAS,CAC3B,OAAOA,iCAAAA,aAAa,KAAK,KAAK,CAC9B,OAAOA,iCAAAA,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI;AAClB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,SAAS,GAAG,aAChBA,iCAAAA,aAAa,MACb,KAAK,UAAUA,iCAAAA,aAAa,WAAW,IAAI,CAAC,KAAK,CAClD;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,OAAA,GAAA,0BAAA,OAAY,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,MAAA,GAAA,2BAAA,UAAc,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrBC,iCAAAA,qBAAqB,MACrB,KAAK,UAAUA,iCAAAA,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAcA,iCAAAA,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK;AACrB,QAAO;;AAGT,SAAS,cAAc,MAA2C;CAChE,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,UAAU,KAAK;CAErB,SAAS,WAAW,KAAgC;EAClD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACDH,iCAAAA,gBAAgB,MAChB,KAAK,UACHA,iCAAAA,gBAAgB,WAAW,KAAK,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW,CAAC,CAC9E,KACJ,CACF;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAoC;EAC3D,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAASC,iCAAAA,qBAAqB,WAClC,IACA,cAAc,GAAG,MAAM,SAAS,GAAG,WAAW,CAC/C;KACD,MAAM,MAAM,GAAG,aAAaA,iCAAAA,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAKA,iCAAAA,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA6B;EAEpD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGC,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAGA,iCAAAA,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAK7E,MAAM,KAAA,GAAA,YAAA,YAAe,SAAS,CAC3B,OAAOA,iCAAAA,aAAa,KAAK,KAAK,CAC9B,OAAOA,iCAAAA,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW;AACzB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,aAAa,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW;IACnE,MAAM,SAAS,GAAG,aAChBA,iCAAAA,aAAa,MACb,KAAK,UAAUA,iCAAAA,aAAa,WAAW,KAAK,WAAW,CAAC,KAAK,CAC9D;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,OAAA,GAAA,0BAAA,OAAY,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,MAAA,GAAA,2BAAA,UAAc,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrBC,iCAAAA,qBAAqB,MACrB,KAAK,UAAUA,iCAAAA,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAcA,iCAAAA,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK,SAAS;AAC9B,QAAO;;;AAIT,SAAgB,oBAAoB,MAA0D;AAC5F,KAAI,KAAK,SAAS,uBAChB,QAAO,cAAc,KAAK;KAE1B,QAAO,cAAc,KAAK;;;AAO9B,MAAM,8BAAc,IAAI,SAAqC;;AAG7D,SAAgB,0BAA0B,IAAoB;AAC5D,aAAY,OAAO,GAAG;;;AAIxB,eAAsB,yBAAyB,IAAyC;CAEtF,MAAM,SAAS,YAAY,IAAI,GAAG;AAClC,KAAI,WAAW,KAAA,EAAW,QAAO;CAGjC,MAAM,WAAW,MAAM,GAAG,WAAW,uBAAuB,OAAO,OAAO;EACxE,MAAM,KAAK,MAAM,GAAG,kBAAA,GAAA,0BAAA,OAAuB,GAAG,YAAY,uBAAuB,CAAC;AAClF,SAAO,MAAA,GAAA,0BAAA,+BAAmC,GAAG,MAAM,GAAG,KAAA;GACtD;AACF,KAAI,UAAU;AACZ,cAAY,IAAI,IAAI,SAAS;AAC7B,SAAO;;CAGT,MAAM,SAAS,MAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EAEtE,MAAM,KAAK,MAAM,GAAG,kBAAA,GAAA,0BAAA,OAAuB,GAAG,YAAY,uBAAuB,CAAC;AAClF,MAAI,GAAI,SAAA,GAAA,0BAAA,+BAAqC,GAAG,MAAM;EAEtD,MAAM,QAAQ,GAAG,aAAa,kBAAkB;AAChD,KAAG,aAAA,GAAA,0BAAA,OAAkB,GAAG,YAAY,uBAAuB,EAAE,WAAW,MAAM;AAC9E,KAAG,KAAK,MAAM;AACd,QAAM,GAAG,QAAQ;AACjB,SAAO,MAAM,MAAM;GACnB;AACF,aAAY,IAAI,IAAI,OAAO;AAC3B,QAAO;;;AAIT,eAAsB,kBAAkB,IAA6B;AACnE,OAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EACvD,MAAM,cAAA,GAAA,0BAAA,OAAmB,GAAG,YAAY,uBAAuB;AAE/D,MADW,MAAM,GAAG,iBAAiB,WAAW,EACxC;AACN,MAAG,YAAY,WAAW;AAC1B,SAAM,GAAG,QAAQ;;GAEnB;AACF,2BAA0B,GAAG;;;;;;;;;;AAa/B,eAAsB,MACpB,IACA,UACA,aAAqB,gBACH;AAClB,QAAO,MAAM,GAAG,YAAY,oBAAoB,OAAO,OAAO;EAC5D,MAAM,MAAM,MAAM,GAAG,oBAAoB,SAAS;EAClD,MAAM,UAAiD,EAAE;AACzD,OAAK,MAAM,EAAE,KAAK,WAAW,KAAK;AAChC,OAAI,CAAC,IAAI,WAAA,UAA6B,CAAE;AACxC,WAAQ,KAAK;IACX,MAAM,IAAI,MAAM,EAAyB;IACzC,WAAW,SAAS,OAAO,GAAG;IAC/B,CAAC;;AAIJ,KAAG,UAAU,UAAU,kBAAkB,IAAI;AAE7C,MAAI,QAAQ,UAAU,YAAY;AAChC,SAAM,GAAG,QAAQ;AACjB,UAAO;;AAIT,UAAQ,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,UAAU;EACjD,MAAM,UAAU,QAAQ,SAAS;AACjC,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,MAAG,aAAA,GAAA,0BAAA,OAAkB,UAAU,QAAQ,GAAG,KAAK,CAAC;AAChD,MAAG,aAAa,UAAU,oBAAoB,QAAQ,GAAG,KAAK;;AAGhE,QAAM,GAAG,QAAQ;AACjB,SAAO;GACP;;;AAMJ,SAAS,iBACP,IACA,UACA,OACA,aACA,SACA,KACM;AACN,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,4BAAY,IAAI,KAA6B;AACnD,OAAK,MAAM,MAAM,KAAK,aAAa;GACjC,MAAM,WAAW,YAAY,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG;AACvD,OAAI,aAAa,KAAA,EACf,OAAM,IAAI,MAAM,cAAc,GAAG,eAAe;AAElD,aAAU,IAAI,IAAI,SAAS;;EAE7B,MAAM,MAAM,KAAK,OAAO,IAAI,UAAU;AACtC,UAAQ,IAAI,KAAK,MAAM,IAAI;AAC3B,KAAG,aAAA,GAAA,0BAAA,OAAkB,UAAU,KAAK,KAAK,EAAE,WAAW,IAAI;AAC1D,KAAG,UAAU,UAAU,oBAAoB,KAAK,MAAM,IAAI;;;;;;;;;;;;;;;;AAiB9D,eAAe,YACb,IACA,UACA,UACA,OACA,MAC4D;CAC5D,MAAM,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK;CAC1C,MAAM,8BAAc,IAAI,KAA+B;CAGvD,MAAM,SAAS,MAAM,GAAG,YAAY,6BAA6B,OAAO,OAAO;EAE7E,MAAM,CAAC,QAAQ,YAAY,MAAM,QAAQ,IAAI,CAC3C,QAAQ,IAAI,UAAU,KAAK,MAAM,GAAG,aAAA,GAAA,0BAAA,OAAkB,UAAU,EAAE,CAAC,CAAC,CAAC,EACrE,GAAG,wBAAwB,UAAU,iBAAiB,CACvD,CAAC;EAGF,MAAM,YADY,WAAW,SAAS,UAAU,GAAG,GAAG,KACzB;EAC7B,MAAM,MAAM,KAAK,KAAK,CAAC,UAAU;AAIjC,MAAI,OAHY,UAAU,SAAS,IAGd;GAEnB,MAAM,WAAA,GAAA,0BAAA,gCADS,MAAM,GAAG,UAAA,GAAA,0BAAA,OAAe,UAAU,SAAS,CAAC,EACN,MAAM;AAC3D,MAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI;AACzD,MAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAC7D,SAAM,GAAG,QAAQ;AACjB,QAAK,YAAY;AACjB,QAAK,YAAY,KAAK;AACtB,QAAK,aAAa;AAClB,UAAO;IAAE,MAAM;IAAe,QAAQ;IAAS,aAAa;IAAU;;EAIxE,MAAM,aAAuB,EAAE;AAC/B,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,IACpC,KAAI,OAAO,GAAI,YAAW,KAAK,EAAE;AAGnC,MAAI,WAAW,SAAS,GAAG;GACzB,MAAM,YAAY,MAAM,QAAQ,IAC9B,WAAW,KAAK,MAAM,GAAG,UAAA,GAAA,0BAAA,OAAe,UAAU,UAAU,GAAG,CAAC,CAAC,CAClE;AACD,QAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IACrC,aAAY,IACV,UAAU,WAAW,MAAA,GAAA,0BAAA,+BACS,UAAU,GAAG,MAAM,CAClD;;AAGL,OAAK,YAAY,WAAW;EAG5B,MAAM,UAAU,MAAM,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE,KAAK,CAAC;AAC7D,OAAK,cAAc,QAAQ;EAG3B,MAAM,aAAa,QAAQ,MAAM,GAAG,WAAW;EAC/C,MAAM,0BAAU,IAAI,KAA0B;AAC9C,mBAAiB,IAAI,UAAU,YAAY,aAAa,SAAS,IAAI;AAGrE,OAAK,MAAM,KAAK,WACd,IAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI,IAAI;AAE/D,KAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAE7D,QAAM,GAAG,QAAQ;AAGjB,OAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,OAAA,GAAA,0BAAA,oBAAyB,IAAI,CAAC;AAGtD,SAAO;GACL,MAAM;GACN,WAAW,QAAQ,MAAM,WAAW;GACpC,aAAa;GACd;GACD;AAEF,KAAI,OAAO,KACT,QAAO;EAAE,QAAQ,OAAO;EAAQ,aAAa,OAAO;EAAa;AAGnE,MAAK,aAAa;CAGlB,MAAM,EAAE,cAAc;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY;EACrD,MAAM,QAAQ,UAAU,MAAM,GAAG,IAAI,WAAW;AAChD,OAAK;AAEL,QAAM,GAAG,YAAY,wBAAwB,OAAO,OAAO;GACzD,MAAM,0BAAU,IAAI,KAA0B;AAE9C,oBAAiB,IAAI,UAAU,OAAO,aAAa,SADvC,KAAK,KAAK,CAAC,UAAU,CAC+B;AAChE,SAAM,GAAG,QAAQ;AAEjB,QAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,OAAA,GAAA,0BAAA,oBAAyB,IAAI,CAAC;IAEtD;;CAGJ,MAAM,SAAS,YAAY,IAAI,SAAS;AACxC,KAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gDAAgD;AAC7E,QAAO;EAAE;EAAQ,aAAa,OAAO;EAAa;;;;;;;;AASpD,eAAsB,mBACpB,IACA,MACA,SAC2B;CAC3B,MAAM,OAAO,aAAa;CAC1B,MAAM,KAAK,YAAY,KAAK;AAE5B,KAAI;EAEF,IAAI;AACJ,UAAQ,KAAK,MAAb;GACE,KAAK;AACH,eAAA,GAAA,iCAAA,eAAwB,KAAK,QAAQ;AACrC;GACF,KAAK;AACH,cAAU,KAAK;AACf;GACF,KAAK,SACH,QAAO,KAAK;GACd,KAAK,gBACH,OAAM,IAAI,MACR,oFACD;GACH,QAEE,OAAM,IAAI,MAAM,yBADC,KACmC,OAAO;;AAI/D,OAAK,iBAAiB,QAAQ;EAG9B,MAAM,WAAW,YAAY,KAAK;EAClC,MAAM,QAAQ,oBAAoB,QAAQ;AAC1C,OAAK,YAAY,YAAY,KAAK,GAAG;AACrC,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,kCAAkC;AAE1E,OAAK,aAAa,MAAM;EACxB,MAAM,WAAW,MAAM,MAAM,SAAS,GAAG;EAGzC,MAAM,aAAa,YAAY,KAAK;EACpC,MAAM,WAAW,SAAS,mBAAoB,MAAM,yBAAyB,GAAG;AAChF,OAAK,cAAc,YAAY,KAAK,GAAG;EAIvC,MAAM,cAAc;AACpB,OAAK,IAAI,UAAU,GAAG,UAAU,aAAa,UAC3C,KAAI;GACF,MAAM,OAAO,YAAY,KAAK;GAC9B,MAAM,SAAS,MAAM,YAAY,IAAI,UAAU,UAAU,OAAO,KAAK;AACrE,QAAK,gBAAgB,YAAY,KAAK,GAAG;AACzC,QAAK,UAAU;AAGf,OAAI,OAAO,eAAA,IAAoC;AAC7C,UAAM,MAAM,IAAI,SAAS;AACzB,SAAK,cAAc;;AAGrB,UAAO,OAAO;WACP,GAAG;AACV,OAAI,YAAY,cAAc,EAAG,OAAM;AAEvC,QAAK,YAAY;AACjB,QAAK,cAAc;;AAIvB,QAAM,IAAI,MAAM,mBAAmB;WAC3B;AACR,OAAK,UAAU,YAAY,KAAK,GAAG;AACnC,MAAIC,cAAAA,eAAe,CAAC,qBAClB,SAAQ,IAAI,mBAAmB,KAAK,UAAU,KAAK,GAAG;;;;;;;;AAY5D,eAAsB,uBACpB,IACA,MACA,SACgC;AAChC,KAAI,KAAK,SAAS,SAAS,SAAU,QAAO;CAE5C,MAAM,aAAa,MAAM,mBAAmB,IAAI,KAAK,UAAU,QAAQ;AACvE,QAAO;EACL,GAAG;EACH,UAAU;GAAE,MAAM;GAAU;GAAY;EACzC"}

package/dist/mutator/template/template_cache.d.ts

@@ -1,7 +1,7 @@
 import { TemplateSpecPrepared } from "../../model/template_spec.js";
 import { BlockPackSpecPrepared } from "../../model/block_pack_spec.js";
 import * as _$_milaboratories_pl_client0 from "@milaboratories/pl-client";
-import { AnyResourceRef, PlClient, PlTransaction, ResourceId, ResourceRef } from "@milaboratories/pl-client";
+import { AnyResourceRef, PlClient, PlTransaction, ResourceRef, SignedResourceId } from "@milaboratories/pl-client";
 import { CompiledTemplateV3, TemplateData } from "@milaboratories/pl-model-backend";
 
 //#region src/mutator/template/template_cache.d.ts
@@ -33,7 +33,7 @@ interface CacheableNode {
   /** SHA-256 content hash (includes all descendant content) */
   hash: string;
   /** Creates this node's resource in a transaction.
-   *  childRefs maps child hash → already-resolved ResourceRef or ResourceId */
+   *  childRefs maps child hash → already-resolved ResourceRef or SignedResourceId */
   create: (tx: PlTransaction, childRefs: ReadonlyMap<string, AnyResourceRef>) => ResourceRef;
   /** Hashes of direct child nodes this node depends on */
   childHashes: string[];
@@ -43,7 +43,7 @@ declare function flattenTemplateTree(data: TemplateData | CompiledTemplateV3): C
 /** Clear the in-memory cacheRid entry (call on errors referencing the cache resource). */
 declare function invalidateTemplateCacheId(pl: PlClient): void;
 /** Find or create the TemplateCache/1 resource on user root. */
-declare function getOrCreateTemplateCache(pl: PlClient): Promise<ResourceId>;
+declare function getOrCreateTemplateCache(pl: PlClient): Promise<SignedResourceId>;
 /** Remove the template cache from user root. */
 declare function dropTemplateCache(pl: PlClient): Promise<void>;
 /**
@@ -54,23 +54,23 @@ declare function dropTemplateCache(pl: PlClient): Promise<void>;
  * @internal exported for testing (maxEntries parameter allows low thresholds in tests)
  * @returns true if entries were evicted
  */
-declare function runGc(pl: PlClient, cacheRid: ResourceId, maxEntries?: number): Promise<boolean>;
+declare function runGc(pl: PlClient, cacheRid: SignedResourceId, maxEntries?: number): Promise<boolean>;
 /**
  * Materialize a template tree via the cache.
  * Manages its own transactions internally — do NOT call inside an existing tx.
  *
- * @returns concrete ResourceId of the root template
+ * @returns concrete SignedResourceId of the root template
  */
 declare function loadTemplateCached(pl: PlClient, spec: TemplateSpecPrepared, options?: {
-  cacheResourceId?: ResourceId;
-}): Promise<ResourceId>;
+  cacheResourceId?: SignedResourceId;
+}): Promise<SignedResourceId>;
 /**
  * Pre-materialize a block pack's template via cache.
  * Returns a copy of the spec with the template replaced by a cached reference.
  * If the template is already cached, returns the spec unchanged.
  */
 declare function cacheBlockPackTemplate(pl: PlClient, spec: BlockPackSpecPrepared, options?: {
-  cacheResourceId?: ResourceId;
+  cacheResourceId?: SignedResourceId;
 }): Promise<BlockPackSpecPrepared>;
 //#endregion
 export { ACCESS_COUNT_KEY, ACCESS_KEY_PREFIX, GC_ACCESS_THRESHOLD, GC_MAX_ENTRIES, TemplateCacheFieldName, TemplateCacheStat, TemplateCacheType, cacheBlockPackTemplate, dropTemplateCache, flattenTemplateTree, getOrCreateTemplateCache, invalidateTemplateCacheId, loadTemplateCached, runGc };

package/dist/mutator/template/template_cache.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"template_cache.d.ts","names":[],"sources":["../../../src/mutator/template/template_cache.ts"],"mappings":";;;;;;;cAmCa,iBAAA,EAAsD,4BAAA,CAArC,YAAA;AAAA,cAEjB,sBAAA;;cAGA,mBAAA;AALb;AAAA,cAOa,cAAA;;cAEA,gBAAA;;cAEA,iBAAA;AAAA,KAID,iBAAA;EACV,OAAA;EACA,SAAA;EACA,WAAA;EACA,aAAA;EACA,UAAA;EACA,SAAA;EACA,WAAA;EACA,UAAA;EACA,SAAA;EACA,WAAA;EACA,OAAA;EACA,cAAA;AAAA;AAAA,UAsBQ,aAAA;EAxCmB;EA0C3B,IAAA;EA1C2B;;EA6C3B,MAAA,GAAS,EAAA,EAAI,aAAA,EAAe,SAAA,EAAW,WAAA,SAAoB,cAAA,MAAoB,WAAA;EA3CnD;EA6C5B,WAAA;AAAA;;iBAmTc,mBAAA,CAAoB,IAAA,EAAM,YAAA,GAAe,kBAAA,GAAqB,aAAA;;iBAc9D,yBAAA,CAA0B,EAAA,EAAI,QAAA;;iBAKxB,wBAAA,CAAyB,EAAA,EAAI,QAAA,GAAW,OAAA,CAAQ,UAAA;;iBA+BhD,iBAAA,CAAkB,EAAA,EAAI,QAAA,GAAW,OAAA;;;;;;;;;iBAsBjC,KAAA,CACpB,EAAA,EAAI,QAAA,EACJ,QAAA,EAAU,UAAA,EACV,UAAA,YACC,OAAA;;;AA3ZD;;;;iBAwlBoB,kBAAA,CACpB,EAAA,EAAI,QAAA,EACJ,IAAA,EAAM,oBAAA,EACN,OAAA;EAAY,eAAA,GAAkB,UAAA;AAAA,IAC7B,OAAA,CAAQ,UAAA;;;;;;iBAmFW,sBAAA,CACpB,EAAA,EAAI,QAAA,EACJ,IAAA,EAAM,qBAAA,EACN,OAAA;EAAY,eAAA,GAAkB,UAAA;AAAA,IAC7B,OAAA,CAAQ,qBAAA"}
+{"version":3,"file":"template_cache.d.ts","names":[],"sources":["../../../src/mutator/template/template_cache.ts"],"mappings":";;;;;;;cAmCa,iBAAA,EAAsD,4BAAA,CAArC,YAAA;AAAA,cAEjB,sBAAA;;cAGA,mBAAA;AALb;AAAA,cAOa,cAAA;;cAEA,gBAAA;;cAEA,iBAAA;AAAA,KAID,iBAAA;EACV,OAAA;EACA,SAAA;EACA,WAAA;EACA,aAAA;EACA,UAAA;EACA,SAAA;EACA,WAAA;EACA,UAAA;EACA,SAAA;EACA,WAAA;EACA,OAAA;EACA,cAAA;AAAA;AAAA,UAsBQ,aAAA;EAxCmB;EA0C3B,IAAA;EA1C2B;;EA6C3B,MAAA,GAAS,EAAA,EAAI,aAAA,EAAe,SAAA,EAAW,WAAA,SAAoB,cAAA,MAAoB,WAAA;EA3CnD;EA6C5B,WAAA;AAAA;;iBAmTc,mBAAA,CAAoB,IAAA,EAAM,YAAA,GAAe,kBAAA,GAAqB,aAAA;;iBAc9D,yBAAA,CAA0B,EAAA,EAAI,QAAA;;iBAKxB,wBAAA,CAAyB,EAAA,EAAI,QAAA,GAAW,OAAA,CAAQ,gBAAA;;iBA+BhD,iBAAA,CAAkB,EAAA,EAAI,QAAA,GAAW,OAAA;;;;;;;;;iBAsBjC,KAAA,CACpB,EAAA,EAAI,QAAA,EACJ,QAAA,EAAU,gBAAA,EACV,UAAA,YACC,OAAA;;;AA3ZD;;;;iBA2lBoB,kBAAA,CACpB,EAAA,EAAI,QAAA,EACJ,IAAA,EAAM,oBAAA,EACN,OAAA;EAAY,eAAA,GAAkB,gBAAA;AAAA,IAC7B,OAAA,CAAQ,gBAAA;;;;;;iBAmFW,sBAAA,CACpB,EAAA,EAAI,QAAA,EACJ,IAAA,EAAM,qBAAA,EACN,OAAA;EAAY,eAAA,GAAkB,gBAAA;AAAA,IAC7B,OAAA,CAAQ,qBAAA"}

package/dist/mutator/template/template_cache.js

@@ -1,6 +1,6 @@
 import { getDebugFlags } from "../../debug/index.js";
 import { notEmpty } from "@milaboratories/ts-helpers";
-import { ensureResourceIdNotNull, field, resourceType, toGlobalResourceId } from "@milaboratories/pl-client";
+import { ensureSignedResourceIdNotNull, field, resourceType, toGlobalResourceId } from "@milaboratories/pl-client";
 import { createHash } from "node:crypto";
 import { PlTemplateLibV1, PlTemplateOverrideV1, PlTemplateSoftwareV1, PlTemplateV1, parseTemplate } from "@milaboratories/pl-model-backend";
 //#region src/mutator/template/template_cache.ts
@@ -253,7 +253,7 @@ function flattenTemplateTree(data) {
 	if (data.type === "pl.tengo-template.v2") return flattenV2Tree(data);
 	else return flattenV3Tree(data);
 }
-/** In-memory cache for the TemplateCache ResourceId per PlClient instance. */
+/** In-memory cache for the TemplateCache SignedResourceId per PlClient instance. */
 const cacheRidMap = /* @__PURE__ */ new WeakMap();
 /** Clear the in-memory cacheRid entry (call on errors referencing the cache resource). */
 function invalidateTemplateCacheId(pl) {
@@ -265,7 +265,7 @@ async function getOrCreateTemplateCache(pl) {
 	if (cached !== void 0) return cached;
 	const existing = await pl.withReadTx("templateCache:check", async (tx) => {
 		const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));
-		return fd ? ensureResourceIdNotNull(fd.value) : void 0;
+		return fd ? ensureSignedResourceIdNotNull(fd.value) : void 0;
 	});
 	if (existing) {
 		cacheRidMap.set(pl, existing);
@@ -273,7 +273,7 @@ async function getOrCreateTemplateCache(pl) {
 	}
 	const result = await pl.withWriteTx("templateCache:init", async (tx) => {
 		const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));
-		if (fd) return ensureResourceIdNotNull(fd.value);
+		if (fd) return ensureSignedResourceIdNotNull(fd.value);
 		const cache = tx.createStruct(TemplateCacheType);
 		tx.createField(field(pl.clientRoot, TemplateCacheFieldName), "Dynamic", cache);
 		tx.lock(cache);
@@ -354,7 +354,7 @@ function createBatchNodes(tx, cacheRid, batch, resolvedIds, newRefs, now) {
 * Phase 2..N (one write tx per batch):
 *   - Create remaining missing nodes in BATCH_SIZE chunks
 *
-* @returns root ResourceId and current access count (for GC decision)
+* @returns root SignedResourceId and current access count (for GC decision)
 */
 async function materialize(pl, cacheRid, rootHash, nodes, stat) {
 	const allHashes = nodes.map((n) => n.hash);
@@ -364,7 +364,7 @@ async function materialize(pl, cacheRid, rootHash, nodes, stat) {
 		const newCount = (countStr ? parseInt(countStr, 10) : 0) + 1;
 		const now = Date.now().toString();
 		if (exists[allHashes.length - 1]) {
-			const rootRid = ensureResourceIdNotNull((await tx.getField(field(cacheRid, rootHash))).value);
+			const rootRid = ensureSignedResourceIdNotNull((await tx.getField(field(cacheRid, rootHash))).value);
 			tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + rootHash, now);
 			tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());
 			await tx.commit();
@@ -381,7 +381,7 @@ async function materialize(pl, cacheRid, rootHash, nodes, stat) {
 		for (let i = 0; i < allHashes.length; i++) if (exists[i]) hitIndices.push(i);
 		if (hitIndices.length > 0) {
 			const hitFields = await Promise.all(hitIndices.map((i) => tx.getField(field(cacheRid, allHashes[i]))));
-			for (let j = 0; j < hitIndices.length; j++) resolvedIds.set(allHashes[hitIndices[j]], ensureResourceIdNotNull(hitFields[j].value));
+			for (let j = 0; j < hitIndices.length; j++) resolvedIds.set(allHashes[hitIndices[j]], ensureSignedResourceIdNotNull(hitFields[j].value));
 		}
 		stat.cacheHits = hitIndices.length;
 		const missing = nodes.filter((n) => !resolvedIds.has(n.hash));
@@ -426,7 +426,7 @@ async function materialize(pl, cacheRid, rootHash, nodes, stat) {
 * Materialize a template tree via the cache.
 * Manages its own transactions internally — do NOT call inside an existing tx.
 *
-* @returns concrete ResourceId of the root template
+* @returns concrete SignedResourceId of the root template
 */
 async function loadTemplateCached(pl, spec, options) {
 	const stat = initialStat();

package/dist/mutator/template/template_cache.js.map

@@ -1 +1 @@
-{"version":3,"file":"template_cache.js","names":[],"sources":["../../../src/mutator/template/template_cache.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport type {\n  AnyResourceRef,\n  PlClient,\n  PlTransaction,\n  ResourceId,\n  ResourceRef,\n} from \"@milaboratories/pl-client\";\nimport {\n  ensureResourceIdNotNull,\n  field,\n  resourceType,\n  toGlobalResourceId,\n} from \"@milaboratories/pl-client\";\nimport {\n  parseTemplate,\n  PlTemplateLibV1,\n  PlTemplateOverrideV1,\n  PlTemplateSoftwareV1,\n  PlTemplateV1,\n} from \"@milaboratories/pl-model-backend\";\nimport type {\n  CompiledTemplateV3,\n  TemplateData,\n  TemplateDataV3,\n  TemplateLibData,\n  TemplateLibDataV3,\n  TemplateSoftwareData,\n  TemplateSoftwareDataV3,\n} from \"@milaboratories/pl-model-backend\";\nimport { notEmpty } from \"@milaboratories/ts-helpers\";\nimport type { BlockPackSpecPrepared } from \"../../model\";\nimport type { TemplateSpecPrepared } from \"../../model/template_spec\";\nimport { getDebugFlags } from \"../../debug\";\n\nexport const TemplateCacheType = resourceType(\"TemplateCache\", \"1\");\n\nexport const TemplateCacheFieldName = \"__templateCache\";\nconst BATCH_SIZE = 50;\n/** @internal exported for testing */\nexport const GC_ACCESS_THRESHOLD = 30;\n/** @internal exported for testing */\nexport const GC_MAX_ENTRIES = 3000;\n/** @internal exported for testing */\nexport const ACCESS_COUNT_KEY = \"_accessCount\";\n/** @internal exported for testing */\nexport const ACCESS_KEY_PREFIX = \"access_\";\n\n// ─── Stats ───────────────────────────────────────────────────────────────────\n\nexport type TemplateCacheStat = {\n  totalMs: number;\n  flattenMs: number;\n  cacheInitMs: number;\n  materializeMs: number;\n  totalNodes: number;\n  cacheHits: number;\n  cacheMisses: number;\n  batchCount: number;\n  happyPath: boolean;\n  gcTriggered: boolean;\n  retries: number;\n  templateFormat: string;\n};\n\nfunction initialStat(): TemplateCacheStat {\n  return {\n    totalMs: 0,\n    flattenMs: 0,\n    cacheInitMs: 0,\n    materializeMs: 0,\n    totalNodes: 0,\n    cacheHits: 0,\n    cacheMisses: 0,\n    batchCount: 0,\n    happyPath: false,\n    gcTriggered: false,\n    retries: 0,\n    templateFormat: \"\",\n  };\n}\n\n// ─── Tree node abstraction ───────────────────────────────────────────────────\n\ninterface CacheableNode {\n  /** SHA-256 content hash (includes all descendant content) */\n  hash: string;\n  /** Creates this node's resource in a transaction.\n   *  childRefs maps child hash → already-resolved ResourceRef or ResourceId */\n  create: (tx: PlTransaction, childRefs: ReadonlyMap<string, AnyResourceRef>) => ResourceRef;\n  /** Hashes of direct child nodes this node depends on */\n  childHashes: string[];\n}\n\n// ─── Hash computation helpers ────────────────────────────────────────────────\n\nfunction getSourceCode(name: string, sources: Record<string, string>, sourceHash: string): string {\n  return notEmpty(\n    sources[sourceHash],\n    `trying to get \"${name}\" source: sources map doesn't contain source hash ${sourceHash}`,\n  );\n}\n\n/**\n * Bottom-up hash composition: each node hashes its OWN content + child hash STRINGS.\n * This means each unique node is hashed exactly once → O(n) instead of O(n * depth).\n */\n\n// V2 leaf hashes (libs, software — no children)\n\nfunction hashLibV2(lib: TemplateLibData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.src)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV2(sw: TemplateSoftwareData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.src)\n    .digest(\"hex\");\n}\n\n// V3 leaf hashes — use sourceHash directly instead of resolving source content\n\nfunction hashLibV3(lib: TemplateLibDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.sourceHash)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV3(sw: TemplateSoftwareDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.sourceHash)\n    .digest(\"hex\");\n}\n\n// ─── Tree flattening ─────────────────────────────────────────────────────────\n\nfunction flattenV2Tree(data: TemplateData): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n\n  function processLib(lib: TemplateLibData): string {\n    const hash = hashLibV2(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(PlTemplateLibV1.fromV2Data(lib).data),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareData): string {\n    const hash = hashSoftwareV2(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV2Data(sw);\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateData): string {\n    // Process children first (bottom-up) — their hashes are computed before ours\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content)\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.src);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV2Data(tpl).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV2Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data);\n  return nodes;\n}\n\nfunction flattenV3Tree(data: CompiledTemplateV3): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n  const sources = data.hashToSource;\n\n  function processLib(lib: TemplateLibDataV3): string {\n    const hash = hashLibV3(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(\n              PlTemplateLibV1.fromV3Data(lib, getSourceCode(lib.name, sources, lib.sourceHash))\n                .data,\n            ),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareDataV3): string {\n    const hash = hashSoftwareV3(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV3Data(\n            sw,\n            getSourceCode(sw.name, sources, sw.sourceHash),\n          );\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateDataV3): string {\n    // Process children first (bottom-up)\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content).\n    // Uses sourceHash directly — it already uniquely identifies the source.\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.sourceHash);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const sourceCode = getSourceCode(tpl.name, sources, tpl.sourceHash);\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV3Data(tpl, sourceCode).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV3Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data.template);\n  return nodes;\n}\n\n/** Flatten template tree into a topologically ordered list of cacheable nodes (leaves first). */\nexport function flattenTemplateTree(data: TemplateData | CompiledTemplateV3): CacheableNode[] {\n  if (data.type === \"pl.tengo-template.v2\") {\n    return flattenV2Tree(data);\n  } else {\n    return flattenV3Tree(data);\n  }\n}\n\n// ─── Cache operations ────────────────────────────────────────────────────────\n\n/** In-memory cache for the TemplateCache ResourceId per PlClient instance. */\nconst cacheRidMap = new WeakMap<PlClient, ResourceId>();\n\n/** Clear the in-memory cacheRid entry (call on errors referencing the cache resource). */\nexport function invalidateTemplateCacheId(pl: PlClient): void {\n  cacheRidMap.delete(pl);\n}\n\n/** Find or create the TemplateCache/1 resource on user root. */\nexport async function getOrCreateTemplateCache(pl: PlClient): Promise<ResourceId> {\n  // Check in-memory cache first (0ms after first call)\n  const cached = cacheRidMap.get(pl);\n  if (cached !== undefined) return cached;\n\n  // Try read-only check\n  const existing = await pl.withReadTx(\"templateCache:check\", async (tx) => {\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    return fd ? ensureResourceIdNotNull(fd.value) : undefined;\n  });\n  if (existing) {\n    cacheRidMap.set(pl, existing);\n    return existing;\n  }\n\n  const result = await pl.withWriteTx(\"templateCache:init\", async (tx) => {\n    // Double-check inside write tx (another instance may have created it)\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    if (fd) return ensureResourceIdNotNull(fd.value);\n\n    const cache = tx.createStruct(TemplateCacheType);\n    tx.createField(field(pl.clientRoot, TemplateCacheFieldName), \"Dynamic\", cache);\n    tx.lock(cache);\n    await tx.commit();\n    return await cache.globalId;\n  });\n  cacheRidMap.set(pl, result);\n  return result;\n}\n\n/** Remove the template cache from user root. */\nexport async function dropTemplateCache(pl: PlClient): Promise<void> {\n  await pl.withWriteTx(\"templateCache:drop\", async (tx) => {\n    const cacheField = field(pl.clientRoot, TemplateCacheFieldName);\n    const fd = await tx.getFieldIfExists(cacheField);\n    if (fd) {\n      tx.removeField(cacheField);\n      await tx.commit();\n    }\n  });\n  invalidateTemplateCacheId(pl);\n}\n\n// ─── GC ──────────────────────────────────────────────────────────────────────\n\n/**\n * Run count-based garbage collection on the template cache.\n * Evicts least-recently-used entries when the cache exceeds maxEntries.\n * Always resets the access counter to 0.\n *\n * @internal exported for testing (maxEntries parameter allows low thresholds in tests)\n * @returns true if entries were evicted\n */\nexport async function runGc(\n  pl: PlClient,\n  cacheRid: ResourceId,\n  maxEntries: number = GC_MAX_ENTRIES,\n): Promise<boolean> {\n  return await pl.withWriteTx(\"templateCache:gc\", async (tx) => {\n    const kvs = await tx.listKeyValuesString(cacheRid);\n    const entries: { hash: string; timestamp: number }[] = [];\n    for (const { key, value } of kvs) {\n      if (!key.startsWith(ACCESS_KEY_PREFIX)) continue;\n      entries.push({\n        hash: key.slice(ACCESS_KEY_PREFIX.length),\n        timestamp: parseInt(value, 10),\n      });\n    }\n\n    // Always reset counter\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, \"0\");\n\n    if (entries.length <= maxEntries) {\n      await tx.commit();\n      return false;\n    }\n\n    // Sort oldest first, evict until under limit\n    entries.sort((a, b) => a.timestamp - b.timestamp);\n    const toEvict = entries.length - maxEntries;\n    for (let i = 0; i < toEvict; i++) {\n      tx.removeField(field(cacheRid, entries[i].hash));\n      tx.deleteKValue(cacheRid, ACCESS_KEY_PREFIX + entries[i].hash);\n    }\n\n    await tx.commit();\n    return true;\n  });\n}\n\n// ─── Batched materialization ─────────────────────────────────────────────────\n\n/** Create a batch of cache nodes in the current transaction. */\nfunction createBatchNodes(\n  tx: PlTransaction,\n  cacheRid: ResourceId,\n  batch: CacheableNode[],\n  resolvedIds: ReadonlyMap<string, ResourceId>,\n  newRefs: Map<string, ResourceRef>,\n  now: string,\n): void {\n  for (const node of batch) {\n    const childRefs = new Map<string, AnyResourceRef>();\n    for (const ch of node.childHashes) {\n      const resolved = resolvedIds.get(ch) ?? newRefs.get(ch);\n      if (resolved === undefined) {\n        throw new Error(`BUG: child ${ch} not resolved`);\n      }\n      childRefs.set(ch, resolved);\n    }\n    const ref = node.create(tx, childRefs);\n    newRefs.set(node.hash, ref);\n    tx.createField(field(cacheRid, node.hash), \"Dynamic\", ref);\n    tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + node.hash, now);\n  }\n}\n\n/**\n * Materialize a template tree via the cache using \"probe all + batched creation\".\n *\n * Phase 1 (single write tx):\n *   - Check existence of ALL hashes in one roundtrip\n *   - Happy path: if root cached, update access tracking and return\n *   - Otherwise: fetch ResourceIds for all cache hits, create first batch of missing nodes\n *\n * Phase 2..N (one write tx per batch):\n *   - Create remaining missing nodes in BATCH_SIZE chunks\n *\n * @returns root ResourceId and current access count (for GC decision)\n */\nasync function materialize(\n  pl: PlClient,\n  cacheRid: ResourceId,\n  rootHash: string,\n  nodes: CacheableNode[],\n  stat: TemplateCacheStat,\n): Promise<{ rootId: ResourceId; accessCount: number }> {\n  const allHashes = nodes.map((n) => n.hash);\n  const resolvedIds = new Map<string, ResourceId>();\n\n  // Phase 1: probe all + first batch\n  const phase1 = await pl.withWriteTx(\"templateCache:materialize\", async (tx) => {\n    // 1 roundtrip: check all hashes + read access count\n    const [exists, countStr] = await Promise.all([\n      Promise.all(allHashes.map((h) => tx.fieldExists(field(cacheRid, h)))),\n      tx.getKValueStringIfExists(cacheRid, ACCESS_COUNT_KEY),\n    ]);\n\n    const prevCount = countStr ? parseInt(countStr, 10) : 0;\n    const newCount = prevCount + 1;\n    const now = Date.now().toString();\n    const rootIdx = allHashes.length - 1;\n\n    // Happy path: root already cached\n    if (exists[rootIdx]) {\n      const rootFd = await tx.getField(field(cacheRid, rootHash));\n      const rootRid = ensureResourceIdNotNull(rootFd.value);\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + rootHash, now);\n      tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n      await tx.commit();\n      stat.happyPath = true;\n      stat.cacheHits = stat.totalNodes;\n      stat.batchCount = 1;\n      return { done: true as const, rootId: rootRid, accessCount: newCount };\n    }\n\n    // Fetch ResourceIds for all cache hits (1 roundtrip)\n    const hitIndices: number[] = [];\n    for (let i = 0; i < allHashes.length; i++) {\n      if (exists[i]) hitIndices.push(i);\n    }\n\n    if (hitIndices.length > 0) {\n      const hitFields = await Promise.all(\n        hitIndices.map((i) => tx.getField(field(cacheRid, allHashes[i]))),\n      );\n      for (let j = 0; j < hitIndices.length; j++) {\n        resolvedIds.set(allHashes[hitIndices[j]], ensureResourceIdNotNull(hitFields[j].value));\n      }\n    }\n    stat.cacheHits = hitIndices.length;\n\n    // Missing nodes (topo order preserved from flatten)\n    const missing = nodes.filter((n) => !resolvedIds.has(n.hash));\n    stat.cacheMisses = missing.length;\n\n    // Create first batch of missing nodes\n    const firstBatch = missing.slice(0, BATCH_SIZE);\n    const newRefs = new Map<string, ResourceRef>();\n    createBatchNodes(tx, cacheRid, firstBatch, resolvedIds, newRefs, now);\n\n    // Update access tracking for cache hits\n    for (const i of hitIndices) {\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + allHashes[i], now);\n    }\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n\n    await tx.commit();\n\n    // Resolve new refs to global IDs (after commit)\n    for (const [hash, ref] of newRefs) {\n      resolvedIds.set(hash, await toGlobalResourceId(ref));\n    }\n\n    return {\n      done: false as const,\n      remaining: missing.slice(BATCH_SIZE),\n      accessCount: newCount,\n    };\n  });\n\n  if (phase1.done) {\n    return { rootId: phase1.rootId, accessCount: phase1.accessCount };\n  }\n\n  stat.batchCount = 1;\n\n  // Phase 2+: remaining batches\n  const { remaining } = phase1;\n  for (let i = 0; i < remaining.length; i += BATCH_SIZE) {\n    const batch = remaining.slice(i, i + BATCH_SIZE);\n    stat.batchCount++;\n\n    await pl.withWriteTx(\"templateCache:create\", async (tx) => {\n      const newRefs = new Map<string, ResourceRef>();\n      const now = Date.now().toString();\n      createBatchNodes(tx, cacheRid, batch, resolvedIds, newRefs, now);\n      await tx.commit();\n\n      for (const [hash, ref] of newRefs) {\n        resolvedIds.set(hash, await toGlobalResourceId(ref));\n      }\n    });\n  }\n\n  const rootId = resolvedIds.get(rootHash);\n  if (!rootId) throw new Error(\"BUG: root hash not resolved after all batches\");\n  return { rootId, accessCount: phase1.accessCount };\n}\n\n/**\n * Materialize a template tree via the cache.\n * Manages its own transactions internally — do NOT call inside an existing tx.\n *\n * @returns concrete ResourceId of the root template\n */\nexport async function loadTemplateCached(\n  pl: PlClient,\n  spec: TemplateSpecPrepared,\n  options?: { cacheResourceId?: ResourceId },\n): Promise<ResourceId> {\n  const stat = initialStat();\n  const t0 = performance.now();\n\n  try {\n    // Parse to data if needed\n    let tplData: TemplateData | CompiledTemplateV3;\n    switch (spec.type) {\n      case \"explicit\":\n        tplData = parseTemplate(spec.content);\n        break;\n      case \"prepared\":\n        tplData = spec.data;\n        break;\n      case \"cached\":\n        return spec.resourceId;\n      case \"from-registry\":\n        throw new Error(\n          \"loadTemplateCached does not support from-registry specs; use loadTemplate instead\",\n        );\n      default: {\n        const _: never = spec;\n        throw new Error(`unexpected spec type: ${(_ as any).type}`);\n      }\n    }\n\n    stat.templateFormat = tplData.type;\n\n    // Flatten to ordered nodes\n    const tFlatten = performance.now();\n    const nodes = flattenTemplateTree(tplData);\n    stat.flattenMs = performance.now() - tFlatten;\n    if (nodes.length === 0) throw new Error(\"template tree produced no nodes\");\n\n    stat.totalNodes = nodes.length;\n    const rootHash = nodes[nodes.length - 1].hash;\n\n    // Resolve or create cache resource\n    const tCacheInit = performance.now();\n    const cacheRid = options?.cacheResourceId ?? (await getOrCreateTemplateCache(pl));\n    stat.cacheInitMs = performance.now() - tCacheInit;\n\n    // Retry loop: if a write tx fails (e.g. concurrent GC invalidated a cached resource),\n    // restart materialization from scratch.\n    const MAX_RETRIES = 3;\n    for (let attempt = 0; attempt < MAX_RETRIES; attempt++) {\n      try {\n        const tMat = performance.now();\n        const result = await materialize(pl, cacheRid, rootHash, nodes, stat);\n        stat.materializeMs = performance.now() - tMat;\n        stat.retries = attempt;\n\n        // GC in separate tx if access count exceeded threshold\n        if (result.accessCount >= GC_ACCESS_THRESHOLD) {\n          await runGc(pl, cacheRid);\n          stat.gcTriggered = true;\n        }\n\n        return result.rootId;\n      } catch (e) {\n        if (attempt === MAX_RETRIES - 1) throw e;\n        // Retry from scratch — previous batch results may reference GC'd resources\n        stat.cacheHits = 0;\n        stat.cacheMisses = 0;\n      }\n    }\n\n    throw new Error(\"BUG: unreachable\");\n  } finally {\n    stat.totalMs = performance.now() - t0;\n    if (getDebugFlags().logTemplateCacheStat) {\n      console.log(`[templateCache] ${JSON.stringify(stat)}`);\n    }\n  }\n}\n\n// ─── Caller helper ───────────────────────────────────────────────────────────\n\n/**\n * Pre-materialize a block pack's template via cache.\n * Returns a copy of the spec with the template replaced by a cached reference.\n * If the template is already cached, returns the spec unchanged.\n */\nexport async function cacheBlockPackTemplate(\n  pl: PlClient,\n  spec: BlockPackSpecPrepared,\n  options?: { cacheResourceId?: ResourceId },\n): Promise<BlockPackSpecPrepared> {\n  if (spec.template.type === \"cached\") return spec;\n\n  const resourceId = await loadTemplateCached(pl, spec.template, options);\n  return {\n    ...spec,\n    template: { type: \"cached\", resourceId },\n  };\n}\n"],"mappings":";;;;;;AAmCA,MAAa,oBAAoB,aAAa,iBAAiB,IAAI;AAEnE,MAAa,yBAAyB;AACtC,MAAM,aAAa;;AAEnB,MAAa,sBAAsB;;AAEnC,MAAa,iBAAiB;;AAE9B,MAAa,mBAAmB;;AAEhC,MAAa,oBAAoB;AAmBjC,SAAS,cAAiC;AACxC,QAAO;EACL,SAAS;EACT,WAAW;EACX,aAAa;EACb,eAAe;EACf,YAAY;EACZ,WAAW;EACX,aAAa;EACb,YAAY;EACZ,WAAW;EACX,aAAa;EACb,SAAS;EACT,gBAAgB;EACjB;;AAiBH,SAAS,cAAc,MAAc,SAAiC,YAA4B;AAChG,QAAO,SACL,QAAQ,aACR,kBAAkB,KAAK,oDAAoD,aAC5E;;;;;;AAUH,SAAS,UAAU,KAA8B;AAC/C,QAAO,WAAW,SAAS,CACxB,OAAO,gBAAgB,KAAK,KAAK,CACjC,OAAO,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI,CACf,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAkC;AACxD,QAAO,WAAW,SAAS,CACxB,OAAO,qBAAqB,KAAK,KAAK,CACtC,OAAO,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,IAAI,CACd,OAAO,MAAM;;AAKlB,SAAS,UAAU,KAAgC;AACjD,QAAO,WAAW,SAAS,CACxB,OAAO,gBAAgB,KAAK,KAAK,CACjC,OAAO,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW,CACtB,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAoC;AAC1D,QAAO,WAAW,SAAS,CACxB,OAAO,qBAAqB,KAAK,KAAK,CACtC,OAAO,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,WAAW,CACrB,OAAO,MAAM;;AAKlB,SAAS,cAAc,MAAqC;CAC1D,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAE9B,SAAS,WAAW,KAA8B;EAChD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACD,gBAAgB,MAChB,KAAK,UAAU,gBAAgB,WAAW,IAAI,CAAC,KAAK,CACrD;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAkC;EACzD,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAAS,qBAAqB,WAAW,GAAG;KAClD,MAAM,MAAM,GAAG,aAAa,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAK,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA2B;EAElD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAI7E,MAAM,IAAI,WAAW,SAAS,CAC3B,OAAO,aAAa,KAAK,KAAK,CAC9B,OAAO,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI;AAClB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,SAAS,GAAG,aAChB,aAAa,MACb,KAAK,UAAU,aAAa,WAAW,IAAI,CAAC,KAAK,CAClD;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,KAAK,SAAS,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrB,qBAAqB,MACrB,KAAK,UAAU,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAc,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK;AACrB,QAAO;;AAGT,SAAS,cAAc,MAA2C;CAChE,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,UAAU,KAAK;CAErB,SAAS,WAAW,KAAgC;EAClD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACD,gBAAgB,MAChB,KAAK,UACH,gBAAgB,WAAW,KAAK,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW,CAAC,CAC9E,KACJ,CACF;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAoC;EAC3D,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAAS,qBAAqB,WAClC,IACA,cAAc,GAAG,MAAM,SAAS,GAAG,WAAW,CAC/C;KACD,MAAM,MAAM,GAAG,aAAa,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAK,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA6B;EAEpD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAK7E,MAAM,IAAI,WAAW,SAAS,CAC3B,OAAO,aAAa,KAAK,KAAK,CAC9B,OAAO,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW;AACzB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,aAAa,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW;IACnE,MAAM,SAAS,GAAG,aAChB,aAAa,MACb,KAAK,UAAU,aAAa,WAAW,KAAK,WAAW,CAAC,KAAK,CAC9D;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,KAAK,SAAS,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrB,qBAAqB,MACrB,KAAK,UAAU,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAc,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK,SAAS;AAC9B,QAAO;;;AAIT,SAAgB,oBAAoB,MAA0D;AAC5F,KAAI,KAAK,SAAS,uBAChB,QAAO,cAAc,KAAK;KAE1B,QAAO,cAAc,KAAK;;;AAO9B,MAAM,8BAAc,IAAI,SAA+B;;AAGvD,SAAgB,0BAA0B,IAAoB;AAC5D,aAAY,OAAO,GAAG;;;AAIxB,eAAsB,yBAAyB,IAAmC;CAEhF,MAAM,SAAS,YAAY,IAAI,GAAG;AAClC,KAAI,WAAW,KAAA,EAAW,QAAO;CAGjC,MAAM,WAAW,MAAM,GAAG,WAAW,uBAAuB,OAAO,OAAO;EACxE,MAAM,KAAK,MAAM,GAAG,iBAAiB,MAAM,GAAG,YAAY,uBAAuB,CAAC;AAClF,SAAO,KAAK,wBAAwB,GAAG,MAAM,GAAG,KAAA;GAChD;AACF,KAAI,UAAU;AACZ,cAAY,IAAI,IAAI,SAAS;AAC7B,SAAO;;CAGT,MAAM,SAAS,MAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EAEtE,MAAM,KAAK,MAAM,GAAG,iBAAiB,MAAM,GAAG,YAAY,uBAAuB,CAAC;AAClF,MAAI,GAAI,QAAO,wBAAwB,GAAG,MAAM;EAEhD,MAAM,QAAQ,GAAG,aAAa,kBAAkB;AAChD,KAAG,YAAY,MAAM,GAAG,YAAY,uBAAuB,EAAE,WAAW,MAAM;AAC9E,KAAG,KAAK,MAAM;AACd,QAAM,GAAG,QAAQ;AACjB,SAAO,MAAM,MAAM;GACnB;AACF,aAAY,IAAI,IAAI,OAAO;AAC3B,QAAO;;;AAIT,eAAsB,kBAAkB,IAA6B;AACnE,OAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EACvD,MAAM,aAAa,MAAM,GAAG,YAAY,uBAAuB;AAE/D,MADW,MAAM,GAAG,iBAAiB,WAAW,EACxC;AACN,MAAG,YAAY,WAAW;AAC1B,SAAM,GAAG,QAAQ;;GAEnB;AACF,2BAA0B,GAAG;;;;;;;;;;AAa/B,eAAsB,MACpB,IACA,UACA,aAAqB,gBACH;AAClB,QAAO,MAAM,GAAG,YAAY,oBAAoB,OAAO,OAAO;EAC5D,MAAM,MAAM,MAAM,GAAG,oBAAoB,SAAS;EAClD,MAAM,UAAiD,EAAE;AACzD,OAAK,MAAM,EAAE,KAAK,WAAW,KAAK;AAChC,OAAI,CAAC,IAAI,WAAA,UAA6B,CAAE;AACxC,WAAQ,KAAK;IACX,MAAM,IAAI,MAAM,EAAyB;IACzC,WAAW,SAAS,OAAO,GAAG;IAC/B,CAAC;;AAIJ,KAAG,UAAU,UAAU,kBAAkB,IAAI;AAE7C,MAAI,QAAQ,UAAU,YAAY;AAChC,SAAM,GAAG,QAAQ;AACjB,UAAO;;AAIT,UAAQ,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,UAAU;EACjD,MAAM,UAAU,QAAQ,SAAS;AACjC,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,MAAG,YAAY,MAAM,UAAU,QAAQ,GAAG,KAAK,CAAC;AAChD,MAAG,aAAa,UAAU,oBAAoB,QAAQ,GAAG,KAAK;;AAGhE,QAAM,GAAG,QAAQ;AACjB,SAAO;GACP;;;AAMJ,SAAS,iBACP,IACA,UACA,OACA,aACA,SACA,KACM;AACN,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,4BAAY,IAAI,KAA6B;AACnD,OAAK,MAAM,MAAM,KAAK,aAAa;GACjC,MAAM,WAAW,YAAY,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG;AACvD,OAAI,aAAa,KAAA,EACf,OAAM,IAAI,MAAM,cAAc,GAAG,eAAe;AAElD,aAAU,IAAI,IAAI,SAAS;;EAE7B,MAAM,MAAM,KAAK,OAAO,IAAI,UAAU;AACtC,UAAQ,IAAI,KAAK,MAAM,IAAI;AAC3B,KAAG,YAAY,MAAM,UAAU,KAAK,KAAK,EAAE,WAAW,IAAI;AAC1D,KAAG,UAAU,UAAU,oBAAoB,KAAK,MAAM,IAAI;;;;;;;;;;;;;;;;AAiB9D,eAAe,YACb,IACA,UACA,UACA,OACA,MACsD;CACtD,MAAM,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK;CAC1C,MAAM,8BAAc,IAAI,KAAyB;CAGjD,MAAM,SAAS,MAAM,GAAG,YAAY,6BAA6B,OAAO,OAAO;EAE7E,MAAM,CAAC,QAAQ,YAAY,MAAM,QAAQ,IAAI,CAC3C,QAAQ,IAAI,UAAU,KAAK,MAAM,GAAG,YAAY,MAAM,UAAU,EAAE,CAAC,CAAC,CAAC,EACrE,GAAG,wBAAwB,UAAU,iBAAiB,CACvD,CAAC;EAGF,MAAM,YADY,WAAW,SAAS,UAAU,GAAG,GAAG,KACzB;EAC7B,MAAM,MAAM,KAAK,KAAK,CAAC,UAAU;AAIjC,MAAI,OAHY,UAAU,SAAS,IAGd;GAEnB,MAAM,UAAU,yBADD,MAAM,GAAG,SAAS,MAAM,UAAU,SAAS,CAAC,EACZ,MAAM;AACrD,MAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI;AACzD,MAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAC7D,SAAM,GAAG,QAAQ;AACjB,QAAK,YAAY;AACjB,QAAK,YAAY,KAAK;AACtB,QAAK,aAAa;AAClB,UAAO;IAAE,MAAM;IAAe,QAAQ;IAAS,aAAa;IAAU;;EAIxE,MAAM,aAAuB,EAAE;AAC/B,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,IACpC,KAAI,OAAO,GAAI,YAAW,KAAK,EAAE;AAGnC,MAAI,WAAW,SAAS,GAAG;GACzB,MAAM,YAAY,MAAM,QAAQ,IAC9B,WAAW,KAAK,MAAM,GAAG,SAAS,MAAM,UAAU,UAAU,GAAG,CAAC,CAAC,CAClE;AACD,QAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IACrC,aAAY,IAAI,UAAU,WAAW,KAAK,wBAAwB,UAAU,GAAG,MAAM,CAAC;;AAG1F,OAAK,YAAY,WAAW;EAG5B,MAAM,UAAU,MAAM,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE,KAAK,CAAC;AAC7D,OAAK,cAAc,QAAQ;EAG3B,MAAM,aAAa,QAAQ,MAAM,GAAG,WAAW;EAC/C,MAAM,0BAAU,IAAI,KAA0B;AAC9C,mBAAiB,IAAI,UAAU,YAAY,aAAa,SAAS,IAAI;AAGrE,OAAK,MAAM,KAAK,WACd,IAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI,IAAI;AAE/D,KAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAE7D,QAAM,GAAG,QAAQ;AAGjB,OAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,MAAM,mBAAmB,IAAI,CAAC;AAGtD,SAAO;GACL,MAAM;GACN,WAAW,QAAQ,MAAM,WAAW;GACpC,aAAa;GACd;GACD;AAEF,KAAI,OAAO,KACT,QAAO;EAAE,QAAQ,OAAO;EAAQ,aAAa,OAAO;EAAa;AAGnE,MAAK,aAAa;CAGlB,MAAM,EAAE,cAAc;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY;EACrD,MAAM,QAAQ,UAAU,MAAM,GAAG,IAAI,WAAW;AAChD,OAAK;AAEL,QAAM,GAAG,YAAY,wBAAwB,OAAO,OAAO;GACzD,MAAM,0BAAU,IAAI,KAA0B;AAE9C,oBAAiB,IAAI,UAAU,OAAO,aAAa,SADvC,KAAK,KAAK,CAAC,UAAU,CAC+B;AAChE,SAAM,GAAG,QAAQ;AAEjB,QAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,MAAM,mBAAmB,IAAI,CAAC;IAEtD;;CAGJ,MAAM,SAAS,YAAY,IAAI,SAAS;AACxC,KAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gDAAgD;AAC7E,QAAO;EAAE;EAAQ,aAAa,OAAO;EAAa;;;;;;;;AASpD,eAAsB,mBACpB,IACA,MACA,SACqB;CACrB,MAAM,OAAO,aAAa;CAC1B,MAAM,KAAK,YAAY,KAAK;AAE5B,KAAI;EAEF,IAAI;AACJ,UAAQ,KAAK,MAAb;GACE,KAAK;AACH,cAAU,cAAc,KAAK,QAAQ;AACrC;GACF,KAAK;AACH,cAAU,KAAK;AACf;GACF,KAAK,SACH,QAAO,KAAK;GACd,KAAK,gBACH,OAAM,IAAI,MACR,oFACD;GACH,QAEE,OAAM,IAAI,MAAM,yBADC,KACmC,OAAO;;AAI/D,OAAK,iBAAiB,QAAQ;EAG9B,MAAM,WAAW,YAAY,KAAK;EAClC,MAAM,QAAQ,oBAAoB,QAAQ;AAC1C,OAAK,YAAY,YAAY,KAAK,GAAG;AACrC,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,kCAAkC;AAE1E,OAAK,aAAa,MAAM;EACxB,MAAM,WAAW,MAAM,MAAM,SAAS,GAAG;EAGzC,MAAM,aAAa,YAAY,KAAK;EACpC,MAAM,WAAW,SAAS,mBAAoB,MAAM,yBAAyB,GAAG;AAChF,OAAK,cAAc,YAAY,KAAK,GAAG;EAIvC,MAAM,cAAc;AACpB,OAAK,IAAI,UAAU,GAAG,UAAU,aAAa,UAC3C,KAAI;GACF,MAAM,OAAO,YAAY,KAAK;GAC9B,MAAM,SAAS,MAAM,YAAY,IAAI,UAAU,UAAU,OAAO,KAAK;AACrE,QAAK,gBAAgB,YAAY,KAAK,GAAG;AACzC,QAAK,UAAU;AAGf,OAAI,OAAO,eAAA,IAAoC;AAC7C,UAAM,MAAM,IAAI,SAAS;AACzB,SAAK,cAAc;;AAGrB,UAAO,OAAO;WACP,GAAG;AACV,OAAI,YAAY,cAAc,EAAG,OAAM;AAEvC,QAAK,YAAY;AACjB,QAAK,cAAc;;AAIvB,QAAM,IAAI,MAAM,mBAAmB;WAC3B;AACR,OAAK,UAAU,YAAY,KAAK,GAAG;AACnC,MAAI,eAAe,CAAC,qBAClB,SAAQ,IAAI,mBAAmB,KAAK,UAAU,KAAK,GAAG;;;;;;;;AAY5D,eAAsB,uBACpB,IACA,MACA,SACgC;AAChC,KAAI,KAAK,SAAS,SAAS,SAAU,QAAO;CAE5C,MAAM,aAAa,MAAM,mBAAmB,IAAI,KAAK,UAAU,QAAQ;AACvE,QAAO;EACL,GAAG;EACH,UAAU;GAAE,MAAM;GAAU;GAAY;EACzC"}
+{"version":3,"file":"template_cache.js","names":[],"sources":["../../../src/mutator/template/template_cache.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport type {\n  AnyResourceRef,\n  PlClient,\n  PlTransaction,\n  SignedResourceId,\n  ResourceRef,\n} from \"@milaboratories/pl-client\";\nimport {\n  ensureSignedResourceIdNotNull,\n  field,\n  resourceType,\n  toGlobalResourceId,\n} from \"@milaboratories/pl-client\";\nimport {\n  parseTemplate,\n  PlTemplateLibV1,\n  PlTemplateOverrideV1,\n  PlTemplateSoftwareV1,\n  PlTemplateV1,\n} from \"@milaboratories/pl-model-backend\";\nimport type {\n  CompiledTemplateV3,\n  TemplateData,\n  TemplateDataV3,\n  TemplateLibData,\n  TemplateLibDataV3,\n  TemplateSoftwareData,\n  TemplateSoftwareDataV3,\n} from \"@milaboratories/pl-model-backend\";\nimport { notEmpty } from \"@milaboratories/ts-helpers\";\nimport type { BlockPackSpecPrepared } from \"../../model\";\nimport type { TemplateSpecPrepared } from \"../../model/template_spec\";\nimport { getDebugFlags } from \"../../debug\";\n\nexport const TemplateCacheType = resourceType(\"TemplateCache\", \"1\");\n\nexport const TemplateCacheFieldName = \"__templateCache\";\nconst BATCH_SIZE = 50;\n/** @internal exported for testing */\nexport const GC_ACCESS_THRESHOLD = 30;\n/** @internal exported for testing */\nexport const GC_MAX_ENTRIES = 3000;\n/** @internal exported for testing */\nexport const ACCESS_COUNT_KEY = \"_accessCount\";\n/** @internal exported for testing */\nexport const ACCESS_KEY_PREFIX = \"access_\";\n\n// ─── Stats ───────────────────────────────────────────────────────────────────\n\nexport type TemplateCacheStat = {\n  totalMs: number;\n  flattenMs: number;\n  cacheInitMs: number;\n  materializeMs: number;\n  totalNodes: number;\n  cacheHits: number;\n  cacheMisses: number;\n  batchCount: number;\n  happyPath: boolean;\n  gcTriggered: boolean;\n  retries: number;\n  templateFormat: string;\n};\n\nfunction initialStat(): TemplateCacheStat {\n  return {\n    totalMs: 0,\n    flattenMs: 0,\n    cacheInitMs: 0,\n    materializeMs: 0,\n    totalNodes: 0,\n    cacheHits: 0,\n    cacheMisses: 0,\n    batchCount: 0,\n    happyPath: false,\n    gcTriggered: false,\n    retries: 0,\n    templateFormat: \"\",\n  };\n}\n\n// ─── Tree node abstraction ───────────────────────────────────────────────────\n\ninterface CacheableNode {\n  /** SHA-256 content hash (includes all descendant content) */\n  hash: string;\n  /** Creates this node's resource in a transaction.\n   *  childRefs maps child hash → already-resolved ResourceRef or SignedResourceId */\n  create: (tx: PlTransaction, childRefs: ReadonlyMap<string, AnyResourceRef>) => ResourceRef;\n  /** Hashes of direct child nodes this node depends on */\n  childHashes: string[];\n}\n\n// ─── Hash computation helpers ────────────────────────────────────────────────\n\nfunction getSourceCode(name: string, sources: Record<string, string>, sourceHash: string): string {\n  return notEmpty(\n    sources[sourceHash],\n    `trying to get \"${name}\" source: sources map doesn't contain source hash ${sourceHash}`,\n  );\n}\n\n/**\n * Bottom-up hash composition: each node hashes its OWN content + child hash STRINGS.\n * This means each unique node is hashed exactly once → O(n) instead of O(n * depth).\n */\n\n// V2 leaf hashes (libs, software — no children)\n\nfunction hashLibV2(lib: TemplateLibData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.src)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV2(sw: TemplateSoftwareData): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.src)\n    .digest(\"hex\");\n}\n\n// V3 leaf hashes — use sourceHash directly instead of resolving source content\n\nfunction hashLibV3(lib: TemplateLibDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateLibV1.type.name)\n    .update(PlTemplateLibV1.type.version)\n    .update(lib.name)\n    .update(lib.version)\n    .update(lib.sourceHash)\n    .digest(\"hex\");\n}\n\nfunction hashSoftwareV3(sw: TemplateSoftwareDataV3): string {\n  return createHash(\"sha256\")\n    .update(PlTemplateSoftwareV1.type.name)\n    .update(PlTemplateSoftwareV1.type.version)\n    .update(sw.name)\n    .update(sw.version)\n    .update(sw.sourceHash)\n    .digest(\"hex\");\n}\n\n// ─── Tree flattening ─────────────────────────────────────────────────────────\n\nfunction flattenV2Tree(data: TemplateData): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n\n  function processLib(lib: TemplateLibData): string {\n    const hash = hashLibV2(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(PlTemplateLibV1.fromV2Data(lib).data),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareData): string {\n    const hash = hashSoftwareV2(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV2Data(sw);\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateData): string {\n    // Process children first (bottom-up) — their hashes are computed before ours\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content)\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.src);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV2Data(tpl).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV2Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data);\n  return nodes;\n}\n\nfunction flattenV3Tree(data: CompiledTemplateV3): CacheableNode[] {\n  const nodes: CacheableNode[] = [];\n  const seen = new Set<string>();\n  const sources = data.hashToSource;\n\n  function processLib(lib: TemplateLibDataV3): string {\n    const hash = hashLibV3(lib);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) =>\n          tx.createValue(\n            PlTemplateLibV1.type,\n            JSON.stringify(\n              PlTemplateLibV1.fromV3Data(lib, getSourceCode(lib.name, sources, lib.sourceHash))\n                .data,\n            ),\n          ),\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processSoftware(sw: TemplateSoftwareDataV3): string {\n    const hash = hashSoftwareV3(sw);\n    if (!seen.has(hash)) {\n      seen.add(hash);\n      nodes.push({\n        hash,\n        create: (tx) => {\n          const swData = PlTemplateSoftwareV1.fromV3Data(\n            sw,\n            getSourceCode(sw.name, sources, sw.sourceHash),\n          );\n          const ref = tx.createStruct(PlTemplateSoftwareV1.type, swData.data);\n          tx.setKValue(ref, PlTemplateSoftwareV1.metaNameKey, JSON.stringify(swData.name));\n          tx.lock(ref);\n          return ref;\n        },\n        childHashes: [],\n      });\n    }\n    return hash;\n  }\n\n  function processTemplate(tpl: TemplateDataV3): string {\n    // Process children first (bottom-up)\n    const childHashes: string[] = [];\n    const children: { fieldName: string; hash: string }[] = [];\n\n    for (const [libId, lib] of Object.entries(tpl.libs ?? {})) {\n      const h = processLib(lib);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.libPrefix}/${libId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.software ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [swId, sw] of Object.entries(tpl.assets ?? {})) {\n      const h = processSoftware(sw);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.softPrefix}/${swId}`, hash: h });\n    }\n    for (const [tplId, sub] of Object.entries(tpl.templates ?? {})) {\n      const h = processTemplate(sub);\n      childHashes.push(h);\n      children.push({ fieldName: `${PlTemplateV1.tplPrefix}/${tplId}`, hash: h });\n    }\n\n    // Compose hash from own content + child hash strings (NOT child content).\n    // Uses sourceHash directly — it already uniquely identifies the source.\n    const h = createHash(\"sha256\")\n      .update(PlTemplateV1.type.name)\n      .update(PlTemplateV1.type.version)\n      .update(tpl.hashOverride ?? \"no-override\")\n      .update(tpl.name)\n      .update(tpl.version)\n      .update(tpl.sourceHash);\n    for (const child of children) {\n      h.update(\"child:\" + child.fieldName + \":\" + child.hash);\n    }\n    const hash = h.digest(\"hex\");\n\n    if (seen.has(hash)) return hash;\n    seen.add(hash);\n    nodes.push({\n      hash,\n      create: (tx, childRefs) => {\n        const sourceCode = getSourceCode(tpl.name, sources, tpl.sourceHash);\n        const tplRef = tx.createStruct(\n          PlTemplateV1.type,\n          JSON.stringify(PlTemplateV1.fromV3Data(tpl, sourceCode).data),\n        );\n        for (const child of children) {\n          const fld = field(tplRef, child.fieldName);\n          tx.createField(fld, \"Input\");\n          tx.setField(fld, notEmpty(childRefs.get(child.hash), `missing child ref ${child.hash}`));\n        }\n        tx.lock(tplRef);\n\n        if (!tpl.hashOverride) return tplRef;\n\n        const overrideRef = tx.createStruct(\n          PlTemplateOverrideV1.type,\n          JSON.stringify(PlTemplateOverrideV1.fromV3Data(tpl)),\n        );\n        const overrideFld = PlTemplateOverrideV1.tplField(overrideRef);\n        tx.createField(overrideFld, \"Service\");\n        tx.setField(overrideFld, tplRef);\n        tx.lock(overrideRef);\n        return overrideRef;\n      },\n      childHashes,\n    });\n\n    return hash;\n  }\n\n  processTemplate(data.template);\n  return nodes;\n}\n\n/** Flatten template tree into a topologically ordered list of cacheable nodes (leaves first). */\nexport function flattenTemplateTree(data: TemplateData | CompiledTemplateV3): CacheableNode[] {\n  if (data.type === \"pl.tengo-template.v2\") {\n    return flattenV2Tree(data);\n  } else {\n    return flattenV3Tree(data);\n  }\n}\n\n// ─── Cache operations ────────────────────────────────────────────────────────\n\n/** In-memory cache for the TemplateCache SignedResourceId per PlClient instance. */\nconst cacheRidMap = new WeakMap<PlClient, SignedResourceId>();\n\n/** Clear the in-memory cacheRid entry (call on errors referencing the cache resource). */\nexport function invalidateTemplateCacheId(pl: PlClient): void {\n  cacheRidMap.delete(pl);\n}\n\n/** Find or create the TemplateCache/1 resource on user root. */\nexport async function getOrCreateTemplateCache(pl: PlClient): Promise<SignedResourceId> {\n  // Check in-memory cache first (0ms after first call)\n  const cached = cacheRidMap.get(pl);\n  if (cached !== undefined) return cached;\n\n  // Try read-only check\n  const existing = await pl.withReadTx(\"templateCache:check\", async (tx) => {\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    return fd ? ensureSignedResourceIdNotNull(fd.value) : undefined;\n  });\n  if (existing) {\n    cacheRidMap.set(pl, existing);\n    return existing;\n  }\n\n  const result = await pl.withWriteTx(\"templateCache:init\", async (tx) => {\n    // Double-check inside write tx (another instance may have created it)\n    const fd = await tx.getFieldIfExists(field(pl.clientRoot, TemplateCacheFieldName));\n    if (fd) return ensureSignedResourceIdNotNull(fd.value);\n\n    const cache = tx.createStruct(TemplateCacheType);\n    tx.createField(field(pl.clientRoot, TemplateCacheFieldName), \"Dynamic\", cache);\n    tx.lock(cache);\n    await tx.commit();\n    return await cache.globalId;\n  });\n  cacheRidMap.set(pl, result);\n  return result;\n}\n\n/** Remove the template cache from user root. */\nexport async function dropTemplateCache(pl: PlClient): Promise<void> {\n  await pl.withWriteTx(\"templateCache:drop\", async (tx) => {\n    const cacheField = field(pl.clientRoot, TemplateCacheFieldName);\n    const fd = await tx.getFieldIfExists(cacheField);\n    if (fd) {\n      tx.removeField(cacheField);\n      await tx.commit();\n    }\n  });\n  invalidateTemplateCacheId(pl);\n}\n\n// ─── GC ──────────────────────────────────────────────────────────────────────\n\n/**\n * Run count-based garbage collection on the template cache.\n * Evicts least-recently-used entries when the cache exceeds maxEntries.\n * Always resets the access counter to 0.\n *\n * @internal exported for testing (maxEntries parameter allows low thresholds in tests)\n * @returns true if entries were evicted\n */\nexport async function runGc(\n  pl: PlClient,\n  cacheRid: SignedResourceId,\n  maxEntries: number = GC_MAX_ENTRIES,\n): Promise<boolean> {\n  return await pl.withWriteTx(\"templateCache:gc\", async (tx) => {\n    const kvs = await tx.listKeyValuesString(cacheRid);\n    const entries: { hash: string; timestamp: number }[] = [];\n    for (const { key, value } of kvs) {\n      if (!key.startsWith(ACCESS_KEY_PREFIX)) continue;\n      entries.push({\n        hash: key.slice(ACCESS_KEY_PREFIX.length),\n        timestamp: parseInt(value, 10),\n      });\n    }\n\n    // Always reset counter\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, \"0\");\n\n    if (entries.length <= maxEntries) {\n      await tx.commit();\n      return false;\n    }\n\n    // Sort oldest first, evict until under limit\n    entries.sort((a, b) => a.timestamp - b.timestamp);\n    const toEvict = entries.length - maxEntries;\n    for (let i = 0; i < toEvict; i++) {\n      tx.removeField(field(cacheRid, entries[i].hash));\n      tx.deleteKValue(cacheRid, ACCESS_KEY_PREFIX + entries[i].hash);\n    }\n\n    await tx.commit();\n    return true;\n  });\n}\n\n// ─── Batched materialization ─────────────────────────────────────────────────\n\n/** Create a batch of cache nodes in the current transaction. */\nfunction createBatchNodes(\n  tx: PlTransaction,\n  cacheRid: SignedResourceId,\n  batch: CacheableNode[],\n  resolvedIds: ReadonlyMap<string, SignedResourceId>,\n  newRefs: Map<string, ResourceRef>,\n  now: string,\n): void {\n  for (const node of batch) {\n    const childRefs = new Map<string, AnyResourceRef>();\n    for (const ch of node.childHashes) {\n      const resolved = resolvedIds.get(ch) ?? newRefs.get(ch);\n      if (resolved === undefined) {\n        throw new Error(`BUG: child ${ch} not resolved`);\n      }\n      childRefs.set(ch, resolved);\n    }\n    const ref = node.create(tx, childRefs);\n    newRefs.set(node.hash, ref);\n    tx.createField(field(cacheRid, node.hash), \"Dynamic\", ref);\n    tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + node.hash, now);\n  }\n}\n\n/**\n * Materialize a template tree via the cache using \"probe all + batched creation\".\n *\n * Phase 1 (single write tx):\n *   - Check existence of ALL hashes in one roundtrip\n *   - Happy path: if root cached, update access tracking and return\n *   - Otherwise: fetch ResourceIds for all cache hits, create first batch of missing nodes\n *\n * Phase 2..N (one write tx per batch):\n *   - Create remaining missing nodes in BATCH_SIZE chunks\n *\n * @returns root SignedResourceId and current access count (for GC decision)\n */\nasync function materialize(\n  pl: PlClient,\n  cacheRid: SignedResourceId,\n  rootHash: string,\n  nodes: CacheableNode[],\n  stat: TemplateCacheStat,\n): Promise<{ rootId: SignedResourceId; accessCount: number }> {\n  const allHashes = nodes.map((n) => n.hash);\n  const resolvedIds = new Map<string, SignedResourceId>();\n\n  // Phase 1: probe all + first batch\n  const phase1 = await pl.withWriteTx(\"templateCache:materialize\", async (tx) => {\n    // 1 roundtrip: check all hashes + read access count\n    const [exists, countStr] = await Promise.all([\n      Promise.all(allHashes.map((h) => tx.fieldExists(field(cacheRid, h)))),\n      tx.getKValueStringIfExists(cacheRid, ACCESS_COUNT_KEY),\n    ]);\n\n    const prevCount = countStr ? parseInt(countStr, 10) : 0;\n    const newCount = prevCount + 1;\n    const now = Date.now().toString();\n    const rootIdx = allHashes.length - 1;\n\n    // Happy path: root already cached\n    if (exists[rootIdx]) {\n      const rootFd = await tx.getField(field(cacheRid, rootHash));\n      const rootRid = ensureSignedResourceIdNotNull(rootFd.value);\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + rootHash, now);\n      tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n      await tx.commit();\n      stat.happyPath = true;\n      stat.cacheHits = stat.totalNodes;\n      stat.batchCount = 1;\n      return { done: true as const, rootId: rootRid, accessCount: newCount };\n    }\n\n    // Fetch ResourceIds for all cache hits (1 roundtrip)\n    const hitIndices: number[] = [];\n    for (let i = 0; i < allHashes.length; i++) {\n      if (exists[i]) hitIndices.push(i);\n    }\n\n    if (hitIndices.length > 0) {\n      const hitFields = await Promise.all(\n        hitIndices.map((i) => tx.getField(field(cacheRid, allHashes[i]))),\n      );\n      for (let j = 0; j < hitIndices.length; j++) {\n        resolvedIds.set(\n          allHashes[hitIndices[j]],\n          ensureSignedResourceIdNotNull(hitFields[j].value),\n        );\n      }\n    }\n    stat.cacheHits = hitIndices.length;\n\n    // Missing nodes (topo order preserved from flatten)\n    const missing = nodes.filter((n) => !resolvedIds.has(n.hash));\n    stat.cacheMisses = missing.length;\n\n    // Create first batch of missing nodes\n    const firstBatch = missing.slice(0, BATCH_SIZE);\n    const newRefs = new Map<string, ResourceRef>();\n    createBatchNodes(tx, cacheRid, firstBatch, resolvedIds, newRefs, now);\n\n    // Update access tracking for cache hits\n    for (const i of hitIndices) {\n      tx.setKValue(cacheRid, ACCESS_KEY_PREFIX + allHashes[i], now);\n    }\n    tx.setKValue(cacheRid, ACCESS_COUNT_KEY, newCount.toString());\n\n    await tx.commit();\n\n    // Resolve new refs to global IDs (after commit)\n    for (const [hash, ref] of newRefs) {\n      resolvedIds.set(hash, await toGlobalResourceId(ref));\n    }\n\n    return {\n      done: false as const,\n      remaining: missing.slice(BATCH_SIZE),\n      accessCount: newCount,\n    };\n  });\n\n  if (phase1.done) {\n    return { rootId: phase1.rootId, accessCount: phase1.accessCount };\n  }\n\n  stat.batchCount = 1;\n\n  // Phase 2+: remaining batches\n  const { remaining } = phase1;\n  for (let i = 0; i < remaining.length; i += BATCH_SIZE) {\n    const batch = remaining.slice(i, i + BATCH_SIZE);\n    stat.batchCount++;\n\n    await pl.withWriteTx(\"templateCache:create\", async (tx) => {\n      const newRefs = new Map<string, ResourceRef>();\n      const now = Date.now().toString();\n      createBatchNodes(tx, cacheRid, batch, resolvedIds, newRefs, now);\n      await tx.commit();\n\n      for (const [hash, ref] of newRefs) {\n        resolvedIds.set(hash, await toGlobalResourceId(ref));\n      }\n    });\n  }\n\n  const rootId = resolvedIds.get(rootHash);\n  if (!rootId) throw new Error(\"BUG: root hash not resolved after all batches\");\n  return { rootId, accessCount: phase1.accessCount };\n}\n\n/**\n * Materialize a template tree via the cache.\n * Manages its own transactions internally — do NOT call inside an existing tx.\n *\n * @returns concrete SignedResourceId of the root template\n */\nexport async function loadTemplateCached(\n  pl: PlClient,\n  spec: TemplateSpecPrepared,\n  options?: { cacheResourceId?: SignedResourceId },\n): Promise<SignedResourceId> {\n  const stat = initialStat();\n  const t0 = performance.now();\n\n  try {\n    // Parse to data if needed\n    let tplData: TemplateData | CompiledTemplateV3;\n    switch (spec.type) {\n      case \"explicit\":\n        tplData = parseTemplate(spec.content);\n        break;\n      case \"prepared\":\n        tplData = spec.data;\n        break;\n      case \"cached\":\n        return spec.resourceId;\n      case \"from-registry\":\n        throw new Error(\n          \"loadTemplateCached does not support from-registry specs; use loadTemplate instead\",\n        );\n      default: {\n        const _: never = spec;\n        throw new Error(`unexpected spec type: ${(_ as any).type}`);\n      }\n    }\n\n    stat.templateFormat = tplData.type;\n\n    // Flatten to ordered nodes\n    const tFlatten = performance.now();\n    const nodes = flattenTemplateTree(tplData);\n    stat.flattenMs = performance.now() - tFlatten;\n    if (nodes.length === 0) throw new Error(\"template tree produced no nodes\");\n\n    stat.totalNodes = nodes.length;\n    const rootHash = nodes[nodes.length - 1].hash;\n\n    // Resolve or create cache resource\n    const tCacheInit = performance.now();\n    const cacheRid = options?.cacheResourceId ?? (await getOrCreateTemplateCache(pl));\n    stat.cacheInitMs = performance.now() - tCacheInit;\n\n    // Retry loop: if a write tx fails (e.g. concurrent GC invalidated a cached resource),\n    // restart materialization from scratch.\n    const MAX_RETRIES = 3;\n    for (let attempt = 0; attempt < MAX_RETRIES; attempt++) {\n      try {\n        const tMat = performance.now();\n        const result = await materialize(pl, cacheRid, rootHash, nodes, stat);\n        stat.materializeMs = performance.now() - tMat;\n        stat.retries = attempt;\n\n        // GC in separate tx if access count exceeded threshold\n        if (result.accessCount >= GC_ACCESS_THRESHOLD) {\n          await runGc(pl, cacheRid);\n          stat.gcTriggered = true;\n        }\n\n        return result.rootId;\n      } catch (e) {\n        if (attempt === MAX_RETRIES - 1) throw e;\n        // Retry from scratch — previous batch results may reference GC'd resources\n        stat.cacheHits = 0;\n        stat.cacheMisses = 0;\n      }\n    }\n\n    throw new Error(\"BUG: unreachable\");\n  } finally {\n    stat.totalMs = performance.now() - t0;\n    if (getDebugFlags().logTemplateCacheStat) {\n      console.log(`[templateCache] ${JSON.stringify(stat)}`);\n    }\n  }\n}\n\n// ─── Caller helper ───────────────────────────────────────────────────────────\n\n/**\n * Pre-materialize a block pack's template via cache.\n * Returns a copy of the spec with the template replaced by a cached reference.\n * If the template is already cached, returns the spec unchanged.\n */\nexport async function cacheBlockPackTemplate(\n  pl: PlClient,\n  spec: BlockPackSpecPrepared,\n  options?: { cacheResourceId?: SignedResourceId },\n): Promise<BlockPackSpecPrepared> {\n  if (spec.template.type === \"cached\") return spec;\n\n  const resourceId = await loadTemplateCached(pl, spec.template, options);\n  return {\n    ...spec,\n    template: { type: \"cached\", resourceId },\n  };\n}\n"],"mappings":";;;;;;AAmCA,MAAa,oBAAoB,aAAa,iBAAiB,IAAI;AAEnE,MAAa,yBAAyB;AACtC,MAAM,aAAa;;AAEnB,MAAa,sBAAsB;;AAEnC,MAAa,iBAAiB;;AAE9B,MAAa,mBAAmB;;AAEhC,MAAa,oBAAoB;AAmBjC,SAAS,cAAiC;AACxC,QAAO;EACL,SAAS;EACT,WAAW;EACX,aAAa;EACb,eAAe;EACf,YAAY;EACZ,WAAW;EACX,aAAa;EACb,YAAY;EACZ,WAAW;EACX,aAAa;EACb,SAAS;EACT,gBAAgB;EACjB;;AAiBH,SAAS,cAAc,MAAc,SAAiC,YAA4B;AAChG,QAAO,SACL,QAAQ,aACR,kBAAkB,KAAK,oDAAoD,aAC5E;;;;;;AAUH,SAAS,UAAU,KAA8B;AAC/C,QAAO,WAAW,SAAS,CACxB,OAAO,gBAAgB,KAAK,KAAK,CACjC,OAAO,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI,CACf,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAkC;AACxD,QAAO,WAAW,SAAS,CACxB,OAAO,qBAAqB,KAAK,KAAK,CACtC,OAAO,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,IAAI,CACd,OAAO,MAAM;;AAKlB,SAAS,UAAU,KAAgC;AACjD,QAAO,WAAW,SAAS,CACxB,OAAO,gBAAgB,KAAK,KAAK,CACjC,OAAO,gBAAgB,KAAK,QAAQ,CACpC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW,CACtB,OAAO,MAAM;;AAGlB,SAAS,eAAe,IAAoC;AAC1D,QAAO,WAAW,SAAS,CACxB,OAAO,qBAAqB,KAAK,KAAK,CACtC,OAAO,qBAAqB,KAAK,QAAQ,CACzC,OAAO,GAAG,KAAK,CACf,OAAO,GAAG,QAAQ,CAClB,OAAO,GAAG,WAAW,CACrB,OAAO,MAAM;;AAKlB,SAAS,cAAc,MAAqC;CAC1D,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAE9B,SAAS,WAAW,KAA8B;EAChD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACD,gBAAgB,MAChB,KAAK,UAAU,gBAAgB,WAAW,IAAI,CAAC,KAAK,CACrD;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAkC;EACzD,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAAS,qBAAqB,WAAW,GAAG;KAClD,MAAM,MAAM,GAAG,aAAa,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAK,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA2B;EAElD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAI7E,MAAM,IAAI,WAAW,SAAS,CAC3B,OAAO,aAAa,KAAK,KAAK,CAC9B,OAAO,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,IAAI;AAClB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,SAAS,GAAG,aAChB,aAAa,MACb,KAAK,UAAU,aAAa,WAAW,IAAI,CAAC,KAAK,CAClD;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,KAAK,SAAS,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrB,qBAAqB,MACrB,KAAK,UAAU,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAc,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK;AACrB,QAAO;;AAGT,SAAS,cAAc,MAA2C;CAChE,MAAM,QAAyB,EAAE;CACjC,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,UAAU,KAAK;CAErB,SAAS,WAAW,KAAgC;EAClD,MAAM,OAAO,UAAU,IAAI;AAC3B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OACP,GAAG,YACD,gBAAgB,MAChB,KAAK,UACH,gBAAgB,WAAW,KAAK,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW,CAAC,CAC9E,KACJ,CACF;IACH,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,IAAoC;EAC3D,MAAM,OAAO,eAAe,GAAG;AAC/B,MAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACnB,QAAK,IAAI,KAAK;AACd,SAAM,KAAK;IACT;IACA,SAAS,OAAO;KACd,MAAM,SAAS,qBAAqB,WAClC,IACA,cAAc,GAAG,MAAM,SAAS,GAAG,WAAW,CAC/C;KACD,MAAM,MAAM,GAAG,aAAa,qBAAqB,MAAM,OAAO,KAAK;AACnE,QAAG,UAAU,KAAK,qBAAqB,aAAa,KAAK,UAAU,OAAO,KAAK,CAAC;AAChF,QAAG,KAAK,IAAI;AACZ,YAAO;;IAET,aAAa,EAAE;IAChB,CAAC;;AAEJ,SAAO;;CAGT,SAAS,gBAAgB,KAA6B;EAEpD,MAAM,cAAwB,EAAE;EAChC,MAAM,WAAkD,EAAE;AAE1D,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,WAAW,IAAI;AACzB,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE;GAC3D,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE;GACzD,MAAM,IAAI,gBAAgB,GAAG;AAC7B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,WAAW,GAAG;IAAQ,MAAM;IAAG,CAAC;;AAE7E,OAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,IAAI,aAAa,EAAE,CAAC,EAAE;GAC9D,MAAM,IAAI,gBAAgB,IAAI;AAC9B,eAAY,KAAK,EAAE;AACnB,YAAS,KAAK;IAAE,WAAW,GAAG,aAAa,UAAU,GAAG;IAAS,MAAM;IAAG,CAAC;;EAK7E,MAAM,IAAI,WAAW,SAAS,CAC3B,OAAO,aAAa,KAAK,KAAK,CAC9B,OAAO,aAAa,KAAK,QAAQ,CACjC,OAAO,IAAI,gBAAgB,cAAc,CACzC,OAAO,IAAI,KAAK,CAChB,OAAO,IAAI,QAAQ,CACnB,OAAO,IAAI,WAAW;AACzB,OAAK,MAAM,SAAS,SAClB,GAAE,OAAO,WAAW,MAAM,YAAY,MAAM,MAAM,KAAK;EAEzD,MAAM,OAAO,EAAE,OAAO,MAAM;AAE5B,MAAI,KAAK,IAAI,KAAK,CAAE,QAAO;AAC3B,OAAK,IAAI,KAAK;AACd,QAAM,KAAK;GACT;GACA,SAAS,IAAI,cAAc;IACzB,MAAM,aAAa,cAAc,IAAI,MAAM,SAAS,IAAI,WAAW;IACnE,MAAM,SAAS,GAAG,aAChB,aAAa,MACb,KAAK,UAAU,aAAa,WAAW,KAAK,WAAW,CAAC,KAAK,CAC9D;AACD,SAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;AAC1C,QAAG,YAAY,KAAK,QAAQ;AAC5B,QAAG,SAAS,KAAK,SAAS,UAAU,IAAI,MAAM,KAAK,EAAE,qBAAqB,MAAM,OAAO,CAAC;;AAE1F,OAAG,KAAK,OAAO;AAEf,QAAI,CAAC,IAAI,aAAc,QAAO;IAE9B,MAAM,cAAc,GAAG,aACrB,qBAAqB,MACrB,KAAK,UAAU,qBAAqB,WAAW,IAAI,CAAC,CACrD;IACD,MAAM,cAAc,qBAAqB,SAAS,YAAY;AAC9D,OAAG,YAAY,aAAa,UAAU;AACtC,OAAG,SAAS,aAAa,OAAO;AAChC,OAAG,KAAK,YAAY;AACpB,WAAO;;GAET;GACD,CAAC;AAEF,SAAO;;AAGT,iBAAgB,KAAK,SAAS;AAC9B,QAAO;;;AAIT,SAAgB,oBAAoB,MAA0D;AAC5F,KAAI,KAAK,SAAS,uBAChB,QAAO,cAAc,KAAK;KAE1B,QAAO,cAAc,KAAK;;;AAO9B,MAAM,8BAAc,IAAI,SAAqC;;AAG7D,SAAgB,0BAA0B,IAAoB;AAC5D,aAAY,OAAO,GAAG;;;AAIxB,eAAsB,yBAAyB,IAAyC;CAEtF,MAAM,SAAS,YAAY,IAAI,GAAG;AAClC,KAAI,WAAW,KAAA,EAAW,QAAO;CAGjC,MAAM,WAAW,MAAM,GAAG,WAAW,uBAAuB,OAAO,OAAO;EACxE,MAAM,KAAK,MAAM,GAAG,iBAAiB,MAAM,GAAG,YAAY,uBAAuB,CAAC;AAClF,SAAO,KAAK,8BAA8B,GAAG,MAAM,GAAG,KAAA;GACtD;AACF,KAAI,UAAU;AACZ,cAAY,IAAI,IAAI,SAAS;AAC7B,SAAO;;CAGT,MAAM,SAAS,MAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EAEtE,MAAM,KAAK,MAAM,GAAG,iBAAiB,MAAM,GAAG,YAAY,uBAAuB,CAAC;AAClF,MAAI,GAAI,QAAO,8BAA8B,GAAG,MAAM;EAEtD,MAAM,QAAQ,GAAG,aAAa,kBAAkB;AAChD,KAAG,YAAY,MAAM,GAAG,YAAY,uBAAuB,EAAE,WAAW,MAAM;AAC9E,KAAG,KAAK,MAAM;AACd,QAAM,GAAG,QAAQ;AACjB,SAAO,MAAM,MAAM;GACnB;AACF,aAAY,IAAI,IAAI,OAAO;AAC3B,QAAO;;;AAIT,eAAsB,kBAAkB,IAA6B;AACnE,OAAM,GAAG,YAAY,sBAAsB,OAAO,OAAO;EACvD,MAAM,aAAa,MAAM,GAAG,YAAY,uBAAuB;AAE/D,MADW,MAAM,GAAG,iBAAiB,WAAW,EACxC;AACN,MAAG,YAAY,WAAW;AAC1B,SAAM,GAAG,QAAQ;;GAEnB;AACF,2BAA0B,GAAG;;;;;;;;;;AAa/B,eAAsB,MACpB,IACA,UACA,aAAqB,gBACH;AAClB,QAAO,MAAM,GAAG,YAAY,oBAAoB,OAAO,OAAO;EAC5D,MAAM,MAAM,MAAM,GAAG,oBAAoB,SAAS;EAClD,MAAM,UAAiD,EAAE;AACzD,OAAK,MAAM,EAAE,KAAK,WAAW,KAAK;AAChC,OAAI,CAAC,IAAI,WAAA,UAA6B,CAAE;AACxC,WAAQ,KAAK;IACX,MAAM,IAAI,MAAM,EAAyB;IACzC,WAAW,SAAS,OAAO,GAAG;IAC/B,CAAC;;AAIJ,KAAG,UAAU,UAAU,kBAAkB,IAAI;AAE7C,MAAI,QAAQ,UAAU,YAAY;AAChC,SAAM,GAAG,QAAQ;AACjB,UAAO;;AAIT,UAAQ,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,UAAU;EACjD,MAAM,UAAU,QAAQ,SAAS;AACjC,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,MAAG,YAAY,MAAM,UAAU,QAAQ,GAAG,KAAK,CAAC;AAChD,MAAG,aAAa,UAAU,oBAAoB,QAAQ,GAAG,KAAK;;AAGhE,QAAM,GAAG,QAAQ;AACjB,SAAO;GACP;;;AAMJ,SAAS,iBACP,IACA,UACA,OACA,aACA,SACA,KACM;AACN,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,4BAAY,IAAI,KAA6B;AACnD,OAAK,MAAM,MAAM,KAAK,aAAa;GACjC,MAAM,WAAW,YAAY,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG;AACvD,OAAI,aAAa,KAAA,EACf,OAAM,IAAI,MAAM,cAAc,GAAG,eAAe;AAElD,aAAU,IAAI,IAAI,SAAS;;EAE7B,MAAM,MAAM,KAAK,OAAO,IAAI,UAAU;AACtC,UAAQ,IAAI,KAAK,MAAM,IAAI;AAC3B,KAAG,YAAY,MAAM,UAAU,KAAK,KAAK,EAAE,WAAW,IAAI;AAC1D,KAAG,UAAU,UAAU,oBAAoB,KAAK,MAAM,IAAI;;;;;;;;;;;;;;;;AAiB9D,eAAe,YACb,IACA,UACA,UACA,OACA,MAC4D;CAC5D,MAAM,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK;CAC1C,MAAM,8BAAc,IAAI,KAA+B;CAGvD,MAAM,SAAS,MAAM,GAAG,YAAY,6BAA6B,OAAO,OAAO;EAE7E,MAAM,CAAC,QAAQ,YAAY,MAAM,QAAQ,IAAI,CAC3C,QAAQ,IAAI,UAAU,KAAK,MAAM,GAAG,YAAY,MAAM,UAAU,EAAE,CAAC,CAAC,CAAC,EACrE,GAAG,wBAAwB,UAAU,iBAAiB,CACvD,CAAC;EAGF,MAAM,YADY,WAAW,SAAS,UAAU,GAAG,GAAG,KACzB;EAC7B,MAAM,MAAM,KAAK,KAAK,CAAC,UAAU;AAIjC,MAAI,OAHY,UAAU,SAAS,IAGd;GAEnB,MAAM,UAAU,+BADD,MAAM,GAAG,SAAS,MAAM,UAAU,SAAS,CAAC,EACN,MAAM;AAC3D,MAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI;AACzD,MAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAC7D,SAAM,GAAG,QAAQ;AACjB,QAAK,YAAY;AACjB,QAAK,YAAY,KAAK;AACtB,QAAK,aAAa;AAClB,UAAO;IAAE,MAAM;IAAe,QAAQ;IAAS,aAAa;IAAU;;EAIxE,MAAM,aAAuB,EAAE;AAC/B,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,IACpC,KAAI,OAAO,GAAI,YAAW,KAAK,EAAE;AAGnC,MAAI,WAAW,SAAS,GAAG;GACzB,MAAM,YAAY,MAAM,QAAQ,IAC9B,WAAW,KAAK,MAAM,GAAG,SAAS,MAAM,UAAU,UAAU,GAAG,CAAC,CAAC,CAClE;AACD,QAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IACrC,aAAY,IACV,UAAU,WAAW,KACrB,8BAA8B,UAAU,GAAG,MAAM,CAClD;;AAGL,OAAK,YAAY,WAAW;EAG5B,MAAM,UAAU,MAAM,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE,KAAK,CAAC;AAC7D,OAAK,cAAc,QAAQ;EAG3B,MAAM,aAAa,QAAQ,MAAM,GAAG,WAAW;EAC/C,MAAM,0BAAU,IAAI,KAA0B;AAC9C,mBAAiB,IAAI,UAAU,YAAY,aAAa,SAAS,IAAI;AAGrE,OAAK,MAAM,KAAK,WACd,IAAG,UAAU,UAAU,oBAAoB,UAAU,IAAI,IAAI;AAE/D,KAAG,UAAU,UAAU,kBAAkB,SAAS,UAAU,CAAC;AAE7D,QAAM,GAAG,QAAQ;AAGjB,OAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,MAAM,mBAAmB,IAAI,CAAC;AAGtD,SAAO;GACL,MAAM;GACN,WAAW,QAAQ,MAAM,WAAW;GACpC,aAAa;GACd;GACD;AAEF,KAAI,OAAO,KACT,QAAO;EAAE,QAAQ,OAAO;EAAQ,aAAa,OAAO;EAAa;AAGnE,MAAK,aAAa;CAGlB,MAAM,EAAE,cAAc;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY;EACrD,MAAM,QAAQ,UAAU,MAAM,GAAG,IAAI,WAAW;AAChD,OAAK;AAEL,QAAM,GAAG,YAAY,wBAAwB,OAAO,OAAO;GACzD,MAAM,0BAAU,IAAI,KAA0B;AAE9C,oBAAiB,IAAI,UAAU,OAAO,aAAa,SADvC,KAAK,KAAK,CAAC,UAAU,CAC+B;AAChE,SAAM,GAAG,QAAQ;AAEjB,QAAK,MAAM,CAAC,MAAM,QAAQ,QACxB,aAAY,IAAI,MAAM,MAAM,mBAAmB,IAAI,CAAC;IAEtD;;CAGJ,MAAM,SAAS,YAAY,IAAI,SAAS;AACxC,KAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,gDAAgD;AAC7E,QAAO;EAAE;EAAQ,aAAa,OAAO;EAAa;;;;;;;;AASpD,eAAsB,mBACpB,IACA,MACA,SAC2B;CAC3B,MAAM,OAAO,aAAa;CAC1B,MAAM,KAAK,YAAY,KAAK;AAE5B,KAAI;EAEF,IAAI;AACJ,UAAQ,KAAK,MAAb;GACE,KAAK;AACH,cAAU,cAAc,KAAK,QAAQ;AACrC;GACF,KAAK;AACH,cAAU,KAAK;AACf;GACF,KAAK,SACH,QAAO,KAAK;GACd,KAAK,gBACH,OAAM,IAAI,MACR,oFACD;GACH,QAEE,OAAM,IAAI,MAAM,yBADC,KACmC,OAAO;;AAI/D,OAAK,iBAAiB,QAAQ;EAG9B,MAAM,WAAW,YAAY,KAAK;EAClC,MAAM,QAAQ,oBAAoB,QAAQ;AAC1C,OAAK,YAAY,YAAY,KAAK,GAAG;AACrC,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,kCAAkC;AAE1E,OAAK,aAAa,MAAM;EACxB,MAAM,WAAW,MAAM,MAAM,SAAS,GAAG;EAGzC,MAAM,aAAa,YAAY,KAAK;EACpC,MAAM,WAAW,SAAS,mBAAoB,MAAM,yBAAyB,GAAG;AAChF,OAAK,cAAc,YAAY,KAAK,GAAG;EAIvC,MAAM,cAAc;AACpB,OAAK,IAAI,UAAU,GAAG,UAAU,aAAa,UAC3C,KAAI;GACF,MAAM,OAAO,YAAY,KAAK;GAC9B,MAAM,SAAS,MAAM,YAAY,IAAI,UAAU,UAAU,OAAO,KAAK;AACrE,QAAK,gBAAgB,YAAY,KAAK,GAAG;AACzC,QAAK,UAAU;AAGf,OAAI,OAAO,eAAA,IAAoC;AAC7C,UAAM,MAAM,IAAI,SAAS;AACzB,SAAK,cAAc;;AAGrB,UAAO,OAAO;WACP,GAAG;AACV,OAAI,YAAY,cAAc,EAAG,OAAM;AAEvC,QAAK,YAAY;AACjB,QAAK,cAAc;;AAIvB,QAAM,IAAI,MAAM,mBAAmB;WAC3B;AACR,OAAK,UAAU,YAAY,KAAK,GAAG;AACnC,MAAI,eAAe,CAAC,qBAClB,SAAQ,IAAI,mBAAmB,KAAK,UAAU,KAAK,GAAG;;;;;;;;AAY5D,eAAsB,uBACpB,IACA,MACA,SACgC;AAChC,KAAI,KAAK,SAAS,SAAS,SAAU,QAAO;CAE5C,MAAM,aAAa,MAAM,mBAAmB,IAAI,KAAK,UAAU,QAAQ;AACvE,QAAO;EACL,GAAG;EACH,UAAU;GAAE,MAAM;GAAU;GAAY;EACzC"}

package/dist/network_check/template.cjs

@@ -177,7 +177,7 @@ async function downloadFromEveryStorage(logger, pl, lsDriver, ops) {
 		for (const storage of storages) {
 			const result = await chooseFile(lsDriver, storage, ops.nFilesToCheck, ops.minFileSize, ops.maxFileSize, ops.minLsRequests);
 			if (result.file === void 0) {
-				results[storage.name] = {
+				results[storage.id] = {
 					status: "warn",
 					message: `No file between ${ops.minFileSize} and ${ops.maxFileSize} bytes found in storage ${storage.name}, checked ${result.nCheckedFiles} files, did ${result.nLsRequests} ls requests`
 				};
@@ -187,11 +187,11 @@ async function downloadFromEveryStorage(logger, pl, lsDriver, ops) {
 			const outputs = await runTemplate(pl, _platforma_sdk_workflow_tengo.Templates["check_network.create_workdir_from_storage"], true, (tx) => ({ file: tx.createValue(_milaboratories_pl_client.Pl.JsonObject, JSON.stringify(result.file.handle)) }), ["workdirTypeName"]);
 			try {
 				const workdirTypeName = JSON.parse(Buffer.from((await getFieldValue(pl, outputs.workdirTypeName)).data).toString());
-				if (workdirTypeName?.startsWith("WorkingDirectory")) results[storage.name] = {
+				if (workdirTypeName?.startsWith("WorkingDirectory")) results[storage.id] = {
 					status: "ok",
 					message: `Workdir creation succeeded, size of file: ${result.file?.size}, checked ${result.nCheckedFiles} files, did ${result.nLsRequests} ls requests`
 				};
-				else results[storage.name] = {
+				else results[storage.id] = {
 					status: "failed",
 					message: `Workdir creation failed: ${workdirTypeName}, size of file: ${result.file?.size}, checked ${result.nCheckedFiles} files, did ${result.nLsRequests} ls requests`
 				};
@@ -286,11 +286,11 @@ async function runTemplate(client, tpl, ephemeral, inputs, outputs) {
 async function getFieldValue(client, fieldId) {
 	return await (0, _milaboratories_pl_client.poll)(client, async (tx) => {
 		const field = await tx.tx.getField(fieldId);
-		if ((0, _milaboratories_pl_client.isNotNullResourceId)(field.error)) {
+		if ((0, _milaboratories_pl_client.isNotNullSignedResourceId)(field.error)) {
 			const err = await tx.tx.getResourceData(field.error, true);
 			throw new Error(`getFieldValue of "${fieldId.fieldName}" field failed: ${err.data}`);
 		}
-		if ((0, _milaboratories_pl_client.isNullResourceId)(field.value)) throw new _milaboratories_pl_client.ContinuePolling();
+		if ((0, _milaboratories_pl_client.isNullSignedResourceId)(field.value)) throw new _milaboratories_pl_client.ContinuePolling();
 		return await tx.tx.getResourceData(field.value, true);
 	});
 }