@od-oneapp/ai-platform 0.1.0

package/dist/loop-BOYEtr2g.mjs

@@ -0,0 +1,520 @@
+import { et as generateText, h as anthropic, vt as openai } from "./ai-runtime-CDzQztTt.mjs";
+import { z } from "zod";
+import { randomUUID } from "node:crypto";
+import { logError, logWarn } from "@od-oneapp/shared/logs";
+
+//#region src/grounding/proof-map/applyPatch.ts
+/**
+* @fileoverview JSON-Patch operations for proof maps
+*
+* Provides utilities for applying edits to proof maps safely.
+* Supports replace, add, and remove operations with validation.
+*
+* Note: This module is exported as "./proof-map/patch" in package.json for API clarity.
+* The export name "patch" is more descriptive of the module's purpose than "applyPatch".
+*
+* @module @od-oneapp/ai-platform/proof-map/patch
+*/
+/**
+* Applies edits to a proof map using JSON-Patch-like operations.
+* Supports replace, add, and remove operations.
+* Deep clones the object to avoid mutation.
+*
+* @param obj - Object to apply edits to.
+* @param edits - Array of edit operations (defaults to empty array).
+* @returns New object with edits applied.
+* @remarks Deep clones input object to prevent mutation.
+* Invalid paths are logged as warnings and skipped.
+* Array indices are validated before access.
+* For 'add' operations on arrays, appends if index is out of bounds.
+* @example
+* ```ts
+* const updated = applyPatch(proof, [
+*   { op: 'replace', path: ['draft', 'answer'], value: 'Updated answer' },
+*   { op: 'remove', path: ['draft', 'claims', 0] }
+* ]);
+* ```
+*/
+const applyPatch = (obj, edits = []) => {
+	const result = JSON.parse(JSON.stringify(obj));
+	for (const edit of edits) {
+		if (edit.path.length === 0) continue;
+		const parentPath = edit.path.slice(0, -1);
+		const lastKey = edit.path.at(-1);
+		if (lastKey === void 0) continue;
+		let target = result;
+		let pathInvalid = false;
+		for (const key of parentPath) {
+			if (target === null || typeof target !== "object") {
+				logWarn("[applyPatch] Invalid path", { path: edit.path.join(".") });
+				pathInvalid = true;
+				break;
+			}
+			if (Array.isArray(target)) {
+				const index = typeof key === "number" ? key : Number.parseInt(String(key), 10);
+				if (Number.isNaN(index) || index < 0 || index >= target.length) {
+					logWarn("[applyPatch] Invalid array index", { key });
+					pathInvalid = true;
+					break;
+				}
+				target = target[index];
+			} else target = target[key];
+		}
+		if (pathInvalid || target === null || typeof target !== "object") {
+			logWarn("[applyPatch] Cannot apply edit to non-object", { path: parentPath.join(".") });
+			continue;
+		}
+		switch (edit.op) {
+			case "replace":
+				if (Array.isArray(target)) {
+					const index = typeof lastKey === "number" ? lastKey : Number.parseInt(String(lastKey), 10);
+					if (!Number.isNaN(index) && index >= 0 && index < target.length) target[index] = edit.value;
+				} else target[lastKey] = edit.value;
+				break;
+			case "add":
+				if (Array.isArray(target)) {
+					const index = typeof lastKey === "number" ? lastKey : Number.parseInt(String(lastKey), 10);
+					if (!Number.isNaN(index) && index >= 0 && index < target.length) {
+						const existingValue = target[index];
+						if (Array.isArray(existingValue)) existingValue.push(edit.value);
+						else target[index] = edit.value;
+					} else target.push(edit.value);
+				} else {
+					const existingValue = target[lastKey];
+					if (Array.isArray(existingValue)) existingValue.push(edit.value);
+					else target[lastKey] = edit.value;
+				}
+				break;
+			case "remove":
+				if (Array.isArray(target)) {
+					const index = typeof lastKey === "number" ? lastKey : Number.parseInt(String(lastKey), 10);
+					if (!Number.isNaN(index) && index >= 0 && index < target.length) target.splice(index, 1);
+				} else delete target[lastKey];
+				break;
+			default: logWarn("[applyPatch] Unknown operation", { op: "op" in edit ? String(edit.op) : "unknown" });
+		}
+	}
+	return result;
+};
+/**
+* Validates that suggested edits are "safe" (low-risk).
+* Only allows scalar replacements (string, number, boolean) for safety.
+* More complex edits are marked as unsafe.
+*
+* @param edits - Array of edits to validate.
+* @returns Object containing safe and unsafe edit arrays:
+* - `safe` - Edits that are safe to auto-apply (scalar replacements only)
+* - `unsafe` - Edits that require manual review (non-scalar or non-replace operations)
+* @remarks Only 'replace' operations with scalar values (string, number, boolean) are considered safe.
+* 'add' and 'remove' operations are always marked unsafe.
+* Non-scalar values (objects, arrays) are marked unsafe even for 'replace' operations.
+* @example
+* ```ts
+* const { safe, unsafe } = validateSafeEdits(edits);
+* const updated = applyPatch(proof, safe);
+* ```
+*/
+const validateSafeEdits = (edits) => {
+	const safe = [];
+	const unsafe = [];
+	for (const edit of edits) if (edit.op === "replace" && (typeof edit.value === "string" || typeof edit.value === "number" || typeof edit.value === "boolean")) safe.push(edit);
+	else unsafe.push(edit);
+	return {
+		safe,
+		unsafe
+	};
+};
+
+//#endregion
+//#region src/grounding/proof-map/schema.ts
+/**
+* @fileoverview Proof map schema definitions
+*
+* Defines Zod schemas for proof maps, a hierarchical verification framework
+* for AI-generated content. Supports chains, steps, claims, checks, and edits.
+*
+* @module @od-oneapp/ai-platform/proof-map/schema
+*/
+/** Check status values ('pass' or 'fail'). */
+const checkStatus = z.enum(["pass", "fail"]);
+/** Proof status values ('needs_fixes', 'verified', or 'rejected'). */
+const proofStatus = z.enum([
+	"needs_fixes",
+	"verified",
+	"rejected"
+]);
+/**
+* Step schema (discriminated union by kind).
+* Supports premise, quote, deduction, and calculation steps.
+*/
+const stepSchema = z.discriminatedUnion("kind", [
+	z.object({
+		i: z.number(),
+		kind: z.literal("premise"),
+		text: z.string(),
+		source: z.enum([
+			"user",
+			"doc",
+			"web"
+		])
+	}),
+	z.object({
+		i: z.number(),
+		kind: z.literal("quote"),
+		text: z.string(),
+		source: z.enum([
+			"user",
+			"doc",
+			"web"
+		])
+	}),
+	z.object({
+		i: z.number(),
+		kind: z.literal("deduction"),
+		text: z.string()
+	}),
+	z.object({
+		i: z.number(),
+		kind: z.literal("calc"),
+		expr: z.string(),
+		result: z.number()
+	})
+]);
+/**
+* Chain schema (reasoning chain with steps).
+*/
+const chainSchema = z.object({
+	id: z.string(),
+	steps: z.array(stepSchema)
+});
+/**
+* Claim schema (factual claim with tags).
+*/
+const claimSchema = z.object({
+	id: z.string(),
+	text: z.string(),
+	tags: z.array(z.string())
+});
+/**
+* Check schema (verification check result).
+*/
+const checkSchema = z.object({
+	target: z.string(),
+	status: checkStatus,
+	note: z.string().optional()
+});
+/**
+* Edit schema (JSON-Patch-like edit operation).
+*/
+const editSchema = z.object({
+	op: z.enum([
+		"replace",
+		"remove",
+		"add"
+	]),
+	path: z.array(z.union([z.string(), z.number()])),
+	value: z.unknown().optional()
+});
+/**
+* Verification schema (verification result with checks and edits).
+*/
+const verificationSchema = z.object({
+	by: z.string(),
+	method: z.string(),
+	checks: z.array(checkSchema),
+	suggested_edits: z.array(editSchema).optional(),
+	timestamp: z.string().optional()
+});
+/**
+* Proof map schema (complete proof structure).
+*/
+const proofMapSchema = z.object({
+	task_id: z.string(),
+	inputs: z.record(z.string(), z.unknown()),
+	draft: z.object({
+		answer: z.string(),
+		chains: z.array(chainSchema),
+		claims: z.array(claimSchema)
+	}),
+	verifications: z.array(verificationSchema),
+	status: proofStatus,
+	created_at: z.string().optional(),
+	updated_at: z.string().optional()
+});
+/**
+* Checks if a proof has any failing checks.
+*
+* @param proof - Proof map to check.
+* @returns `true` if any verification has failing checks, `false` otherwise.
+* @example
+* ```ts
+* if (hasFailingChecks(proof)) {
+*   console.log('Proof has issues');
+* }
+* ```
+*/
+const hasFailingChecks = (proof) => proof.verifications.some((verification) => verification.checks.some((check) => check.status === "fail"));
+/**
+* Gets critical claims from a proof map.
+* Critical claims are tagged with: 'critical', 'finance', 'safety', 'hipaa', or 'compliance'.
+*
+* @param proof - Proof map to extract claims from.
+* @returns Array of critical claims.
+* @example
+* ```ts
+* const critical = getCriticalClaims(proof);
+* console.log(`Found ${critical.length} critical claims`);
+* ```
+*/
+const getCriticalClaims = (proof) => {
+	const criticalTags = new Set([
+		"critical",
+		"finance",
+		"safety",
+		"hipaa",
+		"compliance"
+	]);
+	return proof.draft.claims.filter((claim) => claim.tags.some((tag) => criticalTags.has(tag.toLowerCase())));
+};
+/**
+* Checks if all critical claims have passing checks.
+* Returns `true` if there are no critical claims or all critical claims pass.
+*
+* @param proof - Proof map to check.
+* @returns `true` if all critical claims pass, `false` otherwise.
+* @example
+* ```ts
+* if (criticalClaimsPass(proof)) {
+*   console.log('All critical claims verified');
+* }
+* ```
+*/
+const criticalClaimsPass = (proof) => {
+	const critical = getCriticalClaims(proof);
+	if (critical.length === 0) return true;
+	const criticalIds = new Set(critical.map((claim) => claim.id));
+	const criticalChecks = proof.verifications.flatMap((verification) => verification.checks).filter((check) => [...criticalIds].some((id) => check.target.includes(id)));
+	return criticalChecks.length > 0 && criticalChecks.every((c) => c.status === "pass");
+};
+
+//#endregion
+//#region src/grounding/proof-map/loop.ts
+/**
+* @fileoverview Proof map loop execution
+*
+* Implements the multi-model proof loop:
+* 1. Sonnet 4.5 drafts reasoning + claims
+* 2. GPT-4 Turbo verifies via semantic deltas
+* 3. Apply safe edits and re-verify if needed
+*
+* Features:
+* - 2-iteration fix loop (conservative error correction)
+* - Safe-edit policy with constraints
+* - Gated verification (critical claims must pass)
+*
+* @module @od-oneapp/ai-platform/proof-map/loop
+*/
+/**
+* Runs the multi-model proof loop.
+* Executes draft → verify → fix cycle up to maxIterations times.
+*
+* Flow:
+* 1. Sonnet 4.5 drafts reasoning + claims
+* 2. GPT-4 Turbo verifies via semantic deltas
+* 3. Apply safe edits and re-verify if needed
+*
+* @param options - Proof loop options.
+* @param options.prompt - Prompt/question to generate proof for.
+* @param options.maxIterations - Maximum fix iterations (defaults to 2).
+* @param options.autoApplySafeEdits - Whether to auto-apply safe edits (defaults to true).
+* @param options.metadata - Optional metadata to attach.
+* @returns Proof map with status ('verified', 'needs_fixes', or 'rejected').
+* @remarks Draft phase only runs on first iteration.
+* Verification phase runs every iteration.
+* Proof is verified if: no failing checks AND all critical claims pass.
+* Safe edits are automatically applied if enabled and available.
+* Returns 'rejected' status if draft or verification phase fails.
+* @example
+* ```ts
+* const proof = await runProofLoop({
+*   prompt: 'Calculate the ROI for this investment',
+*   maxIterations: 2
+* });
+*
+* if (proof.status === 'verified') {
+*   console.log('Proof verified:', proof.draft.answer);
+* }
+* ```
+*/
+const runProofLoop = async (options) => {
+	const { prompt, maxIterations = 2, autoApplySafeEdits = true, metadata = {} } = options;
+	let proof = {
+		task_id: randomUUID(),
+		inputs: {
+			prompt,
+			...metadata
+		},
+		draft: {
+			answer: "",
+			chains: [],
+			claims: []
+		},
+		verifications: [],
+		status: "needs_fixes",
+		created_at: (/* @__PURE__ */ new Date()).toISOString()
+	};
+	let iteration = 0;
+	while (iteration < maxIterations) {
+		iteration++;
+		if (iteration === 1) {
+			const draftSchema = z.object({
+				answer: z.string(),
+				chains: z.array(chainSchema),
+				claims: z.array(claimSchema)
+			});
+			try {
+				const draftResult = await generateText({
+					model: anthropic("claude-3-5-sonnet-20241022"),
+					system: `You are a reasoning assistant. Output JSON with:
+- answer: a clear answer to the user's question
+- chains: array of reasoning chains, each with id and steps (premise/deduction/calc)
+- claims: array of factual claims with id, text, and tags (e.g. ["fact", "finance"])
+
+For calculations, use steps like: {"i":1,"kind":"calc","expr":"(12*8)/3","result":32}
+Tag critical claims with: ["critical", "finance", "safety", "hipaa"] as appropriate.`,
+					prompt,
+					maxRetries: 2
+				});
+				const parsed = JSON.parse(draftResult.text);
+				proof.draft = draftSchema.parse(parsed);
+			} catch (error) {
+				logError("[ProofLoop] Draft phase failed", { error });
+				proof.status = "rejected";
+				return proof;
+			}
+		}
+		const verifySchema = z.object({
+			checks: z.array(z.object({
+				target: z.string(),
+				status: z.enum(["pass", "fail"]),
+				note: z.string().optional()
+			})),
+			suggested_edits: z.array(z.object({
+				op: z.enum([
+					"replace",
+					"remove",
+					"add"
+				]),
+				path: z.array(z.union([z.string(), z.number()])),
+				value: z.unknown().optional()
+			})).optional()
+		});
+		try {
+			const verifyResult = await generateText({
+				model: openai("gpt-4-turbo"),
+				system: `You are a verification assistant. Review the proof map and:
+1. Recompute all calculations
+2. Check factual consistency
+3. Verify reasoning steps
+4. Return JSON with:
+   - checks: array of {target, status, note}
+   - suggested_edits: array of safe edits to fix issues
+
+For target, use format like "calc:c1:3" or "claim:k1".
+Only suggest edits that are factually correct and low-risk (scalar replacements).`,
+				prompt: JSON.stringify(proof, null, 2),
+				maxRetries: 2
+			});
+			const parsed = JSON.parse(verifyResult.text);
+			const verifyData = verifySchema.parse(parsed);
+			proof.verifications.push({
+				by: "gpt-4-turbo",
+				method: "semantic-delta",
+				checks: verifyData.checks,
+				suggested_edits: verifyData.suggested_edits,
+				timestamp: (/* @__PURE__ */ new Date()).toISOString()
+			});
+		} catch (error) {
+			logError("[ProofLoop] Verify phase failed", { error });
+			proof.status = "rejected";
+			return proof;
+		}
+		const failed = hasFailingChecks(proof);
+		const criticalPass = criticalClaimsPass(proof);
+		if (!failed && criticalPass) {
+			proof.status = "verified";
+			proof.updated_at = (/* @__PURE__ */ new Date()).toISOString();
+			return proof;
+		}
+		if (autoApplySafeEdits && iteration < maxIterations) {
+			const edits = proof.verifications[proof.verifications.length - 1]?.suggested_edits ?? [];
+			if (edits.length > 0) {
+				const { safe } = validateSafeEdits(edits);
+				if (safe.length > 0) {
+					proof = applyPatch(proof, safe);
+					logWarn("[ProofLoop] Applied safe edits", { count: safe.length });
+					continue;
+				}
+			}
+		}
+		break;
+	}
+	proof.status = "needs_fixes";
+	proof.updated_at = (/* @__PURE__ */ new Date()).toISOString();
+	return proof;
+};
+/**
+* Simplified single-pass verification (no fix loop).
+* Verifies a proof map once without applying edits or re-verifying.
+*
+* @param proof - Proof map to verify.
+* @returns Updated proof map with verification results and status.
+* @remarks Does not apply edits or re-verify. Single verification pass only.
+* Status is set to 'verified' if no failing checks and critical claims pass,
+* otherwise 'needs_fixes'. Returns 'rejected' if verification fails.
+* @example
+* ```ts
+* const verified = await verifyProof(proof);
+* console.log('Status:', verified.status);
+* ```
+*/
+const verifyProof = async (proof) => {
+	const verifySchema = z.object({ checks: z.array(z.object({
+		target: z.string(),
+		status: z.enum(["pass", "fail"]),
+		note: z.string().optional()
+	})) });
+	try {
+		const verifyResult = await generateText({
+			model: openai("gpt-4-turbo"),
+			system: "Verify the proof map. Return JSON with checks array.",
+			prompt: JSON.stringify(proof, null, 2),
+			maxRetries: 2
+		});
+		const parsed = JSON.parse(verifyResult.text);
+		const verifyData = verifySchema.parse(parsed);
+		const updated = { ...proof };
+		updated.verifications.push({
+			by: "gpt-4-turbo",
+			method: "semantic-delta",
+			checks: verifyData.checks,
+			timestamp: (/* @__PURE__ */ new Date()).toISOString()
+		});
+		const failed = hasFailingChecks(updated);
+		const criticalPass = criticalClaimsPass(updated);
+		updated.status = !failed && criticalPass ? "verified" : "needs_fixes";
+		updated.updated_at = (/* @__PURE__ */ new Date()).toISOString();
+		return updated;
+	} catch (error) {
+		logError("[verifyProof] Failed", { error });
+		return {
+			...proof,
+			status: "rejected",
+			updated_at: (/* @__PURE__ */ new Date()).toISOString()
+		};
+	}
+};
+
+//#endregion
+export { checkStatus as a, editSchema as c, proofMapSchema as d, proofStatus as f, validateSafeEdits as g, applyPatch as h, checkSchema as i, getCriticalClaims as l, verificationSchema as m, verifyProof as n, claimSchema as o, stepSchema as p, chainSchema as r, criticalClaimsPass as s, runProofLoop as t, hasFailingChecks as u };
+//# sourceMappingURL=loop-BOYEtr2g.mjs.map

