@far-world-labs/verblets 0.7.3 → 0.7.4

package/dist/{shared-CHG_x1Br.js → shared-BuJg0Ijm.js}

@@ -21,7 +21,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return Oi;
   },
   get CONTEXT_KINDS() {
-    return Ii;
+    return ki;
   },
   get COST_POSTURE() {
     return Ci;
@@ -42,10 +42,10 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return Ai;
   },
   get DomainEvent() {
-    return k;
+    return A;
   },
   get ENVIRONMENT() {
-    return ki;
+    return Ii;
   },
   get EmbeddingService() {
     return Qn;
@@ -60,7 +60,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return cp;
   },
   get ListStyle() {
-    return ue;
+    return me;
   },
   get ModelService() {
     return Sn;
@@ -198,7 +198,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return Ni;
   },
   get createProgressEmitter() {
-    return I;
+    return k;
   },
   get createTraceCollector() {
     return Vm;
@@ -276,10 +276,10 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return jc;
   },
   get embedStepBack() {
-    return Ic;
+    return kc;
   },
   get embedSubquestions() {
-    return kc;
+    return Ic;
   },
   get embedWarmup() {
     return vc;
@@ -315,13 +315,13 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return Ba;
   },
   get fillMissing() {
-    return Ia;
+    return ka;
   },
   get filter() {
     return Zi;
   },
   get filterAmbiguous() {
-    return ka;
+    return Ia;
   },
   get filterEach() {
     return CS;
@@ -345,7 +345,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return mp;
   },
   get getOptions() {
-    return q;
+    return F;
   },
   get glossary() {
     return ta;
@@ -408,7 +408,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return Ca;
   },
   get nameStep() {
-    return A;
+    return O;
   },
   get normalizeInstruction() {
     return mi;
@@ -435,10 +435,10 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return jo;
   },
   get pFilter() {
-    return IS;
+    return kS;
   },
   get pFind() {
-    return kS;
+    return IS;
   },
   get pGroup() {
     return OS;
@@ -495,7 +495,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return sa;
   },
   get reduce() {
-    return Ie;
+    return ke;
   },
   get reduceEach() {
     return NS;
@@ -543,10 +543,10 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return nc;
   },
   get scopePhase() {
-    return L;
+    return B;
   },
   get score() {
-    return ke;
+    return Ie;
   },
   get scoreChunksByProbes() {
     return Pc;
@@ -684,7 +684,7 @@ const rl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     return oc;
   },
   get version() {
-    return In;
+    return kn;
   },
   get windowFor() {
     return Aa;
@@ -800,7 +800,7 @@ const hl = (e) => {
   number: fl,
   boolean: hl
 };
-function D(e) {
+function q(e) {
   const t = fn[e], n = So[t?.type] ?? String, r = $e[`VERBLETS_FORCE_${e}`];
   if (r !== void 0 && r !== "") {
     const o = n(r);
@@ -823,7 +823,7 @@ async function gl(e) {
     const s = await dt.get(e);
     if (s !== void 0) return n(s);
   }
-  return D(e);
+  return q(e);
 }
 function xo(e) {
   dt = e;
@@ -831,7 +831,7 @@ function xo(e) {
 function yl() {
   return dt;
 }
-const bl = D, wl = D, vl = D;
+const bl = q, wl = q, vl = q;
 function yn() {
   const e = [];
   for (const t of sl)
@@ -848,7 +848,7 @@ function yn() {
 }
 const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  get: D,
+  get: q,
   getAsync: gl,
   getBoolean: vl,
   getNumber: wl,
@@ -856,7 +856,7 @@ const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   getString: bl,
   setRuntimeProvider: xo,
   validate: yn
-}, Symbol.toStringTag, { value: "Module" })), $o = D("VERBLETS_CACHE_TTL"), xl = D("VERBLETS_DISABLE_CACHE") !== !0, Po = D("VERBLETS_DEBUG_PROMPT"), To = D("VERBLETS_DEBUG_REQUEST_IF_CHANGED"), Eo = D("VERBLETS_DEBUG_RESPONSE"), Io = D("VERBLETS_DEBUG_RESPONSE_IF_CHANGED"), $l = (e) => /^(gpt-5|o[34])/i.test(e), ko = (e) => Array.isArray(e) ? e.map((t) => t.type === "image" ? {
+}, Symbol.toStringTag, { value: "Module" })), $o = q("VERBLETS_CACHE_TTL"), xl = q("VERBLETS_DISABLE_CACHE") !== !0, Po = q("VERBLETS_DEBUG_PROMPT"), To = q("VERBLETS_DEBUG_REQUEST_IF_CHANGED"), Eo = q("VERBLETS_DEBUG_RESPONSE"), ko = q("VERBLETS_DEBUG_RESPONSE_IF_CHANGED"), $l = (e) => /^(gpt-5|o[34])/i.test(e), Io = (e) => Array.isArray(e) ? e.map((t) => t.type === "image" ? {
   type: "image_url",
   image_url: {
     url: `data:${t.mediaType};base64,${t.data}`
@@ -876,7 +876,7 @@ const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   };
   d.messages && (d.messages = d.messages.map((y) => ({
     ...y,
-    content: ko(y.content)
+    content: Io(y.content)
   }))), o !== void 0 && (d.max_completion_tokens = o), $l(d.model) || (i !== void 0 && (d.temperature = i), a !== void 0 && (d.top_p = a), c !== void 0 && (d.frequency_penalty = c), l !== void 0 && (d.presence_penalty = l));
   const h = {
     method: "POST",
@@ -891,12 +891,12 @@ const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   buildRequest: Pl,
   parseResponse: Tl,
-  translateContentBlocks: ko
-}, Symbol.toStringTag, { value: "Module" })), Il = (e) => {
+  translateContentBlocks: Io
+}, Symbol.toStringTag, { value: "Module" })), kl = (e) => {
   const t = e.filter((s) => s.role === "system"), n = e.filter((s) => s.role !== "system");
   return { instructions: t.map((s) => s.content).join(`
 `), messages: n };
-}, kl = (e) => e ? e.type === "json_schema" ? {
+}, Il = (e) => e ? e.type === "json_schema" ? {
   text: {
     format: {
       type: "json_schema",
@@ -927,21 +927,21 @@ const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     presence_penalty: y,
     // eslint-disable-line no-unused-vars
     ...b
-  } = r, { instructions: f, messages: g } = Il(o), m = {
+  } = r, { instructions: f, messages: g } = kl(o), m = {
     model: i,
     input: g,
     ...b
   };
-  f && (m.instructions = f), a && (m.max_output_tokens = a), l && (m.tools = l.map((v) => v.type === "function" ? {
+  f && (m.instructions = f), a && (m.max_output_tokens = a), l && (m.tools = l.map((S) => S.type === "function" ? {
     type: "function",
-    name: v.function.name,
-    description: v.function.description,
-    parameters: v.function.parameters,
-    strict: v.function.strict
-  } : v), u && (m.tool_choice = u));
-  const w = kl(c);
+    name: S.function.name,
+    description: S.function.description,
+    parameters: S.function.parameters,
+    strict: S.function.strict
+  } : S), u && (m.tool_choice = u));
+  const w = Il(c);
   Object.assign(m, w);
-  const S = {
+  const v = {
     method: "POST",
     headers: {
       Authorization: `Bearer ${t}`,
@@ -949,7 +949,7 @@ const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     },
     body: JSON.stringify(m)
   };
-  return { url: s, fetchOptions: S };
+  return { url: s, fetchOptions: v };
 }, Ol = (e) => {
   const t = e.output || [], n = t.find((i) => i.type === "message"), r = t.filter((i) => i.type === "function_call");
   let s = "";
@@ -1097,14 +1097,14 @@ const Sl = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
     ...b
   };
   f && (w.system = f), c !== void 0 && (w.temperature = c);
-  const S = Dl(u);
-  if (S) {
-    w.tools = S;
+  const v = Dl(u);
+  if (v) {
+    w.tools = v;
     const x = jl(p);
     x && (w.tool_choice = x);
   }
-  const v = Bl(l);
-  Object.assign(w, v);
+  const S = Bl(l);
+  Object.assign(w, S);
   const P = {
     method: "POST",
     headers: {
@@ -1240,8 +1240,8 @@ const _o = (e) => {
     { once: !0 }
   ), n.signal;
 };
-let kt;
-const Hl = async () => (kt || (kt = await import("node:crypto")), kt), Ql = (e) => {
+let It;
+const Hl = async () => (It || (It = await import("node:crypto")), It), Ql = (e) => {
   if (e !== "sha256")
     throw new Error(`Unsupported algorithm: ${e}`);
   const t = [];
@@ -1360,10 +1360,10 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 45e3,
     vision: !0,
     get apiKey() {
-      return D("OPENAI_API_KEY");
+      return q("OPENAI_API_KEY");
     },
     get apiUrl() {
-      return D("OPENAI_PROXY_URL");
+      return q("OPENAI_PROXY_URL");
     },
     systemPrompt: ae
   },
@@ -1375,10 +1375,10 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 45e3,
     vision: !0,
     get apiKey() {
-      return D("OPENAI_API_KEY");
+      return q("OPENAI_API_KEY");
     },
     get apiUrl() {
-      return D("OPENAI_PROXY_URL");
+      return q("OPENAI_PROXY_URL");
     },
     systemPrompt: ae
   },
@@ -1390,10 +1390,10 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 3e4,
     vision: !0,
     get apiKey() {
-      return D("OPENAI_API_KEY");
+      return q("OPENAI_API_KEY");
     },
     get apiUrl() {
-      return D("OPENAI_PROXY_URL");
+      return q("OPENAI_PROXY_URL");
     },
     systemPrompt: ae
   },
@@ -1406,10 +1406,10 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 12e4,
     vision: !0,
     get apiKey() {
-      return D("OPENAI_API_KEY");
+      return q("OPENAI_API_KEY");
     },
     get apiUrl() {
-      return D("OPENAI_PROXY_URL");
+      return q("OPENAI_PROXY_URL");
     },
     systemPrompt: ae
   },
@@ -1422,7 +1422,7 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 9e4,
     vision: !0,
     get apiKey() {
-      return D("ANTHROPIC_API_KEY");
+      return q("ANTHROPIC_API_KEY");
     },
     get apiUrl() {
       return "https://api.anthropic.com/";
@@ -1437,7 +1437,7 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 45e3,
     vision: !0,
     get apiKey() {
-      return D("ANTHROPIC_API_KEY");
+      return q("ANTHROPIC_API_KEY");
     },
     get apiUrl() {
       return "https://api.anthropic.com/";
@@ -1452,7 +1452,7 @@ Most prompts will ask for a specific output format, so comply with those details
     requestTimeout: 12e4,
     vision: !0,
     get apiKey() {
-      return D("ANTHROPIC_API_KEY");
+      return q("ANTHROPIC_API_KEY");
     },
     get apiUrl() {
       return "https://api.anthropic.com/";
@@ -1469,11 +1469,11 @@ Most prompts will ask for a specific output format, so comply with those details
     structuredOutput: !1,
     vision: !1,
     get apiUrl() {
-      const e = D("OPENWEBUI_API_URL") || "";
+      const e = q("OPENWEBUI_API_URL") || "";
       return e.endsWith("/") ? e : `${e}/`;
     },
     get apiKey() {
-      return D("OPENWEBUI_API_KEY");
+      return q("OPENWEBUI_API_KEY");
     },
     systemPrompt: ae
   },
@@ -1486,11 +1486,11 @@ Most prompts will ask for a specific output format, so comply with those details
     structuredOutput: !1,
     vision: !1,
     get apiUrl() {
-      const e = D("OPENWEBUI_API_URL") || "";
+      const e = q("OPENWEBUI_API_URL") || "";
       return e.endsWith("/") ? e : `${e}/`;
     },
     get apiKey() {
-      return D("OPENWEBUI_API_KEY");
+      return q("OPENWEBUI_API_KEY");
     },
     systemPrompt: ae
   },
@@ -1503,11 +1503,11 @@ Most prompts will ask for a specific output format, so comply with those details
     structuredOutput: !1,
     vision: !1,
     get apiUrl() {
-      const e = D("OPENWEBUI_API_URL") || "";
+      const e = q("OPENWEBUI_API_URL") || "";
       return e.endsWith("/") ? e : `${e}/`;
     },
     get apiKey() {
-      return D("OPENWEBUI_API_KEY");
+      return q("OPENWEBUI_API_KEY");
     },
     systemPrompt: ae
   },
@@ -1520,11 +1520,11 @@ Most prompts will ask for a specific output format, so comply with those details
     structuredOutput: !1,
     vision: !1,
     get apiUrl() {
-      const e = D("OPENWEBUI_API_URL") || "";
+      const e = q("OPENWEBUI_API_URL") || "";
       return e.endsWith("/") ? e : `${e}/`;
     },
     get apiKey() {
-      return D("OPENWEBUI_API_KEY");
+      return q("OPENWEBUI_API_KEY");
     },
     systemPrompt: ae
   },
@@ -1537,11 +1537,11 @@ Most prompts will ask for a specific output format, so comply with those details
     structuredOutput: !1,
     vision: !1,
     get apiUrl() {
-      const e = D("OPENWEBUI_API_URL") || "";
+      const e = q("OPENWEBUI_API_URL") || "";
       return e.endsWith("/") ? e : `${e}/`;
     },
     get apiKey() {
-      return D("OPENWEBUI_API_KEY");
+      return q("OPENWEBUI_API_KEY");
     },
     systemPrompt: ae
   }
@@ -1559,11 +1559,11 @@ Most prompts will ask for a specific output format, so comply with those details
   { use: "gpt-4.1-mini" }
 ];
 function uu() {
-  const e = !!D("OPENAI_API_KEY"), t = !!D("ANTHROPIC_API_KEY"), n = !!D("OPENWEBUI_API_KEY");
+  const e = !!q("OPENAI_API_KEY"), t = !!q("ANTHROPIC_API_KEY"), n = !!q("OPENWEBUI_API_KEY");
   let r;
   return e && t ? r = [...lu] : t ? r = [...cu] : e ? r = [...ur] : r = [...ur], n && r.unshift(
-    { match: { sensitive: !0, good: !0 }, use: D("VERBLETS_SENSITIVITY_GOOD_MODEL") },
-    { match: { sensitive: !0 }, use: D("VERBLETS_SENSITIVITY_MODEL") }
+    { match: { sensitive: !0, good: !0 }, use: q("VERBLETS_SENSITIVITY_GOOD_MODEL") },
+    { match: { sensitive: !0 }, use: q("VERBLETS_SENSITIVITY_MODEL") }
   ), r;
 }
 const vn = uu();
@@ -1571,11 +1571,11 @@ function pu() {
   const e = yn();
   for (const t of e)
     console.warn(`Warning: ${t}`);
-  bo.isBrowser && D("OPENAI_API_KEY") && console.warn(
+  bo.isBrowser && q("OPENAI_API_KEY") && console.warn(
     "WARNING: API key detected in browser environment. For security, please use a proxy endpoint instead."
   );
 }
-D("NODE_ENV") !== "test" && pu();
+q("NODE_ENV") !== "test" && pu();
 const du = (e) => {
   const t = Bo[e];
   if (!t) return;
@@ -1804,7 +1804,7 @@ const hu = /(?:\s*[{[]|[{[]+\s*[{[])/, he = (e) => {
     return a;
   const c = a.match(hu);
   return (c ? a.slice(c.index) : void 0) ?? a;
-}, fu = 'If you are unsure, say "undefined" as your answer.', gu = 'Answer the question either with "true" or "false" as your answer.', yu = "Answer the question with a number that could be parsed by the JS Number constructor. Do not include formatting, units, digit group separators, or spelled-out numbers in your answer.", bu = "Answer the question with a date that can be parsed by the JS Date constructor. ISO format is preferred. Do not include additional text or punctuation.", wu = "Respond with a JSON object or array that parses with JSON.parse, with no wrapping code block, and no wrapping XML.", vu = 'Return a JSON object with an "items" array property.', Su = 'Return a JSON object with a "value" property.', xu = 'Respond with a JSON object that parses with JSON.parse, with no other text and no code block. It should take the form "{ "value": 42, "unit": "<SI or other unit name>" }".', Ee = "Respond with a JSON object or array that parses with JSON.parse, with no other text and no code block.", qo = "Respond with a JSON array that parses with JSON.parse, with no additional text, no punctuation, and no code block.", $u = qo, Xe = `${qo} The array should only contain text. No additional structure.`, Fo = "Return an array of objects — not strings, and not just the objects.", Pu = "Even if the input is not JSON, describe as much as possible in a JSON structure that corresponds to the input.", zo = "You MUST follow the format as described.", Uo = "Provide as much valid data as possible based on available information. Clearly indicate any uncertainties or missing data.", Tu = "Include the line number where each check is performed.", Eu = "Do not fabricate facts. When uncertain, say so rather than guessing.", Wo = "Question:", Iu = "Instructions:", $n = "Details:", Vo = "Fixes:", Jo = "Focus all efforts on this content here:", ku = "Contents to convert to JSON:", Au = "Use this as example output only:", Ou = "Choose only from the following:", _u = "Transform the following object:", Ko = "Create a list of items with the following description:", Pn = "Make sure each item meets the following conditions:", Tn = "Do not use any of the following items:", Go = "The returned object must look like the following, including all the same properties:", En = "Make it conform exactly to the following schema:", Cu = "What is the intent of the following message:", Yo = "Sort the following items by:", ju = "Give me an intent response for the following:", Nu = "The extracted operation must be one of the following:", Ru = "The extracted parameters must be from the following options:", Mu = "Give an explanation followed by a succinct answer. The explanation part should come first, and should be at least 100 words. Next, insert a row of 20 equal signs (=) to create a clear separation.", Lu = "The content below the dividing line should only be valid JSON that can be parsed with JSON.parse.", Bu = "Next insert the succinctly-stated answer should be below the dividing line and work as a primitive datatype in JS. Be as succinct as possible as it will be parsed by a script.", Du = "Think through this step by step.", qu = "First restate the request in your own words, then provide your answer.", Fu = "State any assumptions you are making before answering.", zu = "Explain the reasoning behind your answer.", Uu = "Try to find flaws in your own output. If you find any, address them.", Wu = "Identify any unclear or ambiguous information in your response, and rephrase it for clarity.", Vu = "Rate your confidence in this response on a 0–1 scale. Be candidly critical.", Ju = "Rate on a 0–1 scale how well your output satisfied each point in the original prompt. Be strict.", Ku = "If your confidence is 0.3 or lower, rewrite to address the gaps.", Gu = "Consider both pros and cons before arriving at a conclusion.", Yu = "If there are alternative solutions or perspectives, include them.", Hu = "Provide specific examples to illustrate your point.", Qu = "Use an analogy to make this easier to understand.", Ho = "How would an expert in this field respond?", Xu = "Explain this so a non-expert can understand it.", Zu = "How else could this be interpreted?", ep = "What evidence supports your view?", tp = "What are the limitations of this approach?", np = "What information is still missing?", rp = "How would you evaluate differing views on this?", sp = "What additional input would help you give a better answer?", oe = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, fu = 'If you are unsure, say "undefined" as your answer.', gu = 'Answer the question either with "true" or "false" as your answer.', yu = "Answer the question with a number that could be parsed by the JS Number constructor. Do not include formatting, units, digit group separators, or spelled-out numbers in your answer.", bu = "Answer the question with a date that can be parsed by the JS Date constructor. ISO format is preferred. Do not include additional text or punctuation.", wu = "Respond with a JSON object or array that parses with JSON.parse, with no wrapping code block, and no wrapping XML.", vu = 'Return a JSON object with an "items" array property.', Su = 'Return a JSON object with a "value" property.', xu = 'Respond with a JSON object that parses with JSON.parse, with no other text and no code block. It should take the form "{ "value": 42, "unit": "<SI or other unit name>" }".', Ee = "Respond with a JSON object or array that parses with JSON.parse, with no other text and no code block.", qo = "Respond with a JSON array that parses with JSON.parse, with no additional text, no punctuation, and no code block.", $u = qo, Xe = `${qo} The array should only contain text. No additional structure.`, Fo = "Return an array of objects — not strings, and not just the objects.", Pu = "Even if the input is not JSON, describe as much as possible in a JSON structure that corresponds to the input.", zo = "You MUST follow the format as described.", Uo = "Provide as much valid data as possible based on available information. Clearly indicate any uncertainties or missing data.", Tu = "Include the line number where each check is performed.", Eu = "Do not fabricate facts. When uncertain, say so rather than guessing.", Wo = "Question:", ku = "Instructions:", $n = "Details:", Vo = "Fixes:", Jo = "Focus all efforts on this content here:", Iu = "Contents to convert to JSON:", Au = "Use this as example output only:", Ou = "Choose only from the following:", _u = "Transform the following object:", Ko = "Create a list of items with the following description:", Pn = "Make sure each item meets the following conditions:", Tn = "Do not use any of the following items:", Go = "The returned object must look like the following, including all the same properties:", En = "Make it conform exactly to the following schema:", Cu = "What is the intent of the following message:", Yo = "Sort the following items by:", ju = "Give me an intent response for the following:", Nu = "The extracted operation must be one of the following:", Ru = "The extracted parameters must be from the following options:", Mu = "Give an explanation followed by a succinct answer. The explanation part should come first, and should be at least 100 words. Next, insert a row of 20 equal signs (=) to create a clear separation.", Lu = "The content below the dividing line should only be valid JSON that can be parsed with JSON.parse.", Bu = "Next insert the succinctly-stated answer should be below the dividing line and work as a primitive datatype in JS. Be as succinct as possible as it will be parsed by a script.", Du = "Think through this step by step.", qu = "First restate the request in your own words, then provide your answer.", Fu = "State any assumptions you are making before answering.", zu = "Explain the reasoning behind your answer.", Uu = "Try to find flaws in your own output. If you find any, address them.", Wu = "Identify any unclear or ambiguous information in your response, and rephrase it for clarity.", Vu = "Rate your confidence in this response on a 0–1 scale. Be candidly critical.", Ju = "Rate on a 0–1 scale how well your output satisfied each point in the original prompt. Be strict.", Ku = "If your confidence is 0.3 or lower, rewrite to address the gaps.", Gu = "Consider both pros and cons before arriving at a conclusion.", Yu = "If there are alternative solutions or perspectives, include them.", Hu = "Provide specific examples to illustrate your point.", Qu = "Use an analogy to make this easier to understand.", Ho = "How would an expert in this field respond?", Xu = "Explain this so a non-expert can understand it.", Zu = "How else could this be interpreted?", ep = "What evidence supports your view?", tp = "What are the limitations of this approach?", np = "What information is still missing?", rp = "How would you evaluate differing views on this?", sp = "What additional input would help you give a better answer?", oe = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   alternativeInterpretations: Zu,
   alternativeSolutions: Yu,
@@ -1825,7 +1825,7 @@ const hu = /(?:\s*[{[]|[{[]+\s*[{[])/, he = (e) => {
   contentIsExample: Au,
   contentIsExampleObject: Go,
   contentIsFixes: Vo,
-  contentIsInstructions: Iu,
+  contentIsInstructions: ku,
   contentIsIntent: ju,
   contentIsMain: Jo,
   contentIsOperationOption: Nu,
@@ -1837,7 +1837,7 @@ const hu = /(?:\s*[{[]|[{[]+\s*[{[])/, he = (e) => {
   contentListCriteria: Ko,
   contentListItemCriteria: Pn,
   contentListToOmit: Tn,
-  contentToJSON: ku,
+  contentToJSON: Iu,
   evaluateDifferingViews: rp,
   evidenceSupportsView: ep,
   expertResponse: Ho,
@@ -1884,9 +1884,9 @@ function op(e, { forceHTML: t = !1, name: n, tag: r = "data", title: s, fit: o =
   const i = typeof e == "string" ? e : JSON.stringify(e, null, 2);
   return /\n/.test(i) || t || n ? $(i, { name: n, tag: r, title: s, fit: o }) : Qo(i, { title: s });
 }
-const ip = "0.7.3", ap = {
+const ip = "0.7.4", ap = {
   version: ip
-}, In = ap.version, fe = Object.freeze({
+}, kn = ap.version, fe = Object.freeze({
   /** Decisions, phases, meaningful outcomes. Audit-log-shaped. */
   event: "event",
   /** Execution mechanics: lifecycle, batch progress, retries. Progress-bar-shaped. */
@@ -1916,7 +1916,7 @@ const ip = "0.7.3", ap = {
   providerWait: "provider:wait",
   providerRetry: "provider:retry",
   error: "error"
-}), k = Object.freeze({
+}), A = Object.freeze({
   phase: "phase",
   step: "step",
   tick: "chain:tick",
@@ -2009,10 +2009,10 @@ function dp(e, t) {
     s && e(r);
   };
 }
-function I(e, t, { operation: n, now: r, traceId: s, spanId: o, parentSpanId: i, eventFilter: a } = {}) {
+function k(e, t, { operation: n, now: r, traceId: s, spanId: o, parentSpanId: i, eventFilter: a } = {}) {
   const c = dp(t, a), l = r, u = {};
   s && (u.traceId = s), o && (u.spanId = o), i && (u.parentSpanId = i);
-  const d = { step: e, operation: n, ...u, ...{ libraryName: "verblets", libraryVersion: In } }, h = {
+  const d = { step: e, operation: n, ...u, ...{ libraryName: "verblets", libraryVersion: kn } }, h = {
     start() {
       xe(c, { kind: fe.telemetry, ...d, event: De.start });
     },
@@ -2041,7 +2041,7 @@ function I(e, t, { operation: n, now: r, traceId: s, spanId: o, parentSpanId: i,
      * @param {{ confidence?: number, confidenceInterval?: { low: number, high: number }, unknowns?: string[], [key: string]: * }} data
      */
     uncertainty(y = {}) {
-      xe(c, { kind: fe.event, ...d, event: k.uncertainty, ...y });
+      xe(c, { kind: fe.event, ...d, event: A.uncertainty, ...y });
     },
     complete(y = {}) {
       const { durationMs: b, ...f } = y, g = b ?? (l ? Date.now() - l.getTime() : void 0);
@@ -2081,11 +2081,11 @@ function I(e, t, { operation: n, now: r, traceId: s, spanId: o, parentSpanId: i,
   };
   return h;
 }
-function L(e, t) {
+function B(e, t) {
   if (!(!e || typeof e != "function"))
     return (n) => e({ ...n, phase: n.phase ? `${t}/${n.phase}` : t });
 }
-function A(e, t) {
+function O(e, t) {
   const n = t.operation, r = n ? `${n}/${e}` : e;
   return {
     ...t,
@@ -2113,7 +2113,7 @@ async function mp(e, t, n) {
     const o = { operation: t.operation }, i = await s(o, { logger: t.logger }), a = i ?? n;
     r.source = ut.policy, r.value = a, r.policyReturned = i;
   } else t[e] !== void 0 ? (r.source = ut.config, r.value = t[e]) : (r.source = ut.fallback, r.value = n);
-  return I(e, t.onProgress, t).metrics({
+  return k(e, t.onProgress, t).metrics({
     event: ye.optionResolve,
     source: r.source,
     value: r.value,
@@ -2194,7 +2194,7 @@ const wp = (e, t, n = {}) => {
 }, vp = ({ debugPrompt: e, isCached: t, prompt: n }) => {
   (e || Po || To && !t) && (console.error("+++ DEBUG PROMPT +++"), console.error(n), console.error("+++ DEBUG PROMPT END +++"));
 }, Sp = ({ debugResult: e, isCached: t, resultShaped: n }) => {
-  (e || Eo || Io && !t) && (console.error("+++ DEBUG RESULT +++"), console.error(n), console.error("+++ DEBUG RESULT END +++"));
+  (e || Eo || ko && !t) && (console.error("+++ DEBUG RESULT +++"), console.error(n), console.error("+++ DEBUG RESULT END +++"));
 };
 let en;
 const xp = (e) => {
@@ -2225,57 +2225,57 @@ const xp = (e) => {
     unwrapValues: y,
     unwrapCollections: b
   } = t, f = en ? { ...en, ...t.policy } : t.policy, g = f ? { ...t, policy: f } : t, m = await re("forceQuery", g, !1), w = { ...Oo(c) };
-  for (const B of $p) {
-    const X = await re(B, g, void 0);
-    X !== void 0 && (w[B] = X);
+  for (const D of $p) {
+    const X = await re(D, g, void 0);
+    X !== void 0 && (w[D] = X);
   }
-  for (const B of Qe) {
-    const X = await re(B, g, void 0);
-    X !== void 0 && (w[B] = X);
+  for (const D of Qe) {
+    const X = await re(D, g, void 0);
+    X !== void 0 && (w[D] = X);
   }
-  const S = Date.now(), v = {};
+  const v = Date.now(), S = {};
   let P = !1;
-  w.negotiate && (Object.assign(v, w.negotiate), P = !0);
-  for (const B of Qe)
-    B in w && (v[B] = w[B], P = !0);
+  w.negotiate && (Object.assign(S, w.negotiate), P = !0);
+  for (const D of Qe)
+    D in w && (S[D] = w[D], P = !0);
   const x = w.modelName;
-  let E, O;
-  P ? (E = n.negotiateModel(x, v), O = E?.name) : (O = w.modelName, E = n.getModel(O));
-  const R = I("llm", t.onProgress, t), j = P ? Ge.negotiated : w.modelName ? Ge.config : Ge.default;
+  let E, I;
+  P ? (E = n.negotiateModel(x, S), I = E?.name) : (I = w.modelName, E = n.getModel(I));
+  const R = k("llm", t.onProgress, t), j = P ? Ge.negotiated : w.modelName ? Ge.config : Ge.default;
   R.metrics({
     event: ye.llmModel,
-    model: O,
+    model: I,
     provider: E?.provider || "openai",
     source: j,
-    negotiation: P ? v : void 0,
+    negotiation: P ? S : void 0,
     preferred: w.modelName
   });
-  const F = Array.isArray(e) ? e.reduce((B, X) => B + (X.type === "text" ? X.text.length : 0), 0) : e.length;
+  const L = Array.isArray(e) ? e.reduce((D, X) => D + (X.type === "text" ? X.text.length : 0), 0) : e.length;
   l?.info && l.info({
     event: "llm:start",
-    promptLength: F,
-    model: O
+    promptLength: L,
+    model: I
   });
   const V = n.getDefaultModel(), Y = E?.apiUrl || V?.apiUrl, H = E?.apiKey || V?.apiKey, ee = n.getRequestConfig({
     prompt: e,
     ...w,
-    modelName: O
-  }), pe = E.structuredOutput === !1 && !!ee.responseFormat;
+    modelName: I
+  }), ue = E.structuredOutput === !1 && !!ee.responseFormat;
   let G = ee;
-  if (pe) {
-    const B = ee.responseFormat?.json_schema?.schema, X = B ? `${Ee} ${En} ${$(JSON.stringify(B), { tag: "json-schema--do-not-output" })}` : Ee, ce = (le) => Array.isArray(le) ? [...le, { type: "text", text: X }] : `${le}
+  if (ue) {
+    const D = ee.responseFormat?.json_schema?.schema, X = D ? `${Ee} ${En} ${$(JSON.stringify(D), { tag: "json-schema--do-not-output" })}` : Ee, ce = (le) => Array.isArray(le) ? [...le, { type: "text", text: X }] : `${le}
 
 ${X}`, ve = ee.messages?.map(
       (le, Ne, Ue) => Ne === Ue.length - 1 && le.role === "user" ? { ...le, content: ce(le.content) } : le
     ) ?? ee.messages, { responseFormat: tr, ...Tt } = ee;
     G = { ...Tt, messages: ve };
   }
-  const te = await re("cacheEnabled", t, void 0), ie = te === !1 || te === void 0 && D("VERBLETS_DISABLE_CACHE") === !0, de = await re("cacheTTL", t, void 0);
+  const te = await re("cacheEnabled", t, void 0), ie = te === !1 || te === void 0 && q("VERBLETS_DISABLE_CACHE") === !0, pe = await re("cacheTTL", t, void 0);
   let Z, we;
   if (!ie && r) {
     we = await r();
-    const { result: B } = await Ro(we, ee);
-    Z = B;
+    const { result: D } = await Ro(we, ee);
+    Z = D;
   }
   p({
     isCached: !!Z,
@@ -2284,53 +2284,53 @@ ${X}`, ve = ee.messages?.map(
     requestConfig: ee
   });
   try {
-    let B = Z;
+    let D = Z;
     if (!Z || m) {
-      const le = w.requestTimeout || n.getModel(O).requestTimeout, Ne = new Lo(le), Ue = E.provider || "openai", nr = Yl(Ue), { url: Dc, fetchOptions: rr } = nr.buildRequest(
+      const le = w.requestTimeout || n.getModel(I).requestTimeout, Ne = new Lo(le), Ue = E.provider || "openai", nr = Yl(Ue), { url: Dc, fetchOptions: rr } = nr.buildRequest(
         Y,
         H,
         E.endpoint,
         G
       );
       bp(rr, s, Ne);
-      const me = await qc(Dc, rr);
+      const de = await qc(Dc, rr);
       Ne.clearTimeout();
-      const Et = me.headers.get("content-type") || "";
+      const Et = de.headers.get("content-type") || "";
       if (!Et.includes("application/json") && !Et.includes("text/json")) {
-        const It = await me.text().then((Se) => Se.slice(0, 200)), Me = new Error(
-          `Completions request [error]: expected JSON response but got ${Et || "unknown content-type"} (status: ${me.status}, body: ${It})`
+        const kt = await de.text().then((Se) => Se.slice(0, 200)), Me = new Error(
+          `Completions request [error]: expected JSON response but got ${Et || "unknown content-type"} (status: ${de.status}, body: ${kt})`
         );
-        throw Me.httpStatus = me.status, Me.retryAfterMs = mr(me.headers.get("retry-after")), Me.provider = Ue, Me;
+        throw Me.httpStatus = de.status, Me.retryAfterMs = mr(de.headers.get("retry-after")), Me.provider = Ue, Me;
       }
-      const Re = await me.json();
-      if (!me.ok) {
-        const It = Re?.error?.message || Re?.error?.type || "Unknown error", Me = [`status: ${me?.status}`, `type: ${Re?.error?.type}`].join(", "), Se = new Error(`Completions request [error]: ${It} (${Me})`);
-        throw Se.httpStatus = me.status, Se.errorType = Re?.error?.type, Se.errorCode = Re?.error?.code, Se.retryAfterMs = mr(me.headers.get("retry-after")), Se.provider = Ue, Se;
+      const Re = await de.json();
+      if (!de.ok) {
+        const kt = Re?.error?.message || Re?.error?.type || "Unknown error", Me = [`status: ${de?.status}`, `type: ${Re?.error?.type}`].join(", "), Se = new Error(`Completions request [error]: ${kt} (${Me})`);
+        throw Se.httpStatus = de.status, Se.errorType = Re?.error?.type, Se.errorCode = Re?.error?.code, Se.retryAfterMs = mr(de.headers.get("retry-after")), Se.provider = Ue, Se;
       }
-      B = nr.parseResponse(Re), !ie && we && await Mo(
+      D = nr.parseResponse(Re), !ie && we && await Mo(
         we,
         ee,
-        B,
-        ...de !== void 0 ? [de] : []
+        D,
+        ...pe !== void 0 ? [pe] : []
       );
     }
-    if (pe && typeof B.choices?.[0]?.message?.content == "string") {
-      const le = he(B.choices[0].message.content);
+    if (ue && typeof D.choices?.[0]?.message?.content == "string") {
+      const le = he(D.choices[0].message.content);
       try {
         const Ne = xn(le);
-        B = {
-          ...B,
+        D = {
+          ...D,
           choices: [
             {
-              ...B.choices[0],
-              message: { ...B.choices[0].message, content: JSON.stringify(Ne) }
+              ...D.choices[0],
+              message: { ...D.choices[0].message, content: JSON.stringify(Ne) }
             }
           ]
         };
       } catch {
       }
     }
-    const X = d(B, ee, {
+    const X = d(D, ee, {
       skipResponseParse: h,
       unwrapValues: y,
       unwrapCollections: b
@@ -2340,16 +2340,16 @@ ${X}`, ve = ee.messages?.map(
       isCached: !!Z,
       prompt: e,
       requestConfig: ee,
-      result: B,
+      result: D,
       resultShaped: X
     }), l?.info && l.info({
       event: "llm:end",
-      duration: Date.now() - S,
+      duration: Date.now() - v,
       cached: !!Z,
-      model: O
+      model: I
     });
     const ce = {
-      model: O,
+      model: I,
       provider: E.provider || "openai",
       cached: !!Z
     };
@@ -2358,7 +2358,7 @@ ${X}`, ve = ee.messages?.map(
       status: pr.success,
       ...ce
     });
-    const ve = B?.usage, tr = ve?.prompt_tokens ?? 0, Tt = ve?.completion_tokens ?? 0;
+    const ve = D?.usage, tr = ve?.prompt_tokens ?? 0, Tt = ve?.completion_tokens ?? 0;
     return R.measure({
       metric: ge.tokenUsage,
       tokenType: dr.input,
@@ -2371,12 +2371,12 @@ ${X}`, ve = ee.messages?.map(
       ...ce
     }), R.measure({
       metric: ge.llmDuration,
-      value: Date.now() - S,
+      value: Date.now() - v,
       ...ce
     }), X;
-  } catch (B) {
+  } catch (D) {
     const X = {
-      model: O,
+      model: I,
       provider: E.provider || "openai"
     };
     throw R.metrics({
@@ -2384,15 +2384,15 @@ ${X}`, ve = ee.messages?.map(
       status: pr.error,
       ...X,
       error: {
-        message: B.message,
-        httpStatusCode: B.httpStatus,
-        type: B.errorType
+        message: D.message,
+        httpStatusCode: D.httpStatus,
+        type: D.errorType
       }
     }), R.measure({
       metric: ge.llmDuration,
-      value: Date.now() - S,
+      value: Date.now() - v,
       ...X
-    }), B;
+    }), D;
   }
 };
 function Zo(e, t) {
@@ -2412,7 +2412,7 @@ ${Ee}`, Tp = {
       type: "string"
     }
   }
-}, kn = (e = Tp) => {
+}, In = (e = Tp) => {
   const t = Object.entries(e.properties).map(([n, r]) => {
     const s = Object.entries(r).filter(
       ([a, c]) => ["format", "description"].includes(a) && !!c
@@ -2421,15 +2421,15 @@ ${Ee}`, Tp = {
   }).join(", ");
   return `${Go} \`{ ${t} }\`. ${Ee}.
 `;
-}, ti = (e) => e ? `Ensure the type is ${e}. ` : "", Ep = "ensure values meant to be numbers are numbers", Ip = "ensure the type is a real schema.org type", kp = "ensure the returned object has @context, name", ni = (e, t, n) => {
+}, ti = (e) => e ? `Ensure the type is ${e}. ` : "", Ep = "ensure values meant to be numbers are numbers", kp = "ensure the type is a real schema.org type", Ip = "ensure the returned object has @context, name", ni = (e, t, n) => {
   const r = `${ti(t)}`, s = n ? `
 ${En} ${$(JSON.stringify(n), {
     tag: "schema"
   })}` : "";
   return `Give me "${e}" in schema.org JSON format with a full set of properties. ${r ? `${r}.` : ""}
 - ${Ep}
-- ${Ip}
 - ${kp}
+- ${Ip}
 ${s}
 ${Ee}`;
 }, Ap = (e) => `Use the following information to create a blog post. Don't necessarily use all of the information. Keep your sentences varied, but nothing too long. Focus on writing an interesting, engaging post:
@@ -2446,7 +2446,7 @@ ${e}
 }, _p = (e, { schema: t = Op } = {}) => `Make an array of "${e}" objects.
 
 ${Pn}
- - ${kn(t)}
+ - ${In(t)}
  - ${Uo}
 
 ${Ee} ${Fo}`, Cp = "Please continue building the list.", jp = 10, ri = (e, {
@@ -2628,7 +2628,7 @@ Query: ${e}`, cd = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.definePr
   __proto__: null,
   asEnum: ei,
   asJSONSchema: Pp,
-  asObjectWithSchema: kn,
+  asObjectWithSchema: In,
   asSchemaOrgText: ni,
   asSchemaOrgType: ti,
   asXML: $,
@@ -2653,8 +2653,8 @@ Query: ${e}`, cd = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.definePr
   wrapList: Zp,
   wrapVariable: op
 }, Symbol.toStringTag, { value: "Module" }));
-async function q(e, t) {
-  const n = Object.keys(t), r = I("options", e.onProgress, e);
+async function F(e, t) {
+  const n = Object.keys(t), r = k("options", e.onProgress, e);
   r.progress({ event: W.start, totalItems: n.length });
   const s = await fp(e, t);
   return r.progress({
@@ -2706,8 +2706,8 @@ const ud = {
 async function On(e, t = {}) {
   const { text: n, context: r } = N(e, []), s = r ? `${n}
 
-${r}` : n, o = A(hr, t), i = I(hr, o.onProgress, o);
-  i.start(), i.emit({ event: k.input, value: s });
+${r}` : n, o = O(hr, t), i = k(hr, o.onProgress, o);
+  i.start(), i.emit({ event: A.input, value: s });
   const a = `${md} ${hd}
 
 ${pd} ${dd}
@@ -2719,7 +2719,7 @@ The value should be "true", "false", or "undefined".`;
       systemPrompt: a,
       responseFormat: C("boolean_evaluation", ud)
     }), l = c === "true" ? !0 : c === "false" ? !1 : void 0;
-    return i.emit({ event: k.output, value: l }), i.complete({ outcome: T.success }), l;
+    return i.emit({ event: A.output, value: l }), i.complete({ outcome: T.success }), l;
   } catch (c) {
     throw i.error(c), c;
   }
@@ -2801,7 +2801,7 @@ async function M(e, t = {}) {
     }
   };
   let p = 0, d = 0, h = new Error("Nothing to run"), y;
-  const f = I(n || "retry", c, r);
+  const f = k(n || "retry", c, r);
   c && f.progress({
     event: W.start,
     attemptNumber: 1,
@@ -2809,24 +2809,24 @@ async function M(e, t = {}) {
     retryOnAll: i,
     retryMode: a
   });
-  const g = (w) => new Promise((S, v) => {
+  const g = (w) => new Promise((v, S) => {
     if (l?.aborted) {
-      v(Ot(l));
+      S(Ot(l));
       return;
     }
-    const P = setTimeout(S, w);
+    const P = setTimeout(v, w);
     l?.addEventListener(
       "abort",
       () => {
-        clearTimeout(P), v(Ot(l));
+        clearTimeout(P), S(Ot(l));
       },
       { once: !0 }
     );
-  }), m = async (w, S) => {
-    let v = w;
-    for (; v > 0; ) {
-      const P = Math.min(v, Sd);
-      await g(P), v -= P, v > 0 && f.progress({ ...S, remaining: v, elapsed: w - v });
+  }), m = async (w, v) => {
+    let S = w;
+    for (; S > 0; ) {
+      const P = Math.min(S, Sd);
+      await g(P), S -= P, S > 0 && f.progress({ ...v, remaining: S, elapsed: w - S });
     }
   };
   e: for (; p < s; ) {
@@ -2895,16 +2895,16 @@ async function M(e, t = {}) {
         let x = 0, E = 0;
         for (; ; ) {
           x++;
-          const O = u.creditRetryInterval, R = {
+          const I = u.creditRetryInterval, R = {
             event: W.providerWait,
             category: U.creditExhausted,
             provider: h.provider,
-            delay: O,
+            delay: I,
             attempt: x,
             elapsed: E,
             error: { message: h.message, httpStatus: h.httpStatus }
           };
-          f.progress(R), await m(O, R), E += O, f.progress({
+          f.progress(R), await m(I, R), E += I, f.progress({
             event: W.providerRetry,
             category: U.creditExhausted,
             provider: h.provider,
@@ -2912,7 +2912,7 @@ async function M(e, t = {}) {
             elapsed: E
           }), f.measure({
             metric: ge.providerWait,
-            value: O,
+            value: I,
             category: U.creditExhausted,
             provider: h.provider
           });
@@ -2983,8 +2983,8 @@ async function M(e, t = {}) {
         continue e;
       }
     }
-    const S = h.httpStatus ?? h.response?.status, v = i || S === 429 || S >= 500 && S < 600, P = !v || p >= s - 1;
-    if (v && p < s - 1) {
+    const v = h.httpStatus ?? h.response?.status, S = i || v === 429 || v >= 500 && v < 600, P = !S || p >= s - 1;
+    if (S && p < s - 1) {
       const x = o * p;
       if (c) {
         const E = {
@@ -3082,11 +3082,11 @@ function Ed({
     outputBudget: Math.floor(i * t / (1 + t))
   };
 }
-function Id(e, t, n) {
+function kd(e, t, n) {
   const r = Math.max(...e.map((s) => bi(s, n)));
   return Math.max(1, Math.floor(t.inputBudget / (r * Td)));
 }
-function kd(e, { targetBatchSize: t, budget: n, model: r }) {
+function Id(e, { targetBatchSize: t, budget: n, model: r }) {
   const s = [];
   let o = [], i = 0, a = 0;
   for (let c = 0; c < e.length; c++) {
@@ -3101,7 +3101,7 @@ function kd(e, { targetBatchSize: t, budget: n, model: r }) {
   return o.length > 0 && s.push({ items: o, startIndex: a }), s;
 }
 async function Ae(e, t = {}) {
-  const { batchSize: n, contextBuffer: r = yi, llm: s } = t, { outputRatio: o, maxTokenBudget: i } = await q(t, {
+  const { batchSize: n, contextBuffer: r = yi, llm: s } = t, { outputRatio: o, maxTokenBudget: i } = await F(t, {
     outputRatio: fi,
     maxTokenBudget: gi
   }), a = t.modelService || Te, c = Do(s) || a.getDefaultModel()?.name, l = a.getModel(c), u = Ed({
@@ -3109,8 +3109,8 @@ async function Ae(e, t = {}) {
     outputRatio: o,
     maxTokenBudget: i,
     contextBuffer: r
-  }), p = n || Id(e, u, l);
-  return kd(e, { targetBatchSize: p, budget: u, model: l });
+  }), p = n || kd(e, u, l);
+  return Id(e, { targetBatchSize: p, budget: u, model: l });
 }
 const Ad = 3, Od = 1e4, _d = 0.3;
 function Cd(e) {
@@ -3150,12 +3150,12 @@ async function Q(e, t, n = {}) {
         throw c.reason ?? new Error("The operation was aborted.");
       if (a === z.resilient) {
         const w = await Promise.allSettled(
-          m.map((S, v) => t(S, g + v))
+          m.map((v, S) => t(v, g + S))
         );
-        b.push(...w.map((S, v) => S.status === "fulfilled" ? S.value : m[v]));
+        b.push(...w.map((v, S) => v.status === "fulfilled" ? v.value : m[S]));
       } else {
         const w = await Promise.all(
-          m.map((S, v) => t(S, g + v))
+          m.map((v, S) => t(v, g + S))
         );
         b.push(...w);
       }
@@ -3171,15 +3171,15 @@ async function Q(e, t, n = {}) {
     const b = e.slice(y, y + h), f = Date.now();
     let g = 0;
     if (a === z.resilient) {
-      const S = await Promise.allSettled(
-        b.map((v, P) => t(v, y + P))
+      const v = await Promise.allSettled(
+        b.map((S, P) => t(S, y + P))
       );
-      g = S.filter((v) => v.status === "rejected").length, p.push(...S.map((v, P) => v.status === "fulfilled" ? v.value : b[P]));
+      g = v.filter((S) => S.status === "rejected").length, p.push(...v.map((S, P) => S.status === "fulfilled" ? S.value : b[P]));
     } else {
-      const S = await Promise.all(
-        b.map((v, P) => t(v, y + P))
+      const v = await Promise.all(
+        b.map((S, P) => t(S, y + P))
       );
-      p.push(...S);
+      p.push(...v);
     }
     const m = Date.now() - f, w = g / b.length;
     d.record(m, w), h = jd(
@@ -3340,51 +3340,51 @@ async function Kd(e, t, n) {
 async function _n(e, t = {}) {
   const { text: n, context: r } = N(e, []), s = r ? `${n}
 
-${r}` : n, o = A(yr, t), i = I(yr, o.onProgress, o);
-  i.start(), i.emit({ event: k.input, value: s });
-  const { maxAttempts: a, validate: c, returnBestEffort: l } = await q(o, {
+${r}` : n, o = O(yr, t), i = k(yr, o.onProgress, o);
+  i.start(), i.emit({ event: A.input, value: s });
+  const { maxAttempts: a, validate: c, returnBestEffort: l } = await F(o, {
     rigor: J(zd, ["validate", "maxAttempts", "returnBestEffort"])
   });
   try {
     const u = Wd(s), p = br(s);
     if (!c) {
-      const S = await Ct(p, o);
-      return i.emit({ event: k.output, value: S }), i.complete({ outcome: T.success }), S;
+      const v = await Ct(p, o);
+      return i.emit({ event: A.output, value: v }), i.complete({ outcome: T.success }), v;
     }
     const [d, h] = await Q(
       [
         () => _(u, {
           ...o,
-          onProgress: L(o.onProgress, "expectations"),
+          onProgress: B(o.onProgress, "expectations"),
           responseFormat: C("date_expectations", xd)
         }),
         () => Ct(p, {
           ...o,
-          onProgress: L(o.onProgress, "extract")
+          onProgress: B(o.onProgress, "extract")
         })
       ],
-      (S) => S(),
+      (v) => v(),
       { maxParallel: 2, abortSignal: o?.abortSignal }
     ), y = d.length > 0 ? d : ["The result is a valid date"];
     if (!h) {
-      i.emit({ event: k.output, value: void 0 }), i.complete({ outcome: T.success });
+      i.emit({ event: A.output, value: void 0 }), i.complete({ outcome: T.success });
       return;
     }
     let b = h, f = e, g = 0;
     const m = i.batch(a), w = await M(
       async () => {
         g += 1, i.emit({
-          event: k.step,
+          event: A.step,
           stepName: "validation-attempt",
           attempt: g,
           maxAttempts: a,
           currentDate: b?.toISOString()
         });
-        const S = await Kd(b, y, o);
-        if (m(1), S.passed)
+        const v = await Kd(b, y, o);
+        if (m(1), v.passed)
           return b;
-        f = `${s} The previous answer (${b.toISOString()}) failed to satisfy: "${S.failedCheck}". Try again.`;
-        const v = br(f), P = await Ct(v, o);
+        f = `${s} The previous answer (${b.toISOString()}) failed to satisfy: "${v.failedCheck}". Try again.`;
+        const S = br(f), P = await Ct(S, o);
         if (!P || (b = P, g >= a))
           return l ? b : void 0;
         throw new Error("Retrying after validation failure");
@@ -3396,7 +3396,7 @@ ${r}` : n, o = A(yr, t), i = I(yr, o.onProgress, o);
         retryOnAll: !0
       }
     );
-    return i.emit({ event: k.output, value: w }), i.complete({ outcome: T.success }), w;
+    return i.emit({ event: A.output, value: w }), i.complete({ outcome: T.success }), w;
   } catch (u) {
     throw i.error(u), u;
   }
@@ -3415,7 +3415,7 @@ const Gd = (e) => ({
   additionalProperties: !1
 }), { asUndefinedByDefault: Yd, contentIsQuestion: Hd, explainAndSeparate: Qd } = oe, wr = "enum";
 async function xi(e, t, n = {}) {
-  const { text: r, context: s } = N(e, []), o = A(wr, n), i = I(wr, o.onProgress, o);
+  const { text: r, context: s } = N(e, []), o = O(wr, n), i = k(wr, o.onProgress, o);
   i.start();
   const a = [
     `${Hd} ${$(r, { tag: "text" })}
@@ -3464,7 +3464,7 @@ const Xd = {
   explainAndSeparatePrimitive: rm
 } = oe, vr = "number";
 async function Cn(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(vr, t), o = I(vr, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(vr, t), o = k(vr, s.onProgress, s);
   o.start();
   const i = [
     `${tm} ${$(n, { tag: "text" })}
@@ -3525,7 +3525,7 @@ const sm = "Bad datatype returned for number query.", om = "Value is not a numbe
   additionalProperties: um
 }, { asNumberWithUnits: dm, contentIsQuestion: mm, explainAndSeparate: hm, explainAndSeparateJSON: fm } = oe, Sr = "number-with-units", gm = C("number_with_units_result", pm);
 async function Nn(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(Sr, t), o = I(Sr, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(Sr, t), o = k(Sr, s.onProgress, s);
   o.start();
   const i = [
     `${mm} ${$(n, { tag: "text" })} 
@@ -3585,7 +3585,7 @@ function xm({ spec: e, text: t, ...n }) {
   };
 }
 async function Rn(e, t = {}) {
-  const n = A("scale:spec", t), r = I("scale:spec", n.onProgress, n);
+  const n = O("scale:spec", t), r = k("scale:spec", n.onProgress, n);
   r.start();
   try {
     const s = "You are a scale specification generator. Analyze the scaling instructions and produce a clear, comprehensive specification.", o = `Analyze these scaling instructions and generate a scale specification.
@@ -3617,7 +3617,7 @@ IMPORTANT: Each property must be a simple string value, not a nested object or a
   }
 }
 async function $m(e, t, n = {}) {
-  const r = A("scale:apply", n), s = `Apply the scale specification to transform this item.
+  const r = O("scale:apply", n), s = `Apply the scale specification to transform this item.
 
 ${$(t, { tag: "scale-specification" })}
 
@@ -3638,20 +3638,20 @@ Return a JSON object with a "value" property containing the scaled result.`;
 }
 async function Pi(e, t, n) {
   [t, n] = K(t, n, ["spec"]);
-  const { text: r, known: s, context: o } = N(t, ["spec"]), i = A($r, n), a = I($r, i.onProgress, i);
+  const { text: r, known: s, context: o } = N(t, ["spec"]), i = O($r, n), a = k($r, i.onProgress, i);
   a.start();
   try {
-    a.emit({ event: k.step, stepName: "generating-specification" });
+    a.emit({ event: A.step, stepName: "generating-specification" });
     const c = s.spec || await Rn(o ? `${r}
 
 ${o}` : r, {
       ...i,
-      onProgress: L(i.onProgress, "scale:spec")
+      onProgress: B(i.onProgress, "scale:spec")
     });
-    a.emit({ event: k.step, stepName: "applying-scale", specification: c });
+    a.emit({ event: A.step, stepName: "applying-scale", specification: c });
     const l = await $m(e, c, {
       ...i,
-      onProgress: L(i.onProgress, "scale:apply")
+      onProgress: B(i.onProgress, "scale:apply")
     });
     return a.complete({ outcome: T.success }), l;
   } catch (c) {
@@ -3684,11 +3684,11 @@ const Pr = {
     required: ["corpusProfile", "classificationCriteria", "salienceCriteria", "categoryNotes"],
     additionalProperties: !1
   }
-}, Pm = "object", Tm = { severity: { type: "string", enum: ["none", "low", "medium", "high", "critical"], description: "Absolute risk level of this item" }, salience: { type: "string", enum: ["routine", "notable", "significant", "exceptional"], description: "How notable this item is relative to the corpus baseline" }, categories: { type: "object", description: "Per-category breakdown with severity and salience", additionalProperties: { type: "object", properties: { severity: { type: "string", enum: ["none", "low", "medium", "high", "critical"] }, salience: { type: "string", enum: ["routine", "notable", "significant", "exceptional"] } }, required: ["severity", "salience"], additionalProperties: !1 } }, summary: { type: "string", description: "Brief explanation of the classification" } }, Em = ["severity", "salience", "categories", "summary"], Im = !1, km = {
+}, Pm = "object", Tm = { severity: { type: "string", enum: ["none", "low", "medium", "high", "critical"], description: "Absolute risk level of this item" }, salience: { type: "string", enum: ["routine", "notable", "significant", "exceptional"], description: "How notable this item is relative to the corpus baseline" }, categories: { type: "object", description: "Per-category breakdown with severity and salience", additionalProperties: { type: "object", properties: { severity: { type: "string", enum: ["none", "low", "medium", "high", "critical"] }, salience: { type: "string", enum: ["routine", "notable", "significant", "exceptional"] } }, required: ["severity", "salience"], additionalProperties: !1 } }, summary: { type: "string", description: "Brief explanation of the classification" } }, Em = ["severity", "salience", "categories", "summary"], km = !1, Im = {
   type: Pm,
   properties: Tm,
   required: Em,
-  additionalProperties: Im
+  additionalProperties: km
 }, Tr = "calibrate", Am = (e) => {
   if (e !== void 0 && (e === "low" || e === "med" || e === "high"))
     return e;
@@ -3717,9 +3717,9 @@ function Om(e) {
   };
 }
 async function Ti(e, t = {}) {
-  const n = A("calibrate:spec", t), r = I("calibrate:spec", n.onProgress, n);
+  const n = O("calibrate:spec", t), r = k("calibrate:spec", n.onProgress, n);
   r.start();
-  const { thresholdStrategy: s, sensitivity: o } = await q(n, {
+  const { thresholdStrategy: s, sensitivity: o } = await F(n, {
     thresholdStrategy: "statistical",
     sensitivity: J(Am)
   }), { instructions: i } = n, a = Om(e), c = "You are a calibration specification generator. Analyze the corpus scan statistics and produce a calibrated classification specification. The specification should enable consistent severity and salience classification of individual items relative to this corpus.", l = i ? `
@@ -3774,7 +3774,7 @@ IMPORTANT: Each property must be a simple string value, not a nested object or a
   }
 }
 async function _m(e, t, n = {}) {
-  const r = A("calibrate:apply", n), s = I("calibrate:apply", r.onProgress, r);
+  const r = O("calibrate:apply", n), s = k("calibrate:apply", r.onProgress, r);
   s.start();
   const o = `Classify this scan result against the calibration specification.
 
@@ -3792,7 +3792,7 @@ Return a JSON object with:
     const i = await M(
       () => _(o, {
         ...r,
-        responseFormat: C("calibrate_result", km)
+        responseFormat: C("calibrate_result", Im)
       }),
       {
         label: "calibrate classify",
@@ -3815,11 +3815,11 @@ async function Ei(e, t, n) {
   [t, n] = K(t, n, ["spec"]);
   const { text: r, known: s, context: o } = N(t, ["spec"]), i = o ? `${r}
 
-${o}` : r, a = A(Tr, n), c = I(Tr, a.onProgress, a);
+${o}` : r, a = O(Tr, n), c = k(Tr, a.onProgress, a);
   c.start();
   try {
     const l = s.spec || await Ti([e], { ...a, instructions: i });
-    c.emit({ event: k.phase, phase: "applying-calibrate", specification: l });
+    c.emit({ event: A.phase, phase: "applying-calibrate", specification: l });
     const u = await _m(e, l, a);
     return c.complete({ outcome: T.success }), u;
   } catch (l) {
@@ -3827,7 +3827,7 @@ ${o}` : r, a = A(Tr, n), c = I(Tr, a.onProgress, a);
   }
 }
 Ei.knownTexts = ["spec"];
-const Ii = Object.freeze(["application", "providers", "request", "content"]), ki = Object.freeze({
+const ki = Object.freeze(["application", "providers", "request", "content"]), Ii = Object.freeze({
   PRODUCTION: "production",
   DEVELOPMENT: "development",
   TEST: "test"
@@ -3855,10 +3855,10 @@ const Ii = Object.freeze(["application", "providers", "request", "content"]), ki
 }), jm = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   COMPLIANCE: Oi,
-  CONTEXT_KINDS: Ii,
+  CONTEXT_KINDS: ki,
   COST_POSTURE: Ci,
   DOMAIN: Ai,
-  ENVIRONMENT: ki,
+  ENVIRONMENT: Ii,
   QUALITY_INTENT: _i
 }, Symbol.toStringTag, { value: "Module" }));
 function ji(e) {
@@ -3899,7 +3899,7 @@ function tn(e, t, n) {
           a[c] = Array.isArray(l) ? [...l] : l;
         r[o] = a;
       }
-      return I("context-builder", t, n).emit({ event: k.output, kinds: Object.keys(r) }), ji(r);
+      return k("context-builder", t, n).emit({ event: A.output, kinds: Object.keys(r) }), ji(r);
     }
   };
 }
@@ -3920,12 +3920,12 @@ function Ni({
 function Ri() {
   return {
     key: "default",
-    environment: D("NODE_ENV") || "development",
-    version: In
+    environment: q("NODE_ENV") || "development",
+    version: kn
   };
 }
 function Mi() {
-  const e = !!D("OPENAI_API_KEY"), t = !!D("ANTHROPIC_API_KEY"), n = !!D("OPENWEBUI_API_KEY"), r = n, s = !!D("REDIS_HOST");
+  const e = !!q("OPENAI_API_KEY"), t = !!q("ANTHROPIC_API_KEY"), n = !!q("OPENWEBUI_API_KEY"), r = n, s = !!q("REDIS_HOST");
   return {
     key: "default",
     openai: e,
@@ -4011,9 +4011,9 @@ ${t}` : ""}`, Bm = (e, t) => {
   return { floorIdx: s, candidates: o, selection: i, mayResults: r };
 };
 async function Dm(e, t, n, r) {
-  const s = A(ht, r), o = I(ht, s.onProgress, s);
+  const s = O(ht, r), o = k(ht, s.onProgress, s);
   o.start();
-  const { instruction: i, constraints: a } = await q(s, {
+  const { instruction: i, constraints: a } = await F(s, {
     instruction: void 0,
     constraints: void 0
   });
@@ -4038,25 +4038,25 @@ async function Dm(e, t, n, r) {
       const g = () => {
         const m = {};
         for (const w of n) {
-          const S = l.get(w.name);
-          m[w.name] = S.selection ?? S.candidates[0];
+          const v = l.get(w.name);
+          m[w.name] = v.selection ?? v.candidates[0];
         }
         return m;
       };
       for (const m of a) {
-        const w = g(), S = m.enforce(w);
-        if (S)
-          for (const [v, P] of Object.entries(S)) {
-            const x = n.find((F) => F.name === v);
+        const w = g(), v = m.enforce(w);
+        if (v)
+          for (const [S, P] of Object.entries(v)) {
+            const x = n.find((L) => L.name === S);
             if (!x) continue;
             const E = x.values.indexOf(P);
             if (E < 0) continue;
-            const O = l.get(v);
-            if (E <= O.floorIdx) continue;
+            const I = l.get(S);
+            if (E <= I.floorIdx) continue;
             const R = x.values.slice(E);
             let j;
-            R.length <= 1 ? j = R[0] ?? x.values[x.values.length - 1] : O.selection !== void 0 && R.includes(O.selection) ? j = O.selection : j = P, l.set(v, {
-              ...O,
+            R.length <= 1 ? j = R[0] ?? x.values[x.values.length - 1] : I.selection !== void 0 && R.includes(I.selection) ? j = I.selection : j = P, l.set(S, {
+              ...I,
               floorIdx: E,
               candidates: R,
               selection: j
@@ -4071,7 +4071,7 @@ async function Dm(e, t, n, r) {
     if (u.length === 0)
       return o.complete({ outcome: T.success, dimensions: n.length }), n.map((g) => l.get(g.name).selection);
     const p = u.map((g) => {
-      const m = l.get(g.name), w = m.mayResults.filter((S) => m.candidates.includes(S.resolved));
+      const m = l.get(g.name), w = m.mayResults.filter((v) => m.candidates.includes(v.resolved));
       return { dim: g, candidates: m.candidates, viableMays: w };
     }), d = Lm(p, i), h = {}, y = {};
     for (const { dim: g, candidates: m } of p)
@@ -4093,10 +4093,10 @@ async function Dm(e, t, n, r) {
       { label: "value-arbitrate", config: s }
     );
     for (const g of u) {
-      const m = l.get(g.name), w = f?.[g.name], S = y[g.name]?.[w];
+      const m = l.get(g.name), w = f?.[g.name], v = y[g.name]?.[w];
       l.set(g.name, {
         ...m,
-        selection: S !== void 0 ? S : m.candidates[0]
+        selection: v !== void 0 ? v : m.candidates[0]
       });
     }
     return o.complete({
@@ -4113,9 +4113,9 @@ async function Bi(e, t, n, r = {}) {
   if (!n?.length) throw new Error("valueArbitrate requires at least one value");
   if (Rm(n))
     return Dm(e, t, n, r);
-  const s = A(ht, r), o = I(ht, s.onProgress, s);
+  const s = O(ht, r), o = k(ht, s.onProgress, s);
   o.start();
-  const { instruction: i } = await q(s, {
+  const { instruction: i } = await F(s, {
     instruction: void 0
   });
   try {
@@ -4565,7 +4565,7 @@ const wt = ["in", "startsWith", "endsWith", "contains", "lessThan", "greaterThan
 }, Ln = (e, t) => e.clauses.every((n) => Fi(n, t)), th = (e, t) => {
   const n = e.find((r) => Ln(r, t));
   return n ? { option: n.option, value: n.value } : void 0;
-}, nh = (e, t) => e.filter((n) => Ln(n, t)).map((n) => ({ option: n.option, value: n.value })), Ir = "suggest-targeting-rules", rh = (e, t) => {
+}, nh = (e, t) => e.filter((n) => Ln(n, t)).map((n) => ({ option: n.option, value: n.value })), kr = "suggest-targeting-rules", rh = (e, t) => {
   const n = e.map(
     (r, s) => `${s + 1}. option="${r.option}" operation="${r.operation}" source="${r.source}" value="${r.value}"${r.policyReturned !== void 0 ? ` policyReturned="${r.policyReturned}"` : ""}${r.error ? ` error="${r.error}"` : ""}`
   ).join(`
@@ -4590,7 +4590,7 @@ async function zi(e, t, n) {
   [t, n] = K(t, n);
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A(Ir, n), a = I(Ir, i.onProgress, i);
+${s}` : r, i = O(kr, n), a = k(kr, i.onProgress, i);
   if (a.start(), !e || e.length === 0)
     return a.complete({ outcome: T.success }), [];
   try {
@@ -4604,7 +4604,7 @@ ${s}` : r, i = A(Ir, n), a = I(Ir, i.onProgress, i);
   }
 }
 zi.knownTexts = [];
-const sh = (e) => e.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;").replace(/'/g, "&apos;"), ue = {
+const sh = (e) => e.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;").replace(/'/g, "&apos;"), me = {
   NEWLINE: "newline",
   XML: "xml",
   AUTO: "auto"
@@ -4617,11 +4617,11 @@ function oh(e, t = 1e3) {
   });
 }
 function je(e, t, n) {
-  const r = e || ue.AUTO;
-  return r === ue.AUTO ? oh(t, n) ? ue.XML : ue.NEWLINE : r;
+  const r = e || me.AUTO;
+  return r === me.AUTO ? oh(t, n) ? me.XML : me.NEWLINE : r;
 }
 function ih(e, t) {
-  return t === ue.NEWLINE ? e.map((r) => String(r)).join(`
+  return t === me.NEWLINE ? e.map((r) => String(r)).join(`
 `) : `<list>
 ${e.map((r) => `  <item>${sh(String(r))}</item>`).join(`
 `)}
@@ -4645,7 +4645,7 @@ ${o}`;
   },
   required: ["items"],
   additionalProperties: !1
-}, kr = "list-batch";
+}, Ir = "list-batch";
 async function be(e, t, n) {
   [t, n] = K(t, n);
   let r;
@@ -4657,10 +4657,10 @@ async function be(e, t, n) {
 
 ${y}` : h;
   }
-  const s = A(kr, n), o = I(kr, s.onProgress, s);
+  const s = O(Ir, n), o = k(Ir, s.onProgress, s);
   o.start();
   const {
-    listStyle: i = ue.AUTO,
+    listStyle: i = me.AUTO,
     autoModeThreshold: a = 1e3,
     maxTokens: c,
     responseFormat: l,
@@ -4716,10 +4716,11 @@ ${y}` : h;
 }
 be.knownTexts = [];
 const Ar = "map", rn = Symbol("unprocessed");
-function lh(e, t, n, r, s) {
-  const o = r ? `
+function lh(e, t, n, r) {
+  const s = r ? `
 
-${r}` : "", i = `Transform each item in the list according to the instructions below. Apply the transformation consistently to every item.
+${r}` : "";
+  return `Transform each item in the list according to the instructions below. Apply the transformation consistently to every item.
 
 ${$(e, { tag: "transformation-instructions" })}
 
@@ -4727,23 +4728,10 @@ IMPORTANT:
 - Transform each item independently
 - Apply the same transformation logic to all items
 - Preserve the order of items from the input list
-- Output one transformed result per input item${o}`;
-  return s ? `${i}
+- Output one transformed result per input item${s}
 
 The input list contains exactly ${t.length} item${t.length === 1 ? "" : "s"}.
-Return exactly ${t.length} result${t.length === 1 ? "" : "s"} in the items array, one per input item.` : n === ue.NEWLINE ? `${i}
-
-The input list contains exactly ${t.length} item${t.length === 1 ? "" : "s"}, separated by newlines.
-Return exactly ${t.length} line${t.length === 1 ? "" : "s"} of output, one transformed item per line. Do not number the lines.` : `${i}
-
-Return the transformed items as an XML list with exactly ${t.length} items:
-<list>
-  <item>transformed content 1</item>
-  <item>transformed content 2</item>
-  ...
-</list>
-
-Preserve all formatting and newlines within each <item> element.`;
+Return exactly ${t.length} result${t.length === 1 ? "" : "s"} in the items array, one per input item.`;
 }
 const Or = async function(e, t, n = {}) {
   const { maxParallel: r = 3, errorPosture: s, onProgress: o, _batchDone: i, _context: a } = n, c = new Array(e.length).fill(rn), l = await Ae(e, n), u = i ?? (() => {
@@ -4751,17 +4739,11 @@ const Or = async function(e, t, n = {}) {
   return await Q(
     l,
     async ({ items: p, startIndex: d }) => {
-      const h = je(n.listStyle, p, n.autoModeThreshold), y = lh(
-        t,
-        p,
-        h,
-        a,
-        n.responseFormat
-      );
+      const h = je(n.listStyle, p, n.autoModeThreshold), y = lh(t, p, h, a);
       try {
         const b = {
           ...n,
-          onProgress: L(o, "map:list-batch"),
+          onProgress: B(o, "map:list-batch"),
           listStyle: h
         }, f = await M(() => be(p, y, b), {
           label: "map:batch",
@@ -4786,10 +4768,10 @@ const Or = async function(e, t, n = {}) {
   ), c;
 }, Oe = async function(e, t, n) {
   [t, n] = K(t, n);
-  const { text: r, context: s } = N(t, []), o = A(Ar, n), i = I(Ar, o.onProgress, o);
-  i.start(), i.emit({ event: k.input, value: e });
+  const { text: r, context: s } = N(t, []), o = O(Ar, n), i = k(Ar, o.onProgress, o);
+  i.start(), i.emit({ event: A.input, value: e });
   try {
-    const { maxAttempts: a, maxParallel: c, errorPosture: l } = await q(o, {
+    const { maxAttempts: a, maxParallel: c, errorPosture: l } = await F(o, {
       maxAttempts: 3,
       maxParallel: 3,
       errorPosture: z.resilient
@@ -4803,16 +4785,16 @@ const Or = async function(e, t, n = {}) {
     });
     for (let b = 1; b < a; b += 1) {
       const f = [], g = [];
-      if (p.forEach((w, S) => {
-        w === rn && (f.push(S), g.push(e[S]));
+      if (p.forEach((w, v) => {
+        w === rn && (f.push(v), g.push(e[v]));
       }), g.length === 0) break;
       (await Or(g, r, {
         ...o,
         maxAttempts: a,
         maxParallel: c,
         _context: s
-      })).forEach((w, S) => {
-        p[f[S]] = w;
+      })).forEach((w, v) => {
+        p[f[v]] = w;
       });
     }
     let d = 0;
@@ -4828,7 +4810,7 @@ const Or = async function(e, t, n = {}) {
       failedItems: d,
       outcome: h
     };
-    return i.emit({ event: k.output, value: p }), i.complete(y), p;
+    return i.emit({ event: A.output, value: p }), i.complete(y), p;
   } catch (a) {
     throw i.error(a), a;
   }
@@ -4891,8 +4873,8 @@ function bh(e = "central_tendency_result", t = void 0) {
   return C(e, t || fh);
 }
 async function Wi(e, t, n = {}) {
-  const r = A(_r, n), s = I(_r, r.onProgress, r);
-  s.start(), s.emit({ event: k.input, value: e });
+  const r = O(_r, n), s = k(_r, r.onProgress, r);
+  s.start(), s.emit({ event: A.input, value: e });
   try {
     const { text: o, context: i } = N(e, []);
     if (!o || typeof o != "string")
@@ -4905,7 +4887,7 @@ ${i}` : "", p = bh("central_tendency_result"), d = await _(`${l}${u}`, {
       ...r,
       responseFormat: p
     });
-    return s.emit({ event: k.output, value: d }), s.complete({ outcome: T.success }), d;
+    return s.emit({ event: A.output, value: d }), s.complete({ outcome: T.success }), d;
   } catch (o) {
     throw s.error(o), o;
   }
@@ -4971,9 +4953,9 @@ async function Vi(e, t, n = {}) {
     return [];
   if (!Array.isArray(t) || t.length === 0)
     throw new Error("seedItems must be a non-empty array");
-  const r = A(jr, n), s = I(jr, r.onProgress, r);
-  s.start(), s.emit({ event: k.input, value: e });
-  const { batchSize: o } = await q(r, {
+  const r = O(jr, n), s = k(jr, r.onProgress, r);
+  s.start(), s.emit({ event: A.input, value: e });
+  const { batchSize: o } = await F(r, {
     batchSize: 5
   });
   try {
@@ -4981,13 +4963,13 @@ async function Vi(e, t, n = {}) {
       ...r,
       batchSize: o,
       responseFormat: wh,
-      onProgress: L(r.onProgress, "map:evaluation")
+      onProgress: B(r.onProgress, "map:evaluation")
     }), c = (p) => p && typeof p == "object" && typeof p.score == "number", l = a.filter(c).length, u = {
       totalItems: a.length,
       successCount: l,
       failureCount: a.length - l
     };
-    return s.emit({ event: k.output, value: a }), s.complete({ outcome: T.success, ...u }), a;
+    return s.emit({ event: A.output, value: a }), s.complete({ outcome: T.success, ...u }), a;
   } catch (i) {
     throw s.error(i), i;
   }
@@ -5009,12 +4991,12 @@ const Nr = {
 }, Rr = "reduce", Sh = C(
   Nr.name,
   Nr.schema
-), Ie = async function(t, n, r) {
+), ke = async function(t, n, r) {
   [n, r] = K(n, r);
-  const { text: s, context: o } = N(n, []), i = A(Rr, r), a = I(Rr, i.onProgress, i);
-  a.start(), a.emit({ event: k.input, value: t });
+  const { text: s, context: o } = N(n, []), i = O(Rr, r), a = k(Rr, i.onProgress, i);
+  a.start(), a.emit({ event: A.input, value: t });
   try {
-    const { accumulatorMode: c } = await q(i, {
+    const { accumulatorMode: c } = await F(i, {
       accumulatorMode: "auto"
     });
     let l = i.initial;
@@ -5028,7 +5010,7 @@ const Nr = {
     for (const { items: b, skip: f } of p) {
       if (f) continue;
       const g = je(i.listStyle, b, i.autoModeThreshold), m = ({ style: x, count: E }) => {
-        const O = x === ue.XML ? "XML" : "", R = o ? `
+        const I = x === me.XML ? "XML" : "", R = o ? `
 
 ${o}` : "";
         return `Start with the given accumulator. Apply the transformation instructions to each item in the list sequentially, using the result as the new accumulator each time. Return only the final accumulator.
@@ -5046,15 +5028,15 @@ ${$(l !== void 0 ? l : "No initial value - use first item as starting point", {
           tag: "accumulator"
         })}
 
-Process exactly ${E} items from the ${O} list below and return the final accumulator value.${R}`;
-      }, w = i.responseFormat || Sh, S = m({ style: g, count: b.length }), v = {
+Process exactly ${E} items from the ${I} list below and return the final accumulator value.${R}`;
+      }, w = i.responseFormat || Sh, v = m({ style: g, count: b.length }), S = {
         ...i,
         listStyle: g,
         responseFormat: w
-      }, P = await M(() => be(b, S, v), {
+      }, P = await M(() => be(b, v, S), {
         label: "reduce:batch",
         config: i,
-        onProgress: L(i.onProgress, "batch")
+        onProgress: B(i.onProgress, "batch")
       });
       !i.responseFormat && P?.accumulator !== void 0 ? l = P.accumulator : l = P, d(b.length);
     }
@@ -5068,12 +5050,12 @@ Process exactly ${E} items from the ${O} list below and return the final accumul
       totalBatches: h.length,
       outcome: T.success
     };
-    return a.emit({ event: k.output, value: l }), a.complete(y), l;
+    return a.emit({ event: A.output, value: l }), a.complete(y), l;
   } catch (c) {
     throw a.error(c), c;
   }
 };
-Ie.knownTexts = [];
+ke.knownTexts = [];
 const Mr = {
   name: "pattern_candidates",
   schema: {
@@ -5127,9 +5109,9 @@ function sn(e, t = 50, n = 10) {
   return r;
 }
 async function Ji(e, t = {}) {
-  const n = A(Lr, t), r = I(Lr, n.onProgress, n);
-  r.start(), r.emit({ event: k.input, value: e });
-  const { maxStringLength: s, maxArrayLength: o, topN: i, capacity: a } = await q(n, {
+  const n = O(Lr, t), r = k(Lr, n.onProgress, n);
+  r.start(), r.emit({ event: A.input, value: e });
+  const { maxStringLength: s, maxArrayLength: o, topN: i, capacity: a } = await F(n, {
     thoroughness: J(xh, ["topN", "capacity"]),
     maxStringLength: 50,
     maxArrayLength: 10
@@ -5162,28 +5144,28 @@ async function Ji(e, t = {}) {
     Return all candidates. If the input list is empty, return an empty array.
   `;
   try {
-    const p = r.batch(l.length), d = await Ie(l, u, {
+    const p = r.batch(l.length), d = await ke(l, u, {
       ...n,
       initial: [],
       responseFormat: $h,
-      onProgress: L(n.onProgress, "reduce:accumulate")
+      onProgress: B(n.onProgress, "reduce:accumulate")
     });
     if (p(l.length), !Array.isArray(d))
       return r.complete({ outcome: T.success }), [];
     const h = d.filter((y) => y.type === "pattern" && y.count >= 2).toSorted((y, b) => b.count - y.count).map((y) => y.template).slice(0, i);
-    return r.emit({ event: k.output, value: h }), r.complete({ outcome: T.success }), h;
+    return r.emit({ event: A.output, value: h }), r.complete({ outcome: T.success }), h;
   } catch (p) {
     throw r.error(p), p;
   }
 }
 Ji.knownTexts = [];
-const Ph = () => !!D("VERBLETS_DEBUG"), ne = (...e) => {
+const Ph = () => !!q("VERBLETS_DEBUG"), ne = (...e) => {
   Ph() && console.error(...e);
-}, Th = "http://json-schema.org/draft-07/schema#", Eh = "object", Ih = ["thresholdCandidates"], kh = { thresholdCandidates: { type: "array", items: { type: "object", required: ["value", "rationale", "percentilePosition", "riskProfile", "falsePositiveRate", "falseNegativeRate", "confidence"], properties: { value: { type: "number", description: "The recommended threshold value" }, rationale: { type: "string", description: "Human-readable explanation of why this threshold was selected" }, percentilePosition: { type: "number", minimum: 0, maximum: 100, description: "Where this threshold falls in the distribution (0-100)" }, riskProfile: { type: "string", enum: ["conservative", "balanced", "aggressive"], description: "The risk stance this threshold represents" }, falsePositiveRate: { type: "number", minimum: 0, maximum: 1, description: "Estimated rate of false positives with this threshold" }, falseNegativeRate: { type: "number", minimum: 0, maximum: 1, description: "Estimated rate of false negatives with this threshold" }, confidence: { type: "number", minimum: 0, maximum: 1, description: "Model's confidence in this threshold recommendation (0-1)" }, coverageAbove: { type: "number", minimum: 0, maximum: 1, description: "Proportion of data points above this threshold" }, coverageBelow: { type: "number", minimum: 0, maximum: 1, description: "Proportion of data points below this threshold" }, distributionInsight: { type: "string", description: "Key insight about the distribution at this threshold (e.g., 'natural break in bimodal distribution')" } }, additionalProperties: !1 } }, distributionAnalysis: { type: "object", properties: { mean: { type: "number" }, median: { type: "number" }, standardDeviation: { type: "number" }, skewness: { type: "string", enum: ["left", "right", "normal"], description: "Direction of distribution skew" }, outlierPresence: { type: "string", enum: ["none", "low", "moderate", "high"], description: "Presence of outliers in the distribution" }, distributionType: { type: "string", enum: ["normal", "bimodal", "multimodal", "uniform", "exponential", "long-tail"], description: "Identified distribution pattern" } }, additionalProperties: !1 } }, Ah = !1, Oh = {
+}, Th = "http://json-schema.org/draft-07/schema#", Eh = "object", kh = ["thresholdCandidates"], Ih = { thresholdCandidates: { type: "array", items: { type: "object", required: ["value", "rationale", "percentilePosition", "riskProfile", "falsePositiveRate", "falseNegativeRate", "confidence"], properties: { value: { type: "number", description: "The recommended threshold value" }, rationale: { type: "string", description: "Human-readable explanation of why this threshold was selected" }, percentilePosition: { type: "number", minimum: 0, maximum: 100, description: "Where this threshold falls in the distribution (0-100)" }, riskProfile: { type: "string", enum: ["conservative", "balanced", "aggressive"], description: "The risk stance this threshold represents" }, falsePositiveRate: { type: "number", minimum: 0, maximum: 1, description: "Estimated rate of false positives with this threshold" }, falseNegativeRate: { type: "number", minimum: 0, maximum: 1, description: "Estimated rate of false negatives with this threshold" }, confidence: { type: "number", minimum: 0, maximum: 1, description: "Model's confidence in this threshold recommendation (0-1)" }, coverageAbove: { type: "number", minimum: 0, maximum: 1, description: "Proportion of data points above this threshold" }, coverageBelow: { type: "number", minimum: 0, maximum: 1, description: "Proportion of data points below this threshold" }, distributionInsight: { type: "string", description: "Key insight about the distribution at this threshold (e.g., 'natural break in bimodal distribution')" } }, additionalProperties: !1 } }, distributionAnalysis: { type: "object", properties: { mean: { type: "number" }, median: { type: "number" }, standardDeviation: { type: "number" }, skewness: { type: "string", enum: ["left", "right", "normal"], description: "Direction of distribution skew" }, outlierPresence: { type: "string", enum: ["none", "low", "moderate", "high"], description: "Presence of outliers in the distribution" }, distributionType: { type: "string", enum: ["normal", "bimodal", "multimodal", "uniform", "exponential", "long-tail"], description: "Identified distribution pattern" } }, additionalProperties: !1 } }, Ah = !1, Oh = {
   $schema: Th,
   type: Eh,
-  required: Ih,
-  properties: kh,
+  required: kh,
+  properties: Ih,
   additionalProperties: Ah
 }, Br = "detect-threshold";
 function Ki(e, t) {
@@ -5212,9 +5194,9 @@ function Ki(e, t) {
 }
 async function Gi(e, t, n, r) {
   [n, r] = K(n, r);
-  const { text: s, context: o } = N(n, []), i = A(Br, { llm: { good: !0 }, ...r }), a = I(Br, i.onProgress, i);
+  const { text: s, context: o } = N(n, []), i = O(Br, { llm: { good: !0 }, ...r }), a = k(Br, i.onProgress, i);
   a.start();
-  const { batchSize: c } = await q(i, {
+  const { batchSize: c } = await F(i, {
     batchSize: 50
   });
   if (!e || !Array.isArray(e) || e.length === 0)
@@ -5225,7 +5207,7 @@ async function Gi(e, t, n, r) {
     throw new Error("Goal must be specified to determine appropriate thresholds");
   try {
     const l = r.stats ?? Ki(e, t);
-    a.emit({ event: k.phase, phase: "statistics", stats: l });
+    a.emit({ event: A.phase, phase: "statistics", stats: l });
     const u = e.map((P) => ({
       value: P[t],
       percentileRank: Math.round(
@@ -5293,14 +5275,14 @@ Return the updated accumulator as valid JSON.`, o].filter(Boolean).join(`
       const x = u.slice(P, P + b);
       f.push(JSON.stringify(x));
     }
-    a.emit({ event: k.phase, phase: "enriched", enrichedData: u });
-    const m = await Ie(f, y, {
+    a.emit({ event: A.phase, phase: "enriched", enrichedData: u });
+    const m = await ke(f, y, {
       ...i,
       initial: JSON.stringify(d),
       batchSize: c,
       responseFormat: C("analysis_accumulator", p),
-      onProgress: L(i.onProgress, "reduce:analysis")
-    }), S = [`Based on the following analysis of ${l.count} data points for property "${t}", generate threshold recommendations.
+      onProgress: B(i.onProgress, "reduce:analysis")
+    }), v = [`Based on the following analysis of ${l.count} data points for property "${t}", generate threshold recommendations.
 
 ${$(s, { tag: "goal" })}
 
@@ -5333,8 +5315,8 @@ Generate specific threshold recommendations that:
 
 Return threshold candidates with their rationales.`, o].filter(Boolean).join(`
 
-`), v = await M(
-      () => _(S, {
+`), S = await M(
+      () => _(v, {
         ...i,
         responseFormat: C("threshold_result", Oh)
       }),
@@ -5343,9 +5325,9 @@ Return threshold candidates with their rationales.`, o].filter(Boolean).join(`
         config: i
       }
     );
-    return v.thresholdCandidates && (v.thresholdCandidates = v.thresholdCandidates.filter((P) => P.value < l.min || P.value > l.max ? (ne(
+    return S.thresholdCandidates && (S.thresholdCandidates = S.thresholdCandidates.filter((P) => P.value < l.min || P.value > l.max ? (ne(
       `Threshold value ${P.value} is outside data range [${l.min}, ${l.max}]`
-    ), !1) : !0)), v.distributionAnalysis = {
+    ), !1) : !0)), S.distributionAnalysis = {
       mean: l.mean,
       median: l.median,
       standardDeviation: l.stdDev,
@@ -5353,7 +5335,7 @@ Return threshold candidates with their rationales.`, o].filter(Boolean).join(`
       max: l.max,
       percentiles: l.percentiles,
       dataPoints: l.count
-    }, a.complete({ outcome: T.success }), v;
+    }, a.complete({ outcome: T.success }), S;
   } catch (l) {
     throw a.error(l), l;
   }
@@ -5374,7 +5356,7 @@ function Lh({ spec: e, text: t, ...n }) {
   };
 }
 async function Yi(e, t = {}) {
-  const n = A("entities:spec", t), r = "You are an entity specification generator. Create a clear, concise specification for entity extraction.", s = `Analyze these entity extraction instructions and generate a specification.
+  const n = O("entities:spec", t), r = "You are an entity specification generator. Create a clear, concise specification for entity extraction.", s = `Analyze these entity extraction instructions and generate a specification.
 
 ${$(e, { tag: "entity-instructions" })}
 
@@ -5396,7 +5378,7 @@ Keep it simple and actionable.`;
   );
 }
 async function Bh(e, t, n = {}) {
-  const r = A("entities:apply", n), s = `Apply the entity specification to extract entities from this text.
+  const r = O("entities:apply", n), s = `Apply the entity specification to extract entities from this text.
 
 ${$(t, { tag: "entity-specification" })}
 
@@ -5420,11 +5402,11 @@ Include every entity that matches the specification. Do not add properties beyon
 }
 async function Hi(e, t, n) {
   [t, n] = K(t, n, ["spec"]);
-  const { text: r, known: s, context: o } = N(t, ["spec"]), i = A(Dr, n), a = I(Dr, i.onProgress, i);
+  const { text: r, known: s, context: o } = N(t, ["spec"]), i = O(Dr, n), a = k(Dr, i.onProgress, i);
   a.start();
   try {
     a.emit({
-      event: k.step,
+      event: A.step,
       stepName: "generating-specification",
       instructions: r
     });
@@ -5432,12 +5414,12 @@ async function Hi(e, t, n) {
 
 ${o}` : r, {
       ...i,
-      onProgress: L(i.onProgress, "spec")
+      onProgress: B(i.onProgress, "spec")
     });
-    a.emit({ event: k.step, stepName: "extracting-entities", specification: c });
+    a.emit({ event: A.step, stepName: "extracting-entities", specification: c });
     const l = await Bh(e, c, {
       ...i,
-      onProgress: L(i.onProgress, "apply")
+      onProgress: B(i.onProgress, "apply")
     });
     return a.complete({ outcome: T.success }), l;
   } catch (c) {
@@ -5507,9 +5489,9 @@ async function Xi(e, t, n) {
   [t, n] = K(t, n);
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A(qr, n), a = I(qr, i.onProgress, i);
-  a.start(), a.emit({ event: k.input, value: e });
-  const { maxParallel: c, windowSize: l, overlapSize: u, maxAttempts: p, retryMode: d, retryOnAll: h } = await q(i, {
+${s}` : r, i = O(qr, n), a = k(qr, i.onProgress, i);
+  a.start(), a.emit({ event: A.input, value: e });
+  const { maxParallel: c, windowSize: l, overlapSize: u, maxAttempts: p, retryMode: d, retryOnAll: h } = await F(i, {
     precision: J(qh, ["windowSize", "overlapSize"]),
     maxParallel: 3,
     maxAttempts: void 0,
@@ -5524,7 +5506,7 @@ ${s}` : r, i = A(qr, n), a = I(qr, i.onProgress, i);
     for (let x = 0; x < b; x += l - u)
       f.push(x);
     a.emit({
-      event: k.phase,
+      event: A.phase,
       phase: "windowing",
       totalLines: b,
       windowCount: f.length,
@@ -5537,17 +5519,17 @@ ${s}` : r, i = A(qr, n), a = I(qr, i.onProgress, i);
       totalItems: f.length,
       totalBatches: f.length,
       maxParallel: c
-    }), a.emit({ event: k.phase, phase: "extraction" });
+    }), a.emit({ event: A.phase, phase: "extraction" });
     const m = await Q(
       f,
       async (x) => {
-        const E = Math.min(x + l, b), O = y.slice(x, E), R = zh(O, x, o), j = await M(
+        const E = Math.min(x + l, b), I = y.slice(x, E), R = zh(I, x, o), j = await M(
           async () => {
-            const F = await _(R, {
+            const L = await _(R, {
               ...i,
               responseFormat: Qi
             });
-            return Fh(F);
+            return Fh(L);
           },
           {
             label: "extract-blocks:window",
@@ -5555,7 +5537,7 @@ ${s}` : r, i = A(qr, n), a = I(qr, i.onProgress, i);
             maxAttempts: p,
             retryMode: d,
             retryOnAll: h,
-            onProgress: L(i.onProgress, "window")
+            onProgress: B(i.onProgress, "window")
           }
         );
         return g(1), j;
@@ -5567,26 +5549,26 @@ ${s}` : r, i = A(qr, n), a = I(qr, i.onProgress, i);
       }
     );
     a.emit({
-      event: k.phase,
+      event: A.phase,
       phase: "merging",
       rawBlocks: m.flat().length
     });
-    const w = m.flat().filter((x) => x && x.startLine !== void 0 && x.endLine !== void 0).toSorted((x, E) => x.startLine - E.startLine || E.endLine - x.endLine), S = [];
+    const w = m.flat().filter((x) => x && x.startLine !== void 0 && x.endLine !== void 0).toSorted((x, E) => x.startLine - E.startLine || E.endLine - x.endLine), v = [];
     for (const x of w) {
-      const E = S[S.length - 1];
-      !E || x.startLine > E.endLine ? S.push({ ...x }) : x.endLine > E.endLine && (E.endLine = x.endLine);
+      const E = v[v.length - 1];
+      !E || x.startLine > E.endLine ? v.push({ ...x }) : x.endLine > E.endLine && (E.endLine = x.endLine);
     }
-    const v = S.map(
+    const S = v.map(
       ({ startLine: x, endLine: E }) => y.slice(x, E + 1)
     );
     a.progress({
       event: W.complete,
       totalItems: f.length,
       processedItems: g.count,
-      blocksExtracted: v.length
+      blocksExtracted: S.length
     });
-    const P = { blocksExtracted: v.length, outcome: T.success };
-    return a.emit({ event: k.output, value: v }), a.complete(P), v;
+    const P = { blocksExtracted: S.length, outcome: T.success };
+    return a.emit({ event: A.output, value: S }), a.complete(P), S;
   } catch (y) {
     throw a.error(y), y;
   }
@@ -5625,13 +5607,13 @@ const zr = {
   zr.schema
 ), Zi = async function(t, n, r) {
   [n, r] = K(n, r, ["guidance"]);
-  const { text: s, known: o, context: i } = N(n, ["guidance"]), a = A(Ur, r), c = I(Ur, a.onProgress, a);
-  c.start(), c.emit({ event: k.input, value: t });
+  const { text: s, known: o, context: i } = N(n, ["guidance"]), a = O(Ur, r), c = k(Ur, a.onProgress, a);
+  c.start(), c.emit({ event: A.input, value: t });
   const {
     guidance: l,
     errorPosture: u,
     maxParallel: p = 3
-  } = await q(a, {
+  } = await F(a, {
     strictness: J(Uh, ["guidance", "errorPosture"])
   }), d = o.guidance ?? l, h = new Array(t.length), y = await Ae(t, a), b = c.batch(t.length);
   c.progress({
@@ -5639,7 +5621,7 @@ const zr = {
     totalItems: t.length,
     totalBatches: y.length
   });
-  const f = ({ style: S, count: v }) => {
+  const f = ({ style: v, count: S }) => {
     const P = d ? `
 
 ${$(d, { tag: "borderline-handling" })}` : "", x = i ? `
@@ -5653,34 +5635,42 @@ IMPORTANT:
 - Consider all aspects of the filtering criteria
 - Return only "yes" or "no" for each item
 - Maintain the exact order of the input list${x}`;
-    return S === ue.NEWLINE ? `${E}
+    return v === me.NEWLINE ? `${E}
 
-Process exactly ${v} items from the list below and return ${v} yes/no decisions.` : `${E}
+Process exactly ${S} items from the list below and return ${S} yes/no decisions.` : `${E}
 
-Process exactly ${v} items from the XML list below and return ${v} yes/no decisions.`;
+Process exactly ${S} items from the XML list below and return ${S} yes/no decisions.`;
   };
   await Q(
     y,
-    async ({ items: S, startIndex: v }) => {
-      const P = je(a.listStyle, S, a.autoModeThreshold), x = f({ style: P, count: S.length }), E = {
+    async ({ items: v, startIndex: S }) => {
+      const P = je(a.listStyle, v, a.autoModeThreshold), x = f({ style: P, count: v.length }), E = {
         ...a,
         listStyle: P,
         responseFormat: a.responseFormat ?? Wh
       };
       try {
-        const O = await M(() => be(S, x, E), {
+        const I = await M(() => be(v, x, E), {
           label: "filter:batch",
           config: a,
-          onProgress: L(a.onProgress, "batch")
+          onProgress: B(a.onProgress, "batch")
         });
-        S.forEach((R, j) => {
-          h[v + j] = O[j]?.toLowerCase().trim() === "yes";
-        }), b(S.length);
-      } catch (O) {
-        if (O.name === "AbortError" || a?.abortSignal?.aborted || u === z.strict) throw O;
-        c.error(O, { startIndex: v, itemCount: S.length });
-        for (let R = 0; R < S.length; R++)
-          h[v + R] = !1;
+        if (!Array.isArray(I) || I.length !== v.length) {
+          const R = Array.isArray(I) ? I : [], j = Math.min(R.length, v.length);
+          for (let L = 0; L < j; L++)
+            h[S + L] = R[L]?.toLowerCase().trim() === "yes";
+          for (let L = j; L < v.length; L++)
+            h[S + L] = !1;
+        } else
+          for (let R = 0; R < v.length; R++)
+            h[S + R] = I[R]?.toLowerCase().trim() === "yes";
+        b(v.length);
+      } catch (I) {
+        if (I.name === "AbortError" || a?.abortSignal?.aborted || u === z.strict) throw I;
+        c.error(I, { startIndex: S, itemCount: v.length });
+        for (let R = 0; R < v.length; R++)
+          h[S + R] = !1;
+        b(v.length);
       }
     },
     {
@@ -5689,14 +5679,14 @@ Process exactly ${v} items from the XML list below and return ${v} yes/no decisi
       abortSignal: a.abortSignal
     }
   );
-  const g = t.filter((S, v) => h[v]);
+  const g = t.filter((v, S) => h[S]);
   c.progress({
     event: W.complete,
     totalItems: t.length,
     processedItems: b.count
   });
-  const m = h.some((S) => S === void 0) ? T.partial : T.success, w = { inputCount: t.length, outputCount: g.length, outcome: m };
-  return c.emit({ event: k.output, value: g }), c.complete(w), g;
+  const m = h.some((v) => v === void 0) ? T.partial : T.success, w = { inputCount: t.length, outputCount: g.length, outcome: m };
+  return c.emit({ event: A.output, value: g }), c.complete(w), g;
 };
 Zi.knownTexts = ["guidance"];
 const Wr = {
@@ -5719,15 +5709,15 @@ const Wr = {
   }
 }, Vr = "find", Vh = C(Wr.name, Wr.schema), ea = async function(t, n, r) {
   [n, r] = K(n, r);
-  const { text: s, context: o } = N(n, []), i = A(Vr, r), a = I(Vr, i.onProgress, i);
-  a.start(), a.emit({ event: k.input, value: t });
-  const { maxParallel: c, errorPosture: l } = await q(i, {
+  const { text: s, context: o } = N(n, []), i = O(Vr, r), a = k(Vr, i.onProgress, i);
+  a.start(), a.emit({ event: A.input, value: t });
+  const { maxParallel: c, errorPosture: l } = await F(i, {
     maxParallel: 3,
     errorPosture: z.resilient
   }), u = ({ style: g, count: m }) => {
     const w = o ? `
 
-${o}` : "", S = `From the list below, identify and return the SINGLE item that BEST matches the search criteria.
+${o}` : "", v = `From the list below, identify and return the SINGLE item that BEST matches the search criteria.
 
 ${$(s, { tag: "search-criteria" })}
 
@@ -5737,9 +5727,9 @@ IMPORTANT:
 - Return the complete original item text, unchanged
 - If NO items match the criteria, return an empty string
 - Return ONLY ONE item, even if multiple items match${w}`;
-    return g === ue.NEWLINE ? `${S}
+    return g === me.NEWLINE ? `${v}
 
-Process exactly ${m} items from the list below and return the single best match.` : `${S}
+Process exactly ${m} items from the list below and return the single best match.` : `${v}
 
 Process exactly ${m} items from the XML list below and return the single best match.`;
   }, p = [];
@@ -5754,29 +5744,29 @@ Process exactly ${m} items from the XML list below and return the single best ma
     const m = b.slice(g, g + c);
     await Q(
       m,
-      async ({ items: w, startIndex: S }) => {
-        const v = je(i.listStyle, w, i.autoModeThreshold);
+      async ({ items: w, startIndex: v }) => {
+        const S = je(i.listStyle, w, i.autoModeThreshold);
         try {
           const P = await M(
-            () => be(w, u({ style: v, count: w.length }), {
+            () => be(w, u({ style: S, count: w.length }), {
               ...i,
-              listStyle: v,
+              listStyle: S,
               responseFormat: i.responseFormat || Vh
             }),
             {
               label: "find:batch",
               config: i,
-              onProgress: L(i.onProgress, "batch")
+              onProgress: B(i.onProgress, "batch")
             }
           ), x = Array.isArray(P) && P[0];
           if (x) {
-            const E = t.findIndex((R) => R === x), O = E !== -1 ? E : S;
-            p.push({ result: x, index: O });
+            const E = t.findIndex((R) => R === x), I = E !== -1 ? E : v;
+            p.push({ result: x, index: I });
           }
           y(w.length);
         } catch (P) {
-          if (a.error(P, { startIndex: S, itemCount: w.length }), l === z.strict) throw P;
-          ne(`find batch at index ${S} failed: ${P.message}`);
+          if (a.error(P, { startIndex: v, itemCount: w.length }), l === z.strict) throw P;
+          ne(`find batch at index ${v} failed: ${P.message}`);
         }
       },
       {
@@ -5793,12 +5783,12 @@ Process exactly ${m} items from the XML list below and return the single best ma
     found: p.length > 0
   }), p.length > 0) {
     const g = p.reduce(
-      (w, S) => S.index < w.index ? S : w
+      (w, v) => v.index < w.index ? v : w
     ), m = { found: !0, totalItems: t.length, outcome: T.success };
-    return a.emit({ event: k.output, value: g.result }), a.complete(m), g.result;
+    return a.emit({ event: A.output, value: g.result }), a.complete(m), g.result;
   }
   const f = { found: !1, totalItems: t.length, outcome: T.success };
-  return a.emit({ event: k.output, value: "" }), a.complete(f), "";
+  return a.emit({ event: A.output, value: "" }), a.complete(f), "";
 };
 ea.knownTexts = [];
 const Jh = "http://json-schema.org/draft-07/schema#", Kh = "object", Gh = { items: { type: "array", description: "Array of sorted items", items: { type: "string", description: "A sorted item" } } }, Yh = ["items"], Hh = !1, Qh = {
@@ -5815,9 +5805,9 @@ const Jh = "http://json-schema.org/draft-07/schema#", Kh = "object", Gh = { item
 let ef = si;
 const tf = 10, nf = (e) => [...new Set(e.filter((t) => t.trim() !== ""))], Bn = async (e, t, n) => {
   [t, n] = K(t, n);
-  const { text: r, context: s } = N(t, []), o = A(Jr, n), i = I(Jr, o.onProgress, o);
+  const { text: r, context: s } = N(t, []), o = O(Jr, n), i = k(Jr, o.onProgress, o);
   i.start();
-  const { batchSize: a, extremeK: c, iterations: l, selectBottom: u } = await q(o, {
+  const { batchSize: a, extremeK: c, iterations: l, selectBottom: u } = await F(o, {
     effort: J(Xh, ["extremeK", "iterations", "selectBottom"]),
     batchSize: tf
   }), p = nf(e);
@@ -5830,8 +5820,8 @@ const tf = 10, nf = (e) => [...new Set(e.filter((t) => t.trim() !== ""))], Bn =
       iterations: l,
       criteria: t
     });
-    const d = async (v) => {
-      const P = ef({ description: r }, v);
+    const d = async (S) => {
+      const P = ef({ description: r }, S);
       if (Array.isArray(P))
         return P;
       const x = s ? `${P}
@@ -5842,67 +5832,67 @@ ${s}` : P, E = await M(
           label: "sort-batch",
           config: o
         }
-      ), O = E?.items || E;
-      return Array.isArray(O) ? O.filter(Boolean) : [];
-    }, h = async (v, P) => {
-      const x = Ce(a)(v);
-      let E = [], O = [], R = 0;
+      ), I = E?.items || E;
+      return Array.isArray(I) ? I.filter(Boolean) : [];
+    }, h = async (S, P) => {
+      const x = Ce(a)(S);
+      let E = [], I = [], R = 0;
       const j = i.batch(x.length);
-      for (const F of x) {
+      for (const L of x) {
         i.emit({
-          event: k.step,
+          event: A.step,
           stepName: "sorting-chunk",
           iteration: P,
           chunkNumber: R + 1,
           totalChunks: x.length,
-          batchSize: F.length
+          batchSize: L.length
         });
-        const V = [...F, ...E, ...u ? O : []];
+        const V = [...L, ...E, ...u ? I : []];
         let Y = await d(V);
         const H = new Set(V), ee = new Set(Y);
         if (Y.length !== V.length || ee.size !== H.size) {
-          const pe = V.filter((te) => !ee.has(te));
+          const ue = V.filter((te) => !ee.has(te));
           Y = [...Y.filter(
-            (te, ie, de) => H.has(te) && de.indexOf(te) === ie
-          ), ...pe], Y.length !== V.length && ne(`Sort mismatch: sent ${V.length}, got ${Y.length}`);
+            (te, ie, pe) => H.has(te) && pe.indexOf(te) === ie
+          ), ...ue], Y.length !== V.length && ne(`Sort mismatch: sent ${V.length}, got ${Y.length}`);
         }
         if (E = Y.slice(0, Math.min(c, Y.length)), u) {
-          const pe = Math.max(0, Y.length - E.length), G = Math.min(c, pe);
-          O = G > 0 ? Y.slice(-G) : [];
+          const ue = Math.max(0, Y.length - E.length), G = Math.min(c, ue);
+          I = G > 0 ? Y.slice(-G) : [];
         }
         R++, j(1);
       }
       return {
         top: E,
-        bottom: u ? O : [],
-        selected: /* @__PURE__ */ new Set([...E, ...u ? O : []])
+        bottom: u ? I : [],
+        selected: /* @__PURE__ */ new Set([...E, ...u ? I : []])
       };
     }, y = [], b = [];
     let f = p;
-    for (let v = 0; v < l && f.length > 0; v++) {
+    for (let S = 0; S < l && f.length > 0; S++) {
       i.emit({
-        event: k.step,
+        event: A.step,
         stepName: "extracting-extremes",
-        iteration: v + 1,
+        iteration: S + 1,
         totalIterations: l,
         remainingItems: f.length
       });
-      const { top: P, bottom: x, selected: E } = await h(f, v + 1);
-      y.push(...P), u && b.unshift(...x), f = f.filter((O) => !E.has(O)), i.emit({
-        event: k.step,
+      const { top: P, bottom: x, selected: E } = await h(f, S + 1);
+      y.push(...P), u && b.unshift(...x), f = f.filter((I) => !E.has(I)), i.emit({
+        event: A.step,
         stepName: "iteration-complete",
-        iteration: v + 1,
+        iteration: S + 1,
         totalIterations: l,
         topCount: y.length,
         bottomCount: b.length,
         remainingItems: f.length
       });
     }
-    const g = u ? [...y, ...f, ...b] : [...y, ...f], m = new Set(p), w = /* @__PURE__ */ new Set(), S = [];
-    for (const v of g)
-      m.has(v) && !w.has(v) && (w.add(v), S.push(v));
-    for (const v of p)
-      w.has(v) || S.push(v);
+    const g = u ? [...y, ...f, ...b] : [...y, ...f], m = new Set(p), w = /* @__PURE__ */ new Set(), v = [];
+    for (const S of g)
+      m.has(S) && !w.has(S) && (w.add(S), v.push(S));
+    for (const S of p)
+      w.has(S) || v.push(S);
     return i.progress({
       event: W.complete,
       totalItems: p.length,
@@ -5910,7 +5900,7 @@ ${s}` : P, E = await M(
       topItems: y.length,
       bottomItems: b.length,
       remainingItems: f.length
-    }), i.complete({ outcome: T.success, totalItems: p.length }), S;
+    }), i.complete({ outcome: T.success, totalItems: p.length }), v;
   } catch (d) {
     throw i.error(d), d;
   }
@@ -5950,9 +5940,9 @@ const Kr = {
   Kr.schema
 );
 async function ta(e, t = {}) {
-  const { text: n, known: r, context: s } = N(e, ["terms"]), o = A(Gr, t), i = I(Gr, o.onProgress, o);
+  const { text: n, known: r, context: s } = N(e, ["terms"]), o = O(Gr, t), i = k(Gr, o.onProgress, o);
   i.start();
-  const { maxTerms: a, sortBy: c, sentencesPerBatch: l, overlap: u } = await q(o, {
+  const { maxTerms: a, sortBy: c, sentencesPerBatch: l, overlap: u } = await F(o, {
     maxTerms: 10,
     sortBy: "importance for understanding the content",
     sentencesPerBatch: 3,
@@ -5977,25 +5967,25 @@ async function ta(e, t = {}) {
 
 Return a "terms" object containing an array of the extracted terms.${s ? `
 
-${s}` : ""}`, S = await Oe(f, w, {
+${s}` : ""}`, v = await Oe(f, w, {
         ...o,
         batchSize: o.batchSize ?? 1,
         responseFormat: rf,
-        onProgress: L(o.onProgress, "glossary:extract")
+        onProgress: B(o.onProgress, "glossary:extract")
       });
       g(f.length);
-      const v = /* @__PURE__ */ new Set();
-      S.forEach((P) => {
+      const S = /* @__PURE__ */ new Set();
+      v.forEach((P) => {
         P && P.terms && Array.isArray(P.terms) && P.terms.forEach((x) => {
-          x && typeof x == "string" && v.add(x);
+          x && typeof x == "string" && S.add(x);
         });
-      }), p = Array.from(v);
+      }), p = Array.from(S);
     }
-    if (i.emit({ event: k.phase, phase: "extracted", terms: p }), p.length === 0)
+    if (i.emit({ event: A.phase, phase: "extracted", terms: p }), p.length === 0)
       return i.complete({ outcome: T.success, terms: 0 }), [];
     const h = (await Bn(p, c, {
       ...o,
-      onProgress: L(o.onProgress, "glossary:sort")
+      onProgress: B(o.onProgress, "glossary:sort")
     })).slice(0, a);
     return i.complete({ outcome: T.success, terms: h.length }), h;
   } catch (p) {
@@ -6034,17 +6024,13 @@ PROCESS:
 
 OUTPUT FORMAT:
 The accumulator should contain a comma-separated list of the current best category names.`;
-}, af = (e) => ({ style: t, count: n }) => {
-  const r = e.join(", "), s = `Assign each item in the list below to one of these categories:
+}, af = (e) => ({ count: t }) => {
+  const n = e.join(", ");
+  return `Assign each item in the list below to one of these categories:
 
-${$(r, { tag: "categories" })}
+${$(n, { tag: "categories" })}
 
-Return exactly ${n} category names, one per line, in the same order as the input items.`;
-  return t === ue.NEWLINE ? `${s}
-
-Process exactly ${n} items from the list below.` : `${s}
-
-Process exactly ${n} items from the XML list below.`;
+Return exactly ${t} category names in the items array, one per input item, in the same order as the input list.`;
 }, Hr = (e) => e.split(/[,\n]/).map((t) => t.trim()).filter(Boolean), cf = (e) => {
   const t = {};
   for (const { items: n, labels: r } of e)
@@ -6059,14 +6045,14 @@ Process exactly ${n} items from the XML list below.`;
 };
 async function na(e, t, n) {
   [t, n] = K(t, n, ["categories"]);
-  const { text: r, known: s, context: o } = N(t, ["categories"]), i = A(Yr, n), a = I(Yr, i.onProgress, i);
+  const { text: r, known: s, context: o } = N(t, ["categories"]), i = O(Yr, n), a = k(Yr, i.onProgress, i);
   a.start();
   const {
     guidance: c,
     maxParallel: l,
     errorPosture: u,
     topN: p
-  } = await q(i, {
+  } = await F(i, {
     granularity: J(sf, ["guidance", "topN"]),
     maxParallel: 3,
     errorPosture: z.resilient
@@ -6076,7 +6062,7 @@ async function na(e, t, n) {
     f = Hr(s.categories);
   else {
     a.emit({
-      event: k.phase,
+      event: A.phase,
       phase: "category-discovery",
       description: "Discovering categories from items"
     });
@@ -6084,16 +6070,16 @@ async function na(e, t, n) {
       r,
       d,
       c
-    ), F = await Ie(e, j, {
+    ), L = await ke(e, j, {
       ...i,
       initial: "",
       now: b,
-      onProgress: L(i.onProgress, "reduce:category-discovery")
+      onProgress: B(i.onProgress, "reduce:category-discovery")
     });
-    f = Hr(F);
+    f = Hr(L);
   }
   f.length === 0 && f.push("other"), a.emit({
-    event: k.phase,
+    event: A.phase,
     phase: "assignment",
     description: "Assigning items to categories",
     categories: f,
@@ -6101,35 +6087,31 @@ async function na(e, t, n) {
   });
   const g = [], m = af(f), w = o ? (j) => `${m(j)}
 
-${o}` : m, v = await Ae(e, i), P = a.batch(e.length);
+${o}` : m, S = await Ae(e, i), P = a.batch(e.length);
   await Q(
-    v,
-    async ({ items: j, startIndex: F }) => {
+    S,
+    async ({ items: j, startIndex: L }) => {
       const V = je(h, j, y);
       try {
         const Y = {
           ...i,
           listStyle: V
         }, H = await M(
-          () => be(
-            j,
-            w({ style: V, count: j.length }),
-            Y
-          ),
+          () => be(j, w({ count: j.length }), Y),
           {
             label: "group:batch",
             config: i,
-            onProgress: L(i.onProgress, "assign")
+            onProgress: B(i.onProgress, "assign")
           }
         );
         if (!Array.isArray(H) || H.length !== j.length) {
           const ee = new Array(j.length).fill("other");
-          g.push({ items: j, labels: ee, startIndex: F });
+          g.push({ items: j, labels: ee, startIndex: L });
         } else
-          g.push({ items: j, labels: H, startIndex: F });
+          g.push({ items: j, labels: H, startIndex: L });
         P(j.length);
       } catch (Y) {
-        throw a.error(Y, { startIndex: F, itemCount: j.length }), Y;
+        throw a.error(Y, { startIndex: L, itemCount: j.length }), Y;
       }
     },
     {
@@ -6138,8 +6120,8 @@ ${o}` : m, v = await Ae(e, i), P = a.batch(e.length);
       abortSignal: i.abortSignal
     }
   );
-  const x = g.toSorted((j, F) => j.startIndex - F.startIndex), E = cf(x), O = p ? lf(E, p) : E, R = Object.keys(O).length;
-  return a.complete({ groupCount: R, outcome: T.success }), O;
+  const x = g.toSorted((j, L) => j.startIndex - L.startIndex), E = cf(x), I = p ? lf(E, p) : E, R = Object.keys(I).length;
+  return a.complete({ groupCount: R, outcome: T.success }), I;
 }
 na.knownTexts = ["categories"];
 const uf = "http://json-schema.org/draft-07/schema#", pf = "object", df = { items: { type: "array", description: "Array of common features, instances, or relational links shared by all items", items: { type: "string", description: "A common feature, instance, or relational link" } } }, mf = ["items"], hf = !1, ff = {
@@ -6174,7 +6156,7 @@ ${yf}`,
 };
 async function Dn(e, t, n) {
   [t, n] = K(t, n);
-  const { text: r, context: s } = N(t, []), o = A(Qr, n), i = I(Qr, o.onProgress, o);
+  const { text: r, context: s } = N(t, []), o = O(Qr, n), i = k(Qr, o.onProgress, o);
   if (i.start(), !Array.isArray(e) || e.length === 0)
     return i.complete({ outcome: T.success }), [];
   if (e.length < 2)
@@ -6225,13 +6207,13 @@ const Sf = {
   },
   required: ["items"],
   additionalProperties: !1
-}, xf = "http://json-schema.org/draft-07/schema#", $f = "object", Pf = "Intersection results between categories", Tf = { intersections: { type: "object", description: "Map of intersection results keyed by combination identifier", additionalProperties: { type: "object", properties: { combination: { type: "array", items: { type: "string" }, description: "Array of category names that form this intersection" }, description: { type: "string", description: "Clear explanation of what this intersection represents" }, elements: { type: "array", items: { type: "string" }, description: "Specific examples that belong to ALL categories in the combination" } }, required: ["combination", "description", "elements"], additionalProperties: !1 } } }, Ef = ["intersections"], If = !1, kf = {
+}, xf = "http://json-schema.org/draft-07/schema#", $f = "object", Pf = "Intersection results between categories", Tf = { intersections: { type: "object", description: "Map of intersection results keyed by combination identifier", additionalProperties: { type: "object", properties: { combination: { type: "array", items: { type: "string" }, description: "Array of category names that form this intersection" }, description: { type: "string", description: "Clear explanation of what this intersection represents" }, elements: { type: "array", items: { type: "string" }, description: "Specific examples that belong to ALL categories in the combination" } }, required: ["combination", "description", "elements"], additionalProperties: !1 } } }, Ef = ["intersections"], kf = !1, If = {
   $schema: xf,
   type: $f,
   description: Pf,
   properties: Tf,
   required: Ef,
-  additionalProperties: If
+  additionalProperties: kf
 }, Xr = "intersections", { strictFormat: Af, contentIsQuestion: Of } = oe, _f = (e, t, n) => {
   const r = e.join(", "), s = `${Of} Find specific examples, instances, or elements that belong to all of the given categories.
 
@@ -6276,9 +6258,9 @@ ${$(t, { tag: "additional-context" })}` : "";
 async function oa(e, t, n) {
   if ([t, n] = K(t, n), !Array.isArray(e) || e.length < 2)
     return {};
-  const { text: r, context: s } = N(t, []), o = A(Xr, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), i = I(Xr, o.onProgress, o);
+  const { text: r, context: s } = N(t, []), o = O(Xr, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), i = k(Xr, o.onProgress, o);
   i.start();
-  const { useSchemaValidation: a } = await q(o, {
+  const { useSchemaValidation: a } = await F(o, {
     useSchemaValidation: !1
   }), { minSize: c = 2, maxSize: l = e.length, batchSize: u = 10 } = o;
   try {
@@ -6290,7 +6272,7 @@ async function oa(e, t, n) {
       async (b) => {
         const f = await jf(b, r, s, {
           ...o,
-          onProgress: L(o.onProgress, "combo")
+          onProgress: B(o.onProgress, "combo")
         });
         return h(1), f;
       },
@@ -6314,7 +6296,7 @@ async function oa(e, t, n) {
 }
 function Nf(e = "intersection_result") {
   return {
-    responseFormat: C(e, kf)
+    responseFormat: C(e, If)
   };
 }
 async function Rf(e, t = {}) {
@@ -6358,12 +6340,12 @@ function aa() {
 }
 const Vf = (e, t) => `${Wf} ${e}
 
-${kn(t)}
+${In(t)}
 
 ${Uf}`, Jf = ({ result: e, resultsAll: t } = {}) => t.includes(e), Kf = ({ queryCount: e, startTime: t, queryLimit: n, timeoutMs: r } = {}) => e > n || /* @__PURE__ */ new Date() - t > r, Gf = async function* (t, n = {}) {
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A("list:generate", {
+${s}` : r, i = O("list:generate", {
     llm: { fast: !0, good: !0, cheap: !0 },
     ...n
   }), a = [], c = {};
@@ -6377,28 +6359,28 @@ ${s}` : r, i = A("list:generate", {
     });
     let g = [];
     try {
-      const S = await M(
+      const v = await M(
         () => _(f, { ...i, ...aa() }),
         {
           label: "list-generate",
           config: i
         }
-      ), v = S?.items || S;
-      g = Array.isArray(v) ? v.filter(Boolean) : [];
-    } catch (S) {
-      if (S.name === "AbortError")
-        throw S;
+      ), S = v?.items || v;
+      g = Array.isArray(S) ? S.filter(Boolean) : [];
+    } catch (v) {
+      if (v.name === "AbortError")
+        throw v;
       ne(
-        `Generate list [error]: ${S.message} ${f.slice(0, 100).replace(`
+        `Generate list [error]: ${v.message} ${f.slice(0, 100).replace(`
 `, "\\n")}`
       ), l = !0;
       break;
     }
-    const m = g.filter((S) => !(S in c));
+    const m = g.filter((v) => !(v in c));
     b += 1;
-    for (const S of m) {
-      const v = {
-        result: S,
+    for (const v of m) {
+      const S = {
+        result: v,
         resultsAll: a,
         resultsNew: g,
         queryCount: b,
@@ -6406,11 +6388,11 @@ ${s}` : r, i = A("list:generate", {
         queryLimit: d,
         timeoutMs: h
       };
-      if (await p(v)) {
+      if (await p(S)) {
         l = !0;
         break;
       }
-      await u(v) || (c[S] = !0, a.push(S), yield S);
+      await u(S) || (c[v] = !0, a.push(v), yield v);
     }
     await p({
       result: void 0,
@@ -6424,7 +6406,7 @@ ${s}` : r, i = A("list:generate", {
   }
 };
 async function Ze(e, t = {}) {
-  const { text: n, context: r } = N(e, ia), s = A(Zr, t), o = I(Zr, s.onProgress, s);
+  const { text: n, context: r } = N(e, ia), s = O(Zr, t), o = k(Zr, s.onProgress, s);
   o.start();
   try {
     const { schema: i } = s, a = r ? `${n}
@@ -6437,7 +6419,7 @@ ${r}` : n, c = await M(
       }
     ), l = c?.items || c, u = Array.isArray(l) ? l : [];
     if (i && u.length > 0) {
-      o.emit({ event: k.step, stepName: "transform", itemCount: u.length });
+      o.emit({ event: A.step, stepName: "transform", itemCount: u.length });
       const p = o.batch(u.length), d = [];
       for (const h of u) {
         const y = Vf(h, i), b = await M(() => _(y, s), {
@@ -6479,15 +6461,15 @@ const Yf = "http://json-schema.org/draft-07/schema#", Hf = "object", Qf = { item
 `);
 async function ca(e, t, n) {
   typeof t == "number" && (n = { ...n, count: t }, t = void 0), [t, n] = K(t, n);
-  const r = A(es, n), s = I(es, r.onProgress, r);
-  s.start(), s.emit({ event: k.input, value: e });
+  const r = O(es, n), s = k(es, r.onProgress, r);
+  s.start(), s.emit({ event: A.input, value: e });
   const { text: o, context: i } = N(t, []), a = await re("count", r, e.length * 2);
   try {
     const c = await _(ng(e, a, o, i), {
       ...r,
       responseFormat: tg
     }), l = c?.items || c;
-    return Array.isArray(l) ? (s.emit({ event: k.output, value: l }), s.complete({ outcome: T.success }), l) : (ne(`Expected items array, got: ${typeof l}`), s.complete({ outcome: T.success }), []);
+    return Array.isArray(l) ? (s.emit({ event: A.output, value: l }), s.complete({ outcome: T.success }), l) : (ne(`Expected items array, got: ${typeof l}`), s.complete({ outcome: T.success }), []);
   } catch (c) {
     throw s.error(c), c;
   }
@@ -6536,7 +6518,7 @@ function ns(e, t) {
 }
 const qn = Rn;
 async function mg(e, t, n = {}) {
-  const r = A("score:item", n), s = `Apply the score specification to evaluate this item.
+  const r = O("score:item", n), s = `Apply the score specification to evaluate this item.
 
 ${$(t, { tag: "score-specification" })}
 
@@ -6560,7 +6542,7 @@ ${o}` : r, a = s.spec || await qn(i, n);
   return mg(e, a, n);
 }
 async function rs(e, t, n, r) {
-  const { maxParallel: s, errorPosture: o, onProgress: i, logger: a, anchoring: c, _providedAnchors: l } = r, p = await Ae(e, n), d = new Array(e.length).fill(void 0), h = I("score", i, r), y = h.batch(e.length);
+  const { maxParallel: s, errorPosture: o, onProgress: i, logger: a, anchoring: c, _providedAnchors: l } = r, p = await Ae(e, n), d = new Array(e.length).fill(void 0), h = k("score", i, r), y = h.batch(e.length);
   h.progress({
     event: W.start,
     totalItems: e.length,
@@ -6574,12 +6556,12 @@ async function rs(e, t, n, r) {
       const g = await M(() => be(f.items, t, n), {
         label: "score:batch",
         config: r,
-        onProgress: L(i, "batch")
+        onProgress: B(i, "batch")
       });
       ns(g, f.items.length).forEach((m, w) => {
         d[f.startIndex + w] = m;
       }), b = dg(f.items, g, c), h.emit({
-        event: k.phase,
+        event: A.phase,
         phase: "anchors-established",
         anchors: b
       });
@@ -6602,10 +6584,10 @@ ${b}` : t;
           const w = await M(() => be(g, f, n), {
             label: "score:batch",
             config: r,
-            onProgress: L(i, "batch")
+            onProgress: B(i, "batch")
           });
-          ns(w, g.length).forEach((S, v) => {
-            d[m + v] = S;
+          ns(w, g.length).forEach((v, S) => {
+            d[m + S] = v;
           });
         } catch (w) {
           if (h.error(w, { itemCount: g.length }), o === z.strict) throw w;
@@ -6625,11 +6607,11 @@ ${b}` : t;
     processedItems: y.count
   }), d;
 }
-async function ke(e, t, n) {
+async function Ie(e, t, n) {
   [t, n] = K(t, n, ["spec", "anchors"]);
-  const { text: r, known: s, context: o } = N(t, ["spec", "anchors"]), { now: i } = n, a = A(ts, n), c = I(ts, a.onProgress, a);
-  c.start(), c.emit({ event: k.input, value: e });
-  const { maxParallel: l, maxAttempts: u, temperature: p, errorPosture: d, anchoring: h } = await q(
+  const { text: r, known: s, context: o } = N(t, ["spec", "anchors"]), { now: i } = n, a = O(ts, n), c = k(ts, a.onProgress, a);
+  c.start(), c.emit({ event: A.input, value: e });
+  const { maxParallel: l, maxAttempts: u, temperature: p, errorPosture: d, anchoring: h } = await F(
     a,
     {
       maxParallel: 3,
@@ -6639,11 +6621,11 @@ async function ke(e, t, n) {
       anchoring: J(lg)
     }
   );
-  c.emit({ event: k.phase, phase: "generating-specification" });
+  c.emit({ event: A.phase, phase: "generating-specification" });
   const y = o ? `${r}
 
 ${o}` : r, b = s.spec || await qn(y, a);
-  c.emit({ event: k.phase, phase: "scoring-items", specification: b });
+  c.emit({ event: A.phase, phase: "scoring-items", specification: b });
   const f = fg(
     b,
     "Return ONLY the numeric score for each item according to the specification range."
@@ -6661,19 +6643,19 @@ ${o}` : r, b = s.spec || await qn(y, a);
     _providedAnchors: s.anchors
   }, w = await rs(e, f, g, m);
   for (let x = 1; x < u; x += 1) {
-    const E = [], O = [];
-    if (w.forEach((j, F) => {
-      j == null && (E.push(F), O.push(e[F]));
-    }), O.length === 0) break;
-    (await rs(O, f, g, {
+    const E = [], I = [];
+    if (w.forEach((j, L) => {
+      j == null && (E.push(L), I.push(e[L]));
+    }), I.length === 0) break;
+    (await rs(I, f, g, {
       ...m,
       now: /* @__PURE__ */ new Date()
-    })).forEach((j, F) => {
-      j !== void 0 && (w[E[F]] = j);
+    })).forEach((j, L) => {
+      j !== void 0 && (w[E[L]] = j);
     });
   }
-  const S = w.filter((x) => x !== void 0).length, v = w.length - S, P = v > 0 ? T.partial : T.success;
-  return c.complete({ totalItems: w.length, successCount: S, failedItems: v, outcome: P }), w;
+  const v = w.filter((x) => x !== void 0).length, S = w.length - v, P = S > 0 ? T.partial : T.success;
+  return c.complete({ totalItems: w.length, successCount: v, failedItems: S, outcome: P }), w;
 }
 function fg(e, t = "") {
   const n = `Apply this score specification to evaluate each item:
@@ -6691,7 +6673,7 @@ function gg({ spec: e, anchors: t, text: n, ...r }) {
     ...r
   };
 }
-ke.knownTexts = ["spec", "anchors"];
+Ie.knownTexts = ["spec", "anchors"];
 const yg = "object", bg = { matrix: { type: "array", items: { type: "array", items: { type: "object", properties: { score: { type: "number" }, rationale: { type: "string", minLength: 1 } }, required: ["score", "rationale"], additionalProperties: !1 } } }, scale: { type: "object", properties: { min: { type: "number" }, max: { type: "number" } }, required: ["min", "max"], additionalProperties: !1 } }, wg = ["matrix", "scale"], vg = !1, rt = {
   type: yg,
   properties: bg,
@@ -6786,7 +6768,7 @@ ${s}` : os(e, t, n, r), a = xg(e.length, t.length), c = C("score_matrix_result",
   return Pg(l?.matrix, e.length, t.length);
 }
 async function as(e, t, n, r, s, o) {
-  const { maxParallel: i, errorPosture: a, onProgress: c, anchoring: l, _providedAnchors: u } = o, p = await Ae(e, { ...s, outputRatio: 4 }), d = Array.from({ length: e.length }), h = I("score-matrix", c, o), y = h.batch(e.length);
+  const { maxParallel: i, errorPosture: a, onProgress: c, anchoring: l, _providedAnchors: u } = o, p = await Ae(e, { ...s, outputRatio: 4 }), d = Array.from({ length: e.length }), h = k("score-matrix", c, o), y = h.batch(e.length);
   h.progress({
     event: W.start,
     totalItems: e.length,
@@ -6799,11 +6781,11 @@ async function as(e, t, n, r, s, o) {
     try {
       const m = await M(
         () => is(g.items, t, n, r, "", s),
-        { label: "score-matrix:batch", config: o, onProgress: L(c, "batch") }
+        { label: "score-matrix:batch", config: o, onProgress: B(c, "batch") }
       );
-      m.forEach((w, S) => {
-        d[g.startIndex + S] = w;
-      }), b = $g(g.items, m, t, l), h.emit({ event: k.phase, phase: "anchors-established" });
+      m.forEach((w, v) => {
+        d[g.startIndex + v] = w;
+      }), b = $g(g.items, m, t, l), h.emit({ event: A.phase, phase: "anchors-established" });
     } catch (m) {
       if (h.error(m, { batchIndex: 0, itemCount: g.items.length }), a === z.strict) throw m;
     }
@@ -6818,10 +6800,10 @@ async function as(e, t, n, r, s, o) {
           {
             label: "score-matrix:batch",
             config: o,
-            onProgress: L(c, "batch")
+            onProgress: B(c, "batch")
           }
-        )).forEach((S, v) => {
-          d[m + v] = S;
+        )).forEach((v, S) => {
+          d[m + S] = v;
         });
       } catch (w) {
         if (h.error(w, { itemCount: g.length }), a === z.strict) throw w;
@@ -6847,10 +6829,10 @@ async function ua(e, t, n, r) {
   [n, r] = K(n, r, ["anchors"]);
   const { text: s, known: o, context: i } = N(n, ["anchors"]), a = i ? `${s}
 
-${i}` : s, c = la(t), l = A(ss, r), u = I(ss, l.onProgress, l);
-  if (u.start({ dimensions: c.length }), u.emit({ event: k.input, value: e }), e.length === 0)
+${i}` : s, c = la(t), l = O(ss, r), u = k(ss, l.onProgress, l);
+  if (u.start({ dimensions: c.length }), u.emit({ event: A.input, value: e }), e.length === 0)
     return u.complete({ rows: 0, columns: c.length, outcome: T.success }), { matrix: [], dimensions: c.map((x) => x.dimension), scale: Ve };
-  const { maxParallel: p, maxAttempts: d, temperature: h, errorPosture: y, anchoring: b } = await q(
+  const { maxParallel: p, maxAttempts: d, temperature: h, errorPosture: y, anchoring: b } = await F(
     l,
     {
       maxParallel: 3,
@@ -6867,7 +6849,7 @@ ${i}` : s, c = la(t), l = A(ss, r), u = I(ss, l.onProgress, l);
     anchoring: b,
     _providedAnchors: o.anchors
   };
-  u.emit({ event: k.phase, phase: "scoring-matrix" });
+  u.emit({ event: A.phase, phase: "scoring-matrix" });
   const m = await as(
     e,
     c,
@@ -6877,43 +6859,43 @@ ${i}` : s, c = la(t), l = A(ss, r), u = I(ss, l.onProgress, l);
     g
   );
   for (let x = 1; x < d; x += 1) {
-    const E = [], O = [];
-    if (m.forEach((j, F) => {
-      j == null && (E.push(F), O.push(e[F]));
-    }), O.length === 0) break;
+    const E = [], I = [];
+    if (m.forEach((j, L) => {
+      j == null && (E.push(L), I.push(e[L]));
+    }), I.length === 0) break;
     u.emit({
-      event: k.phase,
+      event: A.phase,
       phase: "retrying-missing",
-      count: O.length,
+      count: I.length,
       attempt: x
     }), (await as(
-      O,
+      I,
       c,
       a,
       Ve,
       f,
       { ...g, now: /* @__PURE__ */ new Date() }
-    )).forEach((j, F) => {
-      j !== void 0 && (m[E[F]] = j);
+    )).forEach((j, L) => {
+      j !== void 0 && (m[E[L]] = j);
     });
   }
   const w = m.map(
     (x) => x ?? c.map(() => ({ score: Ve.min, rationale: "scoring failed" }))
-  ), S = m.filter((x) => x !== void 0).length, v = m.length - S, P = v > 0 ? T.partial : T.success;
+  ), v = m.filter((x) => x !== void 0).length, S = m.length - v, P = S > 0 ? T.partial : T.success;
   return u.emit({
-    event: k.output,
+    event: A.output,
     value: { rows: w.length, columns: c.length }
-  }), u.complete({ totalItems: e.length, successCount: S, failedItems: v, outcome: P }), {
+  }), u.complete({ totalItems: e.length, successCount: v, failedItems: S, outcome: P }), {
     matrix: w,
     dimensions: c.map((x) => x.dimension),
     scale: Ve
   };
 }
 ua.knownTexts = ["anchors"];
-const Eg = "http://json-schema.org/draft-07/schema#", Ig = "object", kg = { items: { type: "array", description: "Array of tag IDs assigned to the item. Each ID must exactly match an id from the provided vocabulary", items: { type: "string", description: "Tag identifier that must exactly match an id from the provided tag vocabulary" } } }, Ag = ["items"], Og = !1, _g = {
+const Eg = "http://json-schema.org/draft-07/schema#", kg = "object", Ig = { items: { type: "array", description: "Array of tag IDs assigned to the item. Each ID must exactly match an id from the provided vocabulary", items: { type: "string", description: "Tag identifier that must exactly match an id from the provided tag vocabulary" } } }, Ag = ["items"], Og = !1, _g = {
   $schema: Eg,
-  type: Ig,
-  properties: kg,
+  type: kg,
+  properties: Ig,
   required: Ag,
   additionalProperties: Og
 }, cs = "tags", Cg = {
@@ -6936,7 +6918,7 @@ const Eg = "http://json-schema.org/draft-07/schema#", Ig = "object", kg = { item
   additionalProperties: !1
 };
 async function Fn(e, t = {}) {
-  const n = A("tags:spec", t), r = I("tags:spec", n.onProgress, n);
+  const n = O("tags:spec", t), r = k("tags:spec", n.onProgress, n);
   r.start();
   try {
     const s = "You are a tag specification generator. Create clear, actionable tagging criteria.", o = `Analyze these tagging instructions and generate a specification.
@@ -6965,10 +6947,10 @@ Keep it concise and actionable.`, i = await M(
   }
 }
 async function jg(e, t, n, r = {}) {
-  const s = A(`${cs}:apply`, r), o = I(`${cs}:apply`, s.onProgress, s);
+  const s = O(`${cs}:apply`, r), o = k(`${cs}:apply`, s.onProgress, s);
   o.start();
   try {
-    const { vocabularyMode: i } = await q(s, {
+    const { vocabularyMode: i } = await F(s, {
       vocabularyMode: "strict"
     }), a = i === "open" ? `Available tags (prefer these, but you MAY suggest new tag IDs for items that don't fit any existing tag):
 ${$(JSON.stringify(n.tags), { tag: "available-tags" })}` : `Available tags (you MUST use only the "id" field from these tags):
@@ -7008,13 +6990,13 @@ ${o}` : r, c = s.spec || await Fn(a, n);
 }
 async function da(e, t, n) {
   [t, n] = K(t, n, Fe);
-  const r = A("tags:map", n), s = I("tags:map", r.onProgress, r);
+  const r = O("tags:map", n), s = k("tags:map", r.onProgress, r);
   s.start();
   try {
-    const { text: o, known: i, context: a } = N(t, Fe), c = i.vocabulary, l = i.vocabularyMode ?? (await q(r, { vocabularyMode: "strict" })).vocabularyMode, u = a ? `${o}
+    const { text: o, known: i, context: a } = N(t, Fe), c = i.vocabulary, l = i.vocabularyMode ?? (await F(r, { vocabularyMode: "strict" })).vocabularyMode, u = a ? `${o}
 
 ${a}` : o, p = i.spec || await Fn(u, r);
-    s.emit({ event: k.phase, phase: "applying-tags", specification: p });
+    s.emit({ event: A.phase, phase: "applying-tags", specification: p });
     const d = Ng(
       p,
       c,
@@ -7027,7 +7009,7 @@ Return empty array when no tags apply.`,
     ), y = s.batch(h.length), b = {
       ...r,
       responseFormat: C("tags_map_result", Cg),
-      onProgress: L(r.onProgress, "tags:map")
+      onProgress: B(r.onProgress, "tags:map")
     }, f = await Oe(h, d, b);
     return y(h.length), s.complete({ outcome: T.success }), f;
   } catch (o) {
@@ -7102,9 +7084,9 @@ function ma(e, { context: t = "", diversity: n } = {}) {
 async function ha(e, t = {}) {
   if (!e || typeof e != "string")
     throw new Error("categoryName must be a non-empty string");
-  const n = A(ls, { llm: { fast: !0, good: !0, cheap: !0 }, ...t }), r = I(ls, n.onProgress, n);
+  const n = O(ls, { llm: { fast: !0, good: !0, cheap: !0 }, ...t }), r = k(ls, n.onProgress, n);
   r.start();
-  const { text: s, context: o } = N(e, []), { diversity: i, count: a } = await q(n, {
+  const { text: s, context: o } = N(e, []), { diversity: i, count: a } = await F(n, {
     diversity: J(Mg, ["diversity", "count"])
   }), { context: c = "" } = n, l = [o, c].filter(Boolean).join(`
 
@@ -7115,7 +7097,7 @@ async function ha(e, t = {}) {
     }), d = await Ze(p, {
       ...n,
       shouldStop: ({ resultsAll: h }) => h.length >= a,
-      onProgress: L(n.onProgress, "list:sampling")
+      onProgress: B(n.onProgress, "list:sampling")
     });
     if (!d || d.length === 0)
       throw new Error(`No sample items generated for category: ${e}`);
@@ -7140,9 +7122,9 @@ const us = "collect-terms", Bg = (e, t) => {
   return s && r.push(s.trim()), r;
 };
 async function zn(e, t = {}) {
-  const { text: n, known: r, context: s } = N(e, ["uniqueTerms"]), o = A(us, t), i = I(us, o.onProgress, o);
+  const { text: n, known: r, context: s } = N(e, ["uniqueTerms"]), o = O(us, t), i = k(us, o.onProgress, o);
   i.start();
-  const { topN: a, chunkLen: c } = await q(o, {
+  const { topN: a, chunkLen: c } = await F(o, {
     topN: 20,
     chunkLen: 1e3
   });
@@ -7158,7 +7140,7 @@ async function zn(e, t = {}) {
 
 ${s}` : "", w = await Ze(
             `key words and phrases that would help find documents about: ${g}${m}`,
-            { ...o, onProgress: L(o.onProgress, "list:extract") }
+            { ...o, onProgress: B(o.onProgress, "list:extract") }
           );
           return y(1), w;
         },
@@ -7171,14 +7153,14 @@ ${s}` : "", w = await Ze(
       )).filter(Array.isArray).flat();
       l = Array.from(new Set(f.map((g) => g.trim()))).filter(Boolean);
     }
-    if (i.emit({ event: k.phase, phase: "extracted", uniqueTerms: l }), l.length <= a)
+    if (i.emit({ event: A.phase, phase: "extracted", uniqueTerms: l }), l.length <= a)
       return i.complete({ outcome: T.success }), l;
-    const u = await ke(
+    const u = await Ie(
       l,
       "relevance as a search term for finding information (1-10, higher is more important)",
-      { ...o, onProgress: L(o.onProgress, "score:rank") }
+      { ...o, onProgress: B(o.onProgress, "score:rank") }
     ), d = l.map((h, y) => ({ term: h, score: u[y] ?? 0 })).toSorted((h, y) => y.score - h.score);
-    return i.emit({ event: k.phase, phase: "scored", termsWithScores: d }), i.complete({ outcome: T.success }), d.slice(0, a).map((h) => h.term);
+    return i.emit({ event: A.phase, phase: "scored", termsWithScores: d }), i.complete({ outcome: T.success }), d.slice(0, a).map((h) => h.term);
   } catch (l) {
     throw i.error(l), l;
   }
@@ -7201,25 +7183,25 @@ async function Un({
     throw new Error("At least one speaker is required");
   if (!a)
     throw new Error("Topic is required");
-  const u = A(ps, i), p = I(ps, u.onProgress, u);
-  p.start(), p.emit({ event: k.input, value: { speakers: e, topic: a } });
+  const u = O(ps, i), p = k(ps, u.onProgress, u);
+  p.start(), p.emit({ event: A.input, value: { speakers: e, topic: a } });
   try {
-    const d = r.length > 0 ? r.map((S) => `${S.time} ${S.name} (${S.id}): ${S.comment}`).join(`
+    const d = r.length > 0 ? r.map((v) => `${v.time} ${v.name} (${v.id}): ${v.comment}`).join(`
 `) : "", y = [
       o.customPrompt || "",
       d ? $(d, { tag: "conversation-history" }) : "",
       a ? $(a, { tag: "topic" }) : ""
     ].filter(Boolean).join(`
 
-`), b = e.map((S, v) => {
-      const x = [S.name || `Speaker ${v + 1}`];
-      S.bio && x.push(`Bio: ${S.bio}`), S.agenda && x.push(`Agenda: ${S.agenda}`);
-      const E = s.get?.(S.id) ?? [];
+`), b = e.map((v, S) => {
+      const x = [v.name || `Speaker ${S + 1}`];
+      v.bio && x.push(`Bio: ${v.bio}`), v.agenda && x.push(`Agenda: ${v.agenda}`);
+      const E = s.get?.(v.id) ?? [];
       if (E.length > 0) {
-        const O = E.map((R) => `[${R.time}] ${R.comment}`).join(`
+        const I = E.map((R) => `[${R.time}] ${R.comment}`).join(`
 `);
         x.push(`Prior statements:
-${O}`);
+${I}`);
       }
       return x.join(`
 `);
@@ -7232,9 +7214,9 @@ ${O}`);
 
 `), m = p.batch(e.length), w = await Oe(b, g, {
       ...u,
-      onProgress: L(u.onProgress, "conversation-turn-reduce:map")
+      onProgress: B(u.onProgress, "conversation-turn-reduce:map")
     });
-    return m(e.length), p.emit({ event: k.output, value: w }), p.complete({ outcome: T.success, speakers: e.length }), w;
+    return m(e.length), p.emit({ event: A.output, value: w }), p.complete({ outcome: T.success, speakers: e.length }), w;
   } catch (d) {
     throw p.error(d), d;
   }
@@ -7292,9 +7274,9 @@ class vt {
         throw new Error("Duplicate speaker id");
       s.add(p.id);
     });
-    const { text: o, context: i } = N(t, []), a = A(st, r), c = I(st, a.onProgress, a);
-    c.start(), c.emit({ event: k.input, value: { topic: o, speakers: n } });
-    const { depth: l, maxParallel: u } = await q(a, {
+    const { text: o, context: i } = N(t, []), a = O(st, r), c = k(st, a.onProgress, a);
+    c.start(), c.emit({ event: A.input, value: { topic: o, speakers: n } });
+    const { depth: l, maxParallel: u } = await F(a, {
       depth: J(Fg),
       maxParallel: J(zg)
     });
@@ -7308,7 +7290,7 @@ class vt {
   constructor(t, n, r = {}, s = {}) {
     const o = r.emitter && r.config;
     this.emitter = o ? r.emitter : void 0, this.bundleContext = o ? r.bundleContext ?? "" : "";
-    const i = o ? r.config : A(st, r), {
+    const i = o ? r.config : O(st, r), {
       rules: a = {},
       speakFn: c,
       bulkSpeakFn: l,
@@ -7329,7 +7311,7 @@ class vt {
         turnPolicy: a.turnPolicy || ds(this.speakers)
       },
       a
-    ), this.speakFn = c, this.bulkSpeakFn = l, this.maxParallel = s.maxParallel ?? 3, !this.speakFn && !this.bulkSpeakFn && (this.bulkSpeakFn = Un), this.llm = u, this.clock = p || (() => /* @__PURE__ */ new Date()), this.emitter || (this.emitter = I(st, i.onProgress, i)), this.onProgress = i.onProgress, this.runConfig = i, this.otherOptions = b, this.messages = [], this.speakerMemory = /* @__PURE__ */ new Map();
+    ), this.speakFn = c, this.bulkSpeakFn = l, this.maxParallel = s.maxParallel ?? 3, !this.speakFn && !this.bulkSpeakFn && (this.bulkSpeakFn = Un), this.llm = u, this.clock = p || (() => /* @__PURE__ */ new Date()), this.emitter || (this.emitter = k(st, i.onProgress, i)), this.onProgress = i.onProgress, this.runConfig = i, this.otherOptions = b, this.messages = [], this.speakerMemory = /* @__PURE__ */ new Map();
   }
   _push(t, n) {
     const r = (n ?? "").trim();
@@ -7357,7 +7339,7 @@ class vt {
           speakerMemory: o,
           rules: this.rules,
           llm: this.llm,
-          onProgress: L(this.runConfig.onProgress, `round-${t}`)
+          onProgress: B(this.runConfig.onProgress, `round-${t}`)
         })).forEach((a, c) => {
           this._push(s[c].id, a);
         }) : this.speakFn && (await Q(
@@ -7374,7 +7356,7 @@ class vt {
                 speakerMemory: o,
                 rules: this.rules,
                 llm: this.llm,
-                onProgress: L(this.runConfig.onProgress, `round-${t}`)
+                onProgress: B(this.runConfig.onProgress, `round-${t}`)
               });
               return { speaker: a, comment: c };
             } catch (c) {
@@ -7390,7 +7372,7 @@ class vt {
           c && this._push(a.id, c);
         }), t += 1, n(1);
       }
-      return this.emitter.emit({ event: k.output, value: this.messages }), this.emitter.complete({ outcome: T.success }), this.messages;
+      return this.emitter.emit({ event: A.output, value: this.messages }), this.emitter.complete({ outcome: T.success }), this.messages;
     } catch (t) {
       throw this.emitter.error(t), t;
     }
@@ -7408,7 +7390,7 @@ const Ug = "http://json-schema.org/draft-07/schema#", Wg = "object", Vg = { mean
   Gg
 ), Hg = (e) => `List all distinct dictionary meanings or common uses of ${$(e, { tag: "term" })}.
 Return a JSON object with a "meanings" array containing the distinct meanings.`, fa = async (e, t = {}) => {
-  const n = A("disambiguate:meanings", {
+  const n = O("disambiguate:meanings", {
     llm: { fast: !0, good: !0, cheap: !0 },
     ...t
   }), r = Hg(e), s = await M(
@@ -7427,27 +7409,27 @@ async function ga(e, t, n) {
   [t, n] = K(t, n);
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A(ms, n), a = I(ms, i.onProgress, i);
+${s}` : r, i = O(ms, n), a = k(ms, i.onProgress, i);
   a.start();
   try {
-    a.emit({ event: k.step, stepName: "extracting-meanings", term: e });
+    a.emit({ event: A.step, stepName: "extracting-meanings", term: e });
     const c = await fa(e, {
       ...i,
-      onProgress: L(i.onProgress, "meanings")
+      onProgress: B(i.onProgress, "meanings")
     });
     a.emit({
-      event: k.step,
+      event: A.step,
       stepName: "scoring-meanings",
       term: e,
       meanings: c,
       meaningCount: c.length
     });
-    const l = await ke(
+    const l = await Ie(
       c,
       `how well this meaning of ${$(e, { tag: "term" })} matches the context: ${$(o, { tag: "context" })}`,
       {
         ...i,
-        onProgress: L(i.onProgress, "score:relevance")
+        onProgress: B(i.onProgress, "score:relevance")
       }
     );
     let u = 0, p = -1 / 0;
@@ -7732,10 +7714,10 @@ class et {
   static async create(t, n = {}) {
     const { text: r, context: s } = N(t, []), o = [n.bundleContext, s].filter(Boolean).join(`
 
-`), i = A(r, n), a = I(r, i.onProgress, i);
+`), i = O(r, n), a = k(r, i.onProgress, i);
     a.start();
     try {
-      const { temperature: c, variety: l } = await q(i, {
+      const { temperature: c, variety: l } = await F(i, {
         temperature: void 0,
         variety: J(gs)
       }), u = new et(r, n, i, {
@@ -7784,17 +7766,17 @@ class et {
   }
 }
 const va = async (e, t = {}) => {
-  const { text: n, context: r } = N(e, []), s = A(fs, t), o = I(fs, s.onProgress, s);
-  o.start(), o.emit({ event: k.input, value: n });
+  const { text: n, context: r } = N(e, []), s = O(fs, t), o = k(fs, s.onProgress, s);
+  o.start(), o.emit({ event: A.input, value: n });
   try {
     const i = o.batch(1);
-    o.emit({ event: k.phase, phase: "tree-construction" });
+    o.emit({ event: A.phase, phase: "tree-construction" });
     const a = await et.create(n, {
       ...s,
       bundleContext: r,
-      onProgress: L(s.onProgress, "tree-construction")
+      onProgress: B(s.onProgress, "tree-construction")
     });
-    return i(1), o.emit({ event: k.output, value: a }), o.complete({ outcome: T.success }), a;
+    return i(1), o.emit({ event: A.output, value: a }), o.complete({ outcome: T.success }), a;
   } catch (i) {
     throw o.error(i), i;
   }
@@ -8016,7 +7998,7 @@ function Ey(e, t, n, r, s = St) {
     avgChunkSize: a
   };
 }
-function Iy(e, t, n) {
+function ky(e, t, n) {
   const r = e.length, s = Ta(n, r), o = Py(t, s, r), i = [];
   for (let a = 0; a < r; a += o)
     i.push({
@@ -8027,7 +8009,7 @@ function Iy(e, t, n) {
     });
   return i;
 }
-async function ky(e, t, n = {}) {
+async function Iy(e, t, n = {}) {
   if (t < an)
     return { expansions: [e], tokensUsed: 0 };
   try {
@@ -8035,7 +8017,7 @@ async function ky(e, t, n = {}) {
       ...n,
       topN: 5,
       chunkLen: 500,
-      onProgress: L(n.onProgress, "collect-terms:query-expansion")
+      onProgress: B(n.onProgress, "collect-terms:query-expansion")
     });
     return {
       expansions: [e, ...r],
@@ -8071,13 +8053,13 @@ async function _y(e, t, n, r = {}) {
   const o = e.slice(0, n), i = o.map((l) => {
     const u = l.text.replace(/\s+/g, " ").trim();
     return (u.match(/^[^.!?]{1,300}[.!?]/)?.[0] || u.slice(0, 300)).trim();
-  }), a = await ke(
+  }), a = await Ie(
     i,
     `relevance to query: ${$(t, { tag: "query" })} (0=unrelated, 5=partially related, 10=directly answers)`,
     {
       ...r,
       batchSize: yy,
-      onProgress: L(r.onProgress, "score:edge-ranking")
+      onProgress: B(r.onProgress, "score:edge-ranking")
     }
   );
   return {
@@ -8105,7 +8087,7 @@ async function Cy(e, t, n, r, s, o = {}) {
     {
       ...o,
       batchSize: 10,
-      onProgress: L(o.onProgress, "map:compression")
+      onProgress: B(o.onProgress, "map:compression")
     }
   ), d = [];
   let h = 0;
@@ -8178,7 +8160,7 @@ async function Ea(e, t, n) {
   [t, n] = K(t, n, ["expansions"]);
   const { text: r, known: s, context: o } = N(t, ["expansions"]), i = o ? `${r}
 
-${o}` : r, a = A(bs, n), c = I(bs, a.onProgress, a);
+${o}` : r, a = O(bs, n), c = k(bs, a.onProgress, a);
   c.start();
   const {
     targetSize: l,
@@ -8190,7 +8172,7 @@ ${o}` : r, a = A(bs, n), c = I(bs, a.onProgress, a);
     llmScoring: b,
     llmCompression: f,
     scoringTokenRatio: g
-  } = await q(a, {
+  } = await F(a, {
     targetSize: _e.targetSize,
     tokenBudget: _e.tokenBudget,
     gapFillerBudgetRatio: _e.gapFillerBudgetRatio,
@@ -8226,62 +8208,62 @@ ${o}` : r, a = A(bs, n), c = I(bs, a.onProgress, a);
   try {
     m.targetSize <= 0 && (m.targetSize = _e.targetSize), m.chunkSize <= 0 && (m.chunkSize = _e.chunkSize), m.tokenBudget <= 0 && (m.tokenBudget = _e.tokenBudget);
     let w = m.tokenBudget;
-    c.emit({ event: k.phase, phase: "chunking" });
-    const S = Iy(e, m.chunkSize, m.targetSize), v = Ey(
-      S,
+    c.emit({ event: A.phase, phase: "chunking" });
+    const v = ky(e, m.chunkSize, m.targetSize), S = Ey(
+      v,
       m.targetSize,
       w,
       e.length,
       g
     );
-    !b && !f && (v.tfIdfBudget = m.targetSize, v.reservedSpace = 0), c.emit({ event: k.phase, phase: "query-expansion" });
+    !b && !f && (S.tfIdfBudget = m.targetSize, S.reservedSpace = 0), c.emit({ event: A.phase, phase: "query-expansion" });
     const P = a;
     let x, E = 0;
     if (s.expansions)
-      x = s.expansions.split(",").map((B) => B.trim()).filter(Boolean), x.unshift(i);
+      x = s.expansions.split(",").map((D) => D.trim()).filter(Boolean), x.unshift(i);
     else if (y) {
-      const B = await ky(i, w, P);
-      x = B.expansions, E = B.tokensUsed;
+      const D = await Iy(i, w, P);
+      x = D.expansions, E = D.tokensUsed;
     } else
       x = [i];
-    w -= E, c.emit({ event: k.phase, phase: "tfidf-scoring", expansions: x });
-    const O = Ay(S, x), { selected: R, candidates: j, sizeUsed: F } = Oy(
-      O,
-      v.tfIdfBudget
+    w -= E, c.emit({ event: A.phase, phase: "tfidf-scoring", expansions: x });
+    const I = Ay(v, x), { selected: R, candidates: j, sizeUsed: L } = Oy(
+      I,
+      S.tfIdfBudget
     );
-    c.emit({ event: k.phase, phase: "edge-scoring" });
-    const { scored: V, tokensUsed: Y } = b ? await _y(j, i, v.chunksWeCanScore, {
+    c.emit({ event: A.phase, phase: "edge-scoring" });
+    const { scored: V, tokensUsed: Y } = b ? await _y(j, i, S.chunksWeCanScore, {
       ...P,
       llmWeight: h
     }) : { scored: [], tokensUsed: 0 };
     w -= Y;
-    let H = vs(R, F, V, m.targetSize);
-    c.emit({ event: k.phase, phase: "compression" });
+    let H = vs(R, L, V, m.targetSize);
+    c.emit({ event: A.phase, phase: "compression" });
     const ee = m.targetSize - H.size;
-    let pe = 0;
-    const G = Math.min(v.avgChunkSize * 0.5, 200);
-    if (f && ee > G && v.chunksWeCanCompress > 0) {
-      const B = jy(O, H.chunks), { compressed: X, tokensUsed: ce } = await Cy(
-        B,
+    let ue = 0;
+    const G = Math.min(S.avgChunkSize * 0.5, 200);
+    if (f && ee > G && S.chunksWeCanCompress > 0) {
+      const D = jy(I, H.chunks), { compressed: X, tokensUsed: ce } = await Cy(
+        D,
         i,
-        v.chunksWeCanCompress,
+        S.chunksWeCanCompress,
         ee,
-        v,
+        S,
         { ...P, compressionRatio: d }
       );
-      pe = ce, w -= ce, H = vs(H.chunks, H.size, X, m.targetSize);
+      ue = ce, w -= ce, H = vs(H.chunks, H.size, X, m.targetSize);
     }
-    c.emit({ event: k.phase, phase: "assembly" });
+    c.emit({ event: A.phase, phase: "assembly" });
     let te = H.chunks, ie = 0;
     if (m.gapFillerBudgetRatio > 0) {
-      const B = Math.floor(m.targetSize * m.gapFillerBudgetRatio), X = m.targetSize - H.size, ce = Math.min(B, X);
+      const D = Math.floor(m.targetSize * m.gapFillerBudgetRatio), X = m.targetSize - H.size, ce = Math.min(D, X);
       if (ce > 0) {
-        const ve = Ly(O, te, ce);
+        const ve = Ly(I, te, ce);
         ve.length > 0 && (te = [...te, ...ve], ie = ve.length);
       }
     }
-    const de = Ny(te);
-    let Z = Ry(de);
+    const pe = Ny(te);
+    let Z = Ry(pe);
     Z.length > m.targetSize * 3 && (Z = Pa(Z.slice(0, m.targetSize * 2)));
     const we = {
       content: Z,
@@ -8290,15 +8272,15 @@ ${o}` : r, a = A(bs, n), c = I(bs, a.onProgress, a);
         finalSize: Z.length,
         reductionRatio: (1 - Z.length / e.length).toFixed(2),
         allocation: {
-          tfIdfBudget: v.tfIdfBudget,
-          reservedForLLM: v.reservedSpace,
-          actualLLMSpace: te.filter((B) => B.llmScore).reduce((B, X) => B + X.size, 0)
+          tfIdfBudget: S.tfIdfBudget,
+          reservedForLLM: S.reservedSpace,
+          actualLLMSpace: te.filter((D) => D.llmScore).reduce((D, X) => D + X.size, 0)
         },
         chunks: {
-          total: S.length,
+          total: v.length,
           tfIdfSelected: R.length,
-          llmSelected: te.filter((B) => B.llmScore && !B.compressed).length,
-          compressed: te.filter((B) => B.compressed).length,
+          llmSelected: te.filter((D) => D.llmScore && !D.compressed).length,
+          compressed: te.filter((D) => D.compressed).length,
           gapFillers: ie
         },
         tokens: {
@@ -8307,7 +8289,7 @@ ${o}` : r, a = A(bs, n), c = I(bs, a.onProgress, a);
           breakdown: {
             expansion: E,
             scoring: Y || 0,
-            compression: pe || 0
+            compression: ue || 0
           }
         }
       }
@@ -8336,10 +8318,10 @@ const By = "http://json-schema.org/draft-07/schema#", Dy = "object", qy = !1, Fy
 Return JSON with "template" and "variables" where each variable has "original", "candidate", and "confidence".${t ? `
 
 ${t}` : ""}`;
-async function Ia(e, t = {}) {
+async function ka(e, t = {}) {
   const { text: n, context: r } = N(e, []), s = r ? `${n}
 
-${r}` : n, o = A(Ss, t), i = I(Ss, o.onProgress, o);
+${r}` : n, o = O(Ss, t), i = k(Ss, o.onProgress, o);
   i.start();
   try {
     const a = Ky(o.creativity), c = Gy(s, { creativityGuidance: a }), l = await _(c, {
@@ -8351,12 +8333,12 @@ ${r}` : n, o = A(Ss, t), i = I(Ss, o.onProgress, o);
     throw i.error(a), a;
   }
 }
-Ia.knownTexts = [];
+ka.knownTexts = [];
 const xs = "filter-ambiguous";
-async function ka(e, t = {}) {
-  const { text: n, known: r, context: s } = N(e, ["rankedSentences"]), o = A(xs, t), i = I(xs, o.onProgress, o);
+async function Ia(e, t = {}) {
+  const { text: n, known: r, context: s } = N(e, ["rankedSentences"]), o = O(xs, t), i = k(xs, o.onProgress, o);
   i.start();
-  const { topN: a } = await q(o, {
+  const { topN: a } = await F(o, {
     topN: 10
   });
   try {
@@ -8372,17 +8354,17 @@ async function ka(e, t = {}) {
         return i.complete({ outcome: T.success }), [];
       const f = s ? `
 
-${s}` : "", g = await ke(
+${s}` : "", g = await Ie(
         b,
         `How ambiguous or easily misinterpreted is this sentence?${f}`,
         {
           ...o,
-          onProgress: L(o.onProgress, "score:sentence-ambiguity")
+          onProgress: B(o.onProgress, "score:sentence-ambiguity")
         }
       );
       c = b.map((m, w) => ({ sentence: m, score: g[w] ?? 0 })).toSorted((m, w) => w.score - m.score).slice(0, a);
     }
-    i.emit({ event: k.phase, phase: "ranked", rankedSentences: c });
+    i.emit({ event: A.phase, phase: "ranked", rankedSentences: c });
     const l = i.batch(c.length), p = (await Q(
       c,
       async ({ sentence: b }) => {
@@ -8390,7 +8372,7 @@ ${s}` : "", g = await ke(
           ...o,
           attachments: { text: b },
           targetNewItemsCount: 5,
-          onProgress: L(o.onProgress, "list:extract")
+          onProgress: B(o.onProgress, "list:extract")
         });
         return l(1), f.map((g) => ({ term: g, sentence: b }));
       },
@@ -8403,12 +8385,12 @@ ${s}` : "", g = await ke(
     )).filter(Array.isArray).flat();
     if (p.length === 0)
       return i.complete({ outcome: T.success }), [];
-    const d = await ke(
+    const d = await Ie(
       p.map((b) => `${b.term} | ${b.sentence}`),
       "Score how ambiguous the term is within the sentence.",
       {
         ...o,
-        onProgress: L(o.onProgress, "score:term-ambiguity")
+        onProgress: B(o.onProgress, "score:term-ambiguity")
       }
     ), y = p.map((b, f) => ({ ...b, score: d[f] ?? 0 })).toSorted((b, f) => (f.score || 0) - (b.score || 0));
     return i.complete({ outcome: T.success }), y.slice(0, a);
@@ -8416,7 +8398,7 @@ ${s}` : "", g = await ke(
     throw i.error(c), c;
   }
 }
-ka.knownTexts = ["rankedSentences"];
+Ia.knownTexts = ["rankedSentences"];
 function Aa(e, t = 5, n = 50) {
   if (e.length === 0) return [];
   const r = [], s = Math.max(1, Math.floor(t * (1 - n / 100)));
@@ -8440,9 +8422,9 @@ async function Oa(e, t, n) {
   if (e.length === 1) return e[0];
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A($s, n), a = I($s, i.onProgress, i);
+${s}` : r, i = O($s, n), a = k($s, i.onProgress, i);
   a.start();
-  const { styleHint: c, windowSize: l, overlapPercent: u } = await q(i, {
+  const { styleHint: c, windowSize: l, overlapPercent: u } = await F(i, {
     fidelity: J(Yy, ["windowSize", "overlapPercent"]),
     styleHint: ""
   });
@@ -8451,7 +8433,7 @@ ${s}` : r, i = A($s, n), a = I($s, i.onProgress, i);
       p,
       async (f, g) => {
         a.emit({
-          event: k.step,
+          event: A.step,
           stepName: "processing-window",
           windowNumber: g + 1,
           totalWindows: p.length
@@ -8459,19 +8441,19 @@ ${s}` : r, i = A($s, n), a = I($s, i.onProgress, i);
         const m = f.fragments.map((P, x) => `${x + 1}. ${P}`).join(`
 `), w = c ? `
 
-${$(c, { tag: "style-guidance" })}` : "", S = `${o}${w}
+${$(c, { tag: "style-guidance" })}` : "", v = `${o}${w}
 
 Window ${g + 1} of ${p.length} - Join these fragments:
 
 ${$(m, { tag: "fragments" })}
 
-Important: This is part of a larger sequence. Join these fragments while being mindful that this result will be combined with other processed windows. Add necessary connecting words, prepositions, conjunctions, or other filler text to create a coherent, grammatically correct, and semantically meaningful result. Output only the joined result for this window.`, v = await M(() => _(S, i), {
+Important: This is part of a larger sequence. Join these fragments while being mindful that this result will be combined with other processed windows. Add necessary connecting words, prepositions, conjunctions, or other filler text to create a coherent, grammatically correct, and semantically meaningful result. Output only the joined result for this window.`, S = await M(() => _(v, i), {
           label: `join-window-${g + 1}`,
           config: i,
-          onProgress: L(i.onProgress, "window")
+          onProgress: B(i.onProgress, "window")
         });
         return d(1), {
-          content: v || f.fragments.join(" "),
+          content: S || f.fragments.join(" "),
           window: f
         };
       },
@@ -8484,16 +8466,16 @@ Important: This is part of a larger sequence. Join these fragments while being m
     let b = y[0].content;
     for (let f = 1; f < y.length; f++) {
       a.emit({
-        event: k.step,
+        event: A.step,
         stepName: "stitching",
         stitchNumber: f,
         totalStitches: y.length - 1
       });
-      const g = y[f], m = y[f - 1].window, w = g.window, S = Math.max(m.startIndex, w.startIndex), v = Math.min(m.endIndex, w.endIndex);
-      if (S <= v) {
-        const P = e.slice(S, v + 1), x = c ? `
+      const g = y[f], m = y[f - 1].window, w = g.window, v = Math.max(m.startIndex, w.startIndex), S = Math.min(m.endIndex, w.endIndex);
+      if (v <= S) {
+        const P = e.slice(v, S + 1), x = c ? `
 
-${$(c, { tag: "style-guidance" })}` : "", E = P.join(" | "), O = `${o}${x}
+${$(c, { tag: "style-guidance" })}` : "", E = P.join(" | "), I = `${o}${x}
 
 Stitch these two sections by resolving their overlapping region:
 
@@ -8506,7 +8488,7 @@ ${$(E, { tag: "overlapping-fragments" })}
 The terminal ends of both sections should be preserved. Only resolve the overlapping middle region where these fragments appear.
 
 Add necessary connecting words, prepositions, conjunctions, or other filler text to create a coherent, grammatically correct, and semantically meaningful result. Output only the final stitched result with terminals preserved.`;
-        b = await M(() => _(O, i), {
+        b = await M(() => _(I, i), {
           label: `join-stitch-${f}`,
           config: i
         }) || b;
@@ -8546,7 +8528,7 @@ const Hy = {
   additionalProperties: !1
 }, { asUndefinedByDefault: Qy, contentIsQuestion: Xy } = oe, Ps = "name";
 async function _a(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(Ps, t), o = I(Ps, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(Ps, t), o = k(Ps, s.onProgress, s);
   o.start();
   const i = [
     `${Xy} Suggest a concise, memorable name for the <subject>.
@@ -8596,7 +8578,7 @@ ${r}
 The value should be the generated name.`;
 };
 async function Ca(e, t = [], n = {}) {
-  const { text: r, context: s } = N(e, []), o = A(Ts, n), i = I(Ts, o.onProgress, o);
+  const { text: r, context: s } = N(e, []), o = O(Ts, n), i = k(Ts, o.onProgress, o);
   i.start();
   try {
     const a = eb(r, t), c = s ? `${a}
@@ -8652,9 +8634,9 @@ const Es = {
     required: ["people"],
     additionalProperties: !1
   }
-}, Is = "people";
+}, ks = "people";
 async function ja(e, t = 3, n = {}) {
-  const r = A(Is, n), s = I(Is, r.onProgress, r);
+  const r = O(ks, n), s = k(ks, r.onProgress, r);
   s.start();
   try {
     const { text: o, context: i } = N(e, []), a = i ? `
@@ -8682,12 +8664,12 @@ const tb = "object", nb = { references: { type: "array", items: { type: "object"
   properties: nb,
   required: rb,
   additionalProperties: sb
-}, ks = "pop-reference", ib = C("pop_reference_result", ob);
+}, Is = "pop-reference", ib = C("pop_reference_result", ob);
 async function Na(e, t, n) {
   [t, n] = K(t, n);
-  const { text: r, context: s } = N(t, []), o = A(ks, n), i = I(ks, o.onProgress, o);
+  const { text: r, context: s } = N(t, []), o = O(Is, n), i = k(Is, o.onProgress, o);
   i.start();
-  const { referenceContext: a, referencesPerSource: c } = await q(o, {
+  const { referenceContext: a, referencesPerSource: c } = await F(o, {
     referenceContext: !1,
     referencesPerSource: 2
   }), { include: l = [] } = o;
@@ -8792,9 +8774,9 @@ One question per string.`;
 }, gb = async function* (t, n = {}) {
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A(As, n), a = I(As, i.onProgress, i);
+${s}` : r, i = O(As, n), a = k(As, i.onProgress, i);
   a.start();
-  const { exploration: c } = await q(i, {
+  const { exploration: c } = await F(i, {
     exploration: J(lb)
   }), l = [], u = {}, p = [];
   let d = !1, h = o;
@@ -8803,7 +8785,7 @@ ${s}` : r, i = A(As, n), a = I(As, i.onProgress, i);
   try {
     for (; !d; ) {
       if (a.emit({
-        event: k.step,
+        event: A.step,
         stepName: "generating-round",
         attempt: g + 1,
         questionsFound: l.length
@@ -8828,18 +8810,18 @@ ${s}` : r, i = A(As, n), a = I(As, i.onProgress, i);
         ...i,
         temperature: f,
         responseFormat: C("questions_list", ab)
-      }, S = await M(() => _(m, w), {
+      }, v = await M(() => _(m, w), {
         label: "questions-generate",
         config: i
-      }), v = pb(S, c);
+      }), S = pb(v, c);
       if (c < 0.5) {
-        const x = Math.floor(Math.random() * v.length);
-        h = v[x];
+        const x = Math.floor(Math.random() * S.length);
+        h = S[x];
       }
-      const P = v.filter((x) => !(x in u));
+      const P = S.filter((x) => !(x in u));
       g += 1;
       for (const x of P) {
-        if (await b(x, l, v, g)) {
+        if (await b(x, l, S, g)) {
           d = !0;
           break;
         }
@@ -8909,7 +8891,7 @@ function un(e) {
   }));
 }
 async function La(e, t = {}) {
-  const n = A("relations:spec", t), { canonicalization: r } = await q(n, {
+  const n = O("relations:spec", t), { canonicalization: r } = await F(n, {
     canonicalization: J(Ma)
   }), s = "You are a relation specification generator. Create a clear, concise specification for relation extraction.";
   let o, i, a;
@@ -8954,7 +8936,7 @@ Use natural language, not symbolic identifiers or linked data formats.`, await M
   );
 }
 async function Pb(e, t, n = {}) {
-  const r = A("relations:apply", n), { canonicalization: s } = await q(r, {
+  const r = O("relations:apply", n), { canonicalization: s } = await F(r, {
     canonicalization: J(Ma)
   }), { entities: o } = r;
   let i = `Apply the relation specification to extract relations from this text.
@@ -9002,13 +8984,13 @@ Canonicalization: LOOSE — preserve original entity forms from the text. Only m
 }
 async function Ba(e, t, n) {
   [t, n] = K(t, n, ["spec"]);
-  const { text: r, known: s, context: o } = N(t, ["spec"]), i = A(Os, n), a = I(Os, i.onProgress, i);
+  const { text: r, known: s, context: o } = N(t, ["spec"]), i = O(Os, n), a = k(Os, i.onProgress, i);
   a.start();
   try {
     const c = o ? `${r}
 
 ${o}` : r, l = s.spec || await La(c, i);
-    a.emit({ event: k.phase, phase: "applying-relations", specification: l });
+    a.emit({ event: A.phase, phase: "applying-relations", specification: l });
     const p = (await Pb(e, l, i)).items || [];
     return a.complete({ outcome: T.success }), p;
   } catch (c) {
@@ -9016,11 +8998,11 @@ ${o}` : r, l = s.spec || await La(c, i);
   }
 }
 Ba.knownTexts = ["spec"];
-const Tb = "http://json-schema.org/draft-07/schema#", Eb = "http://example.com/schemas/intent-schema.json", Ib = "object", kb = { queryText: { type: "string", description: "The user's query text." }, intent: { type: "object", properties: { operation: { type: "string", description: "The operation associated with the intent." }, displayName: { type: "string", description: "The display name of the intent." } }, required: ["operation", "displayName"], description: "Information about the intent." }, parameters: { type: "object", additionalProperties: !0, description: "Parameters associated with the intent." }, optionalParameters: { type: "object", additionalProperties: !0, description: "Optional parameters associated with the intent." } }, Ab = ["queryText", "intent"], Ob = "Schema for an intent response.", Da = {
+const Tb = "http://json-schema.org/draft-07/schema#", Eb = "http://example.com/schemas/intent-schema.json", kb = "object", Ib = { queryText: { type: "string", description: "The user's query text." }, intent: { type: "object", properties: { operation: { type: "string", description: "The operation associated with the intent." }, displayName: { type: "string", description: "The display name of the intent." } }, required: ["operation", "displayName"], description: "Information about the intent." }, parameters: { type: "object", additionalProperties: !0, description: "Parameters associated with the intent." }, optionalParameters: { type: "object", additionalProperties: !0, description: "Optional parameters associated with the intent." } }, Ab = ["queryText", "intent"], Ob = "Schema for an intent response.", Da = {
   $schema: Tb,
   $id: Eb,
-  type: Ib,
-  properties: kb,
+  type: kb,
+  properties: Ib,
   required: Ab,
   description: Ob
 }, _b = "http://json-schema.org/draft-07/schema#", Cb = "object", jb = { passed: { type: "boolean", description: "Whether the architecture test passed" }, reason: { type: "string", description: "Explanation of the test result" } }, Nb = ["passed", "reason"], Rb = !1, qa = {
@@ -9172,7 +9154,7 @@ const Tb = "http://json-schema.org/draft-07/schema#", Eb = "http://example.com/s
 async function Va(e, t, n = {}) {
   const { text: r, context: s } = N(e, []), o = s ? `${r}
 
-${s}` : r, i = A(_s, n), a = I(_s, i.onProgress, i);
+${s}` : r, i = O(_s, n), a = k(_s, i.onProgress, i);
   a.start();
   try {
     const c = t ? pw(t) : void 0, l = c ? C(`schema_org_${t.toLowerCase()}`, c) : { type: "json_object" }, u = await _(ni(o, t, c), {
@@ -9252,7 +9234,7 @@ A: ${p.answer}`).join(`
     {
       label: "socratic-ask",
       config: o,
-      onProgress: L(o?.onProgress, "ask")
+      onProgress: B(o?.onProgress, "ask")
     }
   );
 }, Sw = async ({
@@ -9279,15 +9261,15 @@ A: ${p.answer}`).join(`
     {
       label: "socratic-answer",
       config: o,
-      onProgress: L(o?.onProgress, "answer")
+      onProgress: B(o?.onProgress, "answer")
     }
   );
 };
 class tt {
   static async create(t, n = {}) {
-    const { text: r, context: s } = N(t, []), o = A(it, n), i = I(it, o.onProgress, o);
-    i.start(), i.emit({ event: k.input, value: r });
-    const { challenge: a, temperature: c } = await q(o, {
+    const { text: r, context: s } = N(t, []), o = O(it, n), i = k(it, o.onProgress, o);
+    i.start(), i.emit({ event: A.input, value: r });
+    const { challenge: a, temperature: c } = await F(o, {
       challenge: J(Cs, ["challenge", "temperature"])
     });
     return new tt(
@@ -9304,8 +9286,8 @@ class tt {
     this.emitter = s ? n.emitter : void 0, this.bundleContext = s ? n.bundleContext ?? "" : "";
     const o = s ? n.config : n, { ask: i = vw, answer: a = Sw, llm: c, abortSignal: l } = o;
     if (this.statement = t, this.ask = i, this.answer = a, this.llm = c, this.config = o, this.history = [], this.challenge = r.challenge ?? (o.challenge !== void 0 ? Cs(o.challenge).challenge : void 0), this.temperature = r.temperature ?? o.temperature ?? 0.7, !this.emitter) {
-      const u = A(it, o);
-      this.config = u, this.emitter = I(it, u.onProgress, u);
+      const u = O(it, o);
+      this.config = u, this.emitter = k(it, u.onProgress, u);
     }
     this.abortSignal = l;
   }
@@ -9315,7 +9297,7 @@ class tt {
   async step() {
     const t = this.history.length + 1;
     this.emitter.emit({
-      event: k.step,
+      event: A.step,
       stepName: "asking-question",
       turnNumber: t,
       topic: this.statement
@@ -9330,7 +9312,7 @@ class tt {
       bundleContext: this.bundleContext
     });
     this.emitter.emit({
-      event: k.step,
+      event: A.step,
       stepName: "answering-question",
       turnNumber: t,
       question: n
@@ -9351,12 +9333,12 @@ class tt {
       const n = this.emitter.batch(t);
       for (let r = 0; r < t; r += 1)
         this.emitter.emit({
-          event: k.phase,
+          event: A.phase,
           phase: `round-${r + 1}`,
           round: r + 1,
           totalRounds: t
         }), await this.step(), n(1);
-      return this.emitter.emit({ event: k.output, value: this.history }), this.emitter.complete({ outcome: T.success, turns: this.history.length }), this.history;
+      return this.emitter.emit({ event: A.output, value: this.history }), this.emitter.complete({ outcome: T.success, turns: this.history.length }), this.history;
     } catch (n) {
       throw this.emitter.error(n), n;
     }
@@ -9414,17 +9396,17 @@ const Ns = "split", zt = { short: 0.5, long: 0.1 }, Pw = (e) => e === void 0 ? z
 - Each section should be substantively different from adjacent sections
 - Preserve ALL original text exactly - only add delimiters
 - For topic changes: Look for shifts in subject matter, not just related themes
-- Be selective - fewer, more meaningful splits are better than many weak ones${t}`, Iw = (e, t) => `IMPORTANT RULES:
+- Be selective - fewer, more meaningful splits are better than many weak ones${t}`, kw = (e, t) => `IMPORTANT RULES:
 - Only insert "${e}" at semantic boundaries - where the meaning, topic, or argument shifts
 - Ignore structural markers like paragraph breaks, headings, or bullet lists unless they coincide with a genuine meaning shift
 - A new example or anecdote supporting the SAME point is NOT a split boundary
 - Split when the author moves to a different claim, a different subject, or a different phase of reasoning
 - Preserve ALL original text exactly - only add delimiters
-- Be selective - fewer, more meaningful splits are better than many weak ones${t}`, kw = (e, t, n, r = {}) => {
+- Be selective - fewer, more meaningful splits are better than many weak ones${t}`, Iw = (e, t, n, r = {}) => {
   const { previousContent: s = "", targetSplitCount: o = void 0, mode: i = "structural" } = r, a = o ? `
 - Aim for approximately ${o} sections in this chunk` : "", c = s ? `
 
-${$(s.slice(-200), { tag: "previous-context" })}` : "", l = i === "semantic" ? Iw(n, a) : Ew(n, a);
+${$(s.slice(-200), { tag: "previous-context" })}` : "", l = i === "semantic" ? kw(n, a) : Ew(n, a);
   return `You are marking split points in text with "${n}".
 
 ${$(t, { tag: "instructions" })}
@@ -9437,7 +9419,7 @@ async function Ja(e, t, n) {
   [t, n] = K(t, n);
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A(Ns, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), a = I(Ns, i.onProgress, i);
+${s}` : r, i = O(Ns, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), a = k(Ns, i.onProgress, i);
   a.start();
   const {
     chunkLen: c,
@@ -9445,7 +9427,7 @@ ${s}` : r, i = A(Ns, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), a = I(Ns
     temperature: u,
     preservation: p,
     mode: d
-  } = await q(i, {
+  } = await F(i, {
     chunkLen: 4e3,
     targetSplitsPerChunk: void 0,
     temperature: 0.1,
@@ -9459,28 +9441,28 @@ ${s}` : r, i = A(Ns, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), a = I(Ns
   try {
     const f = Kn(e, c), g = a.batch(f.length), m = await Q(
       f,
-      async (v, P) => {
-        const E = kw(v, o, h, {
+      async (S, P) => {
+        const E = Iw(S, o, h, {
           targetSplitCount: l,
           mode: d
-        }), O = {
+        }), I = {
           ...i,
           temperature: u
         };
         try {
-          const R = await M(() => _(E, O), {
+          const R = await M(() => _(E, I), {
             label: "split",
             config: i,
-            onProgress: L(i.onProgress, "chunk")
+            onProgress: B(i.onProgress, "chunk")
           }), j = R.replace(
             new RegExp(h.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), "g"),
             ""
-          ), F = v.trim(), V = F.length < 100 ? y : b;
-          return Math.abs(j.length - F.length) > F.length * V ? (i.logger?.warn && i.logger.warn(
+          ), L = S.trim(), V = L.length < 100 ? y : b;
+          return Math.abs(j.length - L.length) > L.length * V ? (i.logger?.warn && i.logger.warn(
             `Split output differs significantly from input for chunk ${P + 1}, using original chunk`
-          ), g(1), v) : (g(1), R);
+          ), g(1), S) : (g(1), R);
         } catch (R) {
-          return i.logger?.warn && i.logger.warn(`Split failed for chunk ${P + 1}:`, R.message), g(1), v;
+          return i.logger?.warn && i.logger.warn(`Split failed for chunk ${P + 1}:`, R.message), g(1), S;
         }
       },
       {
@@ -9489,12 +9471,12 @@ ${s}` : r, i = A(Ns, { llm: { fast: !0, good: !0, cheap: !0 }, ...n }), a = I(Ns
         abortSignal: i.abortSignal,
         label: "split chunks"
       }
-    ), w = h.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), S = m.join("").split(new RegExp(w)).map((v) => v.trim()).filter(Boolean);
+    ), w = h.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), v = m.join("").split(new RegExp(w)).map((S) => S.trim()).filter(Boolean);
     return a.complete({
       outcome: T.success,
       chunks: f.length,
-      segments: S.length
-    }), S;
+      segments: v.length
+    }), v;
   } catch (f) {
     throw a.error(f), f;
   }
@@ -9547,7 +9529,7 @@ class Ka extends Map {
     targetTokensTotalRatio: a = jw(i),
     ...c
   }) {
-    if (super(), this.cache = /* @__PURE__ */ new Map(), this.data = /* @__PURE__ */ new Map(), this.isCacheValid = !1, this.maxTokensPerValue = t ?? n.maxOutputTokens, this.llmOptions = { modelName: n.name, ...r }, this.runConfig = A(Ms, c), o)
+    if (super(), this.cache = /* @__PURE__ */ new Map(), this.data = /* @__PURE__ */ new Map(), this.isCacheValid = !1, this.maxTokensPerValue = t ?? n.maxOutputTokens, this.llmOptions = { modelName: n.name, ...r }, this.runConfig = O(Ms, c), o)
       this.targetTokens = o;
     else if (s && n) {
       this.promptTokens = n.toTokens(s).length;
@@ -9565,7 +9547,7 @@ class Ka extends Map {
     return { totalSizeWeight: t, budgets: r };
   }
   async myFillCache() {
-    const t = I(Ms, this.runConfig.onProgress, this.runConfig);
+    const t = k(Ms, this.runConfig.onProgress, this.runConfig);
     t.start();
     try {
       const { budgets: n } = this.calculateBudgets(), r = t.batch(n.length);
@@ -9596,7 +9578,7 @@ class Ka extends Map {
         }
         const y = c.toTokens(h).length;
         t.emit({
-          event: k.step,
+          event: A.step,
           stepName: "context-trim",
           key: s,
           originalTokens: l,
@@ -9686,7 +9668,7 @@ function Gn(e, t, n = {}) {
     });
   });
   const a = Object.entries(i).map(([m, w]) => ({
-    tag: e.tags.find((S) => S.id === m),
+    tag: e.tags.find((v) => v.id === m),
     count: w
   })).toSorted((m, w) => w.count - m.count), c = a.slice(0, r), l = a.slice(-s), u = t.filter((m) => m && m.length > 0).length, p = t.reduce((m, w) => m + (w ? w.length : 0), 0), d = t.length > 0 ? p / t.length : 0, h = {
     totalItems: t.length,
@@ -9722,7 +9704,7 @@ function Gn(e, t, n = {}) {
   };
 }
 async function Dw(e, t, n = {}) {
-  const r = A("tag-vocabulary:generate", n), s = `Generate a comprehensive tag vocabulary for categorizing items.
+  const r = O("tag-vocabulary:generate", n), s = `Generate a comprehensive tag vocabulary for categorizing items.
 
 ${$(e, { tag: "tag-system-specification" })}
 
@@ -9750,7 +9732,7 @@ The vocabulary should be complete enough to categorize diverse items along the i
   );
 }
 async function qw(e, t, n, r = {}) {
-  const s = A("tag-vocabulary:refine", r), { topN: o = 3, bottomN: i = 3 } = s, a = Gn(e, t, { topN: o, bottomN: i }), c = `Refine this tag vocabulary based on usage analysis.
+  const s = O("tag-vocabulary:refine", r), { topN: o = 3, bottomN: i = 3 } = s, a = Gn(e, t, { topN: o, bottomN: i }), c = `Refine this tag vocabulary based on usage analysis.
 
 ${$(n, { tag: "original-specification" })}
 
@@ -9788,7 +9770,7 @@ Return an improved vocabulary that provides better coverage and clearer distinct
 async function Ya(e, t, n = {}) {
   const { text: r, known: s, context: o } = N(e, ["initialVocab"]), i = o ? `${r}
 
-${o}` : r, a = A(Ls, n), c = I(Ls, a.onProgress, a);
+${o}` : r, a = O(Ls, n), c = k(Ls, a.onProgress, a);
   c.start();
   try {
     const { tagger: l, sampleSize: u = 50 } = a;
@@ -9800,19 +9782,19 @@ ${o}` : r, a = A(Ls, n), c = I(Ls, a.onProgress, a);
     else {
       const b = t.slice(0, Math.min(u, t.length));
       c.emit({
-        event: k.step,
+        event: A.step,
         stepName: "generate-initial-vocabulary",
         sampleCount: b.length
       }), p = await Dw(i, b, a);
     }
     c.emit({
-      event: k.step,
+      event: A.step,
       stepName: "apply-tags",
       itemCount: t.length,
       initialVocab: p
     });
     const d = await l(t, p), h = Gn(p, d);
-    c.emit({ event: k.step, stepName: "refine-vocabulary", statistics: h });
+    c.emit({ event: A.step, stepName: "refine-vocabulary", statistics: h });
     const y = await qw(p, d, i, a);
     return c.complete({ outcome: T.success }), y;
   } catch (l) {
@@ -9822,9 +9804,9 @@ ${o}` : r, a = A(Ls, n), c = I(Ls, a.onProgress, a);
 Ya.knownTexts = ["initialVocab"];
 const Bs = "themes", Fw = (e) => e.split(/\n{2,}/).map((t) => t.trim()).filter(Boolean);
 async function Ha(e, t = {}) {
-  const { text: n, known: r, context: s } = N(e, ["rawThemes"]), o = A(Bs, t), i = I(Bs, o.onProgress, o);
+  const { text: n, known: r, context: s } = N(e, ["rawThemes"]), o = O(Bs, t), i = k(Bs, o.onProgress, o);
   i.start();
-  const { topN: a } = await q(o, {
+  const { topN: a } = await F(o, {
     topN: void 0
   });
   try {
@@ -9834,25 +9816,25 @@ async function Ha(e, t = {}) {
     else {
       const h = Fw(n);
       i.emit({
-        event: k.phase,
+        event: A.phase,
         phase: "extraction"
       });
       const b = `Update the accumulator with short themes from this text. Avoid duplicates. Return ONLY a comma-separated list of themes with no explanation or additional text.${s ? `
 
 ${s}` : ""}`, f = Wn(h);
-      c = (await Ie(f, b, {
+      c = (await ke(f, b, {
         ...o,
-        onProgress: L(o.onProgress, "themes:extract")
+        onProgress: B(o.onProgress, "themes:extract")
       })).split(",").map((m) => m.trim()).filter(Boolean);
     }
     i.emit({
-      event: k.phase,
+      event: A.phase,
       phase: "refinement",
       rawThemes: c
     });
-    const u = `Refine the accumulator by merging similar themes. ${a ? `Limit to the top ${a} themes.` : "Return all meaningful themes."} Return ONLY a comma-separated list with no explanation or additional text.`, d = (await Ie(c, u, {
+    const u = `Refine the accumulator by merging similar themes. ${a ? `Limit to the top ${a} themes.` : "Return all meaningful themes."} Return ONLY a comma-separated list with no explanation or additional text.`, d = (await ke(c, u, {
       ...o,
-      onProgress: L(o.onProgress, "themes:refine")
+      onProgress: B(o.onProgress, "themes:refine")
     })).split(",").map((h) => h.trim()).filter(Boolean);
     return i.complete({ outcome: T.success, themes: d.length }), d;
   } catch (c) {
@@ -9923,9 +9905,9 @@ async function Vw(e, t = {}) {
 }
 async function Qa(e, t, n) {
   [t, n] = K(t, n, ["knowledge"]);
-  const { text: r, known: s, context: o } = N(t, ["knowledge"]), i = A(Ds, n), a = [Uw, r, o].filter(Boolean).join(`
+  const { text: r, known: s, context: o } = N(t, ["knowledge"]), i = O(Ds, n), a = [Uw, r, o].filter(Boolean).join(`
 
-`), c = I(Ds, i.onProgress, i);
+`), c = k(Ds, i.onProgress, i);
   c.start();
   const {
     chunkSize: l,
@@ -9935,7 +9917,7 @@ async function Qa(e, t, n) {
     llmDedup: h,
     knowledgeBase: y,
     enrichMap: b
-  } = await q(i, {
+  } = await F(i, {
     enrichment: J(zw, ["llmDedup", "knowledgeBase", "enrichMap"]),
     chunkSize: 2e3,
     overlap: 200,
@@ -9943,26 +9925,26 @@ async function Qa(e, t, n) {
     errorPosture: z.resilient
   }), f = s.knowledge, { onProgress: g, batchSize: m, now: w } = i;
   try {
-    const S = 1 + (h ? 1 : 0) + (y ? 2 : 0), v = c.batch(S), P = Kn(e, l, { overlap: u }), x = [];
+    const v = 1 + (h ? 1 : 0) + (y ? 2 : 0), S = c.batch(v), P = Kn(e, l, { overlap: u }), x = [];
     let E = 0;
     await Q(
       P,
-      async (j, F) => {
+      async (j, L) => {
         try {
           const V = await M(
             () => Vw(j, { ...i, now: w, systemPrompt: a }),
             {
-              label: `timeline chunk ${F + 1}`,
+              label: `timeline chunk ${L + 1}`,
               config: i
             }
           );
-          x.push(...V), g?.(F + 1, P.length);
+          x.push(...V), g?.(L + 1, P.length);
         } catch (V) {
           if (E++, d === z.strict) throw V;
           i.logger?.warn && i.logger.warn(
-            `Timeline extraction failed for chunk ${F + 1}:`,
+            `Timeline extraction failed for chunk ${L + 1}:`,
             V.message
-          ), g?.(F + 1, P.length);
+          ), g?.(L + 1, P.length);
         }
       },
       {
@@ -9971,20 +9953,20 @@ async function Qa(e, t, n) {
         label: "timeline chunks",
         abortSignal: i.abortSignal
       }
-    ), ne(`Timeline: processed ${P.length} chunks, found ${x.length} total events`), v(1);
-    let O = Ww([x]);
-    if (h && O.length > 0) {
-      const j = O.map((H) => `- ${H.timestamp}: ${H.name}`).join(`
-`), F = `Consolidate these timeline events by merging duplicates that refer to the same occurrence. Keep the most descriptive version of each event and preserve ALL unique events.
+    ), ne(`Timeline: processed ${P.length} chunks, found ${x.length} total events`), S(1);
+    let I = Ww([x]);
+    if (h && I.length > 0) {
+      const j = I.map((H) => `- ${H.timestamp}: ${H.name}`).join(`
+`), L = `Consolidate these timeline events by merging duplicates that refer to the same occurrence. Keep the most descriptive version of each event and preserve ALL unique events.
 
-${$(j, { tag: "events" })}`, V = await _(F, {
+${$(j, { tag: "events" })}`, V = await _(L, {
         ...i,
         systemPrompt: "You are a timeline deduplication engine. Return all unique events, merging only true duplicates.",
         responseFormat: C(Le.name, Le.schema)
       }), Y = V?.events || V;
-      Array.isArray(Y) && Y.length > 0 && (O = Ke(Y)), v(1);
+      Array.isArray(Y) && Y.length > 0 && (I = Ke(Y)), S(1);
     }
-    if ((y || f) && O.length > 0) {
+    if ((y || f) && I.length > 0) {
       let j = [];
       if (f)
         try {
@@ -10003,24 +9985,24 @@ Given the current knowledge base and a new event, return an updated knowledge ba
 4. Adds important related events that fall within the timeline scope (between first and last events)
 5. Include events that provide crucial context or fill important gaps
 
-Return as JSON with the same event format, maintaining chronological order.`, ie = O.map((Z) => `${Z.timestamp}: ${Z.name}`), de = await Ie(ie, te, {
+Return as JSON with the same event format, maintaining chronological order.`, ie = I.map((Z) => `${Z.timestamp}: ${Z.name}`), pe = await ke(ie, te, {
           ...i,
           initial: JSON.stringify({ events: [] }),
           responseFormat: C(Le.name, Le.schema),
           ...m !== void 0 && { batchSize: m },
-          onProgress: L(i.onProgress, "reduce:knowledge-base")
+          onProgress: B(i.onProgress, "reduce:knowledge-base")
         });
         try {
-          j = Ke(de.events || []);
+          j = Ke(pe.events || []);
         } catch (Z) {
           ne("Failed to parse knowledge base:", Z.message);
         }
       }
-      c.emit({ event: k.phase, phase: "enrichment", knowledgeBase: j }), v(1);
-      const F = j.map((G) => `- ${G.timestamp}: ${G.name}`).join(`
+      c.emit({ event: A.phase, phase: "enrichment", knowledgeBase: j }), S(1);
+      const L = j.map((G) => `- ${G.timestamp}: ${G.name}`).join(`
 `), V = `Given an extracted event, enrich it using this knowledge base:
 
-${$(F, { tag: "knowledge-base" })}
+${$(L, { tag: "knowledge-base" })}
 
 Rules:
 1. If the knowledge base has a more accurate date for this event, use it
@@ -10029,33 +10011,33 @@ Rules:
 4. Keep the original if the knowledge base doesn't have better information
 
 Return the enriched event as: "YYYY-MM-DD: Event name" or with the appropriate timestamp format.`, H = (await Oe(
-        O.map((G) => `${G.timestamp}: ${G.name}`),
+        I.map((G) => `${G.timestamp}: ${G.name}`),
         V,
         {
           ...i,
           ...m !== void 0 && { batchSize: m },
           maxParallel: p,
-          onProgress: L(i.onProgress, "map:enrichment")
+          onProgress: B(i.onProgress, "map:enrichment")
         }
       )).map((G, te) => {
-        if (!G) return O[te];
+        if (!G) return I[te];
         const ie = G.indexOf(":");
         if (ie > 0) {
-          const de = G.substring(0, ie).trim(), Z = G.substring(ie + 1).trim(), we = de !== O[te].timestamp;
+          const pe = G.substring(0, ie).trim(), Z = G.substring(ie + 1).trim(), we = pe !== I[te].timestamp;
           return {
-            timestamp: de,
+            timestamp: pe,
             name: Z,
             ...we && { enriched: !0 }
           };
         }
-        return O[te];
-      }), ee = new Set(H.map((G) => G.name.toLowerCase())), pe = j.filter((G) => !ee.has(G.name.toLowerCase()));
-      O = Ke([...H, ...pe]), v(1);
+        return I[te];
+      }), ee = new Set(H.map((G) => G.name.toLowerCase())), ue = j.filter((G) => !ee.has(G.name.toLowerCase()));
+      I = Ke([...H, ...ue]), S(1);
     }
     const R = E > 0 ? T.partial : T.success;
-    return c.complete({ outcome: R }), O;
-  } catch (S) {
-    throw c.error(S), S;
+    return c.complete({ outcome: R }), I;
+  } catch (v) {
+    throw c.error(v), v;
   }
 }
 Qa.knownTexts = ["knowledge"];
@@ -10114,7 +10096,7 @@ ${r}
 </error>`));
 }
 async function ec(e, t, n = {}) {
-  const r = A(qs, { llm: { fast: !0, good: !0 }, ...n }), s = I(qs, r.onProgress, r);
+  const r = O(qs, { llm: { fast: !0, good: !0 }, ...n }), s = k(qs, r.onProgress, r);
   s.start();
   let o;
   try {
@@ -10171,9 +10153,9 @@ function Zw(e, t) {
 }
 async function tc(e, t, n) {
   [t, n] = K(t, n);
-  const { text: r, context: s } = N(t, []), o = A(zs, n), i = I(zs, o.onProgress, o);
+  const { text: r, context: s } = N(t, []), o = O(zs, n), i = k(zs, o.onProgress, o);
   i.start();
-  const { chunkSize: a, strictness: c } = await q(o, {
+  const { chunkSize: a, strictness: c } = await F(o, {
     chunkSize: 1e3,
     strictness: J(Xw)
   });
@@ -10185,9 +10167,9 @@ ${s}` : "", h = `${$(r, { tag: "removal_criteria" })}
 NOTE: These text blocks are in REVERSE order (from end to beginning of document).
 Score how important THE ENTIRE TEXT BLOCK is to KEEP in the document (0 = should be removed, 10 = must keep).
 Each item in the list is ONE complete text block - evaluate it as a whole unit.
-Consider the removal criteria above when scoring.${d}`, b = (await ke(p, h, {
+Consider the removal criteria above when scoring.${d}`, b = (await Ie(p, h, {
       ...o,
-      onProgress: L(o.onProgress, "score:relevance")
+      onProgress: B(o.onProgress, "score:relevance")
       // Don't use stopOnThreshold - we need all scores to find high ones
     })).findIndex((g) => (g ?? 1 / 0) < c);
     let f;
@@ -10248,9 +10230,9 @@ ${$(e, { tag: "intent" })}`, Yn = ["scientific", "causal", "softCover"], nv = {
 }[e] ?? Kt, oc = async (e, t = {}) => {
   const { text: n, context: r } = N(e, []), s = r ? `
 
-${r}` : "", o = A(Us, { llm: { sensitive: !0 }, ...t }), i = I(Us, o.onProgress, o);
+${r}` : "", o = O(Us, { llm: { sensitive: !0 }, ...t }), i = k(Us, o.onProgress, o);
   i.start();
-  const { strategies: a, variantCount: c } = await q(o, {
+  const { strategies: a, variantCount: c } = await F(o, {
     coverage: J(rv, ["strategies", "variantCount"])
   }), l = a.map(
     (u) => `${nv[u](n, c)}${s}`
@@ -10262,7 +10244,7 @@ ${r}` : "", o = A(Us, { llm: { sensitive: !0 }, ...t }), i = I(Us, o.onProgress,
         const h = await M(() => _(d, { ...o, responseFormat: tv }), {
           label: "veiled-variants",
           config: o,
-          onProgress: L(o.onProgress, "strategy")
+          onProgress: B(o.onProgress, "strategy")
         });
         return u(1), h;
       },
@@ -10368,22 +10350,22 @@ async function pv(e, { columns: t = 2, tileHeight: n = 300, gutter: r = 4, quali
     w: f.info.width,
     h: f.info.height
   })), l = Math.ceil(e.length / t), u = Array.from({ length: t }, (f, g) => {
-    const m = c.filter((w, S) => S % t === g);
+    const m = c.filter((w, v) => v % t === g);
     return m.length > 0 ? Math.max(...m.map((w) => w.w)) : 0;
   }), p = u.reduce((f, g) => f + g, 0) + r * (t - 1), d = l * n + r * (l - 1), h = [];
   for (let f = 0; f < c.length; f++) {
-    const g = f % t, m = Math.floor(f / t), w = u.slice(0, g).reduce((v, P) => v + P, 0) + r * g, S = m * (n + r);
-    if (c[f].x = w, c[f].y = S, h.push({ input: a[f].data, left: w, top: S }), c[f].label) {
-      const v = Math.min(24, c[f].h), P = Math.min(14, v - 2), x = c[f].label.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;"), E = Buffer.from(
-        `<svg width="${c[f].w}" height="${v}">
-          <rect x="0" y="0" width="${c[f].w}" height="${v}" fill="rgba(0,0,0,0.6)"/>
-          <text x="4" y="${v - 3}" font-family="sans-serif" font-size="${P}" fill="white">${x}</text>
+    const g = f % t, m = Math.floor(f / t), w = u.slice(0, g).reduce((S, P) => S + P, 0) + r * g, v = m * (n + r);
+    if (c[f].x = w, c[f].y = v, h.push({ input: a[f].data, left: w, top: v }), c[f].label) {
+      const S = Math.min(24, c[f].h), P = Math.min(14, S - 2), x = c[f].label.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;").replace(/"/g, "&quot;"), E = Buffer.from(
+        `<svg width="${c[f].w}" height="${S}">
+          <rect x="0" y="0" width="${c[f].w}" height="${S}" fill="rgba(0,0,0,0.6)"/>
+          <text x="4" y="${S - 3}" font-family="sans-serif" font-size="${P}" fill="white">${x}</text>
         </svg>`
       );
       h.push({
         input: E,
         left: w,
-        top: S + c[f].h - v
+        top: v + c[f].h - S
       });
     }
   }
@@ -10422,16 +10404,16 @@ const Vs = "analyze-image", dv = C("analysis", {
   [t, n] = K(t, n);
   const { text: r, context: s } = N(t, []), o = s ? `${r}
 
-${s}` : r, i = A(Vs, n), a = I(Vs, i.onProgress, i);
+${s}` : r, i = O(Vs, n), a = k(Vs, i.onProgress, i);
   a.start();
   const c = hv(e), l = c.length;
   try {
-    const { tile: u } = await q(i, {
+    const { tile: u } = await F(i, {
       tile: !1
     }), p = u && c.length > 1;
     let d;
     if (p) {
-      const f = c.map((S) => S.path), g = c.map((S) => S.label).filter(Boolean), m = await pv(f, {
+      const f = c.map((v) => v.path), g = c.map((v) => v.label).filter(Boolean), m = await pv(f, {
         labels: g.length > 0 ? g : void 0
       });
       a.emit({
@@ -10450,7 +10432,7 @@ ${s}` : r, i = A(Vs, n), a = I(Vs, i.onProgress, i);
     const h = Zo(o, d), y = i.responseFormat ? i : { ...i, responseFormat: dv }, b = await M(() => _(h, y), {
       label: "analyze-image:llm",
       config: i,
-      onProgress: L(i.onProgress, "llm")
+      onProgress: B(i.onProgress, "llm")
     });
     return a.complete({ outcome: T.success, imageCount: l, tiled: p }), b;
   } catch (u) {
@@ -10462,9 +10444,9 @@ const Js = "auto";
 async function uc(e, t = {}) {
   const { text: n, context: r } = N(e, []), s = r ? `${n}
 
-${r}` : n, o = A(Js, t), i = I(Js, o.onProgress, o);
+${r}` : n, o = O(Js, t), i = k(Js, o.onProgress, o);
   i.start();
-  const { schemas: a, defaultFunction: c, defaultArguments: l } = await q(o, {
+  const { schemas: a, defaultFunction: c, defaultArguments: l } = await F(o, {
     schemas: Ua,
     defaultFunction: void 0,
     defaultArguments: {}
@@ -10552,8 +10534,8 @@ async function wv({
   onProgress: a,
   operation: c
 }) {
-  const l = A(Ks, { onProgress: a, operation: c }), u = I(Ks, l.onProgress, l);
-  u.start(), u.emit({ event: k.input, value: e });
+  const l = O(Ks, { onProgress: a, operation: c }), u = k(Ks, l.onProgress, l);
+  u.start(), u.emit({ event: A.input, value: e });
   let p;
   try {
     if (t === void 0 && !n)
@@ -10567,7 +10549,7 @@ async function wv({
       let y;
       throw typeof o == "function" ? y = o({ actual: e, equals: t, constraint: n }) : y = o, y || (y = t !== void 0 ? "LLM assertion failed: Does the actual value strictly equal the expected value?" : `LLM assertion failed: ${n}`), new Error(y);
     }
-    u.emit({ event: k.output, value: p }), u.complete({ outcome: T.success });
+    u.emit({ event: A.output, value: p }), u.complete({ outcome: T.success });
   } catch (d) {
     throw u.error(d), d;
   }
@@ -10659,7 +10641,7 @@ ${o}`), t === "error")
   return e;
 }
 async function $v(e, t, n, r = {}) {
-  const s = A("expect", r), { mode: o } = await q(s, {
+  const s = O("expect", r), { mode: o } = await F(s, {
     mode: $e.VERBLETS_LLM_EXPECT_MODE || "none"
   });
   if (t === void 0 && !n)
@@ -10691,7 +10673,7 @@ const Gs = "intent", Pv = (e) => {
     }[e] : e;
 }, Tv = C("intent_result", yt);
 async function dc(e, t, n = {}) {
-  const { text: r, context: s } = N(e, []), o = A(Gs, n), i = I(Gs, o.onProgress, o);
+  const { text: r, context: s } = N(e, []), o = O(Gs, n), i = k(Gs, o.onProgress, o);
   i.start();
   try {
     if (!Array.isArray(t) || t.length === 0)
@@ -10753,10 +10735,10 @@ class Ev {
     return this;
   }
 }
-function Iv(e, t = void 0) {
+function kv(e, t = void 0) {
   return new Ev(e, t);
 }
-function kv(e) {
+function Iv(e) {
   const n = new Error().stack.split(`
 `);
   if (e === void 0) {
@@ -10785,7 +10767,7 @@ function Av(e) {
   } : { file: "unknown", line: 0 };
 }
 function Ov(e = 0) {
-  const t = kv(4 + e);
+  const t = Iv(4 + e);
   return {
     filePath: t.file,
     line: t.line
@@ -10840,18 +10822,18 @@ function Hs(e) {
 }
 const Qs = "llm-logger";
 function mc(e = {}) {
-  const t = A(Qs, e), n = I(Qs, t.onProgress, t);
+  const t = O(Qs, e), n = k(Qs, t.onProgress, t);
   n.start();
   try {
-    let g = function(m, w = "log", S = 0) {
-      const v = Ov(S), P = {
+    let g = function(m, w = "log", v = 0) {
+      const S = Ov(v), P = {
         id: `${Date.now()}-${Math.random().toString(36).substr(2, 9)}`,
         ts: /* @__PURE__ */ new Date(),
         raw: m,
         // Store original data as-is (any structure)
         meta: /* @__PURE__ */ new Map([
           ["level", w],
-          ["fileContext", v]
+          ["fileContext", S]
         ]),
         attachments: {},
         // AI enrichments to merge
@@ -10884,8 +10866,8 @@ function mc(e = {}) {
             ...m.ts ? {} : { ts: P.ts },
             ...m.level ? {} : { level: w },
             // Add file context
-            ...m.file ? {} : { file: v.filePath },
-            ...m.line ? {} : { line: v.line }
+            ...m.file ? {} : { file: S.filePath },
+            ...m.line ? {} : { line: S.line }
           } : E = {
             data: m,
             id: P.id,
@@ -10929,17 +10911,17 @@ function mc(e = {}) {
       hostLogger: c = void 0
     } = e, l = new Mn(r), u = [], p = c ? Hs(c) : void 0, d = /* @__PURE__ */ new Map();
     s.forEach((m) => {
-      Iv(m.laneId !== void 0, "Each lane must have an laneId property").toBe(!0), d.set(m.laneId, []);
+      kv(m.laneId !== void 0, "Each lane must have an laneId property").toBe(!0), d.set(m.laneId, []);
     });
     const h = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map();
     let b = !1;
     o.forEach((m) => {
       const w = l.registerReader();
       y.set(m.processorId, w), h.set(m.processorId, -1);
-      const S = m.batchSize || 10, v = async () => {
+      const v = m.batchSize || 10, S = async () => {
         if (!b)
           try {
-            const P = await l.readBatch(w, S, m.batchTimeout), x = Cv(P.data), O = `# Log Processing Context
+            const P = await l.readBatch(w, v, m.batchTimeout), x = Cv(P.data), I = `# Log Processing Context
 # Processor: ${m.processorId} (${m.description || "No description"})
 # Batch size: ${P.data.length} logs
 # Task: Analyze the following NDJSON log entries and return bulk adjustments
@@ -10960,32 +10942,32 @@ function mc(e = {}) {
 # ]
 #
 # NDJSON Log Data:
-` + x, R = await m.process(O);
+` + x, R = await m.process(I);
             if (Array.isArray(R))
               for (const j of R) {
-                const F = u.findIndex((V) => V.id === j.logId);
-                if (F !== -1) {
-                  const V = u[F];
+                const L = u.findIndex((V) => V.id === j.logId);
+                if (L !== -1) {
+                  const V = u[L];
                   if (j.adjustments)
                     for (const [Y, H] of Object.entries(j.adjustments))
                       Ys(V.attachments, Y, H);
                   j.aiMeta && (V.aiMeta || (V.aiMeta = {}), Object.assign(V.aiMeta, j.aiMeta));
                 }
               }
-            h.set(m.processorId, P.lastOffset), b || setTimeout(v, 0);
+            h.set(m.processorId, P.lastOffset), b || setTimeout(S, 0);
           } catch (P) {
-            p && p.error(`Processor ${m.processorId} error: ${P.message}`), b || setTimeout(v, 1e3);
+            p && p.error(`Processor ${m.processorId} error: ${P.message}`), b || setTimeout(S, 1e3);
           }
       };
-      v();
+      S();
     });
     const f = () => {
       for (const [m, w] of d)
         if (w.length > 0) {
-          const S = s.find((v) => v.laneId === m);
-          if (S) {
-            const v = w.filter((P) => !P.aiMeta?.skip);
-            v.length > 0 && S.writer(v), w.length = 0;
+          const v = s.find((S) => S.laneId === m);
+          if (v) {
+            const S = w.filter((P) => !P.aiMeta?.skip);
+            S.length > 0 && v.writer(S), w.length = 0;
           }
         }
     };
@@ -11008,17 +10990,17 @@ function mc(e = {}) {
       trace: (m, w = 0) => g(m, "trace", w),
       fatal: (m, w = 0) => g(m, "fatal", w),
       // Enhanced attachment API
-      attachToLog: (m, w, S) => {
-        const v = u.findIndex((P) => P.id === m);
-        return v !== -1 ? (Ys(u[v].attachments, w, S), !0) : !1;
+      attachToLog: (m, w, v) => {
+        const S = u.findIndex((P) => P.id === m);
+        return S !== -1 ? (Ys(u[S].attachments, w, v), !0) : !1;
       },
       getLogAttachment: (m, w) => {
-        const S = u.find((v) => v.id === m);
-        return S ? _v(S.attachments, w) : void 0;
+        const v = u.find((S) => S.id === m);
+        return v ? _v(v.attachments, w) : void 0;
       },
       markLogSkippable: (m, w = !0) => {
-        const S = u.findIndex((v) => v.id === m);
-        return S !== -1 ? (u[S].aiMeta.skip = w, !0) : !1;
+        const v = u.findIndex((S) => S.id === m);
+        return v !== -1 ? (u[v].aiMeta.skip = w, !0) : !1;
       },
       // Ring buffer access - legacy API compatibility
       ringBuffer: {
@@ -11066,15 +11048,15 @@ function mc(e = {}) {
       }),
       // Wait for all processors to catch up to current write position
       waitForProcessing: async (m = 3e4) => {
-        const w = Date.now(), v = l.getStats().writeOffset;
-        if (v === 0)
+        const w = Date.now(), S = l.getStats().writeOffset;
+        if (S === 0)
           return;
         f();
-        const P = (x, E) => E + 1 < v;
+        const P = (x, E) => E + 1 < S;
         for (; Date.now() - w < m; ) {
           let x = !0;
-          for (const [E, O] of h)
-            if (P(E, O)) {
+          for (const [E, I] of h)
+            if (P(E, I)) {
               x = !1;
               break;
             }
@@ -11086,9 +11068,9 @@ function mc(e = {}) {
         }
         if (p) {
           const x = [];
-          for (const [E, O] of h)
-            if (P(E, O)) {
-              const R = v - O - 1;
+          for (const [E, I] of h)
+            if (P(E, I)) {
+              const R = S - I - 1;
               x.push(`${E} (${R} logs pending)`);
             }
           p.warn(
@@ -11221,7 +11203,7 @@ Provide:
   additionalProperties: !1
 };
 async function pn(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(Xs, t), o = I(Xs, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(Xs, t), o = k(Xs, s.onProgress, s);
   o.start();
   try {
     const {
@@ -11277,7 +11259,7 @@ const Lv = {
   additionalProperties: !1
 }, Zs = "sentiment";
 async function hc(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(Zs, t), o = I(Zs, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(Zs, t), o = k(Zs, s.onProgress, s);
   o.start();
   const i = [
     `Identify the overall sentiment of the following text as "positive", "negative", or "neutral".
@@ -11368,21 +11350,21 @@ function gc({
   llm: o,
   ...i
 } = {}) {
-  const { text: a, context: c } = N(e, []), l = A(eo, { llm: o, ...i }), u = I(eo, l.onProgress, l);
-  u.start(), u.emit({ event: k.input, value: a });
+  const { text: a, context: c } = N(e, []), l = O(eo, { llm: o, ...i }), u = k(eo, l.onProgress, l);
+  u.start(), u.emit({ event: A.input, value: a });
   const p = l.now ?? /* @__PURE__ */ new Date(), d = u.batch();
   let h, y = 0, b = 0, f = r;
   const g = [];
   let m = !0, w;
-  const S = async () => {
+  const v = async () => {
     if (!m) return;
-    w || (w = await q(l, {
+    w || (w = await F(l, {
       tolerance: J(Wv)
     }));
     const { tolerance: P } = w;
     try {
       u.emit({
-        event: k.step,
+        event: A.step,
         stepName: "tick",
         tickNumber: y + 1
       }), f = await t({
@@ -11390,7 +11372,7 @@ function gc({
         lastInvocationResult: f,
         initial: r
       });
-      const x = fc(a, f), O = [
+      const x = fc(a, f), I = [
         `${Bv} ${x}`,
         `${Dv} ${qv}`,
         'Your response should be an ISO date or a short duration like "10 minutes".',
@@ -11402,7 +11384,7 @@ function gc({
       ].filter(Boolean).join(`
 
 `), R = await M(
-        () => _(O, {
+        () => _(I, {
           ...l,
           responseFormat: zv
         }),
@@ -11414,21 +11396,21 @@ function gc({
       g.push(R), g.length > n && g.shift();
       const j = await Uv(R, l);
       if (s) {
-        const F = new Date(Date.now() + j);
+        const L = new Date(Date.now() + j);
         await s({
           timingString: R,
           data: f,
-          nextDate: F
+          nextDate: L
         });
       }
       u.measure({
         metric: ge.tickDuration,
         value: Date.now() - p.getTime(),
         tickNumber: y + 1
-      }), b = 0, y += 1, d(1), m && (h = setTimeout(S, j));
+      }), b = 0, y += 1, d(1), m && (h = setTimeout(v, j));
     } catch (x) {
       if (ne(`Error in setInterval step: ${x.message}`), b += 1, u.emit({
-        event: k.step,
+        event: A.step,
         stepName: "tick-error",
         tickNumber: y + 1,
         error: x.message,
@@ -11443,10 +11425,10 @@ function gc({
         m = !1, clearTimeout(h), u.error(x);
         return;
       }
-      m && (h = setTimeout(S, 1e3));
+      m && (h = setTimeout(v, 1e3));
     }
   };
-  return h = setTimeout(S, 0), () => {
+  return h = setTimeout(v, 0), () => {
     m = !1, clearTimeout(h), u.complete({ outcome: T.success, ticks: y });
   };
 }
@@ -11461,7 +11443,7 @@ function xt(e, t = {}) {
   return r = r.replace(/[^\S\n]+/g, " "), r.trim();
 }
 function Vv() {
-  const e = D("VERBLETS_EMBED_MODEL");
+  const e = q("VERBLETS_EMBED_MODEL");
   return {
     [e]: {
       name: e,
@@ -11492,7 +11474,7 @@ function Vv() {
   };
 }
 function Jv() {
-  const e = D("VERBLETS_EMBED_MODEL");
+  const e = q("VERBLETS_EMBED_MODEL");
   return [
     { match: { good: !0, multi: !1 }, use: e },
     { use: "Xenova/clip-vit-base-patch16" }
@@ -11541,16 +11523,16 @@ async function Yv(e) {
     const { batchSize: y = r, abortSignal: b } = h, f = dn(d, y), g = [];
     for (const m of f) {
       b?.throwIfAborted();
-      const w = i(m, { padding: !0, truncation: !0 }), v = (await a(w)).text_embeds, P = v.dims[1];
+      const w = i(m, { padding: !0, truncation: !0 }), S = (await a(w)).text_embeds, P = S.dims[1];
       for (let x = 0; x < m.length; x++)
-        g.push(no(new Float32Array(v.data.slice(x * P, (x + 1) * P))));
+        g.push(no(new Float32Array(S.data.slice(x * P, (x + 1) * P))));
     }
     return g;
   }, embedImages: async (d, h = {}) => {
     const { batchSize: y = s, abortSignal: b } = h, f = dn(d, y), g = [];
     for (const m of f) {
       b?.throwIfAborted();
-      const w = await Promise.all(m.map((E) => Zc.read(E))), S = await c(w), P = (await l(S)).image_embeds, x = P.dims[1];
+      const w = await Promise.all(m.map((E) => Zc.read(E))), v = await c(w), P = (await l(v)).image_embeds, x = P.dims[1];
       for (let E = 0; E < m.length; E++)
         g.push(no(new Float32Array(P.data.slice(E * x, (E + 1) * x))));
     }
@@ -11756,7 +11738,7 @@ const Zv = {
   additionalProperties: !1
 }, ro = "embed-rewrite-query";
 async function Tc(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(ro, t), o = I(ro, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(ro, t), o = k(ro, s.onProgress, s);
   o.start();
   try {
     const i = li(n), a = r ? `${i}
@@ -11791,10 +11773,10 @@ const eS = {
     }[e] : e;
 };
 async function Ec(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(so, t), o = I(so, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(so, t), o = k(so, s.onProgress, s);
   o.start();
   try {
-    const { divergence: i, count: a } = await q(s, {
+    const { divergence: i, count: a } = await F(s, {
       divergence: J(tS),
       count: 3
     }), c = ui(n, a, { divergenceGuidance: i }), l = r ? `${c}
@@ -11828,11 +11810,11 @@ const nS = {
       high: "Step back to foundational principles and theories. Generate questions about the underlying mechanisms, first principles, or cross-domain analogies that explain why the specific topic works the way it does. Prefer theoretical depth over topical proximity."
     }[e] : e;
 };
-async function Ic(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(oo, t), o = I(oo, s.onProgress, s);
+async function kc(e, t = {}) {
+  const { text: n, context: r } = N(e, []), s = O(oo, t), o = k(oo, s.onProgress, s);
   o.start();
   try {
-    const { abstraction: i, count: a } = await q(s, {
+    const { abstraction: i, count: a } = await F(s, {
       abstraction: J(rS),
       count: 3
     }), c = pi(n, a, { abstractionGuidance: i }), l = r ? `${c}
@@ -11846,7 +11828,7 @@ ${r}` : c, u = await _(l, {
     throw o.error(i), i;
   }
 }
-Ic.knownTexts = [];
+kc.knownTexts = [];
 const sS = {
   type: "object",
   properties: {
@@ -11866,11 +11848,11 @@ const sS = {
       high: "Decompose into many fine-grained sub-questions. Each sub-question should target a single specific fact, entity, or data point needed to fully answer the original query. Be thorough — prefer many narrow, precise questions over fewer broad ones."
     }[e] : e;
 };
-async function kc(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(io, t), o = I(io, s.onProgress, s);
+async function Ic(e, t = {}) {
+  const { text: n, context: r } = N(e, []), s = O(io, t), o = k(io, s.onProgress, s);
   o.start();
   try {
-    const { granularity: i } = await q(s, {
+    const { granularity: i } = await F(s, {
       granularity: J(oS)
     }), a = di(n, { granularityGuidance: i }), c = r ? `${a}
 
@@ -11883,7 +11865,7 @@ ${r}` : a, l = await _(c, {
     throw o.error(i), i;
   }
 }
-kc.knownTexts = [];
+Ic.knownTexts = [];
 const iS = {
   type: "object",
   properties: {
@@ -11896,7 +11878,7 @@ const iS = {
   additionalProperties: !1
 }, ao = "embed-rewrite-to-output-doc";
 async function Ac(e, t = {}) {
-  const { text: n, context: r } = N(e, []), s = A(ao, t), o = I(ao, s.onProgress, s);
+  const { text: n, context: r } = N(e, []), s = O(ao, t), o = k(ao, s.onProgress, s);
   o.start();
   try {
     const i = ad(n), a = r ? `${i}
@@ -12069,9 +12051,9 @@ const vS = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   openai: vS
 };
 async function xS(e, t = {}) {
-  const n = A("agent", t), r = I("agent", n.onProgress, n);
+  const n = O("agent", t), r = k("agent", n.onProgress, n);
   r.start({ instruction: e.slice(0, 200) });
-  const s = await q(n, {
+  const s = await F(n, {
     maxTurns: void 0,
     cwd: void 0,
     systemPrompt: void 0,
@@ -12153,7 +12135,7 @@ async function ES(e, t, n = {}) {
     label: a = "pMap"
   } = n;
   if (!t || t.length === 0) return [];
-  const c = I(a, i);
+  const c = k(a, i);
   c.start();
   const l = c.batch(t.length), u = new Array(t.length), p = Ce(r)(t);
   let d = 0;
@@ -12177,7 +12159,7 @@ async function ES(e, t, n = {}) {
     throw c.error(h), h;
   }
 }
-async function IS(e, t, n = {}) {
+async function kS(e, t, n = {}) {
   const {
     maxParallel: r = 3,
     errorPosture: s = z.resilient,
@@ -12186,7 +12168,7 @@ async function IS(e, t, n = {}) {
     label: a = "pFilter"
   } = n;
   if (!t || t.length === 0) return [];
-  const c = I(a, i);
+  const c = k(a, i);
   c.start();
   const l = c.batch(t.length), u = new Array(t.length), p = Ce(r)(t);
   let d = 0;
@@ -12211,7 +12193,7 @@ async function IS(e, t, n = {}) {
     throw c.error(h), h;
   }
 }
-async function kS(e, t, n = {}) {
+async function IS(e, t, n = {}) {
   const {
     maxParallel: r = 3,
     errorPosture: s = z.resilient,
@@ -12220,7 +12202,7 @@ async function kS(e, t, n = {}) {
     label: a = "pFind"
   } = n;
   if (!t || t.length === 0) return;
-  const c = I(a, i);
+  const c = k(a, i);
   c.start();
   const l = c.batch(t.length), u = Ce(r)(t);
   let p = 0;
@@ -12249,7 +12231,7 @@ async function kS(e, t, n = {}) {
   }
 }
 async function AS(e, t, n, r = {}) {
-  const { abortSignal: s, onProgress: o, label: i = "pReduce" } = r, a = I(i, o);
+  const { abortSignal: s, onProgress: o, label: i = "pReduce" } = r, a = k(i, o);
   a.start();
   const c = a.batch(t.length);
   let l = n;
@@ -12272,7 +12254,7 @@ async function OS(e, t, n = {}) {
     label: a = "pGroup"
   } = n;
   if (!t || t.length === 0) return {};
-  const c = I(a, i);
+  const c = k(a, i);
   c.start();
   const l = c.batch(t.length), u = new Array(t.length), p = Ce(r)(t);
   let d = 0;
@@ -12307,7 +12289,7 @@ async function OS(e, t, n = {}) {
 async function _S(e, t, n = {}) {
   const { abortSignal: r, onProgress: s, label: o = "mapEach" } = n;
   if (!t || t.length === 0) return [];
-  const i = I(o, s);
+  const i = k(o, s);
   i.start();
   const a = i.batch(t.length), c = new Array(t.length);
   try {
@@ -12323,7 +12305,7 @@ async function _S(e, t, n = {}) {
 async function CS(e, t, n = {}) {
   const { abortSignal: r, onProgress: s, label: o = "filterEach" } = n;
   if (!t || t.length === 0) return [];
-  const i = I(o, s);
+  const i = k(o, s);
   i.start();
   const a = i.batch(t.length), c = [];
   try {
@@ -12339,7 +12321,7 @@ async function CS(e, t, n = {}) {
 async function jS(e, t, n = {}) {
   const { abortSignal: r, onProgress: s, label: o = "findEach" } = n;
   if (!t || t.length === 0) return;
-  const i = I(o, s);
+  const i = k(o, s);
   i.start();
   const a = i.batch(t.length);
   try {
@@ -12356,7 +12338,7 @@ async function jS(e, t, n = {}) {
   }
 }
 async function NS(e, t, n, r = {}) {
-  const { abortSignal: s, onProgress: o, label: i = "reduceEach" } = r, a = I(i, o);
+  const { abortSignal: s, onProgress: o, label: i = "reduceEach" } = r, a = k(i, o);
   a.start();
   const c = a.batch(t.length);
   let l = n;
@@ -12373,7 +12355,7 @@ async function NS(e, t, n, r = {}) {
 async function RS(e, t, n = {}) {
   const { abortSignal: r, onProgress: s, label: o = "groupEach" } = n;
   if (!t || t.length === 0) return {};
-  const i = I(o, s);
+  const i = k(o, s);
   i.start();
   const a = i.batch(t.length), c = {};
   try {
@@ -12633,8 +12615,8 @@ const US = {
 }).join(`
 `), QS = (e, t, n, r) => {
   const s = async (o, i = {}) => {
-    const { untrusted: a = !1 } = i, c = A(e, { maxAttempts: 3, ...i }), l = typeof n == "function" ? n(o, c) : n, u = typeof t == "function" ? t(o, c) : t, p = I(e, c.onProgress, c);
-    p.start(), p.emit({ event: k.step, stepName: "analyzing" });
+    const { untrusted: a = !1 } = i, c = O(e, { maxAttempts: 3, ...i }), l = typeof n == "function" ? n(o, c) : n, u = typeof t == "function" ? t(o, c) : t, p = k(e, c.onProgress, c);
+    p.start(), p.emit({ event: A.step, stepName: "analyzing" });
     const d = r(o, c), h = a ? u + ai : u, y = a ? [ci, ...d] : d, b = await M(
       () => _(y.join(`
 
@@ -12749,7 +12731,7 @@ ${n.join(", ")}
 `);
 }
 async function lx({ exampleTexts: e, projectionNames: t, propertyNames: n }, r = {}) {
-  const s = A(uo, r), o = I(uo, s.onProgress, s);
+  const s = O(uo, r), o = k(uo, s.onProgress, s);
   o.start();
   try {
     const i = cx({ exampleTexts: e, projectionNames: t, propertyNames: n }), a = await M(
@@ -12833,27 +12815,27 @@ async function bx(e, t, n) {
   });
 }
 async function wx({ sourceTexts: e, schema: t }, n = {}) {
-  const r = A(po, n), s = I(po, r.onProgress, r);
+  const r = O(po, n), s = k(po, r.onProgress, r);
   s.start();
   try {
     const {
       maxParallel: o,
       batchSize: i,
       errorPosture: a
-    } = await q(r, {
+    } = await F(r, {
       maxParallel: 3,
       batchSize: 5,
       errorPosture: z.resilient
     }), c = [];
     for (let d = 0; d < e.length; d += i)
       c.push(e.slice(d, d + i));
-    s.emit({ event: k.phase, phase: "fragmenting", totalBatches: c.length });
+    s.emit({ event: A.phase, phase: "fragmenting", totalBatches: c.length });
     const l = s.batch(e.length), p = (await Q(
       c,
       async (d) => {
         const h = await bx(d, t, {
           ...r,
-          onProgress: L(r.onProgress, "batch")
+          onProgress: B(r.onProgress, "batch")
         });
         return l(d.length), h;
       },
@@ -12904,7 +12886,7 @@ function Tx(e, t) {
 `);
 }
 async function Ex({ schema: e, studySet: t }, n = {}) {
-  const r = A(mo, n), s = I(mo, r.onProgress, r);
+  const r = O(mo, n), s = k(mo, r.onProgress, r);
   s.start();
   try {
     const o = Tx(e, t), i = await M(
@@ -12942,10 +12924,10 @@ function ft(e) {
   for (let s = 0; s < e.length; s++) n[s] = e[s] * r;
   return n;
 }
-function Ix(e, t, n) {
+function kx(e, t, n) {
   return Pe(e, n) - Pe(e, t);
 }
-function kx(e, t) {
+function Ix(e, t) {
   const n = new Float32Array(e.length);
   for (let r = 0; r < e.length; r++) n[r] = e[r] * t;
   return n;
@@ -12977,22 +12959,22 @@ async function _x({ fragmentSets: e, schema: t }, n = {}) {
   const o = e.flatMap((g) => g.fragments).some((g) => g.image) ? { ...n, embedding: { multi: !0 } } : n, i = [], a = /* @__PURE__ */ new Map(), c = [], l = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
   for (const g of e)
     for (const m of g.fragments) {
-      const w = !!m.image, S = w ? `img:${m.image}` : `txt:${m.text}`;
+      const w = !!m.image, v = w ? `img:${m.image}` : `txt:${m.text}`;
       w && !l.has(m.image) && (l.set(m.image, c.length), c.push(m.image)), !w && !a.has(m.text) && (a.set(m.text, i.length), i.push(m.text));
-      const v = m.sourceIds?.[0] ?? g.fragmentSetId;
-      u.has(v) || u.set(v, /* @__PURE__ */ new Map());
-      const P = u.get(v);
-      P.has(m.projectionName) || P.set(m.projectionName, []), P.get(m.projectionName).push(S);
+      const S = m.sourceIds?.[0] ?? g.fragmentSetId;
+      u.has(S) || u.set(S, /* @__PURE__ */ new Map());
+      const P = u.get(S);
+      P.has(m.projectionName) || P.set(m.projectionName, []), P.get(m.projectionName).push(v);
     }
   const p = i.length > 0 ? await nt(i, o) : [], d = c.length > 0 ? await er(c, o) : [], h = (g) => g.startsWith("img:") ? d[l.get(g.slice(4))] : p[a.get(g.slice(4))], y = [];
   for (const [g, m] of u) {
-    const w = {}, S = [];
+    const w = {}, v = [];
     for (const [P, x] of m) {
-      const E = x.map(h), O = mn(E);
-      O && (w[P] = ft(O), S.push(...E));
+      const E = x.map(h), I = mn(E);
+      I && (w[P] = ft(I), v.push(...E));
     }
-    const v = S.length > 0 ? ft(mn(S)) : void 0;
-    y.push({ stateId: g, vectorsByProjectionName: w, baseVector: v });
+    const S = v.length > 0 ? ft(mn(v)) : void 0;
+    y.push({ stateId: g, vectorsByProjectionName: w, baseVector: S });
   }
   const b = await Ox(t, o), f = b !== t._poles ? { ...t, _poles: b } : t;
   return { states: y, schema: f };
@@ -13002,7 +12984,7 @@ function Cx({ states: e, editsByProjectionName: t }) {
     const r = {};
     for (const [s, o] of Object.entries(n.vectorsByProjectionName)) {
       const i = t[s];
-      r[s] = i !== void 0 ? kx(o, 1 + i) : new Float32Array(o);
+      r[s] = i !== void 0 ? Ix(o, 1 + i) : new Float32Array(o);
     }
     return {
       stateId: n.stateId,
@@ -13039,9 +13021,9 @@ function Lc(e, t, n, r) {
     }
     let u = 0, p = 0, d = 0;
     for (const [m, w] of Object.entries(c.projectionWeights)) {
-      const S = e.vectorsByProjectionName[m];
-      if (!S) continue;
-      const v = n[m] ?? 1, P = w * v, x = Ix(S, l.low, l.high);
+      const v = e.vectorsByProjectionName[m];
+      if (!v) continue;
+      const S = n[m] ?? 1, P = w * S, x = kx(v, l.low, l.high);
       u += x * P, p += P, d += 1;
     }
     if (p === 0) {
@@ -13081,12 +13063,12 @@ async function Lx({ leftStates: e, rightStates: t, intent: n }, r = {}) {
       for (const [f, g] of l) {
         const m = p.vectorsByProjectionName[f], w = d.vectorsByProjectionName[f];
         if (m && w) {
-          let S = Pe(m, w);
+          let v = Pe(m, w);
           if (c) {
-            const v = Pe(c, m), P = Pe(c, w);
-            S = S * 0.6 + (v + P) * 0.2;
+            const S = Pe(c, m), P = Pe(c, w);
+            v = v * 0.6 + (S + P) * 0.2;
           }
-          h += S * g, y += g;
+          h += v * g, y += g;
         }
       }
       const b = y > 0 ? h / y : 0;
@@ -13122,7 +13104,7 @@ const Bx = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   debugPromptGlobally: Po,
   debugPromptGloballyIfChanged: To,
   debugResultGlobally: Eo,
-  debugResultGloballyIfChanged: Io,
+  debugResultGloballyIfChanged: ko,
   defaultRules: vn,
   findRule: mu,
   systemPrompt: ae
@@ -13217,19 +13199,19 @@ function zx(e = {}) {
     "eventToTrace",
     "scopePhase",
     "nameStep"
-  ]), S = /* @__PURE__ */ new Set(["embedObject"]), v = {};
+  ]), v = /* @__PURE__ */ new Set(["embedObject"]), S = {};
   for (const [P, x] of Object.entries(rl))
     if (!w.has(P)) {
-      if (S.has(P) && typeof x == "object" && x !== null) {
-        v[P] = Object.fromEntries(
-          Object.entries(x).map(([E, O]) => [E, hn(m, O)])
+      if (v.has(P) && typeof x == "object" && x !== null) {
+        S[P] = Object.fromEntries(
+          Object.entries(x).map(([E, I]) => [E, hn(m, I)])
         );
         continue;
       }
-      v[P] = hn(m, x);
+      S[P] = hn(m, x);
     }
   return {
-    ...v,
+    ...S,
     config: m,
     modelService: y,
     embeddingService: b,
@@ -13247,13 +13229,13 @@ export {
   Pi as A,
   Rn as B,
   xm as C,
-  k as D,
+  A as D,
   z as E,
   Ei as F,
   Ti as G,
   Cm as H,
-  Ii as I,
-  ki as J,
+  ki as I,
+  Ii as J,
   Ai as K,
   Oi as L,
   Ci as M,
@@ -13298,8 +13280,8 @@ export {
   va as aM,
   wa as aN,
   Ea as aO,
-  Ia as aP,
-  ka as aQ,
+  ka as aP,
+  Ia as aQ,
   Oa as aR,
   _a as aS,
   Ca as aT,
@@ -13323,11 +13305,11 @@ export {
   Ze as ak,
   Gf as al,
   be as am,
-  ue as an,
+  me as an,
   je as ao,
   ca as ap,
   Oe as aq,
-  ke as ar,
+  Ie as ar,
   qn as as,
   hg as at,
   gg as au,
@@ -13349,8 +13331,8 @@ export {
   Qa as b8,
   ec as b9,
   Ec as bA,
-  Ic as bB,
-  kc as bC,
+  kc as bB,
+  Ic as bC,
   Ac as bD,
   xt as bE,
   aS as bF,
@@ -13401,7 +13383,7 @@ export {
   er as bx,
   Pc as by,
   Tc as bz,
-  I as c,
+  k as c,
   ye as c0,
   fe as c1,
   cp as c2,
@@ -13411,7 +13393,7 @@ export {
   U as c6,
   qe as c7,
   ES as c8,
-  IS as c9,
+  kS as c9,
   nu as cA,
   eu as cB,
   ru as cC,
@@ -13431,7 +13413,7 @@ export {
   zx as cQ,
   Sl as cR,
   il as cS,
-  kS as ca,
+  IS as ca,
   AS as cb,
   OS as cc,
   _S as cd,
@@ -13439,7 +13421,7 @@ export {
   jS as cf,
   NS as cg,
   RS as ch,
-  In as ci,
+  kn as ci,
   Aa as cj,
   MS as ck,
   xn as cl,
@@ -13459,20 +13441,20 @@ export {
   Zl as cz,
   $ as d,
   W as e,
-  Ie as f,
-  q as g,
+  ke as f,
+  F as g,
   K as h,
   o0 as i,
   C as j,
   N as k,
   M as l,
   cv as m,
-  A as n,
+  O as n,
   ac as o,
   Q as p,
   ov as q,
   _ as r,
-  L as s,
+  B as s,
   Ux as t,
   On as u,
   _n as v,