package/dist/loop-BOYEtr2g.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"loop-BOYEtr2g.mjs","names":[],"sources":["../src/grounding/proof-map/applyPatch.ts","../src/grounding/proof-map/schema.ts","../src/grounding/proof-map/loop.ts"],"sourcesContent":["/**\n * @fileoverview JSON-Patch operations for proof maps\n *\n * Provides utilities for applying edits to proof maps safely.\n * Supports replace, add, and remove operations with validation.\n *\n * Note: This module is exported as \"./proof-map/patch\" in package.json for API clarity.\n * The export name \"patch\" is more descriptive of the module's purpose than \"applyPatch\".\n *\n * @module @od-oneapp/ai-platform/proof-map/patch\n */\n\nimport { logWarn } from '@repo/shared/logs';\n\nimport type { Edit } from './schema';\n\n/**\n * Applies edits to a proof map using JSON-Patch-like operations.\n * Supports replace, add, and remove operations.\n * Deep clones the object to avoid mutation.\n *\n * @param obj - Object to apply edits to.\n * @param edits - Array of edit operations (defaults to empty array).\n * @returns New object with edits applied.\n * @remarks Deep clones input object to prevent mutation.\n * Invalid paths are logged as warnings and skipped.\n * Array indices are validated before access.\n * For 'add' operations on arrays, appends if index is out of bounds.\n * @example\n * ```ts\n * const updated = applyPatch(proof, [\n *   { op: 'replace', path: ['draft', 'answer'], value: 'Updated answer' },\n *   { op: 'remove', path: ['draft', 'claims', 0] }\n * ]);\n * ```\n */\nexport const applyPatch = <T extends Record<string, unknown>>(obj: T, edits: Edit[] = []): T => {\n  // Deep clone to avoid mutation\n  const result = JSON.parse(JSON.stringify(obj)) as T;\n\n  for (const edit of edits) {\n    if (edit.path.length === 0) continue;\n\n    // Navigate to the parent object\n    const parentPath = edit.path.slice(0, -1);\n    const lastKey = edit.path.at(-1);\n\n    if (lastKey === undefined) continue;\n\n    let target: Record<string, unknown> | unknown[] | null = result;\n    let pathInvalid = false;\n    for (const key of parentPath) {\n      if (target === null || typeof target !== 'object') {\n        logWarn('[applyPatch] Invalid path', { path: edit.path.join('.') });\n        pathInvalid = true;\n        break;\n      }\n      if (Array.isArray(target)) {\n        const index = typeof key === 'number' ? key : Number.parseInt(String(key), 10);\n        if (Number.isNaN(index) || index < 0 || index >= target.length) {\n          logWarn('[applyPatch] Invalid array index', { key });\n          pathInvalid = true;\n          break;\n        }\n        target = target[index] as Record<string, unknown> | unknown[] | null;\n      } else {\n        target = target[key] as Record<string, unknown> | unknown[] | null;\n      }\n    }\n\n    if (pathInvalid || target === null || typeof target !== 'object') {\n      logWarn('[applyPatch] Cannot apply edit to non-object', { path: parentPath.join('.') });\n      continue;\n    }\n\n    switch (edit.op) {\n      case 'replace':\n        if (Array.isArray(target)) {\n          const index =\n            typeof lastKey === 'number' ? lastKey : Number.parseInt(String(lastKey), 10);\n          if (!Number.isNaN(index) && index >= 0 && index < target.length) {\n            target[index] = edit.value;\n          }\n        } else {\n          target[lastKey] = edit.value;\n        }\n        break;\n\n      case 'add':\n        if (Array.isArray(target)) {\n          const index =\n            typeof lastKey === 'number' ? lastKey : Number.parseInt(String(lastKey), 10);\n          if (!Number.isNaN(index) && index >= 0 && index < target.length) {\n            const existingValue = target[index];\n            if (Array.isArray(existingValue)) {\n              existingValue.push(edit.value);\n            } else {\n              target[index] = edit.value;\n            }\n          } else {\n            target.push(edit.value);\n          }\n        } else {\n          const existingValue = target[lastKey];\n          if (Array.isArray(existingValue)) {\n            existingValue.push(edit.value);\n          } else {\n            target[lastKey] = edit.value;\n          }\n        }\n        break;\n\n      case 'remove':\n        if (Array.isArray(target)) {\n          const index =\n            typeof lastKey === 'number' ? lastKey : Number.parseInt(String(lastKey), 10);\n          if (!Number.isNaN(index) && index >= 0 && index < target.length) {\n            target.splice(index, 1);\n          }\n        } else {\n          delete target[lastKey];\n        }\n        break;\n\n      default:\n        logWarn('[applyPatch] Unknown operation', {\n          op: 'op' in edit ? String(edit.op) : 'unknown',\n        });\n    }\n  }\n\n  return result;\n};\n\n/**\n * Validates that suggested edits are \"safe\" (low-risk).\n * Only allows scalar replacements (string, number, boolean) for safety.\n * More complex edits are marked as unsafe.\n *\n * @param edits - Array of edits to validate.\n * @returns Object containing safe and unsafe edit arrays:\n * - `safe` - Edits that are safe to auto-apply (scalar replacements only)\n * - `unsafe` - Edits that require manual review (non-scalar or non-replace operations)\n * @remarks Only 'replace' operations with scalar values (string, number, boolean) are considered safe.\n * 'add' and 'remove' operations are always marked unsafe.\n * Non-scalar values (objects, arrays) are marked unsafe even for 'replace' operations.\n * @example\n * ```ts\n * const { safe, unsafe } = validateSafeEdits(edits);\n * const updated = applyPatch(proof, safe);\n * ```\n */\nexport const validateSafeEdits = (edits: Edit[]): { safe: Edit[]; unsafe: Edit[] } => {\n  const safe: Edit[] = [];\n  const unsafe: Edit[] = [];\n\n  for (const edit of edits) {\n    const isSafe =\n      edit.op === 'replace' &&\n      (typeof edit.value === 'string' ||\n        typeof edit.value === 'number' ||\n        typeof edit.value === 'boolean');\n\n    if (isSafe) {\n      safe.push(edit);\n    } else {\n      unsafe.push(edit);\n    }\n  }\n\n  return { safe, unsafe };\n};\n","/**\n * @fileoverview Proof map schema definitions\n *\n * Defines Zod schemas for proof maps, a hierarchical verification framework\n * for AI-generated content. Supports chains, steps, claims, checks, and edits.\n *\n * @module @od-oneapp/ai-platform/proof-map/schema\n */\n\nimport { z } from 'zod';\n\n/** Check status values ('pass' or 'fail'). */\nexport const checkStatus = z.enum(['pass', 'fail']);\n/** Proof status values ('needs_fixes', 'verified', or 'rejected'). */\nexport const proofStatus = z.enum(['needs_fixes', 'verified', 'rejected']);\n\n/**\n * Step schema (discriminated union by kind).\n * Supports premise, quote, deduction, and calculation steps.\n */\nexport const stepSchema = z.discriminatedUnion('kind', [\n  z.object({\n    i: z.number(),\n    kind: z.literal('premise'),\n    text: z.string(),\n    source: z.enum(['user', 'doc', 'web']),\n  }),\n  z.object({\n    i: z.number(),\n    kind: z.literal('quote'),\n    text: z.string(),\n    source: z.enum(['user', 'doc', 'web']),\n  }),\n  z.object({\n    i: z.number(),\n    kind: z.literal('deduction'),\n    text: z.string(),\n  }),\n  z.object({\n    i: z.number(),\n    kind: z.literal('calc'),\n    expr: z.string(),\n    result: z.number(),\n  }),\n]);\n\n/**\n * Chain schema (reasoning chain with steps).\n */\nexport const chainSchema = z.object({\n  /** Chain identifier. */\n  id: z.string(),\n  /** Array of reasoning steps. */\n  steps: z.array(stepSchema),\n});\n\n/**\n * Claim schema (factual claim with tags).\n */\nexport const claimSchema = z.object({\n  /** Claim identifier. */\n  id: z.string(),\n  /** Claim text. */\n  text: z.string(),\n  /** Tags for categorization (e.g., ['critical', 'finance']). */\n  tags: z.array(z.string()),\n});\n\n/**\n * Check schema (verification check result).\n */\nexport const checkSchema = z.object({\n  /** Target identifier (e.g., 'calc:c1:3' or 'claim:k1'). */\n  target: z.string(),\n  /** Check status ('pass' or 'fail'). */\n  status: checkStatus,\n  /** Optional note explaining the check result. */\n  note: z.string().optional(),\n});\n\n/**\n * Edit schema (JSON-Patch-like edit operation).\n */\nexport const editSchema = z.object({\n  /** Edit operation ('replace', 'remove', or 'add'). */\n  op: z.enum(['replace', 'remove', 'add']),\n  /** Path to the target (array of strings/numbers). */\n  path: z.array(z.union([z.string(), z.number()])),\n  /** Optional value for replace/add operations. */\n\n  value: z.unknown().optional(),\n});\n\n/**\n * Verification schema (verification result with checks and edits).\n */\nexport const verificationSchema = z.object({\n  /** Verifier identifier (model name). */\n  by: z.string(),\n  /** Verification method (e.g., 'semantic-delta'). */\n  method: z.string(),\n  /** Array of verification checks. */\n  checks: z.array(checkSchema),\n  /** Optional suggested edits to fix issues. */\n  suggested_edits: z.array(editSchema).optional(),\n  /** Optional ISO timestamp. */\n  timestamp: z.string().optional(),\n});\n\n/**\n * Proof map schema (complete proof structure).\n */\nexport const proofMapSchema = z.object({\n  /** Task identifier. */\n  task_id: z.string(),\n  /** Input parameters. */\n\n  inputs: z.record(z.string(), z.unknown()),\n  /** Draft answer with chains and claims. */\n  draft: z.object({\n    /** Answer text. */\n    answer: z.string(),\n    /** Reasoning chains. */\n    chains: z.array(chainSchema),\n    /** Factual claims. */\n    claims: z.array(claimSchema),\n  }),\n  /** Array of verifications. */\n  verifications: z.array(verificationSchema),\n  /** Proof status. */\n  status: proofStatus,\n  /** Optional creation timestamp. */\n  created_at: z.string().optional(),\n  /** Optional update timestamp. */\n  updated_at: z.string().optional(),\n});\n\n/** Check status type. */\nexport type CheckStatus = z.infer<typeof checkStatus>;\n/** Proof status type. */\nexport type ProofStatus = z.infer<typeof proofStatus>;\n/** Step type. */\nexport type Step = z.infer<typeof stepSchema>;\n/** Chain type. */\nexport type Chain = z.infer<typeof chainSchema>;\n/** Claim type. */\nexport type Claim = z.infer<typeof claimSchema>;\n/** Check type. */\nexport type Check = z.infer<typeof checkSchema>;\n/** Edit type. */\nexport type Edit = z.infer<typeof editSchema>;\n/** Verification type. */\nexport type Verification = z.infer<typeof verificationSchema>;\n/** Proof map type. */\nexport type ProofMap = z.infer<typeof proofMapSchema>;\n\n/**\n * Checks if a proof has any failing checks.\n *\n * @param proof - Proof map to check.\n * @returns `true` if any verification has failing checks, `false` otherwise.\n * @example\n * ```ts\n * if (hasFailingChecks(proof)) {\n *   console.log('Proof has issues');\n * }\n * ```\n */\nexport const hasFailingChecks = (proof: ProofMap): boolean =>\n  proof.verifications.some(verification =>\n    verification.checks.some(check => check.status === 'fail'),\n  );\n\n/**\n * Gets critical claims from a proof map.\n * Critical claims are tagged with: 'critical', 'finance', 'safety', 'hipaa', or 'compliance'.\n *\n * @param proof - Proof map to extract claims from.\n * @returns Array of critical claims.\n * @example\n * ```ts\n * const critical = getCriticalClaims(proof);\n * console.log(`Found ${critical.length} critical claims`);\n * ```\n */\nexport const getCriticalClaims = (proof: ProofMap): Claim[] => {\n  const criticalTags = new Set(['critical', 'finance', 'safety', 'hipaa', 'compliance']);\n  return proof.draft.claims.filter(claim =>\n    claim.tags.some(tag => criticalTags.has(tag.toLowerCase())),\n  );\n};\n\n/**\n * Checks if all critical claims have passing checks.\n * Returns `true` if there are no critical claims or all critical claims pass.\n *\n * @param proof - Proof map to check.\n * @returns `true` if all critical claims pass, `false` otherwise.\n * @example\n * ```ts\n * if (criticalClaimsPass(proof)) {\n *   console.log('All critical claims verified');\n * }\n * ```\n */\nexport const criticalClaimsPass = (proof: ProofMap): boolean => {\n  const critical = getCriticalClaims(proof);\n  if (critical.length === 0) return true;\n\n  const criticalIds = new Set(critical.map(claim => claim.id));\n  const allChecks = proof.verifications.flatMap(verification => verification.checks);\n  const criticalChecks = allChecks.filter(check =>\n    [...criticalIds].some(id => check.target.includes(id)),\n  );\n\n  return criticalChecks.length > 0 && criticalChecks.every(c => c.status === 'pass');\n};\n","/**\n * @fileoverview Proof map loop execution\n *\n * Implements the multi-model proof loop:\n * 1. Sonnet 4.5 drafts reasoning + claims\n * 2. GPT-4 Turbo verifies via semantic deltas\n * 3. Apply safe edits and re-verify if needed\n *\n * Features:\n * - 2-iteration fix loop (conservative error correction)\n * - Safe-edit policy with constraints\n * - Gated verification (critical claims must pass)\n *\n * @module @od-oneapp/ai-platform/proof-map/loop\n */\n\nimport { randomUUID } from 'node:crypto';\n\nimport { logError, logWarn } from '@repo/shared/logs';\nimport { z } from 'zod';\n\nimport { anthropic, openai, generateText } from '../../shared';\n\nimport { applyPatch, validateSafeEdits } from './applyPatch';\nimport { chainSchema, claimSchema, criticalClaimsPass, hasFailingChecks } from './schema';\n\nimport type { ProofMap } from './schema';\n\n/**\n * Options for running the proof loop.\n */\nexport interface ProofLoopOptions {\n  /** Prompt/question to generate proof for. */\n  prompt: string;\n  /**\n   * Maximum number of fix iterations.\n   * @default 2\n   */\n  maxIterations?: number;\n  /**\n   * Whether to auto-apply safe edits from verifier.\n   * @default true\n   */\n  autoApplySafeEdits?: boolean;\n  /**\n   * Optional metadata to attach to the proof.\n   */\n  metadata?: Record<string, unknown>;\n}\n\n/**\n * Runs the multi-model proof loop.\n * Executes draft → verify → fix cycle up to maxIterations times.\n *\n * Flow:\n * 1. Sonnet 4.5 drafts reasoning + claims\n * 2. GPT-4 Turbo verifies via semantic deltas\n * 3. Apply safe edits and re-verify if needed\n *\n * @param options - Proof loop options.\n * @param options.prompt - Prompt/question to generate proof for.\n * @param options.maxIterations - Maximum fix iterations (defaults to 2).\n * @param options.autoApplySafeEdits - Whether to auto-apply safe edits (defaults to true).\n * @param options.metadata - Optional metadata to attach.\n * @returns Proof map with status ('verified', 'needs_fixes', or 'rejected').\n * @remarks Draft phase only runs on first iteration.\n * Verification phase runs every iteration.\n * Proof is verified if: no failing checks AND all critical claims pass.\n * Safe edits are automatically applied if enabled and available.\n * Returns 'rejected' status if draft or verification phase fails.\n * @example\n * ```ts\n * const proof = await runProofLoop({\n *   prompt: 'Calculate the ROI for this investment',\n *   maxIterations: 2\n * });\n *\n * if (proof.status === 'verified') {\n *   console.log('Proof verified:', proof.draft.answer);\n * }\n * ```\n */\nexport const runProofLoop = async (options: ProofLoopOptions): Promise<ProofMap> => {\n  const { prompt, maxIterations = 2, autoApplySafeEdits = true, metadata = {} } = options;\n\n  let proof: ProofMap = {\n    task_id: randomUUID(),\n    inputs: { prompt, ...metadata },\n    draft: { answer: '', chains: [], claims: [] },\n    verifications: [],\n    status: 'needs_fixes',\n    created_at: new Date().toISOString(),\n  };\n\n  let iteration = 0;\n\n  while (iteration < maxIterations) {\n    iteration++;\n\n    // Phase 1: Draft (Sonnet 4.5)\n    if (iteration === 1) {\n      const draftSchema = z.object({\n        answer: z.string(),\n        chains: z.array(chainSchema),\n        claims: z.array(claimSchema),\n      });\n\n      try {\n        const draftResult = await generateText({\n          model: anthropic('claude-3-5-sonnet-20241022'),\n          system: `You are a reasoning assistant. Output JSON with:\n- answer: a clear answer to the user's question\n- chains: array of reasoning chains, each with id and steps (premise/deduction/calc)\n- claims: array of factual claims with id, text, and tags (e.g. [\"fact\", \"finance\"])\n\nFor calculations, use steps like: {\"i\":1,\"kind\":\"calc\",\"expr\":\"(12*8)/3\",\"result\":32}\nTag critical claims with: [\"critical\", \"finance\", \"safety\", \"hipaa\"] as appropriate.`,\n          prompt,\n          maxRetries: 2,\n        });\n\n        const parsed = JSON.parse(draftResult.text);\n        proof.draft = draftSchema.parse(parsed);\n      } catch (error) {\n        logError('[ProofLoop] Draft phase failed', { error });\n        proof.status = 'rejected';\n        return proof;\n      }\n    }\n\n    // Phase 2: Verify (GPT-4 Turbo as GPT-5 placeholder)\n    const verifySchema = z.object({\n      checks: z.array(\n        z.object({\n          target: z.string(),\n          status: z.enum(['pass', 'fail']),\n          note: z.string().optional(),\n        }),\n      ),\n      suggested_edits: z\n        .array(\n          z.object({\n            op: z.enum(['replace', 'remove', 'add']),\n            path: z.array(z.union([z.string(), z.number()])),\n\n            value: z.unknown().optional(),\n          }),\n        )\n        .optional(),\n    });\n\n    try {\n      const verifyResult = await generateText({\n        model: openai('gpt-4-turbo'),\n        system: `You are a verification assistant. Review the proof map and:\n1. Recompute all calculations\n2. Check factual consistency\n3. Verify reasoning steps\n4. Return JSON with:\n   - checks: array of {target, status, note}\n   - suggested_edits: array of safe edits to fix issues\n\nFor target, use format like \"calc:c1:3\" or \"claim:k1\".\nOnly suggest edits that are factually correct and low-risk (scalar replacements).`,\n        prompt: JSON.stringify(proof, null, 2),\n        maxRetries: 2,\n      });\n\n      const parsed = JSON.parse(verifyResult.text);\n      const verifyData = verifySchema.parse(parsed);\n\n      proof.verifications.push({\n        by: 'gpt-4-turbo',\n        method: 'semantic-delta',\n        checks: verifyData.checks,\n        suggested_edits: verifyData.suggested_edits,\n        timestamp: new Date().toISOString(),\n      });\n    } catch (error) {\n      logError('[ProofLoop] Verify phase failed', { error });\n      proof.status = 'rejected';\n      return proof;\n    }\n\n    // Phase 3: Gate + apply edits\n    const failed = hasFailingChecks(proof);\n    const criticalPass = criticalClaimsPass(proof);\n\n    if (!failed && criticalPass) {\n      proof.status = 'verified';\n      proof.updated_at = new Date().toISOString();\n      return proof;\n    }\n\n    // Apply safe edits if enabled\n    if (autoApplySafeEdits && iteration < maxIterations) {\n      const lastVerification = proof.verifications[proof.verifications.length - 1];\n      const edits = lastVerification?.suggested_edits ?? [];\n\n      if (edits.length > 0) {\n        const { safe } = validateSafeEdits(edits);\n        if (safe.length > 0) {\n          proof = applyPatch(proof, safe);\n          logWarn('[ProofLoop] Applied safe edits', { count: safe.length });\n          continue; // Re-verify with edits\n        }\n      }\n    }\n\n    // No more iterations or no safe edits to apply\n    break;\n  }\n\n  proof.status = 'needs_fixes';\n  proof.updated_at = new Date().toISOString();\n  return proof;\n};\n\n/**\n * Simplified single-pass verification (no fix loop).\n * Verifies a proof map once without applying edits or re-verifying.\n *\n * @param proof - Proof map to verify.\n * @returns Updated proof map with verification results and status.\n * @remarks Does not apply edits or re-verify. Single verification pass only.\n * Status is set to 'verified' if no failing checks and critical claims pass,\n * otherwise 'needs_fixes'. Returns 'rejected' if verification fails.\n * @example\n * ```ts\n * const verified = await verifyProof(proof);\n * console.log('Status:', verified.status);\n * ```\n */\nexport const verifyProof = async (proof: ProofMap): Promise<ProofMap> => {\n  const verifySchema = z.object({\n    checks: z.array(\n      z.object({\n        target: z.string(),\n        status: z.enum(['pass', 'fail']),\n        note: z.string().optional(),\n      }),\n    ),\n  });\n\n  try {\n    const verifyResult = await generateText({\n      model: openai('gpt-4-turbo'),\n      system: 'Verify the proof map. Return JSON with checks array.',\n      prompt: JSON.stringify(proof, null, 2),\n      maxRetries: 2,\n    });\n\n    const parsed = JSON.parse(verifyResult.text);\n    const verifyData = verifySchema.parse(parsed);\n\n    const updated = { ...proof };\n    updated.verifications.push({\n      by: 'gpt-4-turbo',\n      method: 'semantic-delta',\n      checks: verifyData.checks,\n      timestamp: new Date().toISOString(),\n    });\n\n    const failed = hasFailingChecks(updated);\n    const criticalPass = criticalClaimsPass(updated);\n\n    updated.status = !failed && criticalPass ? 'verified' : 'needs_fixes';\n    updated.updated_at = new Date().toISOString();\n\n    return updated;\n  } catch (error) {\n    logError('[verifyProof] Failed', { error });\n    return { ...proof, status: 'rejected', updated_at: new Date().toISOString() };\n  }\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAa,cAAiD,KAAQ,QAAgB,EAAE,KAAQ;CAE9F,MAAM,SAAS,KAAK,MAAM,KAAK,UAAU,IAAI,CAAC;AAE9C,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,KAAK,KAAK,WAAW,EAAG;EAG5B,MAAM,aAAa,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,MAAM,UAAU,KAAK,KAAK,GAAG,GAAG;AAEhC,MAAI,YAAY,OAAW;EAE3B,IAAI,SAAqD;EACzD,IAAI,cAAc;AAClB,OAAK,MAAM,OAAO,YAAY;AAC5B,OAAI,WAAW,QAAQ,OAAO,WAAW,UAAU;AACjD,YAAQ,6BAA6B,EAAE,MAAM,KAAK,KAAK,KAAK,IAAI,EAAE,CAAC;AACnE,kBAAc;AACd;;AAEF,OAAI,MAAM,QAAQ,OAAO,EAAE;IACzB,MAAM,QAAQ,OAAO,QAAQ,WAAW,MAAM,OAAO,SAAS,OAAO,IAAI,EAAE,GAAG;AAC9E,QAAI,OAAO,MAAM,MAAM,IAAI,QAAQ,KAAK,SAAS,OAAO,QAAQ;AAC9D,aAAQ,oCAAoC,EAAE,KAAK,CAAC;AACpD,mBAAc;AACd;;AAEF,aAAS,OAAO;SAEhB,UAAS,OAAO;;AAIpB,MAAI,eAAe,WAAW,QAAQ,OAAO,WAAW,UAAU;AAChE,WAAQ,gDAAgD,EAAE,MAAM,WAAW,KAAK,IAAI,EAAE,CAAC;AACvF;;AAGF,UAAQ,KAAK,IAAb;GACE,KAAK;AACH,QAAI,MAAM,QAAQ,OAAO,EAAE;KACzB,MAAM,QACJ,OAAO,YAAY,WAAW,UAAU,OAAO,SAAS,OAAO,QAAQ,EAAE,GAAG;AAC9E,SAAI,CAAC,OAAO,MAAM,MAAM,IAAI,SAAS,KAAK,QAAQ,OAAO,OACvD,QAAO,SAAS,KAAK;UAGvB,QAAO,WAAW,KAAK;AAEzB;GAEF,KAAK;AACH,QAAI,MAAM,QAAQ,OAAO,EAAE;KACzB,MAAM,QACJ,OAAO,YAAY,WAAW,UAAU,OAAO,SAAS,OAAO,QAAQ,EAAE,GAAG;AAC9E,SAAI,CAAC,OAAO,MAAM,MAAM,IAAI,SAAS,KAAK,QAAQ,OAAO,QAAQ;MAC/D,MAAM,gBAAgB,OAAO;AAC7B,UAAI,MAAM,QAAQ,cAAc,CAC9B,eAAc,KAAK,KAAK,MAAM;UAE9B,QAAO,SAAS,KAAK;WAGvB,QAAO,KAAK,KAAK,MAAM;WAEpB;KACL,MAAM,gBAAgB,OAAO;AAC7B,SAAI,MAAM,QAAQ,cAAc,CAC9B,eAAc,KAAK,KAAK,MAAM;SAE9B,QAAO,WAAW,KAAK;;AAG3B;GAEF,KAAK;AACH,QAAI,MAAM,QAAQ,OAAO,EAAE;KACzB,MAAM,QACJ,OAAO,YAAY,WAAW,UAAU,OAAO,SAAS,OAAO,QAAQ,EAAE,GAAG;AAC9E,SAAI,CAAC,OAAO,MAAM,MAAM,IAAI,SAAS,KAAK,QAAQ,OAAO,OACvD,QAAO,OAAO,OAAO,EAAE;UAGzB,QAAO,OAAO;AAEhB;GAEF,QACE,SAAQ,kCAAkC,EACxC,IAAI,QAAQ,OAAO,OAAO,KAAK,GAAG,GAAG,WACtC,CAAC;;;AAIR,QAAO;;;;;;;;;;;;;;;;;;;;AAqBT,MAAa,qBAAqB,UAAoD;CACpF,MAAM,OAAe,EAAE;CACvB,MAAM,SAAiB,EAAE;AAEzB,MAAK,MAAM,QAAQ,MAOjB,KALE,KAAK,OAAO,cACX,OAAO,KAAK,UAAU,YACrB,OAAO,KAAK,UAAU,YACtB,OAAO,KAAK,UAAU,WAGxB,MAAK,KAAK,KAAK;KAEf,QAAO,KAAK,KAAK;AAIrB,QAAO;EAAE;EAAM;EAAQ;;;;;;;;;;;;;;AC9JzB,MAAa,cAAc,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;;AAEnD,MAAa,cAAc,EAAE,KAAK;CAAC;CAAe;CAAY;CAAW,CAAC;;;;;AAM1E,MAAa,aAAa,EAAE,mBAAmB,QAAQ;CACrD,EAAE,OAAO;EACP,GAAG,EAAE,QAAQ;EACb,MAAM,EAAE,QAAQ,UAAU;EAC1B,MAAM,EAAE,QAAQ;EAChB,QAAQ,EAAE,KAAK;GAAC;GAAQ;GAAO;GAAM,CAAC;EACvC,CAAC;CACF,EAAE,OAAO;EACP,GAAG,EAAE,QAAQ;EACb,MAAM,EAAE,QAAQ,QAAQ;EACxB,MAAM,EAAE,QAAQ;EAChB,QAAQ,EAAE,KAAK;GAAC;GAAQ;GAAO;GAAM,CAAC;EACvC,CAAC;CACF,EAAE,OAAO;EACP,GAAG,EAAE,QAAQ;EACb,MAAM,EAAE,QAAQ,YAAY;EAC5B,MAAM,EAAE,QAAQ;EACjB,CAAC;CACF,EAAE,OAAO;EACP,GAAG,EAAE,QAAQ;EACb,MAAM,EAAE,QAAQ,OAAO;EACvB,MAAM,EAAE,QAAQ;EAChB,QAAQ,EAAE,QAAQ;EACnB,CAAC;CACH,CAAC;;;;AAKF,MAAa,cAAc,EAAE,OAAO;CAElC,IAAI,EAAE,QAAQ;CAEd,OAAO,EAAE,MAAM,WAAW;CAC3B,CAAC;;;;AAKF,MAAa,cAAc,EAAE,OAAO;CAElC,IAAI,EAAE,QAAQ;CAEd,MAAM,EAAE,QAAQ;CAEhB,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC;CAC1B,CAAC;;;;AAKF,MAAa,cAAc,EAAE,OAAO;CAElC,QAAQ,EAAE,QAAQ;CAElB,QAAQ;CAER,MAAM,EAAE,QAAQ,CAAC,UAAU;CAC5B,CAAC;;;;AAKF,MAAa,aAAa,EAAE,OAAO;CAEjC,IAAI,EAAE,KAAK;EAAC;EAAW;EAAU;EAAM,CAAC;CAExC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;CAGhD,OAAO,EAAE,SAAS,CAAC,UAAU;CAC9B,CAAC;;;;AAKF,MAAa,qBAAqB,EAAE,OAAO;CAEzC,IAAI,EAAE,QAAQ;CAEd,QAAQ,EAAE,QAAQ;CAElB,QAAQ,EAAE,MAAM,YAAY;CAE5B,iBAAiB,EAAE,MAAM,WAAW,CAAC,UAAU;CAE/C,WAAW,EAAE,QAAQ,CAAC,UAAU;CACjC,CAAC;;;;AAKF,MAAa,iBAAiB,EAAE,OAAO;CAErC,SAAS,EAAE,QAAQ;CAGnB,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,SAAS,CAAC;CAEzC,OAAO,EAAE,OAAO;EAEd,QAAQ,EAAE,QAAQ;EAElB,QAAQ,EAAE,MAAM,YAAY;EAE5B,QAAQ,EAAE,MAAM,YAAY;EAC7B,CAAC;CAEF,eAAe,EAAE,MAAM,mBAAmB;CAE1C,QAAQ;CAER,YAAY,EAAE,QAAQ,CAAC,UAAU;CAEjC,YAAY,EAAE,QAAQ,CAAC,UAAU;CAClC,CAAC;;;;;;;;;;;;;AAiCF,MAAa,oBAAoB,UAC/B,MAAM,cAAc,MAAK,iBACvB,aAAa,OAAO,MAAK,UAAS,MAAM,WAAW,OAAO,CAC3D;;;;;;;;;;;;;AAcH,MAAa,qBAAqB,UAA6B;CAC7D,MAAM,eAAe,IAAI,IAAI;EAAC;EAAY;EAAW;EAAU;EAAS;EAAa,CAAC;AACtF,QAAO,MAAM,MAAM,OAAO,QAAO,UAC/B,MAAM,KAAK,MAAK,QAAO,aAAa,IAAI,IAAI,aAAa,CAAC,CAAC,CAC5D;;;;;;;;;;;;;;;AAgBH,MAAa,sBAAsB,UAA6B;CAC9D,MAAM,WAAW,kBAAkB,MAAM;AACzC,KAAI,SAAS,WAAW,EAAG,QAAO;CAElC,MAAM,cAAc,IAAI,IAAI,SAAS,KAAI,UAAS,MAAM,GAAG,CAAC;CAE5D,MAAM,iBADY,MAAM,cAAc,SAAQ,iBAAgB,aAAa,OAAO,CACjD,QAAO,UACtC,CAAC,GAAG,YAAY,CAAC,MAAK,OAAM,MAAM,OAAO,SAAS,GAAG,CAAC,CACvD;AAED,QAAO,eAAe,SAAS,KAAK,eAAe,OAAM,MAAK,EAAE,WAAW,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrIpF,MAAa,eAAe,OAAO,YAAiD;CAClF,MAAM,EAAE,QAAQ,gBAAgB,GAAG,qBAAqB,MAAM,WAAW,EAAE,KAAK;CAEhF,IAAI,QAAkB;EACpB,SAAS,YAAY;EACrB,QAAQ;GAAE;GAAQ,GAAG;GAAU;EAC/B,OAAO;GAAE,QAAQ;GAAI,QAAQ,EAAE;GAAE,QAAQ,EAAE;GAAE;EAC7C,eAAe,EAAE;EACjB,QAAQ;EACR,6BAAY,IAAI,MAAM,EAAC,aAAa;EACrC;CAED,IAAI,YAAY;AAEhB,QAAO,YAAY,eAAe;AAChC;AAGA,MAAI,cAAc,GAAG;GACnB,MAAM,cAAc,EAAE,OAAO;IAC3B,QAAQ,EAAE,QAAQ;IAClB,QAAQ,EAAE,MAAM,YAAY;IAC5B,QAAQ,EAAE,MAAM,YAAY;IAC7B,CAAC;AAEF,OAAI;IACF,MAAM,cAAc,MAAM,aAAa;KACrC,OAAO,UAAU,6BAA6B;KAC9C,QAAQ;;;;;;;KAOR;KACA,YAAY;KACb,CAAC;IAEF,MAAM,SAAS,KAAK,MAAM,YAAY,KAAK;AAC3C,UAAM,QAAQ,YAAY,MAAM,OAAO;YAChC,OAAO;AACd,aAAS,kCAAkC,EAAE,OAAO,CAAC;AACrD,UAAM,SAAS;AACf,WAAO;;;EAKX,MAAM,eAAe,EAAE,OAAO;GAC5B,QAAQ,EAAE,MACR,EAAE,OAAO;IACP,QAAQ,EAAE,QAAQ;IAClB,QAAQ,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;IAChC,MAAM,EAAE,QAAQ,CAAC,UAAU;IAC5B,CAAC,CACH;GACD,iBAAiB,EACd,MACC,EAAE,OAAO;IACP,IAAI,EAAE,KAAK;KAAC;KAAW;KAAU;KAAM,CAAC;IACxC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEhD,OAAO,EAAE,SAAS,CAAC,UAAU;IAC9B,CAAC,CACH,CACA,UAAU;GACd,CAAC;AAEF,MAAI;GACF,MAAM,eAAe,MAAM,aAAa;IACtC,OAAO,OAAO,cAAc;IAC5B,QAAQ;;;;;;;;;;IAUR,QAAQ,KAAK,UAAU,OAAO,MAAM,EAAE;IACtC,YAAY;IACb,CAAC;GAEF,MAAM,SAAS,KAAK,MAAM,aAAa,KAAK;GAC5C,MAAM,aAAa,aAAa,MAAM,OAAO;AAE7C,SAAM,cAAc,KAAK;IACvB,IAAI;IACJ,QAAQ;IACR,QAAQ,WAAW;IACnB,iBAAiB,WAAW;IAC5B,4BAAW,IAAI,MAAM,EAAC,aAAa;IACpC,CAAC;WACK,OAAO;AACd,YAAS,mCAAmC,EAAE,OAAO,CAAC;AACtD,SAAM,SAAS;AACf,UAAO;;EAIT,MAAM,SAAS,iBAAiB,MAAM;EACtC,MAAM,eAAe,mBAAmB,MAAM;AAE9C,MAAI,CAAC,UAAU,cAAc;AAC3B,SAAM,SAAS;AACf,SAAM,8BAAa,IAAI,MAAM,EAAC,aAAa;AAC3C,UAAO;;AAIT,MAAI,sBAAsB,YAAY,eAAe;GAEnD,MAAM,QADmB,MAAM,cAAc,MAAM,cAAc,SAAS,IAC1C,mBAAmB,EAAE;AAErD,OAAI,MAAM,SAAS,GAAG;IACpB,MAAM,EAAE,SAAS,kBAAkB,MAAM;AACzC,QAAI,KAAK,SAAS,GAAG;AACnB,aAAQ,WAAW,OAAO,KAAK;AAC/B,aAAQ,kCAAkC,EAAE,OAAO,KAAK,QAAQ,CAAC;AACjE;;;;AAMN;;AAGF,OAAM,SAAS;AACf,OAAM,8BAAa,IAAI,MAAM,EAAC,aAAa;AAC3C,QAAO;;;;;;;;;;;;;;;;;AAkBT,MAAa,cAAc,OAAO,UAAuC;CACvE,MAAM,eAAe,EAAE,OAAO,EAC5B,QAAQ,EAAE,MACR,EAAE,OAAO;EACP,QAAQ,EAAE,QAAQ;EAClB,QAAQ,EAAE,KAAK,CAAC,QAAQ,OAAO,CAAC;EAChC,MAAM,EAAE,QAAQ,CAAC,UAAU;EAC5B,CAAC,CACH,EACF,CAAC;AAEF,KAAI;EACF,MAAM,eAAe,MAAM,aAAa;GACtC,OAAO,OAAO,cAAc;GAC5B,QAAQ;GACR,QAAQ,KAAK,UAAU,OAAO,MAAM,EAAE;GACtC,YAAY;GACb,CAAC;EAEF,MAAM,SAAS,KAAK,MAAM,aAAa,KAAK;EAC5C,MAAM,aAAa,aAAa,MAAM,OAAO;EAE7C,MAAM,UAAU,EAAE,GAAG,OAAO;AAC5B,UAAQ,cAAc,KAAK;GACzB,IAAI;GACJ,QAAQ;GACR,QAAQ,WAAW;GACnB,4BAAW,IAAI,MAAM,EAAC,aAAa;GACpC,CAAC;EAEF,MAAM,SAAS,iBAAiB,QAAQ;EACxC,MAAM,eAAe,mBAAmB,QAAQ;AAEhD,UAAQ,SAAS,CAAC,UAAU,eAAe,aAAa;AACxD,UAAQ,8BAAa,IAAI,MAAM,EAAC,aAAa;AAE7C,SAAO;UACA,OAAO;AACd,WAAS,wBAAwB,EAAE,OAAO,CAAC;AAC3C,SAAO;GAAE,GAAG;GAAO,QAAQ;GAAY,6BAAY,IAAI,MAAM,EAAC,aAAa;GAAE"}