npm - @continuonai/rcan-ts - Versions diffs - 1.2.3 → 1.3.0 - Mend

@continuonai/rcan-ts 1.2.3 → 1.3.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (12) hide show

package/dist/browser.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/address.ts","../src/version.ts","../src/message.ts","../src/crypto.ts","../src/gates.ts","../src/audit.ts","../src/validate.ts","../src/errors.ts","../src/registry.ts","../src/node.ts","../src/schema.ts","../src/qos.ts","../src/safety.ts","../src/replay.ts","../src/clock.ts","../src/configUpdate.ts","../src/keys.ts","../src/consent.ts","../src/revocation.ts","../src/trainingConsent.ts","../src/offline.ts","../src/faultReport.ts","../src/identity.ts","../src/federation.ts","../src/transport.ts","../src/multimodal.ts","../src/contribute.ts","../src/competition.ts","../src/firmware.ts","../src/authority.ts","../src/m2m.ts","../src/pqSigning.ts","../src/mcp.ts","../src/delegation.ts","../src/index.ts"],"sourcesContent":["/*\n RCAN Robot URI — addressing scheme for RCAN v1.2.\n \n Format: rcan://<registry>/<manufacturer>/<model>/<version>/<device-id>\n * Example: rcan://registry.rcan.dev/acme/robotarm/v2/unit-001\n /\n\nexport class RobotURIError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"RobotURIError\";\n }\n}\n\nexport interface RobotURIOptions {\n manufacturer: string;\n model: string;\n version: string;\n deviceId: string;\n registry?: string;\n}\n\nexport class RobotURI {\n readonly registry: string;\n readonly manufacturer: string;\n readonly model: string;\n readonly version: string;\n readonly deviceId: string;\n\n private constructor(opts: Required<RobotURIOptions>) {\n this.registry = opts.registry;\n this.manufacturer = opts.manufacturer;\n this.model = opts.model;\n this.version = opts.version;\n this.deviceId = opts.deviceId;\n }\n\n /* Parse a RCAN URI string. Throws RobotURIError on invalid input. /\n static parse(uri: string): RobotURI {\n if (!uri.startsWith(\"rcan://\")) {\n throw new RobotURIError(`URI must start with 'rcan://' — got: ${uri}`);\n }\n const withoutScheme = uri.slice(\"rcan://\".length);\n const parts = withoutScheme.split(\"/\");\n if (parts.length !== 5) {\n throw new RobotURIError(\n `URI must have exactly 5 path segments (registry/manufacturer/model/version/device-id) — got ${parts.length} in: ${uri}`\n );\n }\n const [registry, manufacturer, model, version, deviceId] = parts;\n for (const [name, value] of [\n [\"registry\", registry],\n [\"manufacturer\", manufacturer],\n [\"model\", model],\n [\"version\", version],\n [\"device-id\", deviceId],\n ] as [string, string][]) {\n if (!value \|\| value.trim() === \"\") {\n throw new RobotURIError(`URI segment '${name}' must not be empty`);\n }\n }\n return new RobotURI({ registry, manufacturer, model, version, deviceId });\n }\n\n /* Build a RCAN URI from components. /\n static build(opts: RobotURIOptions): RobotURI {\n const registry = opts.registry ?? \"registry.rcan.dev\";\n const { manufacturer, model, version, deviceId } = opts;\n for (const [name, value] of [\n [\"manufacturer\", manufacturer],\n [\"model\", model],\n [\"version\", version],\n [\"deviceId\", deviceId],\n ] as [string, string][]) {\n if (!value \|\| value.trim() === \"\") {\n throw new RobotURIError(`'${name}' must not be empty`);\n }\n }\n return new RobotURI({ registry, manufacturer, model, version, deviceId });\n }\n\n /* Full URI string: rcan://registry/manufacturer/model/version/device-id /\n toString(): string {\n return `rcan://${this.registry}/${this.manufacturer}/${this.model}/${this.version}/${this.deviceId}`;\n }\n\n /* Short namespace: manufacturer/model /\n get namespace(): string {\n return `${this.manufacturer}/${this.model}`;\n }\n\n /* HTTPS registry URL for this robot /\n get registryUrl(): string {\n return `https://${this.registry}/registry/${this.manufacturer}/${this.model}/${this.version}/${this.deviceId}`;\n }\n\n /* Check if two URIs refer to the same robot /\n equals(other: RobotURI): boolean {\n return this.toString() === other.toString();\n }\n\n toJSON(): object {\n return {\n uri: this.toString(),\n registry: this.registry,\n manufacturer: this.manufacturer,\n model: this.model,\n version: this.version,\n deviceId: this.deviceId,\n };\n }\n}\n","/\n RCAN Protocol Version — single source of truth.\n \n All modules that need SPEC_VERSION import from here.\n * §3.5 — Protocol Version Compatibility\n /\n\n/* The RCAN spec version this SDK implements. /\nexport const SPEC_VERSION = \"2.2.1\";\n\n/* The SDK release version. /\nexport const SDK_VERSION = \"1.2.2\";\n\n/\n Validate version compatibility.\n \n MAJOR must match. Lower-or-equal MINOR is acceptable.\n \n @param incomingVersion - The rcanVersion from the incoming message\n * @param localVersion - The local SPEC_VERSION (defaults to SPEC_VERSION)\n * @returns true if compatible, false if MAJOR mismatch\n /\nexport function validateVersionCompat(\n incomingVersion: string,\n localVersion: string = SPEC_VERSION\n): boolean {\n const parseParts = (v: string): [number, number] => {\n const parts = v.split(\".\");\n const major = parseInt(parts[0] ?? \"0\", 10);\n const minor = parseInt(parts[1] ?? \"0\", 10);\n return [isNaN(major) ? 0 : major, isNaN(minor) ? 0 : minor];\n };\n\n const [inMajor] = parseParts(incomingVersion);\n const [localMajor] = parseParts(localVersion);\n\n // MAJOR must match\n return inMajor === localMajor;\n}\n","/\n RCAN Message — command envelope for RCAN v1.5.\n \n A RCANMessage wraps a robot command with:\n * - RCAN protocol version\n * - Target Robot URI\n * - Command name and parameters\n * - Optional AI confidence score (§16)\n * - Optional model identity (§16)\n * - Optional Ed25519 signature\n * - v1.5: rcanVersion, senderType, cloudProvider, keyId, delegation chain, QoS, etc.\n /\n\nimport { RobotURI } from \"./address.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\n// ── v1.5 Canonical MessageType table ─────────────────────────────────────────\n// These integers MUST match rcan-py.\n\n// ═══════════════════════════════════════════════════════════════════\n// v1.10 Canonical MessageType Table\n// This is the SINGLE SOURCE OF TRUTH. Values MUST match rcan-spec §3\n// and rcan-py exactly. See: https://rcan.dev/spec/v1.8\n// ═══════════════════════════════════════════════════════════════════\nexport enum MessageType {\n // Core protocol (1–8)\n COMMAND = 1,\n RESPONSE = 2,\n STATUS = 3,\n HEARTBEAT = 4,\n CONFIG = 5,\n SAFETY = 6,\n AUTH = 7,\n ERROR = 8,\n\n // Discovery & authorization (9–10)\n DISCOVER = 9,\n PENDING_AUTH = 10,\n\n // Skill invocation (11–13)\n INVOKE = 11,\n INVOKE_RESULT = 12,\n INVOKE_CANCEL = 13,\n\n // Registry (14–15)\n REGISTRY_REGISTER = 14,\n REGISTRY_RESOLVE = 15,\n\n // Audit & transparency (16)\n TRANSPARENCY = 16, // EU AI Act Art. 13 audit record\n\n // Acknowledgement & QoS (17–18)\n COMMAND_ACK = 17,\n COMMAND_NACK = 18,\n\n // Identity & consent (19–22)\n ROBOT_REVOCATION = 19,\n CONSENT_REQUEST = 20,\n CONSENT_GRANT = 21,\n CONSENT_DENY = 22,\n\n // Fleet & telemetry (23–25)\n FLEET_COMMAND = 23,\n SUBSCRIBE = 24,\n UNSUBSCRIBE = 25,\n\n // Diagnostics (26–28)\n FAULT_REPORT = 26,\n KEY_ROTATION = 27,\n COMMAND_COMMIT = 28,\n\n // Sensor & training consent (29–32)\n SENSOR_DATA = 29,\n TRAINING_CONSENT_REQUEST = 30,\n TRAINING_CONSENT_GRANT = 31,\n TRAINING_CONSENT_DENY = 32,\n\n // Idle compute contribution — v1.7 (33–35)\n CONTRIBUTE_REQUEST = 33,\n CONTRIBUTE_RESULT = 34,\n CONTRIBUTE_CANCEL = 35,\n\n // Multimodal training data — v1.8 (36)\n TRAINING_DATA = 36,\n\n // ── Competition protocol — v1.10 (37–40) ─────────────────────────────────\n COMPETITION_ENTER = 37,\n COMPETITION_SCORE = 38,\n SEASON_STANDING = 39,\n PERSONAL_RESEARCH_RESULT = 40,\n\n // ── Authority & attestation — v2.1 (41–44) ──────────────────\n /* authority → robot: EU AI Act Art. 16(j) audit data request /\n AUTHORITY_ACCESS = 41,\n /* robot → authority: audit data response /\n AUTHORITY_RESPONSE = 42,\n /* robot → RRF: publish signed firmware manifest /\n FIRMWARE_ATTESTATION = 43,\n /* robot → RRF: publish updated CycloneDX SBOM /\n SBOM_UPDATE = 44,\n // FEDERATION_SYNC, ALERT, AUDIT aliases removed in v2.1\n}\n\n// ── v1.5 SenderType ───────────────────────────────────────────────────────────\n/* §8.5 — Sender Type and Service Identity /\nexport type SenderType = \"robot\" \| \"human\" \| \"cloud_function\" \| \"system\";\n\n// ── v1.5 DelegationHop ────────────────────────────────────────────────────────\n/* §12 — Command Delegation and Chain of Custody /\nexport interface DelegationHop {\n issuerRuri: string;\n humanSubject: string;\n timestamp: string;\n scope: string;\n signature: string;\n}\n\n/* RCAN v2.2: ML-DSA-65 is the only valid alg (\"ml-dsa-65\"). Ed25519 is deprecated. /\nexport interface SignatureBlock {\n alg: \"ml-dsa-65\";\n kid: string;\n sig: string;\n}\n\n/* v2.2: Post-quantum (ML-DSA-65) signature block /\nexport interface PQSignatureBlock {\n alg: \"ml-dsa-65\";\n kid: string;\n sig: string;\n}\n\nexport interface RCANMessageData {\n rcan?: string;\n /* v1.5: explicit protocol version field (defaults to SPEC_VERSION) /\n rcanVersion?: string;\n cmd: string;\n target: string \| RobotURI;\n params?: Record<string, unknown>;\n confidence?: number;\n modelIdentity?: string;\n model_identity?: string; // snake_case alias\n signature?: SignatureBlock;\n timestamp?: string;\n /* v1.5: GAP-08 sender identity /\n senderType?: SenderType;\n cloudProvider?: string;\n /* v1.5: GAP-09 key id /\n keyId?: string;\n /* v1.5: GAP-01 delegation chain /\n delegationChain?: DelegationHop[];\n /* v1.5: GAP-13 fleet group /\n groupId?: string;\n /* v1.5: GAP-11 QoS level /\n qos?: number;\n /* v1.5: GAP-19 physical presence /\n presenceVerified?: boolean;\n proximityMeters?: number;\n /* v1.5: GAP-15 observer /\n readOnly?: boolean;\n /* v1.6: GAP-14 level of assurance /\n loa?: number;\n /* v1.6: GAP-17 transport encoding hint /\n transportEncoding?: string;\n /* v1.6: GAP-18 multi-modal media chunks /\n // typed as unknown[] to avoid circular dependency with multimodal.ts\n mediaChunks?: Array<Record<string, unknown>>;\n /* v2.1: SHA-256 of sender's firmware manifest (envelope field 13). Required at L2+. /\n firmwareHash?: string;\n /* v2.1: URI to sender's SBOM attestation endpoint (envelope field 14). Required at L2+. /\n attestationRef?: string;\n /* v2.2: ML-DSA-65 post-quantum signature block (field 16, FIPS 204). Hybrid mode alongside Ed25519. /\n pqSig?: PQSignatureBlock \| undefined;\n /* v2.2 snake_case envelope aliases (spec §3.2) /\n firmware_hash?: string;\n attestation_ref?: string;\n pq_sig?: string;\n pq_alg?: string;\n [key: string]: unknown;\n}\n\nexport class RCANMessageError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"RCANMessageError\";\n }\n}\n\nexport class RCANMessage {\n readonly rcan: string;\n /* v1.5: rcanVersion field — defaults to SPEC_VERSION /\n readonly rcanVersion: string;\n readonly cmd: string;\n readonly target: string;\n readonly params: Record<string, unknown>;\n readonly confidence: number \| undefined;\n readonly modelIdentity: string \| undefined;\n readonly signature: SignatureBlock \| undefined;\n readonly timestamp: string;\n /* v1.5 fields /\n readonly senderType: SenderType \| undefined;\n readonly cloudProvider: string \| undefined;\n readonly keyId: string \| undefined;\n readonly delegationChain: DelegationHop[] \| undefined;\n readonly groupId: string \| undefined;\n readonly qos: number \| undefined;\n readonly presenceVerified: boolean \| undefined;\n readonly proximityMeters: number \| undefined;\n readonly readOnly: boolean \| undefined;\n /* v1.6: GAP-14 level of assurance /\n readonly loa: number \| undefined;\n /* v1.6: GAP-17 transport encoding hint /\n readonly transportEncoding: string \| undefined;\n /* v1.6: GAP-18 multi-modal media chunks /\n readonly mediaChunks: Array<Record<string, unknown>> \| undefined;\n /* v2.1: SHA-256 of sender's firmware manifest /\n readonly firmwareHash: string \| undefined;\n /* v2.1: URI to sender's SBOM attestation endpoint /\n readonly attestationRef: string \| undefined;\n /* v2.2: ML-DSA-65 post-quantum signature (field 16, FIPS 204). Hybrid alongside Ed25519. /\n readonly pqSig: PQSignatureBlock \| undefined;\n\n constructor(data: RCANMessageData) {\n if (!data.cmd \|\| data.cmd.trim() === \"\") {\n throw new RCANMessageError(\"'cmd' is required\");\n }\n if (!data.target) {\n throw new RCANMessageError(\"'target' is required\");\n }\n\n this.rcan = data.rcan ?? SPEC_VERSION;\n this.rcanVersion = data.rcanVersion ?? SPEC_VERSION;\n this.cmd = data.cmd;\n this.target =\n data.target instanceof RobotURI ? data.target.toString() : String(data.target);\n this.params = data.params ?? {};\n this.confidence = data.confidence;\n this.modelIdentity = data.modelIdentity ?? data.model_identity;\n this.signature = data.signature;\n this.timestamp = data.timestamp ?? new Date().toISOString();\n this.senderType = data.senderType;\n this.cloudProvider = data.cloudProvider;\n this.keyId = data.keyId;\n this.delegationChain = data.delegationChain;\n this.groupId = data.groupId;\n this.qos = data.qos;\n this.presenceVerified = data.presenceVerified;\n this.proximityMeters = data.proximityMeters;\n this.readOnly = data.readOnly;\n this.loa = data.loa;\n this.transportEncoding = data.transportEncoding;\n this.mediaChunks = data.mediaChunks;\n this.firmwareHash = data.firmwareHash;\n this.attestationRef = data.attestationRef;\n this.pqSig = data.pqSig as PQSignatureBlock \| undefined;\n\n // v2.1: hard-reject signature blocks with sig:'pending' (removed legacy pattern)\n if (\n this.signature !== undefined &&\n (this.signature as unknown as Record<string, unknown>)['sig'] === 'pending'\n ) {\n throw new RCANMessageError(\n \"signature.sig:'pending' is not valid in RCAN v2.1. Sign the message before sending.\"\n );\n }\n\n if (this.confidence !== undefined) {\n if (this.confidence < 0 \|\| this.confidence > 1) {\n throw new RCANMessageError(\n `confidence must be in [0.0, 1.0] — got ${this.confidence}`\n );\n }\n }\n }\n\n /* Whether this message has a signature block /\n get isSigned(): boolean {\n return this.signature !== undefined && this.signature.sig !== \"\";\n }\n\n /* Whether this message was generated by an AI model (has confidence score) /\n get isAiDriven(): boolean {\n return this.confidence !== undefined;\n }\n\n /* Serialize to a plain object /\n toJSON(): Record<string, unknown> {\n const obj: Record<string, unknown> = {\n rcan: this.rcan,\n rcanVersion: this.rcanVersion,\n cmd: this.cmd,\n target: this.target,\n timestamp: this.timestamp,\n };\n if (Object.keys(this.params).length > 0) obj.params = this.params;\n if (this.confidence !== undefined) obj.confidence = this.confidence;\n if (this.modelIdentity) obj.model_identity = this.modelIdentity;\n if (this.signature) obj.signature = this.signature;\n if (this.senderType !== undefined) obj.senderType = this.senderType;\n if (this.cloudProvider !== undefined) obj.cloudProvider = this.cloudProvider;\n if (this.keyId !== undefined) obj.keyId = this.keyId;\n if (this.delegationChain !== undefined) obj.delegationChain = this.delegationChain;\n if (this.groupId !== undefined) obj.groupId = this.groupId;\n if (this.qos !== undefined) obj.qos = this.qos;\n if (this.presenceVerified !== undefined) obj.presenceVerified = this.presenceVerified;\n if (this.proximityMeters !== undefined) obj.proximityMeters = this.proximityMeters;\n if (this.readOnly !== undefined) obj.readOnly = this.readOnly;\n if (this.loa !== undefined) obj.loa = this.loa;\n if (this.transportEncoding !== undefined) obj.transportEncoding = this.transportEncoding;\n if (this.mediaChunks !== undefined) obj.mediaChunks = this.mediaChunks;\n if (this.firmwareHash !== undefined) obj.firmwareHash = this.firmwareHash;\n if (this.attestationRef !== undefined) obj.attestationRef = this.attestationRef;\n return obj;\n }\n\n /* Serialize to JSON string /\n toJSONString(indent?: number): string {\n return JSON.stringify(this.toJSON(), null, indent);\n }\n\n /* Parse from a plain object or JSON string /\n static fromJSON(data: string \| Record<string, unknown>): RCANMessage {\n let obj: Record<string, unknown>;\n if (typeof data === \"string\") {\n try {\n obj = JSON.parse(data) as Record<string, unknown>;\n } catch {\n throw new RCANMessageError(\"Invalid JSON string\");\n }\n } else {\n obj = data;\n }\n\n if (!obj.cmd) throw new RCANMessageError(\"Missing required field: 'cmd'\");\n if (!obj.target) throw new RCANMessageError(\"Missing required field: 'target'\");\n if (!obj.rcan) throw new RCANMessageError(\"Missing required field: 'rcan'\");\n\n return new RCANMessage({\n rcan: obj.rcan as string,\n rcanVersion: (obj.rcanVersion as string \| undefined),\n cmd: obj.cmd as string,\n target: obj.target as string,\n params: (obj.params as Record<string, unknown>) ?? {},\n confidence: obj.confidence as number \| undefined,\n modelIdentity:\n (obj.model_identity as string \| undefined) ??\n (obj.modelIdentity as string \| undefined),\n signature: obj.signature as SignatureBlock \| undefined,\n timestamp: obj.timestamp as string \| undefined,\n senderType: obj.senderType as SenderType \| undefined,\n cloudProvider: obj.cloudProvider as string \| undefined,\n keyId: obj.keyId as string \| undefined,\n delegationChain: obj.delegationChain as DelegationHop[] \| undefined,\n groupId: obj.groupId as string \| undefined,\n qos: obj.qos as number \| undefined,\n presenceVerified: obj.presenceVerified as boolean \| undefined,\n proximityMeters: obj.proximityMeters as number \| undefined,\n readOnly: obj.readOnly as boolean \| undefined,\n loa: obj.loa as number \| undefined,\n transportEncoding: obj.transportEncoding as string \| undefined,\n mediaChunks: obj.mediaChunks as Array<Record<string, unknown>> \| undefined,\n firmwareHash: obj.firmwareHash as string \| undefined,\n attestationRef: obj.attestationRef as string \| undefined,\n pqSig: obj.pqSig as PQSignatureBlock \| undefined,\n });\n }\n}\n\n// ── v1.5 Cloud Relay helper ───────────────────────────────────────────────────\n\n/\n §8.5 — Create a cloud-relay-stamped copy of a message.\n \n Sets senderType to \"cloud_function\" and records the cloud provider.\n /\nexport function makeCloudRelayMessage(\n base: RCANMessage,\n provider: string\n): RCANMessage {\n const data = base.toJSON() as RCANMessageData;\n data.senderType = \"cloud_function\";\n data.cloudProvider = provider;\n return new RCANMessage(data);\n}\n\n// ── v1.5 Delegation Chain helpers ────────────────────────────────────────────\n\n/\n §12 — Add a delegation hop to a message.\n /\nexport function addDelegationHop(\n msg: RCANMessage,\n hop: DelegationHop\n): RCANMessage {\n const chain = msg.delegationChain ? [...msg.delegationChain, hop] : [hop];\n const data = msg.toJSON() as RCANMessageData;\n data.delegationChain = chain;\n return new RCANMessage(data);\n}\n\n/\n §12 — Validate a delegation chain (structure only; signature verification\n * requires crypto module).\n \n Rules:\n * - Max depth 4 hops\n * - Each hop must have issuerRuri, humanSubject, timestamp, scope, signature\n /\nexport function validateDelegationChain(\n chain: DelegationHop[]\n): { valid: boolean; reason: string } {\n if (chain.length > 4) {\n return { valid: false, reason: \"DELEGATION_CHAIN_EXCEEDED: max depth is 4 hops\" };\n }\n for (let i = 0; i < chain.length; i++) {\n const hop = chain[i];\n if (!hop) return { valid: false, reason: `hop ${i} is undefined` };\n if (!hop.issuerRuri) return { valid: false, reason: `hop ${i}: missing issuerRuri` };\n if (!hop.humanSubject) return { valid: false, reason: `hop ${i}: missing humanSubject` };\n if (!hop.timestamp) return { valid: false, reason: `hop ${i}: missing timestamp` };\n if (!hop.scope) return { valid: false, reason: `hop ${i}: missing scope` };\n if (!hop.signature) return { valid: false, reason: `hop ${i}: missing signature` };\n }\n return { valid: true, reason: \"ok\" };\n}\n","/\n Cross-platform crypto utilities — Node.js, browser, Cloudflare Workers, Deno.\n \n Uses Web Crypto API (SubtleCrypto) as the primary implementation, with a\n * Node.js `crypto` module fallback for environments that predate the global\n * `crypto` object (Node < 19).\n /\n\n/* Generate a UUID v4. Works in all modern environments. /\nexport function generateUUID(): string {\n if (typeof globalThis.crypto !== \"undefined\" && typeof globalThis.crypto.randomUUID === \"function\") {\n return globalThis.crypto.randomUUID();\n }\n // Node.js < 19 fallback\n try {\n // eslint-disable-next-line @typescript-eslint/no-var-requires\n const { randomUUID } = require(\"crypto\") as { randomUUID: () => string };\n return randomUUID();\n } catch {\n // Last-resort UUID fallback (no external deps)\n return \"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx\".replace(/[xy]/g, (c) => {\n const r = (Math.random() 16) \| 0;\n const v = c === \"x\" ? r : (r & 0x3) \| 0x8;\n return v.toString(16);\n });\n }\n}\n\n/*\n Compute HMAC-SHA256 and return hex string.\n * Synchronous via Node.js `crypto`; falls back to a pure-JS impl in browsers.\n /\nexport function hmacSha256Sync(secret: string, data: string): string {\n // Node.js environment\n if (typeof process !== \"undefined\" && process.versions?.node) {\n try {\n // eslint-disable-next-line @typescript-eslint/no-var-requires\n const { createHmac } = require(\"crypto\") as {\n createHmac: (alg: string, key: string) => { update: (d: string) => { digest: (enc: string) => string } };\n };\n return createHmac(\"sha256\", secret).update(data).digest(\"hex\");\n } catch {\n // fall through to pure-JS\n }\n }\n // Pure-JS HMAC-SHA256 (browser / Workers / Deno without native crypto)\n return pureHmacSha256(secret, data);\n}\n\n// ── Pure-JS SHA-256 + HMAC (no deps) ─────────────────────────────────────────\n// Based on the public-domain SHA-256 implementation.\n\nfunction sha256(msg: Uint8Array): Uint8Array {\n const K = [\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n ];\n let h0 = 0x6a09e667, h1 = 0xbb67ae85, h2 = 0x3c6ef372, h3 = 0xa54ff53a;\n let h4 = 0x510e527f, h5 = 0x9b05688c, h6 = 0x1f83d9ab, h7 = 0x5be0cd19;\n\n const msgLen = msg.length;\n const bitLen = msgLen 8;\n const padded: number[] = [...msg];\n padded.push(0x80);\n while ((padded.length % 64) !== 56) padded.push(0);\n for (let i = 7; i >= 0; i--) padded.push((bitLen / Math.pow(2, i * 8)) & 0xff);\n\n for (let i = 0; i < padded.length; i += 64) {\n const w: number[] = [];\n for (let j = 0; j < 16; j++) {\n w[j] = (padded[i+j4]<<24)\|(padded[i+j4+1]<<16)\|(padded[i+j4+2]<<8)\|padded[i+j4+3];\n }\n for (let j = 16; j < 64; j++) {\n const s0 = ror(w[j-15],7)^ror(w[j-15],18)^(w[j-15]>>>3);\n const s1 = ror(w[j-2],17)^ror(w[j-2],19)^(w[j-2]>>>10);\n w[j] = (w[j-16]+s0+w[j-7]+s1) >>> 0;\n }\n let [a,b,c,d,e,f,g,h] = [h0,h1,h2,h3,h4,h5,h6,h7];\n for (let j = 0; j < 64; j++) {\n const S1 = ror(e,6)^ror(e,11)^ror(e,25);\n const ch = (e&f)^(~e&g);\n const temp1 = (h+S1+ch+K[j]+w[j])>>>0;\n const S0 = ror(a,2)^ror(a,13)^ror(a,22);\n const maj = (a&b)^(a&c)^(b&c);\n const temp2 = (S0+maj)>>>0;\n [h,g,f,e,d,c,b,a] = [g,f,e,(d+temp1)>>>0,c,b,a,(temp1+temp2)>>>0];\n }\n h0=(h0+a)>>>0; h1=(h1+b)>>>0; h2=(h2+c)>>>0; h3=(h3+d)>>>0;\n h4=(h4+e)>>>0; h5=(h5+f)>>>0; h6=(h6+g)>>>0; h7=(h7+h)>>>0;\n }\n const out = new Uint8Array(32);\n const view = new DataView(out.buffer);\n [h0,h1,h2,h3,h4,h5,h6,h7].forEach((v,i) => view.setUint32(i4, v));\n return out;\n}\n\nfunction ror(x: number, n: number): number { return (x>>>n)\|(x<<(32-n)); }\n\nfunction toBytes(s: string): Uint8Array {\n if (typeof TextEncoder !== \"undefined\") return new TextEncoder().encode(s);\n const out = new Uint8Array(s.length);\n for (let i = 0; i < s.length; i++) out[i] = s.charCodeAt(i) & 0xff;\n return out;\n}\n\nfunction toHex(bytes: Uint8Array): string {\n return Array.from(bytes).map(b => b.toString(16).padStart(2,\"0\")).join(\"\");\n}\n\nfunction pureHmacSha256(key: string, data: string): string {\n const BLOCK = 64;\n let keyBytes = toBytes(key);\n if (keyBytes.length > BLOCK) keyBytes = sha256(keyBytes);\n const ipad = new Uint8Array(BLOCK), opad = new Uint8Array(BLOCK);\n for (let i = 0; i < BLOCK; i++) {\n ipad[i] = (keyBytes[i] ?? 0) ^ 0x36;\n opad[i] = (keyBytes[i] ?? 0) ^ 0x5c;\n }\n const dataBytes = toBytes(data);\n const inner = new Uint8Array(BLOCK + dataBytes.length);\n inner.set(ipad); inner.set(dataBytes, BLOCK);\n const innerHash = sha256(inner);\n const outer = new Uint8Array(BLOCK + 32);\n outer.set(opad); outer.set(innerHash, BLOCK);\n return toHex(sha256(outer));\n}\n","/\n RCAN Safety Gates — confidence and human-in-the-loop gating (§16).\n /\n\nimport { generateUUID } from \"./crypto.js\";\n\nexport class GateError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"GateError\";\n }\n}\n\n// ---------------------------------------------------------------------------\n// ConfidenceGate\n// ---------------------------------------------------------------------------\n\nexport class ConfidenceGate {\n readonly threshold: number;\n\n constructor(threshold = 0.8) {\n if (threshold < 0 \|\| threshold > 1) {\n throw new GateError(`threshold must be in [0.0, 1.0] — got ${threshold}`);\n }\n this.threshold = threshold;\n }\n\n /* Returns true if the confidence score meets the threshold. /\n allows(confidence: number): boolean {\n return confidence >= this.threshold;\n }\n\n /* Returns the margin (positive = allowed, negative = blocked). /\n margin(confidence: number): number {\n return confidence - this.threshold;\n }\n\n /* Throw if confidence is below threshold. /\n assert(confidence: number, action?: string): void {\n if (!this.allows(confidence)) {\n const label = action ? ` for action '${action}'` : \"\";\n throw new GateError(\n `Confidence ${confidence}${label} is below threshold ${this.threshold}`\n );\n }\n }\n}\n\n// ---------------------------------------------------------------------------\n// HiTLGate\n// ---------------------------------------------------------------------------\n\nexport type ApprovalStatus = \"approved\" \| \"denied\" \| \"pending\";\n\nexport interface PendingApproval {\n token: string;\n action: string;\n context: Record<string, unknown>;\n createdAt: string;\n status: ApprovalStatus;\n reason?: string;\n}\n\nexport class HiTLGate {\n private _pending: Map<string, PendingApproval> = new Map();\n\n /\n Request human approval for an action.\n * Returns an approval token to poll or pass to approve/deny.\n /\n request(action: string, context: Record<string, unknown> = {}): string {\n const token = generateUUID();\n this._pending.set(token, {\n token,\n action,\n context,\n createdAt: new Date().toISOString(),\n status: \"pending\",\n });\n return token;\n }\n\n /* Approve a pending request. /\n approve(token: string): void {\n const approval = this._pending.get(token);\n if (!approval) throw new GateError(`Unknown token: ${token}`);\n approval.status = \"approved\";\n }\n\n /* Deny a pending request with an optional reason. /\n deny(token: string, reason?: string): void {\n const approval = this._pending.get(token);\n if (!approval) throw new GateError(`Unknown token: ${token}`);\n approval.status = \"denied\";\n if (reason) approval.reason = reason;\n }\n\n /* Check the status of a pending approval. /\n check(token: string): ApprovalStatus {\n const approval = this._pending.get(token);\n if (!approval) throw new GateError(`Unknown token: ${token}`);\n return approval.status;\n }\n\n /* Get all pending approvals. /\n get pendingApprovals(): PendingApproval[] {\n return Array.from(this._pending.values()).filter((a) => a.status === \"pending\");\n }\n\n /* Get the full approval record. /\n getApproval(token: string): PendingApproval \| undefined {\n return this._pending.get(token);\n }\n\n /* Clear resolved (approved/denied) approvals. /\n clearResolved(): void {\n for (const [token, approval] of this._pending.entries()) {\n if (approval.status !== \"pending\") {\n this._pending.delete(token);\n }\n }\n }\n}\n","/\n RCAN Audit Chain — tamper-evident commitment records (§16).\n \n Each CommitmentRecord is sealed with an HMAC-SHA256 over its content.\n * Records are chained via previousHash, creating a forensic audit trail.\n /\n\nimport { hmacSha256Sync, generateUUID } from \"./crypto.js\";\n\nexport interface CommitmentRecordData {\n action: string;\n robotUri?: string;\n confidence?: number;\n modelIdentity?: string;\n params?: Record<string, unknown>;\n safetyApproved?: boolean;\n}\n\nexport interface CommitmentRecordJSON {\n recordId: string;\n action: string;\n robotUri: string;\n confidence?: number;\n modelIdentity?: string;\n params: Record<string, unknown>;\n safetyApproved: boolean;\n timestamp: string;\n contentHash: string;\n previousHash: string \| null;\n hmac: string;\n}\n\nexport class AuditError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"AuditError\";\n }\n}\n\nfunction computeContentHash(\n recordId: string,\n action: string,\n robotUri: string,\n timestamp: string,\n params: Record<string, unknown>\n): string {\n const payload = JSON.stringify(\n { recordId, action, robotUri, timestamp, params },\n Object.keys({ recordId, action, robotUri, timestamp, params }).sort()\n );\n return hmacSha256Sync(\"rcan-content-hash\", payload);\n}\n\nfunction computeHmac(secret: string, data: CommitmentRecordJSON): string {\n const { hmac: _ignored, ...rest } = data;\n const payload = JSON.stringify(rest, Object.keys(rest).sort());\n return hmacSha256Sync(secret, payload);\n}\n\nexport class CommitmentRecord {\n readonly recordId: string;\n readonly action: string;\n readonly robotUri: string;\n readonly confidence: number \| undefined;\n readonly modelIdentity: string \| undefined;\n readonly params: Record<string, unknown>;\n readonly safetyApproved: boolean;\n readonly timestamp: string;\n readonly contentHash: string;\n readonly previousHash: string \| null;\n readonly hmac: string;\n\n private constructor(data: CommitmentRecordJSON) {\n this.recordId = data.recordId;\n this.action = data.action;\n this.robotUri = data.robotUri;\n this.confidence = data.confidence;\n this.modelIdentity = data.modelIdentity;\n this.params = data.params;\n this.safetyApproved = data.safetyApproved;\n this.timestamp = data.timestamp;\n this.contentHash = data.contentHash;\n this.previousHash = data.previousHash;\n this.hmac = data.hmac;\n }\n\n static create(\n data: CommitmentRecordData,\n secret: string,\n previousHash: string \| null = null\n ): CommitmentRecord {\n const recordId = generateUUID();\n const timestamp = new Date().toISOString();\n const params = data.params ?? {};\n const robotUri = data.robotUri ?? \"\";\n const contentHash = computeContentHash(recordId, data.action, robotUri, timestamp, params);\n\n const draft: CommitmentRecordJSON = {\n recordId,\n action: data.action,\n robotUri,\n confidence: data.confidence,\n modelIdentity: data.modelIdentity,\n params,\n safetyApproved: data.safetyApproved ?? true,\n timestamp,\n contentHash,\n previousHash,\n hmac: \"\",\n };\n draft.hmac = computeHmac(secret, draft);\n return new CommitmentRecord(draft);\n }\n\n verify(secret: string): boolean {\n const expected = computeHmac(secret, this.toJSON());\n return expected === this.hmac;\n }\n\n toJSON(): CommitmentRecordJSON {\n return {\n recordId: this.recordId,\n action: this.action,\n robotUri: this.robotUri,\n confidence: this.confidence,\n modelIdentity: this.modelIdentity,\n params: this.params,\n safetyApproved: this.safetyApproved,\n timestamp: this.timestamp,\n contentHash: this.contentHash,\n previousHash: this.previousHash,\n hmac: this.hmac,\n };\n }\n\n static fromJSON(obj: CommitmentRecordJSON): CommitmentRecord {\n return new CommitmentRecord(obj);\n }\n}\n\n// ---------------------------------------------------------------------------\n// AuditChain\n// ---------------------------------------------------------------------------\n\nexport interface ChainVerifyResult {\n valid: boolean;\n count: number;\n errors: string[];\n}\n\nexport class AuditChain {\n private _records: CommitmentRecord[] = [];\n private _secret: string;\n\n constructor(secret: string) {\n this._secret = secret;\n }\n\n get records(): readonly CommitmentRecord[] {\n return this._records;\n }\n\n append(data: CommitmentRecordData): CommitmentRecord {\n const prev = this._records[this._records.length - 1];\n const prevHash = prev?.contentHash ?? null;\n const record = CommitmentRecord.create(data, this._secret, prevHash);\n this._records.push(record);\n return record;\n }\n\n verifyAll(): ChainVerifyResult {\n const errors: string[] = [];\n let prevHash: string \| null = null;\n\n for (const record of this._records) {\n if (!record.verify(this._secret)) {\n errors.push(`HMAC invalid for record ${record.recordId.slice(0, 8)}`);\n }\n if (prevHash !== null && record.previousHash !== prevHash) {\n errors.push(\n `Chain broken at ${record.recordId.slice(0, 8)}: expected prev=${prevHash.slice(0, 12)}`\n );\n }\n prevHash = record.contentHash;\n }\n\n return { valid: errors.length === 0, count: this._records.length, errors };\n }\n\n toJSONL(): string {\n return this._records.map((r) => JSON.stringify(r.toJSON())).join(\"\\n\") + \"\\n\";\n }\n\n static fromJSONL(text: string, secret: string): AuditChain {\n const chain = new AuditChain(secret);\n const lines = text.trim().split(\"\\n\").filter((l) => l.trim() !== \"\");\n for (const line of lines) {\n const obj = JSON.parse(line) as CommitmentRecordJSON;\n chain._records.push(CommitmentRecord.fromJSON(obj));\n }\n return chain;\n }\n}\n","/\n RCAN Validation — validate messages, configs, and URIs.\n \n Each function returns a ValidationResult with ok, issues, warnings, info.\n /\n\nimport { RobotURI, RobotURIError } from \"./address\";\nimport { RCANMessage, RCANMessageError } from \"./message\";\nimport type { RCANConfig as RCANConfigType } from \"./types\";\n\nexport type { RCANConfig } from \"./types\";\n\nexport interface ValidationResult {\n ok: boolean;\n issues: string[];\n warnings: string[];\n info: string[];\n}\n\nfunction makeResult(): ValidationResult {\n return { ok: true, issues: [], warnings: [], info: [] };\n}\n\nfunction fail(result: ValidationResult, msg: string): void {\n result.ok = false;\n result.issues.push(msg);\n}\n\nfunction warn(result: ValidationResult, msg: string): void {\n result.warnings.push(msg);\n}\n\nfunction note(result: ValidationResult, msg: string): void {\n result.info.push(msg);\n}\n\n// ---------------------------------------------------------------------------\n// URI validation\n// ---------------------------------------------------------------------------\n\nexport function validateURI(uri: string): ValidationResult {\n const result = makeResult();\n try {\n const parsed = RobotURI.parse(uri);\n note(result, `✅ Valid RCAN URI`);\n note(result, ` Registry: ${parsed.registry}`);\n note(result, ` Manufacturer: ${parsed.manufacturer}`);\n note(result, ` Model: ${parsed.model}`);\n note(result, ` Version: ${parsed.version}`);\n note(result, ` Device ID: ${parsed.deviceId}`);\n } catch (e) {\n fail(result, `Invalid RCAN URI: ${e instanceof Error ? e.message : e}`);\n }\n return result;\n}\n\n// ---------------------------------------------------------------------------\n// Message validation\n// ---------------------------------------------------------------------------\n\nexport function validateMessage(data: unknown): ValidationResult {\n const result = makeResult();\n\n let obj: Record<string, unknown>;\n if (typeof data === \"string\") {\n try {\n obj = JSON.parse(data) as Record<string, unknown>;\n } catch {\n fail(result, \"Invalid JSON string\");\n return result;\n }\n } else if (typeof data === \"object\" && data !== null) {\n obj = data as Record<string, unknown>;\n } else {\n fail(result, \"Expected object or JSON string\");\n return result;\n }\n\n // Required fields\n for (const field of [\"rcan\", \"cmd\", \"target\"]) {\n if (!(field in obj) \|\| !obj[field]) {\n fail(result, `Missing required field: '${field}'`);\n }\n }\n\n if (!result.ok) return result;\n\n try {\n const msg = RCANMessage.fromJSON(obj);\n note(result, `✅ RCAN message valid (v${msg.rcan})`);\n note(result, ` cmd: ${msg.cmd}`);\n note(result, ` target: ${msg.target}`);\n if (msg.confidence !== undefined) {\n note(result, ` confidence: ${msg.confidence}`);\n } else {\n warn(result, \"No confidence score — add for RCAN §16 AI accountability\");\n }\n if (msg.isSigned) {\n note(result, ` signature: alg=${msg.signature?.alg}, kid=${msg.signature?.kid}`);\n } else {\n warn(result, \"Message is unsigned (recommended for production)\");\n }\n } catch (e) {\n fail(result, `Message validation failed: ${e instanceof Error ? e.message : e}`);\n }\n\n return result;\n}\n\n// ---------------------------------------------------------------------------\n// Config validation (L1 / L2 / L3)\n// ---------------------------------------------------------------------------\n\nexport function validateConfig(config: RCANConfigType): ValidationResult {\n const result = makeResult();\n const meta = config.metadata ?? {};\n const agent = config.agent ?? {};\n const rcanProto = config.rcan_protocol ?? {};\n\n // Required top-level keys\n for (const key of [\"rcan_version\", \"metadata\", \"agent\"] as const) {\n if (!(key in config) \|\| config[key] === undefined \|\| config[key] === null) {\n fail(result, `Missing required key: '${key}'`);\n }\n }\n\n // rcan_version format\n const rv = config.rcan_version;\n if (rv) {\n if (!/^\\d+\\.\\d+$/.test(rv)) {\n fail(result, `rcan_version '${rv}' must match pattern N.N (e.g. '1.2')`);\n }\n }\n\n // L1 — required fields\n if (!meta.manufacturer) fail(result, \"L1: metadata.manufacturer is required (§2)\");\n if (!meta.model) fail(result, \"L1: metadata.model is required (§2)\");\n if (!meta.device_id && !meta.robot_name) {\n fail(result, \"L1: metadata.device_id (or robot_name) is required (§2)\");\n }\n\n // L2 — auth + confidence\n if (!rcanProto.jwt_auth?.enabled) {\n warn(result, \"L2: jwt_auth not enabled (required for L2 conformance, §8)\");\n }\n if (!agent.confidence_gates \|\| agent.confidence_gates.length === 0) {\n warn(result, \"L2: confidence_gates not configured (§16)\");\n }\n\n // L3 — hitl + commitment chain\n if (!agent.hitl_gates \|\| agent.hitl_gates.length === 0) {\n warn(result, \"L3: hitl_gates not configured (§16)\");\n }\n if (!agent.commitment_chain?.enabled) {\n warn(result, \"L3: commitment_chain not enabled (§16)\");\n }\n\n // Registration\n if (meta.rrn) {\n note(result, `✅ RRN registered: ${meta.rrn}`);\n } else {\n warn(result, \"Robot not registered — visit rcan.dev/registry/register\");\n }\n\n if (result.ok && result.issues.length === 0) {\n const l1ok = !result.warnings.some((w) => w.startsWith(\"L1\"));\n const l2ok = l1ok && !result.warnings.some((w) => w.startsWith(\"L2\"));\n const l3ok = l2ok && !result.warnings.some((w) => w.startsWith(\"L3\"));\n const level = l3ok ? \"L3\" : l2ok ? \"L2\" : l1ok ? \"L1\" : \"FAIL\";\n note(result, `✅ Config valid — conformance level: ${level}`);\n }\n\n return result;\n}\n","/\n RCAN error class hierarchy.\n * All errors extend RCANError which extends the built-in Error.\n /\n\nexport class RCANError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"RCANError\";\n // Restore prototype chain for instanceof checks in transpiled code\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANAddressError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANAddressError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANValidationError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANValidationError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANGateError extends RCANError {\n constructor(\n message: string,\n public gateType: string,\n public value?: number,\n public threshold?: number\n ) {\n super(message);\n this.name = \"RCANGateError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANSignatureError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANSignatureError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANRegistryError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANRegistryError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\n// ── Node / Federation errors ──────────────────────────────────────────────────\n\nexport class RCANNodeError extends RCANError {\n constructor(message: string, public readonly nodeUrl?: string) {\n super(message);\n this.name = \"RCANNodeError\";\n Object.setPrototypeOf(this, RCANNodeError.prototype);\n }\n}\n\nexport class RCANNodeNotFoundError extends RCANNodeError {\n constructor(public readonly rrn: string, nodeUrl?: string) {\n super(`RRN not found in federation: ${rrn}`, nodeUrl);\n this.name = \"RCANNodeNotFoundError\";\n Object.setPrototypeOf(this, RCANNodeNotFoundError.prototype);\n }\n}\n\nexport class RCANNodeSyncError extends RCANNodeError {\n constructor(\n message: string,\n nodeUrl?: string,\n public readonly cause?: Error\n ) {\n super(message, nodeUrl);\n this.name = \"RCANNodeSyncError\";\n Object.setPrototypeOf(this, RCANNodeSyncError.prototype);\n }\n}\n\nexport class RCANNodeTrustError extends RCANNodeError {\n public readonly reason: \"invalid_signature\" \| \"expired_cert\" \| \"unknown_issuer\" \| \"missing_pubkey\";\n\n constructor(reason: RCANNodeTrustError[\"reason\"], nodeUrl?: string) {\n super(`Node trust verification failed: ${reason}`, nodeUrl);\n this.name = \"RCANNodeTrustError\";\n this.reason = reason;\n Object.setPrototypeOf(this, RCANNodeTrustError.prototype);\n }\n}\n\n// ── v1.5 errors ───────────────────────────────────────────────────────────────\n\n/* Thrown when an incoming message has an incompatible MAJOR version /\nexport class RCANVersionIncompatibleError extends RCANError {\n constructor(incomingVersion: string, localVersion: string) {\n super(`VERSION_INCOMPATIBLE: incoming=${incomingVersion}, local=${localVersion}`);\n this.name = \"RCANVersionIncompatibleError\";\n Object.setPrototypeOf(this, RCANVersionIncompatibleError.prototype);\n }\n}\n\n/* Thrown when a replay attack is detected /\nexport class RCANReplayAttackError extends RCANError {\n constructor(reason: string) {\n super(`REPLAY_DETECTED: ${reason}`);\n this.name = \"RCANReplayAttackError\";\n Object.setPrototypeOf(this, RCANReplayAttackError.prototype);\n }\n}\n\n/* Thrown when a delegation chain is invalid or too deep /\nexport class RCANDelegationChainError extends RCANError {\n constructor(reason: string) {\n super(`DELEGATION_CHAIN_ERROR: ${reason}`);\n this.name = \"RCANDelegationChainError\";\n Object.setPrototypeOf(this, RCANDelegationChainError.prototype);\n }\n}\n\n/* Thrown when a config update is unauthorized or has a hash mismatch /\nexport class RCANConfigAuthorizationError extends RCANError {\n constructor(reason: string) {\n super(`CONFIG_AUTH_ERROR: ${reason}`);\n this.name = \"RCANConfigAuthorizationError\";\n Object.setPrototypeOf(this, RCANConfigAuthorizationError.prototype);\n }\n}\n","/\n rcan-ts — RegistryClient\n * TypeScript parity with rcan-py RegistryClient.\n \n @see https://rcan.dev/spec#section-registry\n /\n\nimport { RCANRegistryError } from \"./errors.js\";\n\nconst DEFAULT_BASE_URL = \"https://rcan-spec.pages.dev\";\n\n// ── Interfaces ────────────────────────────────────────────────────────────────\n\nexport interface RobotRegistration {\n manufacturer: string;\n model: string;\n version: string;\n device_id: string;\n description?: string;\n contact_email?: string;\n verification_tier?: string;\n source?: string;\n}\n\nexport interface Robot extends RobotRegistration {\n rrn: string;\n registered_at: string;\n updated_at: string;\n verification_tier: string;\n status: string;\n}\n\nexport interface RegistrationResult {\n rrn: string;\n api_key: string;\n}\n\nexport interface ListResult {\n robots: Robot[];\n total: number;\n limit: number;\n offset: number;\n}\n\n// ── RegistryClient ────────────────────────────────────────────────────────────\n\nexport class RegistryClient {\n private baseUrl: string;\n private apiKey?: string;\n private timeout: number;\n\n constructor(opts?: { baseUrl?: string; apiKey?: string; timeout?: number }) {\n this.baseUrl = (opts?.baseUrl ?? DEFAULT_BASE_URL).replace(/\\/$/, \"\");\n this.apiKey = opts?.apiKey;\n this.timeout = opts?.timeout ?? 10000;\n }\n\n // ── Private helpers ─────────────────────────────────────────────────────────\n\n private async _fetch(\n path: string,\n init: RequestInit = {}\n ): Promise<Response> {\n const url = `${this.baseUrl}${path}`;\n const controller = new AbortController();\n const timer = setTimeout(() => controller.abort(), this.timeout);\n\n try {\n const response = await fetch(url, {\n ...init,\n signal: controller.signal,\n headers: {\n \"Content-Type\": \"application/json\",\n ...(init.headers ?? {}),\n },\n });\n return response;\n } finally {\n clearTimeout(timer);\n }\n }\n\n private _authHeaders(): Record<string, string> {\n if (!this.apiKey) {\n throw new RCANRegistryError(\n \"API key required for write operations. Pass apiKey to RegistryClient.\"\n );\n }\n return { Authorization: `Bearer ${this.apiKey}` };\n }\n\n private async _checkResponse<T>(resp: Response): Promise<T> {\n if (!resp.ok) {\n let msg = `Registry API error: ${resp.status}`;\n try {\n const body = (await resp.json()) as { error?: string };\n if (body?.error) msg = body.error;\n } catch {\n / ignore /\n }\n throw new RCANRegistryError(msg);\n }\n return (await resp.json()) as T;\n }\n\n // ── Public API ───────────────────────────────────────────────────────────────\n\n /* Register a new robot. Returns RRN + API key. /\n async register(robot: RobotRegistration): Promise<RegistrationResult> {\n const resp = await this._fetch(\"/api/v1/robots\", {\n method: \"POST\",\n body: JSON.stringify(robot),\n });\n return this._checkResponse<RegistrationResult>(resp);\n }\n\n /* Look up a robot by RRN. /\n async get(rrn: string): Promise<Robot> {\n const resp = await this._fetch(`/api/v1/robots/${encodeURIComponent(rrn)}`);\n return this._checkResponse<Robot>(resp);\n }\n\n /* List robots with optional pagination and tier filter. /\n async list(opts?: {\n limit?: number;\n offset?: number;\n tier?: string;\n }): Promise<ListResult> {\n const params = new URLSearchParams();\n if (opts?.limit !== undefined) params.set(\"limit\", String(opts.limit));\n if (opts?.offset !== undefined) params.set(\"offset\", String(opts.offset));\n if (opts?.tier) params.set(\"tier\", opts.tier);\n const qs = params.toString() ? `?${params}` : \"\";\n const resp = await this._fetch(`/api/v1/robots${qs}`);\n return this._checkResponse<ListResult>(resp);\n }\n\n /* Update robot fields. Requires API key. /\n async patch(rrn: string, updates: Partial<Robot>): Promise<Robot> {\n const resp = await this._fetch(\n `/api/v1/robots/${encodeURIComponent(rrn)}`,\n {\n method: \"PATCH\",\n headers: this._authHeaders(),\n body: JSON.stringify(updates),\n }\n );\n return this._checkResponse<Robot>(resp);\n }\n\n /* Delete (soft-delete) a robot. Requires API key. /\n async delete(rrn: string): Promise<void> {\n const resp = await this._fetch(\n `/api/v1/robots/${encodeURIComponent(rrn)}`,\n {\n method: \"DELETE\",\n headers: this._authHeaders(),\n }\n );\n if (!resp.ok) {\n await this._checkResponse<void>(resp);\n }\n }\n\n /* Search robots by query, manufacturer, model, or tier. /\n async search(opts: {\n q?: string;\n manufacturer?: string;\n model?: string;\n tier?: string;\n }): Promise<Robot[]> {\n const params = new URLSearchParams();\n if (opts.q) params.set(\"q\", opts.q);\n if (opts.manufacturer) params.set(\"manufacturer\", opts.manufacturer);\n if (opts.model) params.set(\"model\", opts.model);\n if (opts.tier) params.set(\"tier\", opts.tier);\n const qs = params.toString() ? `?${params}` : \"\";\n const resp = await this._fetch(`/api/v1/robots/search${qs}`);\n if (!resp.ok) {\n // Fall back to list endpoint with filters\n const listResp = await this._fetch(`/api/v1/robots${qs}`);\n const data = await this._checkResponse<ListResult \| { results?: Robot[] }>(listResp);\n if (\"robots\" in data) return data.robots;\n if (\"results\" in data && data.results) return data.results;\n return [];\n }\n const data = (await resp.json()) as Robot[] \| { results?: Robot[] } \| ListResult;\n if (Array.isArray(data)) return data;\n if (\"results\" in data && data.results) return data.results;\n if (\"robots\" in data) return (data as ListResult).robots;\n return [];\n }\n}\n","/\n rcan-ts — NodeClient\n * Federation-aware node discovery and RRN resolution.\n \n Zero runtime dependencies — uses globalThis.fetch (Node 18+, browsers, CF Workers).\n \n @see https://rcan.dev/spec#section-federation\n /\n\nimport {\n RCANNodeNotFoundError,\n RCANNodeSyncError,\n RCANNodeTrustError,\n} from \"./errors.js\";\nimport type { RCANRegistryNode, RCANResolveResult } from \"./types.js\";\n\n// ── Constants ─────────────────────────────────────────────────────────────────\n\nconst ROOT_NODE_URL = \"https://rcan.dev\";\nconst NODE_MANIFEST_PATH = \"/.well-known/rcan-node.json\";\n\nconst VALID_NODE_TYPES = new Set<string>([\n \"root\",\n \"authoritative\",\n \"resolver\",\n \"cache\",\n]);\n\n// ── Helpers ───────────────────────────────────────────────────────────────────\n\n/\n Parse an RRN string into its namespace components.\n \n @example\n * parseRRNNamespace(\"RRN-BD-00000001\") → { type: \"delegated\", prefix: \"BD\", serial: \"00000001\" }\n * parseRRNNamespace(\"RRN-00000042\") → { type: \"root\", serial: \"00000042\" }\n * parseRRNNamespace(\"INVALID\") → null\n /\nfunction parseRRNNamespace(\n rrn: string\n):\n \| { type: \"root\"; serial: string }\n \| { type: \"delegated\"; prefix: string; serial: string }\n \| null {\n const delegated = rrn.match(/^RRN-([A-Z0-9]{2,8})-(\\d{8,16})$/);\n if (delegated) return { type: \"delegated\", prefix: delegated[1], serial: delegated[2] };\n const root = rrn.match(/^RRN-(\\d{8,16})$/);\n if (root) return { type: \"root\", serial: root[1] };\n return null;\n}\n\n// ── NodeClient ────────────────────────────────────────────────────────────────\n\nexport class NodeClient {\n private readonly rootUrl: string;\n private readonly timeoutMs: number;\n\n constructor(rootUrl = ROOT_NODE_URL, timeoutMs = 10_000) {\n this.rootUrl = rootUrl.replace(/\\/$/, \"\");\n this.timeoutMs = timeoutMs;\n }\n\n // ── Private helpers ─────────────────────────────────────────────────────────\n\n private async _fetch(url: string): Promise<Response> {\n const controller = new AbortController();\n const timer = setTimeout(() => controller.abort(), this.timeoutMs);\n try {\n return await globalThis.fetch(url, { signal: controller.signal });\n } catch (err) {\n if (err instanceof Error && err.name === \"AbortError\") {\n throw new RCANNodeSyncError(`Request timed out: ${url}`, url, err);\n }\n throw new RCANNodeSyncError(\n `Network error fetching ${url}: ${(err as Error).message}`,\n url,\n err instanceof Error ? err : undefined\n );\n } finally {\n clearTimeout(timer);\n }\n }\n\n // ── Public API ───────────────────────────────────────────────────────────────\n\n /\n Fetch /.well-known/rcan-node.json from any node URL.\n * Throws RCANNodeTrustError if the manifest is malformed.\n * Throws RCANNodeSyncError on network failure.\n /\n async getNodeManifest(nodeUrl: string): Promise<RCANRegistryNode> {\n const url = `${nodeUrl.replace(/\\/$/, \"\")}${NODE_MANIFEST_PATH}`;\n const resp = await this._fetch(url);\n\n if (!resp.ok) {\n if (resp.status === 404) {\n throw new RCANNodeNotFoundError(url, nodeUrl);\n }\n throw new RCANNodeSyncError(\n `Failed to fetch node manifest from ${nodeUrl}: HTTP ${resp.status}`,\n nodeUrl\n );\n }\n\n let data: unknown;\n try {\n data = await resp.json();\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in node manifest from ${nodeUrl}`,\n nodeUrl,\n err instanceof Error ? err : undefined\n );\n }\n\n if (!this.verifyNode(data)) {\n throw new RCANNodeTrustError(\"missing_pubkey\", nodeUrl);\n }\n return data;\n }\n\n /\n Get list of known registry nodes from root /api/v1/nodes.\n * Optionally filter by namespace prefix (e.g. \"BD\").\n /\n async listNodes(prefix?: string): Promise<RCANRegistryNode[]> {\n const qs = prefix ? `?prefix=${encodeURIComponent(prefix)}` : \"\";\n const url = `${this.rootUrl}/api/v1/nodes${qs}`;\n const resp = await this._fetch(url);\n\n if (!resp.ok) {\n throw new RCANNodeSyncError(\n `Failed to list nodes from ${url}: HTTP ${resp.status}`,\n url\n );\n }\n\n let data: unknown;\n try {\n data = await resp.json();\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in nodes list from ${url}`,\n url,\n err instanceof Error ? err : undefined\n );\n }\n\n if (Array.isArray(data)) return data as RCANRegistryNode[];\n if (data && typeof data === \"object\" && \"nodes\" in data) {\n return (data as { nodes: RCANRegistryNode[] }).nodes;\n }\n return [];\n }\n\n /\n Find the authoritative node for an RRN.\n * - Delegated RRN (RRN-BD-00000001): GET /api/v1/nodes?prefix=BD, return first match.\n * - Root RRN (RRN-00000042): return root node manifest.\n * - Unknown format: throws RCANNodeNotFoundError.\n /\n async discover(rrn: string): Promise<RCANRegistryNode> {\n const parsed = parseRRNNamespace(rrn);\n\n if (!parsed) {\n throw new RCANNodeNotFoundError(rrn, this.rootUrl);\n }\n\n if (parsed.type === \"root\") {\n return this.getNodeManifest(this.rootUrl);\n }\n\n // delegated\n const nodes = await this.listNodes(parsed.prefix);\n if (nodes.length === 0) {\n throw new RCANNodeNotFoundError(rrn, this.rootUrl);\n }\n return nodes[0];\n }\n\n /\n Resolve an RRN across the federation.\n * First tries {rootUrl}/api/v1/resolve/{rrn}.\n * On 404, discovers the authoritative node and tries {node.api_base}/robots/{rrn}.\n /\n async resolve(rrn: string): Promise<RCANResolveResult> {\n const primaryUrl = `${this.rootUrl}/api/v1/resolve/${encodeURIComponent(rrn)}`;\n\n let resp: Response;\n try {\n resp = await this._fetch(primaryUrl);\n } catch (err) {\n // Network-level failure; bubble up as-is\n throw err;\n }\n\n if (resp.ok) {\n try {\n return (await resp.json()) as RCANResolveResult;\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in resolve response for ${rrn}`,\n this.rootUrl,\n err instanceof Error ? err : undefined\n );\n }\n }\n\n if (resp.status !== 404) {\n throw new RCANNodeSyncError(\n `Unexpected HTTP ${resp.status} resolving ${rrn}`,\n this.rootUrl\n );\n }\n\n // 404 → discover authoritative node and try its /robots/{rrn} endpoint\n const node = await this.discover(rrn);\n const fallbackUrl = `${node.api_base.replace(/\\/$/, \"\")}/robots/${encodeURIComponent(rrn)}`;\n const fallbackResp = await this._fetch(fallbackUrl);\n\n if (!fallbackResp.ok) {\n if (fallbackResp.status === 404) {\n throw new RCANNodeNotFoundError(rrn, node.api_base);\n }\n throw new RCANNodeSyncError(\n `HTTP ${fallbackResp.status} from authoritative node for ${rrn}`,\n node.api_base\n );\n }\n\n try {\n return (await fallbackResp.json()) as RCANResolveResult;\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in fallback resolve response for ${rrn}`,\n node.api_base,\n err instanceof Error ? err : undefined\n );\n }\n }\n\n /\n Verify a node manifest is well-formed.\n * Checks required fields, ed25519: public_key prefix, valid node_type, https:// api_base.\n /\n verifyNode(manifest: unknown): manifest is RCANRegistryNode {\n if (!manifest \|\| typeof manifest !== \"object\") return false;\n const m = manifest as Record<string, unknown>;\n\n if (typeof m.rcan_node_version !== \"string\" \|\| !m.rcan_node_version) return false;\n if (typeof m.node_type !== \"string\" \|\| !VALID_NODE_TYPES.has(m.node_type as string)) return false;\n if (typeof m.operator !== \"string\" \|\| !m.operator) return false;\n if (typeof m.namespace_prefix !== \"string\" \|\| !m.namespace_prefix) return false;\n if (typeof m.public_key !== \"string\" \|\| !m.public_key.startsWith(\"ed25519:\")) return false;\n if (typeof m.api_base !== \"string\" \|\| !m.api_base.startsWith(\"https://\")) return false;\n\n return true;\n }\n}\n","/\n Fetch and validate against canonical RCAN JSON schemas from rcan.dev.\n * Caches schema in memory for the session (no filesystem deps for browser compat).\n /\n\nconst SCHEMA_BASE = 'https://rcan.dev/schemas';\nconst schemaCache = new Map<string, object>();\n\n/* Clear the in-memory schema cache. Intended for use in tests only. /\nexport function _clearSchemaCache(): void {\n schemaCache.clear();\n}\n\nexport async function fetchCanonicalSchema(schemaName: string): Promise<object \| null> {\n if (schemaCache.has(schemaName)) return schemaCache.get(schemaName)!;\n try {\n const controller = new AbortController();\n const timer = setTimeout(() => controller.abort(), 5000);\n // .unref() prevents the timer from keeping the Node.js event loop alive after tests\n (timer as unknown as { unref?: () => void }).unref?.();\n const res = await fetch(`${SCHEMA_BASE}/${schemaName}`, { signal: controller.signal });\n clearTimeout(timer);\n if (!res.ok) return null;\n const schema = await res.json();\n schemaCache.set(schemaName, schema);\n return schema;\n } catch {\n return null; // graceful degradation\n }\n}\n\n/\n Validate a config object against the canonical rcan-config schema from rcan.dev.\n * Returns { valid: true } or { valid: false, errors: string[] }.\n * Gracefully returns { valid: true, skipped: true } if schema unreachable.\n /\nexport async function validateConfigAgainstSchema(\n config: unknown\n): Promise<{ valid: boolean; errors?: string[]; skipped?: boolean }> {\n const schema = await fetchCanonicalSchema('rcan-config.schema.json');\n if (!schema) return { valid: true, skipped: true };\n\n // Basic structural validation (no heavy jsonschema dep — just check required keys)\n const errors: string[] = [];\n if (typeof config !== 'object' \|\| config === null) {\n return { valid: false, errors: ['Config must be an object'] };\n }\n const cfg = config as Record<string, unknown>;\n const required = (schema as any).required ?? [];\n for (const key of required) {\n if (!(key in cfg)) errors.push(`Missing required field: ${key}`);\n }\n return errors.length === 0 ? { valid: true } : { valid: false, errors };\n}\n\nexport async function validateNodeAgainstSchema(\n manifest: unknown\n): Promise<{ valid: boolean; errors?: string[]; skipped?: boolean }> {\n const schema = await fetchCanonicalSchema('rcan-node.schema.json');\n if (!schema) return { valid: true, skipped: true };\n\n const errors: string[] = [];\n if (typeof manifest !== 'object' \|\| manifest === null) {\n return { valid: false, errors: ['Manifest must be an object'] };\n }\n const m = manifest as Record<string, unknown>;\n const required = (schema as any).required ?? [];\n for (const key of required) {\n if (!(key in m)) errors.push(`Missing required field: ${key}`);\n }\n return errors.length === 0 ? { valid: true } : { valid: false, errors };\n}\n","/\n RCAN Quality of Service — §5.3\n \n QoSLevel:\n * FIRE_AND_FORGET = 0 — no ack required\n * ACKNOWLEDGED = 1 — at-least-once; sender retries until COMMAND_ACK\n * EXACTLY_ONCE = 2 — two-phase commit: COMMAND_ACK + COMMAND_COMMIT\n \n Safety messages MUST use qos >= 1.\n * ESTOP MUST use qos = 2 (EXACTLY_ONCE).\n * TELEOP MUST use qos = 0 (FIRE_AND_FORGET).\n /\n\nimport type { SafetyMessage } from \"./safety.js\";\n\nexport enum QoSLevel {\n FIRE_AND_FORGET = 0,\n ACKNOWLEDGED = 1,\n EXACTLY_ONCE = 2,\n}\n\n/* Thrown when an ACK times out for a safety message /\nexport class QoSAckTimeoutError extends Error {\n constructor(msgId: string) {\n super(`ACK timeout for message ${msgId} — safety halt required`);\n this.name = \"QoSAckTimeoutError\";\n Object.setPrototypeOf(this, QoSAckTimeoutError.prototype);\n }\n}\n\nexport interface QoSSendOptions {\n /* QoS level (default: FIRE_AND_FORGET) /\n qos?: QoSLevel;\n /* Max retries for qos >= 1 (default: 3) /\n maxRetries?: number;\n /* Initial backoff ms for qos >= 1 (default: 100) /\n initialBackoffMs?: number;\n /* ACK timeout ms for qos >= 1 (default: 500) /\n ackTimeoutMs?: number;\n}\n\nexport interface QoSResult {\n delivered: boolean;\n attempts: number;\n reason: string;\n}\n\n/\n QoSManager — manages send-with-ack pattern for RCAN messages.\n \n Usage:\n * const mgr = new QoSManager(sendFn, ackFn);\n * await mgr.sendWithQoS(msg, { qos: QoSLevel.EXACTLY_ONCE });\n /\nexport class QoSManager {\n private readonly _send: (msg: unknown) => Promise<void>;\n private readonly _waitForAck: (msgId: string, timeoutMs: number) => Promise<boolean>;\n\n constructor(\n send: (msg: unknown) => Promise<void>,\n waitForAck: (msgId: string, timeoutMs: number) => Promise<boolean>\n ) {\n this._send = send;\n this._waitForAck = waitForAck;\n }\n\n /\n Send a message with the specified QoS level.\n \n For QoS 0: fire and forget.\n * For QoS 1: retry until ACK received or maxRetries exhausted.\n * For QoS 2: same as QoS 1 but sends a COMMAND_COMMIT after ACK.\n /\n async sendWithQoS(\n msg: unknown,\n opts: QoSSendOptions = {}\n ): Promise<QoSResult> {\n const qos = opts.qos ?? QoSLevel.FIRE_AND_FORGET;\n const maxRetries = opts.maxRetries ?? 3;\n const initialBackoffMs = opts.initialBackoffMs ?? 100;\n const ackTimeoutMs = opts.ackTimeoutMs ?? 500;\n\n if (qos === QoSLevel.FIRE_AND_FORGET) {\n await this._send(msg);\n return { delivered: true, attempts: 1, reason: \"fire-and-forget\" };\n }\n\n // QoS 1 or 2: retry loop\n const msgId = (msg as { message_id?: string; msg_id?: string }).message_id\n ?? (msg as { message_id?: string; msg_id?: string }).msg_id\n ?? \"unknown\";\n\n let attempts = 0;\n let backoffMs = initialBackoffMs;\n\n while (attempts <= maxRetries) {\n await this._send(msg);\n attempts++;\n\n const acked = await this._waitForAck(msgId, ackTimeoutMs);\n if (acked) {\n return { delivered: true, attempts, reason: qos === QoSLevel.EXACTLY_ONCE ? \"exactly-once\" : \"acknowledged\" };\n }\n\n if (attempts > maxRetries) break;\n\n // Exponential backoff\n await sleep(backoffMs);\n backoffMs = Math.min(backoffMs 2, 5000);\n }\n\n return { delivered: false, attempts, reason: `ACK not received after ${maxRetries} retries` };\n }\n}\n\n/*\n Override makeEstopMessage to force QoS=EXACTLY_ONCE.\n * Returns a SafetyMessage annotated with qos: 2.\n /\nexport function makeEstopWithQoS(\n ruri: string,\n reason: string\n): SafetyMessage & { qos: QoSLevel } {\n const msg: SafetyMessage & { qos: QoSLevel } = {\n message_type: 6 as const,\n ruri,\n safety_event: \"ESTOP\",\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n qos: QoSLevel.EXACTLY_ONCE,\n };\n return msg;\n}\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = (bytes[6]! & 0x0f) \| 0x40;\n bytes[8] = (bytes[8]! & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, \"0\"));\n return `${hex.slice(0, 4).join(\"\")}-${hex.slice(4, 6).join(\"\")}-${hex.slice(6, 8).join(\"\")}-${hex.slice(8, 10).join(\"\")}-${hex.slice(10).join(\"\")}`;\n}\n\nfunction sleep(ms: number): Promise<void> {\n return new Promise((resolve) => setTimeout(resolve, ms));\n}\n","/*\n RCAN Safety Message helpers (MessageType 6).\n \n Safety messages bypass all queues and confidence gates per RCAN §6.\n * Use these helpers to build and validate ESTOP/STOP/RESUME messages.\n \n v1.5 updates:\n * - makeEstopMessage now includes qos: 2 (EXACTLY_ONCE)\n * - makeTransparencyMessage includes delegationChain (GAP-22)\n /\n\nimport type { DelegationHop } from \"./message.js\";\nimport { QoSLevel } from \"./qos.js\";\n\nexport const SAFETY_MESSAGE_TYPE = 6;\nexport type SafetyEvent = 'ESTOP' \| 'STOP' \| 'RESUME';\n\nexport interface SafetyMessage {\n message_type: 6;\n ruri: string;\n safety_event: SafetyEvent;\n reason: string;\n timestamp_ms: number;\n message_id: string;\n /* v1.5: QoS level (ESTOP always 2) /\n qos?: QoSLevel;\n}\n\nfunction generateId(): string {\n if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n return crypto.randomUUID();\n }\n // Fallback for older Node versions: simple random hex\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = (bytes[6]! & 0x0f) \| 0x40;\n bytes[8] = (bytes[8]! & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, '0'));\n return `${hex.slice(0, 4).join('')}-${hex.slice(4, 6).join('')}-${hex.slice(6, 8).join('')}-${hex.slice(8, 10).join('')}-${hex.slice(10).join('')}`;\n}\n\n/*\n Create an ESTOP message — immediate actuator cut.\n \n Protocol 66 safety invariant: ESTOP is NEVER blocked by new mechanisms.\n * v1.5: forces qos=EXACTLY_ONCE (2) per §5.3.\n /\nexport function makeEstopMessage(ruri: string, reason: string): SafetyMessage {\n return {\n message_type: 6,\n ruri,\n safety_event: 'ESTOP',\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n qos: QoSLevel.EXACTLY_ONCE,\n };\n}\n\n/\n Create a STOP message — controlled deceleration to rest.\n * Use for non-emergency halts where deceleration is safe.\n /\nexport function makeStopMessage(ruri: string, reason: string): SafetyMessage {\n return {\n message_type: 6,\n ruri,\n safety_event: 'STOP',\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n };\n}\n\n/\n Create a RESUME message — clear a prior STOP.\n * Note: ESTOP requires explicit hardware-level clear; RESUME only clears STOP.\n /\nexport function makeResumeMessage(ruri: string, reason: string): SafetyMessage {\n return {\n message_type: 6,\n ruri,\n safety_event: 'RESUME',\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n };\n}\n\n/\n Check if a message dict is a RCAN safety message.\n /\nexport function isSafetyMessage(msg: unknown): msg is SafetyMessage {\n return (\n typeof msg === 'object' &&\n msg !== null &&\n (msg as Record<string, unknown>).message_type === SAFETY_MESSAGE_TYPE\n );\n}\n\n/\n Validate a safety message. Returns array of error strings (empty = valid).\n /\nexport function validateSafetyMessage(msg: Partial<SafetyMessage>): string[] {\n const errors: string[] = [];\n if (msg.message_type !== 6) errors.push('message_type must be 6');\n if (!msg.ruri) errors.push('ruri is required');\n if (!['ESTOP', 'STOP', 'RESUME'].includes(msg.safety_event ?? '')) {\n errors.push('safety_event must be ESTOP, STOP, or RESUME');\n }\n if (!msg.reason \|\| msg.reason.length === 0) errors.push('reason is required');\n if (!msg.message_id) errors.push('message_id is required');\n if (!msg.timestamp_ms \|\| msg.timestamp_ms <= 0) errors.push('timestamp_ms must be positive');\n return errors;\n}\n\n// ── v1.5: Transparency message ────────────────────────────────────────────────\n\nexport interface TransparencyMessage {\n message_type: 11; // TRANSPARENCY\n ruri: string;\n disclosure: string;\n timestamp_ms: number;\n message_id: string;\n /* v1.5 GAP-22: third-party control chain /\n delegation_chain?: DelegationHop[];\n}\n\n/\n Build a TRANSPARENCY message for EU AI Act Article 13 compliance.\n \n v1.5 (GAP-22): includes delegation_chain when available.\n /\nexport function makeTransparencyMessage(\n ruri: string,\n disclosure: string,\n delegationChain?: DelegationHop[]\n): TransparencyMessage {\n return {\n message_type: 11,\n ruri,\n disclosure,\n timestamp_ms: Date.now(),\n message_id: generateId(),\n delegation_chain: delegationChain,\n };\n}\n","/\n RCAN Replay Attack Prevention — §8.3\n \n Robots MUST reject messages where timestamp is >30s old (configurable).\n * A sliding-window seen-set of msg_ids prevents duplicate delivery.\n * Safety messages (MessageType 6) use a 10s window maximum.\n /\n\nimport type { SafetyMessage } from \"./safety.js\";\n\nconst SAFETY_MESSAGE_TYPE = 6;\nconst SAFETY_MAX_WINDOW_S = 10;\nconst DEFAULT_WINDOW_S = 30;\nconst DEFAULT_MAX_SIZE = 10000;\n\n/* A message shape that has the fields the replay cache needs /\nexport interface ReplayableMessage {\n message_id?: string;\n msg_id?: string;\n timestamp_ms?: number;\n timestamp?: string \| number;\n message_type?: number;\n}\n\nexport interface ReplayCheckResult {\n allowed: boolean;\n reason: string;\n}\n\n/\n Sliding-window replay cache.\n \n constructor(windowSeconds = 30, maxSize = 10000)\n /\nexport class ReplayCache {\n private readonly windowSeconds: number;\n private readonly maxSize: number;\n /* Map<msgId, expiresAtMs> /\n private readonly _seen: Map<string, number>;\n\n constructor(windowSeconds: number = DEFAULT_WINDOW_S, maxSize: number = DEFAULT_MAX_SIZE) {\n this.windowSeconds = windowSeconds;\n this.maxSize = maxSize;\n this._seen = new Map();\n }\n\n /\n Check a message id + timestamp and record it if allowed.\n \n @param msgId - unique message identifier\n * @param timestamp - ISO 8601 string or Unix seconds (float)\n * @param isSafety - if true, enforce the 10s safety window cap\n /\n checkAndRecord(\n msgId: string,\n timestamp: string,\n isSafety = false\n ): ReplayCheckResult {\n const now = Date.now();\n\n // Evict stale entries to keep memory bounded\n this._evict(now);\n\n // Resolve effective window\n const window = isSafety\n ? Math.min(this.windowSeconds, SAFETY_MAX_WINDOW_S)\n : this.windowSeconds;\n\n // Parse timestamp → ms\n const tMs = parseTimestampMs(timestamp);\n if (tMs === null) {\n return { allowed: false, reason: `invalid timestamp format: ${timestamp}` };\n }\n\n // Freshness check\n const ageMs = now - tMs;\n const windowMs = window 1000;\n if (ageMs > windowMs) {\n return {\n allowed: false,\n reason: `message too old: age=${Math.round(ageMs / 1000)}s > window=${window}s`,\n };\n }\n if (tMs > now + 5000) {\n // Allow 5s future drift for clock skew\n return {\n allowed: false,\n reason: `message timestamp is in the future`,\n };\n }\n\n // Duplicate check\n if (this._seen.has(msgId)) {\n return { allowed: false, reason: `replay detected: msg_id ${msgId} already seen` };\n }\n\n // Enforce max size by evicting oldest entry\n if (this._seen.size >= this.maxSize) {\n const firstKey = this._seen.keys().next().value as string;\n this._seen.delete(firstKey);\n }\n\n // Record it\n const expiresAt = now + windowMs;\n this._seen.set(msgId, expiresAt);\n\n return { allowed: true, reason: \"ok\" };\n }\n\n /** Evict entries whose window has passed /\n private _evict(now: number): void {\n for (const [id, expiresAt] of this._seen) {\n if (expiresAt <= now) {\n this._seen.delete(id);\n }\n }\n }\n\n /* Number of entries currently tracked /\n get size(): number {\n return this._seen.size;\n }\n}\n\n/\n Validate replay for a SafetyMessage or ReplayableMessage.\n /\nexport function validateReplay(\n message: SafetyMessage \| ReplayableMessage,\n cache: ReplayCache\n): { valid: boolean; reason: string } {\n const msg = message as ReplayableMessage & Partial<SafetyMessage>;\n\n // Resolve msg_id\n const msgId: string \| undefined =\n (msg as SafetyMessage).message_id ?? (msg as ReplayableMessage).msg_id;\n if (!msgId) {\n return { valid: false, reason: \"missing message_id / msg_id\" };\n }\n\n // Resolve timestamp\n let timestamp: string \| undefined;\n if (typeof (msg as SafetyMessage).timestamp_ms === \"number\") {\n // SafetyMessage uses timestamp_ms (unix ms)\n timestamp = String((msg as SafetyMessage).timestamp_ms! / 1000);\n } else if (msg.timestamp !== undefined) {\n timestamp = String(msg.timestamp);\n }\n if (!timestamp) {\n return { valid: false, reason: \"missing timestamp\" };\n }\n\n const isSafety = (msg as SafetyMessage).message_type === SAFETY_MESSAGE_TYPE \|\|\n (msg as ReplayableMessage).message_type === SAFETY_MESSAGE_TYPE;\n\n const result = cache.checkAndRecord(msgId, timestamp, isSafety);\n return { valid: result.allowed, reason: result.reason };\n}\n\n// ── helpers ───────────────────────────────────────────────────────────────────\n\n/\n Parse a timestamp to milliseconds.\n * Accepts:\n * - ISO 8601 strings (\"2026-03-16T12:00:00.000Z\")\n * - Unix seconds as string (\"1710000000.123\" or \"1710000000\")\n * - Unix milliseconds as string (13-digit integers)\n /\nfunction parseTimestampMs(ts: string): number \| null {\n // Try ISO 8601\n if (ts.includes(\"T\") \|\| ts.includes(\"-\")) {\n const d = new Date(ts);\n if (!isNaN(d.getTime())) return d.getTime();\n }\n // Try numeric\n const n = parseFloat(ts);\n if (isNaN(n)) return null;\n // Heuristic: if > 1e12, treat as milliseconds; otherwise seconds\n if (n > 1e12) return n;\n return n 1000;\n}\n","/*\n RCAN Time Synchronization — §8.4\n \n All RCAN robots MUST sync their clocks via NTP/NTS before operational mode.\n * Max drift tolerance ±5 seconds.\n /\n\n/* Clock synchronization status returned by checkClockSync() /\nexport interface ClockSyncStatus {\n synchronized: boolean;\n offsetSeconds: number;\n source: string;\n}\n\n/* Thrown by assertClockSynced() when drift exceeds the allowed threshold /\nexport class ClockDriftError extends Error {\n readonly offsetSeconds: number;\n constructor(offsetSeconds: number, maxDriftSeconds: number) {\n super(\n `Clock drift too large: offset=${offsetSeconds.toFixed(3)}s > max=${maxDriftSeconds}s`\n );\n this.name = \"ClockDriftError\";\n this.offsetSeconds = offsetSeconds;\n Object.setPrototypeOf(this, ClockDriftError.prototype);\n }\n}\n\n/\n Check clock synchronization.\n \n In a browser / Node environment without access to chronyc or ntplib, we\n * perform a lightweight sanity check: compare local time against a trusted\n * time source by issuing an HTTP HEAD request and comparing the Date header.\n * Falls back to \"assumed-synced\" when running in environments where network\n * is unavailable (e.g., unit tests).\n \n Returns ClockSyncStatus with:\n * synchronized: whether drift is within ±5s\n * offsetSeconds: measured offset (positive = local is ahead)\n * source: description of what was checked\n /\nexport async function checkClockSync(\n timeServer?: string\n): Promise<ClockSyncStatus> {\n const server = timeServer ?? \"https://worldtimeapi.org/api/ip\";\n\n try {\n const before = Date.now();\n const resp = await fetch(server, { method: \"HEAD\", signal: AbortSignal.timeout(3000) });\n const after = Date.now();\n\n // Use the Date header from the response as a rough time reference\n const dateHeader = resp.headers.get(\"Date\") ?? resp.headers.get(\"date\");\n if (!dateHeader) {\n // No Date header — can't determine offset\n return {\n synchronized: true,\n offsetSeconds: 0,\n source: \"assumed (no Date header)\",\n };\n }\n\n const serverMs = new Date(dateHeader).getTime();\n if (isNaN(serverMs)) {\n return { synchronized: true, offsetSeconds: 0, source: \"assumed (unparseable Date header)\" };\n }\n\n // Use midpoint of request as estimate of server time\n const localMidpoint = (before + after) / 2;\n const offsetSeconds = (localMidpoint - serverMs) / 1000;\n const synchronized = Math.abs(offsetSeconds) <= 5;\n\n return { synchronized, offsetSeconds, source: server };\n } catch {\n // Network unavailable or timeout — assume synced (unit test / offline environment)\n return { synchronized: true, offsetSeconds: 0, source: \"assumed (network unavailable)\" };\n }\n}\n\n/\n Assert that the local clock is synchronized within maxDriftSeconds.\n \n Throws ClockDriftError if the measured offset exceeds the threshold.\n \n @param maxDriftSeconds - Maximum allowed \|offset\| in seconds (default 5)\n /\nexport async function assertClockSynced(maxDriftSeconds = 5): Promise<void> {\n const status = await checkClockSync();\n if (!status.synchronized \|\| Math.abs(status.offsetSeconds) > maxDriftSeconds) {\n throw new ClockDriftError(status.offsetSeconds, maxDriftSeconds);\n }\n}\n","/\n RCAN CONFIG_UPDATE Wire Protocol — §9.2\n \n CONFIG_UPDATE messages MUST carry config_hash, config_version, diff, and\n * rollback. Safety parameter changes MUST have safety_overrides=true AND\n * role: creator JWT.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n return `${Date.now()}-${Math.random().toString(36).slice(2)}`;\n}\n\n/* Compute a simple SHA-256-like hash of the diff for integrity checking. /\nasync function hashDiff(diff: Record<string, unknown>): Promise<string> {\n const text = JSON.stringify(diff, Object.keys(diff).sort());\n if (typeof crypto !== \"undefined\" && crypto.subtle) {\n const encoded = new TextEncoder().encode(text);\n const hashBuf = await crypto.subtle.digest(\"SHA-256\", encoded);\n return Array.from(new Uint8Array(hashBuf))\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\");\n }\n // Fallback: simple FNV-1a hex (not cryptographic but OK for tests)\n let hash = 2166136261;\n for (let i = 0; i < text.length; i++) {\n hash ^= text.charCodeAt(i);\n hash = (hash 16777619) >>> 0;\n }\n return hash.toString(16).padStart(8, \"0\");\n}\n\n/*\n Build a CONFIG_UPDATE RCANMessage.\n \n @param diff - The configuration delta to apply\n * @param scope - Authorization scope (e.g. \"config\")\n * @param rollback - The previous config snapshot for rollback\n * @param target - Target robot URI\n /\nexport async function makeConfigUpdate(\n diff: Record<string, unknown>,\n scope: string,\n rollback: Record<string, unknown>,\n target = \"rcan://local/config\",\n safetyOverrides = false\n): Promise<RCANMessage> {\n const configHash = await hashDiff(diff);\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONFIG_UPDATE\",\n target,\n params: {\n message_type: MessageType.CONFIG,\n diff,\n rollback,\n scope,\n config_hash: configHash,\n safety_overrides: safetyOverrides,\n },\n });\n}\n\n/\n Validate a CONFIG_UPDATE message.\n \n Checks:\n * - params.diff is present\n * - params.config_hash is present\n * - params.rollback is present\n * - if safety_overrides=true, scope must be \"creator\"\n /\nexport function validateConfigUpdate(\n msg: RCANMessage\n): { valid: boolean; reason: string } {\n const p = msg.params;\n\n if (!p.diff \|\| typeof p.diff !== \"object\") {\n return { valid: false, reason: \"missing required field: params.diff\" };\n }\n if (!p.config_hash \|\| typeof p.config_hash !== \"string\") {\n return { valid: false, reason: \"missing required field: params.config_hash\" };\n }\n if (!(\"rollback\" in p)) {\n return { valid: false, reason: \"missing required field: params.rollback\" };\n }\n if (p.safety_overrides === true && p.scope !== \"creator\") {\n return {\n valid: false,\n reason: \"safety_overrides=true requires scope=creator (owner is insufficient)\",\n };\n }\n\n return { valid: true, reason: \"ok\" };\n}\n","/\n RCAN Key Rotation — §8.6\n \n Operators SHOULD maintain a JWKS at /.well-known/rcan-keys.json.\n * Keys MUST include an exp field (max 365-day validity).\n * Rotation: add new key, set exp on old key.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n return `${Date.now()}-${Math.random().toString(36).slice(2)}`;\n}\n\nexport interface JWKEntry {\n kid: string;\n alg: string;\n use: string;\n key_ops?: string[];\n /* Public key material (base64url) /\n x?: string;\n /* Unix timestamp — when this key expires /\n exp?: number;\n /* Unix timestamp — when this key was revoked (optional) /\n revoked_at?: number;\n}\n\nexport interface JWKSDocument {\n keys: JWKEntry[];\n}\n\n/\n KeyStore — in-memory JWKS with rotation support.\n /\nexport class KeyStore {\n private _keys: JWKEntry[] = [];\n\n /* Add a key to the store /\n addKey(entry: JWKEntry): void {\n this._keys.push(entry);\n }\n\n /* Get the current JWKS document (all non-revoked keys) /\n getJWKS(): JWKSDocument {\n return { keys: [...this._keys] };\n }\n\n /* Find a key by kid /\n findKey(kid: string): JWKEntry \| undefined {\n return this._keys.find((k) => k.kid === kid);\n }\n\n /* Check if a key is valid (not expired, not revoked) /\n isKeyValid(kid: string, nowMs?: number): boolean {\n const entry = this.findKey(kid);\n if (!entry) return false;\n const now = (nowMs ?? Date.now()) / 1000;\n if (entry.revoked_at !== undefined && entry.revoked_at <= now) return false;\n if (entry.exp !== undefined && entry.exp < now) return false;\n return true;\n }\n\n /* Mark a key as expired (rotate out) /\n expireKey(kid: string, expiresAt?: number): void {\n const entry = this.findKey(kid);\n if (entry) {\n entry.exp = expiresAt ?? Math.floor(Date.now() / 1000);\n }\n }\n\n /* Revoke a key immediately /\n revokeKey(kid: string): void {\n const entry = this.findKey(kid);\n if (entry) {\n entry.revoked_at = Math.floor(Date.now() / 1000);\n }\n }\n\n /* All valid keys (not expired, not revoked) /\n validKeys(nowMs?: number): JWKEntry[] {\n return this._keys.filter((k) => this.isKeyValid(k.kid, nowMs));\n }\n}\n\n/\n Build a key-rotation RCAN message.\n \n @param newPublicKey - Base64url-encoded new Ed25519 public key\n * @param oldKeyId - kid of the key being rotated out\n * @param overlapSeconds - How long old key remains valid (default: 120)\n * @param target - Target robot URI\n /\nexport function makeKeyRotationMessage(\n newPublicKey: string,\n oldKeyId: string,\n overlapSeconds = 120,\n target = \"rcan://local/keys\"\n): RCANMessage {\n const newKid = generateId().slice(0, 8);\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"KEY_ROTATION\",\n target,\n params: {\n message_type: MessageType.CONFIG,\n new_public_key: newPublicKey,\n new_kid: newKid,\n old_kid: oldKeyId,\n overlap_seconds: overlapSeconds,\n initiated_at: new Date().toISOString(),\n },\n keyId: newKid,\n });\n}\n","/\n RCAN Consent Wire Protocol — §11.2\n \n Three message types:\n * CONSENT_REQUEST (20) — requester asks target's owner for access\n * CONSENT_GRANT (21) — owner approves\n * CONSENT_DENY (22) — owner denies\n \n API mirrors rcan-py consent module exactly (camelCased).\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n return `${Date.now()}-${Math.random().toString(36).slice(2)}`;\n}\n\nexport type ConsentType = \"cross_robot\" \| \"training_data\" \| \"observer\";\n\nexport interface ConsentRequestParams {\n requesterRuri: string;\n requesterOwner: string;\n targetRuri: string;\n requestedScopes: string[];\n durationHours: number;\n justification: string;\n requestId?: string;\n consentType?: ConsentType;\n dataCategories?: string[];\n}\n\nexport interface ConsentResponseParams {\n requestId: string;\n grantedScopes?: string[];\n expiresAt?: string;\n reason?: string;\n}\n\n/\n Build a CONSENT_REQUEST message.\n \n Mirrors rcan-py: build_consent_request()\n /\nexport function makeConsentRequest(params: ConsentRequestParams): RCANMessage {\n const requestId = params.requestId ?? generateId();\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONSENT_REQUEST\",\n target: params.targetRuri,\n params: {\n message_type: MessageType.CONSENT_REQUEST,\n requester_ruri: params.requesterRuri,\n requester_owner: params.requesterOwner,\n target_ruri: params.targetRuri,\n requested_scopes: params.requestedScopes,\n duration_hours: params.durationHours,\n justification: params.justification,\n request_id: requestId,\n consent_type: params.consentType ?? \"cross_robot\",\n data_categories: params.dataCategories ?? [],\n },\n });\n}\n\n/\n Build a CONSENT_GRANT message.\n \n Mirrors rcan-py: build_consent_grant()\n /\nexport function makeConsentGrant(params: ConsentResponseParams): RCANMessage {\n const expiresAt =\n params.expiresAt ?? new Date(Date.now() + 24 3600 * 1000).toISOString();\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONSENT_GRANT\",\n target: \"rcan://local/consent\",\n params: {\n message_type: MessageType.CONSENT_GRANT,\n request_id: params.requestId,\n granted_scopes: params.grantedScopes ?? [],\n expires_at: expiresAt,\n reason: params.reason ?? \"approved\",\n },\n });\n}\n\n/*\n Build a CONSENT_DENY message.\n \n Mirrors rcan-py: build_consent_deny()\n /\nexport function makeConsentDeny(params: ConsentResponseParams): RCANMessage {\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONSENT_DENY\",\n target: \"rcan://local/consent\",\n params: {\n message_type: MessageType.CONSENT_DENY,\n request_id: params.requestId,\n reason: params.reason ?? \"denied\",\n },\n });\n}\n\n/\n Validate a consent message (CONSENT_REQUEST, CONSENT_GRANT, or CONSENT_DENY).\n \n Mirrors rcan-py: verify_consent_signature() (structure check only — JWT\n * signature verification is performed by the auth layer).\n /\nexport function validateConsentMessage(\n msg: RCANMessage\n): { valid: boolean; reason: string } {\n const cmd = msg.cmd;\n const p = msg.params;\n const msgType = p.message_type as number \| undefined;\n\n if (cmd === \"CONSENT_REQUEST\") {\n if (msgType !== MessageType.CONSENT_REQUEST) {\n return { valid: false, reason: \"message_type must be CONSENT_REQUEST (20)\" };\n }\n if (!p.requester_ruri) return { valid: false, reason: \"missing requester_ruri\" };\n if (!p.target_ruri) return { valid: false, reason: \"missing target_ruri\" };\n if (!p.requested_scopes \|\| !Array.isArray(p.requested_scopes) \|\| (p.requested_scopes as string[]).length === 0) {\n return { valid: false, reason: \"requested_scopes must be a non-empty array\" };\n }\n if (!p.request_id) return { valid: false, reason: \"missing request_id\" };\n if (!p.justification) return { valid: false, reason: \"missing justification\" };\n return { valid: true, reason: \"ok\" };\n }\n\n if (cmd === \"CONSENT_GRANT\") {\n if (msgType !== MessageType.CONSENT_GRANT) {\n return { valid: false, reason: \"message_type must be CONSENT_GRANT (21)\" };\n }\n if (!p.request_id) return { valid: false, reason: \"missing request_id\" };\n if (!p.expires_at) return { valid: false, reason: \"missing expires_at\" };\n return { valid: true, reason: \"ok\" };\n }\n\n if (cmd === \"CONSENT_DENY\") {\n if (msgType !== MessageType.CONSENT_DENY) {\n return { valid: false, reason: \"message_type must be CONSENT_DENY (22)\" };\n }\n if (!p.request_id) return { valid: false, reason: \"missing request_id\" };\n return { valid: true, reason: \"ok\" };\n }\n\n return { valid: false, reason: `unknown consent command: ${cmd}` };\n}\n","/\n RCAN Robot Identity Revocation — §13\n \n Registry exposes GET /api/v1/robots/{rrn}/revocation-status.\n * Peers cache results with 1h TTL.\n * ROBOT_REVOCATION (19) broadcast invalidates cached trust material.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nexport type RevocationStatusValue = \"active\" \| \"revoked\" \| \"suspended\";\n\nexport interface RevocationStatus {\n rrn: string;\n status: RevocationStatusValue;\n revokedAt?: string;\n reason?: string;\n authority?: string;\n /* When this cached entry expires /\n cachedUntil?: number;\n}\n\nconst CACHE_TTL_MS = 60 60 * 1000; // 1 hour\n\n/*\n RevocationCache — TTL-based cache for revocation status records.\n /\nexport class RevocationCache {\n private readonly _cache: Map<string, RevocationStatus> = new Map();\n\n /* Get a cached status if still fresh /\n get(rrn: string, nowMs?: number): RevocationStatus \| undefined {\n const entry = this._cache.get(rrn);\n if (!entry) return undefined;\n const now = nowMs ?? Date.now();\n if (entry.cachedUntil !== undefined && entry.cachedUntil < now) {\n this._cache.delete(rrn);\n return undefined;\n }\n return entry;\n }\n\n /* Store a status record with a 1h TTL /\n set(status: RevocationStatus, nowMs?: number): void {\n const now = nowMs ?? Date.now();\n this._cache.set(status.rrn, {\n ...status,\n cachedUntil: now + CACHE_TTL_MS,\n });\n }\n\n /* Invalidate a cached entry immediately /\n invalidate(rrn: string): void {\n this._cache.delete(rrn);\n }\n\n /* Number of cached entries /\n get size(): number {\n return this._cache.size;\n }\n}\n\n/\n Check the revocation status of a robot via the registry REST API.\n * Caches results for 1 hour.\n \n @param rrn - Robot Registry Number\n * @param registryUrl - Base URL of the registry (e.g. \"https://registry.rcan.dev\")\n * @param cache - Optional RevocationCache to use (creates ephemeral one if not provided)\n /\nexport async function checkRevocation(\n rrn: string,\n registryUrl: string,\n cache?: RevocationCache\n): Promise<RevocationStatus> {\n const c = cache ?? new RevocationCache();\n\n // Check cache first\n const cached = c.get(rrn);\n if (cached) return cached;\n\n const url = `${registryUrl.replace(/\\/$/, \"\")}/api/v1/robots/${encodeURIComponent(rrn)}/revocation-status`;\n\n try {\n const resp = await fetch(url, { signal: AbortSignal.timeout(5000) });\n if (!resp.ok) {\n // Treat non-200 as unable to determine — return active (fail-open, log separately)\n const status: RevocationStatus = { rrn, status: \"active\", reason: `registry returned ${resp.status}` };\n c.set(status);\n return status;\n }\n const data = (await resp.json()) as Partial<RevocationStatus>;\n const status: RevocationStatus = {\n rrn,\n status: (data.status as RevocationStatusValue) ?? \"active\",\n revokedAt: data.revokedAt,\n reason: data.reason,\n authority: data.authority,\n };\n c.set(status);\n return status;\n } catch {\n // Network unavailable — assume active (offline mode)\n const status: RevocationStatus = { rrn, status: \"active\", reason: \"network unavailable\" };\n return status;\n }\n}\n\n/\n Build a ROBOT_REVOCATION broadcast message.\n \n @param rrn - The RRN being revoked\n * @param reason - Human-readable revocation reason\n /\nexport function makeRevocationBroadcast(\n rrn: string,\n reason: string\n): RCANMessage {\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"ROBOT_REVOCATION\",\n target: \"rcan://broadcast/revocation\",\n params: {\n message_type: MessageType.ROBOT_REVOCATION,\n rrn,\n reason,\n revoked_at: new Date().toISOString(),\n },\n });\n}\n","/\n RCAN Training Data Consent — §17\n \n Any TRAINING_DATA collection involving biometric/audio/visual data MUST\n * first obtain a DATA_CONSENT token via CONSENT_REQUEST with\n * consent_type: \"training_data\".\n \n EU AI Act Annex III §5 compliance.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { makeConsentRequest, makeConsentGrant, makeConsentDeny } from \"./consent.js\";\nimport { SPEC_VERSION } from \"./version.js\";\nimport type { ConsentResponseParams } from \"./consent.js\";\n\n/* §17 — Data categories that require training consent /\nexport enum DataCategory {\n VIDEO = \"video\",\n AUDIO = \"audio\",\n LOCATION = \"location\",\n BIOMETRIC = \"biometric\",\n TELEMETRY = \"telemetry\",\n}\n\nexport interface TrainingConsentRequestParams {\n requesterRuri: string;\n requesterOwner: string;\n targetRuri: string;\n dataCategories: DataCategory[];\n durationHours: number;\n justification: string;\n requestId?: string;\n}\n\n/\n Build a training-data consent request.\n * Sets consent_type: \"training_data\" automatically.\n \n Mirrors rcan-py: request_training_consent()\n /\nexport function makeTrainingConsentRequest(\n params: TrainingConsentRequestParams\n): RCANMessage {\n return makeConsentRequest({\n requesterRuri: params.requesterRuri,\n requesterOwner: params.requesterOwner,\n targetRuri: params.targetRuri,\n requestedScopes: [\"training_data\"],\n durationHours: params.durationHours,\n justification: params.justification,\n requestId: params.requestId,\n consentType: \"training_data\",\n dataCategories: params.dataCategories,\n });\n}\n\n/\n Build a training-data consent grant.\n \n Mirrors rcan-py: build_consent_grant() for training scope.\n /\nexport function makeTrainingConsentGrant(\n params: ConsentResponseParams\n): RCANMessage {\n return makeConsentGrant(params);\n}\n\n/\n Build a training-data consent denial.\n \n Mirrors rcan-py: build_consent_deny() for training scope.\n /\nexport function makeTrainingConsentDeny(\n params: ConsentResponseParams\n): RCANMessage {\n return makeConsentDeny(params);\n}\n\n/\n Validate that a TRAINING_DATA message carries a consent_token.\n \n A TRAINING_DATA message without consent_token MUST be rejected.\n /\nexport function validateTrainingDataMessage(\n msg: RCANMessage\n): { valid: boolean; reason: string } {\n if (msg.params.message_type !== MessageType.TRAINING_DATA) {\n return { valid: false, reason: \"not a TRAINING_DATA message\" };\n }\n const token = msg.params.consent_token;\n if (!token \|\| typeof token !== \"string\" \|\| token.trim() === \"\") {\n return {\n valid: false,\n reason: \"TRAINING_DATA message missing consent_token (§17)\",\n };\n }\n return { valid: true, reason: \"ok\" };\n}\n","/\n RCAN Offline Operation Mode — §14\n \n Robots MUST cache registry public keys locally (max TTL 24h).\n * Owner-role tokens accepted from local network when registry unreachable.\n * Cross-owner commands blocked after offline_cross_owner_grace_s (default 3600s).\n * ESTOP is ALWAYS accepted in offline mode per Protocol 66 safety invariants.\n /\n\nimport type { SafetyMessage } from \"./safety.js\";\n\nconst SAFETY_MESSAGE_TYPE = 6;\nconst DEFAULT_CROSS_OWNER_GRACE_S = 3600;\nconst DEFAULT_KEY_TTL_S = 86400;\n\nexport interface OfflineState {\n isOffline: boolean;\n offlineSinceMs?: number;\n localNetwork: boolean;\n}\n\nexport interface OfflineCommandResult {\n allowed: boolean;\n reason: string;\n}\n\nexport interface CachedKey {\n kid: string;\n publicKey: string;\n cachedAtMs: number;\n ttlSeconds: number;\n}\n\n/\n OfflineModeManager — controls what commands are accepted when offline.\n \n Protocol 66 invariants respected:\n * - ESTOP is ALWAYS allowed, regardless of offline mode\n * - Owner-level commands from local network: allowed within grace period\n * - Cross-owner commands: blocked after crossOwnerGraceS\n /\nexport class OfflineModeManager {\n private readonly crossOwnerGraceS: number;\n private readonly keyTtlS: number;\n private _cachedKeys: CachedKey[] = [];\n\n constructor(\n crossOwnerGraceS: number = DEFAULT_CROSS_OWNER_GRACE_S,\n keyTtlS: number = DEFAULT_KEY_TTL_S\n ) {\n this.crossOwnerGraceS = crossOwnerGraceS;\n this.keyTtlS = keyTtlS;\n }\n\n /\n Determine whether a command can be accepted in the current offline state.\n \n @param msg - The incoming message (SafetyMessage or plain object with message_type)\n * @param isOffline - Whether we are currently in offline mode\n * @param localNetwork - Whether the sender is on the local network\n * @param isOwner - Whether the sender has owner-level role (validated locally)\n * @param isCrossOwner - Whether this is a cross-owner (non-same-owner) command\n * @param nowMs - Optional current time in ms (for testing)\n /\n canAcceptCommand(\n msg: { message_type?: number; safety_event?: string } \| null,\n isOffline: boolean,\n localNetwork: boolean,\n isOwner = true,\n isCrossOwner = false,\n offlineSinceMs?: number,\n nowMs?: number\n ): OfflineCommandResult {\n // Protocol 66: ESTOP is ALWAYS allowed\n if (\n msg &&\n msg.message_type === SAFETY_MESSAGE_TYPE &&\n msg.safety_event === \"ESTOP\"\n ) {\n return { allowed: true, reason: \"ESTOP always accepted (Protocol 66)\" };\n }\n\n if (!isOffline) {\n return { allowed: true, reason: \"online mode\" };\n }\n\n // Offline mode\n if (!localNetwork) {\n return {\n allowed: false,\n reason: \"offline mode: cross-network commands blocked\",\n };\n }\n\n if (!isOwner) {\n return {\n allowed: false,\n reason: \"offline mode: only owner-role commands accepted from local network\",\n };\n }\n\n // Cross-owner grace period check\n if (isCrossOwner && offlineSinceMs !== undefined) {\n const now = nowMs ?? Date.now();\n const offlineSeconds = (now - offlineSinceMs) / 1000;\n if (offlineSeconds > this.crossOwnerGraceS) {\n return {\n allowed: false,\n reason: `offline mode: cross-owner grace period expired (${Math.round(offlineSeconds)}s > ${this.crossOwnerGraceS}s)`,\n };\n }\n }\n\n return {\n allowed: true,\n reason: \"offline mode: owner command on local network accepted\",\n };\n }\n\n /* Cache a public key for offline use /\n cacheKey(entry: Omit<CachedKey, \"cachedAtMs\" \| \"ttlSeconds\">, nowMs?: number): void {\n const now = nowMs ?? Date.now();\n // Remove existing entry for same kid\n this._cachedKeys = this._cachedKeys.filter((k) => k.kid !== entry.kid);\n this._cachedKeys.push({\n ...entry,\n cachedAtMs: now,\n ttlSeconds: this.keyTtlS,\n });\n }\n\n /* Get a cached public key if still valid /\n getCachedKey(kid: string, nowMs?: number): CachedKey \| undefined {\n const now = nowMs ?? Date.now();\n const entry = this._cachedKeys.find((k) => k.kid === kid);\n if (!entry) return undefined;\n const age = (now - entry.cachedAtMs) / 1000;\n if (age > entry.ttlSeconds) {\n this._cachedKeys = this._cachedKeys.filter((k) => k.kid !== kid);\n return undefined;\n }\n return entry;\n }\n\n /* Protocol 66 manifest fields for offline mode /\n getManifestFields(\n offlineSinceMs?: number,\n nowMs?: number\n ): { offline_mode: boolean; offline_since_s: number } {\n if (offlineSinceMs === undefined) {\n return { offline_mode: false, offline_since_s: 0 };\n }\n const now = nowMs ?? Date.now();\n return {\n offline_mode: true,\n offline_since_s: Math.round((now - offlineSinceMs) / 1000),\n };\n }\n}\n","/\n RCAN Structured Fault Reporting — §16\n \n FAULT_REPORT (26) carries structured information about robot faults.\n * Safety-affecting faults MUST update Protocol 66 manifest.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nexport type FaultSeverity = \"info\" \| \"warning\" \| \"error\" \| \"critical\";\n\n/* Standard fault code taxonomy — prefixed by subsystem /\nexport enum FaultCode {\n // Sensor subsystem\n SENSOR_PROXIMITY_FAILURE = \"SENSOR_PROXIMITY_FAILURE\",\n SENSOR_CAMERA_FAILURE = \"SENSOR_CAMERA_FAILURE\",\n SENSOR_IMU_FAILURE = \"SENSOR_IMU_FAILURE\",\n // Motor subsystem\n MOTOR_OVERCURRENT = \"MOTOR_OVERCURRENT\",\n MOTOR_OVERTEMP = \"MOTOR_OVERTEMP\",\n MOTOR_STALL = \"MOTOR_STALL\",\n // Battery subsystem\n BATTERY_CRITICAL = \"BATTERY_CRITICAL\",\n BATTERY_LOW = \"BATTERY_LOW\",\n // Network subsystem\n NETWORK_TIMEOUT = \"NETWORK_TIMEOUT\",\n NETWORK_REGISTRY_UNREACHABLE = \"NETWORK_REGISTRY_UNREACHABLE\",\n // Safety subsystem\n SAFETY_ESTOP_STUCK = \"SAFETY_ESTOP_STUCK\",\n SAFETY_WATCHDOG_TIMEOUT = \"SAFETY_WATCHDOG_TIMEOUT\",\n // Generic\n UNKNOWN = \"UNKNOWN\",\n}\n\nexport interface FaultReportParams {\n faultCode: FaultCode \| string;\n severity: FaultSeverity;\n subsystem: string;\n affectsSafety: boolean;\n safeToContinue: boolean;\n description?: string;\n target?: string;\n}\n\n/\n Build a FAULT_REPORT message.\n \n Mirrors rcan-py: make_fault_report()\n /\nexport function makeFaultReport(params: FaultReportParams): RCANMessage {\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"FAULT_REPORT\",\n target: params.target ?? \"rcan://local/fault\",\n params: {\n message_type: MessageType.FAULT_REPORT,\n fault_code: params.faultCode,\n severity: params.severity,\n subsystem: params.subsystem,\n affects_safety: params.affectsSafety,\n safe_to_continue: params.safeToContinue,\n description: params.description ?? \"\",\n reported_at: new Date().toISOString(),\n },\n });\n}\n\n/* §16 — Audit export request interface /\nexport interface AuditExportRequest {\n from: Date;\n to: Date;\n format: \"jsonl\" \| \"csv\";\n robotRrn?: string;\n}\n","/\n rcan/identity — RCAN v2.1 Role-Based Access Control and Identity.\n \n Defines the seven-level role hierarchy (§2), JWT claim parsing, scope\n * validation, and identity record types.\n \n Roles (v2.1):\n * GUEST (JWT 1) — read-only, anonymous\n * OPERATOR (JWT 2) — operational control\n * CONTRIBUTOR (JWT 2.5) — idle compute donation scope\n * ADMIN (JWT 3) — configuration, user management\n * M2M_PEER (JWT 4) — robot-to-robot; issued by ADMIN\n * CREATOR (JWT 5) — full hardware/software control\n * M2M_TRUSTED (JWT 6) — fleet orchestration; RRF-issued only\n \n Spec: §2 — Role-Based Access Control\n /\n\n// ---------------------------------------------------------------------------\n// Role enum (v2.1)\n// ---------------------------------------------------------------------------\n\n/* RCAN v2.1 role hierarchy. Use ROLE_JWT_LEVEL to map to JWT level values. /\nexport enum Role {\n GUEST = 1,\n OPERATOR = 2,\n CONTRIBUTOR = 3, // JWT level 2.5\n ADMIN = 4, // JWT level 3\n M2M_PEER = 5, // JWT level 4\n CREATOR = 6, // JWT level 5\n M2M_TRUSTED = 7, // JWT level 6 — RRF-issued only\n}\n\n/* @deprecated Use Role instead. Kept for v1.x backward compatibility. /\nexport const LevelOfAssurance = Role;\n// eslint-disable-next-line @typescript-eslint/no-redeclare\nexport type LevelOfAssurance = Role;\n\n/* Maps Role enum value to JWT rcan_role level (fractional for CONTRIBUTOR). /\nexport const ROLE_JWT_LEVEL: Record<Role, number> = {\n [Role.GUEST]: 1.0,\n [Role.OPERATOR]: 2.0,\n [Role.CONTRIBUTOR]: 2.5,\n [Role.ADMIN]: 3.0,\n [Role.M2M_PEER]: 4.0,\n [Role.CREATOR]: 5.0,\n [Role.M2M_TRUSTED]: 6.0,\n};\n\nconst JWT_LEVEL_TO_ROLE: Map<number, Role> = new Map(\n (Object.entries(ROLE_JWT_LEVEL) as [string, number][]).map(\n ([role, level]) => [level, Number(role) as Role]\n )\n);\n\n/* Return the Role for a JWT rcan_role numeric level, or undefined. /\nexport function roleFromJwtLevel(level: number): Role \| undefined {\n return JWT_LEVEL_TO_ROLE.get(level);\n}\n\n// ---------------------------------------------------------------------------\n// Scope → minimum role mapping\n// ---------------------------------------------------------------------------\n\nexport const SCOPE_MIN_ROLE: Record<string, Role> = {\n \"status\": Role.GUEST,\n \"discover\": Role.GUEST,\n \"chat\": Role.GUEST,\n \"observer\": Role.GUEST,\n \"contribute\": Role.CONTRIBUTOR,\n \"control\": Role.OPERATOR,\n \"teleop\": Role.OPERATOR,\n \"training\": Role.ADMIN,\n \"training_data\": Role.ADMIN,\n \"config\": Role.ADMIN,\n \"authority\": Role.ADMIN,\n \"admin\": Role.CREATOR,\n \"safety\": Role.CREATOR,\n \"estop\": Role.CREATOR,\n \"fleet.trusted\": Role.M2M_TRUSTED,\n};\n\n// ---------------------------------------------------------------------------\n// Identity record\n// ---------------------------------------------------------------------------\n\nexport interface IdentityRecord {\n /* Subject identifier (UUID, RRN, or orchestrator id). /\n sub: string;\n /* RCAN v2.1 Role. /\n role: Role;\n /* JWT-level value for this role. /\n jwtLevel: number;\n /* Registry that issued this identity. /\n registryUrl?: string;\n /* Granted scopes. /\n scopes: string[];\n /* UTC ISO-8601 timestamp of most recent verification. /\n verifiedAt?: string;\n /* For M2M_PEER tokens — the authorized peer's RRN. /\n peerRrn?: string;\n /* For M2M_TRUSTED tokens — explicit fleet allowlist. /\n fleetRrns?: string[];\n}\n\nexport function isM2mIdentity(identity: IdentityRecord): boolean {\n return identity.role === Role.M2M_PEER \|\| identity.role === Role.M2M_TRUSTED;\n}\n\n// ---------------------------------------------------------------------------\n// LoA Policy (v2.1)\n// ---------------------------------------------------------------------------\n\nexport interface LoaPolicy {\n minRoleForDiscover: Role;\n minRoleForStatus: Role;\n minRoleForChat: Role;\n minRoleForControl: Role;\n minRoleForSafety: Role;\n}\n\n/* Backward-compatible default policy — every scope accepts GUEST callers. /\nexport const DEFAULT_LOA_POLICY: LoaPolicy = {\n minRoleForDiscover: Role.GUEST,\n minRoleForStatus: Role.GUEST,\n minRoleForChat: Role.GUEST,\n minRoleForControl: Role.GUEST,\n minRoleForSafety: Role.GUEST,\n};\n\n/* Production-hardened policy — control needs OPERATOR, safety needs CREATOR. /\nexport const PRODUCTION_LOA_POLICY: LoaPolicy = {\n minRoleForDiscover: Role.GUEST,\n minRoleForStatus: Role.GUEST,\n minRoleForChat: Role.GUEST,\n minRoleForControl: Role.OPERATOR,\n minRoleForSafety: Role.CREATOR,\n};\n\n// ---------------------------------------------------------------------------\n// JWT helpers\n// ---------------------------------------------------------------------------\n\nfunction decodeJwtPayload(token: string): Record<string, unknown> \| null {\n try {\n const parts = token.split('.');\n if (parts.length < 2) return null;\n const payloadB64 = (parts[1] ?? '').replace(/-/g, '+').replace(/_/g, '/');\n const padded = payloadB64 + '='.repeat((4 - payloadB64.length % 4) % 4);\n return JSON.parse(atob(padded)) as Record<string, unknown>;\n } catch {\n return null;\n }\n}\n\n/\n Parse an RCAN v2.1 JWT and return the Role.\n \n Reads `rcan_role` (v2.1) with fallback to `loa` (v1.x).\n * Defaults to GUEST on parse failure.\n /\nexport function extractRoleFromJwt(token: string): Role {\n const payload = decodeJwtPayload(token);\n if (!payload) return Role.GUEST;\n\n // v2.1: rcan_role (float level)\n const rcanRole = payload['rcan_role'];\n if (rcanRole !== undefined && rcanRole !== null) {\n const role = roleFromJwtLevel(Number(rcanRole));\n if (role !== undefined) return role;\n }\n\n // v1.x fallback: loa (integer)\n const loa = payload['loa'];\n if (loa !== undefined && loa !== null) {\n const role = roleFromJwtLevel(Number(loa));\n if (role !== undefined) return role;\n }\n\n return Role.GUEST;\n}\n\n/* @deprecated Use extractRoleFromJwt. Kept for v1.x backward compatibility. /\nexport function extractLoaFromJwt(token: string): Role {\n return extractRoleFromJwt(token);\n}\n\n/\n Parse an RCAN v2.1 JWT and return a full IdentityRecord.\n \n Does NOT verify the JWT signature.\n /\nexport function extractIdentityFromJwt(token: string): IdentityRecord {\n const payload = decodeJwtPayload(token);\n if (!payload) {\n return { sub: '', role: Role.GUEST, jwtLevel: 1, scopes: [] };\n }\n\n const rcanRole = payload['rcan_role'];\n const loa = payload['loa'];\n const rawLevel = rcanRole !== undefined ? Number(rcanRole) : loa !== undefined ? Number(loa) : 1;\n const role = roleFromJwtLevel(rawLevel) ?? Role.GUEST;\n\n const scopes = Array.isArray(payload['rcan_scopes'])\n ? (payload['rcan_scopes'] as string[])\n : Array.isArray(payload['scopes'])\n ? (payload['scopes'] as string[])\n : [];\n\n return {\n sub: String(payload['sub'] ?? ''),\n role,\n jwtLevel: ROLE_JWT_LEVEL[role],\n registryUrl: payload['registry_url'] as string \| undefined,\n scopes,\n verifiedAt: payload['verified_at'] as string \| undefined,\n peerRrn: payload['peer_rrn'] as string \| undefined,\n fleetRrns: Array.isArray(payload['fleet_rrns'])\n ? (payload['fleet_rrns'] as string[])\n : undefined,\n };\n}\n\n// ---------------------------------------------------------------------------\n// Scope validation\n// ---------------------------------------------------------------------------\n\nexport interface ScopeValidationResult {\n ok: boolean;\n reason: string;\n}\n\n/\n Check whether `role` meets the minimum requirement for `scope`.\n /\nexport function validateRoleForScope(role: Role, scope: string): ScopeValidationResult {\n const required = SCOPE_MIN_ROLE[scope.toLowerCase()];\n if (required === undefined) {\n // Unknown scope — apply OPERATOR as a safe default\n if (role >= Role.OPERATOR) return { ok: true, reason: '' };\n return {\n ok: false,\n reason: `Unknown scope '${scope}': applying OPERATOR minimum. Caller has ${Role[role]}.`,\n };\n }\n if (role >= required) return { ok: true, reason: '' };\n return {\n ok: false,\n reason: `Scope '${scope}' requires ${Role[required]} (JWT level ${ROLE_JWT_LEVEL[required]}), but caller has ${Role[role]} (JWT level ${ROLE_JWT_LEVEL[role]})`,\n };\n}\n\n/* @deprecated Use validateRoleForScope. /\nexport function validateLoaForScope(role: Role, scope: string): ScopeValidationResult {\n return validateRoleForScope(role, scope);\n}\n","/\n RCAN Federation — cross-registry trust and sync (GAP-16).\n \n Provides:\n * - Registry tier model (root / authoritative / community)\n * - TrustAnchorCache with 24-hour TTL and DNS-TXT discovery\n * - JWT verification against a trusted registry\n * - Cross-registry command validation (LoA ≥ 2 required; ESTOP always allowed)\n /\n\nimport { RCANMessage, MessageType } from './message.js';\nimport { Role, LevelOfAssurance, extractLoaFromJwt } from './identity.js';\n\n// ── Enums & interfaces ────────────────────────────────────────────────────────\n\nexport enum RegistryTier {\n ROOT = 'root',\n AUTHORITATIVE = 'authoritative',\n COMMUNITY = 'community',\n}\n\nexport enum FederationSyncType {\n CONSENT = 'consent',\n REVOCATION = 'revocation',\n KEY = 'key',\n}\n\nexport interface RegistryIdentity {\n registryUrl: string;\n tier: RegistryTier;\n publicKeyPem: string;\n domain: string;\n verifiedAt?: string;\n}\n\nexport interface FederationSyncPayload {\n sourceRegistry: string;\n targetRegistry: string;\n syncType: FederationSyncType;\n payload: Record<string, unknown>;\n signature: string;\n}\n\n// ── TrustAnchorCache ──────────────────────────────────────────────────────────\n\nconst CACHE_TTL_MS = 24 60 * 60 * 1000; // 24 hours\n\ninterface CacheEntry {\n identity: RegistryIdentity;\n expiresAt: number;\n}\n\n/*\n In-memory cache of trusted registry identities.\n \n Entries expire after 24 hours. Discovery via DNS TXT records\n * (_rcan-registry.<domain>) is supported in Node.js environments.\n /\nexport class TrustAnchorCache {\n private readonly store = new Map<string, CacheEntry>();\n\n /* Store or refresh a registry identity. /\n set(identity: RegistryIdentity): void {\n this.store.set(identity.registryUrl, {\n identity,\n expiresAt: Date.now() + CACHE_TTL_MS,\n });\n }\n\n /\n Look up a registry URL.\n * Returns undefined when absent or when the TTL has expired.\n /\n lookup(url: string): RegistryIdentity \| undefined {\n const entry = this.store.get(url);\n if (!entry) return undefined;\n if (Date.now() > entry.expiresAt) {\n this.store.delete(url);\n return undefined;\n }\n return entry.identity;\n }\n\n /\n Discover a registry via DNS TXT record `_rcan-registry.<domain>`.\n \n The TXT record is expected to contain a JSON object with the\n * RegistryIdentity fields. Returns the identity and caches it.\n \n Node.js only — returns undefined in environments without `dns.promises`.\n /\n async discoverViaDns(domain: string): Promise<RegistryIdentity \| undefined> {\n const hostname = `_rcan-registry.${domain}`;\n let records: string[][];\n\n try {\n // Dynamic require keeps this tree-shakable and browser-safe\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n const dnsModule = require('dns') as { promises: { resolveTxt: (h: string) => Promise<string[][]> } };\n records = await dnsModule.promises.resolveTxt(hostname);\n } catch {\n return undefined;\n }\n\n // Flatten the chunked TXT records into a single string per record\n for (const record of records) {\n const text = record.join('');\n try {\n const parsed = JSON.parse(text) as Partial<RegistryIdentity>;\n if (\n parsed.registryUrl &&\n parsed.tier &&\n parsed.publicKeyPem &&\n parsed.domain\n ) {\n const identity: RegistryIdentity = {\n registryUrl: parsed.registryUrl,\n tier: parsed.tier,\n publicKeyPem: parsed.publicKeyPem,\n domain: parsed.domain,\n verifiedAt: new Date().toISOString(),\n };\n this.set(identity);\n return identity;\n }\n } catch {\n // not JSON — skip\n }\n }\n return undefined;\n }\n\n /\n Verify a JWT was issued by the registry at `url`.\n \n Validates the `iss` claim and checks the registry is in the trust cache.\n * Full cryptographic signature verification requires the registry's public\n * key material — callers should perform additional checks using `publicKeyPem`\n * from the returned identity.\n /\n async verifyRegistryJwt(\n token: string,\n url: string,\n ): Promise<RegistryIdentity> {\n const identity = this.lookup(url);\n if (!identity) {\n throw new Error(`REGISTRY_UNKNOWN: ${url} is not in the trust cache`);\n }\n\n // Decode claims (structural check — no crypto signature here)\n let iss: string \| undefined;\n try {\n const parts = token.split('.');\n const payloadB64 = (parts[1] ?? '').replace(/-/g, '+').replace(/_/g, '/');\n const padded = payloadB64 + '='.repeat((4 - (payloadB64.length % 4)) % 4);\n let json: string;\n if (typeof atob !== 'undefined') {\n json = atob(padded);\n } else {\n json = Buffer.from(padded, 'base64').toString('utf-8');\n }\n const claims = JSON.parse(json) as Record<string, unknown>;\n iss = typeof claims['iss'] === 'string' ? claims['iss'] : undefined;\n } catch {\n throw new Error('REGISTRY_JWT_MALFORMED: cannot decode token payload');\n }\n\n if (iss !== url) {\n throw new Error(\n `REGISTRY_JWT_ISS_MISMATCH: expected iss=${url}, got iss=${iss ?? '(none)'}`,\n );\n }\n\n return identity;\n }\n}\n\n// ── Factory helpers ───────────────────────────────────────────────────────────\n\nfunction generateId(): string {\n if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n return crypto.randomUUID();\n }\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = ((bytes[6] ?? 0) & 0x0f) \| 0x40;\n bytes[8] = ((bytes[8] ?? 0) & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, '0'));\n return `${hex.slice(0, 4).join('')}-${hex.slice(4, 6).join('')}-${hex.slice(6, 8).join('')}-${hex.slice(8, 10).join('')}-${hex.slice(10).join('')}`;\n}\n\n/*\n Build a FEDERATION_SYNC message (MessageType 12).\n /\nexport function makeFederationSync(\n source: string,\n target: string,\n syncType: FederationSyncType,\n payload: FederationSyncPayload,\n): RCANMessage {\n return new RCANMessage({\n rcan: '2.1.0',\n rcanVersion: '2.1.0',\n cmd: 'federation_sync',\n target,\n params: {\n msg_type: MessageType.FLEET_COMMAND,\n msg_id: generateId(),\n source_registry: source,\n target_registry: target,\n sync_type: syncType,\n payload,\n },\n timestamp: new Date().toISOString(),\n });\n}\n\n// ── Cross-registry command validation ────────────────────────────────────────\n\n/\n Validate a cross-registry command against the local trust anchor cache.\n \n Rules:\n * - ESTOP (SAFETY type 6 or cmd=estop) always returns valid (P66 invariant).\n * - All other cross-registry commands require LoA ≥ 2 (EMAIL_VERIFIED).\n * - If the message originates from `localRegistry` it is not cross-registry.\n /\nexport async function validateCrossRegistryCommand(\n msg: RCANMessage,\n localRegistry: string,\n trustCache: TrustAnchorCache,\n): Promise<{ valid: boolean; reason: string }> {\n // P66: ESTOP is never blocked\n const msgType = msg.params?.['msg_type'];\n const isEstop =\n msgType === MessageType.SAFETY \|\|\n msgType === 6 \|\|\n msg.cmd === 'estop' \|\|\n msg.cmd === 'ESTOP';\n\n if (isEstop) {\n return { valid: true, reason: 'ESTOP always permitted (P66 invariant)' };\n }\n\n // Extract source registry from params\n const sourceRegistry = (msg.params?.['source_registry'] as string \| undefined) ??\n (msg.params?.['from_registry'] as string \| undefined);\n\n if (!sourceRegistry \|\| sourceRegistry === localRegistry) {\n // Local message — not cross-registry\n return { valid: true, reason: 'local registry; no federation check needed' };\n }\n\n // Must be a known trust anchor\n const identity = trustCache.lookup(sourceRegistry);\n if (!identity) {\n return {\n valid: false,\n reason: `REGISTRY_UNKNOWN: ${sourceRegistry} is not in the local trust cache`,\n };\n }\n\n // Check LoA — prefer JWT in params, fall back to message loa field\n let loa: LevelOfAssurance = Role.GUEST;\n const registryJwt = msg.params?.['registry_jwt'] as string \| undefined;\n if (registryJwt) {\n loa = extractLoaFromJwt(registryJwt);\n } else if (typeof msg.loa === 'number') {\n loa = msg.loa as LevelOfAssurance;\n }\n\n if (loa < Role.OPERATOR) {\n return {\n valid: false,\n reason: `LOA_INSUFFICIENT: cross-registry commands require LoA>=2 (OPERATOR), got role=${loa}`,\n };\n }\n\n return { valid: true, reason: 'cross-registry command accepted' };\n}\n","/\n RCAN Constrained-Transport Encodings — GAP-17.\n \n Provides compact JSON, 32-byte minimal (ESTOP-only), BLE frame fragmentation,\n * and a transport-selection helper. No external runtime dependencies.\n /\n\nimport { RCANMessage } from './message.js';\n\n// ── Error ─────────────────────────────────────────────────────────────────────\n\nexport class TransportError extends Error {\n constructor(message: string) {\n super(message);\n this.name = 'TransportError';\n Object.setPrototypeOf(this, TransportError.prototype);\n }\n}\n\n// ── Enum ──────────────────────────────────────────────────────────────────────\n\nexport enum TransportEncoding {\n HTTP = 'http',\n COMPACT = 'compact',\n MINIMAL = 'minimal',\n BLE = 'ble',\n}\n\n// ── Compact encoding ──────────────────────────────────────────────────────────\n\n/\n Abbreviated field name map (full → short).\n \n msg_type → t, msg_id → i, timestamp → ts,\n * from_rrn → f, to_rrn → to, scope → s,\n * payload → p, signature → sig\n /\nconst COMPACT_ENCODE: Record<string, string> = {\n msg_type: 't',\n msg_id: 'i',\n timestamp: 'ts',\n from_rrn: 'f',\n to_rrn: 'to',\n scope: 's',\n payload: 'p',\n signature: 'sig',\n};\n\nconst COMPACT_DECODE: Record<string, string> = Object.fromEntries(\n Object.entries(COMPACT_ENCODE).map(([k, v]) => [v, k]),\n);\n\n/* Serialize a RCANMessage to compact JSON bytes. /\nexport function encodeCompact(message: RCANMessage): Uint8Array {\n const full = message.toJSON();\n const compact: Record<string, unknown> = {};\n\n for (const [key, value] of Object.entries(full)) {\n const short = COMPACT_ENCODE[key];\n compact[short ?? key] = value;\n }\n\n // Also abbreviate top-level RCAN-specific fields used in params\n if (compact['p'] && typeof compact['p'] === 'object') {\n const params = compact['p'] as Record<string, unknown>;\n const compactParams: Record<string, unknown> = {};\n for (const [k, v] of Object.entries(params)) {\n const short = COMPACT_ENCODE[k];\n compactParams[short ?? k] = v;\n }\n compact['p'] = compactParams;\n }\n\n const json = JSON.stringify(compact);\n const encoder = new TextEncoder();\n return encoder.encode(json);\n}\n\n/* Deserialize compact JSON bytes to a RCANMessage. /\nexport function decodeCompact(data: Uint8Array): RCANMessage {\n const decoder = new TextDecoder();\n const json = decoder.decode(data);\n const compact = JSON.parse(json) as Record<string, unknown>;\n\n // Expand abbreviated keys back to full names\n const full: Record<string, unknown> = {};\n for (const [key, value] of Object.entries(compact)) {\n const long = COMPACT_DECODE[key];\n full[long ?? key] = value;\n }\n\n // Expand params too\n if (full['payload'] && typeof full['payload'] === 'object') {\n const params = full['payload'] as Record<string, unknown>;\n const expandedParams: Record<string, unknown> = {};\n for (const [k, v] of Object.entries(params)) {\n const long = COMPACT_DECODE[k];\n expandedParams[long ?? k] = v;\n }\n full['payload'] = expandedParams;\n }\n\n // Map compact top-level fields to RCANMessage constructor fields\n return new RCANMessage({\n rcan: (full['rcan'] as string \| undefined) ?? '1.6',\n rcanVersion: (full['rcanVersion'] as string \| undefined),\n cmd: (full['cmd'] as string),\n target: (full['target'] as string),\n params: (full['params'] as Record<string, unknown>) ?? (full['payload'] as Record<string, unknown>) ?? {},\n timestamp: (full['timestamp'] as string \| undefined),\n confidence: (full['confidence'] as number \| undefined),\n signature: (full['signature'] as import('./message.js').SignatureBlock \| undefined),\n });\n}\n\n// ── Minimal encoding (32 bytes, ESTOP only) ───────────────────────────────────\n\nconst MINIMAL_SIZE = 32;\nconst SAFETY_TYPE = 6;\n\n/\n Hash a UTF-8 string using SHA-256 (Web Crypto API, built-in Node 18+).\n * Returns the raw 32-byte digest.\n /\nasync function sha256Bytes(input: string): Promise<Uint8Array> {\n const encoded = new TextEncoder().encode(input);\n const ab = new ArrayBuffer(encoded.byteLength);\n new Uint8Array(ab).set(encoded);\n // Use globalThis.crypto (Node 18+) or fall back to node:crypto webcrypto\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const subtle: SubtleCrypto = (globalThis as any).crypto?.subtle\n ?? (await import('node:crypto' as string)).webcrypto.subtle;\n const hashBuffer = await subtle.digest('SHA-256', ab);\n return new Uint8Array(hashBuffer);\n}\n\n/\n Encode a SAFETY (type 6) message to a 32-byte minimal frame.\n \n Layout: [2B type][8B from_hash][8B to_hash][4B unix32][8B sig_truncated][2B checksum]\n \n - Only SAFETY (type 6) messages are accepted; throws `TransportError` for others.\n * - Runtime assertion: output MUST be exactly 32 bytes.\n /\nexport async function encodeMinimal(message: RCANMessage): Promise<Uint8Array> {\n const msgType = (message.params?.['msg_type'] as number \| undefined) ?? 0;\n if (msgType !== SAFETY_TYPE) {\n throw new TransportError(\n `encodeMinimal only supports SAFETY (type 6) messages; got type=${msgType}`,\n );\n }\n\n const fromRrn = (message.params?.['from_rrn'] as string \| undefined) ?? message.target ?? '';\n const toRrn = (message.params?.['to_rrn'] as string \| undefined) ?? message.target ?? '';\n\n const fromHash = await sha256Bytes(fromRrn); // 32 bytes, take first 8\n const toHash = await sha256Bytes(toRrn); // 32 bytes, take first 8\n\n const sig = (message.signature?.sig ?? '').replace(/[^A-Za-z0-9+/=]/g, '');\n let sigBytes: Uint8Array;\n try {\n if (typeof atob !== 'undefined') {\n const raw = atob(sig.slice(0, 16));\n sigBytes = new Uint8Array(raw.length);\n for (let i = 0; i < raw.length; i++) sigBytes[i] = raw.charCodeAt(i);\n } else {\n sigBytes = Buffer.from(sig.slice(0, 16), 'base64');\n }\n } catch {\n sigBytes = new Uint8Array(8);\n }\n\n // Parse timestamp to unix32 (seconds)\n const ts = message.timestamp ? Math.floor(new Date(message.timestamp).getTime() / 1000) : Math.floor(Date.now() / 1000);\n const unix32 = ts >>> 0; // clamp to uint32\n\n const out = new Uint8Array(MINIMAL_SIZE);\n const view = new DataView(out.buffer);\n\n // [0..1] type (2 bytes)\n view.setUint16(0, SAFETY_TYPE, false);\n // [2..9] from_hash (8 bytes)\n out.set(fromHash.subarray(0, 8), 2);\n // [10..17] to_hash (8 bytes)\n out.set(toHash.subarray(0, 8), 10);\n // [18..21] unix32 (4 bytes)\n view.setUint32(18, unix32, false);\n // [22..29] sig_truncated (8 bytes)\n const sigSlice = new Uint8Array(8);\n sigSlice.set(sigBytes.subarray(0, Math.min(8, sigBytes.length)));\n out.set(sigSlice, 22);\n // [30..31] checksum (2 bytes) — simple XOR-16 of bytes 0..29\n let checksum = 0;\n for (let i = 0; i < 30; i++) checksum ^= (out[i] ?? 0);\n view.setUint16(30, checksum & 0xffff, false);\n\n // Runtime assertion\n if (out.length !== MINIMAL_SIZE) {\n throw new TransportError(\n `encodeMinimal assertion failed: expected ${MINIMAL_SIZE} bytes, got ${out.length}`,\n );\n }\n\n return out;\n}\n\n/\n Decode a 32-byte minimal frame to a partial RCANMessage.\n /\nexport function decodeMinimal(data: Uint8Array): Partial<RCANMessage> {\n if (data.length !== MINIMAL_SIZE) {\n throw new TransportError(\n `decodeMinimal: expected ${MINIMAL_SIZE} bytes, got ${data.length}`,\n );\n }\n\n const view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n const msgType = view.getUint16(0, false);\n const fromHash = data.subarray(2, 10);\n const toHash = data.subarray(10, 18);\n const unix32 = view.getUint32(18, false);\n const sigTrunc = data.subarray(22, 30);\n // checksum at [30..31] — not verified here (structural decode only)\n\n const timestamp = new Date(unix32 1000).toISOString();\n const toHex = (b: Uint8Array) => Array.from(b).map(x => x.toString(16).padStart(2, '0')).join('');\n\n return {\n params: {\n msg_type: msgType,\n from_hash: toHex(fromHash),\n to_hash: toHex(toHash),\n timestamp_s: unix32,\n sig_truncated: toHex(sigTrunc),\n },\n timestamp,\n } as unknown as Partial<RCANMessage>;\n}\n\n// ── BLE frame fragmentation ───────────────────────────────────────────────────\n\nconst DEFAULT_MTU = 251;\n// 3-byte header: [1B frame_index][1B total_frames][1B flags (bit0=isFinal)]\nconst BLE_HEADER_SIZE = 3;\n\n/*\n Fragment a RCANMessage into BLE advertisement frames.\n * Compact JSON encoding is used for the payload; each chunk is ≤ `mtu` bytes.\n /\nexport function encodeBleFrames(message: RCANMessage, mtu: number = DEFAULT_MTU): Uint8Array[] {\n const payload = encodeCompact(message);\n const chunkSize = mtu - BLE_HEADER_SIZE;\n\n if (chunkSize <= 0) {\n throw new TransportError(`MTU ${mtu} is too small (need at least ${BLE_HEADER_SIZE + 1})`);\n }\n\n const totalChunks = Math.ceil(payload.length / chunkSize);\n const frames: Uint8Array[] = [];\n\n for (let i = 0; i < totalChunks; i++) {\n const chunk = payload.subarray(i chunkSize, (i + 1) * chunkSize);\n const frame = new Uint8Array(BLE_HEADER_SIZE + chunk.length);\n frame[0] = i; // frame index\n frame[1] = totalChunks; // total frames\n frame[2] = i === totalChunks - 1 ? 0x01 : 0x00; // flags: bit0 = isFinal\n frame.set(chunk, BLE_HEADER_SIZE);\n frames.push(frame);\n }\n\n return frames;\n}\n\n/*\n Reassemble BLE frames (in order) into a RCANMessage.\n /\nexport function decodeBleFrames(frames: Uint8Array[]): RCANMessage {\n if (frames.length === 0) {\n throw new TransportError('decodeBleFrames: no frames provided');\n }\n\n // Sort by frame index (byte 0)\n const sorted = [...frames].sort((a, b) => (a[0] ?? 0) - (b[0] ?? 0));\n\n // Validate total count consistency\n const expectedTotal = sorted[0]?.[1] ?? sorted.length;\n if (sorted.length !== expectedTotal) {\n throw new TransportError(\n `decodeBleFrames: expected ${expectedTotal} frames, got ${sorted.length}`,\n );\n }\n\n // Concatenate payload bytes (skip 3-byte header)\n const payloadChunks = sorted.map(f => f.subarray(BLE_HEADER_SIZE));\n const totalLen = payloadChunks.reduce((s, c) => s + c.length, 0);\n const payload = new Uint8Array(totalLen);\n let offset = 0;\n for (const chunk of payloadChunks) {\n payload.set(chunk, offset);\n offset += chunk.length;\n }\n\n return decodeCompact(payload);\n}\n\n// ── Transport selection ───────────────────────────────────────────────────────\n\n/\n Select the most appropriate transport encoding from an availability list.\n \n Priority:\n * - SAFETY (type 6) messages: prefer MINIMAL → BLE → COMPACT → HTTP\n * - All others: prefer HTTP → COMPACT → BLE\n /\nexport function selectTransport(\n available: TransportEncoding[],\n message: RCANMessage,\n): TransportEncoding {\n const msgType = (message.params?.['msg_type'] as number \| undefined) ?? 0;\n const isSafety = msgType === SAFETY_TYPE;\n\n const has = (enc: TransportEncoding) => available.includes(enc);\n\n if (isSafety) {\n if (has(TransportEncoding.MINIMAL)) return TransportEncoding.MINIMAL;\n if (has(TransportEncoding.BLE)) return TransportEncoding.BLE;\n if (has(TransportEncoding.COMPACT)) return TransportEncoding.COMPACT;\n if (has(TransportEncoding.HTTP)) return TransportEncoding.HTTP;\n } else {\n if (has(TransportEncoding.HTTP)) return TransportEncoding.HTTP;\n if (has(TransportEncoding.COMPACT)) return TransportEncoding.COMPACT;\n if (has(TransportEncoding.BLE)) return TransportEncoding.BLE;\n }\n\n throw new TransportError(\n `No suitable transport available from: [${available.join(', ')}]`,\n );\n}\n","/\n RCAN Multi-modal Data — GAP-18.\n \n Provides inline and by-reference media attachment for RCANMessage,\n * streaming chunk helpers, and training-data message construction.\n * SHA-256 is computed via the Web Crypto API (built-in Node 18+).\n /\n\nimport { RCANMessage, MessageType } from './message.js';\n\n// ── Enums & interfaces ────────────────────────────────────────────────────────\n\nexport enum MediaEncoding {\n BASE64 = 'base64',\n REF = 'ref',\n}\n\nexport interface MediaChunk {\n chunkId: string;\n mimeType: string;\n encoding: MediaEncoding;\n hashSha256: string;\n dataB64?: string;\n refUrl?: string;\n sizeBytes: number;\n}\n\nexport interface StreamChunk {\n streamId: string;\n chunkIndex: number;\n isFinal: boolean;\n chunk: MediaChunk;\n}\n\n// ── Helpers ───────────────────────────────────────────────────────────────────\n\nfunction generateId(): string {\n if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n return crypto.randomUUID();\n }\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = ((bytes[6] ?? 0) & 0x0f) \| 0x40;\n bytes[8] = ((bytes[8] ?? 0) & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, '0'));\n return `${hex.slice(0, 4).join('')}-${hex.slice(4, 6).join('')}-${hex.slice(6, 8).join('')}-${hex.slice(8, 10).join('')}-${hex.slice(10).join('')}`;\n}\n\nasync function computeSha256Hex(data: Uint8Array): Promise<string> {\n // Use globalThis.crypto (Node 18+) or fall back to node:crypto webcrypto.\n // Bare `crypto` is not available in all Jest/Node environments.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const subtle: SubtleCrypto = (globalThis as any).crypto?.subtle\n ?? (await import('node:crypto' as string)).webcrypto.subtle;\n const ab = new ArrayBuffer(data.byteLength);\n new Uint8Array(ab).set(data);\n const hashBuffer = await subtle.digest('SHA-256', ab);\n const hashArray = new Uint8Array(hashBuffer);\n return Array.from(hashArray).map(b => b.toString(16).padStart(2, '0')).join('');\n}\n\nfunction uint8ToBase64(data: Uint8Array): string {\n if (typeof Buffer !== 'undefined') {\n return Buffer.from(data).toString('base64');\n }\n // Browser path\n let binary = '';\n for (let i = 0; i < data.length; i++) binary += String.fromCharCode(data[i] ?? 0);\n return btoa(binary);\n}\n\n/*\n Rebuild a RCANMessage from its toJSON() output with an overridden field.\n * We use RCANMessage.fromJSON which accepts Record<string, unknown>.\n /\nfunction rebuildMessage(\n base: RCANMessage,\n overrides: Record<string, unknown>,\n): RCANMessage {\n const data = { ...base.toJSON(), ...overrides };\n return RCANMessage.fromJSON(data as Record<string, unknown>);\n}\n\n// ── Core attachment helpers ───────────────────────────────────────────────────\n\n/\n Attach inline (base64-encoded) media to a message.\n * SHA-256 is computed via Web Crypto API.\n /\nexport async function addMediaInline(\n message: RCANMessage,\n data: Uint8Array,\n mimeType: string,\n): Promise<RCANMessage> {\n const hashSha256 = await computeSha256Hex(data);\n const dataB64 = uint8ToBase64(data);\n\n const chunk: MediaChunk = {\n chunkId: generateId(),\n mimeType,\n encoding: MediaEncoding.BASE64,\n hashSha256,\n dataB64,\n sizeBytes: data.length,\n };\n\n const existing = (message.mediaChunks as unknown as MediaChunk[] \| undefined) ?? [];\n return rebuildMessage(message, { mediaChunks: [...existing, chunk] });\n}\n\n/\n Attach a media reference (URL + pre-computed hash) to a message.\n /\nexport function addMediaRef(\n message: RCANMessage,\n refUrl: string,\n mimeType: string,\n hashSha256: string,\n sizeBytes: number,\n): RCANMessage {\n const chunk: MediaChunk = {\n chunkId: generateId(),\n mimeType,\n encoding: MediaEncoding.REF,\n hashSha256,\n refUrl,\n sizeBytes,\n };\n\n const existing = (message.mediaChunks as unknown as MediaChunk[] \| undefined) ?? [];\n return rebuildMessage(message, { mediaChunks: [...existing, chunk] });\n}\n\n/\n Validate media chunks on a message.\n * Checks that inline chunks have dataB64 and ref chunks have refUrl.\n /\nexport async function validateMediaChunks(\n message: RCANMessage,\n): Promise<{ valid: boolean; reason: string }> {\n const chunks = (message.mediaChunks as unknown as MediaChunk[] \| undefined) ?? [];\n\n if (chunks.length === 0) {\n return { valid: true, reason: 'no media chunks' };\n }\n\n for (let i = 0; i < chunks.length; i++) {\n const chunk = chunks[i]!;\n\n if (!chunk.chunkId) return { valid: false, reason: `chunk[${i}]: missing chunkId` };\n if (!chunk.mimeType) return { valid: false, reason: `chunk[${i}]: missing mimeType` };\n if (!chunk.hashSha256) return { valid: false, reason: `chunk[${i}]: missing hashSha256` };\n if (chunk.sizeBytes < 0) return { valid: false, reason: `chunk[${i}]: sizeBytes must be >= 0` };\n\n if (chunk.encoding === MediaEncoding.BASE64) {\n if (!chunk.dataB64) {\n return { valid: false, reason: `chunk[${i}]: BASE64 encoding requires dataB64` };\n }\n // Verify hash\n let decoded: Uint8Array;\n try {\n if (typeof Buffer !== 'undefined') {\n decoded = Buffer.from(chunk.dataB64, 'base64');\n } else {\n const raw = atob(chunk.dataB64);\n decoded = new Uint8Array(raw.length);\n for (let j = 0; j < raw.length; j++) decoded[j] = raw.charCodeAt(j);\n }\n } catch {\n return { valid: false, reason: `chunk[${i}]: failed to decode base64 data` };\n }\n const actualHash = await computeSha256Hex(decoded);\n if (actualHash !== chunk.hashSha256) {\n return {\n valid: false,\n reason: `chunk[${i}]: SHA-256 mismatch (expected ${chunk.hashSha256}, got ${actualHash})`,\n };\n }\n } else if (chunk.encoding === MediaEncoding.REF) {\n if (!chunk.refUrl) {\n return { valid: false, reason: `chunk[${i}]: REF encoding requires refUrl` };\n }\n } else {\n return { valid: false, reason: `chunk[${i}]: unknown encoding '${chunk.encoding as string}'` };\n }\n }\n\n return { valid: true, reason: 'ok' };\n}\n\n// ── Training data & streaming helpers ────────────────────────────────────────\n\n/\n Build a TRAINING_DATA message (MessageType 10) with multiple media attachments.\n /\nexport async function makeTrainingDataMessage(\n media: Array<{ data: Uint8Array; mimeType: string }>,\n): Promise<RCANMessage> {\n let msg = new RCANMessage({\n rcan: '1.6',\n rcanVersion: '1.6',\n cmd: 'training_data',\n target: 'rcan://training/data',\n params: {\n msg_type: MessageType.TRAINING_DATA,\n msg_id: generateId(),\n },\n timestamp: new Date().toISOString(),\n });\n\n for (const item of media) {\n msg = await addMediaInline(msg, item.data, item.mimeType);\n }\n\n return msg;\n}\n\n/\n Build a streaming chunk message wrapping a single media item.\n /\nexport async function makeStreamChunk(\n streamId: string,\n data: Uint8Array,\n mimeType: string,\n chunkIndex: number,\n isFinal: boolean,\n): Promise<RCANMessage> {\n const hashSha256 = await computeSha256Hex(data);\n const dataB64 = uint8ToBase64(data);\n\n const chunk: MediaChunk = {\n chunkId: generateId(),\n mimeType,\n encoding: MediaEncoding.BASE64,\n hashSha256,\n dataB64,\n sizeBytes: data.length,\n };\n\n const streamChunkMeta: StreamChunk = {\n streamId,\n chunkIndex,\n isFinal,\n chunk,\n };\n\n let msg = new RCANMessage({\n rcan: '1.6',\n rcanVersion: '1.6',\n cmd: 'stream_chunk',\n target: 'rcan://streaming/chunk',\n params: {\n msg_type: MessageType.SENSOR_DATA,\n msg_id: generateId(),\n stream_chunk: streamChunkMeta,\n },\n timestamp: new Date().toISOString(),\n });\n\n // Attach the chunk via mediaChunks for easy access\n msg = rebuildMessage(msg, { mediaChunks: [chunk] });\n return msg;\n}\n","/\n rcan/contribute — Idle Compute Contribution messages and scope.\n \n Implements the contribute scope and message types for RCAN v1.7+.\n * Robots can donate idle NPU/GPU/CPU compute to distributed science projects.\n \n Spec: §3 MessageTypes 33–35, Identity scope level 2.5\n /\n\nimport { MessageType } from \"./message.js\";\n\n// ── Scope ────────────────────────────────────────────────────────────────\n\n/* Contribute scope level — between chat (2) and control (3). /\nexport const CONTRIBUTE_SCOPE_LEVEL = 2.5;\n\n// ── Enums ────────────────────────────────────────────────────────────────\n\nexport type WorkUnitStatus =\n \| \"pending\"\n \| \"running\"\n \| \"completed\"\n \| \"failed\"\n \| \"cancelled\"\n \| \"preempted\";\n\nexport type ComputeResource = \"npu\" \| \"gpu\" \| \"cpu\" \| \"sensor\";\n\n// ── Message Types ────────────────────────────────────────────────────────\n\nexport interface ContributeRequest {\n type: typeof MessageType.CONTRIBUTE_REQUEST;\n request_id: string;\n project_id: string;\n project_name: string;\n work_unit_id: string;\n resource_type: ComputeResource;\n estimated_duration_s: number;\n priority: number;\n payload: Record<string, unknown>;\n timestamp: number;\n}\n\nexport interface ContributeResult {\n type: typeof MessageType.CONTRIBUTE_RESULT;\n request_id: string;\n work_unit_id: string;\n status: WorkUnitStatus;\n resource_type: ComputeResource;\n duration_s: number;\n compute_units: number;\n result_payload: Record<string, unknown>;\n error_message?: string;\n timestamp: number;\n}\n\nexport interface ContributeCancel {\n type: typeof MessageType.CONTRIBUTE_CANCEL;\n request_id: string;\n work_unit_id: string;\n reason: string;\n timestamp: number;\n}\n\n// ── Factory Functions ────────────────────────────────────────────────────\n\nlet _idCounter = 0;\n\nfunction _generateId(): string {\n return `cr-${Date.now()}-${++_idCounter}`;\n}\n\nexport function makeContributeRequest(\n params: Partial<Omit<ContributeRequest, \"type\">> = {},\n): ContributeRequest {\n return {\n type: MessageType.CONTRIBUTE_REQUEST,\n request_id: params.request_id ?? _generateId(),\n project_id: params.project_id ?? \"\",\n project_name: params.project_name ?? \"\",\n work_unit_id: params.work_unit_id ?? \"\",\n resource_type: params.resource_type ?? \"cpu\",\n estimated_duration_s: params.estimated_duration_s ?? 0,\n priority: params.priority ?? 0,\n payload: params.payload ?? {},\n timestamp: params.timestamp ?? Date.now() / 1000,\n };\n}\n\nexport function makeContributeResult(\n params: Partial<Omit<ContributeResult, \"type\">> = {},\n): ContributeResult {\n const result: ContributeResult = {\n type: MessageType.CONTRIBUTE_RESULT,\n request_id: params.request_id ?? \"\",\n work_unit_id: params.work_unit_id ?? \"\",\n status: params.status ?? \"completed\",\n resource_type: params.resource_type ?? \"cpu\",\n duration_s: params.duration_s ?? 0,\n compute_units: params.compute_units ?? 0,\n result_payload: params.result_payload ?? {},\n timestamp: params.timestamp ?? Date.now() / 1000,\n };\n if (params.error_message !== undefined) {\n result.error_message = params.error_message;\n }\n return result;\n}\n\nexport function makeContributeCancel(\n params: Partial<Omit<ContributeCancel, \"type\">> = {},\n): ContributeCancel {\n return {\n type: MessageType.CONTRIBUTE_CANCEL,\n request_id: params.request_id ?? \"\",\n work_unit_id: params.work_unit_id ?? \"\",\n reason: params.reason ?? \"\",\n timestamp: params.timestamp ?? Date.now() / 1000,\n };\n}\n\n// ── Scope Validation ────────────────────────────────────────────────────\n\n/\n Check if the given scope level permits contribute operations.\n \n Contribute requires scope >= 2.5 (between chat and control).\n /\nexport function validateContributeScope(\n scopeLevel: number,\n action: \"request\" \| \"result\" \| \"cancel\" = \"request\",\n): boolean {\n if (action === \"request\" \|\| action === \"result\") {\n return scopeLevel >= CONTRIBUTE_SCOPE_LEVEL;\n }\n if (action === \"cancel\") {\n // Cancel is permitted at chat level and above\n return scopeLevel >= 2.0;\n }\n return false;\n}\n\n/\n Check if the given scope level preempts contribution.\n \n Any scope >= control (3.0) preempts contribute immediately.\n * This is the P66 safety invariant — non-negotiable.\n /\nexport function isPreemptedBy(scopeLevel: number): boolean {\n return scopeLevel >= 3.0;\n}\n","/\n rcan/competition — Competition protocol messages and scope.\n \n Implements the competition scope and message types for RCAN v1.10+.\n * Robots can enter competitions, publish scores, receive season standings,\n * and log private personal research results.\n \n Spec: §3 MessageTypes 37–40\n /\n\nimport { MessageType } from \"./message.js\";\n\n// ── Scope ────────────────────────────────────────────────────────────────\n\n/* Competition scope level — chat-level scope (observation, not control). /\nexport const COMPETITION_SCOPE_LEVEL = 2.0;\n\n// ── Enums / Union Types ──────────────────────────────────────────────────\n\nexport type CompetitionFormat =\n \| \"sprint\"\n \| \"endurance\"\n \| \"precision\"\n \| \"efficiency\";\n\nexport type CompetitionBadge = \"gold\" \| \"silver\" \| \"bronze\" \| \"participant\";\n\nexport type RunType = \"personal\" \| \"community\";\n\n// ── Payload Types ────────────────────────────────────────────────────────\n\nexport interface StandingEntry {\n rank: number;\n rrn: string;\n score: number;\n badge: CompetitionBadge;\n}\n\nexport interface ResearchMetrics {\n success_rate: number;\n p66_rate: number;\n token_efficiency: number;\n latency_score: number;\n [key: string]: number;\n}\n\n// ── Message Interfaces ───────────────────────────────────────────────────\n\nexport interface CompetitionEnter {\n type: typeof MessageType.COMPETITION_ENTER;\n competition_id: string;\n competition_format: CompetitionFormat;\n hardware_tier: string;\n model_id: string;\n robot_rrn: string;\n entered_at: number;\n}\n\nexport interface CompetitionScore {\n type: typeof MessageType.COMPETITION_SCORE;\n competition_id: string;\n candidate_id: string;\n score: number;\n hardware_tier: string;\n verified: boolean;\n submitted_at: number;\n}\n\nexport interface SeasonStanding {\n type: typeof MessageType.SEASON_STANDING;\n season_id: string;\n class_id: string;\n standings: StandingEntry[];\n days_remaining: number;\n broadcast_at: number;\n}\n\nexport interface PersonalResearchResult {\n type: typeof MessageType.PERSONAL_RESEARCH_RESULT;\n run_id: string;\n run_type: RunType;\n candidate_id: string;\n score: number;\n hardware_tier: string;\n model_id: string;\n owner_uid: string;\n metrics: ResearchMetrics;\n submitted_to_community: boolean;\n created_at: number;\n}\n\n// ── Factory Functions ────────────────────────────────────────────────────\n\nlet _idCounter = 0;\n\nfunction _generateRunId(): string {\n return `run-${Date.now()}-${++_idCounter}`;\n}\n\nexport function makeCompetitionEnter(\n params: Partial<Omit<CompetitionEnter, \"type\">> = {},\n): CompetitionEnter {\n return {\n type: MessageType.COMPETITION_ENTER,\n competition_id: params.competition_id ?? \"\",\n competition_format: params.competition_format ?? \"sprint\",\n hardware_tier: params.hardware_tier ?? \"\",\n model_id: params.model_id ?? \"\",\n robot_rrn: params.robot_rrn ?? \"\",\n entered_at: params.entered_at ?? Date.now() / 1000,\n };\n}\n\nexport function makeCompetitionScore(\n params: Partial<Omit<CompetitionScore, \"type\">> = {},\n): CompetitionScore {\n const score = params.score ?? 0.0;\n if (score < 0.0 \|\| score > 1.0) {\n throw new Error(`score must be in [0.0, 1.0], got ${score}`);\n }\n return {\n type: MessageType.COMPETITION_SCORE,\n competition_id: params.competition_id ?? \"\",\n candidate_id: params.candidate_id ?? \"\",\n score,\n hardware_tier: params.hardware_tier ?? \"\",\n verified: params.verified ?? false,\n submitted_at: params.submitted_at ?? Date.now() / 1000,\n };\n}\n\nexport function makeSeasonStanding(\n params: Partial<Omit<SeasonStanding, \"type\">> = {},\n): SeasonStanding {\n return {\n type: MessageType.SEASON_STANDING,\n season_id: params.season_id ?? \"\",\n class_id: params.class_id ?? \"\",\n standings: params.standings ?? [],\n days_remaining: params.days_remaining ?? 0,\n broadcast_at: params.broadcast_at ?? Date.now() / 1000,\n };\n}\n\nexport function makePersonalResearchResult(\n params: Partial<Omit<PersonalResearchResult, \"type\">> = {},\n): PersonalResearchResult {\n const score = params.score ?? 0.0;\n if (score < 0.0 \|\| score > 1.0) {\n throw new Error(`score must be in [0.0, 1.0], got ${score}`);\n }\n return {\n type: MessageType.PERSONAL_RESEARCH_RESULT,\n run_id: params.run_id ?? _generateRunId(),\n run_type: params.run_type ?? \"personal\",\n candidate_id: params.candidate_id ?? \"\",\n score,\n hardware_tier: params.hardware_tier ?? \"\",\n model_id: params.model_id ?? \"\",\n owner_uid: params.owner_uid ?? \"\",\n metrics: params.metrics ?? {\n success_rate: 0,\n p66_rate: 0,\n token_efficiency: 0,\n latency_score: 0,\n },\n submitted_to_community: params.submitted_to_community ?? false,\n created_at: params.created_at ?? Date.now() / 1000,\n };\n}\n\n// ── Scope Validation ─────────────────────────────────────────────────────\n\n/\n Check if the given scope level permits competition operations.\n * Competition messages require scope >= 2.0 (chat level).\n /\nexport function validateCompetitionScope(scopeLevel: number): boolean {\n return scopeLevel >= COMPETITION_SCOPE_LEVEL;\n}\n","/\n rcan/firmware — RCAN v2.1 Firmware Manifest types and helpers.\n \n Every RCAN v2.1 robot MUST publish a signed firmware manifest at:\n * {ruri}/.well-known/rcan-firmware-manifest.json\n \n The manifest is Ed25519-signed by the manufacturer's key registered in the RRF.\n * The envelope field `firmwareHash` (field 13) carries a SHA-256 of the manifest.\n \n Spec: §11 — Firmware Manifests\n /\n\n/* Well-known endpoint path for firmware manifests. /\nexport const FIRMWARE_MANIFEST_PATH = \"/.well-known/rcan-firmware-manifest.json\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/* A single component entry in the firmware manifest. /\nexport interface FirmwareComponent {\n /* Component name, e.g. \"brain-runtime\" /\n name: string;\n /* Semantic version string /\n version: string;\n /* SHA-256 hash prefixed with \"sha256:\" /\n hash: string;\n}\n\n/* RCAN v2.1 firmware manifest. /\nexport interface FirmwareManifest {\n /* Robot Registration Number /\n rrn: string;\n /* Semver or CalVer version string /\n firmwareVersion: string;\n /* SHA-256 of the full firmware bundle, prefixed \"sha256:\" /\n buildHash: string;\n /* Per-component records /\n components: FirmwareComponent[];\n /* UTC ISO-8601 timestamp when the manifest was signed /\n signedAt: string;\n /* Ed25519 signature over canonical JSON (base64url), empty if unsigned /\n signature?: string;\n}\n\n/\n Serialized (wire) format of a firmware manifest.\n * Uses snake_case keys to match the JSON spec.\n /\nexport interface FirmwareManifestWire {\n rrn: string;\n firmware_version: string;\n build_hash: string;\n components: FirmwareComponent[];\n signed_at: string;\n signature?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Serialization helpers\n// ---------------------------------------------------------------------------\n\n/* Convert a camelCase FirmwareManifest to the wire (snake_case) format. /\nexport function manifestToWire(m: FirmwareManifest): FirmwareManifestWire {\n const wire: FirmwareManifestWire = {\n rrn: m.rrn,\n firmware_version: m.firmwareVersion,\n build_hash: m.buildHash,\n components: m.components,\n signed_at: m.signedAt,\n };\n if (m.signature) wire.signature = m.signature;\n return wire;\n}\n\n/* Parse a wire-format manifest into the typed FirmwareManifest. /\nexport function manifestFromWire(w: FirmwareManifestWire): FirmwareManifest {\n return {\n rrn: w.rrn,\n firmwareVersion: w.firmware_version,\n buildHash: w.build_hash,\n components: w.components ?? [],\n signedAt: w.signed_at ?? \"\",\n signature: w.signature,\n };\n}\n\n/\n Return the canonical JSON bytes of a manifest (no signature field, sorted keys).\n * This is the byte string that the Ed25519 signature covers.\n /\nexport function canonicalManifestJson(m: FirmwareManifest): string {\n const obj: Record<string, unknown> = {\n build_hash: m.buildHash,\n components: m.components.map(c => ({\n hash: c.hash,\n name: c.name,\n version: c.version,\n })),\n firmware_version: m.firmwareVersion,\n rrn: m.rrn,\n signed_at: m.signedAt,\n };\n // deterministic: keys are already sorted above\n return JSON.stringify(obj);\n}\n\n// ---------------------------------------------------------------------------\n// Exceptions\n// ---------------------------------------------------------------------------\n\n/* Thrown when firmware manifest signature verification fails. /\nexport class FirmwareIntegrityError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"FirmwareIntegrityError\";\n }\n}\n\n// ---------------------------------------------------------------------------\n// Validation\n// ---------------------------------------------------------------------------\n\n/* Validate a manifest structure and return a list of errors. /\nexport function validateManifest(m: FirmwareManifest): string[] {\n const errors: string[] = [];\n if (!m.rrn) errors.push(\"rrn is required\");\n if (!m.firmwareVersion) errors.push(\"firmwareVersion is required\");\n if (!m.buildHash) errors.push(\"buildHash is required\");\n if (!m.buildHash.startsWith(\"sha256:\")) errors.push(\"buildHash must start with 'sha256:'\");\n if (!m.signedAt) errors.push(\"signedAt is required\");\n if (!m.signature) errors.push(\"signature is required (manifest must be signed)\");\n for (const [i, c] of m.components.entries()) {\n if (!c.name) errors.push(`components[${i}].name is required`);\n if (!c.version) errors.push(`components[${i}].version is required`);\n if (!c.hash.startsWith(\"sha256:\")) errors.push(`components[${i}].hash must start with 'sha256:'`);\n }\n return errors;\n}\n","/\n rcan/authority — RCAN v2.1 Authority Access Protocol (EU AI Act §16(j)).\n \n Defines payload types for AUTHORITY_ACCESS (41) and AUTHORITY_RESPONSE (42)\n * message types, and helpers for building/validating authority requests.\n \n The authority access protocol enables regulatory bodies to request audit data\n * from robots under EU AI Act Article 16(j) and similar frameworks.\n \n Spec: §13 (Authority Access) — EU AI Act Art. 16 mapping\n /\n\nimport { MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\n// ---------------------------------------------------------------------------\n// Authority access data types\n// ---------------------------------------------------------------------------\n\n/* Allowed audit data categories that an authority may request. /\nexport type AuthorityDataCategory =\n \| \"audit_chain\"\n \| \"transparency_records\"\n \| \"sbom\"\n \| \"firmware_manifest\";\n\n/* Payload for AUTHORITY_ACCESS (41) — sent by a regulatory authority to a robot. /\nexport interface AuthorityAccessPayload {\n /* Unique request identifier (correlated in the response). /\n requestId: string;\n /* Authority identifier, e.g. \"EU-AI-ACT-NCA-DE\" /\n authorityId: string;\n /* Audit data categories requested. /\n requestedData: AuthorityDataCategory[];\n /* Human-readable justification for the request. /\n justification: string;\n /* Unix timestamp — request must be responded to before this time. /\n expiresAt: number;\n}\n\n/* Provided audit data in an AUTHORITY_RESPONSE. /\nexport interface AuthorityResponseData {\n auditChain?: unknown[];\n transparencyRecords?: unknown[];\n sbomUrl?: string;\n firmwareManifestUrl?: string;\n}\n\n/* Payload for AUTHORITY_RESPONSE (42) — sent by the robot in reply. /\nexport interface AuthorityResponsePayload {\n /* Correlates with the AUTHORITY_ACCESS requestId. /\n requestId: string;\n /* Robot Registration Number of the responding robot. /\n rrn: string;\n /* Unix timestamp when the data was packaged. /\n providedAt: number;\n /* Provided audit data. /\n data: AuthorityResponseData;\n}\n\n// ---------------------------------------------------------------------------\n// Wire-format helpers\n// ---------------------------------------------------------------------------\n\n/* Convert AuthorityAccessPayload to/from snake_case wire format. /\nexport interface AuthorityAccessPayloadWire {\n request_id: string;\n authority_id: string;\n requested_data: AuthorityDataCategory[];\n justification: string;\n expires_at: number;\n}\n\nexport function authorityAccessToWire(p: AuthorityAccessPayload): AuthorityAccessPayloadWire {\n return {\n request_id: p.requestId,\n authority_id: p.authorityId,\n requested_data: p.requestedData,\n justification: p.justification,\n expires_at: p.expiresAt,\n };\n}\n\nexport function authorityAccessFromWire(w: AuthorityAccessPayloadWire): AuthorityAccessPayload {\n return {\n requestId: w.request_id,\n authorityId: w.authority_id,\n requestedData: w.requested_data ?? [],\n justification: w.justification ?? \"\",\n expiresAt: w.expires_at ?? 0,\n };\n}\n\n// ---------------------------------------------------------------------------\n// Validation helpers\n// ---------------------------------------------------------------------------\n\n/\n Validate an authority access payload.\n * Returns an array of error strings (empty = valid).\n /\nexport function validateAuthorityAccess(p: AuthorityAccessPayload): string[] {\n const errors: string[] = [];\n if (!p.requestId) errors.push(\"requestId is required\");\n if (!p.authorityId) errors.push(\"authorityId is required\");\n if (!p.requestedData \|\| p.requestedData.length === 0)\n errors.push(\"requestedData must include at least one category\");\n if (!p.justification) errors.push(\"justification is required\");\n if (!p.expiresAt \|\| p.expiresAt <= 0) errors.push(\"expiresAt must be a positive Unix timestamp\");\n if (p.expiresAt < Date.now() / 1000) errors.push(\"expiresAt is in the past — request has expired\");\n return errors;\n}\n\n/* Return true if an AUTHORITY_ACCESS request is still within its deadline. /\nexport function isAuthorityRequestValid(p: AuthorityAccessPayload): boolean {\n return Date.now() / 1000 < p.expiresAt && validateAuthorityAccess(p).length === 0;\n}\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nexport const AUTHORITY_ERROR_CODES = {\n NOT_RECOGNIZED: \"AUTHORITY_NOT_RECOGNIZED\",\n REQUEST_EXPIRED: \"AUTHORITY_REQUEST_EXPIRED\",\n INVALID_TOKEN: \"AUTHORITY_INVALID_TOKEN\",\n RATE_LIMITED: \"AUTHORITY_RATE_LIMITED\",\n} as const;\n","/\n rcan/m2m — RCAN v2.1 Machine-to-Machine Authorization.\n \n M2M_PEER (JWT level 4): robot-to-robot, issued by ADMIN/CREATOR.\n * M2M_TRUSTED (JWT level 6): fleet orchestration, RRF-issued only.\n \n Spec: §2.8 M2M_PEER · §2.9 M2M_TRUSTED\n /\n\nimport { Role } from \"./identity.js\";\n\n// ---------------------------------------------------------------------------\n// RRF constants\n// ---------------------------------------------------------------------------\n\nexport const RRF_ROOT_PUBKEY_URL = \"https://api.rrf.rcan.dev/.well-known/rrf-root-pubkey.pem\";\nexport const RRF_REVOCATION_URL = \"https://api.rrf.rcan.dev/v2/revocations\";\nexport const M2M_TRUSTED_ISSUER = \"rrf.rcan.dev\";\n/* Revocation cache TTL in milliseconds (≤ 60 s per spec). /\nexport const RRF_REVOCATION_CACHE_TTL_MS = 55_000;\n/* Pubkey cache TTL in milliseconds. /\nexport const RRF_PUBKEY_CACHE_TTL_MS = 3_600_000;\n\n// ---------------------------------------------------------------------------\n// Claims types\n// ---------------------------------------------------------------------------\n\n/* Parsed claims from an M2M_PEER JWT. /\nexport interface M2MPeerClaims {\n /* Subject RRN of the peer robot. /\n sub: string;\n /* The robot this peer is authorized to command. /\n peerRrn: string;\n /* Authorized scopes. /\n scopes: string[];\n /* Unix expiry timestamp. /\n exp: number;\n /* Issuing principal (ADMIN or CREATOR RRN). /\n iss: string;\n}\n\n/* Parsed claims from an M2M_TRUSTED JWT (RRF-issued). /\nexport interface M2MTrustedClaims {\n /* Orchestrator identifier (not a robot RRN). /\n sub: string;\n /* Explicit allowlist of robots this token may command. /\n fleetRrns: string[];\n /* Must include \"fleet.trusted\". /\n scopes: string[];\n /* Unix expiry timestamp (max 24 h from issuance). /\n exp: number;\n /* Must be \"rrf.rcan.dev\". /\n iss: string;\n /* RRF Ed25519 signature over claims (base64url). /\n rrfSig: string;\n}\n\n// ---------------------------------------------------------------------------\n// Exceptions\n// ---------------------------------------------------------------------------\n\n/* Thrown when M2M token verification fails. /\nexport class M2MAuthError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"M2MAuthError\";\n }\n}\n\n// ---------------------------------------------------------------------------\n// JWT helpers\n// ---------------------------------------------------------------------------\n\nfunction decodeJwtPayload(token: string): Record<string, unknown> {\n const parts = token.split('.');\n if (parts.length < 2) throw new M2MAuthError(\"Invalid JWT structure\");\n const b64 = (parts[1] ?? '').replace(/-/g, '+').replace(/_/g, '/');\n const padded = b64 + '='.repeat((4 - b64.length % 4) % 4);\n try {\n return JSON.parse(atob(padded)) as Record<string, unknown>;\n } catch (e) {\n throw new M2MAuthError(`JWT payload decode failed: ${String(e)}`);\n }\n}\n\n// ---------------------------------------------------------------------------\n// M2M_PEER parsing\n// ---------------------------------------------------------------------------\n\n/\n Parse an M2M_PEER JWT without signature verification.\n * Validates expiry and required claims.\n /\nexport function parseM2mPeerToken(token: string): M2MPeerClaims {\n const payload = decodeJwtPayload(token);\n const exp = Number(payload['exp'] ?? 0);\n if (exp > 0 && Date.now() / 1000 > exp) {\n throw new M2MAuthError(`M2M_PEER token expired (sub=${String(payload['sub'])})`);\n }\n const peerRrn = String(payload['peer_rrn'] ?? '');\n if (!peerRrn) throw new M2MAuthError(\"M2M_PEER token missing peer_rrn claim\");\n\n return {\n sub: String(payload['sub'] ?? ''),\n peerRrn,\n scopes: Array.isArray(payload['rcan_scopes']) ? payload['rcan_scopes'] as string[]\n : Array.isArray(payload['scopes']) ? payload['scopes'] as string[] : [],\n exp,\n iss: String(payload['iss'] ?? ''),\n };\n}\n\n// ---------------------------------------------------------------------------\n// M2M_TRUSTED — token parsing (sync, no network)\n// ---------------------------------------------------------------------------\n\n/\n Parse an M2M_TRUSTED JWT claims WITHOUT signature verification.\n \n Checks issuer, scope, and expiry. Does not contact RRF.\n * For full verification use `verifyM2mTrustedTokenClaims`.\n /\nexport function parseM2mTrustedToken(token: string): M2MTrustedClaims {\n const payload = decodeJwtPayload(token);\n\n const iss = String(payload['iss'] ?? '');\n if (iss !== M2M_TRUSTED_ISSUER) {\n throw new M2MAuthError(\n `M2M_TRUSTED issuer must be '${M2M_TRUSTED_ISSUER}', got '${iss}'`\n );\n }\n\n const scopes: string[] = Array.isArray(payload['rcan_scopes'])\n ? payload['rcan_scopes'] as string[]\n : Array.isArray(payload['scopes']) ? payload['scopes'] as string[] : [];\n\n if (!scopes.includes('fleet.trusted')) {\n throw new M2MAuthError(\"M2M_TRUSTED token missing required 'fleet.trusted' scope\");\n }\n\n const exp = Number(payload['exp'] ?? 0);\n if (exp > 0 && Date.now() / 1000 > exp) {\n throw new M2MAuthError(`M2M_TRUSTED token expired (sub=${String(payload['sub'])})`);\n }\n\n const rrfSig = String(payload['rrf_sig'] ?? '');\n if (!rrfSig) throw new M2MAuthError(\"M2M_TRUSTED token missing rrf_sig claim\");\n\n const fleetRrns: string[] = Array.isArray(payload['fleet_rrns'])\n ? payload['fleet_rrns'] as string[] : [];\n\n return {\n sub: String(payload['sub'] ?? ''),\n fleetRrns,\n scopes,\n exp,\n iss,\n rrfSig,\n };\n}\n\n/\n Verify M2M_TRUSTED token claims and check that it authorizes `targetRrn`.\n \n This method validates claims structure only (no RRF network call).\n * In production, also check the RRF revocation list with `RRFRevocationCache`.\n /\nexport function verifyM2mTrustedTokenClaims(\n token: string,\n targetRrn: string\n): M2MTrustedClaims {\n const claims = parseM2mTrustedToken(token);\n\n if (!claims.fleetRrns.includes(targetRrn)) {\n throw new M2MAuthError(\n `M2M_TRUSTED token does not authorize commanding '${targetRrn}'. ` +\n `Authorized fleet: [${claims.fleetRrns.join(', ')}]`\n );\n }\n\n return claims;\n}\n\n// ---------------------------------------------------------------------------\n// RRF Revocation Cache (browser/Node-compatible, no native deps)\n// ---------------------------------------------------------------------------\n\ninterface RevocationCache {\n revokedOrchestrators: Set<string>;\n revokedJtis: Set<string>;\n fetchedAt: number;\n}\n\nlet _revocationCache: RevocationCache \| null = null;\n\n/\n Fetch the RRF revocation list and cache it.\n \n Uses `fetch()` (available in Node 18+ and all modern browsers).\n * TTL: 55 s (spec max: 60 s).\n /\nexport async function fetchRRFRevocations(\n url: string = RRF_REVOCATION_URL\n): Promise<RevocationCache> {\n const now = Date.now();\n if (_revocationCache && now - _revocationCache.fetchedAt < RRF_REVOCATION_CACHE_TTL_MS) {\n return _revocationCache;\n }\n\n try {\n const resp = await fetch(url, { signal: AbortSignal.timeout?.(5000) });\n const data = await resp.json() as {\n revoked_orchestrators?: string[];\n revoked_jtis?: string[];\n };\n _revocationCache = {\n revokedOrchestrators: new Set(data.revoked_orchestrators ?? []),\n revokedJtis: new Set(data.revoked_jtis ?? []),\n fetchedAt: now,\n };\n } catch {\n // Return stale cache if available, else empty\n if (_revocationCache) return _revocationCache;\n _revocationCache = { revokedOrchestrators: new Set(), revokedJtis: new Set(), fetchedAt: now };\n }\n\n return _revocationCache;\n}\n\n/\n Check whether an M2M_TRUSTED orchestrator sub is revoked.\n * Fetches the revocation list if the cache is stale.\n /\nexport async function isM2mTrustedRevoked(\n claims: M2MTrustedClaims,\n jti?: string\n): Promise<boolean> {\n const cache = await fetchRRFRevocations();\n if (cache.revokedOrchestrators.has(claims.sub)) return true;\n if (jti && cache.revokedJtis.has(jti)) return true;\n return false;\n}\n\n/\n Full async M2M_TRUSTED verification: claims check + revocation list.\n \n Note: Signature verification requires the RRF public key and is typically\n * done server-side using the rcan-py SDK or castor.auth middleware.\n /\nexport async function verifyM2mTrustedToken(\n token: string,\n targetRrn: string,\n options?: { skipRevocationCheck?: boolean }\n): Promise<M2MTrustedClaims> {\n const claims = verifyM2mTrustedTokenClaims(token, targetRrn);\n\n if (!options?.skipRevocationCheck) {\n const revoked = await isM2mTrustedRevoked(claims);\n if (revoked) {\n throw new M2MAuthError(\n `M2M_TRUSTED orchestrator '${claims.sub}' is on the RRF revocation list`\n );\n }\n }\n\n return claims;\n}\n","/\n RCAN v2.2 ML-DSA-65 Signing (NIST FIPS 204)\n \n Ed25519 is deprecated. ML-DSA-65 is the ONLY signing algorithm.\n * All signed messages carry a ``signature`` block with ``alg: \"ml-dsa-65\"``.\n \n Requires: @noble/post-quantum (npm install @noble/post-quantum)\n \n Spec: https://rcan.dev/spec/v2.2#section-7-2\n /\n\nimport type { RCANMessage, SignatureBlock } from \"./message.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface MLDSAKeyPairData {\n publicKey: Uint8Array;\n secretKey?: Uint8Array;\n keyId: string;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction toBase64url(bytes: Uint8Array): string {\n let binary = \"\";\n for (let i = 0; i < bytes.length; i++) binary += String.fromCharCode(bytes[i]!);\n return btoa(binary).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/=/g, \"\");\n}\n\nfunction fromBase64url(b64: string): Uint8Array {\n const padded = b64.replace(/-/g, \"+\").replace(/_/g, \"/\");\n const binary = atob(padded);\n const bytes = new Uint8Array(binary.length);\n for (let i = 0; i < binary.length; i++) bytes[i] = binary.charCodeAt(i);\n return bytes;\n}\n\nasync function sha256hex(data: Uint8Array): Promise<string> {\n if (typeof crypto !== \"undefined\" && crypto.subtle) {\n const buf = await crypto.subtle.digest(\"SHA-256\", data.buffer as ArrayBuffer);\n return Array.from(new Uint8Array(buf))\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\")\n .slice(0, 8);\n }\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n const { createHash } = require(\"node:crypto\") as { createHash: (alg: string) => { update: (d: Uint8Array) => { digest: (enc: string) => string } } };\n return createHash(\"sha256\").update(data).digest(\"hex\").slice(0, 8);\n}\n\nlet _mlDsaModule: { ml_dsa65: { keygen: () => { publicKey: Uint8Array; secretKey: Uint8Array }; sign: (msg: Uint8Array, sk: Uint8Array) => Uint8Array; verify: (sig: Uint8Array, msg: Uint8Array, pk: Uint8Array) => boolean } } \| undefined;\n\nasync function requireMlDsa() {\n if (_mlDsaModule) return _mlDsaModule;\n if (typeof require !== \"undefined\") {\n try {\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n _mlDsaModule = require(\"@noble/post-quantum/ml-dsa.js\") as typeof _mlDsaModule;\n return _mlDsaModule!;\n } catch { / fall through / }\n }\n try {\n _mlDsaModule = await import(\"@noble/post-quantum/ml-dsa.js\") as unknown as typeof _mlDsaModule;\n return _mlDsaModule!;\n } catch {\n throw new Error(\n \"ML-DSA-65 signing requires @noble/post-quantum. \" +\n \"Install with: npm install @noble/post-quantum\"\n );\n }\n}\n\n// ---------------------------------------------------------------------------\n// MLDSAKeyPair — the only signing key type in RCAN v2.2\n// ---------------------------------------------------------------------------\n\n/\n An ML-DSA-65 (CRYSTALS-Dilithium, NIST FIPS 204) key pair.\n \n This is the ONLY signing key type in RCAN v2.2+. Ed25519 is deprecated.\n /\nexport class MLDSAKeyPair {\n readonly keyId: string;\n readonly publicKey: Uint8Array;\n readonly secretKey: Uint8Array \| undefined;\n\n private constructor(data: MLDSAKeyPairData) {\n this.keyId = data.keyId;\n this.publicKey = data.publicKey;\n this.secretKey = data.secretKey;\n }\n\n static async generate(): Promise<MLDSAKeyPair> {\n const m = await requireMlDsa();\n const kp = m!.ml_dsa65.keygen();\n const keyId = await sha256hex(kp.publicKey);\n return new MLDSAKeyPair({ publicKey: kp.publicKey, secretKey: kp.secretKey, keyId });\n }\n\n static async fromPublicKey(publicKey: Uint8Array): Promise<MLDSAKeyPair> {\n const keyId = await sha256hex(publicKey);\n return new MLDSAKeyPair({ publicKey, keyId });\n }\n\n static async fromKeyMaterial(publicKey: Uint8Array, secretKey: Uint8Array): Promise<MLDSAKeyPair> {\n const keyId = await sha256hex(publicKey);\n return new MLDSAKeyPair({ publicKey, secretKey, keyId });\n }\n\n get hasPrivateKey(): boolean { return this.secretKey !== undefined; }\n\n async signBytes(data: Uint8Array): Promise<Uint8Array> {\n if (!this.secretKey) throw new Error(\"Cannot sign: MLDSAKeyPair has no private key (verify-only)\");\n const m = await requireMlDsa();\n return m!.ml_dsa65.sign(data, this.secretKey);\n }\n\n async verifyBytes(data: Uint8Array, signature: Uint8Array): Promise<void> {\n const m = await requireMlDsa();\n const ok = m!.ml_dsa65.verify(signature, data, this.publicKey);\n if (!ok) throw new Error(\"ML-DSA-65 signature verification failed\");\n }\n\n toString(): string {\n return `MLDSAKeyPair(keyId=${this.keyId}, alg=ML-DSA-65, ${this.hasPrivateKey ? \"private+public\" : \"public-only\"})`;\n }\n}\n\n// ---------------------------------------------------------------------------\n// Canonical message bytes\n// ---------------------------------------------------------------------------\n\nfunction canonicalMessageBytes(msg: RCANMessage): Uint8Array {\n const payload = {\n rcan: msg.rcan,\n msg_id: (msg as unknown as Record<string, unknown>)[\"msgId\"] ?? \"\",\n timestamp: msg.timestamp,\n cmd: msg.cmd,\n target: msg.target,\n params: msg.params,\n };\n return new TextEncoder().encode(\n JSON.stringify(Object.fromEntries(Object.entries(payload).sort()))\n );\n}\n\n// ---------------------------------------------------------------------------\n// sign / verify\n// ---------------------------------------------------------------------------\n\n/\n Sign an RCANMessage with ML-DSA-65 (the only signing algorithm in RCAN v2.2).\n \n Sets msg.signature = { alg: \"ml-dsa-65\", kid, sig }.\n /\nexport async function signMessage(\n msg: RCANMessage,\n keypair: MLDSAKeyPair\n): Promise<RCANMessage> {\n const payload = canonicalMessageBytes(msg);\n const rawSig = await keypair.signBytes(payload);\n (msg as unknown as Record<string, unknown>)[\"signature\"] = {\n alg: \"ml-dsa-65\",\n kid: keypair.keyId,\n sig: toBase64url(rawSig),\n } satisfies SignatureBlock;\n return msg;\n}\n\n/\n Verify the ML-DSA-65 signature on an RCANMessage.\n \n @throws {Error} if signature is missing, alg is not ml-dsa-65, key not found, or invalid.\n /\nexport async function verifyMessage(\n msg: RCANMessage,\n trustedKeys: MLDSAKeyPair[]\n): Promise<void> {\n const sig = msg.signature;\n if (!sig) throw new Error(\"Message is unsigned — signature field missing\");\n if (sig.alg !== \"ml-dsa-65\") {\n throw new Error(\n `Unsupported signature algorithm: ${sig.alg}. ` +\n \"RCAN v2.2 requires ml-dsa-65 (Ed25519 is deprecated).\"\n );\n }\n const matched = trustedKeys.find((k) => k.keyId === sig.kid);\n if (!matched) {\n throw new Error(\n `No trusted ML-DSA-65 key with kid=${sig.kid}. ` +\n `Known kids: [${trustedKeys.map((k) => k.keyId).join(\", \")}]`\n );\n }\n let rawSig: Uint8Array;\n try { rawSig = fromBase64url(sig.sig); } catch (e) { throw new Error(`Invalid base64url sig: ${e}`); }\n await matched.verifyBytes(canonicalMessageBytes(msg), rawSig);\n}\n\n// ---------------------------------------------------------------------------\n// Deprecated aliases for migration\n// ---------------------------------------------------------------------------\n\n/* @deprecated Use signMessage() — Ed25519 is removed in RCAN v2.2 /\nexport const addPQSignature = signMessage;\n\n/* @deprecated Use verifyMessage() — Ed25519 is removed in RCAN v2.2 /\nexport async function verifyPQSignature(\n msg: RCANMessage,\n trustedKeys: MLDSAKeyPair[],\n _requirePQ = true\n): Promise<void> {\n return verifyMessage(msg, trustedKeys);\n}\n","/\n rcan/mcp.ts — MCP integration types for RCAN v2.2 §22\n \n Provider-agnostic: LoA is tied to the token, not the model or AI provider.\n /\n\n/* LoA → RCAN command scopes mapping (§22.4) /\nexport const LOA_TO_SCOPES: Record<number, string[]> = {\n 0: ['discover', 'status', 'transparency'],\n 1: ['chat', 'control', 'system'],\n 3: ['system', 'safety'],\n};\n\n/* Required LoA for each MCP tool (§22.3) /\nexport const TOOL_LOA_REQUIREMENTS: Record<string, number> = {\n // Tier 0 — read\n robot_ping: 0,\n robot_status: 0,\n robot_telemetry: 0,\n fleet_list: 0,\n rrf_lookup: 0,\n compliance_report: 0,\n // Tier 1 — operate\n robot_command: 1,\n harness_get: 1,\n research_run: 1,\n contribute_toggle: 1,\n components_list: 1,\n // Tier 3 — admin\n harness_set: 3,\n system_upgrade: 3,\n loa_enable: 3,\n};\n\n/* MCP client entry stored in the RCAN yaml mcp_clients: block /\nexport interface McpClientConfig {\n name: string;\n token_hash: string; // \"sha256:<hex>\" — never the raw token\n loa: number; // 0, 1, or 3\n}\n\n/* Full MCP server configuration extracted from the RCAN yaml /\nexport interface McpServerConfig {\n rrn: string;\n clients: McpClientConfig[];\n}\n\n/* Check if a client's LoA satisfies a tool's requirement /\nexport function clientAllowsTool(client: McpClientConfig, toolName: string): boolean {\n const required = TOOL_LOA_REQUIREMENTS[toolName] ?? 99;\n return client.loa >= required;\n}\n\n/* Tool call result shapes /\nexport interface RobotStatusResult {\n rrn: string;\n status: Record<string, unknown>;\n}\n\nexport interface FleetListResult {\n fleet: Record<string, unknown>[];\n}\n\nexport interface RrfLookupResult {\n entity_id: string;\n record: Record<string, unknown>;\n}\n\nexport interface RobotCommandResult {\n rrn: string;\n instruction: string;\n scope: string;\n result: Record<string, unknown>;\n}\n\nexport interface ComplianceReportResult {\n rrn: string;\n compliance: Record<string, unknown>;\n}\n","/\n RCAN v2.2 Delegation and Media envelope types.\n * Spec: https://robotregistryfoundation.org/docs/mcp/\n /\n/* A single hop in a v2.2 delegation chain. /\nexport interface DelegationHop {\n robot_rrn: string;\n scope: string;\n issued_at: string;\n expires_at: string;\n sig?: string;\n}\n\n/* An inline or by-reference media attachment for v2.2 messages. /\nexport interface MediaChunk {\n chunk_id: string;\n mime_type: string;\n size_bytes: number;\n hash_sha256: string;\n data?: string;\n ref_url?: string;\n}\n\nexport const MAX_DELEGATION_DEPTH = 3;\n\nexport function validateDelegationChain(chain: DelegationHop[]): void {\n if (chain.length > MAX_DELEGATION_DEPTH) {\n throw new Error(\n `RCAN: delegation chain max depth is ${MAX_DELEGATION_DEPTH}, got ${chain.length}`\n );\n }\n}\n\n// Allow test environments to inject a hash function (avoids ESM/CJS require issues)\n// In production, crypto.createHash is used via dynamic detection.\n// @internal\nexport let _hashImpl: ((data: string) => string) \| undefined;\n\n/* @internal — for testing only /\nexport function _setHashImpl(fn: ((data: string) => string) \| undefined): void {\n _hashImpl = fn;\n}\n\nexport function verifyMediaChunkHash(chunk: MediaChunk): void {\n if (!chunk.data) return;\n let actual: string \| undefined;\n\n if (_hashImpl) {\n actual = _hashImpl(chunk.data);\n } else {\n try {\n // Works in Node.js CJS; skipped gracefully in pure ESM/browser\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n const m = typeof require !== \"undefined\" ? require : null;\n if (!m) return;\n const { createHash } = m(\"node:crypto\") as {\n createHash: (a: string) => { update: (d: string) => { digest: (e: string) => string } };\n };\n actual = \"sha256:\" + createHash(\"sha256\").update(chunk.data).digest(\"hex\");\n } catch {\n return; // crypto unavailable\n }\n }\n\n if (actual !== chunk.hash_sha256) {\n throw new Error(`MediaChunk hash mismatch: expected ${chunk.hash_sha256}, got ${actual}`);\n }\n}\n\n// Aliases\nexport type V22DelegationHop = DelegationHop;\nexport type V22MediaChunk = MediaChunk;\nexport { validateDelegationChain as validateV22DelegationChain };\nexport { verifyMediaChunkHash as verifyV22MediaChunkHash };\n","/\n rcan-ts — Official TypeScript SDK for RCAN v1.6\n * Robot Communication and Accountability Network\n \n @see https://rcan.dev\n * @see https://github.com/continuonai/rcan-ts\n /\n\nexport { RobotURI, RobotURIError } from \"./address.js\";\nexport type { RobotURIOptions } from \"./address.js\";\n\nexport { RCANMessage, RCANMessageError, MessageType, makeCloudRelayMessage, addDelegationHop, validateDelegationChain } from \"./message.js\";\nexport type { RCANMessageData, SignatureBlock, SenderType, DelegationHop } from \"./message.js\";\n\nexport { ConfidenceGate, HiTLGate, GateError } from \"./gates.js\";\nexport type { ApprovalStatus, PendingApproval } from \"./gates.js\";\n\nexport { CommitmentRecord, AuditChain, AuditError } from \"./audit.js\";\nexport type {\n CommitmentRecordData,\n CommitmentRecordJSON,\n ChainVerifyResult,\n} from \"./audit.js\";\n\nexport { validateURI, validateMessage, validateConfig } from \"./validate.js\";\nexport type { ValidationResult, RCANConfig } from \"./validate.js\";\nexport type { RCANMetadata, RCANAgentConfig, RCANMessageEnvelope } from \"./types.js\";\n\nexport {\n RCANError,\n RCANAddressError,\n RCANValidationError,\n RCANGateError,\n RCANSignatureError,\n RCANRegistryError,\n RCANNodeError,\n RCANNodeNotFoundError,\n RCANNodeSyncError,\n RCANNodeTrustError,\n // v1.5 errors\n RCANVersionIncompatibleError,\n RCANReplayAttackError,\n RCANDelegationChainError,\n RCANConfigAuthorizationError,\n} from \"./errors.js\";\n\nexport { RegistryClient } from \"./registry.js\";\nexport type {\n RobotRegistration,\n Robot,\n RegistrationResult,\n ListResult,\n} from \"./registry.js\";\n\nexport { NodeClient } from \"./node.js\";\nexport type { RCANRegistryNode, RCANResolveResult } from \"./types.js\";\n\nexport { fetchCanonicalSchema, validateConfigAgainstSchema, validateNodeAgainstSchema } from \"./schema.js\";\n\nexport {\n makeEstopMessage,\n makeStopMessage,\n makeResumeMessage,\n makeTransparencyMessage,\n isSafetyMessage,\n validateSafetyMessage,\n SAFETY_MESSAGE_TYPE,\n} from \"./safety.js\";\nexport type { SafetyMessage, SafetyEvent, TransparencyMessage } from \"./safety.js\";\n\n// ── v1.5: version ──────────────────────────────────────────────────────────────\nexport { SPEC_VERSION, SDK_VERSION, validateVersionCompat } from \"./version.js\";\n\n// ── v1.5: replay attack prevention (GAP-03) ────────────────────────────────────\nexport { ReplayCache, validateReplay } from \"./replay.js\";\nexport type { ReplayCheckResult, ReplayableMessage } from \"./replay.js\";\n\n// ── v1.5: clock synchronization (GAP-04) ───────────────────────────────────────\nexport { checkClockSync, assertClockSynced, ClockDriftError } from \"./clock.js\";\nexport type { ClockSyncStatus } from \"./clock.js\";\n\n// ── v1.5: QoS (GAP-11) ────────────────────────────────────────────────────────\nexport { QoSLevel, QoSManager, QoSAckTimeoutError, makeEstopWithQoS } from \"./qos.js\";\nexport type { QoSSendOptions, QoSResult } from \"./qos.js\";\n\n// ── v1.5: config update (GAP-07) ──────────────────────────────────────────────\nexport { makeConfigUpdate, validateConfigUpdate } from \"./configUpdate.js\";\n\n// ── v1.5: key rotation (GAP-09) ───────────────────────────────────────────────\nexport { KeyStore, makeKeyRotationMessage } from \"./keys.js\";\nexport type { JWKEntry, JWKSDocument } from \"./keys.js\";\n\n// ── v1.5: consent wire (GAP-05) ───────────────────────────────────────────────\nexport {\n makeConsentRequest,\n makeConsentGrant,\n makeConsentDeny,\n validateConsentMessage,\n} from \"./consent.js\";\nexport type { ConsentType, ConsentRequestParams, ConsentResponseParams } from \"./consent.js\";\n\n// ── v1.5: revocation (GAP-02) ─────────────────────────────────────────────────\nexport {\n RevocationCache,\n checkRevocation,\n makeRevocationBroadcast,\n} from \"./revocation.js\";\nexport type { RevocationStatus, RevocationStatusValue } from \"./revocation.js\";\n\n// ── v1.5: training data consent (GAP-10) ──────────────────────────────────────\nexport {\n DataCategory,\n makeTrainingConsentRequest,\n makeTrainingConsentGrant,\n makeTrainingConsentDeny,\n validateTrainingDataMessage,\n} from \"./trainingConsent.js\";\nexport type { TrainingConsentRequestParams } from \"./trainingConsent.js\";\n\n// ── v1.5: offline mode (GAP-06) ───────────────────────────────────────────────\nexport { OfflineModeManager } from \"./offline.js\";\nexport type { OfflineState, OfflineCommandResult, CachedKey } from \"./offline.js\";\n\n// ── v1.5: fault reporting (GAP-20) ────────────────────────────────────────────\nexport { FaultCode, makeFaultReport } from \"./faultReport.js\";\nexport type { FaultSeverity, FaultReportParams, AuditExportRequest } from \"./faultReport.js\";\n\n// ── v1.6 / v2.1: identity, roles & LoA (§2 RBAC) ─────────────────────────────\nexport {\n Role,\n LevelOfAssurance, // backward-compat alias for Role\n ROLE_JWT_LEVEL,\n SCOPE_MIN_ROLE,\n roleFromJwtLevel,\n DEFAULT_LOA_POLICY,\n PRODUCTION_LOA_POLICY,\n extractRoleFromJwt,\n extractLoaFromJwt, // backward-compat alias\n extractIdentityFromJwt,\n validateRoleForScope,\n validateLoaForScope,\n} from \"./identity.js\";\nexport type { LoaPolicy, IdentityRecord, ScopeValidationResult } from \"./identity.js\";\n\n// ── v1.6: federation (GAP-16) ─────────────────────────────────────────────────\nexport {\n RegistryTier,\n FederationSyncType,\n TrustAnchorCache,\n makeFederationSync,\n validateCrossRegistryCommand,\n} from \"./federation.js\";\nexport type { RegistryIdentity, FederationSyncPayload } from \"./federation.js\";\n\n// ── v1.6: transport encodings (GAP-17) ────────────────────────────────────────\nexport {\n TransportEncoding,\n TransportError,\n encodeCompact,\n decodeCompact,\n encodeMinimal,\n decodeMinimal,\n encodeBleFrames,\n decodeBleFrames,\n selectTransport,\n} from \"./transport.js\";\n\n// ── v1.6: multi-modal data (GAP-18) ───────────────────────────────────────────\nexport {\n MediaEncoding,\n addMediaInline,\n addMediaRef,\n validateMediaChunks,\n makeTrainingDataMessage,\n makeStreamChunk,\n} from \"./multimodal.js\";\nexport type { MediaChunk, StreamChunk } from \"./multimodal.js\";\n\nexport const VERSION = \"0.6.0\";\n/* @deprecated Use SPEC_VERSION from ./version instead /\nexport const RCAN_VERSION = \"1.6\";\n\nexport { makeContributeRequest, makeContributeResult, makeContributeCancel, validateContributeScope, isPreemptedBy, CONTRIBUTE_SCOPE_LEVEL } from \"./contribute\";\nexport type { ContributeRequest, ContributeResult, ContributeCancel, WorkUnitStatus, ComputeResource } from \"./contribute\";\n\n// ── v1.10: competition protocol ────────────────────────────────────────────────\nexport {\n COMPETITION_SCOPE_LEVEL,\n makeCompetitionEnter,\n makeCompetitionScore,\n makeSeasonStanding,\n makePersonalResearchResult,\n validateCompetitionScope,\n} from \"./competition.js\";\nexport type {\n CompetitionFormat,\n CompetitionBadge,\n RunType,\n StandingEntry,\n ResearchMetrics,\n CompetitionEnter,\n CompetitionScore,\n SeasonStanding,\n PersonalResearchResult,\n} from \"./competition.js\";\n\n// ── v2.1: Firmware Manifests (§11) ───────────────────────────────────────────\nexport {\n FIRMWARE_MANIFEST_PATH,\n FirmwareIntegrityError,\n manifestToWire,\n manifestFromWire,\n canonicalManifestJson,\n validateManifest,\n} from \"./firmware.js\";\nexport type {\n FirmwareComponent,\n FirmwareManifest,\n FirmwareManifestWire,\n} from \"./firmware.js\";\n\n// ── v2.1: Authority Access (§13 / EU AI Act §16) ────────────────────────────\nexport {\n AUTHORITY_ERROR_CODES,\n authorityAccessToWire,\n authorityAccessFromWire,\n validateAuthorityAccess,\n isAuthorityRequestValid,\n} from \"./authority.js\";\nexport type {\n AuthorityDataCategory,\n AuthorityAccessPayload,\n AuthorityAccessPayloadWire,\n AuthorityResponsePayload,\n AuthorityResponseData,\n} from \"./authority.js\";\n\n// ── v2.1: M2M Authorization (§2.8–§2.9) ────────────────────────────────────\nexport {\n M2MAuthError,\n M2M_TRUSTED_ISSUER,\n RRF_REVOCATION_URL,\n RRF_REVOCATION_CACHE_TTL_MS,\n parseM2mPeerToken,\n parseM2mTrustedToken,\n verifyM2mTrustedTokenClaims,\n verifyM2mTrustedToken,\n isM2mTrustedRevoked,\n fetchRRFRevocations,\n} from \"./m2m.js\";\nexport type { M2MPeerClaims, M2MTrustedClaims } from \"./m2m.js\";\n\n// v2.2: ML-DSA-65 signing (FIPS 204) — Ed25519 deprecated\nexport { MLDSAKeyPair, signMessage, verifyMessage, addPQSignature, verifyPQSignature } from \"./pqSigning.js\";\nexport type { MLDSAKeyPairData } from \"./pqSigning.js\";\n\nexport from './mcp';\n\n// ── v2.2: Delegation and media envelope types ────────────────────────────────\nexport type { V22DelegationHop, V22MediaChunk } from './delegation.js';\nexport { validateV22DelegationChain, verifyV22MediaChunkHash } from './delegation.js';\n"],"mappings":";;;;;;;;;;;AAOO,IAAM,gBAAN,cAA4B,MAAM;AAAA,EACvC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAUO,IAAM,WAAN,MAAM,UAAS;AAAA,EAOZ,YAAY,MAAiC;AANrD,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAGP,SAAK,WAAW,KAAK;AACrB,SAAK,eAAe,KAAK;AACzB,SAAK,QAAQ,KAAK;AAClB,SAAK,UAAU,KAAK;AACpB,SAAK,WAAW,KAAK;AAAA,EACvB;AAAA;AAAA,EAGA,OAAO,MAAM,KAAuB;AAClC,QAAI,CAAC,IAAI,WAAW,SAAS,GAAG;AAC9B,YAAM,IAAI,cAAc,6CAAwC,GAAG,EAAE;AAAA,IACvE;AACA,UAAM,gBAAgB,IAAI,MAAM,UAAU,MAAM;AAChD,UAAM,QAAQ,cAAc,MAAM,GAAG;AACrC,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,oGAA+F,MAAM,MAAM,QAAQ,GAAG;AAAA,MACxH;AAAA,IACF;AACA,UAAM,CAAC,UAAU,cAAc,OAAO,SAAS,QAAQ,IAAI;AAC3D,eAAW,CAAC,MAAM,KAAK,KAAK;AAAA,MAC1B,CAAC,YAAY,QAAQ;AAAA,MACrB,CAAC,gBAAgB,YAAY;AAAA,MAC7B,CAAC,SAAS,KAAK;AAAA,MACf,CAAC,WAAW,OAAO;AAAA,MACnB,CAAC,aAAa,QAAQ;AAAA,IACxB,GAAyB;AACvB,UAAI,CAAC,SAAS,MAAM,KAAK,MAAM,IAAI;AACjC,cAAM,IAAI,cAAc,gBAAgB,IAAI,qBAAqB;AAAA,MACnE;AAAA,IACF;AACA,WAAO,IAAI,UAAS,EAAE,UAAU,cAAc,OAAO,SAAS,SAAS,CAAC;AAAA,EAC1E;AAAA;AAAA,EAGA,OAAO,MAAM,MAAiC;AAC5C,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,EAAE,cAAc,OAAO,SAAS,SAAS,IAAI;AACnD,eAAW,CAAC,MAAM,KAAK,KAAK;AAAA,MAC1B,CAAC,gBAAgB,YAAY;AAAA,MAC7B,CAAC,SAAS,KAAK;AAAA,MACf,CAAC,WAAW,OAAO;AAAA,MACnB,CAAC,YAAY,QAAQ;AAAA,IACvB,GAAyB;AACvB,UAAI,CAAC,SAAS,MAAM,KAAK,MAAM,IAAI;AACjC,cAAM,IAAI,cAAc,IAAI,IAAI,qBAAqB;AAAA,MACvD;AAAA,IACF;AACA,WAAO,IAAI,UAAS,EAAE,UAAU,cAAc,OAAO,SAAS,SAAS,CAAC;AAAA,EAC1E;AAAA;AAAA,EAGA,WAAmB;AACjB,WAAO,UAAU,KAAK,QAAQ,IAAI,KAAK,YAAY,IAAI,KAAK,KAAK,IAAI,KAAK,OAAO,IAAI,KAAK,QAAQ;AAAA,EACpG;AAAA;AAAA,EAGA,IAAI,YAAoB;AACtB,WAAO,GAAG,KAAK,YAAY,IAAI,KAAK,KAAK;AAAA,EAC3C;AAAA;AAAA,EAGA,IAAI,cAAsB;AACxB,WAAO,WAAW,KAAK,QAAQ,aAAa,KAAK,YAAY,IAAI,KAAK,KAAK,IAAI,KAAK,OAAO,IAAI,KAAK,QAAQ;AAAA,EAC9G;AAAA;AAAA,EAGA,OAAO,OAA0B;AAC/B,WAAO,KAAK,SAAS,MAAM,MAAM,SAAS;AAAA,EAC5C;AAAA,EAEA,SAAiB;AACf,WAAO;AAAA,MACL,KAAK,KAAK,SAAS;AAAA,MACnB,UAAU,KAAK;AAAA,MACf,cAAc,KAAK;AAAA,MACnB,OAAO,KAAK;AAAA,MACZ,SAAS,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,IACjB;AAAA,EACF;AACF;;;ACvGO,IAAM,eAAe;AAGrB,IAAM,cAAc;AAWpB,SAAS,sBACd,iBACA,eAAuB,cACd;AACT,QAAM,aAAa,CAAC,MAAgC;AAClD,UAAM,QAAQ,EAAE,MAAM,GAAG;AACzB,UAAM,QAAQ,SAAS,MAAM,CAAC,KAAK,KAAK,EAAE;AAC1C,UAAM,QAAQ,SAAS,MAAM,CAAC,KAAK,KAAK,EAAE;AAC1C,WAAO,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK;AAAA,EAC5D;AAEA,QAAM,CAAC,OAAO,IAAI,WAAW,eAAe;AAC5C,QAAM,CAAC,UAAU,IAAI,WAAW,YAAY;AAG5C,SAAO,YAAY;AACrB;;;ACdO,IAAK,cAAL,kBAAKA,iBAAL;AAEL,EAAAA,0BAAA,aAAqB,KAArB;AACA,EAAAA,0BAAA,cAAqB,KAArB;AACA,EAAAA,0BAAA,YAAqB,KAArB;AACA,EAAAA,0BAAA,eAAqB,KAArB;AACA,EAAAA,0BAAA,YAAqB,KAArB;AACA,EAAAA,0BAAA,YAAqB,KAArB;AACA,EAAAA,0BAAA,UAAqB,KAArB;AACA,EAAAA,0BAAA,WAAqB,KAArB;AAGA,EAAAA,0BAAA,cAAqB,KAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,YAAqB,MAArB;AACA,EAAAA,0BAAA,mBAAqB,MAArB;AACA,EAAAA,0BAAA,mBAAqB,MAArB;AAGA,EAAAA,0BAAA,uBAAqB,MAArB;AACA,EAAAA,0BAAA,sBAAqB,MAArB;AAGA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,iBAAqB,MAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,sBAAqB,MAArB;AACA,EAAAA,0BAAA,qBAAqB,MAArB;AACA,EAAAA,0BAAA,mBAAqB,MAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,mBAAqB,MAArB;AACA,EAAAA,0BAAA,eAAqB,MAArB;AACA,EAAAA,0BAAA,iBAAqB,MAArB;AAGA,EAAAA,0BAAA,kBAAqB,MAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AACA,EAAAA,0BAAA,oBAAqB,MAArB;AAGA,EAAAA,0BAAA,iBAAqB,MAArB;AACA,EAAAA,0BAAA,8BAA2B,MAA3B;AACA,EAAAA,0BAAA,4BAA2B,MAA3B;AACA,EAAAA,0BAAA,2BAA2B,MAA3B;AAGA,EAAAA,0BAAA,wBAAqB,MAArB;AACA,EAAAA,0BAAA,uBAAqB,MAArB;AACA,EAAAA,0BAAA,uBAAqB,MAArB;AAGA,EAAAA,0BAAA,mBAAqB,MAArB;AAGA,EAAAA,0BAAA,uBAA6B,MAA7B;AACA,EAAAA,0BAAA,uBAA6B,MAA7B;AACA,EAAAA,0BAAA,qBAA6B,MAA7B;AACA,EAAAA,0BAAA,8BAA6B,MAA7B;AAIA,EAAAA,0BAAA,sBAA6B,MAA7B;AAEA,EAAAA,0BAAA,wBAA6B,MAA7B;AAEA,EAAAA,0BAAA,0BAA6B,MAA7B;AAEA,EAAAA,0BAAA,iBAA6B,MAA7B;AA3EU,SAAAA;AAAA,GAAA;AA4JL,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAC1C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,cAAN,MAAM,aAAY;AAAA,EAkCvB,YAAY,MAAuB;AAjCnC,wBAAS;AAET;AAAA,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAET;AAAA,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAGP,QAAI,CAAC,KAAK,OAAO,KAAK,IAAI,KAAK,MAAM,IAAI;AACvC,YAAM,IAAI,iBAAiB,mBAAmB;AAAA,IAChD;AACA,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAM,IAAI,iBAAiB,sBAAsB;AAAA,IACnD;AAEA,SAAK,OAAO,KAAK,QAAQ;AACzB,SAAK,cAAc,KAAK,eAAe;AACvC,SAAK,MAAM,KAAK;AAChB,SAAK,SACH,KAAK,kBAAkB,WAAW,KAAK,OAAO,SAAS,IAAI,OAAO,KAAK,MAAM;AAC/E,SAAK,SAAS,KAAK,UAAU,CAAC;AAC9B,SAAK,aAAa,KAAK;AACvB,SAAK,gBAAgB,KAAK,iBAAiB,KAAK;AAChD,SAAK,YAAY,KAAK;AACtB,SAAK,YAAY,KAAK,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1D,SAAK,aAAa,KAAK;AACvB,SAAK,gBAAgB,KAAK;AAC1B,SAAK,QAAQ,KAAK;AAClB,SAAK,kBAAkB,KAAK;AAC5B,SAAK,UAAU,KAAK;AACpB,SAAK,MAAM,KAAK;AAChB,SAAK,mBAAmB,KAAK;AAC7B,SAAK,kBAAkB,KAAK;AAC5B,SAAK,WAAW,KAAK;AACrB,SAAK,MAAM,KAAK;AAChB,SAAK,oBAAoB,KAAK;AAC9B,SAAK,cAAc,KAAK;AACxB,SAAK,eAAe,KAAK;AACzB,SAAK,iBAAiB,KAAK;AAC3B,SAAK,QAAQ,KAAK;AAGlB,QACE,KAAK,cAAc,UAClB,KAAK,UAAiD,KAAK,MAAM,WAClE;AACA,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,eAAe,QAAW;AACjC,UAAI,KAAK,aAAa,KAAK,KAAK,aAAa,GAAG;AAC9C,cAAM,IAAI;AAAA,UACR,+CAA0C,KAAK,UAAU;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAO,KAAK,cAAc,UAAa,KAAK,UAAU,QAAQ;AAAA,EAChE;AAAA;AAAA,EAGA,IAAI,aAAsB;AACxB,WAAO,KAAK,eAAe;AAAA,EAC7B;AAAA;AAAA,EAGA,SAAkC;AAChC,UAAM,MAA+B;AAAA,MACnC,MAAM,KAAK;AAAA,MACX,aAAa,KAAK;AAAA,MAClB,KAAK,KAAK;AAAA,MACV,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB;AACA,QAAI,OAAO,KAAK,KAAK,MAAM,EAAE,SAAS,EAAG,KAAI,SAAS,KAAK;AAC3D,QAAI,KAAK,eAAe,OAAW,KAAI,aAAa,KAAK;AACzD,QAAI,KAAK,cAAe,KAAI,iBAAiB,KAAK;AAClD,QAAI,KAAK,UAAW,KAAI,YAAY,KAAK;AACzC,QAAI,KAAK,eAAe,OAAW,KAAI,aAAa,KAAK;AACzD,QAAI,KAAK,kBAAkB,OAAW,KAAI,gBAAgB,KAAK;AAC/D,QAAI,KAAK,UAAU,OAAW,KAAI,QAAQ,KAAK;AAC/C,QAAI,KAAK,oBAAoB,OAAW,KAAI,kBAAkB,KAAK;AACnE,QAAI,KAAK,YAAY,OAAW,KAAI,UAAU,KAAK;AACnD,QAAI,KAAK,QAAQ,OAAW,KAAI,MAAM,KAAK;AAC3C,QAAI,KAAK,qBAAqB,OAAW,KAAI,mBAAmB,KAAK;AACrE,QAAI,KAAK,oBAAoB,OAAW,KAAI,kBAAkB,KAAK;AACnE,QAAI,KAAK,aAAa,OAAW,KAAI,WAAW,KAAK;AACrD,QAAI,KAAK,QAAQ,OAAW,KAAI,MAAM,KAAK;AAC3C,QAAI,KAAK,sBAAsB,OAAW,KAAI,oBAAoB,KAAK;AACvE,QAAI,KAAK,gBAAgB,OAAW,KAAI,cAAc,KAAK;AAC3D,QAAI,KAAK,iBAAiB,OAAW,KAAI,eAAe,KAAK;AAC7D,QAAI,KAAK,mBAAmB,OAAW,KAAI,iBAAiB,KAAK;AACjE,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,aAAa,QAAyB;AACpC,WAAO,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,MAAM;AAAA,EACnD;AAAA;AAAA,EAGA,OAAO,SAAS,MAAqD;AACnE,QAAI;AACJ,QAAI,OAAO,SAAS,UAAU;AAC5B,UAAI;AACF,cAAM,KAAK,MAAM,IAAI;AAAA,MACvB,QAAQ;AACN,cAAM,IAAI,iBAAiB,qBAAqB;AAAA,MAClD;AAAA,IACF,OAAO;AACL,YAAM;AAAA,IACR;AAEA,QAAI,CAAC,IAAI,IAAK,OAAM,IAAI,iBAAiB,+BAA+B;AACxE,QAAI,CAAC,IAAI,OAAQ,OAAM,IAAI,iBAAiB,kCAAkC;AAC9E,QAAI,CAAC,IAAI,KAAM,OAAM,IAAI,iBAAiB,gCAAgC;AAE1E,WAAO,IAAI,aAAY;AAAA,MACrB,MAAM,IAAI;AAAA,MACV,aAAc,IAAI;AAAA,MAClB,KAAK,IAAI;AAAA,MACT,QAAQ,IAAI;AAAA,MACZ,QAAS,IAAI,UAAsC,CAAC;AAAA,MACpD,YAAY,IAAI;AAAA,MAChB,eACG,IAAI,kBACJ,IAAI;AAAA,MACP,WAAW,IAAI;AAAA,MACf,WAAW,IAAI;AAAA,MACf,YAAY,IAAI;AAAA,MAChB,eAAe,IAAI;AAAA,MACnB,OAAO,IAAI;AAAA,MACX,iBAAiB,IAAI;AAAA,MACrB,SAAS,IAAI;AAAA,MACb,KAAK,IAAI;AAAA,MACT,kBAAkB,IAAI;AAAA,MACtB,iBAAiB,IAAI;AAAA,MACrB,UAAU,IAAI;AAAA,MACd,KAAK,IAAI;AAAA,MACT,mBAAmB,IAAI;AAAA,MACvB,aAAa,IAAI;AAAA,MACjB,cAAc,IAAI;AAAA,MAClB,gBAAgB,IAAI;AAAA,MACpB,OAAO,IAAI;AAAA,IACb,CAAC;AAAA,EACH;AACF;AASO,SAAS,sBACd,MACA,UACa;AACb,QAAM,OAAO,KAAK,OAAO;AACzB,OAAK,aAAa;AAClB,OAAK,gBAAgB;AACrB,SAAO,IAAI,YAAY,IAAI;AAC7B;AAOO,SAAS,iBACd,KACA,KACa;AACb,QAAM,QAAQ,IAAI,kBAAkB,CAAC,GAAG,IAAI,iBAAiB,GAAG,IAAI,CAAC,GAAG;AACxE,QAAM,OAAO,IAAI,OAAO;AACxB,OAAK,kBAAkB;AACvB,SAAO,IAAI,YAAY,IAAI;AAC7B;AAUO,SAAS,wBACd,OACoC;AACpC,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,EAAE,OAAO,OAAO,QAAQ,iDAAiD;AAAA,EAClF;AACA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,CAAC,IAAK,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,gBAAgB;AACjE,QAAI,CAAC,IAAI,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,uBAAuB;AACnF,QAAI,CAAC,IAAI,aAAc,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,yBAAyB;AACvF,QAAI,CAAC,IAAI,UAAW,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,sBAAsB;AACjF,QAAI,CAAC,IAAI,MAAO,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,kBAAkB;AACzE,QAAI,CAAC,IAAI,UAAW,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,sBAAsB;AAAA,EACnF;AACA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;;;AC9ZO,SAAS,eAAuB;AACrC,MAAI,OAAO,WAAW,WAAW,eAAe,OAAO,WAAW,OAAO,eAAe,YAAY;AAClG,WAAO,WAAW,OAAO,WAAW;AAAA,EACtC;AAEA,MAAI;AAEF,UAAM,EAAE,WAAW,IAAI,UAAQ,QAAQ;AACvC,WAAO,WAAW;AAAA,EACpB,QAAQ;AAEN,WAAO,uCAAuC,QAAQ,SAAS,CAAC,MAAM;AACpE,YAAM,IAAK,KAAK,OAAO,IAAI,KAAM;AACjC,YAAM,IAAI,MAAM,MAAM,IAAK,IAAI,IAAO;AACtC,aAAO,EAAE,SAAS,EAAE;AAAA,IACtB,CAAC;AAAA,EACH;AACF;AAMO,SAAS,eAAe,QAAgB,MAAsB;AAEnE,MAAI,OAAO,YAAY,eAAe,QAAwB;AAC5D,QAAI;AAEF,YAAM,EAAE,WAAW,IAAI;AAGvB,aAAO,WAAW,UAAU,MAAM,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK;AAAA,IAC/D,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO,eAAe,QAAQ,IAAI;AACpC;AAKA,SAAS,OAAO,KAA6B;AAC3C,QAAM,IAAI;AAAA,IACR;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,EACtC;AACA,MAAI,KAAK,YAAY,KAAK,YAAY,KAAK,YAAY,KAAK;AAC5D,MAAI,KAAK,YAAY,KAAK,YAAY,KAAK,WAAY,KAAK;AAE5D,QAAM,SAAS,IAAI;AACnB,QAAM,SAAS,SAAS;AACxB,QAAM,SAAmB,CAAC,GAAG,GAAG;AAChC,SAAO,KAAK,GAAI;AAChB,SAAQ,OAAO,SAAS,OAAQ,GAAI,QAAO,KAAK,CAAC;AACjD,WAAS,IAAI,GAAG,KAAK,GAAG,IAAK,QAAO,KAAM,SAAS,KAAK,IAAI,GAAG,IAAI,CAAC,IAAK,GAAI;AAE7E,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,IAAI;AAC1C,UAAM,IAAc,CAAC;AACrB,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAE,CAAC,IAAK,OAAO,IAAE,IAAE,CAAC,KAAG,KAAK,OAAO,IAAE,IAAE,IAAE,CAAC,KAAG,KAAK,OAAO,IAAE,IAAE,IAAE,CAAC,KAAG,IAAG,OAAO,IAAE,IAAE,IAAE,CAAC;AAAA,IACtF;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,KAAK,IAAI,EAAE,IAAE,EAAE,GAAE,CAAC,IAAE,IAAI,EAAE,IAAE,EAAE,GAAE,EAAE,IAAG,EAAE,IAAE,EAAE,MAAI;AACrD,YAAM,KAAK,IAAI,EAAE,IAAE,CAAC,GAAE,EAAE,IAAE,IAAI,EAAE,IAAE,CAAC,GAAE,EAAE,IAAG,EAAE,IAAE,CAAC,MAAI;AACnD,QAAE,CAAC,IAAK,EAAE,IAAE,EAAE,IAAE,KAAG,EAAE,IAAE,CAAC,IAAE,OAAQ;AAAA,IACpC;AACA,QAAI,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,IAAI,CAAC,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE;AAChD,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,KAAK,IAAI,GAAE,CAAC,IAAE,IAAI,GAAE,EAAE,IAAE,IAAI,GAAE,EAAE;AACtC,YAAM,KAAM,IAAE,IAAI,CAAC,IAAE;AACrB,YAAM,QAAS,IAAE,KAAG,KAAG,EAAE,CAAC,IAAE,EAAE,CAAC,MAAK;AACpC,YAAM,KAAK,IAAI,GAAE,CAAC,IAAE,IAAI,GAAE,EAAE,IAAE,IAAI,GAAE,EAAE;AACtC,YAAM,MAAO,IAAE,IAAI,IAAE,IAAI,IAAE;AAC3B,YAAM,QAAS,KAAG,QAAO;AACzB,OAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,IAAI,CAAC,GAAE,GAAE,GAAG,IAAE,UAAS,GAAE,GAAE,GAAE,GAAG,QAAM,UAAS,CAAC;AAAA,IAClE;AACA,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AACzD,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAA,EAC3D;AACA,QAAM,MAAM,IAAI,WAAW,EAAE;AAC7B,QAAM,OAAO,IAAI,SAAS,IAAI,MAAM;AACpC,GAAC,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,EAAE,QAAQ,CAAC,GAAE,MAAM,KAAK,UAAU,IAAE,GAAG,CAAC,CAAC;AACjE,SAAO;AACT;AAEA,SAAS,IAAI,GAAW,GAAmB;AAAE,SAAQ,MAAI,IAAI,KAAI,KAAG;AAAK;AAEzE,SAAS,QAAQ,GAAuB;AACtC,MAAI,OAAO,gBAAgB,YAAa,QAAO,IAAI,YAAY,EAAE,OAAO,CAAC;AACzE,QAAM,MAAM,IAAI,WAAW,EAAE,MAAM;AACnC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI;AAC9D,SAAO;AACT;AAEA,SAAS,MAAM,OAA2B;AACxC,SAAO,MAAM,KAAK,KAAK,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAE,GAAG,CAAC,EAAE,KAAK,EAAE;AAC3E;AAEA,SAAS,eAAe,KAAa,MAAsB;AACzD,QAAM,QAAQ;AACd,MAAI,WAAW,QAAQ,GAAG;AAC1B,MAAI,SAAS,SAAS,MAAO,YAAW,OAAO,QAAQ;AACvD,QAAM,OAAO,IAAI,WAAW,KAAK,GAAG,OAAO,IAAI,WAAW,KAAK;AAC/D,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,SAAK,CAAC,KAAK,SAAS,CAAC,KAAK,KAAK;AAC/B,SAAK,CAAC,KAAK,SAAS,CAAC,KAAK,KAAK;AAAA,EACjC;AACA,QAAM,YAAY,QAAQ,IAAI;AAC9B,QAAM,QAAQ,IAAI,WAAW,QAAQ,UAAU,MAAM;AACrD,QAAM,IAAI,IAAI;AAAG,QAAM,IAAI,WAAW,KAAK;AAC3C,QAAM,YAAY,OAAO,KAAK;AAC9B,QAAM,QAAQ,IAAI,WAAW,QAAQ,EAAE;AACvC,QAAM,IAAI,IAAI;AAAG,QAAM,IAAI,WAAW,KAAK;AAC3C,SAAO,MAAM,OAAO,KAAK,CAAC;AAC5B;;;ACrIO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAMO,IAAM,iBAAN,MAAqB;AAAA,EAG1B,YAAY,YAAY,KAAK;AAF7B,wBAAS;AAGP,QAAI,YAAY,KAAK,YAAY,GAAG;AAClC,YAAM,IAAI,UAAU,8CAAyC,SAAS,EAAE;AAAA,IAC1E;AACA,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAGA,OAAO,YAA6B;AAClC,WAAO,cAAc,KAAK;AAAA,EAC5B;AAAA;AAAA,EAGA,OAAO,YAA4B;AACjC,WAAO,aAAa,KAAK;AAAA,EAC3B;AAAA;AAAA,EAGA,OAAO,YAAoB,QAAuB;AAChD,QAAI,CAAC,KAAK,OAAO,UAAU,GAAG;AAC5B,YAAM,QAAQ,SAAS,gBAAgB,MAAM,MAAM;AACnD,YAAM,IAAI;AAAA,QACR,cAAc,UAAU,GAAG,KAAK,uBAAuB,KAAK,SAAS;AAAA,MACvE;AAAA,IACF;AAAA,EACF;AACF;AAiBO,IAAM,WAAN,MAAe;AAAA,EAAf;AACL,wBAAQ,YAAyC,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMzD,QAAQ,QAAgB,UAAmC,CAAC,GAAW;AACrE,UAAM,QAAQ,aAAa;AAC3B,SAAK,SAAS,IAAI,OAAO;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,QAAQ;AAAA,IACV,CAAC;AACD,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAQ,OAAqB;AAC3B,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK;AACxC,QAAI,CAAC,SAAU,OAAM,IAAI,UAAU,kBAAkB,KAAK,EAAE;AAC5D,aAAS,SAAS;AAAA,EACpB;AAAA;AAAA,EAGA,KAAK,OAAe,QAAuB;AACzC,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK;AACxC,QAAI,CAAC,SAAU,OAAM,IAAI,UAAU,kBAAkB,KAAK,EAAE;AAC5D,aAAS,SAAS;AAClB,QAAI,OAAQ,UAAS,SAAS;AAAA,EAChC;AAAA;AAAA,EAGA,MAAM,OAA+B;AACnC,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK;AACxC,QAAI,CAAC,SAAU,OAAM,IAAI,UAAU,kBAAkB,KAAK,EAAE;AAC5D,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA,EAGA,IAAI,mBAAsC;AACxC,WAAO,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,SAAS;AAAA,EAChF;AAAA;AAAA,EAGA,YAAY,OAA4C;AACtD,WAAO,KAAK,SAAS,IAAI,KAAK;AAAA,EAChC;AAAA;AAAA,EAGA,gBAAsB;AACpB,eAAW,CAAC,OAAO,QAAQ,KAAK,KAAK,SAAS,QAAQ,GAAG;AACvD,UAAI,SAAS,WAAW,WAAW;AACjC,aAAK,SAAS,OAAO,KAAK;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACF;;;AC1FO,IAAM,aAAN,cAAyB,MAAM;AAAA,EACpC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEA,SAAS,mBACP,UACA,QACA,UACA,WACA,QACQ;AACR,QAAM,UAAU,KAAK;AAAA,IACnB,EAAE,UAAU,QAAQ,UAAU,WAAW,OAAO;AAAA,IAChD,OAAO,KAAK,EAAE,UAAU,QAAQ,UAAU,WAAW,OAAO,CAAC,EAAE,KAAK;AAAA,EACtE;AACA,SAAO,eAAe,qBAAqB,OAAO;AACpD;AAEA,SAAS,YAAY,QAAgB,MAAoC;AACvE,QAAM,EAAE,MAAM,UAAU,GAAG,KAAK,IAAI;AACpC,QAAM,UAAU,KAAK,UAAU,MAAM,OAAO,KAAK,IAAI,EAAE,KAAK,CAAC;AAC7D,SAAO,eAAe,QAAQ,OAAO;AACvC;AAEO,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EAapB,YAAY,MAA4B;AAZhD,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAGP,SAAK,WAAW,KAAK;AACrB,SAAK,SAAS,KAAK;AACnB,SAAK,WAAW,KAAK;AACrB,SAAK,aAAa,KAAK;AACvB,SAAK,gBAAgB,KAAK;AAC1B,SAAK,SAAS,KAAK;AACnB,SAAK,iBAAiB,KAAK;AAC3B,SAAK,YAAY,KAAK;AACtB,SAAK,cAAc,KAAK;AACxB,SAAK,eAAe,KAAK;AACzB,SAAK,OAAO,KAAK;AAAA,EACnB;AAAA,EAEA,OAAO,OACL,MACA,QACA,eAA8B,MACZ;AAClB,UAAM,WAAW,aAAa;AAC9B,UAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,UAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,cAAc,mBAAmB,UAAU,KAAK,QAAQ,UAAU,WAAW,MAAM;AAEzF,UAAM,QAA8B;AAAA,MAClC;AAAA,MACA,QAAQ,KAAK;AAAA,MACb;AAAA,MACA,YAAY,KAAK;AAAA,MACjB,eAAe,KAAK;AAAA,MACpB;AAAA,MACA,gBAAgB,KAAK,kBAAkB;AAAA,MACvC;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM;AAAA,IACR;AACA,UAAM,OAAO,YAAY,QAAQ,KAAK;AACtC,WAAO,IAAI,kBAAiB,KAAK;AAAA,EACnC;AAAA,EAEA,OAAO,QAAyB;AAC9B,UAAM,WAAW,YAAY,QAAQ,KAAK,OAAO,CAAC;AAClD,WAAO,aAAa,KAAK;AAAA,EAC3B;AAAA,EAEA,SAA+B;AAC7B,WAAO;AAAA,MACL,UAAU,KAAK;AAAA,MACf,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,eAAe,KAAK;AAAA,MACpB,QAAQ,KAAK;AAAA,MACb,gBAAgB,KAAK;AAAA,MACrB,WAAW,KAAK;AAAA,MAChB,aAAa,KAAK;AAAA,MAClB,cAAc,KAAK;AAAA,MACnB,MAAM,KAAK;AAAA,IACb;AAAA,EACF;AAAA,EAEA,OAAO,SAAS,KAA6C;AAC3D,WAAO,IAAI,kBAAiB,GAAG;AAAA,EACjC;AACF;AAYO,IAAM,aAAN,MAAM,YAAW;AAAA,EAItB,YAAY,QAAgB;AAH5B,wBAAQ,YAA+B,CAAC;AACxC,wBAAQ;AAGN,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,UAAuC;AACzC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OAAO,MAA8C;AACnD,UAAM,OAAO,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC;AACnD,UAAM,WAAW,MAAM,eAAe;AACtC,UAAM,SAAS,iBAAiB,OAAO,MAAM,KAAK,SAAS,QAAQ;AACnE,SAAK,SAAS,KAAK,MAAM;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,YAA+B;AAC7B,UAAM,SAAmB,CAAC;AAC1B,QAAI,WAA0B;AAE9B,eAAW,UAAU,KAAK,UAAU;AAClC,UAAI,CAAC,OAAO,OAAO,KAAK,OAAO,GAAG;AAChC,eAAO,KAAK,2BAA2B,OAAO,SAAS,MAAM,GAAG,CAAC,CAAC,EAAE;AAAA,MACtE;AACA,UAAI,aAAa,QAAQ,OAAO,iBAAiB,UAAU;AACzD,eAAO;AAAA,UACL,mBAAmB,OAAO,SAAS,MAAM,GAAG,CAAC,CAAC,mBAAmB,SAAS,MAAM,GAAG,EAAE,CAAC;AAAA,QACxF;AAAA,MACF;AACA,iBAAW,OAAO;AAAA,IACpB;AAEA,WAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,OAAO;AAAA,EAC3E;AAAA,EAEA,UAAkB;AAChB,WAAO,KAAK,SAAS,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI;AAAA,EAC3E;AAAA,EAEA,OAAO,UAAU,MAAc,QAA4B;AACzD,UAAM,QAAQ,IAAI,YAAW,MAAM;AACnC,UAAM,QAAQ,KAAK,KAAK,EAAE,MAAM,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,MAAM,EAAE;AACnE,eAAW,QAAQ,OAAO;AACxB,YAAM,MAAM,KAAK,MAAM,IAAI;AAC3B,YAAM,SAAS,KAAK,iBAAiB,SAAS,GAAG,CAAC;AAAA,IACpD;AACA,WAAO;AAAA,EACT;AACF;;;ACvLA,SAAS,aAA+B;AACtC,SAAO,EAAE,IAAI,MAAM,QAAQ,CAAC,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC,EAAE;AACxD;AAEA,SAAS,KAAK,QAA0B,KAAmB;AACzD,SAAO,KAAK;AACZ,SAAO,OAAO,KAAK,GAAG;AACxB;AAEA,SAAS,KAAK,QAA0B,KAAmB;AACzD,SAAO,SAAS,KAAK,GAAG;AAC1B;AAEA,SAAS,KAAK,QAA0B,KAAmB;AACzD,SAAO,KAAK,KAAK,GAAG;AACtB;AAMO,SAAS,YAAY,KAA+B;AACzD,QAAM,SAAS,WAAW;AAC1B,MAAI;AACF,UAAM,SAAS,SAAS,MAAM,GAAG;AACjC,SAAK,QAAQ,uBAAkB;AAC/B,SAAK,QAAQ,oBAAoB,OAAO,QAAQ,EAAE;AAClD,SAAK,QAAQ,oBAAoB,OAAO,YAAY,EAAE;AACtD,SAAK,QAAQ,oBAAoB,OAAO,KAAK,EAAE;AAC/C,SAAK,QAAQ,oBAAoB,OAAO,OAAO,EAAE;AACjD,SAAK,QAAQ,oBAAoB,OAAO,QAAQ,EAAE;AAAA,EACpD,SAAS,GAAG;AACV,SAAK,QAAQ,qBAAqB,aAAa,QAAQ,EAAE,UAAU,CAAC,EAAE;AAAA,EACxE;AACA,SAAO;AACT;AAMO,SAAS,gBAAgB,MAAiC;AAC/D,QAAM,SAAS,WAAW;AAE1B,MAAI;AACJ,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI;AACF,YAAM,KAAK,MAAM,IAAI;AAAA,IACvB,QAAQ;AACN,WAAK,QAAQ,qBAAqB;AAClC,aAAO;AAAA,IACT;AAAA,EACF,WAAW,OAAO,SAAS,YAAY,SAAS,MAAM;AACpD,UAAM;AAAA,EACR,OAAO;AACL,SAAK,QAAQ,gCAAgC;AAC7C,WAAO;AAAA,EACT;AAGA,aAAW,SAAS,CAAC,QAAQ,OAAO,QAAQ,GAAG;AAC7C,QAAI,EAAE,SAAS,QAAQ,CAAC,IAAI,KAAK,GAAG;AAClC,WAAK,QAAQ,4BAA4B,KAAK,GAAG;AAAA,IACnD;AAAA,EACF;AAEA,MAAI,CAAC,OAAO,GAAI,QAAO;AAEvB,MAAI;AACF,UAAM,MAAM,YAAY,SAAS,GAAG;AACpC,SAAK,QAAQ,+BAA0B,IAAI,IAAI,GAAG;AAClD,SAAK,QAAQ,cAAc,IAAI,GAAG,EAAE;AACpC,SAAK,QAAQ,cAAc,IAAI,MAAM,EAAE;AACvC,QAAI,IAAI,eAAe,QAAW;AAChC,WAAK,QAAQ,kBAAkB,IAAI,UAAU,EAAE;AAAA,IACjD,OAAO;AACL,WAAK,QAAQ,kEAA0D;AAAA,IACzE;AACA,QAAI,IAAI,UAAU;AAChB,WAAK,QAAQ,qBAAqB,IAAI,WAAW,GAAG,SAAS,IAAI,WAAW,GAAG,EAAE;AAAA,IACnF,OAAO;AACL,WAAK,QAAQ,kDAAkD;AAAA,IACjE;AAAA,EACF,SAAS,GAAG;AACV,SAAK,QAAQ,8BAA8B,aAAa,QAAQ,EAAE,UAAU,CAAC,EAAE;AAAA,EACjF;AAEA,SAAO;AACT;AAMO,SAAS,eAAe,QAA0C;AACvE,QAAM,SAAS,WAAW;AAC1B,QAAM,OAAO,OAAO,YAAY,CAAC;AACjC,QAAM,QAAQ,OAAO,SAAS,CAAC;AAC/B,QAAM,YAAY,OAAO,iBAAiB,CAAC;AAG3C,aAAW,OAAO,CAAC,gBAAgB,YAAY,OAAO,GAAY;AAChE,QAAI,EAAE,OAAO,WAAW,OAAO,GAAG,MAAM,UAAa,OAAO,GAAG,MAAM,MAAM;AACzE,WAAK,QAAQ,0BAA0B,GAAG,GAAG;AAAA,IAC/C;AAAA,EACF;AAGA,QAAM,KAAK,OAAO;AAClB,MAAI,IAAI;AACN,QAAI,CAAC,aAAa,KAAK,EAAE,GAAG;AAC1B,WAAK,QAAQ,iBAAiB,EAAE,uCAAuC;AAAA,IACzE;AAAA,EACF;AAGA,MAAI,CAAC,KAAK,aAAc,MAAK,QAAQ,+CAA4C;AACjF,MAAI,CAAC,KAAK,MAAO,MAAK,QAAQ,wCAAqC;AACnE,MAAI,CAAC,KAAK,aAAa,CAAC,KAAK,YAAY;AACvC,SAAK,QAAQ,4DAAyD;AAAA,EACxE;AAGA,MAAI,CAAC,UAAU,UAAU,SAAS;AAChC,SAAK,QAAQ,+DAA4D;AAAA,EAC3E;AACA,MAAI,CAAC,MAAM,oBAAoB,MAAM,iBAAiB,WAAW,GAAG;AAClE,SAAK,QAAQ,8CAA2C;AAAA,EAC1D;AAGA,MAAI,CAAC,MAAM,cAAc,MAAM,WAAW,WAAW,GAAG;AACtD,SAAK,QAAQ,wCAAqC;AAAA,EACpD;AACA,MAAI,CAAC,MAAM,kBAAkB,SAAS;AACpC,SAAK,QAAQ,2CAAwC;AAAA,EACvD;AAGA,MAAI,KAAK,KAAK;AACZ,SAAK,QAAQ,0BAAqB,KAAK,GAAG,EAAE;AAAA,EAC9C,OAAO;AACL,SAAK,QAAQ,8DAAyD;AAAA,EACxE;AAEA,MAAI,OAAO,MAAM,OAAO,OAAO,WAAW,GAAG;AAC3C,UAAM,OAAO,CAAC,OAAO,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,CAAC;AAC5D,UAAM,OAAO,QAAQ,CAAC,OAAO,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,CAAC;AACpE,UAAM,OAAO,QAAQ,CAAC,OAAO,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,CAAC;AACpE,UAAM,QAAQ,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO;AACxD,SAAK,QAAQ,iDAAuC,KAAK,EAAE;AAAA,EAC7D;AAEA,SAAO;AACT;;;ACxKO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAEZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,mBAAN,cAA+B,UAAU;AAAA,EAC9C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,sBAAN,cAAkC,UAAU;AAAA,EACjD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,gBAAN,cAA4B,UAAU;AAAA,EAC3C,YACE,SACO,UACA,OACA,WACP;AACA,UAAM,OAAO;AAJN;AACA;AACA;AAGP,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,qBAAN,cAAiC,UAAU;AAAA,EAChD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,oBAAN,cAAgC,UAAU;AAAA,EAC/C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAIO,IAAM,gBAAN,MAAM,uBAAsB,UAAU;AAAA,EAC3C,YAAY,SAAiC,SAAkB;AAC7D,UAAM,OAAO;AAD8B;AAE3C,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,eAAc,SAAS;AAAA,EACrD;AACF;AAEO,IAAM,wBAAN,MAAM,+BAA8B,cAAc;AAAA,EACvD,YAA4B,KAAa,SAAkB;AACzD,UAAM,gCAAgC,GAAG,IAAI,OAAO;AAD1B;AAE1B,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,uBAAsB,SAAS;AAAA,EAC7D;AACF;AAEO,IAAM,oBAAN,MAAM,2BAA0B,cAAc;AAAA,EACnD,YACE,SACA,SACgB,OAChB;AACA,UAAM,SAAS,OAAO;AAFN;AAGhB,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,mBAAkB,SAAS;AAAA,EACzD;AACF;AAEO,IAAM,qBAAN,MAAM,4BAA2B,cAAc;AAAA,EAGpD,YAAY,QAAsC,SAAkB;AAClE,UAAM,mCAAmC,MAAM,IAAI,OAAO;AAH5D,wBAAgB;AAId,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,WAAO,eAAe,MAAM,oBAAmB,SAAS;AAAA,EAC1D;AACF;AAKO,IAAM,+BAAN,MAAM,sCAAqC,UAAU;AAAA,EAC1D,YAAY,iBAAyB,cAAsB;AACzD,UAAM,kCAAkC,eAAe,WAAW,YAAY,EAAE;AAChF,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,8BAA6B,SAAS;AAAA,EACpE;AACF;AAGO,IAAM,wBAAN,MAAM,+BAA8B,UAAU;AAAA,EACnD,YAAY,QAAgB;AAC1B,UAAM,oBAAoB,MAAM,EAAE;AAClC,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,uBAAsB,SAAS;AAAA,EAC7D;AACF;AAGO,IAAM,2BAAN,MAAM,kCAAiC,UAAU;AAAA,EACtD,YAAY,QAAgB;AAC1B,UAAM,2BAA2B,MAAM,EAAE;AACzC,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,0BAAyB,SAAS;AAAA,EAChE;AACF;AAGO,IAAM,+BAAN,MAAM,sCAAqC,UAAU;AAAA,EAC1D,YAAY,QAAgB;AAC1B,UAAM,sBAAsB,MAAM,EAAE;AACpC,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,8BAA6B,SAAS;AAAA,EACpE;AACF;;;AC/HA,IAAM,mBAAmB;AAqClB,IAAM,iBAAN,MAAqB;AAAA,EAK1B,YAAY,MAAgE;AAJ5E,wBAAQ;AACR,wBAAQ;AACR,wBAAQ;AAGN,SAAK,WAAW,MAAM,WAAW,kBAAkB,QAAQ,OAAO,EAAE;AACpE,SAAK,SAAS,MAAM;AACpB,SAAK,UAAU,MAAM,WAAW;AAAA,EAClC;AAAA;AAAA,EAIA,MAAc,OACZ,MACA,OAAoB,CAAC,GACF;AACnB,UAAM,MAAM,GAAG,KAAK,OAAO,GAAG,IAAI;AAClC,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,KAAK,OAAO;AAE/D,QAAI;AACF,YAAM,WAAW,MAAM,MAAM,KAAK;AAAA,QAChC,GAAG;AAAA,QACH,QAAQ,WAAW;AAAA,QACnB,SAAS;AAAA,UACP,gBAAgB;AAAA,UAChB,GAAI,KAAK,WAAW,CAAC;AAAA,QACvB;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT,UAAE;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAAA,EAEQ,eAAuC;AAC7C,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,eAAe,UAAU,KAAK,MAAM,GAAG;AAAA,EAClD;AAAA,EAEA,MAAc,eAAkB,MAA4B;AAC1D,QAAI,CAAC,KAAK,IAAI;AACZ,UAAI,MAAM,uBAAuB,KAAK,MAAM;AAC5C,UAAI;AACF,cAAM,OAAQ,MAAM,KAAK,KAAK;AAC9B,YAAI,MAAM,MAAO,OAAM,KAAK;AAAA,MAC9B,QAAQ;AAAA,MAER;AACA,YAAM,IAAI,kBAAkB,GAAG;AAAA,IACjC;AACA,WAAQ,MAAM,KAAK,KAAK;AAAA,EAC1B;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,OAAuD;AACpE,UAAM,OAAO,MAAM,KAAK,OAAO,kBAAkB;AAAA,MAC/C,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,KAAK;AAAA,IAC5B,CAAC;AACD,WAAO,KAAK,eAAmC,IAAI;AAAA,EACrD;AAAA;AAAA,EAGA,MAAM,IAAI,KAA6B;AACrC,UAAM,OAAO,MAAM,KAAK,OAAO,kBAAkB,mBAAmB,GAAG,CAAC,EAAE;AAC1E,WAAO,KAAK,eAAsB,IAAI;AAAA,EACxC;AAAA;AAAA,EAGA,MAAM,KAAK,MAIa;AACtB,UAAM,SAAS,IAAI,gBAAgB;AACnC,QAAI,MAAM,UAAU,OAAW,QAAO,IAAI,SAAS,OAAO,KAAK,KAAK,CAAC;AACrE,QAAI,MAAM,WAAW,OAAW,QAAO,IAAI,UAAU,OAAO,KAAK,MAAM,CAAC;AACxE,QAAI,MAAM,KAAM,QAAO,IAAI,QAAQ,KAAK,IAAI;AAC5C,UAAM,KAAK,OAAO,SAAS,IAAI,IAAI,MAAM,KAAK;AAC9C,UAAM,OAAO,MAAM,KAAK,OAAO,iBAAiB,EAAE,EAAE;AACpD,WAAO,KAAK,eAA2B,IAAI;AAAA,EAC7C;AAAA;AAAA,EAGA,MAAM,MAAM,KAAa,SAAyC;AAChE,UAAM,OAAO,MAAM,KAAK;AAAA,MACtB,kBAAkB,mBAAmB,GAAG,CAAC;AAAA,MACzC;AAAA,QACE,QAAQ;AAAA,QACR,SAAS,KAAK,aAAa;AAAA,QAC3B,MAAM,KAAK,UAAU,OAAO;AAAA,MAC9B;AAAA,IACF;AACA,WAAO,KAAK,eAAsB,IAAI;AAAA,EACxC;AAAA;AAAA,EAGA,MAAM,OAAO,KAA4B;AACvC,UAAM,OAAO,MAAM,KAAK;AAAA,MACtB,kBAAkB,mBAAmB,GAAG,CAAC;AAAA,MACzC;AAAA,QACE,QAAQ;AAAA,QACR,SAAS,KAAK,aAAa;AAAA,MAC7B;AAAA,IACF;AACA,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,KAAK,eAAqB,IAAI;AAAA,IACtC;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,OAAO,MAKQ;AACnB,UAAM,SAAS,IAAI,gBAAgB;AACnC,QAAI,KAAK,EAAG,QAAO,IAAI,KAAK,KAAK,CAAC;AAClC,QAAI,KAAK,aAAc,QAAO,IAAI,gBAAgB,KAAK,YAAY;AACnE,QAAI,KAAK,MAAO,QAAO,IAAI,SAAS,KAAK,KAAK;AAC9C,QAAI,KAAK,KAAM,QAAO,IAAI,QAAQ,KAAK,IAAI;AAC3C,UAAM,KAAK,OAAO,SAAS,IAAI,IAAI,MAAM,KAAK;AAC9C,UAAM,OAAO,MAAM,KAAK,OAAO,wBAAwB,EAAE,EAAE;AAC3D,QAAI,CAAC,KAAK,IAAI;AAEZ,YAAM,WAAW,MAAM,KAAK,OAAO,iBAAiB,EAAE,EAAE;AACxD,YAAMC,QAAO,MAAM,KAAK,eAAmD,QAAQ;AACnF,UAAI,YAAYA,MAAM,QAAOA,MAAK;AAClC,UAAI,aAAaA,SAAQA,MAAK,QAAS,QAAOA,MAAK;AACnD,aAAO,CAAC;AAAA,IACV;AACA,UAAM,OAAQ,MAAM,KAAK,KAAK;AAC9B,QAAI,MAAM,QAAQ,IAAI,EAAG,QAAO;AAChC,QAAI,aAAa,QAAQ,KAAK,QAAS,QAAO,KAAK;AACnD,QAAI,YAAY,KAAM,QAAQ,KAAoB;AAClD,WAAO,CAAC;AAAA,EACV;AACF;;;AC9KA,IAAM,gBAAgB;AACtB,IAAM,qBAAqB;AAE3B,IAAM,mBAAmB,oBAAI,IAAY;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAYD,SAAS,kBACP,KAIO;AACP,QAAM,YAAY,IAAI,MAAM,kCAAkC;AAC9D,MAAI,UAAW,QAAO,EAAE,MAAM,aAAa,QAAQ,UAAU,CAAC,GAAG,QAAQ,UAAU,CAAC,EAAE;AACtF,QAAM,OAAO,IAAI,MAAM,kBAAkB;AACzC,MAAI,KAAM,QAAO,EAAE,MAAM,QAAQ,QAAQ,KAAK,CAAC,EAAE;AACjD,SAAO;AACT;AAIO,IAAM,aAAN,MAAiB;AAAA,EAItB,YAAY,UAAU,eAAe,YAAY,KAAQ;AAHzD,wBAAiB;AACjB,wBAAiB;AAGf,SAAK,UAAU,QAAQ,QAAQ,OAAO,EAAE;AACxC,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAIA,MAAc,OAAO,KAAgC;AACnD,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,KAAK,SAAS;AACjE,QAAI;AACF,aAAO,MAAM,WAAW,MAAM,KAAK,EAAE,QAAQ,WAAW,OAAO,CAAC;AAAA,IAClE,SAAS,KAAK;AACZ,UAAI,eAAe,SAAS,IAAI,SAAS,cAAc;AACrD,cAAM,IAAI,kBAAkB,sBAAsB,GAAG,IAAI,KAAK,GAAG;AAAA,MACnE;AACA,YAAM,IAAI;AAAA,QACR,0BAA0B,GAAG,KAAM,IAAc,OAAO;AAAA,QACxD;AAAA,QACA,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF,UAAE;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,gBAAgB,SAA4C;AAChE,UAAM,MAAM,GAAG,QAAQ,QAAQ,OAAO,EAAE,CAAC,GAAG,kBAAkB;AAC9D,UAAM,OAAO,MAAM,KAAK,OAAO,GAAG;AAElC,QAAI,CAAC,KAAK,IAAI;AACZ,UAAI,KAAK,WAAW,KAAK;AACvB,cAAM,IAAI,sBAAsB,KAAK,OAAO;AAAA,MAC9C;AACA,YAAM,IAAI;AAAA,QACR,sCAAsC,OAAO,UAAU,KAAK,MAAM;AAAA,QAClE;AAAA,MACF;AAAA,IACF;AAEA,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK;AAAA,IACzB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,sCAAsC,OAAO;AAAA,QAC7C;AAAA,QACA,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AAEA,QAAI,CAAC,KAAK,WAAW,IAAI,GAAG;AAC1B,YAAM,IAAI,mBAAmB,kBAAkB,OAAO;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU,QAA8C;AAC5D,UAAM,KAAK,SAAS,WAAW,mBAAmB,MAAM,CAAC,KAAK;AAC9D,UAAM,MAAM,GAAG,KAAK,OAAO,gBAAgB,EAAE;AAC7C,UAAM,OAAO,MAAM,KAAK,OAAO,GAAG;AAElC,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,IAAI;AAAA,QACR,6BAA6B,GAAG,UAAU,KAAK,MAAM;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AAEA,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK;AAAA,IACzB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,mCAAmC,GAAG;AAAA,QACtC;AAAA,QACA,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AAEA,QAAI,MAAM,QAAQ,IAAI,EAAG,QAAO;AAChC,QAAI,QAAQ,OAAO,SAAS,YAAY,WAAW,MAAM;AACvD,aAAQ,KAAuC;AAAA,IACjD;AACA,WAAO,CAAC;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,SAAS,KAAwC;AACrD,UAAM,SAAS,kBAAkB,GAAG;AAEpC,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,sBAAsB,KAAK,KAAK,OAAO;AAAA,IACnD;AAEA,QAAI,OAAO,SAAS,QAAQ;AAC1B,aAAO,KAAK,gBAAgB,KAAK,OAAO;AAAA,IAC1C;AAGA,UAAM,QAAQ,MAAM,KAAK,UAAU,OAAO,MAAM;AAChD,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,sBAAsB,KAAK,KAAK,OAAO;AAAA,IACnD;AACA,WAAO,MAAM,CAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,QAAQ,KAAyC;AACrD,UAAM,aAAa,GAAG,KAAK,OAAO,mBAAmB,mBAAmB,GAAG,CAAC;AAE5E,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,OAAO,UAAU;AAAA,IACrC,SAAS,KAAK;AAEZ,YAAM;AAAA,IACR;AAEA,QAAI,KAAK,IAAI;AACX,UAAI;AACF,eAAQ,MAAM,KAAK,KAAK;AAAA,MAC1B,SAAS,KAAK;AACZ,cAAM,IAAI;AAAA,UACR,wCAAwC,GAAG;AAAA,UAC3C,KAAK;AAAA,UACL,eAAe,QAAQ,MAAM;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,WAAW,KAAK;AACvB,YAAM,IAAI;AAAA,QACR,mBAAmB,KAAK,MAAM,cAAc,GAAG;AAAA,QAC/C,KAAK;AAAA,MACP;AAAA,IACF;AAGA,UAAM,OAAO,MAAM,KAAK,SAAS,GAAG;AACpC,UAAM,cAAc,GAAG,KAAK,SAAS,QAAQ,OAAO,EAAE,CAAC,WAAW,mBAAmB,GAAG,CAAC;AACzF,UAAM,eAAe,MAAM,KAAK,OAAO,WAAW;AAElD,QAAI,CAAC,aAAa,IAAI;AACpB,UAAI,aAAa,WAAW,KAAK;AAC/B,cAAM,IAAI,sBAAsB,KAAK,KAAK,QAAQ;AAAA,MACpD;AACA,YAAM,IAAI;AAAA,QACR,QAAQ,aAAa,MAAM,gCAAgC,GAAG;AAAA,QAC9D,KAAK;AAAA,MACP;AAAA,IACF;AAEA,QAAI;AACF,aAAQ,MAAM,aAAa,KAAK;AAAA,IAClC,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,iDAAiD,GAAG;AAAA,QACpD,KAAK;AAAA,QACL,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,UAAiD;AAC1D,QAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,UAAM,IAAI;AAEV,QAAI,OAAO,EAAE,sBAAsB,YAAY,CAAC,EAAE,kBAAmB,QAAO;AAC5E,QAAI,OAAO,EAAE,cAAc,YAAY,CAAC,iBAAiB,IAAI,EAAE,SAAmB,EAAG,QAAO;AAC5F,QAAI,OAAO,EAAE,aAAa,YAAY,CAAC,EAAE,SAAU,QAAO;AAC1D,QAAI,OAAO,EAAE,qBAAqB,YAAY,CAAC,EAAE,iBAAkB,QAAO;AAC1E,QAAI,OAAO,EAAE,eAAe,YAAY,CAAC,EAAE,WAAW,WAAW,UAAU,EAAG,QAAO;AACrF,QAAI,OAAO,EAAE,aAAa,YAAY,CAAC,EAAE,SAAS,WAAW,UAAU,EAAG,QAAO;AAEjF,WAAO;AAAA,EACT;AACF;;;AC7PA,IAAM,cAAc;AACpB,IAAM,cAAc,oBAAI,IAAoB;AAO5C,eAAsB,qBAAqB,YAA4C;AACrF,MAAI,YAAY,IAAI,UAAU,EAAG,QAAO,YAAY,IAAI,UAAU;AAClE,MAAI;AACF,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,GAAI;AAEvD,IAAC,MAA4C,QAAQ;AACrD,UAAM,MAAM,MAAM,MAAM,GAAG,WAAW,IAAI,UAAU,IAAI,EAAE,QAAQ,WAAW,OAAO,CAAC;AACrF,iBAAa,KAAK;AAClB,QAAI,CAAC,IAAI,GAAI,QAAO;AACpB,UAAM,SAAS,MAAM,IAAI,KAAK;AAC9B,gBAAY,IAAI,YAAY,MAAM;AAClC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,eAAsB,4BACpB,QACmE;AACnE,QAAM,SAAS,MAAM,qBAAqB,yBAAyB;AACnE,MAAI,CAAC,OAAQ,QAAO,EAAE,OAAO,MAAM,SAAS,KAAK;AAGjD,QAAM,SAAmB,CAAC;AAC1B,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,WAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,0BAA0B,EAAE;AAAA,EAC9D;AACA,QAAM,MAAM;AACZ,QAAM,WAAY,OAAe,YAAY,CAAC;AAC9C,aAAW,OAAO,UAAU;AAC1B,QAAI,EAAE,OAAO,KAAM,QAAO,KAAK,2BAA2B,GAAG,EAAE;AAAA,EACjE;AACA,SAAO,OAAO,WAAW,IAAI,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO,OAAO,OAAO;AACxE;AAEA,eAAsB,0BACpB,UACmE;AACnE,QAAM,SAAS,MAAM,qBAAqB,uBAAuB;AACjE,MAAI,CAAC,OAAQ,QAAO,EAAE,OAAO,MAAM,SAAS,KAAK;AAEjD,QAAM,SAAmB,CAAC;AAC1B,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,WAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,4BAA4B,EAAE;AAAA,EAChE;AACA,QAAM,IAAI;AACV,QAAM,WAAY,OAAe,YAAY,CAAC;AAC9C,aAAW,OAAO,UAAU;AAC1B,QAAI,EAAE,OAAO,GAAI,QAAO,KAAK,2BAA2B,GAAG,EAAE;AAAA,EAC/D;AACA,SAAO,OAAO,WAAW,IAAI,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO,OAAO,OAAO;AACxE;;;ACxDO,IAAK,WAAL,kBAAKC,cAAL;AACL,EAAAA,oBAAA,qBAAkB,KAAlB;AACA,EAAAA,oBAAA,kBAAkB,KAAlB;AACA,EAAAA,oBAAA,kBAAkB,KAAlB;AAHU,SAAAA;AAAA,GAAA;AAOL,IAAM,qBAAN,MAAM,4BAA2B,MAAM;AAAA,EAC5C,YAAY,OAAe;AACzB,UAAM,2BAA2B,KAAK,8BAAyB;AAC/D,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,oBAAmB,SAAS;AAAA,EAC1D;AACF;AA0BO,IAAM,aAAN,MAAiB;AAAA,EAItB,YACE,MACA,YACA;AANF,wBAAiB;AACjB,wBAAiB;AAMf,SAAK,QAAQ;AACb,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,YACJ,KACA,OAAuB,CAAC,GACJ;AACpB,UAAM,MAAM,KAAK,OAAO;AACxB,UAAM,aAAa,KAAK,cAAc;AACtC,UAAM,mBAAmB,KAAK,oBAAoB;AAClD,UAAM,eAAe,KAAK,gBAAgB;AAE1C,QAAI,QAAQ,yBAA0B;AACpC,YAAM,KAAK,MAAM,GAAG;AACpB,aAAO,EAAE,WAAW,MAAM,UAAU,GAAG,QAAQ,kBAAkB;AAAA,IACnE;AAGA,UAAM,QAAS,IAAiD,cAC1D,IAAiD,UAClD;AAEL,QAAI,WAAW;AACf,QAAI,YAAY;AAEhB,WAAO,YAAY,YAAY;AAC7B,YAAM,KAAK,MAAM,GAAG;AACpB;AAEA,YAAM,QAAQ,MAAM,KAAK,YAAY,OAAO,YAAY;AACxD,UAAI,OAAO;AACT,eAAO,EAAE,WAAW,MAAM,UAAU,QAAQ,QAAQ,uBAAwB,iBAAiB,eAAe;AAAA,MAC9G;AAEA,UAAI,WAAW,WAAY;AAG3B,YAAM,MAAM,SAAS;AACrB,kBAAY,KAAK,IAAI,YAAY,GAAG,GAAI;AAAA,IAC1C;AAEA,WAAO,EAAE,WAAW,OAAO,UAAU,QAAQ,0BAA0B,UAAU,WAAW;AAAA,EAC9F;AACF;AAMO,SAAS,iBACd,MACA,QACmC;AACnC,QAAM,MAAyC;AAAA,IAC7C,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAY,WAAW;AAAA,IACvB,KAAK;AAAA,EACP;AACA,SAAO;AACT;AAEA,SAAS,aAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAEA,SAAS,MAAM,IAA2B;AACxC,SAAO,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;;;ACtIO,IAAM,sBAAsB;AAcnC,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AAEA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAQO,SAAS,iBAAiB,MAAc,QAA+B;AAC5E,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,IACvB;AAAA,EACF;AACF;AAMO,SAAS,gBAAgB,MAAc,QAA+B;AAC3E,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,EACzB;AACF;AAMO,SAAS,kBAAkB,MAAc,QAA+B;AAC7E,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,EACzB;AACF;AAKO,SAAS,gBAAgB,KAAoC;AAClE,SACE,OAAO,QAAQ,YACf,QAAQ,QACP,IAAgC,iBAAiB;AAEtD;AAKO,SAAS,sBAAsB,KAAuC;AAC3E,QAAM,SAAmB,CAAC;AAC1B,MAAI,IAAI,iBAAiB,EAAG,QAAO,KAAK,wBAAwB;AAChE,MAAI,CAAC,IAAI,KAAM,QAAO,KAAK,kBAAkB;AAC7C,MAAI,CAAC,CAAC,SAAS,QAAQ,QAAQ,EAAE,SAAS,IAAI,gBAAgB,EAAE,GAAG;AACjE,WAAO,KAAK,6CAA6C;AAAA,EAC3D;AACA,MAAI,CAAC,IAAI,UAAU,IAAI,OAAO,WAAW,EAAG,QAAO,KAAK,oBAAoB;AAC5E,MAAI,CAAC,IAAI,WAAY,QAAO,KAAK,wBAAwB;AACzD,MAAI,CAAC,IAAI,gBAAgB,IAAI,gBAAgB,EAAG,QAAO,KAAK,+BAA+B;AAC3F,SAAO;AACT;AAmBO,SAAS,wBACd,MACA,YACA,iBACqB;AACrB,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA;AAAA,IACA,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,IACvB,kBAAkB;AAAA,EACpB;AACF;;;ACvIA,IAAMC,uBAAsB;AAC5B,IAAM,sBAAsB;AAC5B,IAAM,mBAAmB;AACzB,IAAM,mBAAmB;AAqBlB,IAAM,cAAN,MAAkB;AAAA,EAMvB,YAAY,gBAAwB,kBAAkB,UAAkB,kBAAkB;AAL1F,wBAAiB;AACjB,wBAAiB;AAEjB;AAAA,wBAAiB;AAGf,SAAK,gBAAgB;AACrB,SAAK,UAAU;AACf,SAAK,QAAQ,oBAAI,IAAI;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eACE,OACA,WACA,WAAW,OACQ;AACnB,UAAM,MAAM,KAAK,IAAI;AAGrB,SAAK,OAAO,GAAG;AAGf,UAAM,SAAS,WACX,KAAK,IAAI,KAAK,eAAe,mBAAmB,IAChD,KAAK;AAGT,UAAM,MAAM,iBAAiB,SAAS;AACtC,QAAI,QAAQ,MAAM;AAChB,aAAO,EAAE,SAAS,OAAO,QAAQ,6BAA6B,SAAS,GAAG;AAAA,IAC5E;AAGA,UAAM,QAAQ,MAAM;AACpB,UAAM,WAAW,SAAS;AAC1B,QAAI,QAAQ,UAAU;AACpB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ,wBAAwB,KAAK,MAAM,QAAQ,GAAI,CAAC,cAAc,MAAM;AAAA,MAC9E;AAAA,IACF;AACA,QAAI,MAAM,MAAM,KAAM;AAEpB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAGA,QAAI,KAAK,MAAM,IAAI,KAAK,GAAG;AACzB,aAAO,EAAE,SAAS,OAAO,QAAQ,2BAA2B,KAAK,gBAAgB;AAAA,IACnF;AAGA,QAAI,KAAK,MAAM,QAAQ,KAAK,SAAS;AACnC,YAAM,WAAW,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AAC1C,WAAK,MAAM,OAAO,QAAQ;AAAA,IAC5B;AAGA,UAAM,YAAY,MAAM;AACxB,SAAK,MAAM,IAAI,OAAO,SAAS;AAE/B,WAAO,EAAE,SAAS,MAAM,QAAQ,KAAK;AAAA,EACvC;AAAA;AAAA,EAGQ,OAAO,KAAmB;AAChC,eAAW,CAAC,IAAI,SAAS,KAAK,KAAK,OAAO;AACxC,UAAI,aAAa,KAAK;AACpB,aAAK,MAAM,OAAO,EAAE;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AACF;AAKO,SAAS,eACd,SACA,OACoC;AACpC,QAAM,MAAM;AAGZ,QAAM,QACH,IAAsB,cAAe,IAA0B;AAClE,MAAI,CAAC,OAAO;AACV,WAAO,EAAE,OAAO,OAAO,QAAQ,8BAA8B;AAAA,EAC/D;AAGA,MAAI;AACJ,MAAI,OAAQ,IAAsB,iBAAiB,UAAU;AAE3D,gBAAY,OAAQ,IAAsB,eAAgB,GAAI;AAAA,EAChE,WAAW,IAAI,cAAc,QAAW;AACtC,gBAAY,OAAO,IAAI,SAAS;AAAA,EAClC;AACA,MAAI,CAAC,WAAW;AACd,WAAO,EAAE,OAAO,OAAO,QAAQ,oBAAoB;AAAA,EACrD;AAEA,QAAM,WAAY,IAAsB,iBAAiBA,wBACtD,IAA0B,iBAAiBA;AAE9C,QAAM,SAAS,MAAM,eAAe,OAAO,WAAW,QAAQ;AAC9D,SAAO,EAAE,OAAO,OAAO,SAAS,QAAQ,OAAO,OAAO;AACxD;AAWA,SAAS,iBAAiB,IAA2B;AAEnD,MAAI,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,GAAG,GAAG;AACxC,UAAM,IAAI,IAAI,KAAK,EAAE;AACrB,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO,EAAE,QAAQ;AAAA,EAC5C;AAEA,QAAM,IAAI,WAAW,EAAE;AACvB,MAAI,MAAM,CAAC,EAAG,QAAO;AAErB,MAAI,IAAI,KAAM,QAAO;AACrB,SAAO,IAAI;AACb;;;ACrKO,IAAM,kBAAN,MAAM,yBAAwB,MAAM;AAAA,EAEzC,YAAY,eAAuB,iBAAyB;AAC1D;AAAA,MACE,iCAAiC,cAAc,QAAQ,CAAC,CAAC,WAAW,eAAe;AAAA,IACrF;AAJF,wBAAS;AAKP,SAAK,OAAO;AACZ,SAAK,gBAAgB;AACrB,WAAO,eAAe,MAAM,iBAAgB,SAAS;AAAA,EACvD;AACF;AAgBA,eAAsB,eACpB,YAC0B;AAC1B,QAAM,SAAS,cAAc;AAE7B,MAAI;AACF,UAAM,SAAS,KAAK,IAAI;AACxB,UAAM,OAAO,MAAM,MAAM,QAAQ,EAAE,QAAQ,QAAQ,QAAQ,YAAY,QAAQ,GAAI,EAAE,CAAC;AACtF,UAAM,QAAQ,KAAK,IAAI;AAGvB,UAAM,aAAa,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK,QAAQ,IAAI,MAAM;AACtE,QAAI,CAAC,YAAY;AAEf,aAAO;AAAA,QACL,cAAc;AAAA,QACd,eAAe;AAAA,QACf,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,KAAK,UAAU,EAAE,QAAQ;AAC9C,QAAI,MAAM,QAAQ,GAAG;AACnB,aAAO,EAAE,cAAc,MAAM,eAAe,GAAG,QAAQ,oCAAoC;AAAA,IAC7F;AAGA,UAAM,iBAAiB,SAAS,SAAS;AACzC,UAAM,iBAAiB,gBAAgB,YAAY;AACnD,UAAM,eAAe,KAAK,IAAI,aAAa,KAAK;AAEhD,WAAO,EAAE,cAAc,eAAe,QAAQ,OAAO;AAAA,EACvD,QAAQ;AAEN,WAAO,EAAE,cAAc,MAAM,eAAe,GAAG,QAAQ,gCAAgC;AAAA,EACzF;AACF;AASA,eAAsB,kBAAkB,kBAAkB,GAAkB;AAC1E,QAAM,SAAS,MAAM,eAAe;AACpC,MAAI,CAAC,OAAO,gBAAgB,KAAK,IAAI,OAAO,aAAa,IAAI,iBAAiB;AAC5E,UAAM,IAAI,gBAAgB,OAAO,eAAe,eAAe;AAAA,EACjE;AACF;;;ACxEA,eAAe,SAAS,MAAgD;AACtE,QAAM,OAAO,KAAK,UAAU,MAAM,OAAO,KAAK,IAAI,EAAE,KAAK,CAAC;AAC1D,MAAI,OAAO,WAAW,eAAe,OAAO,QAAQ;AAClD,UAAM,UAAU,IAAI,YAAY,EAAE,OAAO,IAAI;AAC7C,UAAM,UAAU,MAAM,OAAO,OAAO,OAAO,WAAW,OAAO;AAC7D,WAAO,MAAM,KAAK,IAAI,WAAW,OAAO,CAAC,EACtC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AAAA,EACZ;AAEA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAQ,KAAK,WAAW,CAAC;AACzB,WAAQ,OAAO,aAAc;AAAA,EAC/B;AACA,SAAO,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC1C;AAUA,eAAsB,iBACpB,MACA,OACA,UACA,SAAS,uBACT,kBAAkB,OACI;AACtB,QAAM,aAAa,MAAM,SAAS,IAAI;AACtC,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,kBAAkB;AAAA,IACpB;AAAA,EACF,CAAC;AACH;AAWO,SAAS,qBACd,KACoC;AACpC,QAAM,IAAI,IAAI;AAEd,MAAI,CAAC,EAAE,QAAQ,OAAO,EAAE,SAAS,UAAU;AACzC,WAAO,EAAE,OAAO,OAAO,QAAQ,sCAAsC;AAAA,EACvE;AACA,MAAI,CAAC,EAAE,eAAe,OAAO,EAAE,gBAAgB,UAAU;AACvD,WAAO,EAAE,OAAO,OAAO,QAAQ,6CAA6C;AAAA,EAC9E;AACA,MAAI,EAAE,cAAc,IAAI;AACtB,WAAO,EAAE,OAAO,OAAO,QAAQ,0CAA0C;AAAA,EAC3E;AACA,MAAI,EAAE,qBAAqB,QAAQ,EAAE,UAAU,WAAW;AACxD,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;;;ACxFA,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,SAAO,GAAG,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAC7D;AAsBO,IAAM,WAAN,MAAe;AAAA,EAAf;AACL,wBAAQ,SAAoB,CAAC;AAAA;AAAA;AAAA,EAG7B,OAAO,OAAuB;AAC5B,SAAK,MAAM,KAAK,KAAK;AAAA,EACvB;AAAA;AAAA,EAGA,UAAwB;AACtB,WAAO,EAAE,MAAM,CAAC,GAAG,KAAK,KAAK,EAAE;AAAA,EACjC;AAAA;AAAA,EAGA,QAAQ,KAAmC;AACzC,WAAO,KAAK,MAAM,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG;AAAA,EAC7C;AAAA;AAAA,EAGA,WAAW,KAAa,OAAyB;AAC/C,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,OAAO,SAAS,KAAK,IAAI,KAAK;AACpC,QAAI,MAAM,eAAe,UAAa,MAAM,cAAc,IAAK,QAAO;AACtE,QAAI,MAAM,QAAQ,UAAa,MAAM,MAAM,IAAK,QAAO;AACvD,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,UAAU,KAAa,WAA0B;AAC/C,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,OAAO;AACT,YAAM,MAAM,aAAa,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAAA,IACvD;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,KAAmB;AAC3B,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,OAAO;AACT,YAAM,aAAa,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAAA,IACjD;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,OAA4B;AACpC,WAAO,KAAK,MAAM,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,KAAK,KAAK,CAAC;AAAA,EAC/D;AACF;AAUO,SAAS,uBACd,cACA,UACA,iBAAiB,KACjB,SAAS,qBACI;AACb,QAAM,SAASA,YAAW,EAAE,MAAM,GAAG,CAAC;AACtC,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN;AAAA,MACA,gBAAgB;AAAA,MAChB,SAAS;AAAA,MACT,SAAS;AAAA,MACT,iBAAiB;AAAA,MACjB,eAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,IACvC;AAAA,IACA,OAAO;AAAA,EACT,CAAC;AACH;;;ACvGA,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,SAAO,GAAG,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAC7D;AA4BO,SAAS,mBAAmB,QAA2C;AAC5E,QAAM,YAAY,OAAO,aAAaA,YAAW;AACjD,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,QAAQ;AAAA,MACN;AAAA,MACA,gBAAgB,OAAO;AAAA,MACvB,iBAAiB,OAAO;AAAA,MACxB,aAAa,OAAO;AAAA,MACpB,kBAAkB,OAAO;AAAA,MACzB,gBAAgB,OAAO;AAAA,MACvB,eAAe,OAAO;AAAA,MACtB,YAAY;AAAA,MACZ,cAAc,OAAO,eAAe;AAAA,MACpC,iBAAiB,OAAO,kBAAkB,CAAC;AAAA,IAC7C;AAAA,EACF,CAAC;AACH;AAOO,SAAS,iBAAiB,QAA4C;AAC3E,QAAM,YACJ,OAAO,aAAa,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO,GAAI,EAAE,YAAY;AAC1E,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,gBAAgB,OAAO,iBAAiB,CAAC;AAAA,MACzC,YAAY;AAAA,MACZ,QAAQ,OAAO,UAAU;AAAA,IAC3B;AAAA,EACF,CAAC;AACH;AAOO,SAAS,gBAAgB,QAA4C;AAC1E,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,QAAQ,OAAO,UAAU;AAAA,IAC3B;AAAA,EACF,CAAC;AACH;AAQO,SAAS,uBACd,KACoC;AACpC,QAAM,MAAM,IAAI;AAChB,QAAM,IAAI,IAAI;AACd,QAAM,UAAU,EAAE;AAElB,MAAI,QAAQ,mBAAmB;AAC7B,QAAI,sCAAyC;AAC3C,aAAO,EAAE,OAAO,OAAO,QAAQ,4CAA4C;AAAA,IAC7E;AACA,QAAI,CAAC,EAAE,eAAgB,QAAO,EAAE,OAAO,OAAO,QAAQ,yBAAyB;AAC/E,QAAI,CAAC,EAAE,YAAa,QAAO,EAAE,OAAO,OAAO,QAAQ,sBAAsB;AACzE,QAAI,CAAC,EAAE,oBAAoB,CAAC,MAAM,QAAQ,EAAE,gBAAgB,KAAM,EAAE,iBAA8B,WAAW,GAAG;AAC9G,aAAO,EAAE,OAAO,OAAO,QAAQ,6CAA6C;AAAA,IAC9E;AACA,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,QAAI,CAAC,EAAE,cAAe,QAAO,EAAE,OAAO,OAAO,QAAQ,wBAAwB;AAC7E,WAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AAAA,EACrC;AAEA,MAAI,QAAQ,iBAAiB;AAC3B,QAAI,oCAAuC;AACzC,aAAO,EAAE,OAAO,OAAO,QAAQ,0CAA0C;AAAA,IAC3E;AACA,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,WAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AAAA,EACrC;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,QAAI,mCAAsC;AACxC,aAAO,EAAE,OAAO,OAAO,QAAQ,yCAAyC;AAAA,IAC1E;AACA,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,WAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AAAA,EACrC;AAEA,SAAO,EAAE,OAAO,OAAO,QAAQ,4BAA4B,GAAG,GAAG;AACnE;;;AClIA,IAAM,eAAe,KAAK,KAAK;AAKxB,IAAM,kBAAN,MAAsB;AAAA,EAAtB;AACL,wBAAiB,UAAwC,oBAAI,IAAI;AAAA;AAAA;AAAA,EAGjE,IAAI,KAAa,OAA8C;AAC7D,UAAM,QAAQ,KAAK,OAAO,IAAI,GAAG;AACjC,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,QAAI,MAAM,gBAAgB,UAAa,MAAM,cAAc,KAAK;AAC9D,WAAK,OAAO,OAAO,GAAG;AACtB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,QAA0B,OAAsB;AAClD,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,SAAK,OAAO,IAAI,OAAO,KAAK;AAAA,MAC1B,GAAG;AAAA,MACH,aAAa,MAAM;AAAA,IACrB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,WAAW,KAAmB;AAC5B,SAAK,OAAO,OAAO,GAAG;AAAA,EACxB;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK,OAAO;AAAA,EACrB;AACF;AAUA,eAAsB,gBACpB,KACA,aACA,OAC2B;AAC3B,QAAM,IAAI,SAAS,IAAI,gBAAgB;AAGvC,QAAM,SAAS,EAAE,IAAI,GAAG;AACxB,MAAI,OAAQ,QAAO;AAEnB,QAAM,MAAM,GAAG,YAAY,QAAQ,OAAO,EAAE,CAAC,kBAAkB,mBAAmB,GAAG,CAAC;AAEtF,MAAI;AACF,UAAM,OAAO,MAAM,MAAM,KAAK,EAAE,QAAQ,YAAY,QAAQ,GAAI,EAAE,CAAC;AACnE,QAAI,CAAC,KAAK,IAAI;AAEZ,YAAMC,UAA2B,EAAE,KAAK,QAAQ,UAAU,QAAQ,qBAAqB,KAAK,MAAM,GAAG;AACrG,QAAE,IAAIA,OAAM;AACZ,aAAOA;AAAA,IACT;AACA,UAAM,OAAQ,MAAM,KAAK,KAAK;AAC9B,UAAM,SAA2B;AAAA,MAC/B;AAAA,MACA,QAAS,KAAK,UAAoC;AAAA,MAClD,WAAW,KAAK;AAAA,MAChB,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB;AACA,MAAE,IAAI,MAAM;AACZ,WAAO;AAAA,EACT,QAAQ;AAEN,UAAM,SAA2B,EAAE,KAAK,QAAQ,UAAU,QAAQ,sBAAsB;AACxF,WAAO;AAAA,EACT;AACF;AAQO,SAAS,wBACd,KACA,QACa;AACb,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrC;AAAA,EACF,CAAC;AACH;;;AClHO,IAAK,eAAL,kBAAKC,kBAAL;AACL,EAAAA,cAAA,WAAY;AACZ,EAAAA,cAAA,WAAY;AACZ,EAAAA,cAAA,cAAY;AACZ,EAAAA,cAAA,eAAY;AACZ,EAAAA,cAAA,eAAY;AALF,SAAAA;AAAA,GAAA;AAwBL,SAAS,2BACd,QACa;AACb,SAAO,mBAAmB;AAAA,IACxB,eAAe,OAAO;AAAA,IACtB,gBAAgB,OAAO;AAAA,IACvB,YAAY,OAAO;AAAA,IACnB,iBAAiB,CAAC,eAAe;AAAA,IACjC,eAAe,OAAO;AAAA,IACtB,eAAe,OAAO;AAAA,IACtB,WAAW,OAAO;AAAA,IAClB,aAAa;AAAA,IACb,gBAAgB,OAAO;AAAA,EACzB,CAAC;AACH;AAOO,SAAS,yBACd,QACa;AACb,SAAO,iBAAiB,MAAM;AAChC;AAOO,SAAS,wBACd,QACa;AACb,SAAO,gBAAgB,MAAM;AAC/B;AAOO,SAAS,4BACd,KACoC;AACpC,MAAI,IAAI,OAAO,yCAA4C;AACzD,WAAO,EAAE,OAAO,OAAO,QAAQ,8BAA8B;AAAA,EAC/D;AACA,QAAM,QAAQ,IAAI,OAAO;AACzB,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAAI;AAC9D,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;;;ACtFA,IAAMC,uBAAsB;AAC5B,IAAM,8BAA8B;AACpC,IAAM,oBAAoB;AA4BnB,IAAM,qBAAN,MAAyB;AAAA,EAK9B,YACE,mBAA2B,6BAC3B,UAAkB,mBAClB;AAPF,wBAAiB;AACjB,wBAAiB;AACjB,wBAAQ,eAA2B,CAAC;AAMlC,SAAK,mBAAmB;AACxB,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,iBACE,KACA,WACA,cACA,UAAU,MACV,eAAe,OACf,gBACA,OACsB;AAEtB,QACE,OACA,IAAI,iBAAiBA,wBACrB,IAAI,iBAAiB,SACrB;AACA,aAAO,EAAE,SAAS,MAAM,QAAQ,sCAAsC;AAAA,IACxE;AAEA,QAAI,CAAC,WAAW;AACd,aAAO,EAAE,SAAS,MAAM,QAAQ,cAAc;AAAA,IAChD;AAGA,QAAI,CAAC,cAAc;AACjB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAGA,QAAI,gBAAgB,mBAAmB,QAAW;AAChD,YAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,YAAM,kBAAkB,MAAM,kBAAkB;AAChD,UAAI,iBAAiB,KAAK,kBAAkB;AAC1C,eAAO;AAAA,UACL,SAAS;AAAA,UACT,QAAQ,mDAAmD,KAAK,MAAM,cAAc,CAAC,OAAO,KAAK,gBAAgB;AAAA,QACnH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,OAAqD,OAAsB;AAClF,UAAM,MAAM,SAAS,KAAK,IAAI;AAE9B,SAAK,cAAc,KAAK,YAAY,OAAO,CAAC,MAAM,EAAE,QAAQ,MAAM,GAAG;AACrE,SAAK,YAAY,KAAK;AAAA,MACpB,GAAG;AAAA,MACH,YAAY;AAAA,MACZ,YAAY,KAAK;AAAA,IACnB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,aAAa,KAAa,OAAuC;AAC/D,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,UAAM,QAAQ,KAAK,YAAY,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG;AACxD,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,OAAO,MAAM,MAAM,cAAc;AACvC,QAAI,MAAM,MAAM,YAAY;AAC1B,WAAK,cAAc,KAAK,YAAY,OAAO,CAAC,MAAM,EAAE,QAAQ,GAAG;AAC/D,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,kBACE,gBACA,OACoD;AACpD,QAAI,mBAAmB,QAAW;AAChC,aAAO,EAAE,cAAc,OAAO,iBAAiB,EAAE;AAAA,IACnD;AACA,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,WAAO;AAAA,MACL,cAAc;AAAA,MACd,iBAAiB,KAAK,OAAO,MAAM,kBAAkB,GAAI;AAAA,IAC3D;AAAA,EACF;AACF;;;ACjJO,IAAK,YAAL,kBAAKC,eAAL;AAEL,EAAAA,WAAA,8BAA2B;AAC3B,EAAAA,WAAA,2BAA2B;AAC3B,EAAAA,WAAA,wBAA2B;AAE3B,EAAAA,WAAA,uBAA2B;AAC3B,EAAAA,WAAA,oBAA2B;AAC3B,EAAAA,WAAA,iBAA2B;AAE3B,EAAAA,WAAA,sBAA2B;AAC3B,EAAAA,WAAA,iBAA2B;AAE3B,EAAAA,WAAA,qBAA2B;AAC3B,EAAAA,WAAA,kCAA+B;AAE/B,EAAAA,WAAA,wBAA2B;AAC3B,EAAAA,WAAA,6BAA2B;AAE3B,EAAAA,WAAA,aAA2B;AAnBjB,SAAAA;AAAA,GAAA;AAqCL,SAAS,gBAAgB,QAAwC;AACtE,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ,OAAO,UAAU;AAAA,IACzB,QAAQ;AAAA,MACN;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,UAAU,OAAO;AAAA,MACjB,WAAW,OAAO;AAAA,MAClB,gBAAgB,OAAO;AAAA,MACvB,kBAAkB,OAAO;AAAA,MACzB,aAAa,OAAO,eAAe;AAAA,MACnC,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACtC;AAAA,EACF,CAAC;AACH;;;AC3CO,IAAK,OAAL,kBAAKC,UAAL;AACL,EAAAA,YAAA,WAAc,KAAd;AACA,EAAAA,YAAA,cAAc,KAAd;AACA,EAAAA,YAAA,iBAAc,KAAd;AACA,EAAAA,YAAA,WAAc,KAAd;AACA,EAAAA,YAAA,cAAc,KAAd;AACA,EAAAA,YAAA,aAAc,KAAd;AACA,EAAAA,YAAA,iBAAc,KAAd;AAPU,SAAAA;AAAA,GAAA;AAWL,IAAM,mBAAmB;AAKzB,IAAM,iBAAuC;AAAA,EAClD,CAAC,aAAU,GAAS;AAAA,EACpB,CAAC,gBAAa,GAAM;AAAA,EACpB,CAAC,mBAAgB,GAAG;AAAA,EACpB,CAAC,aAAU,GAAS;AAAA,EACpB,CAAC,gBAAa,GAAM;AAAA,EACpB,CAAC,eAAY,GAAO;AAAA,EACpB,CAAC,mBAAgB,GAAG;AACtB;AAEA,IAAM,oBAAuC,IAAI;AAAA,EAC9C,OAAO,QAAQ,cAAc,EAAyB;AAAA,IACrD,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,OAAO,OAAO,IAAI,CAAS;AAAA,EACjD;AACF;AAGO,SAAS,iBAAiB,OAAiC;AAChE,SAAO,kBAAkB,IAAI,KAAK;AACpC;AAMO,IAAM,iBAAuC;AAAA,EAClD,UAAiB;AAAA,EACjB,YAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,YAAiB;AAAA,EACjB,cAAiB;AAAA,EACjB,WAAiB;AAAA,EACjB,UAAiB;AAAA,EACjB,YAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,UAAiB;AAAA,EACjB,aAAiB;AAAA,EACjB,SAAiB;AAAA,EACjB,UAAiB;AAAA,EACjB,SAAiB;AAAA,EACjB,iBAAiB;AACnB;AA0CO,IAAM,qBAAgC;AAAA,EAC3C,oBAAoB;AAAA,EACpB,kBAAoB;AAAA,EACpB,gBAAoB;AAAA,EACpB,mBAAoB;AAAA,EACpB,kBAAoB;AACtB;AAGO,IAAM,wBAAmC;AAAA,EAC9C,oBAAoB;AAAA,EACpB,kBAAoB;AAAA,EACpB,gBAAoB;AAAA,EACpB,mBAAoB;AAAA,EACpB,kBAAoB;AACtB;AAMA,SAAS,iBAAiB,OAA+C;AACvE,MAAI;AACF,UAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,QAAI,MAAM,SAAS,EAAG,QAAO;AAC7B,UAAM,cAAc,MAAM,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACxE,UAAM,SAAS,aAAa,IAAI,QAAQ,IAAI,WAAW,SAAS,KAAK,CAAC;AACtE,WAAO,KAAK,MAAM,KAAK,MAAM,CAAC;AAAA,EAChC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQO,SAAS,mBAAmB,OAAqB;AACtD,QAAM,UAAU,iBAAiB,KAAK;AACtC,MAAI,CAAC,QAAS,QAAO;AAGrB,QAAM,WAAW,QAAQ,WAAW;AACpC,MAAI,aAAa,UAAa,aAAa,MAAM;AAC/C,UAAM,OAAO,iBAAiB,OAAO,QAAQ,CAAC;AAC9C,QAAI,SAAS,OAAW,QAAO;AAAA,EACjC;AAGA,QAAM,MAAM,QAAQ,KAAK;AACzB,MAAI,QAAQ,UAAa,QAAQ,MAAM;AACrC,UAAM,OAAO,iBAAiB,OAAO,GAAG,CAAC;AACzC,QAAI,SAAS,OAAW,QAAO;AAAA,EACjC;AAEA,SAAO;AACT;AAGO,SAAS,kBAAkB,OAAqB;AACrD,SAAO,mBAAmB,KAAK;AACjC;AAOO,SAAS,uBAAuB,OAA+B;AACpE,QAAM,UAAU,iBAAiB,KAAK;AACtC,MAAI,CAAC,SAAS;AACZ,WAAO,EAAE,KAAK,IAAI,MAAM,eAAY,UAAU,GAAG,QAAQ,CAAC,EAAE;AAAA,EAC9D;AAEA,QAAM,WAAW,QAAQ,WAAW;AACpC,QAAM,MAAM,QAAQ,KAAK;AACzB,QAAM,WAAW,aAAa,SAAY,OAAO,QAAQ,IAAI,QAAQ,SAAY,OAAO,GAAG,IAAI;AAC/F,QAAM,OAAO,iBAAiB,QAAQ,KAAK;AAE3C,QAAM,SAAS,MAAM,QAAQ,QAAQ,aAAa,CAAC,IAC9C,QAAQ,aAAa,IACtB,MAAM,QAAQ,QAAQ,QAAQ,CAAC,IAC5B,QAAQ,QAAQ,IACjB,CAAC;AAEP,SAAO;AAAA,IACL,KAAc,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,IACzC;AAAA,IACA,UAAc,eAAe,IAAI;AAAA,IACjC,aAAc,QAAQ,cAAc;AAAA,IACpC;AAAA,IACA,YAAc,QAAQ,aAAa;AAAA,IACnC,SAAc,QAAQ,UAAU;AAAA,IAChC,WAAc,MAAM,QAAQ,QAAQ,YAAY,CAAC,IAC9B,QAAQ,YAAY,IACrB;AAAA,EACpB;AACF;AAcO,SAAS,qBAAqB,MAAY,OAAsC;AACrF,QAAM,WAAW,eAAe,MAAM,YAAY,CAAC;AACnD,MAAI,aAAa,QAAW;AAE1B,QAAI,QAAQ,iBAAe,QAAO,EAAE,IAAI,MAAM,QAAQ,GAAG;AACzD,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,QAAQ,kBAAkB,KAAK,4CAA4C,KAAK,IAAI,CAAC;AAAA,IACvF;AAAA,EACF;AACA,MAAI,QAAQ,SAAU,QAAO,EAAE,IAAI,MAAM,QAAQ,GAAG;AACpD,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,QAAQ,UAAU,KAAK,cAAc,KAAK,QAAQ,CAAC,eAAe,eAAe,QAAQ,CAAC,qBAAqB,KAAK,IAAI,CAAC,eAAe,eAAe,IAAI,CAAC;AAAA,EAC9J;AACF;AAGO,SAAS,oBAAoB,MAAY,OAAsC;AACpF,SAAO,qBAAqB,MAAM,KAAK;AACzC;;;AChPO,IAAK,eAAL,kBAAKC,kBAAL;AACL,EAAAA,cAAA,UAAgB;AAChB,EAAAA,cAAA,mBAAgB;AAChB,EAAAA,cAAA,eAAgB;AAHN,SAAAA;AAAA,GAAA;AAML,IAAK,qBAAL,kBAAKC,wBAAL;AACL,EAAAA,oBAAA,aAAa;AACb,EAAAA,oBAAA,gBAAa;AACb,EAAAA,oBAAA,SAAa;AAHH,SAAAA;AAAA,GAAA;AAwBZ,IAAMC,gBAAe,KAAK,KAAK,KAAK;AAa7B,IAAM,mBAAN,MAAuB;AAAA,EAAvB;AACL,wBAAiB,SAAQ,oBAAI,IAAwB;AAAA;AAAA;AAAA,EAGrD,IAAI,UAAkC;AACpC,SAAK,MAAM,IAAI,SAAS,aAAa;AAAA,MACnC;AAAA,MACA,WAAW,KAAK,IAAI,IAAIA;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KAA2C;AAChD,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,QAAI,CAAC,MAAO,QAAO;AACnB,QAAI,KAAK,IAAI,IAAI,MAAM,WAAW;AAChC,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;AAAA,IACT;AACA,WAAO,MAAM;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,eAAe,QAAuD;AAC1E,UAAM,WAAW,kBAAkB,MAAM;AACzC,QAAI;AAEJ,QAAI;AAGF,YAAM,YAAY,UAAQ,KAAK;AAC/B,gBAAU,MAAM,UAAU,SAAS,WAAW,QAAQ;AAAA,IACxD,QAAQ;AACN,aAAO;AAAA,IACT;AAGA,eAAW,UAAU,SAAS;AAC5B,YAAM,OAAO,OAAO,KAAK,EAAE;AAC3B,UAAI;AACF,cAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,YACE,OAAO,eACP,OAAO,QACP,OAAO,gBACP,OAAO,QACP;AACA,gBAAM,WAA6B;AAAA,YACjC,aAAc,OAAO;AAAA,YACrB,MAAc,OAAO;AAAA,YACrB,cAAc,OAAO;AAAA,YACrB,QAAc,OAAO;AAAA,YACrB,aAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,UACvC;AACA,eAAK,IAAI,QAAQ;AACjB,iBAAO;AAAA,QACT;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,kBACJ,OACA,KAC2B;AAC3B,UAAM,WAAW,KAAK,OAAO,GAAG;AAChC,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,qBAAqB,GAAG,4BAA4B;AAAA,IACtE;AAGA,QAAI;AACJ,QAAI;AACF,YAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,YAAM,cAAc,MAAM,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACxE,YAAM,SAAS,aAAa,IAAI,QAAQ,IAAK,WAAW,SAAS,KAAM,CAAC;AACxE,UAAI;AACJ,UAAI,OAAO,SAAS,aAAa;AAC/B,eAAO,KAAK,MAAM;AAAA,MACpB,OAAO;AACL,eAAO,OAAO,KAAK,QAAQ,QAAQ,EAAE,SAAS,OAAO;AAAA,MACvD;AACA,YAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,YAAM,OAAO,OAAO,KAAK,MAAM,WAAW,OAAO,KAAK,IAAI;AAAA,IAC5D,QAAQ;AACN,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AAEA,QAAI,QAAQ,KAAK;AACf,YAAM,IAAI;AAAA,QACR,2CAA2C,GAAG,aAAa,OAAO,QAAQ;AAAA,MAC5E;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAIA,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAKO,SAAS,mBACd,QACA,QACA,UACA,SACa;AACb,SAAO,IAAI,YAAY;AAAA,IACrB,MAAa;AAAA,IACb,aAAa;AAAA,IACb,KAAa;AAAA,IACb;AAAA,IACA,QAAQ;AAAA,MACN;AAAA,MACA,QAAiBA,YAAW;AAAA,MAC5B,iBAAiB;AAAA,MACjB,iBAAiB;AAAA,MACjB,WAAiB;AAAA,MACjB;AAAA,IACF;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC,CAAC;AACH;AAYA,eAAsB,6BACpB,KACA,eACA,YAC6C;AAE7C,QAAM,UAAU,IAAI,SAAS,UAAU;AACvC,QAAM,UACJ,8BACA,YAAY,KACZ,IAAI,QAAQ,WACZ,IAAI,QAAQ;AAEd,MAAI,SAAS;AACX,WAAO,EAAE,OAAO,MAAM,QAAQ,yCAAyC;AAAA,EACzE;AAGA,QAAM,iBAAkB,IAAI,SAAS,iBAAiB,KACnD,IAAI,SAAS,eAAe;AAE/B,MAAI,CAAC,kBAAkB,mBAAmB,eAAe;AAEvD,WAAO,EAAE,OAAO,MAAM,QAAQ,6CAA6C;AAAA,EAC7E;AAGA,QAAM,WAAW,WAAW,OAAO,cAAc;AACjD,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,MACL,OAAQ;AAAA,MACR,QAAQ,qBAAqB,cAAc;AAAA,IAC7C;AAAA,EACF;AAGA,MAAI;AACJ,QAAM,cAAc,IAAI,SAAS,cAAc;AAC/C,MAAI,aAAa;AACf,UAAM,kBAAkB,WAAW;AAAA,EACrC,WAAW,OAAO,IAAI,QAAQ,UAAU;AACtC,UAAM,IAAI;AAAA,EACZ;AAEA,MAAI,wBAAqB;AACvB,WAAO;AAAA,MACL,OAAQ;AAAA,MACR,QAAQ,iFAAiF,GAAG;AAAA,IAC9F;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,QAAQ,kCAAkC;AAClE;;;AC3QO,IAAM,iBAAN,MAAM,wBAAuB,MAAM;AAAA,EACxC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,gBAAe,SAAS;AAAA,EACtD;AACF;AAIO,IAAK,oBAAL,kBAAKC,uBAAL;AACL,EAAAA,mBAAA,UAAU;AACV,EAAAA,mBAAA,aAAU;AACV,EAAAA,mBAAA,aAAU;AACV,EAAAA,mBAAA,SAAU;AAJA,SAAAA;AAAA,GAAA;AAgBZ,IAAM,iBAAyC;AAAA,EAC7C,UAAW;AAAA,EACX,QAAW;AAAA,EACX,WAAW;AAAA,EACX,UAAW;AAAA,EACX,QAAW;AAAA,EACX,OAAW;AAAA,EACX,SAAW;AAAA,EACX,WAAW;AACb;AAEA,IAAM,iBAAyC,OAAO;AAAA,EACpD,OAAO,QAAQ,cAAc,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACvD;AAGO,SAAS,cAAc,SAAkC;AAC9D,QAAM,OAAO,QAAQ,OAAO;AAC5B,QAAM,UAAmC,CAAC;AAE1C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC/C,UAAM,QAAQ,eAAe,GAAG;AAChC,YAAQ,SAAS,GAAG,IAAI;AAAA,EAC1B;AAGA,MAAI,QAAQ,GAAG,KAAK,OAAO,QAAQ,GAAG,MAAM,UAAU;AACpD,UAAM,SAAS,QAAQ,GAAG;AAC1B,UAAM,gBAAyC,CAAC;AAChD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,YAAM,QAAQ,eAAe,CAAC;AAC9B,oBAAc,SAAS,CAAC,IAAI;AAAA,IAC9B;AACA,YAAQ,GAAG,IAAI;AAAA,EACjB;AAEA,QAAM,OAAO,KAAK,UAAU,OAAO;AACnC,QAAM,UAAU,IAAI,YAAY;AAChC,SAAO,QAAQ,OAAO,IAAI;AAC5B;AAGO,SAAS,cAAc,MAA+B;AAC3D,QAAM,UAAU,IAAI,YAAY;AAChC,QAAM,OAAO,QAAQ,OAAO,IAAI;AAChC,QAAM,UAAU,KAAK,MAAM,IAAI;AAG/B,QAAM,OAAgC,CAAC;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AAClD,UAAM,OAAO,eAAe,GAAG;AAC/B,SAAK,QAAQ,GAAG,IAAI;AAAA,EACtB;AAGA,MAAI,KAAK,SAAS,KAAK,OAAO,KAAK,SAAS,MAAM,UAAU;AAC1D,UAAM,SAAS,KAAK,SAAS;AAC7B,UAAM,iBAA0C,CAAC;AACjD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,YAAM,OAAO,eAAe,CAAC;AAC7B,qBAAe,QAAQ,CAAC,IAAI;AAAA,IAC9B;AACA,SAAK,SAAS,IAAI;AAAA,EACpB;AAGA,SAAO,IAAI,YAAY;AAAA,IACrB,MAAc,KAAK,MAAM,KAA4B;AAAA,IACrD,aAAc,KAAK,aAAa;AAAA,IAChC,KAAc,KAAK,KAAK;AAAA,IACxB,QAAc,KAAK,QAAQ;AAAA,IAC3B,QAAc,KAAK,QAAQ,KAAkC,KAAK,SAAS,KAAiC,CAAC;AAAA,IAC7G,WAAc,KAAK,WAAW;AAAA,IAC9B,YAAc,KAAK,YAAY;AAAA,IAC/B,WAAc,KAAK,WAAW;AAAA,EAChC,CAAC;AACH;AAIA,IAAM,eAAe;AACrB,IAAM,cAAe;AAMrB,eAAe,YAAY,OAAoC;AAC7D,QAAM,UAAU,IAAI,YAAY,EAAE,OAAO,KAAK;AAC9C,QAAM,KAAK,IAAI,YAAY,QAAQ,UAAU;AAC7C,MAAI,WAAW,EAAE,EAAE,IAAI,OAAO;AAG9B,QAAM,SAAwB,WAAmB,QAAQ,WACnD,MAAM,OAAO,QAAuB,GAAG,UAAU;AACvD,QAAM,aAAa,MAAM,OAAO,OAAO,WAAW,EAAE;AACpD,SAAO,IAAI,WAAW,UAAU;AAClC;AAUA,eAAsB,cAAc,SAA2C;AAC7E,QAAM,UAAW,QAAQ,SAAS,UAAU,KAA4B;AACxE,MAAI,YAAY,aAAa;AAC3B,UAAM,IAAI;AAAA,MACR,kEAAkE,OAAO;AAAA,IAC3E;AAAA,EACF;AAEA,QAAM,UAAW,QAAQ,SAAS,UAAU,KAA4B,QAAQ,UAAU;AAC1F,QAAM,QAAW,QAAQ,SAAS,QAAQ,KAA8B,QAAQ,UAAU;AAE1F,QAAM,WAAW,MAAM,YAAY,OAAO;AAC1C,QAAM,SAAW,MAAM,YAAY,KAAK;AAExC,QAAM,OAAY,QAAQ,WAAW,OAAO,IAAI,QAAQ,oBAAoB,EAAE;AAC9E,MAAI;AACJ,MAAI;AACF,QAAI,OAAO,SAAS,aAAa;AAC/B,YAAM,MAAM,KAAK,IAAI,MAAM,GAAG,EAAE,CAAC;AACjC,iBAAW,IAAI,WAAW,IAAI,MAAM;AACpC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,UAAS,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,IACrE,OAAO;AACL,iBAAW,OAAO,KAAK,IAAI,MAAM,GAAG,EAAE,GAAG,QAAQ;AAAA,IACnD;AAAA,EACF,QAAQ;AACN,eAAW,IAAI,WAAW,CAAC;AAAA,EAC7B;AAGA,QAAM,KAAK,QAAQ,YAAY,KAAK,MAAM,IAAI,KAAK,QAAQ,SAAS,EAAE,QAAQ,IAAI,GAAI,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AACtH,QAAM,SAAS,OAAO;AAEtB,QAAM,MAAM,IAAI,WAAW,YAAY;AACvC,QAAM,OAAO,IAAI,SAAS,IAAI,MAAM;AAGpC,OAAK,UAAU,GAAG,aAAa,KAAK;AAEpC,MAAI,IAAI,SAAS,SAAS,GAAG,CAAC,GAAG,CAAC;AAElC,MAAI,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG,EAAE;AAEjC,OAAK,UAAU,IAAI,QAAQ,KAAK;AAEhC,QAAM,WAAW,IAAI,WAAW,CAAC;AACjC,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,IAAI,GAAG,SAAS,MAAM,CAAC,CAAC;AAC/D,MAAI,IAAI,UAAU,EAAE;AAEpB,MAAI,WAAW;AACf,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,aAAa,IAAI,CAAC,KAAK;AACpD,OAAK,UAAU,IAAI,WAAW,OAAQ,KAAK;AAG3C,MAAI,IAAI,WAAW,cAAc;AAC/B,UAAM,IAAI;AAAA,MACR,4CAA4C,YAAY,eAAe,IAAI,MAAM;AAAA,IACnF;AAAA,EACF;AAEA,SAAO;AACT;AAKO,SAAS,cAAc,MAAwC;AACpE,MAAI,KAAK,WAAW,cAAc;AAChC,UAAM,IAAI;AAAA,MACR,2BAA2B,YAAY,eAAe,KAAK,MAAM;AAAA,IACnE;AAAA,EACF;AAEA,QAAM,OAAW,IAAI,SAAS,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAC3E,QAAM,UAAW,KAAK,UAAU,GAAG,KAAK;AACxC,QAAM,WAAW,KAAK,SAAS,GAAG,EAAE;AACpC,QAAM,SAAW,KAAK,SAAS,IAAI,EAAE;AACrC,QAAM,SAAW,KAAK,UAAU,IAAI,KAAK;AACzC,QAAM,WAAW,KAAK,SAAS,IAAI,EAAE;AAGrC,QAAM,YAAY,IAAI,KAAK,SAAS,GAAI,EAAE,YAAY;AACtD,QAAMC,SAAQ,CAAC,MAAkB,MAAM,KAAK,CAAC,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAEhG,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,UAAa;AAAA,MACb,WAAaA,OAAM,QAAQ;AAAA,MAC3B,SAAaA,OAAM,MAAM;AAAA,MACzB,aAAa;AAAA,MACb,eAAeA,OAAM,QAAQ;AAAA,IAC/B;AAAA,IACA;AAAA,EACF;AACF;AAIA,IAAM,cAAc;AAEpB,IAAM,kBAAkB;AAMjB,SAAS,gBAAgB,SAAsB,MAAc,aAA2B;AAC7F,QAAM,UAAU,cAAc,OAAO;AACrC,QAAM,YAAY,MAAM;AAExB,MAAI,aAAa,GAAG;AAClB,UAAM,IAAI,eAAe,OAAO,GAAG,gCAAgC,kBAAkB,CAAC,GAAG;AAAA,EAC3F;AAEA,QAAM,cAAc,KAAK,KAAK,QAAQ,SAAS,SAAS;AACxD,QAAM,SAAuB,CAAC;AAE9B,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,UAAM,QAAQ,QAAQ,SAAS,IAAI,YAAY,IAAI,KAAK,SAAS;AACjE,UAAM,QAAQ,IAAI,WAAW,kBAAkB,MAAM,MAAM;AAC3D,UAAM,CAAC,IAAI;AACX,UAAM,CAAC,IAAI;AACX,UAAM,CAAC,IAAI,MAAM,cAAc,IAAI,IAAO;AAC1C,UAAM,IAAI,OAAO,eAAe;AAChC,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,SAAO;AACT;AAKO,SAAS,gBAAgB,QAAmC;AACjE,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,eAAe,qCAAqC;AAAA,EAChE;AAGA,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,OAAO,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,KAAK,EAAE;AAGnE,QAAM,gBAAgB,OAAO,CAAC,IAAI,CAAC,KAAK,OAAO;AAC/C,MAAI,OAAO,WAAW,eAAe;AACnC,UAAM,IAAI;AAAA,MACR,6BAA6B,aAAa,gBAAgB,OAAO,MAAM;AAAA,IACzE;AAAA,EACF;AAGA,QAAM,gBAAgB,OAAO,IAAI,OAAK,EAAE,SAAS,eAAe,CAAC;AACjE,QAAM,WAAW,cAAc,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC/D,QAAM,UAAU,IAAI,WAAW,QAAQ;AACvC,MAAI,SAAS;AACb,aAAW,SAAS,eAAe;AACjC,YAAQ,IAAI,OAAO,MAAM;AACzB,cAAU,MAAM;AAAA,EAClB;AAEA,SAAO,cAAc,OAAO;AAC9B;AAWO,SAAS,gBACd,WACA,SACmB;AACnB,QAAM,UAAW,QAAQ,SAAS,UAAU,KAA4B;AACxE,QAAM,WAAW,YAAY;AAE7B,QAAM,MAAM,CAAC,QAA2B,UAAU,SAAS,GAAG;AAE9D,MAAI,UAAU;AACZ,QAAI,IAAI,uBAAyB,EAAG,QAAO;AAC3C,QAAI,IAAI,eAAqB,EAAO,QAAO;AAC3C,QAAI,IAAI,uBAAyB,EAAG,QAAO;AAC3C,QAAI,IAAI,iBAAsB,EAAM,QAAO;AAAA,EAC7C,OAAO;AACL,QAAI,IAAI,iBAAsB,EAAM,QAAO;AAC3C,QAAI,IAAI,uBAAyB,EAAG,QAAO;AAC3C,QAAI,IAAI,eAAqB,EAAO,QAAO;AAAA,EAC7C;AAEA,QAAM,IAAI;AAAA,IACR,0CAA0C,UAAU,KAAK,IAAI,CAAC;AAAA,EAChE;AACF;;;ACrUO,IAAK,gBAAL,kBAAKC,mBAAL;AACL,EAAAA,eAAA,YAAS;AACT,EAAAA,eAAA,SAAS;AAFC,SAAAA;AAAA,GAAA;AAwBZ,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAEA,eAAe,iBAAiB,MAAmC;AAIjE,QAAM,SAAwB,WAAmB,QAAQ,WACnD,MAAM,OAAO,QAAuB,GAAG,UAAU;AACvD,QAAM,KAAK,IAAI,YAAY,KAAK,UAAU;AAC1C,MAAI,WAAW,EAAE,EAAE,IAAI,IAAI;AAC3B,QAAM,aAAa,MAAM,OAAO,OAAO,WAAW,EAAE;AACpD,QAAM,YAAa,IAAI,WAAW,UAAU;AAC5C,SAAO,MAAM,KAAK,SAAS,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAChF;AAEA,SAAS,cAAc,MAA0B;AAC/C,MAAI,OAAO,WAAW,aAAa;AACjC,WAAO,OAAO,KAAK,IAAI,EAAE,SAAS,QAAQ;AAAA,EAC5C;AAEA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,WAAU,OAAO,aAAa,KAAK,CAAC,KAAK,CAAC;AAChF,SAAO,KAAK,MAAM;AACpB;AAMA,SAAS,eACP,MACA,WACa;AACb,QAAM,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG,GAAG,UAAU;AAC9C,SAAO,YAAY,SAAS,IAA+B;AAC7D;AAQA,eAAsB,eACpB,SACA,MACA,UACsB;AACtB,QAAM,aAAa,MAAM,iBAAiB,IAAI;AAC9C,QAAM,UAAa,cAAc,IAAI;AAErC,QAAM,QAAoB;AAAA,IACxB,SAAYA,YAAW;AAAA,IACvB;AAAA,IACA,UAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,WAAY,KAAK;AAAA,EACnB;AAEA,QAAM,WAAY,QAAQ,eAAuD,CAAC;AAClF,SAAO,eAAe,SAAS,EAAE,aAAa,CAAC,GAAG,UAAU,KAAK,EAAE,CAAC;AACtE;AAKO,SAAS,YACd,SACA,QACA,UACA,YACA,WACa;AACb,QAAM,QAAoB;AAAA,IACxB,SAAYA,YAAW;AAAA,IACvB;AAAA,IACA,UAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,WAAY,QAAQ,eAAuD,CAAC;AAClF,SAAO,eAAe,SAAS,EAAE,aAAa,CAAC,GAAG,UAAU,KAAK,EAAE,CAAC;AACtE;AAMA,eAAsB,oBACpB,SAC6C;AAC7C,QAAM,SAAU,QAAQ,eAAuD,CAAC;AAEhF,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,OAAO,MAAM,QAAQ,kBAAkB;AAAA,EAClD;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,QAAQ,OAAO,CAAC;AAEtB,QAAI,CAAC,MAAM,QAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,qBAAqB;AACrF,QAAI,CAAC,MAAM,SAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,sBAAsB;AACtF,QAAI,CAAC,MAAM,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,wBAAwB;AACxF,QAAI,MAAM,YAAY,EAAG,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,4BAA4B;AAE9F,QAAI,MAAM,aAAa,uBAAsB;AAC3C,UAAI,CAAC,MAAM,SAAS;AAClB,eAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,sCAAsC;AAAA,MACjF;AAEA,UAAI;AACJ,UAAI;AACF,YAAI,OAAO,WAAW,aAAa;AACjC,oBAAU,OAAO,KAAK,MAAM,SAAS,QAAQ;AAAA,QAC/C,OAAO;AACL,gBAAM,MAAM,KAAK,MAAM,OAAO;AAC9B,oBAAU,IAAI,WAAW,IAAI,MAAM;AACnC,mBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,SAAQ,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,QACpE;AAAA,MACF,QAAQ;AACN,eAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,kCAAkC;AAAA,MAC7E;AACA,YAAM,aAAa,MAAM,iBAAiB,OAAO;AACjD,UAAI,eAAe,MAAM,YAAY;AACnC,eAAO;AAAA,UACL,OAAQ;AAAA,UACR,QAAQ,SAAS,CAAC,iCAAiC,MAAM,UAAU,SAAS,UAAU;AAAA,QACxF;AAAA,MACF;AAAA,IACF,WAAW,MAAM,aAAa,iBAAmB;AAC/C,UAAI,CAAC,MAAM,QAAQ;AACjB,eAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,kCAAkC;AAAA,MAC7E;AAAA,IACF,OAAO;AACL,aAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,wBAAwB,MAAM,QAAkB,IAAI;AAAA,IAC/F;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;AAOA,eAAsB,wBACpB,OACsB;AACtB,MAAI,MAAM,IAAI,YAAY;AAAA,IACxB,MAAa;AAAA,IACb,aAAa;AAAA,IACb,KAAa;AAAA,IACb,QAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,MACA,QAAUA,YAAW;AAAA,IACvB;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC,CAAC;AAED,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,eAAe,KAAK,KAAK,MAAM,KAAK,QAAQ;AAAA,EAC1D;AAEA,SAAO;AACT;AAKA,eAAsB,gBACpB,UACA,MACA,UACA,YACA,SACsB;AACtB,QAAM,aAAa,MAAM,iBAAiB,IAAI;AAC9C,QAAM,UAAa,cAAc,IAAI;AAErC,QAAM,QAAoB;AAAA,IACxB,SAAYA,YAAW;AAAA,IACvB;AAAA,IACA,UAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,WAAY,KAAK;AAAA,EACnB;AAEA,QAAM,kBAA+B;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,MAAM,IAAI,YAAY;AAAA,IACxB,MAAa;AAAA,IACb,aAAa;AAAA,IACb,KAAa;AAAA,IACb,QAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,MACA,QAAcA,YAAW;AAAA,MACzB,cAAc;AAAA,IAChB;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC,CAAC;AAGD,QAAM,eAAe,KAAK,EAAE,aAAa,CAAC,KAAK,EAAE,CAAC;AAClD,SAAO;AACT;;;ACvPO,IAAM,yBAAyB;AAoDtC,IAAI,aAAa;AAEjB,SAAS,cAAsB;AAC7B,SAAO,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE,UAAU;AACzC;AAEO,SAAS,sBACd,SAAmD,CAAC,GACjC;AACnB,SAAO;AAAA,IACL;AAAA,IACA,YAAY,OAAO,cAAc,YAAY;AAAA,IAC7C,YAAY,OAAO,cAAc;AAAA,IACjC,cAAc,OAAO,gBAAgB;AAAA,IACrC,cAAc,OAAO,gBAAgB;AAAA,IACrC,eAAe,OAAO,iBAAiB;AAAA,IACvC,sBAAsB,OAAO,wBAAwB;AAAA,IACrD,UAAU,OAAO,YAAY;AAAA,IAC7B,SAAS,OAAO,WAAW,CAAC;AAAA,IAC5B,WAAW,OAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EAC9C;AACF;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,QAAM,SAA2B;AAAA,IAC/B;AAAA,IACA,YAAY,OAAO,cAAc;AAAA,IACjC,cAAc,OAAO,gBAAgB;AAAA,IACrC,QAAQ,OAAO,UAAU;AAAA,IACzB,eAAe,OAAO,iBAAiB;AAAA,IACvC,YAAY,OAAO,cAAc;AAAA,IACjC,eAAe,OAAO,iBAAiB;AAAA,IACvC,gBAAgB,OAAO,kBAAkB,CAAC;AAAA,IAC1C,WAAW,OAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EAC9C;AACA,MAAI,OAAO,kBAAkB,QAAW;AACtC,WAAO,gBAAgB,OAAO;AAAA,EAChC;AACA,SAAO;AACT;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,SAAO;AAAA,IACL;AAAA,IACA,YAAY,OAAO,cAAc;AAAA,IACjC,cAAc,OAAO,gBAAgB;AAAA,IACrC,QAAQ,OAAO,UAAU;AAAA,IACzB,WAAW,OAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EAC9C;AACF;AASO,SAAS,wBACd,YACA,SAA0C,WACjC;AACT,MAAI,WAAW,aAAa,WAAW,UAAU;AAC/C,WAAO,cAAc;AAAA,EACvB;AACA,MAAI,WAAW,UAAU;AAEvB,WAAO,cAAc;AAAA,EACvB;AACA,SAAO;AACT;AAQO,SAAS,cAAc,YAA6B;AACzD,SAAO,cAAc;AACvB;;;ACvIO,IAAM,0BAA0B;AA8EvC,IAAIC,cAAa;AAEjB,SAAS,iBAAyB;AAChC,SAAO,OAAO,KAAK,IAAI,CAAC,IAAI,EAAEA,WAAU;AAC1C;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,OAAO,kBAAkB;AAAA,IACzC,oBAAoB,OAAO,sBAAsB;AAAA,IACjD,eAAe,OAAO,iBAAiB;AAAA,IACvC,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW,OAAO,aAAa;AAAA,IAC/B,YAAY,OAAO,cAAc,KAAK,IAAI,IAAI;AAAA,EAChD;AACF;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,QAAM,QAAQ,OAAO,SAAS;AAC9B,MAAI,QAAQ,KAAO,QAAQ,GAAK;AAC9B,UAAM,IAAI,MAAM,oCAAoC,KAAK,EAAE;AAAA,EAC7D;AACA,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,OAAO,kBAAkB;AAAA,IACzC,cAAc,OAAO,gBAAgB;AAAA,IACrC;AAAA,IACA,eAAe,OAAO,iBAAiB;AAAA,IACvC,UAAU,OAAO,YAAY;AAAA,IAC7B,cAAc,OAAO,gBAAgB,KAAK,IAAI,IAAI;AAAA,EACpD;AACF;AAEO,SAAS,mBACd,SAAgD,CAAC,GACjC;AAChB,SAAO;AAAA,IACL;AAAA,IACA,WAAW,OAAO,aAAa;AAAA,IAC/B,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW,OAAO,aAAa,CAAC;AAAA,IAChC,gBAAgB,OAAO,kBAAkB;AAAA,IACzC,cAAc,OAAO,gBAAgB,KAAK,IAAI,IAAI;AAAA,EACpD;AACF;AAEO,SAAS,2BACd,SAAwD,CAAC,GACjC;AACxB,QAAM,QAAQ,OAAO,SAAS;AAC9B,MAAI,QAAQ,KAAO,QAAQ,GAAK;AAC9B,UAAM,IAAI,MAAM,oCAAoC,KAAK,EAAE;AAAA,EAC7D;AACA,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,OAAO,UAAU,eAAe;AAAA,IACxC,UAAU,OAAO,YAAY;AAAA,IAC7B,cAAc,OAAO,gBAAgB;AAAA,IACrC;AAAA,IACA,eAAe,OAAO,iBAAiB;AAAA,IACvC,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW,OAAO,aAAa;AAAA,IAC/B,SAAS,OAAO,WAAW;AAAA,MACzB,cAAc;AAAA,MACd,UAAU;AAAA,MACV,kBAAkB;AAAA,MAClB,eAAe;AAAA,IACjB;AAAA,IACA,wBAAwB,OAAO,0BAA0B;AAAA,IACzD,YAAY,OAAO,cAAc,KAAK,IAAI,IAAI;AAAA,EAChD;AACF;AAQO,SAAS,yBAAyB,YAA6B;AACpE,SAAO,cAAc;AACvB;;;ACtKO,IAAM,yBAAyB;AAkD/B,SAAS,eAAe,GAA2C;AACxE,QAAM,OAA6B;AAAA,IACjC,KAAkB,EAAE;AAAA,IACpB,kBAAkB,EAAE;AAAA,IACpB,YAAkB,EAAE;AAAA,IACpB,YAAkB,EAAE;AAAA,IACpB,WAAkB,EAAE;AAAA,EACtB;AACA,MAAI,EAAE,UAAW,MAAK,YAAY,EAAE;AACpC,SAAO;AACT;AAGO,SAAS,iBAAiB,GAA2C;AAC1E,SAAO;AAAA,IACL,KAAiB,EAAE;AAAA,IACnB,iBAAiB,EAAE;AAAA,IACnB,WAAiB,EAAE;AAAA,IACnB,YAAiB,EAAE,cAAc,CAAC;AAAA,IAClC,UAAiB,EAAE,aAAa;AAAA,IAChC,WAAiB,EAAE;AAAA,EACrB;AACF;AAMO,SAAS,sBAAsB,GAA6B;AACjE,QAAM,MAA+B;AAAA,IACnC,YAAkB,EAAE;AAAA,IACpB,YAAkB,EAAE,WAAW,IAAI,QAAM;AAAA,MACvC,MAAS,EAAE;AAAA,MACX,MAAS,EAAE;AAAA,MACX,SAAS,EAAE;AAAA,IACb,EAAE;AAAA,IACF,kBAAkB,EAAE;AAAA,IACpB,KAAkB,EAAE;AAAA,IACpB,WAAkB,EAAE;AAAA,EACtB;AAEA,SAAO,KAAK,UAAU,GAAG;AAC3B;AAOO,IAAM,yBAAN,cAAqC,MAAM;AAAA,EAChD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAOO,SAAS,iBAAiB,GAA+B;AAC9D,QAAM,SAAmB,CAAC;AAC1B,MAAI,CAAC,EAAE,IAAK,QAAO,KAAK,iBAAiB;AACzC,MAAI,CAAC,EAAE,gBAAiB,QAAO,KAAK,6BAA6B;AACjE,MAAI,CAAC,EAAE,UAAW,QAAO,KAAK,uBAAuB;AACrD,MAAI,CAAC,EAAE,UAAU,WAAW,SAAS,EAAG,QAAO,KAAK,qCAAqC;AACzF,MAAI,CAAC,EAAE,SAAU,QAAO,KAAK,sBAAsB;AACnD,MAAI,CAAC,EAAE,UAAW,QAAO,KAAK,iDAAiD;AAC/E,aAAW,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,QAAQ,GAAG;AAC3C,QAAI,CAAC,EAAE,KAAM,QAAO,KAAK,cAAc,CAAC,oBAAoB;AAC5D,QAAI,CAAC,EAAE,QAAS,QAAO,KAAK,cAAc,CAAC,uBAAuB;AAClE,QAAI,CAAC,EAAE,KAAK,WAAW,SAAS,EAAG,QAAO,KAAK,cAAc,CAAC,kCAAkC;AAAA,EAClG;AACA,SAAO;AACT;;;ACjEO,SAAS,sBAAsB,GAAuD;AAC3F,SAAO;AAAA,IACL,YAAgB,EAAE;AAAA,IAClB,cAAgB,EAAE;AAAA,IAClB,gBAAgB,EAAE;AAAA,IAClB,eAAgB,EAAE;AAAA,IAClB,YAAgB,EAAE;AAAA,EACpB;AACF;AAEO,SAAS,wBAAwB,GAAuD;AAC7F,SAAO;AAAA,IACL,WAAe,EAAE;AAAA,IACjB,aAAe,EAAE;AAAA,IACjB,eAAe,EAAE,kBAAkB,CAAC;AAAA,IACpC,eAAe,EAAE,iBAAiB;AAAA,IAClC,WAAe,EAAE,cAAc;AAAA,EACjC;AACF;AAUO,SAAS,wBAAwB,GAAqC;AAC3E,QAAM,SAAmB,CAAC;AAC1B,MAAI,CAAC,EAAE,UAAW,QAAO,KAAK,uBAAuB;AACrD,MAAI,CAAC,EAAE,YAAa,QAAO,KAAK,yBAAyB;AACzD,MAAI,CAAC,EAAE,iBAAiB,EAAE,cAAc,WAAW;AACjD,WAAO,KAAK,kDAAkD;AAChE,MAAI,CAAC,EAAE,cAAe,QAAO,KAAK,2BAA2B;AAC7D,MAAI,CAAC,EAAE,aAAa,EAAE,aAAa,EAAG,QAAO,KAAK,6CAA6C;AAC/F,MAAI,EAAE,YAAY,KAAK,IAAI,IAAI,IAAM,QAAO,KAAK,qDAAgD;AACjG,SAAO;AACT;AAGO,SAAS,wBAAwB,GAAoC;AAC1E,SAAO,KAAK,IAAI,IAAI,MAAO,EAAE,aAAa,wBAAwB,CAAC,EAAE,WAAW;AAClF;AAMO,IAAM,wBAAwB;AAAA,EACnC,gBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,eAAiB;AAAA,EACjB,cAAiB;AACnB;;;AC/GO,IAAM,qBAAsB;AAC5B,IAAM,qBAAsB;AAE5B,IAAM,8BAA8B;AA2CpC,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAMA,SAASC,kBAAiB,OAAwC;AAChE,QAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,MAAI,MAAM,SAAS,EAAG,OAAM,IAAI,aAAa,uBAAuB;AACpE,QAAM,OAAO,MAAM,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACjE,QAAM,SAAS,MAAM,IAAI,QAAQ,IAAI,IAAI,SAAS,KAAK,CAAC;AACxD,MAAI;AACF,WAAO,KAAK,MAAM,KAAK,MAAM,CAAC;AAAA,EAChC,SAAS,GAAG;AACV,UAAM,IAAI,aAAa,8BAA8B,OAAO,CAAC,CAAC,EAAE;AAAA,EAClE;AACF;AAUO,SAAS,kBAAkB,OAA8B;AAC9D,QAAM,UAAUA,kBAAiB,KAAK;AACtC,QAAM,MAAM,OAAO,QAAQ,KAAK,KAAK,CAAC;AACtC,MAAI,MAAM,KAAK,KAAK,IAAI,IAAI,MAAO,KAAK;AACtC,UAAM,IAAI,aAAa,+BAA+B,OAAO,QAAQ,KAAK,CAAC,CAAC,GAAG;AAAA,EACjF;AACA,QAAM,UAAU,OAAO,QAAQ,UAAU,KAAK,EAAE;AAChD,MAAI,CAAC,QAAS,OAAM,IAAI,aAAa,uCAAuC;AAE5E,SAAO;AAAA,IACL,KAAS,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,IACpC;AAAA,IACA,QAAS,MAAM,QAAQ,QAAQ,aAAa,CAAC,IAAI,QAAQ,aAAa,IAC3D,MAAM,QAAQ,QAAQ,QAAQ,CAAC,IAAI,QAAQ,QAAQ,IAAgB,CAAC;AAAA,IAC/E;AAAA,IACA,KAAS,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,EACtC;AACF;AAYO,SAAS,qBAAqB,OAAiC;AACpE,QAAM,UAAUA,kBAAiB,KAAK;AAEtC,QAAM,MAAM,OAAO,QAAQ,KAAK,KAAK,EAAE;AACvC,MAAI,QAAQ,oBAAoB;AAC9B,UAAM,IAAI;AAAA,MACR,+BAA+B,kBAAkB,WAAW,GAAG;AAAA,IACjE;AAAA,EACF;AAEA,QAAM,SAAmB,MAAM,QAAQ,QAAQ,aAAa,CAAC,IACzD,QAAQ,aAAa,IACrB,MAAM,QAAQ,QAAQ,QAAQ,CAAC,IAAI,QAAQ,QAAQ,IAAgB,CAAC;AAExE,MAAI,CAAC,OAAO,SAAS,eAAe,GAAG;AACrC,UAAM,IAAI,aAAa,0DAA0D;AAAA,EACnF;AAEA,QAAM,MAAM,OAAO,QAAQ,KAAK,KAAK,CAAC;AACtC,MAAI,MAAM,KAAK,KAAK,IAAI,IAAI,MAAO,KAAK;AACtC,UAAM,IAAI,aAAa,kCAAkC,OAAO,QAAQ,KAAK,CAAC,CAAC,GAAG;AAAA,EACpF;AAEA,QAAM,SAAS,OAAO,QAAQ,SAAS,KAAK,EAAE;AAC9C,MAAI,CAAC,OAAQ,OAAM,IAAI,aAAa,yCAAyC;AAE7E,QAAM,YAAsB,MAAM,QAAQ,QAAQ,YAAY,CAAC,IAC3D,QAAQ,YAAY,IAAgB,CAAC;AAEzC,SAAO;AAAA,IACL,KAAK,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,IAChC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,4BACd,OACA,WACkB;AAClB,QAAM,SAAS,qBAAqB,KAAK;AAEzC,MAAI,CAAC,OAAO,UAAU,SAAS,SAAS,GAAG;AACzC,UAAM,IAAI;AAAA,MACR,oDAAoD,SAAS,yBACvC,OAAO,UAAU,KAAK,IAAI,CAAC;AAAA,IACnD;AAAA,EACF;AAEA,SAAO;AACT;AAYA,IAAI,mBAA2C;AAQ/C,eAAsB,oBACpB,MAAc,oBACY;AAC1B,QAAM,MAAM,KAAK,IAAI;AACrB,MAAI,oBAAoB,MAAM,iBAAiB,YAAY,6BAA6B;AACtF,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,OAAO,MAAM,MAAM,KAAK,EAAE,QAAQ,YAAY,UAAU,GAAI,EAAE,CAAC;AACrE,UAAM,OAAO,MAAM,KAAK,KAAK;AAI7B,uBAAmB;AAAA,MACjB,sBAAsB,IAAI,IAAI,KAAK,yBAAyB,CAAC,CAAC;AAAA,MAC9D,aAAsB,IAAI,IAAI,KAAK,gBAAgB,CAAC,CAAC;AAAA,MACrD,WAAsB;AAAA,IACxB;AAAA,EACF,QAAQ;AAEN,QAAI,iBAAkB,QAAO;AAC7B,uBAAmB,EAAE,sBAAsB,oBAAI,IAAI,GAAG,aAAa,oBAAI,IAAI,GAAG,WAAW,IAAI;AAAA,EAC/F;AAEA,SAAO;AACT;AAMA,eAAsB,oBACpB,QACA,KACkB;AAClB,QAAM,QAAQ,MAAM,oBAAoB;AACxC,MAAI,MAAM,qBAAqB,IAAI,OAAO,GAAG,EAAG,QAAO;AACvD,MAAI,OAAO,MAAM,YAAY,IAAI,GAAG,EAAG,QAAO;AAC9C,SAAO;AACT;AAQA,eAAsB,sBACpB,OACA,WACA,SAC2B;AAC3B,QAAM,SAAS,4BAA4B,OAAO,SAAS;AAE3D,MAAI,CAAC,SAAS,qBAAqB;AACjC,UAAM,UAAU,MAAM,oBAAoB,MAAM;AAChD,QAAI,SAAS;AACX,YAAM,IAAI;AAAA,QACR,6BAA6B,OAAO,GAAG;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;AC/OA,SAAS,YAAY,OAA2B;AAC9C,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,WAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAC9E,SAAO,KAAK,MAAM,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,MAAM,EAAE;AAC9E;AAEA,SAAS,cAAc,KAAyB;AAC9C,QAAM,SAAS,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACvD,QAAM,SAAS,KAAK,MAAM;AAC1B,QAAM,QAAQ,IAAI,WAAW,OAAO,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,OAAM,CAAC,IAAI,OAAO,WAAW,CAAC;AACtE,SAAO;AACT;AAEA,eAAe,UAAU,MAAmC;AAC1D,MAAI,OAAO,WAAW,eAAe,OAAO,QAAQ;AAClD,UAAM,MAAM,MAAM,OAAO,OAAO,OAAO,WAAW,KAAK,MAAqB;AAC5E,WAAO,MAAM,KAAK,IAAI,WAAW,GAAG,CAAC,EAClC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE,EACP,MAAM,GAAG,CAAC;AAAA,EACf;AAEA,QAAM,EAAE,WAAW,IAAI,UAAQ,QAAa;AAC5C,SAAO,WAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,CAAC;AACnE;AAEA,IAAI;AAEJ,eAAe,eAAe;AAC5B,MAAI,aAAc,QAAO;AACzB,MAAI,OAAO,cAAY,aAAa;AAClC,QAAI;AAEF,qBAAe,UAAQ,+BAA+B;AACtD,aAAO;AAAA,IACT,QAAQ;AAAA,IAAqB;AAAA,EAC/B;AACA,MAAI;AACF,mBAAe,MAAM,OAAO,+BAA+B;AAC3D,WAAO;AAAA,EACT,QAAQ;AACN,UAAM,IAAI;AAAA,MACR;AAAA,IAEF;AAAA,EACF;AACF;AAWO,IAAM,eAAN,MAAM,cAAa;AAAA,EAKhB,YAAY,MAAwB;AAJ5C,wBAAS;AACT,wBAAS;AACT,wBAAS;AAGP,SAAK,QAAQ,KAAK;AAClB,SAAK,YAAY,KAAK;AACtB,SAAK,YAAY,KAAK;AAAA,EACxB;AAAA,EAEA,aAAa,WAAkC;AAC7C,UAAM,IAAI,MAAM,aAAa;AAC7B,UAAM,KAAK,EAAG,SAAS,OAAO;AAC9B,UAAM,QAAQ,MAAM,UAAU,GAAG,SAAS;AAC1C,WAAO,IAAI,cAAa,EAAE,WAAW,GAAG,WAAW,WAAW,GAAG,WAAW,MAAM,CAAC;AAAA,EACrF;AAAA,EAEA,aAAa,cAAc,WAA8C;AACvE,UAAM,QAAQ,MAAM,UAAU,SAAS;AACvC,WAAO,IAAI,cAAa,EAAE,WAAW,MAAM,CAAC;AAAA,EAC9C;AAAA,EAEA,aAAa,gBAAgB,WAAuB,WAA8C;AAChG,UAAM,QAAQ,MAAM,UAAU,SAAS;AACvC,WAAO,IAAI,cAAa,EAAE,WAAW,WAAW,MAAM,CAAC;AAAA,EACzD;AAAA,EAEA,IAAI,gBAAyB;AAAE,WAAO,KAAK,cAAc;AAAA,EAAW;AAAA,EAEpE,MAAM,UAAU,MAAuC;AACrD,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,4DAA4D;AACjG,UAAM,IAAI,MAAM,aAAa;AAC7B,WAAO,EAAG,SAAS,KAAK,MAAM,KAAK,SAAS;AAAA,EAC9C;AAAA,EAEA,MAAM,YAAY,MAAkB,WAAsC;AACxE,UAAM,IAAI,MAAM,aAAa;AAC7B,UAAM,KAAK,EAAG,SAAS,OAAO,WAAW,MAAM,KAAK,SAAS;AAC7D,QAAI,CAAC,GAAI,OAAM,IAAI,MAAM,yCAAyC;AAAA,EACpE;AAAA,EAEA,WAAmB;AACjB,WAAO,sBAAsB,KAAK,KAAK,oBAAoB,KAAK,gBAAgB,mBAAmB,aAAa;AAAA,EAClH;AACF;AAMA,SAAS,sBAAsB,KAA8B;AAC3D,QAAM,UAAU;AAAA,IACd,MAAM,IAAI;AAAA,IACV,QAAS,IAA2C,OAAO,KAAK;AAAA,IAChE,WAAW,IAAI;AAAA,IACf,KAAK,IAAI;AAAA,IACT,QAAQ,IAAI;AAAA,IACZ,QAAQ,IAAI;AAAA,EACd;AACA,SAAO,IAAI,YAAY,EAAE;AAAA,IACvB,KAAK,UAAU,OAAO,YAAY,OAAO,QAAQ,OAAO,EAAE,KAAK,CAAC,CAAC;AAAA,EACnE;AACF;AAWA,eAAsB,YACpB,KACA,SACsB;AACtB,QAAM,UAAU,sBAAsB,GAAG;AACzC,QAAM,SAAS,MAAM,QAAQ,UAAU,OAAO;AAC9C,EAAC,IAA2C,WAAW,IAAI;AAAA,IACzD,KAAK;AAAA,IACL,KAAK,QAAQ;AAAA,IACb,KAAK,YAAY,MAAM;AAAA,EACzB;AACA,SAAO;AACT;AAOA,eAAsB,cACpB,KACA,aACe;AACf,QAAM,MAAM,IAAI;AAChB,MAAI,CAAC,IAAK,OAAM,IAAI,MAAM,oDAA+C;AACzE,MAAI,IAAI,QAAQ,aAAa;AAC3B,UAAM,IAAI;AAAA,MACR,oCAAoC,IAAI,GAAG;AAAA,IAE7C;AAAA,EACF;AACA,QAAM,UAAU,YAAY,KAAK,CAAC,MAAM,EAAE,UAAU,IAAI,GAAG;AAC3D,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI;AAAA,MACR,qCAAqC,IAAI,GAAG,kBAC1B,YAAY,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC;AAAA,IAC9D;AAAA,EACF;AACA,MAAI;AACJ,MAAI;AAAE,aAAS,cAAc,IAAI,GAAG;AAAA,EAAG,SAAS,GAAG;AAAE,UAAM,IAAI,MAAM,0BAA0B,CAAC,EAAE;AAAA,EAAG;AACrG,QAAM,QAAQ,YAAY,sBAAsB,GAAG,GAAG,MAAM;AAC9D;AAOO,IAAM,iBAAiB;AAG9B,eAAsB,kBACpB,KACA,aACA,aAAa,MACE;AACf,SAAO,cAAc,KAAK,WAAW;AACvC;;;ACjNO,IAAM,gBAA0C;AAAA,EACrD,GAAG,CAAC,YAAY,UAAU,cAAc;AAAA,EACxC,GAAG,CAAC,QAAQ,WAAW,QAAQ;AAAA,EAC/B,GAAG,CAAC,UAAU,QAAQ;AACxB;AAGO,IAAM,wBAAgD;AAAA;AAAA,EAE3D,YAAY;AAAA,EACZ,cAAc;AAAA,EACd,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,mBAAmB;AAAA;AAAA,EAEnB,eAAe;AAAA,EACf,aAAa;AAAA,EACb,cAAc;AAAA,EACd,mBAAmB;AAAA,EACnB,iBAAiB;AAAA;AAAA,EAEjB,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,YAAY;AACd;AAgBO,SAAS,iBAAiB,QAAyB,UAA2B;AACnF,QAAM,WAAW,sBAAsB,QAAQ,KAAK;AACpD,SAAO,OAAO,OAAO;AACvB;;;AC5BO,IAAM,uBAAuB;AAE7B,SAASC,yBAAwB,OAA8B;AACpE,MAAI,MAAM,SAAS,sBAAsB;AACvC,UAAM,IAAI;AAAA,MACR,uCAAuC,oBAAoB,SAAS,MAAM,MAAM;AAAA,IAClF;AAAA,EACF;AACF;AAKO,IAAI;AAOJ,SAAS,qBAAqB,OAAyB;AAC5D,MAAI,CAAC,MAAM,KAAM;AACjB,MAAI;AAEJ,MAAI,WAAW;AACb,aAAS,UAAU,MAAM,IAAI;AAAA,EAC/B,OAAO;AACL,QAAI;AAGF,YAAM,IAAI,OAAO,cAAY,cAAc,YAAU;AACrD,UAAI,CAAC,EAAG;AACR,YAAM,EAAE,WAAW,IAAI,EAAE,aAAa;AAGtC,eAAS,YAAY,WAAW,QAAQ,EAAE,OAAO,MAAM,IAAI,EAAE,OAAO,KAAK;AAAA,IAC3E,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,MAAM,aAAa;AAChC,UAAM,IAAI,MAAM,sCAAsC,MAAM,WAAW,SAAS,MAAM,EAAE;AAAA,EAC1F;AACF;;;AC+GO,IAAM,UAAU;AAEhB,IAAM,eAAe;","names":["MessageType","data","QoSLevel","generateId","SAFETY_MESSAGE_TYPE","generateId","generateId","status","DataCategory","SAFETY_MESSAGE_TYPE","FaultCode","Role","RegistryTier","FederationSyncType","CACHE_TTL_MS","generateId","TransportEncoding","toHex","MediaEncoding","generateId","_idCounter","decodeJwtPayload","validateDelegationChain"]}
1	+ {"version":3,"sources":["../src/address.ts","../src/version.ts","../src/message.ts","../src/crypto.ts","../node_modules/@noble/hashes/src/utils.ts","../node_modules/@noble/hashes/src/_md.ts","../node_modules/@noble/hashes/src/_u64.ts","../node_modules/@noble/hashes/src/sha2.ts","../node_modules/@noble/curves/src/utils.ts","../node_modules/@noble/curves/src/abstract/modular.ts","../node_modules/@noble/curves/src/abstract/curve.ts","../node_modules/@noble/curves/src/abstract/edwards.ts","../node_modules/@noble/curves/src/ed25519.ts","../src/gates.ts","../src/audit.ts","../src/validate.ts","../src/errors.ts","../src/registry.ts","../src/node.ts","../src/schema.ts","../src/qos.ts","../src/safety.ts","../src/replay.ts","../src/clock.ts","../src/configUpdate.ts","../src/keys.ts","../src/consent.ts","../src/revocation.ts","../src/trainingConsent.ts","../src/offline.ts","../src/faultReport.ts","../src/identity.ts","../src/federation.ts","../src/transport.ts","../src/multimodal.ts","../src/contribute.ts","../src/competition.ts","../src/firmware.ts","../src/authority.ts","../src/m2m.ts","../src/pqSigning.ts","../src/mcp.ts","../src/delegation.ts","../src/index.ts"],"sourcesContent":["/*\n RCAN Robot URI — addressing scheme for RCAN v1.2.\n \n Format: rcan://<registry>/<manufacturer>/<model>/<version>/<device-id>\n * Example: rcan://registry.rcan.dev/acme/robotarm/v2/unit-001\n /\n\nexport class RobotURIError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"RobotURIError\";\n }\n}\n\nexport interface RobotURIOptions {\n manufacturer: string;\n model: string;\n version: string;\n deviceId: string;\n registry?: string;\n}\n\nexport class RobotURI {\n readonly registry: string;\n readonly manufacturer: string;\n readonly model: string;\n readonly version: string;\n readonly deviceId: string;\n\n private constructor(opts: Required<RobotURIOptions>) {\n this.registry = opts.registry;\n this.manufacturer = opts.manufacturer;\n this.model = opts.model;\n this.version = opts.version;\n this.deviceId = opts.deviceId;\n }\n\n /* Parse a RCAN URI string. Throws RobotURIError on invalid input. /\n static parse(uri: string): RobotURI {\n if (!uri.startsWith(\"rcan://\")) {\n throw new RobotURIError(`URI must start with 'rcan://' — got: ${uri}`);\n }\n const withoutScheme = uri.slice(\"rcan://\".length);\n const parts = withoutScheme.split(\"/\");\n if (parts.length !== 5) {\n throw new RobotURIError(\n `URI must have exactly 5 path segments (registry/manufacturer/model/version/device-id) — got ${parts.length} in: ${uri}`\n );\n }\n const [registry, manufacturer, model, version, deviceId] = parts;\n for (const [name, value] of [\n [\"registry\", registry],\n [\"manufacturer\", manufacturer],\n [\"model\", model],\n [\"version\", version],\n [\"device-id\", deviceId],\n ] as [string, string][]) {\n if (!value \|\| value.trim() === \"\") {\n throw new RobotURIError(`URI segment '${name}' must not be empty`);\n }\n }\n return new RobotURI({ registry, manufacturer, model, version, deviceId });\n }\n\n /* Build a RCAN URI from components. /\n static build(opts: RobotURIOptions): RobotURI {\n const registry = opts.registry ?? \"registry.rcan.dev\";\n const { manufacturer, model, version, deviceId } = opts;\n for (const [name, value] of [\n [\"manufacturer\", manufacturer],\n [\"model\", model],\n [\"version\", version],\n [\"deviceId\", deviceId],\n ] as [string, string][]) {\n if (!value \|\| value.trim() === \"\") {\n throw new RobotURIError(`'${name}' must not be empty`);\n }\n }\n return new RobotURI({ registry, manufacturer, model, version, deviceId });\n }\n\n /* Full URI string: rcan://registry/manufacturer/model/version/device-id /\n toString(): string {\n return `rcan://${this.registry}/${this.manufacturer}/${this.model}/${this.version}/${this.deviceId}`;\n }\n\n /* Short namespace: manufacturer/model /\n get namespace(): string {\n return `${this.manufacturer}/${this.model}`;\n }\n\n /* HTTPS registry URL for this robot /\n get registryUrl(): string {\n return `https://${this.registry}/registry/${this.manufacturer}/${this.model}/${this.version}/${this.deviceId}`;\n }\n\n /* Check if two URIs refer to the same robot /\n equals(other: RobotURI): boolean {\n return this.toString() === other.toString();\n }\n\n toJSON(): object {\n return {\n uri: this.toString(),\n registry: this.registry,\n manufacturer: this.manufacturer,\n model: this.model,\n version: this.version,\n deviceId: this.deviceId,\n };\n }\n}\n","/\n RCAN Protocol Version — single source of truth.\n \n All modules that need SPEC_VERSION import from here.\n * §3.5 — Protocol Version Compatibility\n /\n\n/* The RCAN spec version this SDK implements. /\nexport const SPEC_VERSION = \"2.2.1\";\n\n/* The SDK release version. /\nexport const SDK_VERSION = \"1.2.2\";\n\n/\n Validate version compatibility.\n \n MAJOR must match. Lower-or-equal MINOR is acceptable.\n \n @param incomingVersion - The rcanVersion from the incoming message\n * @param localVersion - The local SPEC_VERSION (defaults to SPEC_VERSION)\n * @returns true if compatible, false if MAJOR mismatch\n /\nexport function validateVersionCompat(\n incomingVersion: string,\n localVersion: string = SPEC_VERSION\n): boolean {\n const parseParts = (v: string): [number, number] => {\n const parts = v.split(\".\");\n const major = parseInt(parts[0] ?? \"0\", 10);\n const minor = parseInt(parts[1] ?? \"0\", 10);\n return [isNaN(major) ? 0 : major, isNaN(minor) ? 0 : minor];\n };\n\n const [inMajor] = parseParts(incomingVersion);\n const [localMajor] = parseParts(localVersion);\n\n // MAJOR must match\n return inMajor === localMajor;\n}\n","/\n RCAN Message — command envelope for RCAN v1.5.\n \n A RCANMessage wraps a robot command with:\n * - RCAN protocol version\n * - Target Robot URI\n * - Command name and parameters\n * - Optional AI confidence score (§16)\n * - Optional model identity (§16)\n * - Optional Ed25519 signature\n * - v1.5: rcanVersion, senderType, cloudProvider, keyId, delegation chain, QoS, etc.\n /\n\nimport { RobotURI } from \"./address.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\n// ── v1.5 Canonical MessageType table ─────────────────────────────────────────\n// These integers MUST match rcan-py.\n\n// ═══════════════════════════════════════════════════════════════════\n// v1.10 Canonical MessageType Table\n// This is the SINGLE SOURCE OF TRUTH. Values MUST match rcan-spec §3\n// and rcan-py exactly. See: https://rcan.dev/spec/v1.8\n// ═══════════════════════════════════════════════════════════════════\nexport enum MessageType {\n // Core protocol (1–8)\n COMMAND = 1,\n RESPONSE = 2,\n STATUS = 3,\n HEARTBEAT = 4,\n CONFIG = 5,\n SAFETY = 6,\n AUTH = 7,\n ERROR = 8,\n\n // Discovery & authorization (9–10)\n DISCOVER = 9,\n PENDING_AUTH = 10,\n\n // Skill invocation (11–13)\n INVOKE = 11,\n INVOKE_RESULT = 12,\n INVOKE_CANCEL = 13,\n\n // Registry (14–15)\n REGISTRY_REGISTER = 14,\n REGISTRY_RESOLVE = 15,\n\n // Audit & transparency (16)\n TRANSPARENCY = 16, // EU AI Act Art. 13 audit record\n\n // Acknowledgement & QoS (17–18)\n COMMAND_ACK = 17,\n COMMAND_NACK = 18,\n\n // Identity & consent (19–22)\n ROBOT_REVOCATION = 19,\n CONSENT_REQUEST = 20,\n CONSENT_GRANT = 21,\n CONSENT_DENY = 22,\n\n // Fleet & telemetry (23–25)\n FLEET_COMMAND = 23,\n SUBSCRIBE = 24,\n UNSUBSCRIBE = 25,\n\n // Diagnostics (26–28)\n FAULT_REPORT = 26,\n KEY_ROTATION = 27,\n COMMAND_COMMIT = 28,\n\n // Sensor & training consent (29–32)\n SENSOR_DATA = 29,\n TRAINING_CONSENT_REQUEST = 30,\n TRAINING_CONSENT_GRANT = 31,\n TRAINING_CONSENT_DENY = 32,\n\n // Idle compute contribution — v1.7 (33–35)\n CONTRIBUTE_REQUEST = 33,\n CONTRIBUTE_RESULT = 34,\n CONTRIBUTE_CANCEL = 35,\n\n // Multimodal training data — v1.8 (36)\n TRAINING_DATA = 36,\n\n // ── Competition protocol — v1.10 (37–40) ─────────────────────────────────\n COMPETITION_ENTER = 37,\n COMPETITION_SCORE = 38,\n SEASON_STANDING = 39,\n PERSONAL_RESEARCH_RESULT = 40,\n\n // ── Authority & attestation — v2.1 (41–44) ──────────────────\n /* authority → robot: EU AI Act Art. 16(j) audit data request /\n AUTHORITY_ACCESS = 41,\n /* robot → authority: audit data response /\n AUTHORITY_RESPONSE = 42,\n /* robot → RRF: publish signed firmware manifest /\n FIRMWARE_ATTESTATION = 43,\n /* robot → RRF: publish updated CycloneDX SBOM /\n SBOM_UPDATE = 44,\n // FEDERATION_SYNC, ALERT, AUDIT aliases removed in v2.1\n}\n\n// ── v1.5 SenderType ───────────────────────────────────────────────────────────\n/* §8.5 — Sender Type and Service Identity /\nexport type SenderType = \"robot\" \| \"human\" \| \"cloud_function\" \| \"system\";\n\n// ── v1.5 DelegationHop ────────────────────────────────────────────────────────\n/* §12 — Command Delegation and Chain of Custody /\nexport interface DelegationHop {\n issuerRuri: string;\n humanSubject: string;\n timestamp: string;\n scope: string;\n signature: string;\n}\n\n/* RCAN v2.2: ML-DSA-65 is the only valid alg (\"ml-dsa-65\"). Ed25519 is deprecated. /\nexport interface SignatureBlock {\n alg: \"ml-dsa-65\";\n kid: string;\n sig: string;\n}\n\n/* v2.2: Post-quantum (ML-DSA-65) signature block /\nexport interface PQSignatureBlock {\n alg: \"ml-dsa-65\";\n kid: string;\n sig: string;\n}\n\nexport interface RCANMessageData {\n rcan?: string;\n /* v1.5: explicit protocol version field (defaults to SPEC_VERSION) /\n rcanVersion?: string;\n cmd: string;\n target: string \| RobotURI;\n params?: Record<string, unknown>;\n confidence?: number;\n modelIdentity?: string;\n model_identity?: string; // snake_case alias\n signature?: SignatureBlock;\n timestamp?: string;\n /* v1.5: GAP-08 sender identity /\n senderType?: SenderType;\n cloudProvider?: string;\n /* v1.5: GAP-09 key id /\n keyId?: string;\n /* v1.5: GAP-01 delegation chain /\n delegationChain?: DelegationHop[];\n /* v1.5: GAP-13 fleet group /\n groupId?: string;\n /* v1.5: GAP-11 QoS level /\n qos?: number;\n /* v1.5: GAP-19 physical presence /\n presenceVerified?: boolean;\n proximityMeters?: number;\n /* v1.5: GAP-15 observer /\n readOnly?: boolean;\n /* v1.6: GAP-14 level of assurance /\n loa?: number;\n /* v1.6: GAP-17 transport encoding hint /\n transportEncoding?: string;\n /* v1.6: GAP-18 multi-modal media chunks /\n // typed as unknown[] to avoid circular dependency with multimodal.ts\n mediaChunks?: Array<Record<string, unknown>>;\n /* v2.1: SHA-256 of sender's firmware manifest (envelope field 13). Required at L2+. /\n firmwareHash?: string;\n /* v2.1: URI to sender's SBOM attestation endpoint (envelope field 14). Required at L2+. /\n attestationRef?: string;\n /* v2.2: ML-DSA-65 post-quantum signature block (field 16, FIPS 204). Hybrid mode alongside Ed25519. /\n pqSig?: PQSignatureBlock \| undefined;\n /* v2.2 snake_case envelope aliases (spec §3.2) /\n firmware_hash?: string;\n attestation_ref?: string;\n pq_sig?: string;\n pq_alg?: string;\n [key: string]: unknown;\n}\n\nexport class RCANMessageError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"RCANMessageError\";\n }\n}\n\nexport class RCANMessage {\n readonly rcan: string;\n /* v1.5: rcanVersion field — defaults to SPEC_VERSION /\n readonly rcanVersion: string;\n readonly cmd: string;\n readonly target: string;\n readonly params: Record<string, unknown>;\n readonly confidence: number \| undefined;\n readonly modelIdentity: string \| undefined;\n readonly signature: SignatureBlock \| undefined;\n readonly timestamp: string;\n /* v1.5 fields /\n readonly senderType: SenderType \| undefined;\n readonly cloudProvider: string \| undefined;\n readonly keyId: string \| undefined;\n readonly delegationChain: DelegationHop[] \| undefined;\n readonly groupId: string \| undefined;\n readonly qos: number \| undefined;\n readonly presenceVerified: boolean \| undefined;\n readonly proximityMeters: number \| undefined;\n readonly readOnly: boolean \| undefined;\n /* v1.6: GAP-14 level of assurance /\n readonly loa: number \| undefined;\n /* v1.6: GAP-17 transport encoding hint /\n readonly transportEncoding: string \| undefined;\n /* v1.6: GAP-18 multi-modal media chunks /\n readonly mediaChunks: Array<Record<string, unknown>> \| undefined;\n /* v2.1: SHA-256 of sender's firmware manifest /\n readonly firmwareHash: string \| undefined;\n /* v2.1: URI to sender's SBOM attestation endpoint /\n readonly attestationRef: string \| undefined;\n /* v2.2: ML-DSA-65 post-quantum signature (field 16, FIPS 204). Hybrid alongside Ed25519. /\n readonly pqSig: PQSignatureBlock \| undefined;\n\n constructor(data: RCANMessageData) {\n if (!data.cmd \|\| data.cmd.trim() === \"\") {\n throw new RCANMessageError(\"'cmd' is required\");\n }\n if (!data.target) {\n throw new RCANMessageError(\"'target' is required\");\n }\n\n this.rcan = data.rcan ?? SPEC_VERSION;\n this.rcanVersion = data.rcanVersion ?? SPEC_VERSION;\n this.cmd = data.cmd;\n this.target =\n data.target instanceof RobotURI ? data.target.toString() : String(data.target);\n this.params = data.params ?? {};\n this.confidence = data.confidence;\n this.modelIdentity = data.modelIdentity ?? data.model_identity;\n this.signature = data.signature;\n this.timestamp = data.timestamp ?? new Date().toISOString();\n this.senderType = data.senderType;\n this.cloudProvider = data.cloudProvider;\n this.keyId = data.keyId;\n this.delegationChain = data.delegationChain;\n this.groupId = data.groupId;\n this.qos = data.qos;\n this.presenceVerified = data.presenceVerified;\n this.proximityMeters = data.proximityMeters;\n this.readOnly = data.readOnly;\n this.loa = data.loa;\n this.transportEncoding = data.transportEncoding;\n this.mediaChunks = data.mediaChunks;\n this.firmwareHash = data.firmwareHash;\n this.attestationRef = data.attestationRef;\n this.pqSig = data.pqSig as PQSignatureBlock \| undefined;\n\n // v2.1: hard-reject signature blocks with sig:'pending' (removed legacy pattern)\n if (\n this.signature !== undefined &&\n (this.signature as unknown as Record<string, unknown>)['sig'] === 'pending'\n ) {\n throw new RCANMessageError(\n \"signature.sig:'pending' is not valid in RCAN v2.1. Sign the message before sending.\"\n );\n }\n\n if (this.confidence !== undefined) {\n if (this.confidence < 0 \|\| this.confidence > 1) {\n throw new RCANMessageError(\n `confidence must be in [0.0, 1.0] — got ${this.confidence}`\n );\n }\n }\n }\n\n /* Whether this message has a signature block /\n get isSigned(): boolean {\n return this.signature !== undefined && this.signature.sig !== \"\";\n }\n\n /* Whether this message was generated by an AI model (has confidence score) /\n get isAiDriven(): boolean {\n return this.confidence !== undefined;\n }\n\n /* Serialize to a plain object /\n toJSON(): Record<string, unknown> {\n const obj: Record<string, unknown> = {\n rcan: this.rcan,\n rcanVersion: this.rcanVersion,\n cmd: this.cmd,\n target: this.target,\n timestamp: this.timestamp,\n };\n if (Object.keys(this.params).length > 0) obj.params = this.params;\n if (this.confidence !== undefined) obj.confidence = this.confidence;\n if (this.modelIdentity) obj.model_identity = this.modelIdentity;\n if (this.signature) obj.signature = this.signature;\n if (this.senderType !== undefined) obj.senderType = this.senderType;\n if (this.cloudProvider !== undefined) obj.cloudProvider = this.cloudProvider;\n if (this.keyId !== undefined) obj.keyId = this.keyId;\n if (this.delegationChain !== undefined) obj.delegationChain = this.delegationChain;\n if (this.groupId !== undefined) obj.groupId = this.groupId;\n if (this.qos !== undefined) obj.qos = this.qos;\n if (this.presenceVerified !== undefined) obj.presenceVerified = this.presenceVerified;\n if (this.proximityMeters !== undefined) obj.proximityMeters = this.proximityMeters;\n if (this.readOnly !== undefined) obj.readOnly = this.readOnly;\n if (this.loa !== undefined) obj.loa = this.loa;\n if (this.transportEncoding !== undefined) obj.transportEncoding = this.transportEncoding;\n if (this.mediaChunks !== undefined) obj.mediaChunks = this.mediaChunks;\n if (this.firmwareHash !== undefined) obj.firmwareHash = this.firmwareHash;\n if (this.attestationRef !== undefined) obj.attestationRef = this.attestationRef;\n return obj;\n }\n\n /* Serialize to JSON string /\n toJSONString(indent?: number): string {\n return JSON.stringify(this.toJSON(), null, indent);\n }\n\n /* Parse from a plain object or JSON string /\n static fromJSON(data: string \| Record<string, unknown>): RCANMessage {\n let obj: Record<string, unknown>;\n if (typeof data === \"string\") {\n try {\n obj = JSON.parse(data) as Record<string, unknown>;\n } catch {\n throw new RCANMessageError(\"Invalid JSON string\");\n }\n } else {\n obj = data;\n }\n\n if (!obj.cmd) throw new RCANMessageError(\"Missing required field: 'cmd'\");\n if (!obj.target) throw new RCANMessageError(\"Missing required field: 'target'\");\n if (!obj.rcan) throw new RCANMessageError(\"Missing required field: 'rcan'\");\n\n return new RCANMessage({\n rcan: obj.rcan as string,\n rcanVersion: (obj.rcanVersion as string \| undefined),\n cmd: obj.cmd as string,\n target: obj.target as string,\n params: (obj.params as Record<string, unknown>) ?? {},\n confidence: obj.confidence as number \| undefined,\n modelIdentity:\n (obj.model_identity as string \| undefined) ??\n (obj.modelIdentity as string \| undefined),\n signature: obj.signature as SignatureBlock \| undefined,\n timestamp: obj.timestamp as string \| undefined,\n senderType: obj.senderType as SenderType \| undefined,\n cloudProvider: obj.cloudProvider as string \| undefined,\n keyId: obj.keyId as string \| undefined,\n delegationChain: obj.delegationChain as DelegationHop[] \| undefined,\n groupId: obj.groupId as string \| undefined,\n qos: obj.qos as number \| undefined,\n presenceVerified: obj.presenceVerified as boolean \| undefined,\n proximityMeters: obj.proximityMeters as number \| undefined,\n readOnly: obj.readOnly as boolean \| undefined,\n loa: obj.loa as number \| undefined,\n transportEncoding: obj.transportEncoding as string \| undefined,\n mediaChunks: obj.mediaChunks as Array<Record<string, unknown>> \| undefined,\n firmwareHash: obj.firmwareHash as string \| undefined,\n attestationRef: obj.attestationRef as string \| undefined,\n pqSig: obj.pqSig as PQSignatureBlock \| undefined,\n });\n }\n}\n\n// ── v1.5 Cloud Relay helper ───────────────────────────────────────────────────\n\n/\n §8.5 — Create a cloud-relay-stamped copy of a message.\n \n Sets senderType to \"cloud_function\" and records the cloud provider.\n /\nexport function makeCloudRelayMessage(\n base: RCANMessage,\n provider: string\n): RCANMessage {\n const data = base.toJSON() as RCANMessageData;\n data.senderType = \"cloud_function\";\n data.cloudProvider = provider;\n return new RCANMessage(data);\n}\n\n// ── v1.5 Delegation Chain helpers ────────────────────────────────────────────\n\n/\n §12 — Add a delegation hop to a message.\n /\nexport function addDelegationHop(\n msg: RCANMessage,\n hop: DelegationHop\n): RCANMessage {\n const chain = msg.delegationChain ? [...msg.delegationChain, hop] : [hop];\n const data = msg.toJSON() as RCANMessageData;\n data.delegationChain = chain;\n return new RCANMessage(data);\n}\n\n/\n §12 — Validate a delegation chain (structure only; signature verification\n * requires crypto module).\n \n Rules:\n * - Max depth 4 hops\n * - Each hop must have issuerRuri, humanSubject, timestamp, scope, signature\n /\nexport function validateDelegationChain(\n chain: DelegationHop[]\n): { valid: boolean; reason: string } {\n if (chain.length > 4) {\n return { valid: false, reason: \"DELEGATION_CHAIN_EXCEEDED: max depth is 4 hops\" };\n }\n for (let i = 0; i < chain.length; i++) {\n const hop = chain[i];\n if (!hop) return { valid: false, reason: `hop ${i} is undefined` };\n if (!hop.issuerRuri) return { valid: false, reason: `hop ${i}: missing issuerRuri` };\n if (!hop.humanSubject) return { valid: false, reason: `hop ${i}: missing humanSubject` };\n if (!hop.timestamp) return { valid: false, reason: `hop ${i}: missing timestamp` };\n if (!hop.scope) return { valid: false, reason: `hop ${i}: missing scope` };\n if (!hop.signature) return { valid: false, reason: `hop ${i}: missing signature` };\n }\n return { valid: true, reason: \"ok\" };\n}\n","import { ml_dsa65 } from \"@noble/post-quantum/ml-dsa.js\";\nimport { ed25519 } from \"@noble/curves/ed25519.js\";\n\n// ── ML-DSA-65 / Ed25519 hybrid PQC types ─────────────────────────────────────\n\n/* An ML-DSA-65 key pair (NIST FIPS 204, 192-bit PQ security). /\nexport interface MlDsaKeyPair {\n /* ML-DSA-65 secret key (4032 bytes). /\n privateKey: Uint8Array;\n /* ML-DSA-65 public key (1952 bytes). /\n publicKey: Uint8Array;\n}\n\n/\n Hybrid Ed25519 + ML-DSA-65 signature.\n * Both algorithms sign the same message; verification requires both to pass.\n /\nexport interface HybridSignature {\n profile: \"pqc-hybrid-v1\";\n /* Ed25519 signature (64 bytes, base-64url decoded). /\n ed25519Sig: Uint8Array;\n /* ML-DSA-65 signature (3309 bytes, base-64url decoded). /\n mlDsaSig: Uint8Array;\n}\n\n// ── base64url helpers ─────────────────────────────────────────────────────────\n\nfunction toB64url(bytes: Uint8Array): string {\n let bin = \"\";\n for (let i = 0; i < bytes.length; i++) bin += String.fromCharCode(bytes[i]!);\n return btoa(bin).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/=/g, \"\");\n}\n\nfunction fromB64url(s: string): Uint8Array {\n const padded = s.replace(/-/g, \"+\").replace(/_/g, \"/\");\n const bin = atob(padded);\n const out = new Uint8Array(bin.length);\n for (let i = 0; i < bin.length; i++) out[i] = bin.charCodeAt(i);\n return out;\n}\n\n// ── ML-DSA-65 primitives ──────────────────────────────────────────────────────\n\n/* Generate a fresh ML-DSA-65 key pair. /\nexport function generateMlDsaKeypair(): MlDsaKeyPair {\n const kp = ml_dsa65.keygen();\n return { privateKey: kp.secretKey, publicKey: kp.publicKey };\n}\n\n/* Sign `message` with an ML-DSA-65 secret key. Returns the raw signature. /\nexport function signMlDsa(privateKey: Uint8Array, message: Uint8Array): Uint8Array {\n return ml_dsa65.sign(message, privateKey);\n}\n\n/\n Verify an ML-DSA-65 signature.\n * @returns `true` if valid, `false` otherwise.\n /\nexport function verifyMlDsa(publicKey: Uint8Array, message: Uint8Array, sig: Uint8Array): boolean {\n return ml_dsa65.verify(sig, message, publicKey);\n}\n\n// ── Hybrid Ed25519 + ML-DSA-65 ────────────────────────────────────────────────\n\n/\n Sign `msg` with both Ed25519 and ML-DSA-65.\n * The caller supplies both private keys; neither is derived from the other.\n /\nexport function signHybrid(\n ed25519Priv: Uint8Array,\n mlDsaPriv: Uint8Array,\n msg: Uint8Array\n): HybridSignature {\n return {\n profile: \"pqc-hybrid-v1\",\n ed25519Sig: ed25519.sign(msg, ed25519Priv),\n mlDsaSig: ml_dsa65.sign(msg, mlDsaPriv),\n };\n}\n\n/\n Verify a hybrid signature. Both Ed25519 and ML-DSA-65 must be valid.\n * @returns `true` only when both signatures pass.\n /\nexport function verifyHybrid(\n ed25519Pub: Uint8Array,\n mlDsaPub: Uint8Array,\n msg: Uint8Array,\n sig: HybridSignature\n): boolean {\n if (sig.profile !== \"pqc-hybrid-v1\") return false;\n return (\n ed25519.verify(sig.ed25519Sig, msg, ed25519Pub) &&\n ml_dsa65.verify(sig.mlDsaSig, msg, mlDsaPub)\n );\n}\n\n// ── Encoding / decoding ───────────────────────────────────────────────────────\n\n/\n Encode a HybridSignature to a compact string.\n * Format: `pqc-hybrid-v1.<ed25519-b64url>.<mldsa-b64url>`\n /\nexport function encodeHybridSig(sig: HybridSignature): string {\n return `pqc-hybrid-v1.${toB64url(sig.ed25519Sig)}.${toB64url(sig.mlDsaSig)}`;\n}\n\n/\n Decode a hybrid signature string produced by `encodeHybridSig`.\n * @throws if the string is not in the expected format.\n /\nexport function decodeHybridSig(s: string): HybridSignature {\n const parts = s.split(\".\");\n if (parts.length !== 3 \|\| parts[0] !== \"pqc-hybrid-v1\") {\n throw new Error(\n `Invalid hybrid signature: expected \"pqc-hybrid-v1.<ed25519b64>.<mldsab64>\", got \"${s.slice(0, 40)}...\"`\n );\n }\n return {\n profile: \"pqc-hybrid-v1\",\n ed25519Sig: fromB64url(parts[1]!),\n mlDsaSig: fromB64url(parts[2]!),\n };\n}\n\n// ── ML-DSA-65 JWK ─────────────────────────────────────────────────────────────\n\n/\n Encode an ML-DSA-65 public key as a JWK-like object.\n * Uses `kty: \"OKP\"`, `alg: \"ML-DSA-65\"`, `x: <base64url>`.\n /\nexport function encodeMlDsaPublicKeyJwk(pub: Uint8Array): object {\n return {\n kty: \"OKP\",\n alg: \"ML-DSA-65\",\n use: \"sig\",\n x: toB64url(pub),\n };\n}\n\n/\n Decode an ML-DSA-65 public key from a JWK-like object.\n * @throws if `kty` or `alg` fields are wrong.\n /\nexport function decodeMlDsaPublicKeyJwk(jwk: object): Uint8Array {\n const j = jwk as Record<string, unknown>;\n if (j[\"kty\"] !== \"OKP\" \|\| j[\"alg\"] !== \"ML-DSA-65\") {\n throw new Error(\n `Invalid ML-DSA-65 JWK: expected kty=\"OKP\" alg=\"ML-DSA-65\", ` +\n `got kty=\"${j[\"kty\"]}\" alg=\"${j[\"alg\"]}\"`\n );\n }\n const x = j[\"x\"];\n if (typeof x !== \"string\" \|\| x.length === 0) {\n throw new Error(\"Invalid ML-DSA-65 JWK: missing or empty x field\");\n }\n return fromB64url(x);\n}\n\n// ── End of PQC exports ────────────────────────────────────────────────────────\n\n/\n Cross-platform crypto utilities — Node.js, browser, Cloudflare Workers, Deno.\n \n Uses Web Crypto API (SubtleCrypto) as the primary implementation, with a\n * Node.js `crypto` module fallback for environments that predate the global\n * `crypto` object (Node < 19).\n /\n\n/* Generate a UUID v4. Works in all modern environments. /\nexport function generateUUID(): string {\n if (typeof globalThis.crypto !== \"undefined\" && typeof globalThis.crypto.randomUUID === \"function\") {\n return globalThis.crypto.randomUUID();\n }\n // Node.js < 19 fallback\n try {\n // eslint-disable-next-line @typescript-eslint/no-var-requires\n const { randomUUID } = require(\"crypto\") as { randomUUID: () => string };\n return randomUUID();\n } catch {\n // Last-resort UUID fallback (no external deps)\n return \"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx\".replace(/[xy]/g, (c) => {\n const r = (Math.random() 16) \| 0;\n const v = c === \"x\" ? r : (r & 0x3) \| 0x8;\n return v.toString(16);\n });\n }\n}\n\n/*\n Compute HMAC-SHA256 and return hex string.\n * Synchronous via Node.js `crypto`; falls back to a pure-JS impl in browsers.\n /\nexport function hmacSha256Sync(secret: string, data: string): string {\n // Node.js environment\n if (typeof process !== \"undefined\" && process.versions?.node) {\n try {\n // eslint-disable-next-line @typescript-eslint/no-var-requires\n const { createHmac } = require(\"crypto\") as {\n createHmac: (alg: string, key: string) => { update: (d: string) => { digest: (enc: string) => string } };\n };\n return createHmac(\"sha256\", secret).update(data).digest(\"hex\");\n } catch {\n // fall through to pure-JS\n }\n }\n // Pure-JS HMAC-SHA256 (browser / Workers / Deno without native crypto)\n return pureHmacSha256(secret, data);\n}\n\n// ── Pure-JS SHA-256 + HMAC (no deps) ─────────────────────────────────────────\n// Based on the public-domain SHA-256 implementation.\n\nfunction sha256(msg: Uint8Array): Uint8Array {\n const K = [\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n ];\n let h0 = 0x6a09e667, h1 = 0xbb67ae85, h2 = 0x3c6ef372, h3 = 0xa54ff53a;\n let h4 = 0x510e527f, h5 = 0x9b05688c, h6 = 0x1f83d9ab, h7 = 0x5be0cd19;\n\n const msgLen = msg.length;\n const bitLen = msgLen 8;\n const padded: number[] = [...msg];\n padded.push(0x80);\n while ((padded.length % 64) !== 56) padded.push(0);\n for (let i = 7; i >= 0; i--) padded.push((bitLen / Math.pow(2, i * 8)) & 0xff);\n\n for (let i = 0; i < padded.length; i += 64) {\n const w: number[] = [];\n for (let j = 0; j < 16; j++) {\n w[j] = (padded[i+j4]<<24)\|(padded[i+j4+1]<<16)\|(padded[i+j4+2]<<8)\|padded[i+j4+3];\n }\n for (let j = 16; j < 64; j++) {\n const s0 = ror(w[j-15],7)^ror(w[j-15],18)^(w[j-15]>>>3);\n const s1 = ror(w[j-2],17)^ror(w[j-2],19)^(w[j-2]>>>10);\n w[j] = (w[j-16]+s0+w[j-7]+s1) >>> 0;\n }\n let [a,b,c,d,e,f,g,h] = [h0,h1,h2,h3,h4,h5,h6,h7];\n for (let j = 0; j < 64; j++) {\n const S1 = ror(e,6)^ror(e,11)^ror(e,25);\n const ch = (e&f)^(~e&g);\n const temp1 = (h+S1+ch+K[j]+w[j])>>>0;\n const S0 = ror(a,2)^ror(a,13)^ror(a,22);\n const maj = (a&b)^(a&c)^(b&c);\n const temp2 = (S0+maj)>>>0;\n [h,g,f,e,d,c,b,a] = [g,f,e,(d+temp1)>>>0,c,b,a,(temp1+temp2)>>>0];\n }\n h0=(h0+a)>>>0; h1=(h1+b)>>>0; h2=(h2+c)>>>0; h3=(h3+d)>>>0;\n h4=(h4+e)>>>0; h5=(h5+f)>>>0; h6=(h6+g)>>>0; h7=(h7+h)>>>0;\n }\n const out = new Uint8Array(32);\n const view = new DataView(out.buffer);\n [h0,h1,h2,h3,h4,h5,h6,h7].forEach((v,i) => view.setUint32(i4, v));\n return out;\n}\n\nfunction ror(x: number, n: number): number { return (x>>>n)\|(x<<(32-n)); }\n\nfunction toBytes(s: string): Uint8Array {\n if (typeof TextEncoder !== \"undefined\") return new TextEncoder().encode(s);\n const out = new Uint8Array(s.length);\n for (let i = 0; i < s.length; i++) out[i] = s.charCodeAt(i) & 0xff;\n return out;\n}\n\nfunction toHex(bytes: Uint8Array): string {\n return Array.from(bytes).map(b => b.toString(16).padStart(2,\"0\")).join(\"\");\n}\n\nfunction pureHmacSha256(key: string, data: string): string {\n const BLOCK = 64;\n let keyBytes = toBytes(key);\n if (keyBytes.length > BLOCK) keyBytes = sha256(keyBytes);\n const ipad = new Uint8Array(BLOCK), opad = new Uint8Array(BLOCK);\n for (let i = 0; i < BLOCK; i++) {\n ipad[i] = (keyBytes[i] ?? 0) ^ 0x36;\n opad[i] = (keyBytes[i] ?? 0) ^ 0x5c;\n }\n const dataBytes = toBytes(data);\n const inner = new Uint8Array(BLOCK + dataBytes.length);\n inner.set(ipad); inner.set(dataBytes, BLOCK);\n const innerHash = sha256(inner);\n const outer = new Uint8Array(BLOCK + 32);\n outer.set(opad); outer.set(innerHash, BLOCK);\n return toHex(sha256(outer));\n}\n","/\n Utilities for hex, bytes, CSPRNG.\n * @module\n /\n/! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) /\n/* Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. /\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array \|\| (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/* Asserts something is positive integer. /\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) \|\| n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/* Asserts something is Uint8Array. /\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\n const bytes = isBytes(value);\n const len = value?.length;\n const needsLen = length !== undefined;\n if (!bytes \|\| (needsLen && len !== length)) {\n const prefix = title && `\"${title}\" `;\n const ofLen = needsLen ? ` of length ${length}` : '';\n const got = bytes ? `length=${len}` : `type=${typeof value}`;\n throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n }\n return value;\n}\n\n/* Asserts something is hash /\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' \|\| typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/* Asserts a hash instance has not been destroyed / finished /\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/* Asserts output is properly-sized byte array /\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/* Generic type encompassing 8/16/32-byte arrays - but not 64-byte. /\n// prettier-ignore\nexport type TypedArray = Int8Array \| Uint8ClampedArray \| Uint8Array \|\n Uint16Array \| Int16Array \| Uint32Array \| Int32Array;\n\n/* Cast u8 / u16 / u32 to u8. /\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/* Cast u8 / u16 / u32 to u32. /\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/* Zeroize a byte array. Warning: JS provides no guarantees. /\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/* Create DataView of an array for easy byte-level manipulation. /\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/* The rotate right (circular right shift) operation for uint32 /\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) \| (word >>> shift);\n}\n\n/* The rotate left (circular left shift) operation for uint32 /\nexport function rotl(word: number, shift: number): number {\n return (word << shift) \| ((word >>> (32 - shift)) >>> 0);\n}\n\n/* Is current platform little-endian? Most are. Big-Endian platform: IBM /\nexport const isLE: boolean = / @__PURE__ / (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/* The byte swap operation for uint32 /\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) \|\n ((word << 8) & 0xff0000) \|\n ((word >>> 8) & 0xff00) \|\n ((word >>> 24) & 0xff)\n );\n}\n/* Conditionally byte swap if on a big-endian platform /\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/* In place byte swap for Uint32Array /\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = / @__PURE__ / (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = / @__PURE__ / Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\n/\n Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n /\nexport function bytesToHex(bytes: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) return bytes.toHex();\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 } as const;\nfunction asciiToBase16(ch: number): number \| undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n\n/\n Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n /\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined \|\| n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 16 + n2; // multiply first octet, e.g. 'a3' => 1016+3 => 160 + 3 => 163\n }\n return array;\n}\n\n/\n There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n /\nexport const nextTick = async (): Promise<void> => {};\n\n/* Returns control to thread each 'tick' ms to avoid blocking. /\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/\n Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n /\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/* KDFs can accept string or Uint8Array for user convenience. /\nexport type KDFInput = string \| Uint8Array;\n\n/\n Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n /\nexport function kdfInputToBytes(data: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/* Copies several Uint8Arrays into one. /\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\ntype EmptyObj = {};\n/* Merges default options and passed options. /\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/* Common interface for all hashes. /\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/* PseudoRandom (number) Generator /\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/\n XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n /\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/* Hash constructor /\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/* Optional hash params. /\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/* Hash function /\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/* XOF with output /\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/* Creates function with outputLen, blockLen, create properties from a class constructor. /\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/* Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. /\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/* Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. /\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n","/\n Internal Merkle-Damgard hash utils.\n * @module\n /\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/* Choice: a ? b : c /\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/* Majority function, true if any two inputs is true. /\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/\n Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n /\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data: Uint8Array): this {\n aexists(this);\n abytes(data);\n const { view, buffer, blockLen } = this;\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n aoutput(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n clean(this.buffer.subarray(pos));\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (10246)) for this to happen.\n // So we just write lowest 64 bits of that value.\n view.setBigUint64(blockLen - 8, BigInt(this.length 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to?: T): T {\n to \|\|= new (this.constructor as any)() as T;\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.destroyed = destroyed;\n to.finished = finished;\n to.length = length;\n to.pos = pos;\n if (length % blockLen) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\n}\n\n/*\n Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n /\n\n/* Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 /\nexport const SHA256_IV: Uint32Array = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/* Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 /\nexport const SHA224_IV: Uint32Array = / @__PURE__ / Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/* Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 /\nexport const SHA384_IV: Uint32Array = / @__PURE__ / Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/* Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 /\nexport const SHA512_IV: Uint32Array = / @__PURE__ / Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n","/\n Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n /\nconst U32_MASK64 = / @__PURE__ / BigInt(2 * 32 - 1);\nconst _32n = /* @__PURE__ / BigInt(32);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) \| 0, l: Number(n & U32_MASK64) \| 0 };\n}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) \| BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) \| (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) \| (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) \| (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) \| (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) \| (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) \| (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) \| (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) \| (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 * 32) \| 0)) \| 0, l: l \| 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 32) \| 0)) \| 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 32) \| 0)) \| 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 32) \| 0)) \| 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","/\n * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://www.rfc-editor.org/rfc/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n /\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from './_md.ts';\nimport as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\n/*\n Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n /\n// prettier-ignore\nconst SHA256_K = / @__PURE__ / Uint32Array.from([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n/* Reusable temporary buffer. \"W\" comes straight from spec. /\nconst SHA256_W = / @__PURE__ / new Uint32Array(64);\n\n/* Internal 32-byte base SHA2 hash class. /\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\n this.A = A \| 0;\n this.B = B \| 0;\n this.C = C \| 0;\n this.D = D \| 0;\n this.E = E \| 0;\n this.F = F \| 0;\n this.G = G \| 0;\n this.H = H \| 0;\n }\n protected process(view: DataView, offset: number): void {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) \| 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) \| 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) \| 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) \| 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) \| 0;\n B = (B + this.B) \| 0;\n C = (C + this.C) \| 0;\n D = (D + this.D) \| 0;\n E = (E + this.E) \| 0;\n F = (F + this.F) \| 0;\n G = (G + this.G) \| 0;\n H = (H + this.H) \| 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/* Internal SHA2-256 hash class. /\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] \| 0;\n protected B: number = SHA256_IV[1] \| 0;\n protected C: number = SHA256_IV[2] \| 0;\n protected D: number = SHA256_IV[3] \| 0;\n protected E: number = SHA256_IV[4] \| 0;\n protected F: number = SHA256_IV[5] \| 0;\n protected G: number = SHA256_IV[6] \| 0;\n protected H: number = SHA256_IV[7] \| 0;\n constructor() {\n super(32);\n }\n}\n\n/* Internal SHA2-224 hash class. /\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] \| 0;\n protected B: number = SHA224_IV[1] \| 0;\n protected C: number = SHA224_IV[2] \| 0;\n protected D: number = SHA224_IV[3] \| 0;\n protected E: number = SHA224_IV[4] \| 0;\n protected F: number = SHA224_IV[5] \| 0;\n protected G: number = SHA224_IV[6] \| 0;\n protected H: number = SHA224_IV[7] \| 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = / @__PURE__ / (() => u64.split([\n '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = / @__PURE__ / (() => K512[0])();\nconst SHA512_Kl = / @__PURE__ / (() => K512[1])();\n\n// Reusable temporary buffers\nconst SHA512_W_H = / @__PURE__ / new Uint32Array(80);\nconst SHA512_W_L = / @__PURE__ / new Uint32Array(80);\n\n/* Internal 64-byte base SHA2 hash class. /\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n // h -- high 32 bits, l -- low 32 bits\n protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\n const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n }\n // prettier-ignore\n protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\n this.Ah = Ah \| 0;\n this.Al = Al \| 0;\n this.Bh = Bh \| 0;\n this.Bl = Bl \| 0;\n this.Ch = Ch \| 0;\n this.Cl = Cl \| 0;\n this.Dh = Dh \| 0;\n this.Dl = Dl \| 0;\n this.Eh = Eh \| 0;\n this.El = El \| 0;\n this.Fh = Fh \| 0;\n this.Fl = Fl \| 0;\n this.Gh = Gh \| 0;\n this.Gl = Gl \| 0;\n this.Hh = Hh \| 0;\n this.Hl = Hl \| 0;\n }\n protected process(view: DataView, offset: number): void {\n // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) {\n SHA512_W_H[i] = view.getUint32(offset);\n SHA512_W_L[i] = view.getUint32((offset += 4));\n }\n for (let i = 16; i < 80; i++) {\n // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n const W15h = SHA512_W_H[i - 15] \| 0;\n const W15l = SHA512_W_L[i - 15] \| 0;\n const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n const W2h = SHA512_W_H[i - 2] \| 0;\n const W2l = SHA512_W_L[i - 2] \| 0;\n const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n SHA512_W_H[i] = SUMh \| 0;\n SHA512_W_L[i] = SUMl \| 0;\n }\n let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n // Compression function main loop, 80 rounds\n for (let i = 0; i < 80; i++) {\n // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) \| 0;\n const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n const CHIl = (El & Fl) ^ (~El & Gl);\n // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n // prettier-ignore\n const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n const T1l = T1ll \| 0;\n // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n Hh = Gh \| 0;\n Hl = Gl \| 0;\n Gh = Fh \| 0;\n Gl = Fl \| 0;\n Fh = Eh \| 0;\n Fl = El \| 0;\n ({ h: Eh, l: El } = u64.add(Dh \| 0, Dl \| 0, T1h \| 0, T1l \| 0));\n Dh = Ch \| 0;\n Dl = Cl \| 0;\n Ch = Bh \| 0;\n Cl = Bl \| 0;\n Bh = Ah \| 0;\n Bl = Al \| 0;\n const All = u64.add3L(T1l, sigma0l, MAJl);\n Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n Al = All \| 0;\n }\n // Add the compressed chunk to the current hash value\n ({ h: Ah, l: Al } = u64.add(this.Ah \| 0, this.Al \| 0, Ah \| 0, Al \| 0));\n ({ h: Bh, l: Bl } = u64.add(this.Bh \| 0, this.Bl \| 0, Bh \| 0, Bl \| 0));\n ({ h: Ch, l: Cl } = u64.add(this.Ch \| 0, this.Cl \| 0, Ch \| 0, Cl \| 0));\n ({ h: Dh, l: Dl } = u64.add(this.Dh \| 0, this.Dl \| 0, Dh \| 0, Dl \| 0));\n ({ h: Eh, l: El } = u64.add(this.Eh \| 0, this.El \| 0, Eh \| 0, El \| 0));\n ({ h: Fh, l: Fl } = u64.add(this.Fh \| 0, this.Fl \| 0, Fh \| 0, Fl \| 0));\n ({ h: Gh, l: Gl } = u64.add(this.Gh \| 0, this.Gl \| 0, Gh \| 0, Gl \| 0));\n ({ h: Hh, l: Hl } = u64.add(this.Hh \| 0, this.Hl \| 0, Hh \| 0, Hl \| 0));\n this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n }\n protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n }\n}\n\n/* Internal SHA2-512 hash class. /\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] \| 0;\n protected Al: number = SHA512_IV[1] \| 0;\n protected Bh: number = SHA512_IV[2] \| 0;\n protected Bl: number = SHA512_IV[3] \| 0;\n protected Ch: number = SHA512_IV[4] \| 0;\n protected Cl: number = SHA512_IV[5] \| 0;\n protected Dh: number = SHA512_IV[6] \| 0;\n protected Dl: number = SHA512_IV[7] \| 0;\n protected Eh: number = SHA512_IV[8] \| 0;\n protected El: number = SHA512_IV[9] \| 0;\n protected Fh: number = SHA512_IV[10] \| 0;\n protected Fl: number = SHA512_IV[11] \| 0;\n protected Gh: number = SHA512_IV[12] \| 0;\n protected Gl: number = SHA512_IV[13] \| 0;\n protected Hh: number = SHA512_IV[14] \| 0;\n protected Hl: number = SHA512_IV[15] \| 0;\n\n constructor() {\n super(64);\n }\n}\n\n/* Internal SHA2-384 hash class. /\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] \| 0;\n protected Al: number = SHA384_IV[1] \| 0;\n protected Bh: number = SHA384_IV[2] \| 0;\n protected Bl: number = SHA384_IV[3] \| 0;\n protected Ch: number = SHA384_IV[4] \| 0;\n protected Cl: number = SHA384_IV[5] \| 0;\n protected Dh: number = SHA384_IV[6] \| 0;\n protected Dl: number = SHA384_IV[7] \| 0;\n protected Eh: number = SHA384_IV[8] \| 0;\n protected El: number = SHA384_IV[9] \| 0;\n protected Fh: number = SHA384_IV[10] \| 0;\n protected Fl: number = SHA384_IV[11] \| 0;\n protected Gh: number = SHA384_IV[12] \| 0;\n protected Gl: number = SHA384_IV[13] \| 0;\n protected Hh: number = SHA384_IV[14] \| 0;\n protected Hl: number = SHA384_IV[15] \| 0;\n\n constructor() {\n super(48);\n }\n}\n\n/\n Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n /\n\n/* SHA512/224 IV /\nconst T224_IV = / @__PURE__ / Uint32Array.from([\n 0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n 0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n\n/* SHA512/256 IV /\nconst T256_IV = / @__PURE__ / Uint32Array.from([\n 0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n 0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n\n/* Internal SHA2-512/224 hash class. /\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] \| 0;\n protected Al: number = T224_IV[1] \| 0;\n protected Bh: number = T224_IV[2] \| 0;\n protected Bl: number = T224_IV[3] \| 0;\n protected Ch: number = T224_IV[4] \| 0;\n protected Cl: number = T224_IV[5] \| 0;\n protected Dh: number = T224_IV[6] \| 0;\n protected Dl: number = T224_IV[7] \| 0;\n protected Eh: number = T224_IV[8] \| 0;\n protected El: number = T224_IV[9] \| 0;\n protected Fh: number = T224_IV[10] \| 0;\n protected Fl: number = T224_IV[11] \| 0;\n protected Gh: number = T224_IV[12] \| 0;\n protected Gl: number = T224_IV[13] \| 0;\n protected Hh: number = T224_IV[14] \| 0;\n protected Hl: number = T224_IV[15] \| 0;\n\n constructor() {\n super(28);\n }\n}\n\n/* Internal SHA2-512/256 hash class. /\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] \| 0;\n protected Al: number = T256_IV[1] \| 0;\n protected Bh: number = T256_IV[2] \| 0;\n protected Bl: number = T256_IV[3] \| 0;\n protected Ch: number = T256_IV[4] \| 0;\n protected Cl: number = T256_IV[5] \| 0;\n protected Dh: number = T256_IV[6] \| 0;\n protected Dl: number = T256_IV[7] \| 0;\n protected Eh: number = T256_IV[8] \| 0;\n protected El: number = T256_IV[9] \| 0;\n protected Fh: number = T256_IV[10] \| 0;\n protected Fl: number = T256_IV[11] \| 0;\n protected Gh: number = T256_IV[12] \| 0;\n protected Gl: number = T256_IV[13] \| 0;\n protected Hh: number = T256_IV[14] \| 0;\n protected Hl: number = T256_IV[15] \| 0;\n\n constructor() {\n super(32);\n }\n}\n\n/\n SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n \n - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n /\nexport const sha256: CHash<_SHA256> = / @__PURE__ / createHasher(\n () => new _SHA256(),\n / @__PURE__ / oidNist(0x01)\n);\n/* SHA2-224 hash function from RFC 4634 /\nexport const sha224: CHash<_SHA224> = / @__PURE__ / createHasher(\n () => new _SHA224(),\n / @__PURE__ / oidNist(0x04)\n);\n\n/* SHA2-512 hash function from RFC 4634. /\nexport const sha512: CHash<_SHA512> = / @__PURE__ / createHasher(\n () => new _SHA512(),\n / @__PURE__ / oidNist(0x03)\n);\n/* SHA2-384 hash function from RFC 4634. /\nexport const sha384: CHash<_SHA384> = / @__PURE__ / createHasher(\n () => new _SHA384(),\n / @__PURE__ / oidNist(0x02)\n);\n\n/\n SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_256: CHash<_SHA512_256> = / @__PURE__ / createHasher(\n () => new _SHA512_256(),\n / @__PURE__ / oidNist(0x06)\n);\n/\n SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n /\nexport const sha512_224: CHash<_SHA512_224> = / @__PURE__ / createHasher(\n () => new _SHA512_224(),\n / @__PURE__ / oidNist(0x05)\n);\n","/\n Hex, bytes and number utilities.\n * @module\n /\n/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nimport {\n abytes as abytes_,\n anumber,\n bytesToHex as bytesToHex_,\n concatBytes as concatBytes_,\n hexToBytes as hexToBytes_,\n} from '@noble/hashes/utils.js';\nexport {\n abytes,\n anumber,\n bytesToHex,\n concatBytes,\n hexToBytes,\n isBytes,\n randomBytes,\n} from '@noble/hashes/utils.js';\nconst _0n = / @__PURE__ / BigInt(0);\nconst _1n = / @__PURE__ / BigInt(1);\n\nexport type CHash = {\n (message: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array) => Uint8Array;\nexport function abool(value: boolean, title: string = ''): boolean {\n if (typeof value !== 'boolean') {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected boolean, got type=' + typeof value);\n }\n return value;\n}\n\n// Used in weierstrass, der\nfunction abignumber(n: number \| bigint) {\n if (typeof n === 'bigint') {\n if (!isPosBig(n)) throw new Error('positive bigint expected, got ' + n);\n } else anumber(n);\n return n;\n}\n\nexport function asafenumber(value: number, title: string = ''): void {\n if (!Number.isSafeInteger(value)) {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected safe integer, got type=' + typeof value);\n }\n}\n\nexport function numberToHexUnpadded(num: number \| bigint): string {\n const hex = abignumber(num).toString(16);\n return hex.length & 1 ? '0' + hex : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\n\nexport function numberToBytesBE(n: number \| bigint, len: number): Uint8Array {\n anumber(len);\n n = abignumber(n);\n const res = hexToBytes_(n.toString(16).padStart(len 2, '0'));\n if (res.length !== len) throw new Error('number too large');\n return res;\n}\nexport function numberToBytesLE(n: number \| bigint, len: number): Uint8Array {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number \| bigint): Uint8Array {\n return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff \|= a[i] ^ b[i];\n return diff === 0;\n}\n\n/*\n Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n /\nexport function copyBytes(bytes: Uint8Array): Uint8Array {\n return Uint8Array.from(bytes);\n}\n\n/\n Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as `TextEncoder` for ASCII or throws.\n /\nexport function asciiToBytes(ascii: string): Uint8Array {\n return Uint8Array.from(ascii, (c, i) => {\n const charCode = c.charCodeAt(0);\n if (c.length !== 1 \|\| charCode > 127) {\n throw new Error(\n `string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`\n );\n }\n return charCode;\n });\n}\n\n// Is positive bigint\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\nexport function inRange(n: bigint, min: bigint, max: bigint): boolean {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n\n/\n Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n /\nexport function aInRange(title: string, n: bigint, min: bigint, max: bigint): void {\n // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n // consider P=256n, min=0n, max=P\n // - a for min=0 would require -1: `inRange('x', x, -1n, P)`\n // - b would commonly require subtraction: `inRange('x', x, 0n, P - 1n)`\n // - our way is the cleanest: `inRange('x', x, 0n, P)\n if (!inRange(n, min, max))\n throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n\n// Bit operations\n\n/\n Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n /\nexport function bitLen(n: bigint): number {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1);\n return len;\n}\n\n/\n Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n /\nexport function bitGet(n: bigint, pos: number): bigint {\n return (n >> BigInt(pos)) & _1n;\n}\n\n/\n Sets single bit at position.\n /\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n return n \| ((value ? _1n : _0n) << BigInt(pos));\n}\n\n/\n Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n /\nexport const bitMask = (n: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\ntype Pred<T> = (v: Uint8Array) => T \| undefined;\n/\n Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG<Key>(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n /\nexport function createHmacDrbg<T>(\n hashLen: number,\n qByteLen: number,\n hmacFn: (key: Uint8Array, message: Uint8Array) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n anumber(hashLen, 'hashLen');\n anumber(qByteLen, 'qByteLen');\n if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n const u8n = (len: number): Uint8Array => new Uint8Array(len); // creates Uint8Array\n const NULL = Uint8Array.of();\n const byte0 = Uint8Array.of(0x00);\n const byte1 = Uint8Array.of(0x01);\n const _maxDrbgIters = 1000;\n\n // Step B, Step C: set hashLen to 8ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...msgs: Uint8Array[]) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)\n const reseed = (seed: Uint8Array = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(byte0, seed); // k = hmac(k \|\| v \|\| 0x00 \|\| seed)\n v = h(); // v = hmac(k \|\| v)\n if (seed.length === 0) return;\n k = h(byte1, seed); // k = hmac(k \|\| v \|\| 0x01 \|\| seed)\n v = h(); // v = hmac(k \|\| v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= _maxDrbgIters) throw new Error('drbg: tried max amount of iterations');\n let len = 0;\n const out: Uint8Array[] = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes_(...out);\n };\n const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {\n reset();\n reseed(seed); // Steps D-G\n let res: T \| undefined = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen()))) reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n\nexport function validateObject(\n object: Record<string, any>,\n fields: Record<string, string> = {},\n optFields: Record<string, string> = {}\n): void {\n if (!object \|\| typeof object !== 'object') throw new Error('expected valid options object');\n type Item = keyof typeof object;\n function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {\n const val = object[fieldName];\n if (isOpt && val === undefined) return;\n const current = typeof val;\n if (current !== expectedType \|\| val === null)\n throw new Error(`param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`);\n }\n const iter = (f: typeof fields, isOpt: boolean) =>\n Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n iter(fields, false);\n iter(optFields, true);\n}\n\n/*\n throws not implemented error\n /\nexport const notImplemented = (): never => {\n throw new Error('not implemented');\n};\n\n/\n Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n /\nexport function memoized<T extends object, R, O extends any[]>(\n fn: (arg: T, ...args: O) => R\n): (arg: T, ...args: O) => R {\n const map = new WeakMap<T, R>();\n return (arg: T, ...args: O): R => {\n const val = map.get(arg);\n if (val !== undefined) return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n\nexport interface CryptoKeys {\n lengths: { seed?: number; public?: number; secret?: number };\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array) => Uint8Array;\n}\n\n/* Generic interface for signatures. Has keygen, sign and verify. /\nexport interface Signer extends CryptoKeys {\n // Interfaces are fun. We cannot just add new fields without copying old ones.\n lengths: {\n seed?: number;\n public?: number;\n secret?: number;\n signRand?: number;\n signature?: number;\n };\n sign: (msg: Uint8Array, secretKey: Uint8Array) => Uint8Array;\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array) => boolean;\n}\n","/\n Utils for modular division and fields.\n * Field over 11 is a finite (Galois) field is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n /\n/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nimport {\n abytes,\n anumber,\n bytesToNumberBE,\n bytesToNumberLE,\n numberToBytesBE,\n numberToBytesLE,\n validateObject,\n} from '../utils.ts';\n\n// Numbers aren't used in x25519 / x448 builds\n// prettier-ignore\nconst _0n = / @__PURE__ / BigInt(0), _1n = / @__PURE__ / BigInt(1), _2n = / @__PURE__ / BigInt(2);\n// prettier-ignore\nconst _3n = / @__PURE__ / BigInt(3), _4n = / @__PURE__ / BigInt(4), _5n = / @__PURE__ / BigInt(5);\n// prettier-ignore\nconst _7n = / @__PURE__ / BigInt(7), _8n = / @__PURE__ / BigInt(8), _9n = / @__PURE__ / BigInt(9);\nconst _16n = / @__PURE__ / BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\n/\n Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n /\nexport function pow(num: bigint, power: bigint, modulo: bigint): bigint {\n return FpPow(Field(modulo), num, power);\n}\n\n/* Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` /\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n let res = x;\n while (power-- > _0n) {\n res = res;\n res %= modulo;\n }\n return res;\n}\n\n/*\n Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n /\nexport function invert(number: bigint, modulo: bigint): bigint {\n if (number === _0n) throw new Error('invert: expected non-zero number');\n if (modulo <= _0n) throw new Error('invert: expected positive modulus, got ' + modulo);\n // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n let a = mod(number, modulo);\n let b = modulo;\n // prettier-ignore\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n // JIT applies optimization if those two lines follow each other\n const q = b / a;\n const r = b % a;\n const m = x - u q;\n const n = y - v * q;\n // prettier-ignore\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n) throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n\nfunction assertIsSquare<T>(Fp: IField<T>, root: T, n: T): void {\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n}\n\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4<T>(Fp: IField<T>, n: T) {\n const p1div4 = (Fp.ORDER + _1n) / _4n;\n const root = Fp.pow(n, p1div4);\n assertIsSquare(Fp, root, n);\n return root;\n}\n\nfunction sqrt5mod8<T>(Fp: IField<T>, n: T) {\n const p5div8 = (Fp.ORDER - _5n) / _8n;\n const n2 = Fp.mul(n, _2n);\n const v = Fp.pow(n2, p5div8);\n const nv = Fp.mul(n, v);\n const i = Fp.mul(Fp.mul(nv, _2n), v);\n const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n assertIsSquare(Fp, root, n);\n return root;\n}\n\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P: bigint): <T>(Fp: IField<T>, n: T) => T {\n const Fp_ = Field(P);\n const tn = tonelliShanks(P);\n const c1 = tn(Fp_, Fp_.neg(Fp_.ONE));// 1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n const c2 = tn(Fp_, c1); // 2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n const c3 = tn(Fp_, Fp_.neg(c1)); // 3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n const c4 = (P + _7n) / _16n; // 4. c4 = (q + 7) / 16 # Integer arithmetic\n return <T>(Fp: IField<T>, n: T) => {\n let tv1 = Fp.pow(n, c4); // 1. tv1 = x^c4\n let tv2 = Fp.mul(tv1, c1); // 2. tv2 = c1 * tv1\n const tv3 = Fp.mul(tv1, c2); // 3. tv3 = c2 * tv1\n const tv4 = Fp.mul(tv1, c3); // 4. tv4 = c3 * tv1\n const e1 = Fp.eql(Fp.sqr(tv2), n); // 5. e1 = (tv2^2) == x\n const e2 = Fp.eql(Fp.sqr(tv3), n); // 6. e2 = (tv3^2) == x\n tv1 = Fp.cmov(tv1, tv2, e1); // 7. tv1 = CMOV(tv1, tv2, e1) # Select tv2 if (tv2^2) == x\n tv2 = Fp.cmov(tv4, tv3, e2); // 8. tv2 = CMOV(tv4, tv3, e2) # Select tv3 if (tv3^2) == x\n const e3 = Fp.eql(Fp.sqr(tv2), n); // 9. e3 = (tv2^2) == x\n const root = Fp.cmov(tv1, tv2, e3);// 10. z = CMOV(tv1, tv2, e3) # Select sqrt from tv1 & tv2\n assertIsSquare(Fp, root, n);\n return root;\n };\n}\n\n/*\n Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n /\nexport function tonelliShanks(P: bigint): <T>(Fp: IField<T>, n: T) => T {\n // Initialization (precomputation).\n // Caching initialization could boost perf by 7%.\n if (P < _3n) throw new Error('sqrt is not defined for small field');\n // Factor P - 1 = Q 2^S, where Q is odd\n let Q = P - _1n;\n let S = 0;\n while (Q % _2n === _0n) {\n Q /= _2n;\n S++;\n }\n\n // Find the first quadratic non-residue Z >= 2\n let Z = _2n;\n const _Fp = Field(P);\n while (FpLegendre(_Fp, Z) === 1) {\n // Basic primality test for P. After x iterations, chance of\n // not finding quadratic non-residue is 2^x, so 2^1000.\n if (Z++ > 1000) throw new Error('Cannot find square root: probably non-prime P');\n }\n // Fast-path; usually done before Z, but we do \"primality test\".\n if (S === 1) return sqrt3mod4;\n\n // Slow-path\n // TODO: test on Fp2 and others\n let cc = _Fp.pow(Z, Q); // c = z^Q\n const Q1div2 = (Q + _1n) / _2n;\n return function tonelliSlow<T>(Fp: IField<T>, n: T): T {\n if (Fp.is0(n)) return n;\n // Check if n is a quadratic residue using Legendre symbol\n if (FpLegendre(Fp, n) !== 1) throw new Error('Cannot find square root');\n\n // Initialize variables for the main loop\n let M = S;\n let c = Fp.mul(Fp.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp\n let t = Fp.pow(n, Q); // t = n^Q, first guess at the fudge factor\n let R = Fp.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root\n\n // Main loop\n // while t != 1\n while (!Fp.eql(t, Fp.ONE)) {\n if (Fp.is0(t)) return Fp.ZERO; // if t=0 return R=0\n let i = 1;\n\n // Find the smallest i >= 1 such that t^(2^i) ≡ 1 (mod P)\n let t_tmp = Fp.sqr(t); // t^(2^1)\n while (!Fp.eql(t_tmp, Fp.ONE)) {\n i++;\n t_tmp = Fp.sqr(t_tmp); // t^(2^2)...\n if (i === M) throw new Error('Cannot find square root');\n }\n\n // Calculate the exponent for b: 2^(M - i - 1)\n const exponent = _1n << BigInt(M - i - 1); // bigint is important\n const b = Fp.pow(c, exponent); // b = 2^(M - i - 1)\n\n // Update variables\n M = i;\n c = Fp.sqr(b); // c = b^2\n t = Fp.mul(t, c); // t = (t * b^2)\n R = Fp.mul(R, b); // R = Rb\n }\n return R;\n };\n}\n\n/\n Square root for a finite field. Will try optimized versions first:\n \n 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n \n Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n /\nexport function FpSqrt(P: bigint): <T>(Fp: IField<T>, n: T) => T {\n // P ≡ 3 (mod 4) => √n = n^((P+1)/4)\n if (P % _4n === _3n) return sqrt3mod4;\n // P ≡ 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n if (P % _8n === _5n) return sqrt5mod8;\n // P ≡ 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n if (P % _16n === _9n) return sqrt9mod16(P);\n // Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint): boolean =>\n (mod(num, modulo) & _1n) === _1n;\n\n/* Field is not always over prime: for example, Fp2 has ORDER(q)=p^m. /\nexport interface IField<T> {\n ORDER: bigint;\n BYTES: number;\n BITS: number;\n isLE: boolean;\n ZERO: T;\n ONE: T;\n // 1-arg\n create: (num: T) => T;\n isValid: (num: T) => boolean;\n is0: (num: T) => boolean;\n isValidNot0: (num: T) => boolean;\n neg(num: T): T;\n inv(num: T): T;\n sqrt(num: T): T;\n sqr(num: T): T;\n // 2-args\n eql(lhs: T, rhs: T): boolean;\n add(lhs: T, rhs: T): T;\n sub(lhs: T, rhs: T): T;\n mul(lhs: T, rhs: T \| bigint): T;\n pow(lhs: T, power: bigint): T;\n div(lhs: T, rhs: T \| bigint): T;\n // N for NonNormalized (for now)\n addN(lhs: T, rhs: T): T;\n subN(lhs: T, rhs: T): T;\n mulN(lhs: T, rhs: T \| bigint): T;\n sqrN(num: T): T;\n\n // Optional\n // Should be same as sgn0 function in\n // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n // legendre?(num: T): T;\n invertBatch: (lst: T[]) => T[];\n toBytes(num: T): Uint8Array;\n fromBytes(bytes: Uint8Array, skipValidation?: boolean): T;\n // If c is False, CMOV returns a, otherwise it returns b.\n cmov(a: T, b: T, c: boolean): T;\n}\n// prettier-ignore\nconst FIELD_FIELDS = [\n 'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n 'eql', 'add', 'sub', 'mul', 'pow', 'div',\n 'addN', 'subN', 'mulN', 'sqrN'\n] as const;\nexport function validateField<T>(field: IField<T>): IField<T> {\n const initial = {\n ORDER: 'bigint',\n BYTES: 'number',\n BITS: 'number',\n } as Record<string, string>;\n const opts = FIELD_FIELDS.reduce((map, val: string) => {\n map[val] = 'function';\n return map;\n }, initial);\n validateObject(field, opts);\n // const max = 16384;\n // if (field.BYTES < 1 \|\| field.BYTES > max) throw new Error('invalid field');\n // if (field.BITS < 1 \|\| field.BITS > 8 max) throw new Error('invalid field');\n return field;\n}\n\n// Generic field functions\n\n/*\n Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n /\nexport function FpPow<T>(Fp: IField<T>, num: T, power: bigint): T {\n if (power < _0n) throw new Error('invalid exponent, negatives unsupported');\n if (power === _0n) return Fp.ONE;\n if (power === _1n) return num;\n let p = Fp.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n) p = Fp.mul(p, d);\n d = Fp.sqr(d);\n power >>= _1n;\n }\n return p;\n}\n\n/\n Efficiently invert an array of Field elements.\n * Exception-free. Will return `undefined` for 0 elements.\n * @param passZero map 0 to 0 (instead of undefined)\n /\nexport function FpInvertBatch<T>(Fp: IField<T>, nums: T[], passZero = false): T[] {\n const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : undefined);\n // Walk from first to last, multiply them by each other MOD p\n const multipliedAcc = nums.reduce((acc, num, i) => {\n if (Fp.is0(num)) return acc;\n inverted[i] = acc;\n return Fp.mul(acc, num);\n }, Fp.ONE);\n // Invert last element\n const invertedAcc = Fp.inv(multipliedAcc);\n // Walk from last to first, multiply them by inverted each other MOD p\n nums.reduceRight((acc, num, i) => {\n if (Fp.is0(num)) return acc;\n inverted[i] = Fp.mul(acc, inverted[i]);\n return Fp.mul(acc, num);\n }, invertedAcc);\n return inverted;\n}\n\n// TODO: remove\nexport function FpDiv<T>(Fp: IField<T>, lhs: T, rhs: T \| bigint): T {\n return Fp.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, Fp.ORDER) : Fp.inv(rhs));\n}\n\n/\n Legendre symbol.\n * Legendre constant is used to calculate Legendre symbol (a \| p)\n * which denotes the value of a^((p-1)/2) (mod p).\n \n * (a \| p) ≡ 1 if a is a square (mod p), quadratic residue\n * * (a \| p) ≡ -1 if a is not a square (mod p), quadratic non residue\n * * (a \| p) ≡ 0 if a ≡ 0 (mod p)\n /\nexport function FpLegendre<T>(Fp: IField<T>, n: T): -1 \| 0 \| 1 {\n // We can use 3rd argument as optional cache of this value\n // but seems unneeded for now. The operation is very fast.\n const p1mod2 = (Fp.ORDER - _1n) / _2n;\n const powered = Fp.pow(n, p1mod2);\n const yes = Fp.eql(powered, Fp.ONE);\n const zero = Fp.eql(powered, Fp.ZERO);\n const no = Fp.eql(powered, Fp.neg(Fp.ONE));\n if (!yes && !zero && !no) throw new Error('invalid Legendre symbol result');\n return yes ? 1 : zero ? 0 : -1;\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(Fp: IField<T>, n: T): boolean {\n const l = FpLegendre(Fp, n);\n return l === 1;\n}\n\nexport type NLength = { nByteLength: number; nBitLength: number };\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number): NLength {\n // Bit size, byte size of CURVE.n\n if (nBitLength !== undefined) anumber(nBitLength);\n const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n const nByteLength = Math.ceil(_nBitLength / 8);\n return { nBitLength: _nBitLength, nByteLength };\n}\n\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\ntype SqrtFn = (n: bigint) => bigint;\ntype FieldOpts = Partial<{\n isLE: boolean;\n BITS: number;\n sqrt: SqrtFn;\n allowedLengths?: readonly number[]; // for P521 (adds padding for smaller sizes)\n modFromBytes: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n}>;\nclass _Field implements IField<bigint> {\n readonly ORDER: bigint;\n readonly BITS: number;\n readonly BYTES: number;\n readonly isLE: boolean;\n readonly ZERO = _0n;\n readonly ONE = _1n;\n readonly _lengths?: number[];\n private _sqrt: ReturnType<typeof FpSqrt> \| undefined; // cached sqrt\n private readonly _mod?: boolean;\n constructor(ORDER: bigint, opts: FieldOpts = {}) {\n if (ORDER <= _0n) throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n let _nbitLength: number \| undefined = undefined;\n this.isLE = false;\n if (opts != null && typeof opts === 'object') {\n if (typeof opts.BITS === 'number') _nbitLength = opts.BITS;\n if (typeof opts.sqrt === 'function') this.sqrt = opts.sqrt;\n if (typeof opts.isLE === 'boolean') this.isLE = opts.isLE;\n if (opts.allowedLengths) this._lengths = opts.allowedLengths?.slice();\n if (typeof opts.modFromBytes === 'boolean') this._mod = opts.modFromBytes;\n }\n const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);\n if (nByteLength > 2048) throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n this.ORDER = ORDER;\n this.BITS = nBitLength;\n this.BYTES = nByteLength;\n this._sqrt = undefined;\n Object.preventExtensions(this);\n }\n\n create(num: bigint) {\n return mod(num, this.ORDER);\n }\n isValid(num: bigint) {\n if (typeof num !== 'bigint')\n throw new Error('invalid field element: expected bigint, got ' + typeof num);\n return _0n <= num && num < this.ORDER; // 0 is valid element, but it's not invertible\n }\n is0(num: bigint) {\n return num === _0n;\n }\n // is valid and invertible\n isValidNot0(num: bigint) {\n return !this.is0(num) && this.isValid(num);\n }\n isOdd(num: bigint) {\n return (num & _1n) === _1n;\n }\n neg(num: bigint) {\n return mod(-num, this.ORDER);\n }\n eql(lhs: bigint, rhs: bigint) {\n return lhs === rhs;\n }\n\n sqr(num: bigint) {\n return mod(num num, this.ORDER);\n }\n add(lhs: bigint, rhs: bigint) {\n return mod(lhs + rhs, this.ORDER);\n }\n sub(lhs: bigint, rhs: bigint) {\n return mod(lhs - rhs, this.ORDER);\n }\n mul(lhs: bigint, rhs: bigint) {\n return mod(lhs * rhs, this.ORDER);\n }\n pow(num: bigint, power: bigint): bigint {\n return FpPow(this, num, power);\n }\n div(lhs: bigint, rhs: bigint) {\n return mod(lhs * invert(rhs, this.ORDER), this.ORDER);\n }\n\n // Same as above, but doesn't normalize\n sqrN(num: bigint) {\n return num * num;\n }\n addN(lhs: bigint, rhs: bigint) {\n return lhs + rhs;\n }\n subN(lhs: bigint, rhs: bigint) {\n return lhs - rhs;\n }\n mulN(lhs: bigint, rhs: bigint) {\n return lhs * rhs;\n }\n\n inv(num: bigint) {\n return invert(num, this.ORDER);\n }\n sqrt(num: bigint): bigint {\n // Caching _sqrt speeds up sqrt9mod16 by 5x and tonneli-shanks by 10%\n if (!this._sqrt) this._sqrt = FpSqrt(this.ORDER);\n return this._sqrt(this, num);\n }\n toBytes(num: bigint) {\n return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);\n }\n fromBytes(bytes: Uint8Array, skipValidation = false) {\n abytes(bytes);\n const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;\n if (allowedLengths) {\n if (!allowedLengths.includes(bytes.length) \|\| bytes.length > BYTES) {\n throw new Error(\n 'Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length\n );\n }\n const padded = new Uint8Array(BYTES);\n // isLE add 0 to right, !isLE to the left.\n padded.set(bytes, isLE ? 0 : padded.length - bytes.length);\n bytes = padded;\n }\n if (bytes.length !== BYTES)\n throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n if (modFromBytes) scalar = mod(scalar, ORDER);\n if (!skipValidation)\n if (!this.isValid(scalar))\n throw new Error('invalid field element: outside of range 0..ORDER');\n // NOTE: we don't validate scalar here, please use isValid. This done such way because some\n // protocol may allow non-reduced scalar that reduced later or changed some other way.\n return scalar;\n }\n // TODO: we don't need it here, move out to separate fn\n invertBatch(lst: bigint[]): bigint[] {\n return FpInvertBatch(this, lst);\n }\n // We can't move this out because Fp6, Fp12 implement it\n // and it's unclear what to return in there.\n cmov(a: bigint, b: bigint, condition: boolean) {\n return condition ? b : a;\n }\n}\n\n/*\n Creates a finite field. Major performance optimizations:\n * * 1. Denormalized operations like mulN instead of mul.\n * * 2. Identical object shape: never add or remove keys.\n * * 3. `Object.freeze`.\n * Fragile: always run a benchmark on a change.\n * Security note: operations don't check 'isValid' for all elements for performance reasons,\n * it is caller responsibility to check this.\n * This is low-level code, please make sure you know what you're doing.\n \n Note about field properties:\n * * CHARACTERISTIC p = prime number, number of elements in main subgroup.\n * * ORDER q = similar to cofactor in curves, may be composite `q = p^m`.\n \n @param ORDER field order, probably prime, or could be composite\n * @param bitLen how many bits the field consumes\n * @param isLE (default: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n /\nexport function Field(ORDER: bigint, opts: FieldOpts = {}): Readonly<FpField> {\n return new _Field(ORDER, opts);\n}\n\n// Generic random scalar, we can do same for other fields if via Fp2.mul(Fp2.ONE, Fp2.random)?\n// This allows unsafe methods like ignore bias or zero. These unsafe, but often used in different protocols (if deterministic RNG).\n// which mean we cannot force this via opts.\n// Not sure what to do with randomBytes, we can accept it inside opts if wanted.\n// Probably need to export getMinHashLength somewhere?\n// random(bytes?: Uint8Array, unsafeAllowZero = false, unsafeAllowBias = false) {\n// const LEN = !unsafeAllowBias ? getMinHashLength(ORDER) : BYTES;\n// if (bytes === undefined) bytes = randomBytes(LEN); // _opts.randomBytes?\n// const num = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n// // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n// const reduced = unsafeAllowZero ? mod(num, ORDER) : mod(num, ORDER - _1n) + _1n;\n// return reduced;\n// },\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T): T {\n if (!Fp.isOdd) throw new Error(\"Field doesn't have isOdd\");\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T): T {\n if (!Fp.isOdd) throw new Error(\"Field doesn't have isOdd\");\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n\n/\n Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n /\nexport function getFieldBytesLength(fieldOrder: bigint): number {\n if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\n\n/\n Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n /\nexport function getMinHashLength(fieldOrder: bigint): number {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\n\n/\n \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.Point.Fn.ORDER)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n /\nexport function mapHashToField(key: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n abytes(key);\n const len = key.length;\n const fieldLen = getFieldBytesLength(fieldOrder);\n const minLen = getMinHashLength(fieldOrder);\n // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n if (len < 16 \|\| len < minLen \|\| len > 1024)\n throw new Error('expected ' + minLen + '-1024 bytes of input, got ' + len);\n const num = isLE ? bytesToNumberLE(key) : bytesToNumberBE(key);\n // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n const reduced = mod(num, fieldOrder - _1n) + _1n;\n return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n","/\n Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger.\n * @module\n /\n/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nimport { bitLen, bitMask, type Signer } from '../utils.ts';\nimport { Field, FpInvertBatch, validateField, type IField } from './modular.ts';\n\nconst _0n = / @__PURE__ / BigInt(0);\nconst _1n = / @__PURE__ / BigInt(1);\n\nexport type AffinePoint<T> = {\n x: T;\n y: T;\n} & { Z?: never };\n\n// We can't \"abstract out\" coordinates (X, Y, Z; and T in Edwards): argument names of constructor\n// are not accessible. See Typescript gh-56093, gh-41594.\n//\n// We have to use recursive types, so it will return actual point, not constained `CurvePoint`.\n// If, at any point, P is `any`, it will erase all types and replace it\n// with `any`, because of recursion, `any implements CurvePoint`,\n// but we lose all constrains on methods.\n\n/* Base interface for all elliptic curve Points. /\nexport interface CurvePoint<F, P extends CurvePoint<F, P>> {\n /* Affine x coordinate. Different from projective / extended X coordinate. /\n x: F;\n /* Affine y coordinate. Different from projective / extended Y coordinate. /\n y: F;\n Z?: F;\n double(): P;\n negate(): P;\n add(other: P): P;\n subtract(other: P): P;\n equals(other: P): boolean;\n multiply(scalar: bigint): P;\n assertValidity(): void;\n clearCofactor(): P;\n is0(): boolean;\n isTorsionFree(): boolean;\n isSmallOrder(): boolean;\n multiplyUnsafe(scalar: bigint): P;\n /\n Massively speeds up `p.multiply(n)` by using precompute tables (caching). See {@link wNAF}.\n * @param isLazy calculate cache now. Default (true) ensures it's deferred to first `multiply()`\n /\n precompute(windowSize?: number, isLazy?: boolean): P;\n /* Converts point to 2D xy affine coordinates /\n toAffine(invertedZ?: F): AffinePoint<F>;\n toBytes(): Uint8Array;\n toHex(): string;\n}\n\n/* Base interface for all elliptic curve Point constructors. /\nexport interface CurvePointCons<P extends CurvePoint<any, P>> {\n [Symbol.hasInstance]: (item: unknown) => boolean;\n BASE: P;\n ZERO: P;\n /* Field for basic curve math /\n Fp: IField<P_F<P>>;\n /* Scalar field, for scalars in multiply and others /\n Fn: IField<bigint>;\n /* Creates point from x, y. Does NOT validate if the point is valid. Use `.assertValidity()`. /\n fromAffine(p: AffinePoint<P_F<P>>): P;\n fromBytes(bytes: Uint8Array): P;\n fromHex(hex: string): P;\n}\n\n// Type inference helpers: PC - PointConstructor, P - Point, Fp - Field element\n// Short names, because we use them a lot in result types:\n// we can't do 'P = GetCurvePoint<PC>': this is default value and doesn't constrain anything\n// * we can't do 'type X = GetCurvePoint<PC>': it won't be accesible for arguments/return types\n// * `CurvePointCons<P extends CurvePoint<any, P>>` constraints from interface definition\n// won't propagate, if `PC extends CurvePointCons<any>`: the P would be 'any', which is incorrect\n// * PC could be super specific with super specific P, which implements CurvePoint<any, P>.\n// this means we need to do stuff like\n// `function test<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(`\n// if we want type safety around P, otherwise PC_P<PC> will be any\n\n/** Returns Fp type from Point (P_F<P> == P.F) /\nexport type P_F<P extends CurvePoint<any, P>> = P extends CurvePoint<infer F, P> ? F : never;\n/* Returns Fp type from PointCons (PC_F<PC> == PC.P.F) /\nexport type PC_F<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['Fp']['ZERO'];\n/* Returns Point type from PointCons (PC_P<PC> == PC.P) /\nexport type PC_P<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['ZERO'];\n\n// Ugly hack to get proper type inference, because in typescript fails to infer resursively.\n// The hack allows to do up to 10 chained operations without applying type erasure.\n//\n// Types which won't work:\n// `CurvePointCons<CurvePoint<any, any>>`, will return `any` after 1 operation\n// * `CurvePointCons<any>: WeierstrassPointCons<bigint> extends CurvePointCons<any> = false`\n// * `P extends CurvePoint, PC extends CurvePointCons<P>`\n// * It can't infer P from PC alone\n// * Too many relations between F, P & PC\n// * It will infer P/F if `arg: CurvePointCons<F, P>`, but will fail if PC is generic\n// * It will work correctly if there is an additional argument of type P\n// * But generally, we don't want to parametrize `CurvePointCons` over `F`: it will complicate\n// types, making them un-inferable\n// prettier-ignore\nexport type PC_ANY = CurvePointCons<\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any, any>\n >>>>>>>>>\n>;\n\nexport interface CurveLengths {\n secretKey?: number;\n publicKey?: number;\n publicKeyUncompressed?: number;\n publicKeyHasPrefix?: boolean;\n signature?: number;\n seed?: number;\n}\n\nexport type Mapper<T> = (i: T[]) => T[];\n\nexport function negateCt<T extends { negate: () => T }>(condition: boolean, item: T): T {\n const neg = item.negate();\n return condition ? neg : item;\n}\n\n/*\n Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n /\nexport function normalizeZ<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[]\n): P[] {\n const invertedZs = FpInvertBatch(\n c.Fp,\n points.map((p) => p.Z!)\n );\n return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\n\nfunction validateW(W: number, bits: number) {\n if (!Number.isSafeInteger(W) \|\| W <= 0 \|\| W > bits)\n throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\n\n/* Internal wNAF opts for specific W and scalarBits /\ntype WOpts = {\n windows: number;\n windowSize: number;\n mask: bigint;\n maxNumber: number;\n shiftBy: bigint;\n};\n\nfunction calcWOpts(W: number, scalarBits: number): WOpts {\n validateW(W, scalarBits);\n const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n const windowSize = 2 * (W - 1); // W=8 128. Not 256, because we skip zero\n const maxNumber = 2 ** W; // W=8 256\n const mask = bitMask(W); // W=8 255 == mask 0b11111111\n const shiftBy = BigInt(W); // W=8 8\n return { windows, windowSize, mask, maxNumber, shiftBy };\n}\n\nfunction calcOffsets(n: bigint, window: number, wOpts: WOpts) {\n const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n let wbits = Number(n & mask); // extract W bits.\n let nextN = n >> shiftBy; // shift number by W bits.\n\n // What actually happens here:\n // const highestBit = Number(mask ^ (mask >> 1n));\n // let wbits2 = wbits - 1; // skip zero\n // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n\n // split if bits > max: +224 => 256-32\n if (wbits > windowSize) {\n // we skip zero, which means instead of `>= size-1`, we do `> size`\n wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n nextN += _1n; // +256 (carry)\n }\n const offsetStart = window * windowSize;\n const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero\n const isZero = wbits === 0; // is current window slice a 0?\n const isNeg = wbits < 0; // is current window slice negative?\n const isNegF = window % 2 !== 0; // fake random statement for noise\n const offsetF = offsetStart; // fake offset for noise\n return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\n\nfunction validateMSMPoints(points: any[], c: any) {\n if (!Array.isArray(points)) throw new Error('array expected');\n points.forEach((p, i) => {\n if (!(p instanceof c)) throw new Error('invalid point at index ' + i);\n });\n}\nfunction validateMSMScalars(scalars: any[], field: any) {\n if (!Array.isArray(scalars)) throw new Error('array of scalars expected');\n scalars.forEach((s, i) => {\n if (!field.isValid(s)) throw new Error('invalid scalar at index ' + i);\n });\n}\n\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap<any, any[]>();\nconst pointWindowSizes = new WeakMap<any, number>();\n\nfunction getW(P: any): number {\n // To disable precomputes:\n // return 1;\n return pointWindowSizes.get(P) \|\| 1;\n}\n\nfunction assert0(n: bigint): void {\n if (n !== _0n) throw new Error('invalid wNAF');\n}\n\n/*\n Elliptic curve multiplication of Point by scalar. Fragile.\n * Table generation takes 30MB of ram and 10ms on high-end CPU,\n * but may take much longer on slow devices. Actual generation will happen on\n * first call of `multiply()`. By default, `BASE` point is precomputed.\n \n Scalars should always be less than curve order: this should be checked inside of a curve itself.\n * Creates precomputation tables for fast multiplication:\n * - private scalar is split by fixed size windows of W bits\n * - every window point is collected from window's table & added to accumulator\n * - since windows are different, same point inside tables won't be accessed more than once per calc\n * - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n * - +1 window is neccessary for wNAF\n * - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n \n @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n /\nexport class wNAF<PC extends PC_ANY> {\n private readonly BASE: PC_P<PC>;\n private readonly ZERO: PC_P<PC>;\n private readonly Fn: PC['Fn'];\n readonly bits: number;\n\n // Parametrized with a given Point class (not individual point)\n constructor(Point: PC, bits: number) {\n this.BASE = Point.BASE;\n this.ZERO = Point.ZERO;\n this.Fn = Point.Fn;\n this.bits = bits;\n }\n\n // non-const time multiplication ladder\n _unsafeLadder(elm: PC_P<PC>, n: bigint, p: PC_P<PC> = this.ZERO): PC_P<PC> {\n let d: PC_P<PC> = elm;\n while (n > _0n) {\n if (n & _1n) p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\n\n /\n Creates a wNAF precomputation window. Used for caching.\n * Default window size is set by `utils.precompute()` and is equal to 8.\n * Number of precomputed points depends on the curve size:\n * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n * - 𝑊 is the window size\n * - 𝑛 is the bitlength of the curve order.\n * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n * @param point Point instance\n * @param W window size\n * @returns precomputed point tables flattened to a single array\n /\n private precomputeWindow(point: PC_P<PC>, W: number): PC_P<PC>[] {\n const { windows, windowSize } = calcWOpts(W, this.bits);\n const points: PC_P<PC>[] = [];\n let p: PC_P<PC> = point;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n // i=1, bc we skip 0\n for (let i = 1; i < windowSize; i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n\n /\n Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n * More compact implementation:\n * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n * @returns real and fake (for const-time) points\n /\n private wNAF(W: number, precomputes: PC_P<PC>[], n: bigint): { p: PC_P<PC>; f: PC_P<PC> } {\n // Scalar should be smaller than field order\n if (!this.Fn.isValid(n)) throw new Error('invalid scalar');\n // Accumulators\n let p = this.ZERO;\n let f = this.BASE;\n // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n // since each addition is multiplied by 2 * W, it cannot cancel each other. However,\n // there is negate now: it is possible that negated element from low value\n // would be the same as high element, which will create carry into next window.\n // It's not obvious how this can fail, but still worth investigating later.\n const wo = calcWOpts(W, this.bits);\n for (let window = 0; window < wo.windows; window++) {\n // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n n = nextN;\n if (isZero) {\n // bits are 0: add garbage to fake point\n // Important part for const-time getPublicKey: add random \"noise\" point to f.\n f = f.add(negateCt(isNegF, precomputes[offsetF]));\n } else {\n // bits are 1: add to result point\n p = p.add(negateCt(isNeg, precomputes[offset]));\n }\n }\n assert0(n);\n // Return both real and fake points: JIT won't eliminate f.\n // At this point there is a way to F be infinity-point even if p is not,\n // which makes it less const-time: around 1 bigint multiply.\n return { p, f };\n }\n\n /*\n Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.\n * @param acc accumulator point to add result of multiplication\n * @returns point\n /\n private wNAFUnsafe(\n W: number,\n precomputes: PC_P<PC>[],\n n: bigint,\n acc: PC_P<PC> = this.ZERO\n ): PC_P<PC> {\n const wo = calcWOpts(W, this.bits);\n for (let window = 0; window < wo.windows; window++) {\n if (n === _0n) break; // Early-exit, skip 0 value\n const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n n = nextN;\n if (isZero) {\n // Window bits are 0: skip processing.\n // Move to next window.\n continue;\n } else {\n const item = precomputes[offset];\n acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n }\n }\n assert0(n);\n return acc;\n }\n\n private getPrecomputes(W: number, point: PC_P<PC>, transform?: Mapper<PC_P<PC>>): PC_P<PC>[] {\n // Calculate precomputes on a first run, reuse them after\n let comp = pointPrecomputes.get(point);\n if (!comp) {\n comp = this.precomputeWindow(point, W) as PC_P<PC>[];\n if (W !== 1) {\n // Doing transform outside of if brings 15% perf hit\n if (typeof transform === 'function') comp = transform(comp);\n pointPrecomputes.set(point, comp);\n }\n }\n return comp;\n }\n\n cached(\n point: PC_P<PC>,\n scalar: bigint,\n transform?: Mapper<PC_P<PC>>\n ): { p: PC_P<PC>; f: PC_P<PC> } {\n const W = getW(point);\n return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n }\n\n unsafe(point: PC_P<PC>, scalar: bigint, transform?: Mapper<PC_P<PC>>, prev?: PC_P<PC>): PC_P<PC> {\n const W = getW(point);\n if (W === 1) return this._unsafeLadder(point, scalar, prev); // For W=1 ladder is ~x2 faster\n return this.wNAFUnsafe(W, this.getPrecomputes(W, point, transform), scalar, prev);\n }\n\n // We calculate precomputes for elliptic curve point multiplication\n // using windowed method. This specifies window size and\n // stores precomputed values. Usually only base point would be precomputed.\n createCache(P: PC_P<PC>, W: number): void {\n validateW(W, this.bits);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n }\n\n hasCache(elm: PC_P<PC>): boolean {\n return getW(elm) !== 1;\n }\n}\n\n/\n Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n /\nexport function mulEndoUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n Point: PC,\n point: P,\n k1: bigint,\n k2: bigint\n): { p1: P; p2: P } {\n let acc = point;\n let p1 = Point.ZERO;\n let p2 = Point.ZERO;\n while (k1 > _0n \|\| k2 > _0n) {\n if (k1 & _1n) p1 = p1.add(acc);\n if (k2 & _1n) p2 = p2.add(acc);\n acc = acc.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n return { p1, p2 };\n}\n\n/\n Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka secret keys / bigints)\n /\nexport function pippenger<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[],\n scalars: bigint[]\n): P {\n // If we split scalars by some window (let's say 8 bits), every chunk will only\n // take 256 buckets even if there are 4096 scalars, also re-uses double.\n // TODO:\n // - https://eprint.iacr.org/2024/750.pdf\n // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n // 0 is accepted in scalars\n const fieldN = c.Fn;\n validateMSMPoints(points, c);\n validateMSMScalars(scalars, fieldN);\n const plength = points.length;\n const slength = scalars.length;\n if (plength !== slength) throw new Error('arrays of points and scalars must have equal length');\n // if (plength === 0) throw new Error('array must be of length >= 2');\n const zero = c.ZERO;\n const wbits = bitLen(BigInt(plength));\n let windowSize = 1; // bits\n if (wbits > 12) windowSize = wbits - 3;\n else if (wbits > 4) windowSize = wbits - 2;\n else if (wbits > 0) windowSize = 2;\n const MASK = bitMask(windowSize);\n const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) windowSize;\n let sum = zero;\n for (let i = lastBits; i >= 0; i -= windowSize) {\n buckets.fill(zero);\n for (let j = 0; j < slength; j++) {\n const scalar = scalars[j];\n const wbits = Number((scalar >> BigInt(i)) & MASK);\n buckets[wbits] = buckets[wbits].add(points[j]);\n }\n let resI = zero; // not using this will do small speed-up, but will lose ct\n // Skip first bucket, because it is zero\n for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n sumI = sumI.add(buckets[j]);\n resI = resI.add(sumI);\n }\n sum = sum.add(resI);\n if (i !== 0) for (let j = 0; j < windowSize; j++) sum = sum.double();\n }\n return sum as P;\n}\n/*\n Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n /\nexport function precomputeMSMUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[],\n windowSize: number\n): (scalars: bigint[]) => P {\n /\n Performance Analysis of Window-based Precomputation\n \n Base Case (256-bit scalar, 8-bit window):\n * - Standard precomputation requires:\n * - 31 additions per scalar × 256 scalars = 7,936 ops\n * - Plus 255 summary additions = 8,191 total ops\n * Note: Summary additions can be optimized via accumulator\n \n Chunked Precomputation Analysis:\n * - Using 32 chunks requires:\n * - 255 additions per chunk\n * - 256 doublings\n * - Total: (255 × 32) + 256 = 8,416 ops\n \n Memory Usage Comparison:\n * Window Size \| Standard Points \| Chunked Points\n * ------------\|-----------------\|---------------\n * 4-bit \| 520 \| 15\n * 8-bit \| 4,224 \| 255\n * 10-bit \| 13,824 \| 1,023\n * 16-bit \| 557,056 \| 65,535\n \n Key Advantages:\n * 1. Enables larger window sizes due to reduced memory overhead\n * 2. More efficient for smaller scalar counts:\n * - 16 chunks: (16 × 255) + 256 = 4,336 ops\n * - ~2x faster than standard 8,191 ops\n \n Limitations:\n * - Not suitable for plain precomputes (requires 256 constant doublings)\n * - Performance degrades with larger scalar counts:\n * - Optimal for ~256 scalars\n * - Less efficient for 4096+ scalars (Pippenger preferred)\n /\n const fieldN = c.Fn;\n validateW(windowSize, fieldN.BITS);\n validateMSMPoints(points, c);\n const zero = c.ZERO;\n const tableSize = 2 * windowSize - 1; // table size (without zero)\n const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n const MASK = bitMask(windowSize);\n const tables = points.map((p: P) => {\n const res = [];\n for (let i = 0, acc = p; i < tableSize; i++) {\n res.push(acc);\n acc = acc.add(p);\n }\n return res;\n });\n return (scalars: bigint[]): P => {\n validateMSMScalars(scalars, fieldN);\n if (scalars.length > points.length)\n throw new Error('array of scalars must be smaller than array of points');\n let res = zero;\n for (let i = 0; i < chunks; i++) {\n // No need to double if accumulator is still zero.\n if (res !== zero) for (let j = 0; j < windowSize; j++) res = res.double();\n const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n for (let j = 0; j < scalars.length; j++) {\n const n = scalars[j];\n const curr = Number((n >> shiftBy) & MASK);\n if (!curr) continue; // skip zero scalars chunks\n res = res.add(tables[j][curr - 1]);\n }\n }\n return res;\n };\n}\n\nexport type ValidCurveParams<T> = {\n p: bigint;\n n: bigint;\n h: bigint;\n a: T;\n b?: T;\n d?: T;\n Gx: T;\n Gy: T;\n};\n\nfunction createField<T>(order: bigint, field?: IField<T>, isLE?: boolean): IField<T> {\n if (field) {\n if (field.ORDER !== order) throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n validateField(field);\n return field;\n } else {\n return Field(order, { isLE }) as unknown as IField<T>;\n }\n}\nexport type FpFn<T> = { Fp: IField<T>; Fn: IField<bigint> };\n\n/** Validates CURVE opts and creates fields /\nexport function createCurveFields<T>(\n type: 'weierstrass' \| 'edwards',\n CURVE: ValidCurveParams<T>,\n curveOpts: Partial<FpFn<T>> = {},\n FpFnLE?: boolean\n): FpFn<T> & { CURVE: ValidCurveParams<T> } {\n if (FpFnLE === undefined) FpFnLE = type === 'edwards';\n if (!CURVE \|\| typeof CURVE !== 'object') throw new Error(`expected valid ${type} CURVE object`);\n for (const p of ['p', 'n', 'h'] as const) {\n const val = CURVE[p];\n if (!(typeof val === 'bigint' && val > _0n))\n throw new Error(`CURVE.${p} must be positive bigint`);\n }\n const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);\n const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);\n const _b: 'b' \| 'd' = type === 'weierstrass' ? 'b' : 'd';\n const params = ['Gx', 'Gy', 'a', _b] as const;\n for (const p of params) {\n // @ts-ignore\n if (!Fp.isValid(CURVE[p]))\n throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);\n }\n CURVE = Object.freeze(Object.assign({}, CURVE));\n return { CURVE, Fp, Fn };\n}\n\ntype KeygenFn = (\n seed?: Uint8Array,\n isCompressed?: boolean\n) => { secretKey: Uint8Array; publicKey: Uint8Array };\nexport function createKeygen(\n randomSecretKey: Function,\n getPublicKey: Signer['getPublicKey']\n): KeygenFn {\n return function keygen(seed?: Uint8Array) {\n const secretKey = randomSecretKey(seed);\n return { secretKey, publicKey: getPublicKey(secretKey) };\n };\n}\n","/\n Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y².\n * For design rationale of types / exports, see weierstrass module documentation.\n * Untwisted Edwards curves exist, but they aren't used in real-world protocols.\n * @module\n /\n/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nimport {\n abool,\n abytes,\n aInRange,\n bytesToHex,\n bytesToNumberLE,\n concatBytes,\n copyBytes,\n hexToBytes,\n isBytes,\n memoized,\n notImplemented,\n validateObject,\n randomBytes as wcRandomBytes,\n type FHash,\n type Signer,\n} from '../utils.ts';\nimport {\n createCurveFields,\n createKeygen,\n normalizeZ,\n wNAF,\n type AffinePoint,\n type CurveLengths,\n type CurvePoint,\n type CurvePointCons,\n} from './curve.ts';\nimport { type IField } from './modular.ts';\n\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _8n = BigInt(8);\n\n/* Instance of Extended Point with coordinates in X, Y, Z, T. /\nexport interface EdwardsPoint extends CurvePoint<bigint, EdwardsPoint> {\n /* extended X coordinate. Different from affine x. /\n readonly X: bigint;\n /* extended Y coordinate. Different from affine y. /\n readonly Y: bigint;\n /* extended Z coordinate /\n readonly Z: bigint;\n /* extended T coordinate /\n readonly T: bigint;\n}\n/* Static methods of Extended Point with coordinates in X, Y, Z, T. /\nexport interface EdwardsPointCons extends CurvePointCons<EdwardsPoint> {\n new (X: bigint, Y: bigint, Z: bigint, T: bigint): EdwardsPoint;\n CURVE(): EdwardsOpts;\n fromBytes(bytes: Uint8Array, zip215?: boolean): EdwardsPoint;\n fromHex(hex: string, zip215?: boolean): EdwardsPoint;\n}\n\n/\n Twisted Edwards curve options.\n \n * a: formula param\n * * d: formula param\n * * p: prime characteristic (order) of finite field, in which arithmetics is done\n * * n: order of prime subgroup a.k.a total amount of valid curve points\n * * h: cofactor. hn is group order; n is subgroup order\n * Gx: x coordinate of generator point a.k.a. base point\n * * Gy: y coordinate of generator point\n /\nexport type EdwardsOpts = Readonly<{\n p: bigint;\n n: bigint;\n h: bigint;\n a: bigint;\n d: bigint;\n Gx: bigint;\n Gy: bigint;\n}>;\n\n/\n Extra curve options for Twisted Edwards.\n \n * Fp: redefined Field over curve.p\n * * Fn: redefined Field over curve.n\n * * uvRatio: helper function for decompression, calculating √(u/v)\n /\nexport type EdwardsExtraOpts = Partial<{\n Fp: IField<bigint>;\n Fn: IField<bigint>;\n FpFnLE: boolean;\n uvRatio: (u: bigint, v: bigint) => { isValid: boolean; value: bigint };\n}>;\n\n/\n EdDSA (Edwards Digital Signature algorithm) options.\n \n * hash: hash function used to hash secret keys and messages\n * * adjustScalarBytes: clears bits to get valid field element\n * * domain: Used for hashing\n * * mapToCurve: for hash-to-curve standard\n * * prehash: RFC 8032 pre-hashing of messages to sign() / verify()\n * * randomBytes: function generating random bytes, used for randomSecretKey\n /\nexport type EdDSAOpts = Partial<{\n adjustScalarBytes: (bytes: Uint8Array) => Uint8Array;\n domain: (data: Uint8Array, ctx: Uint8Array, phflag: boolean) => Uint8Array;\n mapToCurve: (scalar: bigint[]) => AffinePoint<bigint>;\n prehash: FHash;\n randomBytes: (bytesLength?: number) => Uint8Array;\n}>;\n\n/\n EdDSA (Edwards Digital Signature algorithm) interface.\n \n Allows to create and verify signatures, create public and secret keys.\n /\nexport interface EdDSA {\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array) => Uint8Array;\n sign: (\n message: Uint8Array,\n secretKey: Uint8Array,\n options?: { context?: Uint8Array }\n ) => Uint8Array;\n verify: (\n sig: Uint8Array,\n message: Uint8Array,\n publicKey: Uint8Array,\n options?: { context?: Uint8Array; zip215: boolean }\n ) => boolean;\n Point: EdwardsPointCons;\n utils: {\n randomSecretKey: (seed?: Uint8Array) => Uint8Array;\n isValidSecretKey: (secretKey: Uint8Array) => boolean;\n isValidPublicKey: (publicKey: Uint8Array, zip215?: boolean) => boolean;\n\n /\n Converts ed public key to x public key.\n \n There is NO `fromMontgomery`:\n * - There are 2 valid ed25519 points for every x25519, with flipped coordinate\n * - Sometimes there are 0 valid ed25519 points, because x25519 additionally\n * accepts inputs on the quadratic twist, which can't be moved to ed25519\n \n @example\n * ```js\n * const someonesPub_ed = ed25519.getPublicKey(ed25519.utils.randomSecretKey());\n * const someonesPub = ed25519.utils.toMontgomery(someonesPub);\n * const aPriv = x25519.utils.randomSecretKey();\n * const shared = x25519.getSharedSecret(aPriv, someonesPub)\n * ```\n /\n toMontgomery: (publicKey: Uint8Array) => Uint8Array;\n /\n Converts ed secret key to x secret key.\n * @example\n * ```js\n * const someonesPub = x25519.getPublicKey(x25519.utils.randomSecretKey());\n * const aPriv_ed = ed25519.utils.randomSecretKey();\n * const aPriv = ed25519.utils.toMontgomerySecret(aPriv_ed);\n * const shared = x25519.getSharedSecret(aPriv, someonesPub)\n * ```\n /\n toMontgomerySecret: (secretKey: Uint8Array) => Uint8Array;\n getExtendedPublicKey: (key: Uint8Array) => {\n head: Uint8Array;\n prefix: Uint8Array;\n scalar: bigint;\n point: EdwardsPoint;\n pointBytes: Uint8Array;\n };\n };\n lengths: CurveLengths;\n}\n\nfunction isEdValidXY(Fp: IField<bigint>, CURVE: EdwardsOpts, x: bigint, y: bigint): boolean {\n const x2 = Fp.sqr(x);\n const y2 = Fp.sqr(y);\n const left = Fp.add(Fp.mul(CURVE.a, x2), y2);\n const right = Fp.add(Fp.ONE, Fp.mul(CURVE.d, Fp.mul(x2, y2)));\n return Fp.eql(left, right);\n}\n\nexport function edwards(params: EdwardsOpts, extraOpts: EdwardsExtraOpts = {}): EdwardsPointCons {\n const validated = createCurveFields('edwards', params, extraOpts, extraOpts.FpFnLE);\n const { Fp, Fn } = validated;\n let CURVE = validated.CURVE as EdwardsOpts;\n const { h: cofactor } = CURVE;\n validateObject(extraOpts, {}, { uvRatio: 'function' });\n\n // Important:\n // There are some places where Fp.BYTES is used instead of nByteLength.\n // So far, everything has been tested with curves of Fp.BYTES == nByteLength.\n // TODO: test and find curves which behave otherwise.\n const MASK = _2n << (BigInt(Fn.BYTES 8) - _1n);\n const modP = (n: bigint) => Fp.create(n); // Function overrides\n\n // sqrt(u/v)\n const uvRatio =\n extraOpts.uvRatio \|\|\n ((u: bigint, v: bigint) => {\n try {\n return { isValid: true, value: Fp.sqrt(Fp.div(u, v)) };\n } catch (e) {\n return { isValid: false, value: _0n };\n }\n });\n\n // Validate whether the passed curve params are valid.\n // equation ax² + y² = 1 + dx²y² should work for generator point.\n if (!isEdValidXY(Fp, CURVE, CURVE.Gx, CURVE.Gy))\n throw new Error('bad curve params: generator point');\n\n /*\n Asserts coordinate is valid: 0 <= n < MASK.\n * Coordinates >= Fp.ORDER are allowed for zip215.\n /\n function acoord(title: string, n: bigint, banZero = false) {\n const min = banZero ? _1n : _0n;\n aInRange('coordinate ' + title, n, min, MASK);\n return n;\n }\n\n function aedpoint(other: unknown) {\n if (!(other instanceof Point)) throw new Error('EdwardsPoint expected');\n }\n // Converts Extended point to default (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n const toAffineMemo = memoized((p: Point, iz?: bigint): AffinePoint<bigint> => {\n const { X, Y, Z } = p;\n const is0 = p.is0();\n if (iz == null) iz = is0 ? _8n : (Fp.inv(Z) as bigint); // 8 was chosen arbitrarily\n const x = modP(X iz);\n const y = modP(Y * iz);\n const zz = Fp.mul(Z, iz);\n if (is0) return { x: _0n, y: _1n };\n if (zz !== _1n) throw new Error('invZ was invalid');\n return { x, y };\n });\n const assertValidMemo = memoized((p: Point) => {\n const { a, d } = CURVE;\n if (p.is0()) throw new Error('bad point: ZERO'); // TODO: optimize, with vars below?\n // Equation in affine coordinates: ax² + y² = 1 + dx²y²\n // Equation in projective coordinates (X/Z, Y/Z, Z): (aX² + Y²)Z² = Z⁴ + dX²Y²\n const { X, Y, Z, T } = p;\n const X2 = modP(X * X); // X²\n const Y2 = modP(Y * Y); // Y²\n const Z2 = modP(Z * Z); // Z²\n const Z4 = modP(Z2 * Z2); // Z⁴\n const aX2 = modP(X2 * a); // aX²\n const left = modP(Z2 * modP(aX2 + Y2)); // (aX² + Y²)Z²\n const right = modP(Z4 + modP(d * modP(X2 * Y2))); // Z⁴ + dX²Y²\n if (left !== right) throw new Error('bad point: equation left != right (1)');\n // In Extended coordinates we also have T, which is xy=T/Z: check XY == ZT\n const XY = modP(X Y);\n const ZT = modP(Z * T);\n if (XY !== ZT) throw new Error('bad point: equation left != right (2)');\n return true;\n });\n\n // Extended Point works in extended coordinates: (X, Y, Z, T) ∋ (x=X/Z, y=Y/Z, T=xy).\n // https://en.wikipedia.org/wiki/Twisted_Edwards_curve#Extended_coordinates\n class Point implements EdwardsPoint {\n // base / generator point\n static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, _1n, modP(CURVE.Gx * CURVE.Gy));\n // zero / infinity / identity point\n static readonly ZERO = new Point(_0n, _1n, _1n, _0n); // 0, 1, 1, 0\n // math field\n static readonly Fp = Fp;\n // scalar field\n static readonly Fn = Fn;\n\n readonly X: bigint;\n readonly Y: bigint;\n readonly Z: bigint;\n readonly T: bigint;\n\n constructor(X: bigint, Y: bigint, Z: bigint, T: bigint) {\n this.X = acoord('x', X);\n this.Y = acoord('y', Y);\n this.Z = acoord('z', Z, true);\n this.T = acoord('t', T);\n Object.freeze(this);\n }\n\n static CURVE(): EdwardsOpts {\n return CURVE;\n }\n\n static fromAffine(p: AffinePoint<bigint>): Point {\n if (p instanceof Point) throw new Error('extended point not allowed');\n const { x, y } = p \|\| {};\n acoord('x', x);\n acoord('y', y);\n return new Point(x, y, _1n, modP(x * y));\n }\n\n // Uses algo from RFC8032 5.1.3.\n static fromBytes(bytes: Uint8Array, zip215 = false): Point {\n const len = Fp.BYTES;\n const { a, d } = CURVE;\n bytes = copyBytes(abytes(bytes, len, 'point'));\n abool(zip215, 'zip215');\n const normed = copyBytes(bytes); // copy again, we'll manipulate it\n const lastByte = bytes[len - 1]; // select last byte\n normed[len - 1] = lastByte & ~0x80; // clear last bit\n const y = bytesToNumberLE(normed);\n\n // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n // RFC8032 prohibits >= p, but ZIP215 doesn't\n // zip215=true: 0 <= y < MASK (2^256 for ed25519)\n // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n const max = zip215 ? MASK : Fp.ORDER;\n aInRange('point.y', y, _0n, max);\n\n // Ed25519: x² = (y²-1)/(dy²+1) mod p. Ed448: x² = (y²-1)/(dy²-1) mod p. Generic case:\n // ax²+y²=1+dx²y² => y²-1=dx²y²-ax² => y²-1=x²(dy²-a) => x²=(y²-1)/(dy²-a)\n const y2 = modP(y * y); // denominator is always non-0 mod p.\n const u = modP(y2 - _1n); // u = y² - 1\n const v = modP(d * y2 - a); // v = d y² + 1.\n let { isValid, value: x } = uvRatio(u, v); // √(u/v)\n if (!isValid) throw new Error('bad point: invalid y coordinate');\n const isXOdd = (x & _1n) === _1n; // There are 2 square roots. Use x_0 bit to select proper\n const isLastByteOdd = (lastByte & 0x80) !== 0; // x_0, last bit\n if (!zip215 && x === _0n && isLastByteOdd)\n // if x=0 and x_0 = 1, fail\n throw new Error('bad point: x=0 and x_0=1');\n if (isLastByteOdd !== isXOdd) x = modP(-x); // if x_0 != x mod 2, set x = p-x\n return Point.fromAffine({ x, y });\n }\n\n static fromHex(hex: string, zip215 = false): Point {\n return Point.fromBytes(hexToBytes(hex), zip215);\n }\n\n get x(): bigint {\n return this.toAffine().x;\n }\n get y(): bigint {\n return this.toAffine().y;\n }\n\n precompute(windowSize: number = 8, isLazy = true) {\n wnaf.createCache(this, windowSize);\n if (!isLazy) this.multiply(_2n); // random number\n return this;\n }\n\n // Useful in fromAffine() - not for fromBytes(), which always created valid points.\n assertValidity(): void {\n assertValidMemo(this);\n }\n\n // Compare one point to another.\n equals(other: Point): boolean {\n aedpoint(other);\n const { X: X1, Y: Y1, Z: Z1 } = this;\n const { X: X2, Y: Y2, Z: Z2 } = other;\n const X1Z2 = modP(X1 * Z2);\n const X2Z1 = modP(X2 * Z1);\n const Y1Z2 = modP(Y1 * Z2);\n const Y2Z1 = modP(Y2 * Z1);\n return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n }\n\n is0(): boolean {\n return this.equals(Point.ZERO);\n }\n\n negate(): Point {\n // Flips point sign to a negative one (-x, y in affine coords)\n return new Point(modP(-this.X), this.Y, this.Z, modP(-this.T));\n }\n\n // Fast algo for doubling Extended Point.\n // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n // Cost: 4M + 4S + 1a + 6add + 12.\n double(): Point {\n const { a } = CURVE;\n const { X: X1, Y: Y1, Z: Z1 } = this;\n const A = modP(X1 * X1); // A = X12\n const B = modP(Y1 * Y1); // B = Y12\n const C = modP(_2n * modP(Z1 * Z1)); // C = 2Z12\n const D = modP(a A); // D = aA\n const x1y1 = X1 + Y1;\n const E = modP(modP(x1y1 x1y1) - A - B); // E = (X1+Y1)2-A-B\n const G = D + B; // G = D+B\n const F = G - C; // F = G-C\n const H = D - B; // H = D-B\n const X3 = modP(E * F); // X3 = EF\n const Y3 = modP(G H); // Y3 = GH\n const T3 = modP(E H); // T3 = EH\n const Z3 = modP(F G); // Z3 = FG\n return new Point(X3, Y3, Z3, T3);\n }\n\n // Fast algo for adding 2 Extended Points.\n // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n // Cost: 9M + 1a + 1d + 7add.\n add(other: Point) {\n aedpoint(other);\n const { a, d } = CURVE;\n const { X: X1, Y: Y1, Z: Z1, T: T1 } = this;\n const { X: X2, Y: Y2, Z: Z2, T: T2 } = other;\n const A = modP(X1 X2); // A = X1X2\n const B = modP(Y1 Y2); // B = Y1Y2\n const C = modP(T1 d * T2); // C = T1dT2\n const D = modP(Z1 * Z2); // D = Z1Z2\n const E = modP((X1 + Y1) (X2 + Y2) - A - B); // E = (X1+Y1)(X2+Y2)-A-B\n const F = D - C; // F = D-C\n const G = D + C; // G = D+C\n const H = modP(B - a A); // H = B-aA\n const X3 = modP(E F); // X3 = EF\n const Y3 = modP(G H); // Y3 = GH\n const T3 = modP(E H); // T3 = EH\n const Z3 = modP(F G); // Z3 = FG\n return new Point(X3, Y3, Z3, T3);\n }\n\n subtract(other: Point): Point {\n return this.add(other.negate());\n }\n\n // Constant-time multiplication.\n multiply(scalar: bigint): Point {\n // 1 <= scalar < L\n if (!Fn.isValidNot0(scalar)) throw new Error('invalid scalar: expected 1 <= sc < curve.n');\n const { p, f } = wnaf.cached(this, scalar, (p) => normalizeZ(Point, p));\n return normalizeZ(Point, [p, f])[0];\n }\n\n // Non-constant-time multiplication. Uses double-and-add algorithm.\n // It's faster, but should only be used when you don't care about\n // an exposed private key e.g. sig verification.\n // Does NOT allow scalars higher than CURVE.n.\n // Accepts optional accumulator to merge with multiply (important for sparse scalars)\n multiplyUnsafe(scalar: bigint, acc = Point.ZERO): Point {\n // 0 <= scalar < L\n if (!Fn.isValid(scalar)) throw new Error('invalid scalar: expected 0 <= sc < curve.n');\n if (scalar === _0n) return Point.ZERO;\n if (this.is0() \|\| scalar === _1n) return this;\n return wnaf.unsafe(this, scalar, (p) => normalizeZ(Point, p), acc);\n }\n\n // Checks if point is of small order.\n // If you add something to small order point, you will have \"dirty\"\n // point with torsion component.\n // Multiplies point by cofactor and checks if the result is 0.\n isSmallOrder(): boolean {\n return this.multiplyUnsafe(cofactor).is0();\n }\n\n // Multiplies point by curve order and checks if the result is 0.\n // Returns `false` is the point is dirty.\n isTorsionFree(): boolean {\n return wnaf.unsafe(this, CURVE.n).is0();\n }\n\n // Converts Extended point to default (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n toAffine(invertedZ?: bigint): AffinePoint<bigint> {\n return toAffineMemo(this, invertedZ);\n }\n\n clearCofactor(): Point {\n if (cofactor === _1n) return this;\n return this.multiplyUnsafe(cofactor);\n }\n\n toBytes(): Uint8Array {\n const { x, y } = this.toAffine();\n // Fp.toBytes() allows non-canonical encoding of y (>= p).\n const bytes = Fp.toBytes(y);\n // Each y has 2 valid points: (x, y), (x,-y).\n // When compressing, it's enough to store y and use the last byte to encode sign of x\n bytes[bytes.length - 1] \|= x & _1n ? 0x80 : 0;\n return bytes;\n }\n toHex(): string {\n return bytesToHex(this.toBytes());\n }\n\n toString() {\n return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n }\n }\n const wnaf = new wNAF(Point, Fn.BITS);\n Point.BASE.precompute(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n return Point;\n}\n\n/\n Base class for prime-order points like Ristretto255 and Decaf448.\n * These points eliminate cofactor issues by representing equivalence classes\n * of Edwards curve points.\n /\nexport abstract class PrimeEdwardsPoint<T extends PrimeEdwardsPoint<T>>\n implements CurvePoint<bigint, T>\n{\n static BASE: PrimeEdwardsPoint<any>;\n static ZERO: PrimeEdwardsPoint<any>;\n static Fp: IField<bigint>;\n static Fn: IField<bigint>;\n\n protected readonly ep: EdwardsPoint;\n\n constructor(ep: EdwardsPoint) {\n this.ep = ep;\n }\n\n // Abstract methods that must be implemented by subclasses\n abstract toBytes(): Uint8Array;\n abstract equals(other: T): boolean;\n\n // Static methods that must be implemented by subclasses\n static fromBytes(_bytes: Uint8Array): any {\n notImplemented();\n }\n\n static fromHex(_hex: string): any {\n notImplemented();\n }\n\n get x(): bigint {\n return this.toAffine().x;\n }\n get y(): bigint {\n return this.toAffine().y;\n }\n\n // Common implementations\n clearCofactor(): T {\n // no-op for prime-order groups\n return this as any;\n }\n\n assertValidity(): void {\n this.ep.assertValidity();\n }\n\n toAffine(invertedZ?: bigint): AffinePoint<bigint> {\n return this.ep.toAffine(invertedZ);\n }\n\n toHex(): string {\n return bytesToHex(this.toBytes());\n }\n\n toString(): string {\n return this.toHex();\n }\n\n isTorsionFree(): boolean {\n return true;\n }\n\n isSmallOrder(): boolean {\n return false;\n }\n\n add(other: T): T {\n this.assertSame(other);\n return this.init(this.ep.add(other.ep));\n }\n\n subtract(other: T): T {\n this.assertSame(other);\n return this.init(this.ep.subtract(other.ep));\n }\n\n multiply(scalar: bigint): T {\n return this.init(this.ep.multiply(scalar));\n }\n\n multiplyUnsafe(scalar: bigint): T {\n return this.init(this.ep.multiplyUnsafe(scalar));\n }\n\n double(): T {\n return this.init(this.ep.double());\n }\n\n negate(): T {\n return this.init(this.ep.negate());\n }\n\n precompute(windowSize?: number, isLazy?: boolean): T {\n return this.init(this.ep.precompute(windowSize, isLazy));\n }\n\n // Helper methods\n abstract is0(): boolean;\n protected abstract assertSame(other: T): void;\n protected abstract init(ep: EdwardsPoint): T;\n}\n\n/\n Initializes EdDSA signatures over given Edwards curve.\n /\nexport function eddsa(Point: EdwardsPointCons, cHash: FHash, eddsaOpts: EdDSAOpts = {}): EdDSA {\n if (typeof cHash !== 'function') throw new Error('\"hash\" function param is required');\n validateObject(\n eddsaOpts,\n {},\n {\n adjustScalarBytes: 'function',\n randomBytes: 'function',\n domain: 'function',\n prehash: 'function',\n mapToCurve: 'function',\n }\n );\n\n const { prehash } = eddsaOpts;\n const { BASE, Fp, Fn } = Point;\n\n const randomBytes = eddsaOpts.randomBytes \|\| wcRandomBytes;\n const adjustScalarBytes = eddsaOpts.adjustScalarBytes \|\| ((bytes: Uint8Array) => bytes);\n const domain =\n eddsaOpts.domain \|\|\n ((data: Uint8Array, ctx: Uint8Array, phflag: boolean) => {\n abool(phflag, 'phflag');\n if (ctx.length \|\| phflag) throw new Error('Contexts/pre-hash are not supported');\n return data;\n }); // NOOP\n\n // Little-endian SHA512 with modulo n\n function modN_LE(hash: Uint8Array): bigint {\n return Fn.create(bytesToNumberLE(hash)); // Not Fn.fromBytes: it has length limit\n }\n\n // Get the hashed private scalar per RFC8032 5.1.5\n function getPrivateScalar(key: Uint8Array) {\n const len = lengths.secretKey;\n abytes(key, lengths.secretKey, 'secretKey');\n // Hash private key with curve's hash function to produce uniformingly random input\n // Check byte lengths: ensure(64, h(ensure(32, key)))\n const hashed = abytes(cHash(key), 2 len, 'hashedSecretKey');\n const head = adjustScalarBytes(hashed.slice(0, len)); // clear first half bits, produce FE\n const prefix = hashed.slice(len, 2 * len); // second half is called key prefix (5.1.6)\n const scalar = modN_LE(head); // The actual private scalar\n return { head, prefix, scalar };\n }\n\n /** Convenience method that creates public key from scalar. RFC8032 5.1.5 /\n function getExtendedPublicKey(secretKey: Uint8Array) {\n const { head, prefix, scalar } = getPrivateScalar(secretKey);\n const point = BASE.multiply(scalar); // Point on Edwards curve aka public key\n const pointBytes = point.toBytes();\n return { head, prefix, scalar, point, pointBytes };\n }\n\n /* Calculates EdDSA pub key. RFC8032 5.1.5. /\n function getPublicKey(secretKey: Uint8Array): Uint8Array {\n return getExtendedPublicKey(secretKey).pointBytes;\n }\n\n // int('LE', SHA512(dom2(F, C) \|\| msgs)) mod N\n function hashDomainToScalar(context: Uint8Array = Uint8Array.of(), ...msgs: Uint8Array[]) {\n const msg = concatBytes(...msgs);\n return modN_LE(cHash(domain(msg, abytes(context, undefined, 'context'), !!prehash)));\n }\n\n /* Signs message with secret key. RFC8032 5.1.6 /\n function sign(\n msg: Uint8Array,\n secretKey: Uint8Array,\n options: { context?: Uint8Array } = {}\n ): Uint8Array {\n msg = abytes(msg, undefined, 'message');\n if (prehash) msg = prehash(msg); // for ed25519ph etc.\n const { prefix, scalar, pointBytes } = getExtendedPublicKey(secretKey);\n const r = hashDomainToScalar(options.context, prefix, msg); // r = dom2(F, C) \|\| prefix \|\| PH(M)\n const R = BASE.multiply(r).toBytes(); // R = rG\n const k = hashDomainToScalar(options.context, R, pointBytes, msg); // R \|\| A \|\| PH(M)\n const s = Fn.create(r + k scalar); // S = (r + k * s) mod L\n if (!Fn.isValid(s)) throw new Error('sign failed: invalid s'); // 0 <= s < L\n const rs = concatBytes(R, Fn.toBytes(s));\n return abytes(rs, lengths.signature, 'result');\n }\n\n // verification rule is either zip215 or rfc8032 / nist186-5. Consult fromHex:\n const verifyOpts: { context?: Uint8Array; zip215?: boolean } = { zip215: true };\n\n /*\n Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n * An extended group equation is checked.\n /\n function verify(\n sig: Uint8Array,\n msg: Uint8Array,\n publicKey: Uint8Array,\n options = verifyOpts\n ): boolean {\n const { context, zip215 } = options;\n const len = lengths.signature;\n sig = abytes(sig, len, 'signature');\n msg = abytes(msg, undefined, 'message');\n publicKey = abytes(publicKey, lengths.publicKey, 'publicKey');\n if (zip215 !== undefined) abool(zip215, 'zip215');\n if (prehash) msg = prehash(msg); // for ed25519ph, etc\n\n const mid = len / 2;\n const r = sig.subarray(0, mid);\n const s = bytesToNumberLE(sig.subarray(mid, len));\n let A, R, SB;\n try {\n // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n // zip215=true: 0 <= y < MASK (2^256 for ed25519)\n // zip215=false: 0 <= y < P (2^255-19 for ed25519)\n A = Point.fromBytes(publicKey, zip215);\n R = Point.fromBytes(r, zip215);\n SB = BASE.multiplyUnsafe(s); // 0 <= s < l is done inside\n } catch (error) {\n return false;\n }\n if (!zip215 && A.isSmallOrder()) return false; // zip215 allows public keys of small order\n\n const k = hashDomainToScalar(context, R.toBytes(), A.toBytes(), msg);\n const RkA = R.add(A.multiplyUnsafe(k));\n // Extended group equation\n // [8][S]B = [8]R + [8][k]A'\n return RkA.subtract(SB).clearCofactor().is0();\n }\n\n const _size = Fp.BYTES; // 32 for ed25519, 57 for ed448\n const lengths = {\n secretKey: _size,\n publicKey: _size,\n signature: 2 _size,\n seed: _size,\n };\n function randomSecretKey(seed = randomBytes(lengths.seed)): Uint8Array {\n return abytes(seed, lengths.seed, 'seed');\n }\n\n function isValidSecretKey(key: Uint8Array): boolean {\n return isBytes(key) && key.length === Fn.BYTES;\n }\n\n function isValidPublicKey(key: Uint8Array, zip215?: boolean): boolean {\n try {\n return !!Point.fromBytes(key, zip215);\n } catch (error) {\n return false;\n }\n }\n\n const utils = {\n getExtendedPublicKey,\n randomSecretKey,\n isValidSecretKey,\n isValidPublicKey,\n /*\n Converts ed public key to x public key. Uses formula:\n * - ed25519:\n * - `(u, v) = ((1+y)/(1-y), sqrt(-486664)u/x)`\n - `(x, y) = (sqrt(-486664)u/v, (u-1)/(u+1))`\n - ed448:\n * - `(u, v) = ((y-1)/(y+1), sqrt(156324)u/x)`\n - `(x, y) = (sqrt(156324)u/v, (1+u)/(1-u))`\n /\n toMontgomery(publicKey: Uint8Array): Uint8Array {\n const { y } = Point.fromBytes(publicKey);\n const size = lengths.publicKey;\n const is25519 = size === 32;\n if (!is25519 && size !== 57) throw new Error('only defined for 25519 and 448');\n const u = is25519 ? Fp.div(_1n + y, _1n - y) : Fp.div(y - _1n, y + _1n);\n return Fp.toBytes(u);\n },\n toMontgomerySecret(secretKey: Uint8Array): Uint8Array {\n const size = lengths.secretKey;\n abytes(secretKey, size);\n const hashed = cHash(secretKey.subarray(0, size));\n return adjustScalarBytes(hashed).subarray(0, size);\n },\n };\n\n return Object.freeze({\n keygen: createKeygen(randomSecretKey, getPublicKey),\n getPublicKey,\n sign,\n verify,\n utils,\n Point,\n lengths,\n }) satisfies Signer;\n}\n","/*\n ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n * @module\n /\n/! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) /\nimport { sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, concatBytes, hexToBytes } from '@noble/hashes/utils.js';\nimport { type AffinePoint } from './abstract/curve.ts';\nimport {\n eddsa,\n edwards,\n PrimeEdwardsPoint,\n type EdDSA,\n type EdDSAOpts,\n type EdwardsOpts,\n type EdwardsPoint,\n type EdwardsPointCons,\n} from './abstract/edwards.ts';\nimport {\n _DST_scalar,\n createHasher,\n expand_message_xmd,\n type H2CDSTOpts,\n type H2CHasher,\n type H2CHasherBase,\n} from './abstract/hash-to-curve.ts';\nimport {\n FpInvertBatch,\n FpSqrtEven,\n isNegativeLE,\n mod,\n pow2,\n type IField,\n} from './abstract/modular.ts';\nimport { montgomery, type MontgomeryECDH } from './abstract/montgomery.ts';\nimport { createORPF, type OPRF } from './abstract/oprf.ts';\nimport { asciiToBytes, bytesToNumberLE, equalBytes } from './utils.ts';\n\n// prettier-ignore\nconst _0n = / @__PURE__ / BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = / @__PURE__ / BigInt(3);\n// prettier-ignore\nconst _5n = BigInt(5), _8n = BigInt(8);\n\n// P = 2n255n - 19n\nconst ed25519_CURVE_p = BigInt(\n '0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffed'\n);\n// N = 2n252n + 27742317777372353535851937790883648493n\n// a = Fp.create(BigInt(-1))\n// d = -121665/121666 a.k.a. Fp.neg(121665 Fp.inv(121666))\nconst ed25519_CURVE: EdwardsOpts = /* @__PURE__ / (() => ({\n p: ed25519_CURVE_p,\n n: BigInt('0x1000000000000000000000000000000014def9dea2f79cd65812631a5cf5d3ed'),\n h: _8n,\n a: BigInt('0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffec'),\n d: BigInt('0x52036cee2b6ffe738cc740797779e89800700a4d4141d8ab75eb4dca135978a3'),\n Gx: BigInt('0x216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a'),\n Gy: BigInt('0x6666666666666666666666666666666666666666666666666666666666666658'),\n}))();\n\nfunction ed25519_pow_2_252_3(x: bigint) {\n // prettier-ignore\n const _10n = BigInt(10), _20n = BigInt(20), _40n = BigInt(40), _80n = BigInt(80);\n const P = ed25519_CURVE_p;\n const x2 = (x x) % P;\n const b2 = (x2 * x) % P; // x^3, 11\n const b4 = (pow2(b2, _2n, P) * b2) % P; // x^15, 1111\n const b5 = (pow2(b4, _1n, P) * x) % P; // x^31\n const b10 = (pow2(b5, _5n, P) * b5) % P;\n const b20 = (pow2(b10, _10n, P) * b10) % P;\n const b40 = (pow2(b20, _20n, P) * b20) % P;\n const b80 = (pow2(b40, _40n, P) * b40) % P;\n const b160 = (pow2(b80, _80n, P) * b80) % P;\n const b240 = (pow2(b160, _80n, P) * b80) % P;\n const b250 = (pow2(b240, _10n, P) * b10) % P;\n const pow_p_5_8 = (pow2(b250, _2n, P) * x) % P;\n // ^ To pow to (p+3)/8, multiply it by x.\n return { pow_p_5_8, b2 };\n}\n\nfunction adjustScalarBytes(bytes: Uint8Array): Uint8Array {\n // Section 5: For X25519, in order to decode 32 random bytes as an integer scalar,\n // set the three least significant bits of the first byte\n bytes[0] &= 248; // 0b1111_1000\n // and the most significant bit of the last to zero,\n bytes[31] &= 127; // 0b0111_1111\n // set the second most significant bit of the last byte to 1\n bytes[31] \|= 64; // 0b0100_0000\n return bytes;\n}\n\n// √(-1) aka √(a) aka 2^((p-1)/4)\n// Fp.sqrt(Fp.neg(1))\nconst ED25519_SQRT_M1 = /* @__PURE__ / BigInt(\n '19681161376707505956807079304988542015446066515923890162744021073123829784752'\n);\n// sqrt(u/v)\nfunction uvRatio(u: bigint, v: bigint): { isValid: boolean; value: bigint } {\n const P = ed25519_CURVE_p;\n const v3 = mod(v v * v, P); // v³\n const v7 = mod(v3 * v3 * v, P); // v⁷\n // (p+3)/8 and (p-5)/8\n const pow = ed25519_pow_2_252_3(u * v7).pow_p_5_8;\n let x = mod(u * v3 * pow, P); // (uv³)(uv⁷)^(p-5)/8\n const vx2 = mod(v * x * x, P); // vx²\n const root1 = x; // First root candidate\n const root2 = mod(x * ED25519_SQRT_M1, P); // Second root candidate\n const useRoot1 = vx2 === u; // If vx² = u (mod p), x is a square root\n const useRoot2 = vx2 === mod(-u, P); // If vx² = -u, set x <-- x * 2^((p-1)/4)\n const noRoot = vx2 === mod(-u * ED25519_SQRT_M1, P); // There is no valid root, vx² = -u√(-1)\n if (useRoot1) x = root1;\n if (useRoot2 \|\| noRoot) x = root2; // We return root2 anyway, for const-time\n if (isNegativeLE(x, P)) x = mod(-x, P);\n return { isValid: useRoot1 \|\| useRoot2, value: x };\n}\n\nconst ed25519_Point = /* @__PURE__ / edwards(ed25519_CURVE, { uvRatio });\nconst Fp = / @__PURE__ / (() => ed25519_Point.Fp)();\nconst Fn = / @__PURE__ / (() => ed25519_Point.Fn)();\n\nfunction ed25519_domain(data: Uint8Array, ctx: Uint8Array, phflag: boolean) {\n if (ctx.length > 255) throw new Error('Context is too big');\n return concatBytes(\n asciiToBytes('SigEd25519 no Ed25519 collisions'),\n new Uint8Array([phflag ? 1 : 0, ctx.length]),\n ctx,\n data\n );\n}\n\nfunction ed(opts: EdDSAOpts) {\n return eddsa(ed25519_Point, sha512, Object.assign({ adjustScalarBytes }, opts));\n}\n\n/\n ed25519 curve with EdDSA signatures.\n * @example\n * ```js\n * import { ed25519 } from '@noble/curves/ed25519.js';\n * const { secretKey, publicKey } = ed25519.keygen();\n * // const publicKey = ed25519.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = ed25519.sign(msg, secretKey);\n * const isValid = ed25519.verify(sig, msg, pub); // ZIP215\n * // RFC8032 / FIPS 186-5\n * const isValid2 = ed25519.verify(sig, msg, pub, { zip215: false });\n * ```\n /\nexport const ed25519: EdDSA = / @__PURE__ / ed({});\n/* Context version of ed25519 (ctx for domain separation). See {@link ed25519} /\nexport const ed25519ctx: EdDSA = / @__PURE__ / ed({ domain: ed25519_domain });\n/* Prehashed version of ed25519. See {@link ed25519} /\nexport const ed25519ph: EdDSA = / @__PURE__ / ed({ domain: ed25519_domain, prehash: sha512 });\n\n/\n ECDH using curve25519 aka x25519.\n * @example\n * ```js\n * import { x25519 } from '@noble/curves/ed25519.js';\n * const alice = x25519.keygen();\n * const bob = x25519.keygen();\n * const shared = x25519.getSharedSecret(alice.secretKey, bob.publicKey);\n * ```\n /\nexport const x25519: MontgomeryECDH = / @__PURE__ / (() => {\n const P = ed25519_CURVE_p;\n return montgomery({\n P,\n type: 'x25519',\n powPminus2: (x: bigint): bigint => {\n // x^(p-2) aka x^(2^255-21)\n const { pow_p_5_8, b2 } = ed25519_pow_2_252_3(x);\n return mod(pow2(pow_p_5_8, _3n, P) b2, P);\n },\n adjustScalarBytes,\n });\n})();\n\n// Hash To Curve Elligator2 Map (NOTE: different from ristretto255 elligator)\n// NOTE: very important part is usage of FpSqrtEven for ELL2_C1_EDWARDS, since\n// SageMath returns different root first and everything falls apart\nconst ELL2_C1 = /* @__PURE__ / (() => (ed25519_CURVE_p + _3n) / _8n)(); // 1. c1 = (q + 3) / 8 # Integer arithmetic\nconst ELL2_C2 = / @__PURE__ / (() => Fp.pow(_2n, ELL2_C1))(); // 2. c2 = 2^c1\nconst ELL2_C3 = / @__PURE__ / (() => Fp.sqrt(Fp.neg(Fp.ONE)))(); // 3. c3 = sqrt(-1)\n\n/\n RFC 9380 method `map_to_curve_elligator2_curve25519`. Experimental name: may be renamed later.\n * @private\n /\n// prettier-ignore\nexport function _map_to_curve_elligator2_curve25519(u: bigint): {\n xMn: bigint, xMd: bigint, yMn: bigint, yMd: bigint\n} {\n const ELL2_C4 = (ed25519_CURVE_p - _5n) / _8n; // 4. c4 = (q - 5) / 8 # Integer arithmetic\n const ELL2_J = BigInt(486662);\n\n let tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, _2n); // 2. tv1 = 2 tv1\n let xd = Fp.add(tv1, Fp.ONE); // 3. xd = tv1 + 1 # Nonzero: -1 is square (mod p), tv1 is not\n let x1n = Fp.neg(ELL2_J); // 4. x1n = -J # x1 = x1n / xd = -J / (1 + 2 * u^2)\n let tv2 = Fp.sqr(xd); // 5. tv2 = xd^2\n let gxd = Fp.mul(tv2, xd); // 6. gxd = tv2 * xd # gxd = xd^3\n let gx1 = Fp.mul(tv1, ELL2_J);// 7. gx1 = J * tv1 # x1n + J * xd\n gx1 = Fp.mul(gx1, x1n); // 8. gx1 = gx1 * x1n # x1n^2 + J * x1n * xd\n gx1 = Fp.add(gx1, tv2); // 9. gx1 = gx1 + tv2 # x1n^2 + J * x1n * xd + xd^2\n gx1 = Fp.mul(gx1, x1n); // 10. gx1 = gx1 * x1n # x1n^3 + J * x1n^2 * xd + x1n * xd^2\n let tv3 = Fp.sqr(gxd); // 11. tv3 = gxd^2\n tv2 = Fp.sqr(tv3); // 12. tv2 = tv3^2 # gxd^4\n tv3 = Fp.mul(tv3, gxd); // 13. tv3 = tv3 * gxd # gxd^3\n tv3 = Fp.mul(tv3, gx1); // 14. tv3 = tv3 * gx1 # gx1 * gxd^3\n tv2 = Fp.mul(tv2, tv3); // 15. tv2 = tv2 * tv3 # gx1 * gxd^7\n let y11 = Fp.pow(tv2, ELL2_C4); // 16. y11 = tv2^c4 # (gx1 * gxd^7)^((p - 5) / 8)\n y11 = Fp.mul(y11, tv3); // 17. y11 = y11 * tv3 # gx1gxd^3(gx1gxd^7)^((p-5)/8)\n let y12 = Fp.mul(y11, ELL2_C3); // 18. y12 = y11 c3\n tv2 = Fp.sqr(y11); // 19. tv2 = y11^2\n tv2 = Fp.mul(tv2, gxd); // 20. tv2 = tv2 * gxd\n let e1 = Fp.eql(tv2, gx1); // 21. e1 = tv2 == gx1\n let y1 = Fp.cmov(y12, y11, e1); // 22. y1 = CMOV(y12, y11, e1) # If g(x1) is square, this is its sqrt\n let x2n = Fp.mul(x1n, tv1); // 23. x2n = x1n * tv1 # x2 = x2n / xd = 2 * u^2 * x1n / xd\n let y21 = Fp.mul(y11, u); // 24. y21 = y11 * u\n y21 = Fp.mul(y21, ELL2_C2); // 25. y21 = y21 * c2\n let y22 = Fp.mul(y21, ELL2_C3); // 26. y22 = y21 * c3\n let gx2 = Fp.mul(gx1, tv1); // 27. gx2 = gx1 * tv1 # g(x2) = gx2 / gxd = 2 * u^2 * g(x1)\n tv2 = Fp.sqr(y21); // 28. tv2 = y21^2\n tv2 = Fp.mul(tv2, gxd); // 29. tv2 = tv2 * gxd\n let e2 = Fp.eql(tv2, gx2); // 30. e2 = tv2 == gx2\n let y2 = Fp.cmov(y22, y21, e2); // 31. y2 = CMOV(y22, y21, e2) # If g(x2) is square, this is its sqrt\n tv2 = Fp.sqr(y1); // 32. tv2 = y1^2\n tv2 = Fp.mul(tv2, gxd); // 33. tv2 = tv2 * gxd\n let e3 = Fp.eql(tv2, gx1); // 34. e3 = tv2 == gx1\n let xn = Fp.cmov(x2n, x1n, e3); // 35. xn = CMOV(x2n, x1n, e3) # If e3, x = x1, else x = x2\n let y = Fp.cmov(y2, y1, e3); // 36. y = CMOV(y2, y1, e3) # If e3, y = y1, else y = y2\n let e4 = Fp.isOdd!(y); // 37. e4 = sgn0(y) == 1 # Fix sign of y\n y = Fp.cmov(y, Fp.neg(y), e3 !== e4); // 38. y = CMOV(y, -y, e3 XOR e4)\n return { xMn: xn, xMd: xd, yMn: y, yMd: _1n }; // 39. return (xn, xd, y, 1)\n}\n\nconst ELL2_C1_EDWARDS = /* @__PURE__ / (() => FpSqrtEven(Fp, Fp.neg(BigInt(486664))))(); // sgn0(c1) MUST equal 0\nfunction map_to_curve_elligator2_edwards25519(u: bigint) {\n const { xMn, xMd, yMn, yMd } = _map_to_curve_elligator2_curve25519(u); // 1. (xMn, xMd, yMn, yMd) =\n // map_to_curve_elligator2_curve25519(u)\n let xn = Fp.mul(xMn, yMd); // 2. xn = xMn yMd\n xn = Fp.mul(xn, ELL2_C1_EDWARDS); // 3. xn = xn * c1\n let xd = Fp.mul(xMd, yMn); // 4. xd = xMd * yMn # xn / xd = c1 * xM / yM\n let yn = Fp.sub(xMn, xMd); // 5. yn = xMn - xMd\n let yd = Fp.add(xMn, xMd); // 6. yd = xMn + xMd # (n / d - 1) / (n / d + 1) = (n - d) / (n + d)\n let tv1 = Fp.mul(xd, yd); // 7. tv1 = xd * yd\n let e = Fp.eql(tv1, Fp.ZERO); // 8. e = tv1 == 0\n xn = Fp.cmov(xn, Fp.ZERO, e); // 9. xn = CMOV(xn, 0, e)\n xd = Fp.cmov(xd, Fp.ONE, e); // 10. xd = CMOV(xd, 1, e)\n yn = Fp.cmov(yn, Fp.ONE, e); // 11. yn = CMOV(yn, 1, e)\n yd = Fp.cmov(yd, Fp.ONE, e); // 12. yd = CMOV(yd, 1, e)\n const [xd_inv, yd_inv] = FpInvertBatch(Fp, [xd, yd], true); // batch division\n return { x: Fp.mul(xn, xd_inv), y: Fp.mul(yn, yd_inv) }; // 13. return (xn, xd, yn, yd)\n}\n\n/** Hashing to ed25519 points / field. RFC 9380 methods. /\nexport const ed25519_hasher: H2CHasher<EdwardsPointCons> = / @__PURE__ / (() =>\n createHasher(\n ed25519_Point,\n (scalars: bigint[]) => map_to_curve_elligator2_edwards25519(scalars[0]),\n {\n DST: 'edwards25519_XMD:SHA-512_ELL2_RO_',\n encodeDST: 'edwards25519_XMD:SHA-512_ELL2_NU_',\n p: ed25519_CURVE_p,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha512,\n }\n ))();\n\n// √(-1) aka √(a) aka 2^((p-1)/4)\nconst SQRT_M1 = ED25519_SQRT_M1;\n// √(ad - 1)\nconst SQRT_AD_MINUS_ONE = / @__PURE__ / BigInt(\n '25063068953384623474111414158702152701244531502492656460079210482610430750235'\n);\n// 1 / √(a-d)\nconst INVSQRT_A_MINUS_D = / @__PURE__ / BigInt(\n '54469307008909316920995813868745141605393597292927456921205312896311721017578'\n);\n// 1-d²\nconst ONE_MINUS_D_SQ = / @__PURE__ / BigInt(\n '1159843021668779879193775521855586647937357759715417654439879720876111806838'\n);\n// (d-1)²\nconst D_MINUS_ONE_SQ = / @__PURE__ / BigInt(\n '40440834346308536858101042469323190826248399146238708352240133220865137265952'\n);\n// Calculates 1/√(number)\nconst invertSqrt = (number: bigint) => uvRatio(_1n, number);\n\nconst MAX_255B = / @__PURE__ / BigInt(\n '0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff'\n);\nconst bytes255ToNumberLE = (bytes: Uint8Array) => Fp.create(bytesToNumberLE(bytes) & MAX_255B);\n\n/\n Computes Elligator map for Ristretto255.\n * Described in [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#appendix-B) and on\n * the [website](https://ristretto.group/formulas/elligator.html).\n /\nfunction calcElligatorRistrettoMap(r0: bigint): EdwardsPoint {\n const { d } = ed25519_CURVE;\n const P = ed25519_CURVE_p;\n const mod = (n: bigint) => Fp.create(n);\n const r = mod(SQRT_M1 r0 * r0); // 1\n const Ns = mod((r + _1n) * ONE_MINUS_D_SQ); // 2\n let c = BigInt(-1); // 3\n const D = mod((c - d * r) * mod(r + d)); // 4\n let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D); // 5\n let s_ = mod(s * r0); // 6\n if (!isNegativeLE(s_, P)) s_ = mod(-s_);\n if (!Ns_D_is_sq) s = s_; // 7\n if (!Ns_D_is_sq) c = r; // 8\n const Nt = mod(c * (r - _1n) * D_MINUS_ONE_SQ - D); // 9\n const s2 = s * s;\n const W0 = mod((s + s) * D); // 10\n const W1 = mod(Nt * SQRT_AD_MINUS_ONE); // 11\n const W2 = mod(_1n - s2); // 12\n const W3 = mod(_1n + s2); // 13\n return new ed25519_Point(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n}\n\n/*\n Wrapper over Edwards Point for ristretto255.\n \n Each ed25519/EdwardsPoint has 8 different equivalent points. This can be\n * a source of bugs for protocols like ring signatures. Ristretto was created to solve this.\n * Ristretto point operates in X:Y:Z:T extended coordinates like EdwardsPoint,\n * but it should work in its own namespace: do not combine those two.\n * See [RFC9496](https://www.rfc-editor.org/rfc/rfc9496).\n /\nclass _RistrettoPoint extends PrimeEdwardsPoint<_RistrettoPoint> {\n // Do NOT change syntax: the following gymnastics is done,\n // because typescript strips comments, which makes bundlers disable tree-shaking.\n // prettier-ignore\n static BASE: _RistrettoPoint =\n / @__PURE__ / (() => new _RistrettoPoint(ed25519_Point.BASE))();\n // prettier-ignore\n static ZERO: _RistrettoPoint =\n / @__PURE__ / (() => new _RistrettoPoint(ed25519_Point.ZERO))();\n // prettier-ignore\n static Fp: IField<bigint> =\n / @__PURE__ / (() => Fp)();\n // prettier-ignore\n static Fn: IField<bigint> =\n / @__PURE__ / (() => Fn)();\n\n constructor(ep: EdwardsPoint) {\n super(ep);\n }\n\n static fromAffine(ap: AffinePoint<bigint>): _RistrettoPoint {\n return new _RistrettoPoint(ed25519_Point.fromAffine(ap));\n }\n\n protected assertSame(other: _RistrettoPoint): void {\n if (!(other instanceof _RistrettoPoint)) throw new Error('RistrettoPoint expected');\n }\n\n protected init(ep: EdwardsPoint): _RistrettoPoint {\n return new _RistrettoPoint(ep);\n }\n\n static fromBytes(bytes: Uint8Array): _RistrettoPoint {\n abytes(bytes, 32);\n const { a, d } = ed25519_CURVE;\n const P = ed25519_CURVE_p;\n const mod = (n: bigint) => Fp.create(n);\n const s = bytes255ToNumberLE(bytes);\n // 1. Check that s_bytes is the canonical encoding of a field element, or else abort.\n // 3. Check that s is non-negative, or else abort\n if (!equalBytes(Fp.toBytes(s), bytes) \|\| isNegativeLE(s, P))\n throw new Error('invalid ristretto255 encoding 1');\n const s2 = mod(s s);\n const u1 = mod(_1n + a * s2); // 4 (a is -1)\n const u2 = mod(_1n - a * s2); // 5\n const u1_2 = mod(u1 * u1);\n const u2_2 = mod(u2 * u2);\n const v = mod(a * d * u1_2 - u2_2); // 6\n const { isValid, value: I } = invertSqrt(mod(v * u2_2)); // 7\n const Dx = mod(I * u2); // 8\n const Dy = mod(I * Dx * v); // 9\n let x = mod((s + s) * Dx); // 10\n if (isNegativeLE(x, P)) x = mod(-x); // 10\n const y = mod(u1 * Dy); // 11\n const t = mod(x * y); // 12\n if (!isValid \|\| isNegativeLE(t, P) \|\| y === _0n)\n throw new Error('invalid ristretto255 encoding 2');\n return new _RistrettoPoint(new ed25519_Point(x, y, _1n, t));\n }\n\n /*\n Converts ristretto-encoded string to ristretto point.\n * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-decode).\n * @param hex Ristretto-encoded 32 bytes. Not every 32-byte string is valid ristretto encoding\n /\n static fromHex(hex: string): _RistrettoPoint {\n return _RistrettoPoint.fromBytes(hexToBytes(hex));\n }\n\n /\n Encodes ristretto point to Uint8Array.\n * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-encode).\n /\n toBytes(): Uint8Array {\n let { X, Y, Z, T } = this.ep;\n const P = ed25519_CURVE_p;\n const mod = (n: bigint) => Fp.create(n);\n const u1 = mod(mod(Z + Y) mod(Z - Y)); // 1\n const u2 = mod(X * Y); // 2\n // Square root always exists\n const u2sq = mod(u2 * u2);\n const { value: invsqrt } = invertSqrt(mod(u1 * u2sq)); // 3\n const D1 = mod(invsqrt * u1); // 4\n const D2 = mod(invsqrt * u2); // 5\n const zInv = mod(D1 * D2 * T); // 6\n let D: bigint; // 7\n if (isNegativeLE(T * zInv, P)) {\n let _x = mod(Y * SQRT_M1);\n let _y = mod(X * SQRT_M1);\n X = _x;\n Y = _y;\n D = mod(D1 * INVSQRT_A_MINUS_D);\n } else {\n D = D2; // 8\n }\n if (isNegativeLE(X * zInv, P)) Y = mod(-Y); // 9\n let s = mod((Z - Y) * D); // 10 (check footer's note, no sqrt(-a))\n if (isNegativeLE(s, P)) s = mod(-s);\n return Fp.toBytes(s); // 11\n }\n\n /*\n Compares two Ristretto points.\n * Described in [RFC9496](https://www.rfc-editor.org/rfc/rfc9496#name-equals).\n /\n equals(other: _RistrettoPoint): boolean {\n this.assertSame(other);\n const { X: X1, Y: Y1 } = this.ep;\n const { X: X2, Y: Y2 } = other.ep;\n const mod = (n: bigint) => Fp.create(n);\n // (x1 y2 == y1 * x2) \| (y1 * y2 == x1 * x2)\n const one = mod(X1 * Y2) === mod(Y1 * X2);\n const two = mod(Y1 * Y2) === mod(X1 * X2);\n return one \|\| two;\n }\n\n is0(): boolean {\n return this.equals(_RistrettoPoint.ZERO);\n }\n}\n\nexport const ristretto255: {\n Point: typeof _RistrettoPoint;\n} = { Point: _RistrettoPoint };\n\n/** Hashing to ristretto255 points / field. RFC 9380 methods. /\nexport const ristretto255_hasher: H2CHasherBase<typeof _RistrettoPoint> = {\n Point: _RistrettoPoint,\n /\n Spec: https://www.rfc-editor.org/rfc/rfc9380.html#name-hashing-to-ristretto255. Caveats:\n * * There are no test vectors\n * * encodeToCurve / mapToCurve is undefined\n * * mapToCurve would be `calcElligatorRistrettoMap(scalars[0])`, not ristretto255_map!\n * * hashToScalar is undefined too, so we just use OPRF implementation\n * * We cannot re-use 'createHasher', because ristretto255_map is different algorithm/RFC\n (os2ip -> bytes255ToNumberLE)\n * * mapToCurve == calcElligatorRistrettoMap, hashToCurve == ristretto255_map\n * * hashToScalar is undefined in RFC9380 for ristretto, we are using version from OPRF here, using bytes255ToNumblerLE will create different result if we use bytes255ToNumberLE as os2ip\n * * current version is closest to spec.\n /\n hashToCurve(msg: Uint8Array, options?: H2CDSTOpts): _RistrettoPoint {\n // == 'hash_to_ristretto255'\n const DST = options?.DST \|\| 'ristretto255_XMD:SHA-512_R255MAP_RO_';\n const xmd = expand_message_xmd(msg, DST, 64, sha512);\n // NOTE: RFC 9380 incorrectly calls this function 'ristretto255_map', in RFC 9496 map was function inside (per point)\n // That also lead to confustion that ristretto255_map is mapToCurve (it is not! it is old hashToCurve)\n return ristretto255_hasher.deriveToCurve!(xmd);\n },\n hashToScalar(msg: Uint8Array, options: H2CDSTOpts = { DST: _DST_scalar }) {\n const xmd = expand_message_xmd(msg, options.DST, 64, sha512);\n return Fn.create(bytesToNumberLE(xmd));\n },\n /\n HashToCurve-like construction based on RFC 9496 (Element Derivation).\n * Converts 64 uniform random bytes into a curve point.\n \n WARNING: This represents an older hash-to-curve construction, preceding the finalization of RFC 9380.\n * It was later reused as a component in the newer `hash_to_ristretto255` function defined in RFC 9380.\n /\n deriveToCurve(bytes: Uint8Array): _RistrettoPoint {\n // https://www.rfc-editor.org/rfc/rfc9496.html#name-element-derivation\n abytes(bytes, 64);\n const r1 = bytes255ToNumberLE(bytes.subarray(0, 32));\n const R1 = calcElligatorRistrettoMap(r1);\n const r2 = bytes255ToNumberLE(bytes.subarray(32, 64));\n const R2 = calcElligatorRistrettoMap(r2);\n return new _RistrettoPoint(R1.add(R2));\n },\n};\n\n/* ristretto255 OPRF, defined in RFC 9497. /\nexport const ristretto255_oprf: OPRF = / @__PURE__ / (() =>\n createORPF({\n name: 'ristretto255-SHA512',\n Point: _RistrettoPoint,\n hash: sha512,\n hashToGroup: ristretto255_hasher.hashToCurve,\n hashToScalar: ristretto255_hasher.hashToScalar,\n }))();\n\n/\n Weird / bogus points, useful for debugging.\n * All 8 ed25519 points of 8-torsion subgroup can be generated from the point\n * T = `26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05`.\n * ⟨T⟩ = { O, T, 2T, 3T, 4T, 5T, 6T, 7T }\n /\nexport const ED25519_TORSION_SUBGROUP: string[] = [\n '0100000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n '0000000000000000000000000000000000000000000000000000000000000080',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n 'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n '0000000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n];\n","/\n RCAN Safety Gates — confidence and human-in-the-loop gating (§16).\n /\n\nimport { generateUUID } from \"./crypto.js\";\n\nexport class GateError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"GateError\";\n }\n}\n\n// ---------------------------------------------------------------------------\n// ConfidenceGate\n// ---------------------------------------------------------------------------\n\nexport class ConfidenceGate {\n readonly threshold: number;\n\n constructor(threshold = 0.8) {\n if (threshold < 0 \|\| threshold > 1) {\n throw new GateError(`threshold must be in [0.0, 1.0] — got ${threshold}`);\n }\n this.threshold = threshold;\n }\n\n /* Returns true if the confidence score meets the threshold. /\n allows(confidence: number): boolean {\n return confidence >= this.threshold;\n }\n\n /* Returns the margin (positive = allowed, negative = blocked). /\n margin(confidence: number): number {\n return confidence - this.threshold;\n }\n\n /* Throw if confidence is below threshold. /\n assert(confidence: number, action?: string): void {\n if (!this.allows(confidence)) {\n const label = action ? ` for action '${action}'` : \"\";\n throw new GateError(\n `Confidence ${confidence}${label} is below threshold ${this.threshold}`\n );\n }\n }\n}\n\n// ---------------------------------------------------------------------------\n// HiTLGate\n// ---------------------------------------------------------------------------\n\nexport type ApprovalStatus = \"approved\" \| \"denied\" \| \"pending\";\n\nexport interface PendingApproval {\n token: string;\n action: string;\n context: Record<string, unknown>;\n createdAt: string;\n status: ApprovalStatus;\n reason?: string;\n}\n\nexport class HiTLGate {\n private _pending: Map<string, PendingApproval> = new Map();\n\n /\n Request human approval for an action.\n * Returns an approval token to poll or pass to approve/deny.\n /\n request(action: string, context: Record<string, unknown> = {}): string {\n const token = generateUUID();\n this._pending.set(token, {\n token,\n action,\n context,\n createdAt: new Date().toISOString(),\n status: \"pending\",\n });\n return token;\n }\n\n /* Approve a pending request. /\n approve(token: string): void {\n const approval = this._pending.get(token);\n if (!approval) throw new GateError(`Unknown token: ${token}`);\n approval.status = \"approved\";\n }\n\n /* Deny a pending request with an optional reason. /\n deny(token: string, reason?: string): void {\n const approval = this._pending.get(token);\n if (!approval) throw new GateError(`Unknown token: ${token}`);\n approval.status = \"denied\";\n if (reason) approval.reason = reason;\n }\n\n /* Check the status of a pending approval. /\n check(token: string): ApprovalStatus {\n const approval = this._pending.get(token);\n if (!approval) throw new GateError(`Unknown token: ${token}`);\n return approval.status;\n }\n\n /* Get all pending approvals. /\n get pendingApprovals(): PendingApproval[] {\n return Array.from(this._pending.values()).filter((a) => a.status === \"pending\");\n }\n\n /* Get the full approval record. /\n getApproval(token: string): PendingApproval \| undefined {\n return this._pending.get(token);\n }\n\n /* Clear resolved (approved/denied) approvals. /\n clearResolved(): void {\n for (const [token, approval] of this._pending.entries()) {\n if (approval.status !== \"pending\") {\n this._pending.delete(token);\n }\n }\n }\n}\n","/\n RCAN Audit Chain — tamper-evident commitment records (§16).\n \n Each CommitmentRecord is sealed with an HMAC-SHA256 over its content.\n * Records are chained via previousHash, creating a forensic audit trail.\n /\n\nimport { hmacSha256Sync, generateUUID } from \"./crypto.js\";\n\nexport interface CommitmentRecordData {\n action: string;\n robotUri?: string;\n confidence?: number;\n modelIdentity?: string;\n params?: Record<string, unknown>;\n safetyApproved?: boolean;\n}\n\nexport interface CommitmentRecordJSON {\n recordId: string;\n action: string;\n robotUri: string;\n confidence?: number;\n modelIdentity?: string;\n params: Record<string, unknown>;\n safetyApproved: boolean;\n timestamp: string;\n contentHash: string;\n previousHash: string \| null;\n hmac: string;\n}\n\nexport class AuditError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"AuditError\";\n }\n}\n\nfunction computeContentHash(\n recordId: string,\n action: string,\n robotUri: string,\n timestamp: string,\n params: Record<string, unknown>\n): string {\n const payload = JSON.stringify(\n { recordId, action, robotUri, timestamp, params },\n Object.keys({ recordId, action, robotUri, timestamp, params }).sort()\n );\n return hmacSha256Sync(\"rcan-content-hash\", payload);\n}\n\nfunction computeHmac(secret: string, data: CommitmentRecordJSON): string {\n const { hmac: _ignored, ...rest } = data;\n const payload = JSON.stringify(rest, Object.keys(rest).sort());\n return hmacSha256Sync(secret, payload);\n}\n\nexport class CommitmentRecord {\n readonly recordId: string;\n readonly action: string;\n readonly robotUri: string;\n readonly confidence: number \| undefined;\n readonly modelIdentity: string \| undefined;\n readonly params: Record<string, unknown>;\n readonly safetyApproved: boolean;\n readonly timestamp: string;\n readonly contentHash: string;\n readonly previousHash: string \| null;\n readonly hmac: string;\n\n private constructor(data: CommitmentRecordJSON) {\n this.recordId = data.recordId;\n this.action = data.action;\n this.robotUri = data.robotUri;\n this.confidence = data.confidence;\n this.modelIdentity = data.modelIdentity;\n this.params = data.params;\n this.safetyApproved = data.safetyApproved;\n this.timestamp = data.timestamp;\n this.contentHash = data.contentHash;\n this.previousHash = data.previousHash;\n this.hmac = data.hmac;\n }\n\n static create(\n data: CommitmentRecordData,\n secret: string,\n previousHash: string \| null = null\n ): CommitmentRecord {\n const recordId = generateUUID();\n const timestamp = new Date().toISOString();\n const params = data.params ?? {};\n const robotUri = data.robotUri ?? \"\";\n const contentHash = computeContentHash(recordId, data.action, robotUri, timestamp, params);\n\n const draft: CommitmentRecordJSON = {\n recordId,\n action: data.action,\n robotUri,\n confidence: data.confidence,\n modelIdentity: data.modelIdentity,\n params,\n safetyApproved: data.safetyApproved ?? true,\n timestamp,\n contentHash,\n previousHash,\n hmac: \"\",\n };\n draft.hmac = computeHmac(secret, draft);\n return new CommitmentRecord(draft);\n }\n\n verify(secret: string): boolean {\n const expected = computeHmac(secret, this.toJSON());\n return expected === this.hmac;\n }\n\n toJSON(): CommitmentRecordJSON {\n return {\n recordId: this.recordId,\n action: this.action,\n robotUri: this.robotUri,\n confidence: this.confidence,\n modelIdentity: this.modelIdentity,\n params: this.params,\n safetyApproved: this.safetyApproved,\n timestamp: this.timestamp,\n contentHash: this.contentHash,\n previousHash: this.previousHash,\n hmac: this.hmac,\n };\n }\n\n static fromJSON(obj: CommitmentRecordJSON): CommitmentRecord {\n return new CommitmentRecord(obj);\n }\n}\n\n// ---------------------------------------------------------------------------\n// AuditChain\n// ---------------------------------------------------------------------------\n\nexport interface ChainVerifyResult {\n valid: boolean;\n count: number;\n errors: string[];\n}\n\nexport class AuditChain {\n private _records: CommitmentRecord[] = [];\n private _secret: string;\n\n constructor(secret: string) {\n this._secret = secret;\n }\n\n get records(): readonly CommitmentRecord[] {\n return this._records;\n }\n\n append(data: CommitmentRecordData): CommitmentRecord {\n const prev = this._records[this._records.length - 1];\n const prevHash = prev?.contentHash ?? null;\n const record = CommitmentRecord.create(data, this._secret, prevHash);\n this._records.push(record);\n return record;\n }\n\n verifyAll(): ChainVerifyResult {\n const errors: string[] = [];\n let prevHash: string \| null = null;\n\n for (const record of this._records) {\n if (!record.verify(this._secret)) {\n errors.push(`HMAC invalid for record ${record.recordId.slice(0, 8)}`);\n }\n if (prevHash !== null && record.previousHash !== prevHash) {\n errors.push(\n `Chain broken at ${record.recordId.slice(0, 8)}: expected prev=${prevHash.slice(0, 12)}`\n );\n }\n prevHash = record.contentHash;\n }\n\n return { valid: errors.length === 0, count: this._records.length, errors };\n }\n\n toJSONL(): string {\n return this._records.map((r) => JSON.stringify(r.toJSON())).join(\"\\n\") + \"\\n\";\n }\n\n static fromJSONL(text: string, secret: string): AuditChain {\n const chain = new AuditChain(secret);\n const lines = text.trim().split(\"\\n\").filter((l) => l.trim() !== \"\");\n for (const line of lines) {\n const obj = JSON.parse(line) as CommitmentRecordJSON;\n chain._records.push(CommitmentRecord.fromJSON(obj));\n }\n return chain;\n }\n}\n","/\n RCAN Validation — validate messages, configs, and URIs.\n \n Each function returns a ValidationResult with ok, issues, warnings, info.\n /\n\nimport { RobotURI, RobotURIError } from \"./address\";\nimport { RCANMessage, RCANMessageError } from \"./message\";\nimport type { RCANConfig as RCANConfigType } from \"./types\";\n\nexport type { RCANConfig } from \"./types\";\n\nexport interface ValidationResult {\n ok: boolean;\n issues: string[];\n warnings: string[];\n info: string[];\n}\n\nfunction makeResult(): ValidationResult {\n return { ok: true, issues: [], warnings: [], info: [] };\n}\n\nfunction fail(result: ValidationResult, msg: string): void {\n result.ok = false;\n result.issues.push(msg);\n}\n\nfunction warn(result: ValidationResult, msg: string): void {\n result.warnings.push(msg);\n}\n\nfunction note(result: ValidationResult, msg: string): void {\n result.info.push(msg);\n}\n\n// ---------------------------------------------------------------------------\n// URI validation\n// ---------------------------------------------------------------------------\n\nexport function validateURI(uri: string): ValidationResult {\n const result = makeResult();\n try {\n const parsed = RobotURI.parse(uri);\n note(result, `✅ Valid RCAN URI`);\n note(result, ` Registry: ${parsed.registry}`);\n note(result, ` Manufacturer: ${parsed.manufacturer}`);\n note(result, ` Model: ${parsed.model}`);\n note(result, ` Version: ${parsed.version}`);\n note(result, ` Device ID: ${parsed.deviceId}`);\n } catch (e) {\n fail(result, `Invalid RCAN URI: ${e instanceof Error ? e.message : e}`);\n }\n return result;\n}\n\n// ---------------------------------------------------------------------------\n// Message validation\n// ---------------------------------------------------------------------------\n\nexport function validateMessage(data: unknown): ValidationResult {\n const result = makeResult();\n\n let obj: Record<string, unknown>;\n if (typeof data === \"string\") {\n try {\n obj = JSON.parse(data) as Record<string, unknown>;\n } catch {\n fail(result, \"Invalid JSON string\");\n return result;\n }\n } else if (typeof data === \"object\" && data !== null) {\n obj = data as Record<string, unknown>;\n } else {\n fail(result, \"Expected object or JSON string\");\n return result;\n }\n\n // Required fields\n for (const field of [\"rcan\", \"cmd\", \"target\"]) {\n if (!(field in obj) \|\| !obj[field]) {\n fail(result, `Missing required field: '${field}'`);\n }\n }\n\n if (!result.ok) return result;\n\n try {\n const msg = RCANMessage.fromJSON(obj);\n note(result, `✅ RCAN message valid (v${msg.rcan})`);\n note(result, ` cmd: ${msg.cmd}`);\n note(result, ` target: ${msg.target}`);\n if (msg.confidence !== undefined) {\n note(result, ` confidence: ${msg.confidence}`);\n } else {\n warn(result, \"No confidence score — add for RCAN §16 AI accountability\");\n }\n if (msg.isSigned) {\n note(result, ` signature: alg=${msg.signature?.alg}, kid=${msg.signature?.kid}`);\n } else {\n warn(result, \"Message is unsigned (recommended for production)\");\n }\n } catch (e) {\n fail(result, `Message validation failed: ${e instanceof Error ? e.message : e}`);\n }\n\n return result;\n}\n\n// ---------------------------------------------------------------------------\n// Config validation (L1 / L2 / L3)\n// ---------------------------------------------------------------------------\n\nexport function validateConfig(config: RCANConfigType): ValidationResult {\n const result = makeResult();\n const meta = config.metadata ?? {};\n const agent = config.agent ?? {};\n const rcanProto = config.rcan_protocol ?? {};\n\n // Required top-level keys\n for (const key of [\"rcan_version\", \"metadata\", \"agent\"] as const) {\n if (!(key in config) \|\| config[key] === undefined \|\| config[key] === null) {\n fail(result, `Missing required key: '${key}'`);\n }\n }\n\n // rcan_version format\n const rv = config.rcan_version;\n if (rv) {\n if (!/^\\d+\\.\\d+$/.test(rv)) {\n fail(result, `rcan_version '${rv}' must match pattern N.N (e.g. '1.2')`);\n }\n }\n\n // L1 — required fields\n if (!meta.manufacturer) fail(result, \"L1: metadata.manufacturer is required (§2)\");\n if (!meta.model) fail(result, \"L1: metadata.model is required (§2)\");\n if (!meta.device_id && !meta.robot_name) {\n fail(result, \"L1: metadata.device_id (or robot_name) is required (§2)\");\n }\n\n // L2 — auth + confidence\n if (!rcanProto.jwt_auth?.enabled) {\n warn(result, \"L2: jwt_auth not enabled (required for L2 conformance, §8)\");\n }\n if (!agent.confidence_gates \|\| agent.confidence_gates.length === 0) {\n warn(result, \"L2: confidence_gates not configured (§16)\");\n }\n\n // L3 — hitl + commitment chain\n if (!agent.hitl_gates \|\| agent.hitl_gates.length === 0) {\n warn(result, \"L3: hitl_gates not configured (§16)\");\n }\n if (!agent.commitment_chain?.enabled) {\n warn(result, \"L3: commitment_chain not enabled (§16)\");\n }\n\n // Registration\n if (meta.rrn) {\n note(result, `✅ RRN registered: ${meta.rrn}`);\n } else {\n warn(result, \"Robot not registered — visit rcan.dev/registry/register\");\n }\n\n if (result.ok && result.issues.length === 0) {\n const l1ok = !result.warnings.some((w) => w.startsWith(\"L1\"));\n const l2ok = l1ok && !result.warnings.some((w) => w.startsWith(\"L2\"));\n const l3ok = l2ok && !result.warnings.some((w) => w.startsWith(\"L3\"));\n const level = l3ok ? \"L3\" : l2ok ? \"L2\" : l1ok ? \"L1\" : \"FAIL\";\n note(result, `✅ Config valid — conformance level: ${level}`);\n }\n\n return result;\n}\n","/\n RCAN error class hierarchy.\n * All errors extend RCANError which extends the built-in Error.\n /\n\nexport class RCANError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"RCANError\";\n // Restore prototype chain for instanceof checks in transpiled code\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANAddressError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANAddressError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANValidationError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANValidationError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANGateError extends RCANError {\n constructor(\n message: string,\n public gateType: string,\n public value?: number,\n public threshold?: number\n ) {\n super(message);\n this.name = \"RCANGateError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANSignatureError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANSignatureError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\nexport class RCANRegistryError extends RCANError {\n constructor(message: string) {\n super(message);\n this.name = \"RCANRegistryError\";\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\n// ── Node / Federation errors ──────────────────────────────────────────────────\n\nexport class RCANNodeError extends RCANError {\n constructor(message: string, public readonly nodeUrl?: string) {\n super(message);\n this.name = \"RCANNodeError\";\n Object.setPrototypeOf(this, RCANNodeError.prototype);\n }\n}\n\nexport class RCANNodeNotFoundError extends RCANNodeError {\n constructor(public readonly rrn: string, nodeUrl?: string) {\n super(`RRN not found in federation: ${rrn}`, nodeUrl);\n this.name = \"RCANNodeNotFoundError\";\n Object.setPrototypeOf(this, RCANNodeNotFoundError.prototype);\n }\n}\n\nexport class RCANNodeSyncError extends RCANNodeError {\n constructor(\n message: string,\n nodeUrl?: string,\n public readonly cause?: Error\n ) {\n super(message, nodeUrl);\n this.name = \"RCANNodeSyncError\";\n Object.setPrototypeOf(this, RCANNodeSyncError.prototype);\n }\n}\n\nexport class RCANNodeTrustError extends RCANNodeError {\n public readonly reason: \"invalid_signature\" \| \"expired_cert\" \| \"unknown_issuer\" \| \"missing_pubkey\";\n\n constructor(reason: RCANNodeTrustError[\"reason\"], nodeUrl?: string) {\n super(`Node trust verification failed: ${reason}`, nodeUrl);\n this.name = \"RCANNodeTrustError\";\n this.reason = reason;\n Object.setPrototypeOf(this, RCANNodeTrustError.prototype);\n }\n}\n\n// ── v1.5 errors ───────────────────────────────────────────────────────────────\n\n/* Thrown when an incoming message has an incompatible MAJOR version /\nexport class RCANVersionIncompatibleError extends RCANError {\n constructor(incomingVersion: string, localVersion: string) {\n super(`VERSION_INCOMPATIBLE: incoming=${incomingVersion}, local=${localVersion}`);\n this.name = \"RCANVersionIncompatibleError\";\n Object.setPrototypeOf(this, RCANVersionIncompatibleError.prototype);\n }\n}\n\n/* Thrown when a replay attack is detected /\nexport class RCANReplayAttackError extends RCANError {\n constructor(reason: string) {\n super(`REPLAY_DETECTED: ${reason}`);\n this.name = \"RCANReplayAttackError\";\n Object.setPrototypeOf(this, RCANReplayAttackError.prototype);\n }\n}\n\n/* Thrown when a delegation chain is invalid or too deep /\nexport class RCANDelegationChainError extends RCANError {\n constructor(reason: string) {\n super(`DELEGATION_CHAIN_ERROR: ${reason}`);\n this.name = \"RCANDelegationChainError\";\n Object.setPrototypeOf(this, RCANDelegationChainError.prototype);\n }\n}\n\n/* Thrown when a config update is unauthorized or has a hash mismatch /\nexport class RCANConfigAuthorizationError extends RCANError {\n constructor(reason: string) {\n super(`CONFIG_AUTH_ERROR: ${reason}`);\n this.name = \"RCANConfigAuthorizationError\";\n Object.setPrototypeOf(this, RCANConfigAuthorizationError.prototype);\n }\n}\n","/\n rcan-ts — RegistryClient\n * TypeScript parity with rcan-py RegistryClient.\n \n @see https://rcan.dev/spec#section-registry\n /\n\nimport { RCANRegistryError } from \"./errors.js\";\n\nconst DEFAULT_BASE_URL = \"https://rcan-spec.pages.dev\";\n\n// ── Interfaces ────────────────────────────────────────────────────────────────\n\nexport interface RobotRegistration {\n manufacturer: string;\n model: string;\n version: string;\n device_id: string;\n description?: string;\n contact_email?: string;\n verification_tier?: string;\n source?: string;\n}\n\nexport interface Robot extends RobotRegistration {\n rrn: string;\n registered_at: string;\n updated_at: string;\n verification_tier: string;\n status: string;\n}\n\nexport interface RegistrationResult {\n rrn: string;\n api_key: string;\n}\n\nexport interface ListResult {\n robots: Robot[];\n total: number;\n limit: number;\n offset: number;\n}\n\n// ── RegistryClient ────────────────────────────────────────────────────────────\n\nexport class RegistryClient {\n private baseUrl: string;\n private apiKey?: string;\n private timeout: number;\n\n constructor(opts?: { baseUrl?: string; apiKey?: string; timeout?: number }) {\n this.baseUrl = (opts?.baseUrl ?? DEFAULT_BASE_URL).replace(/\\/$/, \"\");\n this.apiKey = opts?.apiKey;\n this.timeout = opts?.timeout ?? 10000;\n }\n\n // ── Private helpers ─────────────────────────────────────────────────────────\n\n private async _fetch(\n path: string,\n init: RequestInit = {}\n ): Promise<Response> {\n const url = `${this.baseUrl}${path}`;\n const controller = new AbortController();\n const timer = setTimeout(() => controller.abort(), this.timeout);\n\n try {\n const response = await fetch(url, {\n ...init,\n signal: controller.signal,\n headers: {\n \"Content-Type\": \"application/json\",\n ...(init.headers ?? {}),\n },\n });\n return response;\n } finally {\n clearTimeout(timer);\n }\n }\n\n private _authHeaders(): Record<string, string> {\n if (!this.apiKey) {\n throw new RCANRegistryError(\n \"API key required for write operations. Pass apiKey to RegistryClient.\"\n );\n }\n return { Authorization: `Bearer ${this.apiKey}` };\n }\n\n private async _checkResponse<T>(resp: Response): Promise<T> {\n if (!resp.ok) {\n let msg = `Registry API error: ${resp.status}`;\n try {\n const body = (await resp.json()) as { error?: string };\n if (body?.error) msg = body.error;\n } catch {\n / ignore /\n }\n throw new RCANRegistryError(msg);\n }\n return (await resp.json()) as T;\n }\n\n // ── Public API ───────────────────────────────────────────────────────────────\n\n /* Register a new robot. Returns RRN + API key. /\n async register(robot: RobotRegistration): Promise<RegistrationResult> {\n const resp = await this._fetch(\"/api/v1/robots\", {\n method: \"POST\",\n body: JSON.stringify(robot),\n });\n return this._checkResponse<RegistrationResult>(resp);\n }\n\n /* Look up a robot by RRN. /\n async get(rrn: string): Promise<Robot> {\n const resp = await this._fetch(`/api/v1/robots/${encodeURIComponent(rrn)}`);\n return this._checkResponse<Robot>(resp);\n }\n\n /* List robots with optional pagination and tier filter. /\n async list(opts?: {\n limit?: number;\n offset?: number;\n tier?: string;\n }): Promise<ListResult> {\n const params = new URLSearchParams();\n if (opts?.limit !== undefined) params.set(\"limit\", String(opts.limit));\n if (opts?.offset !== undefined) params.set(\"offset\", String(opts.offset));\n if (opts?.tier) params.set(\"tier\", opts.tier);\n const qs = params.toString() ? `?${params}` : \"\";\n const resp = await this._fetch(`/api/v1/robots${qs}`);\n return this._checkResponse<ListResult>(resp);\n }\n\n /* Update robot fields. Requires API key. /\n async patch(rrn: string, updates: Partial<Robot>): Promise<Robot> {\n const resp = await this._fetch(\n `/api/v1/robots/${encodeURIComponent(rrn)}`,\n {\n method: \"PATCH\",\n headers: this._authHeaders(),\n body: JSON.stringify(updates),\n }\n );\n return this._checkResponse<Robot>(resp);\n }\n\n /* Delete (soft-delete) a robot. Requires API key. /\n async delete(rrn: string): Promise<void> {\n const resp = await this._fetch(\n `/api/v1/robots/${encodeURIComponent(rrn)}`,\n {\n method: \"DELETE\",\n headers: this._authHeaders(),\n }\n );\n if (!resp.ok) {\n await this._checkResponse<void>(resp);\n }\n }\n\n /* Search robots by query, manufacturer, model, or tier. /\n async search(opts: {\n q?: string;\n manufacturer?: string;\n model?: string;\n tier?: string;\n }): Promise<Robot[]> {\n const params = new URLSearchParams();\n if (opts.q) params.set(\"q\", opts.q);\n if (opts.manufacturer) params.set(\"manufacturer\", opts.manufacturer);\n if (opts.model) params.set(\"model\", opts.model);\n if (opts.tier) params.set(\"tier\", opts.tier);\n const qs = params.toString() ? `?${params}` : \"\";\n const resp = await this._fetch(`/api/v1/robots/search${qs}`);\n if (!resp.ok) {\n // Fall back to list endpoint with filters\n const listResp = await this._fetch(`/api/v1/robots${qs}`);\n const data = await this._checkResponse<ListResult \| { results?: Robot[] }>(listResp);\n if (\"robots\" in data) return data.robots;\n if (\"results\" in data && data.results) return data.results;\n return [];\n }\n const data = (await resp.json()) as Robot[] \| { results?: Robot[] } \| ListResult;\n if (Array.isArray(data)) return data;\n if (\"results\" in data && data.results) return data.results;\n if (\"robots\" in data) return (data as ListResult).robots;\n return [];\n }\n}\n","/\n rcan-ts — NodeClient\n * Federation-aware node discovery and RRN resolution.\n \n Zero runtime dependencies — uses globalThis.fetch (Node 18+, browsers, CF Workers).\n \n @see https://rcan.dev/spec#section-federation\n /\n\nimport {\n RCANNodeNotFoundError,\n RCANNodeSyncError,\n RCANNodeTrustError,\n} from \"./errors.js\";\nimport type { RCANRegistryNode, RCANResolveResult } from \"./types.js\";\n\n// ── Constants ─────────────────────────────────────────────────────────────────\n\nconst ROOT_NODE_URL = \"https://rcan.dev\";\nconst NODE_MANIFEST_PATH = \"/.well-known/rcan-node.json\";\n\nconst VALID_NODE_TYPES = new Set<string>([\n \"root\",\n \"authoritative\",\n \"resolver\",\n \"cache\",\n]);\n\n// ── Helpers ───────────────────────────────────────────────────────────────────\n\n/\n Parse an RRN string into its namespace components.\n \n @example\n * parseRRNNamespace(\"RRN-BD-00000001\") → { type: \"delegated\", prefix: \"BD\", serial: \"00000001\" }\n * parseRRNNamespace(\"RRN-00000042\") → { type: \"root\", serial: \"00000042\" }\n * parseRRNNamespace(\"INVALID\") → null\n /\nfunction parseRRNNamespace(\n rrn: string\n):\n \| { type: \"root\"; serial: string }\n \| { type: \"delegated\"; prefix: string; serial: string }\n \| null {\n const delegated = rrn.match(/^RRN-([A-Z0-9]{2,8})-(\\d{8,16})$/);\n if (delegated) return { type: \"delegated\", prefix: delegated[1], serial: delegated[2] };\n const root = rrn.match(/^RRN-(\\d{8,16})$/);\n if (root) return { type: \"root\", serial: root[1] };\n return null;\n}\n\n// ── NodeClient ────────────────────────────────────────────────────────────────\n\nexport class NodeClient {\n private readonly rootUrl: string;\n private readonly timeoutMs: number;\n\n constructor(rootUrl = ROOT_NODE_URL, timeoutMs = 10_000) {\n this.rootUrl = rootUrl.replace(/\\/$/, \"\");\n this.timeoutMs = timeoutMs;\n }\n\n // ── Private helpers ─────────────────────────────────────────────────────────\n\n private async _fetch(url: string): Promise<Response> {\n const controller = new AbortController();\n const timer = setTimeout(() => controller.abort(), this.timeoutMs);\n try {\n return await globalThis.fetch(url, { signal: controller.signal });\n } catch (err) {\n if (err instanceof Error && err.name === \"AbortError\") {\n throw new RCANNodeSyncError(`Request timed out: ${url}`, url, err);\n }\n throw new RCANNodeSyncError(\n `Network error fetching ${url}: ${(err as Error).message}`,\n url,\n err instanceof Error ? err : undefined\n );\n } finally {\n clearTimeout(timer);\n }\n }\n\n // ── Public API ───────────────────────────────────────────────────────────────\n\n /\n Fetch /.well-known/rcan-node.json from any node URL.\n * Throws RCANNodeTrustError if the manifest is malformed.\n * Throws RCANNodeSyncError on network failure.\n /\n async getNodeManifest(nodeUrl: string): Promise<RCANRegistryNode> {\n const url = `${nodeUrl.replace(/\\/$/, \"\")}${NODE_MANIFEST_PATH}`;\n const resp = await this._fetch(url);\n\n if (!resp.ok) {\n if (resp.status === 404) {\n throw new RCANNodeNotFoundError(url, nodeUrl);\n }\n throw new RCANNodeSyncError(\n `Failed to fetch node manifest from ${nodeUrl}: HTTP ${resp.status}`,\n nodeUrl\n );\n }\n\n let data: unknown;\n try {\n data = await resp.json();\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in node manifest from ${nodeUrl}`,\n nodeUrl,\n err instanceof Error ? err : undefined\n );\n }\n\n if (!this.verifyNode(data)) {\n throw new RCANNodeTrustError(\"missing_pubkey\", nodeUrl);\n }\n return data;\n }\n\n /\n Get list of known registry nodes from root /api/v1/nodes.\n * Optionally filter by namespace prefix (e.g. \"BD\").\n /\n async listNodes(prefix?: string): Promise<RCANRegistryNode[]> {\n const qs = prefix ? `?prefix=${encodeURIComponent(prefix)}` : \"\";\n const url = `${this.rootUrl}/api/v1/nodes${qs}`;\n const resp = await this._fetch(url);\n\n if (!resp.ok) {\n throw new RCANNodeSyncError(\n `Failed to list nodes from ${url}: HTTP ${resp.status}`,\n url\n );\n }\n\n let data: unknown;\n try {\n data = await resp.json();\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in nodes list from ${url}`,\n url,\n err instanceof Error ? err : undefined\n );\n }\n\n if (Array.isArray(data)) return data as RCANRegistryNode[];\n if (data && typeof data === \"object\" && \"nodes\" in data) {\n return (data as { nodes: RCANRegistryNode[] }).nodes;\n }\n return [];\n }\n\n /\n Find the authoritative node for an RRN.\n * - Delegated RRN (RRN-BD-00000001): GET /api/v1/nodes?prefix=BD, return first match.\n * - Root RRN (RRN-00000042): return root node manifest.\n * - Unknown format: throws RCANNodeNotFoundError.\n /\n async discover(rrn: string): Promise<RCANRegistryNode> {\n const parsed = parseRRNNamespace(rrn);\n\n if (!parsed) {\n throw new RCANNodeNotFoundError(rrn, this.rootUrl);\n }\n\n if (parsed.type === \"root\") {\n return this.getNodeManifest(this.rootUrl);\n }\n\n // delegated\n const nodes = await this.listNodes(parsed.prefix);\n if (nodes.length === 0) {\n throw new RCANNodeNotFoundError(rrn, this.rootUrl);\n }\n return nodes[0];\n }\n\n /\n Resolve an RRN across the federation.\n * First tries {rootUrl}/api/v1/resolve/{rrn}.\n * On 404, discovers the authoritative node and tries {node.api_base}/robots/{rrn}.\n /\n async resolve(rrn: string): Promise<RCANResolveResult> {\n const primaryUrl = `${this.rootUrl}/api/v1/resolve/${encodeURIComponent(rrn)}`;\n\n let resp: Response;\n try {\n resp = await this._fetch(primaryUrl);\n } catch (err) {\n // Network-level failure; bubble up as-is\n throw err;\n }\n\n if (resp.ok) {\n try {\n return (await resp.json()) as RCANResolveResult;\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in resolve response for ${rrn}`,\n this.rootUrl,\n err instanceof Error ? err : undefined\n );\n }\n }\n\n if (resp.status !== 404) {\n throw new RCANNodeSyncError(\n `Unexpected HTTP ${resp.status} resolving ${rrn}`,\n this.rootUrl\n );\n }\n\n // 404 → discover authoritative node and try its /robots/{rrn} endpoint\n const node = await this.discover(rrn);\n const fallbackUrl = `${node.api_base.replace(/\\/$/, \"\")}/robots/${encodeURIComponent(rrn)}`;\n const fallbackResp = await this._fetch(fallbackUrl);\n\n if (!fallbackResp.ok) {\n if (fallbackResp.status === 404) {\n throw new RCANNodeNotFoundError(rrn, node.api_base);\n }\n throw new RCANNodeSyncError(\n `HTTP ${fallbackResp.status} from authoritative node for ${rrn}`,\n node.api_base\n );\n }\n\n try {\n return (await fallbackResp.json()) as RCANResolveResult;\n } catch (err) {\n throw new RCANNodeSyncError(\n `Invalid JSON in fallback resolve response for ${rrn}`,\n node.api_base,\n err instanceof Error ? err : undefined\n );\n }\n }\n\n /\n Verify a node manifest is well-formed.\n * Checks required fields, ed25519: public_key prefix, valid node_type, https:// api_base.\n /\n verifyNode(manifest: unknown): manifest is RCANRegistryNode {\n if (!manifest \|\| typeof manifest !== \"object\") return false;\n const m = manifest as Record<string, unknown>;\n\n if (typeof m.rcan_node_version !== \"string\" \|\| !m.rcan_node_version) return false;\n if (typeof m.node_type !== \"string\" \|\| !VALID_NODE_TYPES.has(m.node_type as string)) return false;\n if (typeof m.operator !== \"string\" \|\| !m.operator) return false;\n if (typeof m.namespace_prefix !== \"string\" \|\| !m.namespace_prefix) return false;\n if (typeof m.public_key !== \"string\" \|\| !m.public_key.startsWith(\"ed25519:\")) return false;\n if (typeof m.api_base !== \"string\" \|\| !m.api_base.startsWith(\"https://\")) return false;\n\n return true;\n }\n}\n","/\n Fetch and validate against canonical RCAN JSON schemas from rcan.dev.\n * Caches schema in memory for the session (no filesystem deps for browser compat).\n /\n\nconst SCHEMA_BASE = 'https://rcan.dev/schemas';\nconst schemaCache = new Map<string, object>();\n\n/* Clear the in-memory schema cache. Intended for use in tests only. /\nexport function _clearSchemaCache(): void {\n schemaCache.clear();\n}\n\nexport async function fetchCanonicalSchema(schemaName: string): Promise<object \| null> {\n if (schemaCache.has(schemaName)) return schemaCache.get(schemaName)!;\n try {\n const controller = new AbortController();\n const timer = setTimeout(() => controller.abort(), 5000);\n // .unref() prevents the timer from keeping the Node.js event loop alive after tests\n (timer as unknown as { unref?: () => void }).unref?.();\n const res = await fetch(`${SCHEMA_BASE}/${schemaName}`, { signal: controller.signal });\n clearTimeout(timer);\n if (!res.ok) return null;\n const schema = await res.json();\n schemaCache.set(schemaName, schema);\n return schema;\n } catch {\n return null; // graceful degradation\n }\n}\n\n/\n Validate a config object against the canonical rcan-config schema from rcan.dev.\n * Returns { valid: true } or { valid: false, errors: string[] }.\n * Gracefully returns { valid: true, skipped: true } if schema unreachable.\n /\nexport async function validateConfigAgainstSchema(\n config: unknown\n): Promise<{ valid: boolean; errors?: string[]; skipped?: boolean }> {\n const schema = await fetchCanonicalSchema('rcan-config.schema.json');\n if (!schema) return { valid: true, skipped: true };\n\n // Basic structural validation (no heavy jsonschema dep — just check required keys)\n const errors: string[] = [];\n if (typeof config !== 'object' \|\| config === null) {\n return { valid: false, errors: ['Config must be an object'] };\n }\n const cfg = config as Record<string, unknown>;\n const required = (schema as any).required ?? [];\n for (const key of required) {\n if (!(key in cfg)) errors.push(`Missing required field: ${key}`);\n }\n return errors.length === 0 ? { valid: true } : { valid: false, errors };\n}\n\nexport async function validateNodeAgainstSchema(\n manifest: unknown\n): Promise<{ valid: boolean; errors?: string[]; skipped?: boolean }> {\n const schema = await fetchCanonicalSchema('rcan-node.schema.json');\n if (!schema) return { valid: true, skipped: true };\n\n const errors: string[] = [];\n if (typeof manifest !== 'object' \|\| manifest === null) {\n return { valid: false, errors: ['Manifest must be an object'] };\n }\n const m = manifest as Record<string, unknown>;\n const required = (schema as any).required ?? [];\n for (const key of required) {\n if (!(key in m)) errors.push(`Missing required field: ${key}`);\n }\n return errors.length === 0 ? { valid: true } : { valid: false, errors };\n}\n","/\n RCAN Quality of Service — §5.3\n \n QoSLevel:\n * FIRE_AND_FORGET = 0 — no ack required\n * ACKNOWLEDGED = 1 — at-least-once; sender retries until COMMAND_ACK\n * EXACTLY_ONCE = 2 — two-phase commit: COMMAND_ACK + COMMAND_COMMIT\n \n Safety messages MUST use qos >= 1.\n * ESTOP MUST use qos = 2 (EXACTLY_ONCE).\n * TELEOP MUST use qos = 0 (FIRE_AND_FORGET).\n /\n\nimport type { SafetyMessage } from \"./safety.js\";\n\nexport enum QoSLevel {\n FIRE_AND_FORGET = 0,\n ACKNOWLEDGED = 1,\n EXACTLY_ONCE = 2,\n}\n\n/* Thrown when an ACK times out for a safety message /\nexport class QoSAckTimeoutError extends Error {\n constructor(msgId: string) {\n super(`ACK timeout for message ${msgId} — safety halt required`);\n this.name = \"QoSAckTimeoutError\";\n Object.setPrototypeOf(this, QoSAckTimeoutError.prototype);\n }\n}\n\nexport interface QoSSendOptions {\n /* QoS level (default: FIRE_AND_FORGET) /\n qos?: QoSLevel;\n /* Max retries for qos >= 1 (default: 3) /\n maxRetries?: number;\n /* Initial backoff ms for qos >= 1 (default: 100) /\n initialBackoffMs?: number;\n /* ACK timeout ms for qos >= 1 (default: 500) /\n ackTimeoutMs?: number;\n}\n\nexport interface QoSResult {\n delivered: boolean;\n attempts: number;\n reason: string;\n}\n\n/\n QoSManager — manages send-with-ack pattern for RCAN messages.\n \n Usage:\n * const mgr = new QoSManager(sendFn, ackFn);\n * await mgr.sendWithQoS(msg, { qos: QoSLevel.EXACTLY_ONCE });\n /\nexport class QoSManager {\n private readonly _send: (msg: unknown) => Promise<void>;\n private readonly _waitForAck: (msgId: string, timeoutMs: number) => Promise<boolean>;\n\n constructor(\n send: (msg: unknown) => Promise<void>,\n waitForAck: (msgId: string, timeoutMs: number) => Promise<boolean>\n ) {\n this._send = send;\n this._waitForAck = waitForAck;\n }\n\n /\n Send a message with the specified QoS level.\n \n For QoS 0: fire and forget.\n * For QoS 1: retry until ACK received or maxRetries exhausted.\n * For QoS 2: same as QoS 1 but sends a COMMAND_COMMIT after ACK.\n /\n async sendWithQoS(\n msg: unknown,\n opts: QoSSendOptions = {}\n ): Promise<QoSResult> {\n const qos = opts.qos ?? QoSLevel.FIRE_AND_FORGET;\n const maxRetries = opts.maxRetries ?? 3;\n const initialBackoffMs = opts.initialBackoffMs ?? 100;\n const ackTimeoutMs = opts.ackTimeoutMs ?? 500;\n\n if (qos === QoSLevel.FIRE_AND_FORGET) {\n await this._send(msg);\n return { delivered: true, attempts: 1, reason: \"fire-and-forget\" };\n }\n\n // QoS 1 or 2: retry loop\n const msgId = (msg as { message_id?: string; msg_id?: string }).message_id\n ?? (msg as { message_id?: string; msg_id?: string }).msg_id\n ?? \"unknown\";\n\n let attempts = 0;\n let backoffMs = initialBackoffMs;\n\n while (attempts <= maxRetries) {\n await this._send(msg);\n attempts++;\n\n const acked = await this._waitForAck(msgId, ackTimeoutMs);\n if (acked) {\n return { delivered: true, attempts, reason: qos === QoSLevel.EXACTLY_ONCE ? \"exactly-once\" : \"acknowledged\" };\n }\n\n if (attempts > maxRetries) break;\n\n // Exponential backoff\n await sleep(backoffMs);\n backoffMs = Math.min(backoffMs 2, 5000);\n }\n\n return { delivered: false, attempts, reason: `ACK not received after ${maxRetries} retries` };\n }\n}\n\n/*\n Override makeEstopMessage to force QoS=EXACTLY_ONCE.\n * Returns a SafetyMessage annotated with qos: 2.\n /\nexport function makeEstopWithQoS(\n ruri: string,\n reason: string\n): SafetyMessage & { qos: QoSLevel } {\n const msg: SafetyMessage & { qos: QoSLevel } = {\n message_type: 6 as const,\n ruri,\n safety_event: \"ESTOP\",\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n qos: QoSLevel.EXACTLY_ONCE,\n };\n return msg;\n}\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = (bytes[6]! & 0x0f) \| 0x40;\n bytes[8] = (bytes[8]! & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, \"0\"));\n return `${hex.slice(0, 4).join(\"\")}-${hex.slice(4, 6).join(\"\")}-${hex.slice(6, 8).join(\"\")}-${hex.slice(8, 10).join(\"\")}-${hex.slice(10).join(\"\")}`;\n}\n\nfunction sleep(ms: number): Promise<void> {\n return new Promise((resolve) => setTimeout(resolve, ms));\n}\n","/*\n RCAN Safety Message helpers (MessageType 6).\n \n Safety messages bypass all queues and confidence gates per RCAN §6.\n * Use these helpers to build and validate ESTOP/STOP/RESUME messages.\n \n v1.5 updates:\n * - makeEstopMessage now includes qos: 2 (EXACTLY_ONCE)\n * - makeTransparencyMessage includes delegationChain (GAP-22)\n /\n\nimport type { DelegationHop } from \"./message.js\";\nimport { QoSLevel } from \"./qos.js\";\n\nexport const SAFETY_MESSAGE_TYPE = 6;\nexport type SafetyEvent = 'ESTOP' \| 'STOP' \| 'RESUME';\n\nexport interface SafetyMessage {\n message_type: 6;\n ruri: string;\n safety_event: SafetyEvent;\n reason: string;\n timestamp_ms: number;\n message_id: string;\n /* v1.5: QoS level (ESTOP always 2) /\n qos?: QoSLevel;\n}\n\nfunction generateId(): string {\n if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n return crypto.randomUUID();\n }\n // Fallback for older Node versions: simple random hex\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = (bytes[6]! & 0x0f) \| 0x40;\n bytes[8] = (bytes[8]! & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, '0'));\n return `${hex.slice(0, 4).join('')}-${hex.slice(4, 6).join('')}-${hex.slice(6, 8).join('')}-${hex.slice(8, 10).join('')}-${hex.slice(10).join('')}`;\n}\n\n/*\n Create an ESTOP message — immediate actuator cut.\n \n Protocol 66 safety invariant: ESTOP is NEVER blocked by new mechanisms.\n * v1.5: forces qos=EXACTLY_ONCE (2) per §5.3.\n /\nexport function makeEstopMessage(ruri: string, reason: string): SafetyMessage {\n return {\n message_type: 6,\n ruri,\n safety_event: 'ESTOP',\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n qos: QoSLevel.EXACTLY_ONCE,\n };\n}\n\n/\n Create a STOP message — controlled deceleration to rest.\n * Use for non-emergency halts where deceleration is safe.\n /\nexport function makeStopMessage(ruri: string, reason: string): SafetyMessage {\n return {\n message_type: 6,\n ruri,\n safety_event: 'STOP',\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n };\n}\n\n/\n Create a RESUME message — clear a prior STOP.\n * Note: ESTOP requires explicit hardware-level clear; RESUME only clears STOP.\n /\nexport function makeResumeMessage(ruri: string, reason: string): SafetyMessage {\n return {\n message_type: 6,\n ruri,\n safety_event: 'RESUME',\n reason: reason.slice(0, 512),\n timestamp_ms: Date.now(),\n message_id: generateId(),\n };\n}\n\n/\n Check if a message dict is a RCAN safety message.\n /\nexport function isSafetyMessage(msg: unknown): msg is SafetyMessage {\n return (\n typeof msg === 'object' &&\n msg !== null &&\n (msg as Record<string, unknown>).message_type === SAFETY_MESSAGE_TYPE\n );\n}\n\n/\n Validate a safety message. Returns array of error strings (empty = valid).\n /\nexport function validateSafetyMessage(msg: Partial<SafetyMessage>): string[] {\n const errors: string[] = [];\n if (msg.message_type !== 6) errors.push('message_type must be 6');\n if (!msg.ruri) errors.push('ruri is required');\n if (!['ESTOP', 'STOP', 'RESUME'].includes(msg.safety_event ?? '')) {\n errors.push('safety_event must be ESTOP, STOP, or RESUME');\n }\n if (!msg.reason \|\| msg.reason.length === 0) errors.push('reason is required');\n if (!msg.message_id) errors.push('message_id is required');\n if (!msg.timestamp_ms \|\| msg.timestamp_ms <= 0) errors.push('timestamp_ms must be positive');\n return errors;\n}\n\n// ── v1.5: Transparency message ────────────────────────────────────────────────\n\nexport interface TransparencyMessage {\n message_type: 11; // TRANSPARENCY\n ruri: string;\n disclosure: string;\n timestamp_ms: number;\n message_id: string;\n /* v1.5 GAP-22: third-party control chain /\n delegation_chain?: DelegationHop[];\n}\n\n/\n Build a TRANSPARENCY message for EU AI Act Article 13 compliance.\n \n v1.5 (GAP-22): includes delegation_chain when available.\n /\nexport function makeTransparencyMessage(\n ruri: string,\n disclosure: string,\n delegationChain?: DelegationHop[]\n): TransparencyMessage {\n return {\n message_type: 11,\n ruri,\n disclosure,\n timestamp_ms: Date.now(),\n message_id: generateId(),\n delegation_chain: delegationChain,\n };\n}\n","/\n RCAN Replay Attack Prevention — §8.3\n \n Robots MUST reject messages where timestamp is >30s old (configurable).\n * A sliding-window seen-set of msg_ids prevents duplicate delivery.\n * Safety messages (MessageType 6) use a 10s window maximum.\n /\n\nimport type { SafetyMessage } from \"./safety.js\";\n\nconst SAFETY_MESSAGE_TYPE = 6;\nconst SAFETY_MAX_WINDOW_S = 10;\nconst DEFAULT_WINDOW_S = 30;\nconst DEFAULT_MAX_SIZE = 10000;\n\n/* A message shape that has the fields the replay cache needs /\nexport interface ReplayableMessage {\n message_id?: string;\n msg_id?: string;\n timestamp_ms?: number;\n timestamp?: string \| number;\n message_type?: number;\n}\n\nexport interface ReplayCheckResult {\n allowed: boolean;\n reason: string;\n}\n\n/\n Sliding-window replay cache.\n \n constructor(windowSeconds = 30, maxSize = 10000)\n /\nexport class ReplayCache {\n private readonly windowSeconds: number;\n private readonly maxSize: number;\n /* Map<msgId, expiresAtMs> /\n private readonly _seen: Map<string, number>;\n\n constructor(windowSeconds: number = DEFAULT_WINDOW_S, maxSize: number = DEFAULT_MAX_SIZE) {\n this.windowSeconds = windowSeconds;\n this.maxSize = maxSize;\n this._seen = new Map();\n }\n\n /\n Check a message id + timestamp and record it if allowed.\n \n @param msgId - unique message identifier\n * @param timestamp - ISO 8601 string or Unix seconds (float)\n * @param isSafety - if true, enforce the 10s safety window cap\n /\n checkAndRecord(\n msgId: string,\n timestamp: string,\n isSafety = false\n ): ReplayCheckResult {\n const now = Date.now();\n\n // Evict stale entries to keep memory bounded\n this._evict(now);\n\n // Resolve effective window\n const window = isSafety\n ? Math.min(this.windowSeconds, SAFETY_MAX_WINDOW_S)\n : this.windowSeconds;\n\n // Parse timestamp → ms\n const tMs = parseTimestampMs(timestamp);\n if (tMs === null) {\n return { allowed: false, reason: `invalid timestamp format: ${timestamp}` };\n }\n\n // Freshness check\n const ageMs = now - tMs;\n const windowMs = window 1000;\n if (ageMs > windowMs) {\n return {\n allowed: false,\n reason: `message too old: age=${Math.round(ageMs / 1000)}s > window=${window}s`,\n };\n }\n if (tMs > now + 5000) {\n // Allow 5s future drift for clock skew\n return {\n allowed: false,\n reason: `message timestamp is in the future`,\n };\n }\n\n // Duplicate check\n if (this._seen.has(msgId)) {\n return { allowed: false, reason: `replay detected: msg_id ${msgId} already seen` };\n }\n\n // Enforce max size by evicting oldest entry\n if (this._seen.size >= this.maxSize) {\n const firstKey = this._seen.keys().next().value as string;\n this._seen.delete(firstKey);\n }\n\n // Record it\n const expiresAt = now + windowMs;\n this._seen.set(msgId, expiresAt);\n\n return { allowed: true, reason: \"ok\" };\n }\n\n /** Evict entries whose window has passed /\n private _evict(now: number): void {\n for (const [id, expiresAt] of this._seen) {\n if (expiresAt <= now) {\n this._seen.delete(id);\n }\n }\n }\n\n /* Number of entries currently tracked /\n get size(): number {\n return this._seen.size;\n }\n}\n\n/\n Validate replay for a SafetyMessage or ReplayableMessage.\n /\nexport function validateReplay(\n message: SafetyMessage \| ReplayableMessage,\n cache: ReplayCache\n): { valid: boolean; reason: string } {\n const msg = message as ReplayableMessage & Partial<SafetyMessage>;\n\n // Resolve msg_id\n const msgId: string \| undefined =\n (msg as SafetyMessage).message_id ?? (msg as ReplayableMessage).msg_id;\n if (!msgId) {\n return { valid: false, reason: \"missing message_id / msg_id\" };\n }\n\n // Resolve timestamp\n let timestamp: string \| undefined;\n if (typeof (msg as SafetyMessage).timestamp_ms === \"number\") {\n // SafetyMessage uses timestamp_ms (unix ms)\n timestamp = String((msg as SafetyMessage).timestamp_ms! / 1000);\n } else if (msg.timestamp !== undefined) {\n timestamp = String(msg.timestamp);\n }\n if (!timestamp) {\n return { valid: false, reason: \"missing timestamp\" };\n }\n\n const isSafety = (msg as SafetyMessage).message_type === SAFETY_MESSAGE_TYPE \|\|\n (msg as ReplayableMessage).message_type === SAFETY_MESSAGE_TYPE;\n\n const result = cache.checkAndRecord(msgId, timestamp, isSafety);\n return { valid: result.allowed, reason: result.reason };\n}\n\n// ── helpers ───────────────────────────────────────────────────────────────────\n\n/\n Parse a timestamp to milliseconds.\n * Accepts:\n * - ISO 8601 strings (\"2026-03-16T12:00:00.000Z\")\n * - Unix seconds as string (\"1710000000.123\" or \"1710000000\")\n * - Unix milliseconds as string (13-digit integers)\n /\nfunction parseTimestampMs(ts: string): number \| null {\n // Try ISO 8601\n if (ts.includes(\"T\") \|\| ts.includes(\"-\")) {\n const d = new Date(ts);\n if (!isNaN(d.getTime())) return d.getTime();\n }\n // Try numeric\n const n = parseFloat(ts);\n if (isNaN(n)) return null;\n // Heuristic: if > 1e12, treat as milliseconds; otherwise seconds\n if (n > 1e12) return n;\n return n 1000;\n}\n","/*\n RCAN Time Synchronization — §8.4\n \n All RCAN robots MUST sync their clocks via NTP/NTS before operational mode.\n * Max drift tolerance ±5 seconds.\n /\n\n/* Clock synchronization status returned by checkClockSync() /\nexport interface ClockSyncStatus {\n synchronized: boolean;\n offsetSeconds: number;\n source: string;\n}\n\n/* Thrown by assertClockSynced() when drift exceeds the allowed threshold /\nexport class ClockDriftError extends Error {\n readonly offsetSeconds: number;\n constructor(offsetSeconds: number, maxDriftSeconds: number) {\n super(\n `Clock drift too large: offset=${offsetSeconds.toFixed(3)}s > max=${maxDriftSeconds}s`\n );\n this.name = \"ClockDriftError\";\n this.offsetSeconds = offsetSeconds;\n Object.setPrototypeOf(this, ClockDriftError.prototype);\n }\n}\n\n/\n Check clock synchronization.\n \n In a browser / Node environment without access to chronyc or ntplib, we\n * perform a lightweight sanity check: compare local time against a trusted\n * time source by issuing an HTTP HEAD request and comparing the Date header.\n * Falls back to \"assumed-synced\" when running in environments where network\n * is unavailable (e.g., unit tests).\n \n Returns ClockSyncStatus with:\n * synchronized: whether drift is within ±5s\n * offsetSeconds: measured offset (positive = local is ahead)\n * source: description of what was checked\n /\nexport async function checkClockSync(\n timeServer?: string\n): Promise<ClockSyncStatus> {\n const server = timeServer ?? \"https://worldtimeapi.org/api/ip\";\n\n try {\n const before = Date.now();\n const resp = await fetch(server, { method: \"HEAD\", signal: AbortSignal.timeout(3000) });\n const after = Date.now();\n\n // Use the Date header from the response as a rough time reference\n const dateHeader = resp.headers.get(\"Date\") ?? resp.headers.get(\"date\");\n if (!dateHeader) {\n // No Date header — can't determine offset\n return {\n synchronized: true,\n offsetSeconds: 0,\n source: \"assumed (no Date header)\",\n };\n }\n\n const serverMs = new Date(dateHeader).getTime();\n if (isNaN(serverMs)) {\n return { synchronized: true, offsetSeconds: 0, source: \"assumed (unparseable Date header)\" };\n }\n\n // Use midpoint of request as estimate of server time\n const localMidpoint = (before + after) / 2;\n const offsetSeconds = (localMidpoint - serverMs) / 1000;\n const synchronized = Math.abs(offsetSeconds) <= 5;\n\n return { synchronized, offsetSeconds, source: server };\n } catch {\n // Network unavailable or timeout — assume synced (unit test / offline environment)\n return { synchronized: true, offsetSeconds: 0, source: \"assumed (network unavailable)\" };\n }\n}\n\n/\n Assert that the local clock is synchronized within maxDriftSeconds.\n \n Throws ClockDriftError if the measured offset exceeds the threshold.\n \n @param maxDriftSeconds - Maximum allowed \|offset\| in seconds (default 5)\n /\nexport async function assertClockSynced(maxDriftSeconds = 5): Promise<void> {\n const status = await checkClockSync();\n if (!status.synchronized \|\| Math.abs(status.offsetSeconds) > maxDriftSeconds) {\n throw new ClockDriftError(status.offsetSeconds, maxDriftSeconds);\n }\n}\n","/\n RCAN CONFIG_UPDATE Wire Protocol — §9.2\n \n CONFIG_UPDATE messages MUST carry config_hash, config_version, diff, and\n * rollback. Safety parameter changes MUST have safety_overrides=true AND\n * role: creator JWT.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n return `${Date.now()}-${Math.random().toString(36).slice(2)}`;\n}\n\n/* Compute a simple SHA-256-like hash of the diff for integrity checking. /\nasync function hashDiff(diff: Record<string, unknown>): Promise<string> {\n const text = JSON.stringify(diff, Object.keys(diff).sort());\n if (typeof crypto !== \"undefined\" && crypto.subtle) {\n const encoded = new TextEncoder().encode(text);\n const hashBuf = await crypto.subtle.digest(\"SHA-256\", encoded);\n return Array.from(new Uint8Array(hashBuf))\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\");\n }\n // Fallback: simple FNV-1a hex (not cryptographic but OK for tests)\n let hash = 2166136261;\n for (let i = 0; i < text.length; i++) {\n hash ^= text.charCodeAt(i);\n hash = (hash 16777619) >>> 0;\n }\n return hash.toString(16).padStart(8, \"0\");\n}\n\n/*\n Build a CONFIG_UPDATE RCANMessage.\n \n @param diff - The configuration delta to apply\n * @param scope - Authorization scope (e.g. \"config\")\n * @param rollback - The previous config snapshot for rollback\n * @param target - Target robot URI\n /\nexport async function makeConfigUpdate(\n diff: Record<string, unknown>,\n scope: string,\n rollback: Record<string, unknown>,\n target = \"rcan://local/config\",\n safetyOverrides = false\n): Promise<RCANMessage> {\n const configHash = await hashDiff(diff);\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONFIG_UPDATE\",\n target,\n params: {\n message_type: MessageType.CONFIG,\n diff,\n rollback,\n scope,\n config_hash: configHash,\n safety_overrides: safetyOverrides,\n },\n });\n}\n\n/\n Validate a CONFIG_UPDATE message.\n \n Checks:\n * - params.diff is present\n * - params.config_hash is present\n * - params.rollback is present\n * - if safety_overrides=true, scope must be \"creator\"\n /\nexport function validateConfigUpdate(\n msg: RCANMessage\n): { valid: boolean; reason: string } {\n const p = msg.params;\n\n if (!p.diff \|\| typeof p.diff !== \"object\") {\n return { valid: false, reason: \"missing required field: params.diff\" };\n }\n if (!p.config_hash \|\| typeof p.config_hash !== \"string\") {\n return { valid: false, reason: \"missing required field: params.config_hash\" };\n }\n if (!(\"rollback\" in p)) {\n return { valid: false, reason: \"missing required field: params.rollback\" };\n }\n if (p.safety_overrides === true && p.scope !== \"creator\") {\n return {\n valid: false,\n reason: \"safety_overrides=true requires scope=creator (owner is insufficient)\",\n };\n }\n\n return { valid: true, reason: \"ok\" };\n}\n","/\n RCAN Key Rotation — §8.6\n \n Operators SHOULD maintain a JWKS at /.well-known/rcan-keys.json.\n * Keys MUST include an exp field (max 365-day validity).\n * Rotation: add new key, set exp on old key.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n return `${Date.now()}-${Math.random().toString(36).slice(2)}`;\n}\n\nexport interface JWKEntry {\n kid: string;\n alg: string;\n use: string;\n key_ops?: string[];\n /* Public key material (base64url) /\n x?: string;\n /* Unix timestamp — when this key expires /\n exp?: number;\n /* Unix timestamp — when this key was revoked (optional) /\n revoked_at?: number;\n}\n\nexport interface JWKSDocument {\n keys: JWKEntry[];\n}\n\n/\n KeyStore — in-memory JWKS with rotation support.\n /\nexport class KeyStore {\n private _keys: JWKEntry[] = [];\n\n /* Add a key to the store /\n addKey(entry: JWKEntry): void {\n this._keys.push(entry);\n }\n\n /* Get the current JWKS document (all non-revoked keys) /\n getJWKS(): JWKSDocument {\n return { keys: [...this._keys] };\n }\n\n /* Find a key by kid /\n findKey(kid: string): JWKEntry \| undefined {\n return this._keys.find((k) => k.kid === kid);\n }\n\n /* Check if a key is valid (not expired, not revoked) /\n isKeyValid(kid: string, nowMs?: number): boolean {\n const entry = this.findKey(kid);\n if (!entry) return false;\n const now = (nowMs ?? Date.now()) / 1000;\n if (entry.revoked_at !== undefined && entry.revoked_at <= now) return false;\n if (entry.exp !== undefined && entry.exp < now) return false;\n return true;\n }\n\n /* Mark a key as expired (rotate out) /\n expireKey(kid: string, expiresAt?: number): void {\n const entry = this.findKey(kid);\n if (entry) {\n entry.exp = expiresAt ?? Math.floor(Date.now() / 1000);\n }\n }\n\n /* Revoke a key immediately /\n revokeKey(kid: string): void {\n const entry = this.findKey(kid);\n if (entry) {\n entry.revoked_at = Math.floor(Date.now() / 1000);\n }\n }\n\n /* All valid keys (not expired, not revoked) /\n validKeys(nowMs?: number): JWKEntry[] {\n return this._keys.filter((k) => this.isKeyValid(k.kid, nowMs));\n }\n}\n\n/\n Build a key-rotation RCAN message.\n \n @param newPublicKey - Base64url-encoded new Ed25519 public key\n * @param oldKeyId - kid of the key being rotated out\n * @param overlapSeconds - How long old key remains valid (default: 120)\n * @param target - Target robot URI\n /\nexport function makeKeyRotationMessage(\n newPublicKey: string,\n oldKeyId: string,\n overlapSeconds = 120,\n target = \"rcan://local/keys\"\n): RCANMessage {\n const newKid = generateId().slice(0, 8);\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"KEY_ROTATION\",\n target,\n params: {\n message_type: MessageType.CONFIG,\n new_public_key: newPublicKey,\n new_kid: newKid,\n old_kid: oldKeyId,\n overlap_seconds: overlapSeconds,\n initiated_at: new Date().toISOString(),\n },\n keyId: newKid,\n });\n}\n","/\n RCAN Consent Wire Protocol — §11.2\n \n Three message types:\n * CONSENT_REQUEST (20) — requester asks target's owner for access\n * CONSENT_GRANT (21) — owner approves\n * CONSENT_DENY (22) — owner denies\n \n API mirrors rcan-py consent module exactly (camelCased).\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nfunction generateId(): string {\n if (typeof crypto !== \"undefined\" && typeof crypto.randomUUID === \"function\") {\n return crypto.randomUUID();\n }\n return `${Date.now()}-${Math.random().toString(36).slice(2)}`;\n}\n\nexport type ConsentType = \"cross_robot\" \| \"training_data\" \| \"observer\";\n\nexport interface ConsentRequestParams {\n requesterRuri: string;\n requesterOwner: string;\n targetRuri: string;\n requestedScopes: string[];\n durationHours: number;\n justification: string;\n requestId?: string;\n consentType?: ConsentType;\n dataCategories?: string[];\n}\n\nexport interface ConsentResponseParams {\n requestId: string;\n grantedScopes?: string[];\n expiresAt?: string;\n reason?: string;\n}\n\n/\n Build a CONSENT_REQUEST message.\n \n Mirrors rcan-py: build_consent_request()\n /\nexport function makeConsentRequest(params: ConsentRequestParams): RCANMessage {\n const requestId = params.requestId ?? generateId();\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONSENT_REQUEST\",\n target: params.targetRuri,\n params: {\n message_type: MessageType.CONSENT_REQUEST,\n requester_ruri: params.requesterRuri,\n requester_owner: params.requesterOwner,\n target_ruri: params.targetRuri,\n requested_scopes: params.requestedScopes,\n duration_hours: params.durationHours,\n justification: params.justification,\n request_id: requestId,\n consent_type: params.consentType ?? \"cross_robot\",\n data_categories: params.dataCategories ?? [],\n },\n });\n}\n\n/\n Build a CONSENT_GRANT message.\n \n Mirrors rcan-py: build_consent_grant()\n /\nexport function makeConsentGrant(params: ConsentResponseParams): RCANMessage {\n const expiresAt =\n params.expiresAt ?? new Date(Date.now() + 24 3600 * 1000).toISOString();\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONSENT_GRANT\",\n target: \"rcan://local/consent\",\n params: {\n message_type: MessageType.CONSENT_GRANT,\n request_id: params.requestId,\n granted_scopes: params.grantedScopes ?? [],\n expires_at: expiresAt,\n reason: params.reason ?? \"approved\",\n },\n });\n}\n\n/*\n Build a CONSENT_DENY message.\n \n Mirrors rcan-py: build_consent_deny()\n /\nexport function makeConsentDeny(params: ConsentResponseParams): RCANMessage {\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"CONSENT_DENY\",\n target: \"rcan://local/consent\",\n params: {\n message_type: MessageType.CONSENT_DENY,\n request_id: params.requestId,\n reason: params.reason ?? \"denied\",\n },\n });\n}\n\n/\n Validate a consent message (CONSENT_REQUEST, CONSENT_GRANT, or CONSENT_DENY).\n \n Mirrors rcan-py: verify_consent_signature() (structure check only — JWT\n * signature verification is performed by the auth layer).\n /\nexport function validateConsentMessage(\n msg: RCANMessage\n): { valid: boolean; reason: string } {\n const cmd = msg.cmd;\n const p = msg.params;\n const msgType = p.message_type as number \| undefined;\n\n if (cmd === \"CONSENT_REQUEST\") {\n if (msgType !== MessageType.CONSENT_REQUEST) {\n return { valid: false, reason: \"message_type must be CONSENT_REQUEST (20)\" };\n }\n if (!p.requester_ruri) return { valid: false, reason: \"missing requester_ruri\" };\n if (!p.target_ruri) return { valid: false, reason: \"missing target_ruri\" };\n if (!p.requested_scopes \|\| !Array.isArray(p.requested_scopes) \|\| (p.requested_scopes as string[]).length === 0) {\n return { valid: false, reason: \"requested_scopes must be a non-empty array\" };\n }\n if (!p.request_id) return { valid: false, reason: \"missing request_id\" };\n if (!p.justification) return { valid: false, reason: \"missing justification\" };\n return { valid: true, reason: \"ok\" };\n }\n\n if (cmd === \"CONSENT_GRANT\") {\n if (msgType !== MessageType.CONSENT_GRANT) {\n return { valid: false, reason: \"message_type must be CONSENT_GRANT (21)\" };\n }\n if (!p.request_id) return { valid: false, reason: \"missing request_id\" };\n if (!p.expires_at) return { valid: false, reason: \"missing expires_at\" };\n return { valid: true, reason: \"ok\" };\n }\n\n if (cmd === \"CONSENT_DENY\") {\n if (msgType !== MessageType.CONSENT_DENY) {\n return { valid: false, reason: \"message_type must be CONSENT_DENY (22)\" };\n }\n if (!p.request_id) return { valid: false, reason: \"missing request_id\" };\n return { valid: true, reason: \"ok\" };\n }\n\n return { valid: false, reason: `unknown consent command: ${cmd}` };\n}\n","/\n RCAN Robot Identity Revocation — §13\n \n Registry exposes GET /api/v1/robots/{rrn}/revocation-status.\n * Peers cache results with 1h TTL.\n * ROBOT_REVOCATION (19) broadcast invalidates cached trust material.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nexport type RevocationStatusValue = \"active\" \| \"revoked\" \| \"suspended\";\n\nexport interface RevocationStatus {\n rrn: string;\n status: RevocationStatusValue;\n revokedAt?: string;\n reason?: string;\n authority?: string;\n /* When this cached entry expires /\n cachedUntil?: number;\n}\n\nconst CACHE_TTL_MS = 60 60 * 1000; // 1 hour\n\n/*\n RevocationCache — TTL-based cache for revocation status records.\n /\nexport class RevocationCache {\n private readonly _cache: Map<string, RevocationStatus> = new Map();\n\n /* Get a cached status if still fresh /\n get(rrn: string, nowMs?: number): RevocationStatus \| undefined {\n const entry = this._cache.get(rrn);\n if (!entry) return undefined;\n const now = nowMs ?? Date.now();\n if (entry.cachedUntil !== undefined && entry.cachedUntil < now) {\n this._cache.delete(rrn);\n return undefined;\n }\n return entry;\n }\n\n /* Store a status record with a 1h TTL /\n set(status: RevocationStatus, nowMs?: number): void {\n const now = nowMs ?? Date.now();\n this._cache.set(status.rrn, {\n ...status,\n cachedUntil: now + CACHE_TTL_MS,\n });\n }\n\n /* Invalidate a cached entry immediately /\n invalidate(rrn: string): void {\n this._cache.delete(rrn);\n }\n\n /* Number of cached entries /\n get size(): number {\n return this._cache.size;\n }\n}\n\n/\n Check the revocation status of a robot via the registry REST API.\n * Caches results for 1 hour.\n \n @param rrn - Robot Registry Number\n * @param registryUrl - Base URL of the registry (e.g. \"https://registry.rcan.dev\")\n * @param cache - Optional RevocationCache to use (creates ephemeral one if not provided)\n /\nexport async function checkRevocation(\n rrn: string,\n registryUrl: string,\n cache?: RevocationCache\n): Promise<RevocationStatus> {\n const c = cache ?? new RevocationCache();\n\n // Check cache first\n const cached = c.get(rrn);\n if (cached) return cached;\n\n const url = `${registryUrl.replace(/\\/$/, \"\")}/api/v1/robots/${encodeURIComponent(rrn)}/revocation-status`;\n\n try {\n const resp = await fetch(url, { signal: AbortSignal.timeout(5000) });\n if (!resp.ok) {\n // Treat non-200 as unable to determine — return active (fail-open, log separately)\n const status: RevocationStatus = { rrn, status: \"active\", reason: `registry returned ${resp.status}` };\n c.set(status);\n return status;\n }\n const data = (await resp.json()) as Partial<RevocationStatus>;\n const status: RevocationStatus = {\n rrn,\n status: (data.status as RevocationStatusValue) ?? \"active\",\n revokedAt: data.revokedAt,\n reason: data.reason,\n authority: data.authority,\n };\n c.set(status);\n return status;\n } catch {\n // Network unavailable — assume active (offline mode)\n const status: RevocationStatus = { rrn, status: \"active\", reason: \"network unavailable\" };\n return status;\n }\n}\n\n/\n Build a ROBOT_REVOCATION broadcast message.\n \n @param rrn - The RRN being revoked\n * @param reason - Human-readable revocation reason\n /\nexport function makeRevocationBroadcast(\n rrn: string,\n reason: string\n): RCANMessage {\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"ROBOT_REVOCATION\",\n target: \"rcan://broadcast/revocation\",\n params: {\n message_type: MessageType.ROBOT_REVOCATION,\n rrn,\n reason,\n revoked_at: new Date().toISOString(),\n },\n });\n}\n","/\n RCAN Training Data Consent — §17\n \n Any TRAINING_DATA collection involving biometric/audio/visual data MUST\n * first obtain a DATA_CONSENT token via CONSENT_REQUEST with\n * consent_type: \"training_data\".\n \n EU AI Act Annex III §5 compliance.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { makeConsentRequest, makeConsentGrant, makeConsentDeny } from \"./consent.js\";\nimport { SPEC_VERSION } from \"./version.js\";\nimport type { ConsentResponseParams } from \"./consent.js\";\n\n/* §17 — Data categories that require training consent /\nexport enum DataCategory {\n VIDEO = \"video\",\n AUDIO = \"audio\",\n LOCATION = \"location\",\n BIOMETRIC = \"biometric\",\n TELEMETRY = \"telemetry\",\n}\n\nexport interface TrainingConsentRequestParams {\n requesterRuri: string;\n requesterOwner: string;\n targetRuri: string;\n dataCategories: DataCategory[];\n durationHours: number;\n justification: string;\n requestId?: string;\n}\n\n/\n Build a training-data consent request.\n * Sets consent_type: \"training_data\" automatically.\n \n Mirrors rcan-py: request_training_consent()\n /\nexport function makeTrainingConsentRequest(\n params: TrainingConsentRequestParams\n): RCANMessage {\n return makeConsentRequest({\n requesterRuri: params.requesterRuri,\n requesterOwner: params.requesterOwner,\n targetRuri: params.targetRuri,\n requestedScopes: [\"training_data\"],\n durationHours: params.durationHours,\n justification: params.justification,\n requestId: params.requestId,\n consentType: \"training_data\",\n dataCategories: params.dataCategories,\n });\n}\n\n/\n Build a training-data consent grant.\n \n Mirrors rcan-py: build_consent_grant() for training scope.\n /\nexport function makeTrainingConsentGrant(\n params: ConsentResponseParams\n): RCANMessage {\n return makeConsentGrant(params);\n}\n\n/\n Build a training-data consent denial.\n \n Mirrors rcan-py: build_consent_deny() for training scope.\n /\nexport function makeTrainingConsentDeny(\n params: ConsentResponseParams\n): RCANMessage {\n return makeConsentDeny(params);\n}\n\n/\n Validate that a TRAINING_DATA message carries a consent_token.\n \n A TRAINING_DATA message without consent_token MUST be rejected.\n /\nexport function validateTrainingDataMessage(\n msg: RCANMessage\n): { valid: boolean; reason: string } {\n if (msg.params.message_type !== MessageType.TRAINING_DATA) {\n return { valid: false, reason: \"not a TRAINING_DATA message\" };\n }\n const token = msg.params.consent_token;\n if (!token \|\| typeof token !== \"string\" \|\| token.trim() === \"\") {\n return {\n valid: false,\n reason: \"TRAINING_DATA message missing consent_token (§17)\",\n };\n }\n return { valid: true, reason: \"ok\" };\n}\n","/\n RCAN Offline Operation Mode — §14\n \n Robots MUST cache registry public keys locally (max TTL 24h).\n * Owner-role tokens accepted from local network when registry unreachable.\n * Cross-owner commands blocked after offline_cross_owner_grace_s (default 3600s).\n * ESTOP is ALWAYS accepted in offline mode per Protocol 66 safety invariants.\n /\n\nimport type { SafetyMessage } from \"./safety.js\";\n\nconst SAFETY_MESSAGE_TYPE = 6;\nconst DEFAULT_CROSS_OWNER_GRACE_S = 3600;\nconst DEFAULT_KEY_TTL_S = 86400;\n\nexport interface OfflineState {\n isOffline: boolean;\n offlineSinceMs?: number;\n localNetwork: boolean;\n}\n\nexport interface OfflineCommandResult {\n allowed: boolean;\n reason: string;\n}\n\nexport interface CachedKey {\n kid: string;\n publicKey: string;\n cachedAtMs: number;\n ttlSeconds: number;\n}\n\n/\n OfflineModeManager — controls what commands are accepted when offline.\n \n Protocol 66 invariants respected:\n * - ESTOP is ALWAYS allowed, regardless of offline mode\n * - Owner-level commands from local network: allowed within grace period\n * - Cross-owner commands: blocked after crossOwnerGraceS\n /\nexport class OfflineModeManager {\n private readonly crossOwnerGraceS: number;\n private readonly keyTtlS: number;\n private _cachedKeys: CachedKey[] = [];\n\n constructor(\n crossOwnerGraceS: number = DEFAULT_CROSS_OWNER_GRACE_S,\n keyTtlS: number = DEFAULT_KEY_TTL_S\n ) {\n this.crossOwnerGraceS = crossOwnerGraceS;\n this.keyTtlS = keyTtlS;\n }\n\n /\n Determine whether a command can be accepted in the current offline state.\n \n @param msg - The incoming message (SafetyMessage or plain object with message_type)\n * @param isOffline - Whether we are currently in offline mode\n * @param localNetwork - Whether the sender is on the local network\n * @param isOwner - Whether the sender has owner-level role (validated locally)\n * @param isCrossOwner - Whether this is a cross-owner (non-same-owner) command\n * @param nowMs - Optional current time in ms (for testing)\n /\n canAcceptCommand(\n msg: { message_type?: number; safety_event?: string } \| null,\n isOffline: boolean,\n localNetwork: boolean,\n isOwner = true,\n isCrossOwner = false,\n offlineSinceMs?: number,\n nowMs?: number\n ): OfflineCommandResult {\n // Protocol 66: ESTOP is ALWAYS allowed\n if (\n msg &&\n msg.message_type === SAFETY_MESSAGE_TYPE &&\n msg.safety_event === \"ESTOP\"\n ) {\n return { allowed: true, reason: \"ESTOP always accepted (Protocol 66)\" };\n }\n\n if (!isOffline) {\n return { allowed: true, reason: \"online mode\" };\n }\n\n // Offline mode\n if (!localNetwork) {\n return {\n allowed: false,\n reason: \"offline mode: cross-network commands blocked\",\n };\n }\n\n if (!isOwner) {\n return {\n allowed: false,\n reason: \"offline mode: only owner-role commands accepted from local network\",\n };\n }\n\n // Cross-owner grace period check\n if (isCrossOwner && offlineSinceMs !== undefined) {\n const now = nowMs ?? Date.now();\n const offlineSeconds = (now - offlineSinceMs) / 1000;\n if (offlineSeconds > this.crossOwnerGraceS) {\n return {\n allowed: false,\n reason: `offline mode: cross-owner grace period expired (${Math.round(offlineSeconds)}s > ${this.crossOwnerGraceS}s)`,\n };\n }\n }\n\n return {\n allowed: true,\n reason: \"offline mode: owner command on local network accepted\",\n };\n }\n\n /* Cache a public key for offline use /\n cacheKey(entry: Omit<CachedKey, \"cachedAtMs\" \| \"ttlSeconds\">, nowMs?: number): void {\n const now = nowMs ?? Date.now();\n // Remove existing entry for same kid\n this._cachedKeys = this._cachedKeys.filter((k) => k.kid !== entry.kid);\n this._cachedKeys.push({\n ...entry,\n cachedAtMs: now,\n ttlSeconds: this.keyTtlS,\n });\n }\n\n /* Get a cached public key if still valid /\n getCachedKey(kid: string, nowMs?: number): CachedKey \| undefined {\n const now = nowMs ?? Date.now();\n const entry = this._cachedKeys.find((k) => k.kid === kid);\n if (!entry) return undefined;\n const age = (now - entry.cachedAtMs) / 1000;\n if (age > entry.ttlSeconds) {\n this._cachedKeys = this._cachedKeys.filter((k) => k.kid !== kid);\n return undefined;\n }\n return entry;\n }\n\n /* Protocol 66 manifest fields for offline mode /\n getManifestFields(\n offlineSinceMs?: number,\n nowMs?: number\n ): { offline_mode: boolean; offline_since_s: number } {\n if (offlineSinceMs === undefined) {\n return { offline_mode: false, offline_since_s: 0 };\n }\n const now = nowMs ?? Date.now();\n return {\n offline_mode: true,\n offline_since_s: Math.round((now - offlineSinceMs) / 1000),\n };\n }\n}\n","/\n RCAN Structured Fault Reporting — §16\n \n FAULT_REPORT (26) carries structured information about robot faults.\n * Safety-affecting faults MUST update Protocol 66 manifest.\n /\n\nimport { RCANMessage, MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\nexport type FaultSeverity = \"info\" \| \"warning\" \| \"error\" \| \"critical\";\n\n/* Standard fault code taxonomy — prefixed by subsystem /\nexport enum FaultCode {\n // Sensor subsystem\n SENSOR_PROXIMITY_FAILURE = \"SENSOR_PROXIMITY_FAILURE\",\n SENSOR_CAMERA_FAILURE = \"SENSOR_CAMERA_FAILURE\",\n SENSOR_IMU_FAILURE = \"SENSOR_IMU_FAILURE\",\n // Motor subsystem\n MOTOR_OVERCURRENT = \"MOTOR_OVERCURRENT\",\n MOTOR_OVERTEMP = \"MOTOR_OVERTEMP\",\n MOTOR_STALL = \"MOTOR_STALL\",\n // Battery subsystem\n BATTERY_CRITICAL = \"BATTERY_CRITICAL\",\n BATTERY_LOW = \"BATTERY_LOW\",\n // Network subsystem\n NETWORK_TIMEOUT = \"NETWORK_TIMEOUT\",\n NETWORK_REGISTRY_UNREACHABLE = \"NETWORK_REGISTRY_UNREACHABLE\",\n // Safety subsystem\n SAFETY_ESTOP_STUCK = \"SAFETY_ESTOP_STUCK\",\n SAFETY_WATCHDOG_TIMEOUT = \"SAFETY_WATCHDOG_TIMEOUT\",\n // Generic\n UNKNOWN = \"UNKNOWN\",\n}\n\nexport interface FaultReportParams {\n faultCode: FaultCode \| string;\n severity: FaultSeverity;\n subsystem: string;\n affectsSafety: boolean;\n safeToContinue: boolean;\n description?: string;\n target?: string;\n}\n\n/\n Build a FAULT_REPORT message.\n \n Mirrors rcan-py: make_fault_report()\n /\nexport function makeFaultReport(params: FaultReportParams): RCANMessage {\n return new RCANMessage({\n rcan: SPEC_VERSION,\n cmd: \"FAULT_REPORT\",\n target: params.target ?? \"rcan://local/fault\",\n params: {\n message_type: MessageType.FAULT_REPORT,\n fault_code: params.faultCode,\n severity: params.severity,\n subsystem: params.subsystem,\n affects_safety: params.affectsSafety,\n safe_to_continue: params.safeToContinue,\n description: params.description ?? \"\",\n reported_at: new Date().toISOString(),\n },\n });\n}\n\n/* §16 — Audit export request interface /\nexport interface AuditExportRequest {\n from: Date;\n to: Date;\n format: \"jsonl\" \| \"csv\";\n robotRrn?: string;\n}\n","/\n rcan/identity — RCAN v2.1 Role-Based Access Control and Identity.\n \n Defines the seven-level role hierarchy (§2), JWT claim parsing, scope\n * validation, and identity record types.\n \n Roles (v2.1):\n * GUEST (JWT 1) — read-only, anonymous\n * OPERATOR (JWT 2) — operational control\n * CONTRIBUTOR (JWT 2.5) — idle compute donation scope\n * ADMIN (JWT 3) — configuration, user management\n * M2M_PEER (JWT 4) — robot-to-robot; issued by ADMIN\n * CREATOR (JWT 5) — full hardware/software control\n * M2M_TRUSTED (JWT 6) — fleet orchestration; RRF-issued only\n \n Spec: §2 — Role-Based Access Control\n /\n\n// ---------------------------------------------------------------------------\n// Role enum (v2.1)\n// ---------------------------------------------------------------------------\n\n/* RCAN v2.1 role hierarchy. Use ROLE_JWT_LEVEL to map to JWT level values. /\nexport enum Role {\n GUEST = 1,\n OPERATOR = 2,\n CONTRIBUTOR = 3, // JWT level 2.5\n ADMIN = 4, // JWT level 3\n M2M_PEER = 5, // JWT level 4\n CREATOR = 6, // JWT level 5\n M2M_TRUSTED = 7, // JWT level 6 — RRF-issued only\n}\n\n/* @deprecated Use Role instead. Kept for v1.x backward compatibility. /\nexport const LevelOfAssurance = Role;\n// eslint-disable-next-line @typescript-eslint/no-redeclare\nexport type LevelOfAssurance = Role;\n\n/* Maps Role enum value to JWT rcan_role level (fractional for CONTRIBUTOR). /\nexport const ROLE_JWT_LEVEL: Record<Role, number> = {\n [Role.GUEST]: 1.0,\n [Role.OPERATOR]: 2.0,\n [Role.CONTRIBUTOR]: 2.5,\n [Role.ADMIN]: 3.0,\n [Role.M2M_PEER]: 4.0,\n [Role.CREATOR]: 5.0,\n [Role.M2M_TRUSTED]: 6.0,\n};\n\nconst JWT_LEVEL_TO_ROLE: Map<number, Role> = new Map(\n (Object.entries(ROLE_JWT_LEVEL) as [string, number][]).map(\n ([role, level]) => [level, Number(role) as Role]\n )\n);\n\n/* Return the Role for a JWT rcan_role numeric level, or undefined. /\nexport function roleFromJwtLevel(level: number): Role \| undefined {\n return JWT_LEVEL_TO_ROLE.get(level);\n}\n\n// ---------------------------------------------------------------------------\n// Scope → minimum role mapping\n// ---------------------------------------------------------------------------\n\nexport const SCOPE_MIN_ROLE: Record<string, Role> = {\n \"status\": Role.GUEST,\n \"discover\": Role.GUEST,\n \"chat\": Role.GUEST,\n \"observer\": Role.GUEST,\n \"contribute\": Role.CONTRIBUTOR,\n \"control\": Role.OPERATOR,\n \"teleop\": Role.OPERATOR,\n \"training\": Role.ADMIN,\n \"training_data\": Role.ADMIN,\n \"config\": Role.ADMIN,\n \"authority\": Role.ADMIN,\n \"admin\": Role.CREATOR,\n \"safety\": Role.CREATOR,\n \"estop\": Role.CREATOR,\n \"fleet.trusted\": Role.M2M_TRUSTED,\n};\n\n// ---------------------------------------------------------------------------\n// Identity record\n// ---------------------------------------------------------------------------\n\nexport interface IdentityRecord {\n /* Subject identifier (UUID, RRN, or orchestrator id). /\n sub: string;\n /* RCAN v2.1 Role. /\n role: Role;\n /* JWT-level value for this role. /\n jwtLevel: number;\n /* Registry that issued this identity. /\n registryUrl?: string;\n /* Granted scopes. /\n scopes: string[];\n /* UTC ISO-8601 timestamp of most recent verification. /\n verifiedAt?: string;\n /* For M2M_PEER tokens — the authorized peer's RRN. /\n peerRrn?: string;\n /* For M2M_TRUSTED tokens — explicit fleet allowlist. /\n fleetRrns?: string[];\n}\n\nexport function isM2mIdentity(identity: IdentityRecord): boolean {\n return identity.role === Role.M2M_PEER \|\| identity.role === Role.M2M_TRUSTED;\n}\n\n// ---------------------------------------------------------------------------\n// LoA Policy (v2.1)\n// ---------------------------------------------------------------------------\n\nexport interface LoaPolicy {\n minRoleForDiscover: Role;\n minRoleForStatus: Role;\n minRoleForChat: Role;\n minRoleForControl: Role;\n minRoleForSafety: Role;\n}\n\n/* Backward-compatible default policy — every scope accepts GUEST callers. /\nexport const DEFAULT_LOA_POLICY: LoaPolicy = {\n minRoleForDiscover: Role.GUEST,\n minRoleForStatus: Role.GUEST,\n minRoleForChat: Role.GUEST,\n minRoleForControl: Role.GUEST,\n minRoleForSafety: Role.GUEST,\n};\n\n/* Production-hardened policy — control needs OPERATOR, safety needs CREATOR. /\nexport const PRODUCTION_LOA_POLICY: LoaPolicy = {\n minRoleForDiscover: Role.GUEST,\n minRoleForStatus: Role.GUEST,\n minRoleForChat: Role.GUEST,\n minRoleForControl: Role.OPERATOR,\n minRoleForSafety: Role.CREATOR,\n};\n\n// ---------------------------------------------------------------------------\n// JWT helpers\n// ---------------------------------------------------------------------------\n\nfunction decodeJwtPayload(token: string): Record<string, unknown> \| null {\n try {\n const parts = token.split('.');\n if (parts.length < 2) return null;\n const payloadB64 = (parts[1] ?? '').replace(/-/g, '+').replace(/_/g, '/');\n const padded = payloadB64 + '='.repeat((4 - payloadB64.length % 4) % 4);\n return JSON.parse(atob(padded)) as Record<string, unknown>;\n } catch {\n return null;\n }\n}\n\n/\n Parse an RCAN v2.1 JWT and return the Role.\n \n Reads `rcan_role` (v2.1) with fallback to `loa` (v1.x).\n * Defaults to GUEST on parse failure.\n /\nexport function extractRoleFromJwt(token: string): Role {\n const payload = decodeJwtPayload(token);\n if (!payload) return Role.GUEST;\n\n // v2.1: rcan_role (float level)\n const rcanRole = payload['rcan_role'];\n if (rcanRole !== undefined && rcanRole !== null) {\n const role = roleFromJwtLevel(Number(rcanRole));\n if (role !== undefined) return role;\n }\n\n // v1.x fallback: loa (integer)\n const loa = payload['loa'];\n if (loa !== undefined && loa !== null) {\n const role = roleFromJwtLevel(Number(loa));\n if (role !== undefined) return role;\n }\n\n return Role.GUEST;\n}\n\n/* @deprecated Use extractRoleFromJwt. Kept for v1.x backward compatibility. /\nexport function extractLoaFromJwt(token: string): Role {\n return extractRoleFromJwt(token);\n}\n\n/\n Parse an RCAN v2.1 JWT and return a full IdentityRecord.\n \n Does NOT verify the JWT signature.\n /\nexport function extractIdentityFromJwt(token: string): IdentityRecord {\n const payload = decodeJwtPayload(token);\n if (!payload) {\n return { sub: '', role: Role.GUEST, jwtLevel: 1, scopes: [] };\n }\n\n const rcanRole = payload['rcan_role'];\n const loa = payload['loa'];\n const rawLevel = rcanRole !== undefined ? Number(rcanRole) : loa !== undefined ? Number(loa) : 1;\n const role = roleFromJwtLevel(rawLevel) ?? Role.GUEST;\n\n const scopes = Array.isArray(payload['rcan_scopes'])\n ? (payload['rcan_scopes'] as string[])\n : Array.isArray(payload['scopes'])\n ? (payload['scopes'] as string[])\n : [];\n\n return {\n sub: String(payload['sub'] ?? ''),\n role,\n jwtLevel: ROLE_JWT_LEVEL[role],\n registryUrl: payload['registry_url'] as string \| undefined,\n scopes,\n verifiedAt: payload['verified_at'] as string \| undefined,\n peerRrn: payload['peer_rrn'] as string \| undefined,\n fleetRrns: Array.isArray(payload['fleet_rrns'])\n ? (payload['fleet_rrns'] as string[])\n : undefined,\n };\n}\n\n// ---------------------------------------------------------------------------\n// Scope validation\n// ---------------------------------------------------------------------------\n\nexport interface ScopeValidationResult {\n ok: boolean;\n reason: string;\n}\n\n/\n Check whether `role` meets the minimum requirement for `scope`.\n /\nexport function validateRoleForScope(role: Role, scope: string): ScopeValidationResult {\n const required = SCOPE_MIN_ROLE[scope.toLowerCase()];\n if (required === undefined) {\n // Unknown scope — apply OPERATOR as a safe default\n if (role >= Role.OPERATOR) return { ok: true, reason: '' };\n return {\n ok: false,\n reason: `Unknown scope '${scope}': applying OPERATOR minimum. Caller has ${Role[role]}.`,\n };\n }\n if (role >= required) return { ok: true, reason: '' };\n return {\n ok: false,\n reason: `Scope '${scope}' requires ${Role[required]} (JWT level ${ROLE_JWT_LEVEL[required]}), but caller has ${Role[role]} (JWT level ${ROLE_JWT_LEVEL[role]})`,\n };\n}\n\n/* @deprecated Use validateRoleForScope. /\nexport function validateLoaForScope(role: Role, scope: string): ScopeValidationResult {\n return validateRoleForScope(role, scope);\n}\n","/\n RCAN Federation — cross-registry trust and sync (GAP-16).\n \n Provides:\n * - Registry tier model (root / authoritative / community)\n * - TrustAnchorCache with 24-hour TTL and DNS-TXT discovery\n * - JWT verification against a trusted registry\n * - Cross-registry command validation (LoA ≥ 2 required; ESTOP always allowed)\n /\n\nimport { RCANMessage, MessageType } from './message.js';\nimport { Role, LevelOfAssurance, extractLoaFromJwt } from './identity.js';\n\n// ── Enums & interfaces ────────────────────────────────────────────────────────\n\nexport enum RegistryTier {\n ROOT = 'root',\n AUTHORITATIVE = 'authoritative',\n COMMUNITY = 'community',\n}\n\nexport enum FederationSyncType {\n CONSENT = 'consent',\n REVOCATION = 'revocation',\n KEY = 'key',\n}\n\nexport interface RegistryIdentity {\n registryUrl: string;\n tier: RegistryTier;\n publicKeyPem: string;\n domain: string;\n verifiedAt?: string;\n}\n\nexport interface FederationSyncPayload {\n sourceRegistry: string;\n targetRegistry: string;\n syncType: FederationSyncType;\n payload: Record<string, unknown>;\n signature: string;\n}\n\n// ── TrustAnchorCache ──────────────────────────────────────────────────────────\n\nconst CACHE_TTL_MS = 24 60 * 60 * 1000; // 24 hours\n\ninterface CacheEntry {\n identity: RegistryIdentity;\n expiresAt: number;\n}\n\n/*\n In-memory cache of trusted registry identities.\n \n Entries expire after 24 hours. Discovery via DNS TXT records\n * (_rcan-registry.<domain>) is supported in Node.js environments.\n /\nexport class TrustAnchorCache {\n private readonly store = new Map<string, CacheEntry>();\n\n /* Store or refresh a registry identity. /\n set(identity: RegistryIdentity): void {\n this.store.set(identity.registryUrl, {\n identity,\n expiresAt: Date.now() + CACHE_TTL_MS,\n });\n }\n\n /\n Look up a registry URL.\n * Returns undefined when absent or when the TTL has expired.\n /\n lookup(url: string): RegistryIdentity \| undefined {\n const entry = this.store.get(url);\n if (!entry) return undefined;\n if (Date.now() > entry.expiresAt) {\n this.store.delete(url);\n return undefined;\n }\n return entry.identity;\n }\n\n /\n Discover a registry via DNS TXT record `_rcan-registry.<domain>`.\n \n The TXT record is expected to contain a JSON object with the\n * RegistryIdentity fields. Returns the identity and caches it.\n \n Node.js only — returns undefined in environments without `dns.promises`.\n /\n async discoverViaDns(domain: string): Promise<RegistryIdentity \| undefined> {\n const hostname = `_rcan-registry.${domain}`;\n let records: string[][];\n\n try {\n // Dynamic require keeps this tree-shakable and browser-safe\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n const dnsModule = require('dns') as { promises: { resolveTxt: (h: string) => Promise<string[][]> } };\n records = await dnsModule.promises.resolveTxt(hostname);\n } catch {\n return undefined;\n }\n\n // Flatten the chunked TXT records into a single string per record\n for (const record of records) {\n const text = record.join('');\n try {\n const parsed = JSON.parse(text) as Partial<RegistryIdentity>;\n if (\n parsed.registryUrl &&\n parsed.tier &&\n parsed.publicKeyPem &&\n parsed.domain\n ) {\n const identity: RegistryIdentity = {\n registryUrl: parsed.registryUrl,\n tier: parsed.tier,\n publicKeyPem: parsed.publicKeyPem,\n domain: parsed.domain,\n verifiedAt: new Date().toISOString(),\n };\n this.set(identity);\n return identity;\n }\n } catch {\n // not JSON — skip\n }\n }\n return undefined;\n }\n\n /\n Verify a JWT was issued by the registry at `url`.\n \n Validates the `iss` claim and checks the registry is in the trust cache.\n * Full cryptographic signature verification requires the registry's public\n * key material — callers should perform additional checks using `publicKeyPem`\n * from the returned identity.\n /\n async verifyRegistryJwt(\n token: string,\n url: string,\n ): Promise<RegistryIdentity> {\n const identity = this.lookup(url);\n if (!identity) {\n throw new Error(`REGISTRY_UNKNOWN: ${url} is not in the trust cache`);\n }\n\n // Decode claims (structural check — no crypto signature here)\n let iss: string \| undefined;\n try {\n const parts = token.split('.');\n const payloadB64 = (parts[1] ?? '').replace(/-/g, '+').replace(/_/g, '/');\n const padded = payloadB64 + '='.repeat((4 - (payloadB64.length % 4)) % 4);\n let json: string;\n if (typeof atob !== 'undefined') {\n json = atob(padded);\n } else {\n json = Buffer.from(padded, 'base64').toString('utf-8');\n }\n const claims = JSON.parse(json) as Record<string, unknown>;\n iss = typeof claims['iss'] === 'string' ? claims['iss'] : undefined;\n } catch {\n throw new Error('REGISTRY_JWT_MALFORMED: cannot decode token payload');\n }\n\n if (iss !== url) {\n throw new Error(\n `REGISTRY_JWT_ISS_MISMATCH: expected iss=${url}, got iss=${iss ?? '(none)'}`,\n );\n }\n\n return identity;\n }\n}\n\n// ── Factory helpers ───────────────────────────────────────────────────────────\n\nfunction generateId(): string {\n if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n return crypto.randomUUID();\n }\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = ((bytes[6] ?? 0) & 0x0f) \| 0x40;\n bytes[8] = ((bytes[8] ?? 0) & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, '0'));\n return `${hex.slice(0, 4).join('')}-${hex.slice(4, 6).join('')}-${hex.slice(6, 8).join('')}-${hex.slice(8, 10).join('')}-${hex.slice(10).join('')}`;\n}\n\n/*\n Build a FEDERATION_SYNC message (MessageType 12).\n /\nexport function makeFederationSync(\n source: string,\n target: string,\n syncType: FederationSyncType,\n payload: FederationSyncPayload,\n): RCANMessage {\n return new RCANMessage({\n rcan: '2.1.0',\n rcanVersion: '2.1.0',\n cmd: 'federation_sync',\n target,\n params: {\n msg_type: MessageType.FLEET_COMMAND,\n msg_id: generateId(),\n source_registry: source,\n target_registry: target,\n sync_type: syncType,\n payload,\n },\n timestamp: new Date().toISOString(),\n });\n}\n\n// ── Cross-registry command validation ────────────────────────────────────────\n\n/\n Validate a cross-registry command against the local trust anchor cache.\n \n Rules:\n * - ESTOP (SAFETY type 6 or cmd=estop) always returns valid (P66 invariant).\n * - All other cross-registry commands require LoA ≥ 2 (EMAIL_VERIFIED).\n * - If the message originates from `localRegistry` it is not cross-registry.\n /\nexport async function validateCrossRegistryCommand(\n msg: RCANMessage,\n localRegistry: string,\n trustCache: TrustAnchorCache,\n): Promise<{ valid: boolean; reason: string }> {\n // P66: ESTOP is never blocked\n const msgType = msg.params?.['msg_type'];\n const isEstop =\n msgType === MessageType.SAFETY \|\|\n msgType === 6 \|\|\n msg.cmd === 'estop' \|\|\n msg.cmd === 'ESTOP';\n\n if (isEstop) {\n return { valid: true, reason: 'ESTOP always permitted (P66 invariant)' };\n }\n\n // Extract source registry from params\n const sourceRegistry = (msg.params?.['source_registry'] as string \| undefined) ??\n (msg.params?.['from_registry'] as string \| undefined);\n\n if (!sourceRegistry \|\| sourceRegistry === localRegistry) {\n // Local message — not cross-registry\n return { valid: true, reason: 'local registry; no federation check needed' };\n }\n\n // Must be a known trust anchor\n const identity = trustCache.lookup(sourceRegistry);\n if (!identity) {\n return {\n valid: false,\n reason: `REGISTRY_UNKNOWN: ${sourceRegistry} is not in the local trust cache`,\n };\n }\n\n // Check LoA — prefer JWT in params, fall back to message loa field\n let loa: LevelOfAssurance = Role.GUEST;\n const registryJwt = msg.params?.['registry_jwt'] as string \| undefined;\n if (registryJwt) {\n loa = extractLoaFromJwt(registryJwt);\n } else if (typeof msg.loa === 'number') {\n loa = msg.loa as LevelOfAssurance;\n }\n\n if (loa < Role.OPERATOR) {\n return {\n valid: false,\n reason: `LOA_INSUFFICIENT: cross-registry commands require LoA>=2 (OPERATOR), got role=${loa}`,\n };\n }\n\n return { valid: true, reason: 'cross-registry command accepted' };\n}\n","/\n RCAN Constrained-Transport Encodings — GAP-17.\n \n Provides compact JSON, 32-byte minimal (ESTOP-only), BLE frame fragmentation,\n * and a transport-selection helper. No external runtime dependencies.\n /\n\nimport { RCANMessage } from './message.js';\n\n// ── Error ─────────────────────────────────────────────────────────────────────\n\nexport class TransportError extends Error {\n constructor(message: string) {\n super(message);\n this.name = 'TransportError';\n Object.setPrototypeOf(this, TransportError.prototype);\n }\n}\n\n// ── Enum ──────────────────────────────────────────────────────────────────────\n\nexport enum TransportEncoding {\n HTTP = 'http',\n COMPACT = 'compact',\n MINIMAL = 'minimal',\n BLE = 'ble',\n}\n\n// ── Compact encoding ──────────────────────────────────────────────────────────\n\n/\n Abbreviated field name map (full → short).\n \n msg_type → t, msg_id → i, timestamp → ts,\n * from_rrn → f, to_rrn → to, scope → s,\n * payload → p, signature → sig\n /\nconst COMPACT_ENCODE: Record<string, string> = {\n msg_type: 't',\n msg_id: 'i',\n timestamp: 'ts',\n from_rrn: 'f',\n to_rrn: 'to',\n scope: 's',\n payload: 'p',\n signature: 'sig',\n};\n\nconst COMPACT_DECODE: Record<string, string> = Object.fromEntries(\n Object.entries(COMPACT_ENCODE).map(([k, v]) => [v, k]),\n);\n\n/* Serialize a RCANMessage to compact JSON bytes. /\nexport function encodeCompact(message: RCANMessage): Uint8Array {\n const full = message.toJSON();\n const compact: Record<string, unknown> = {};\n\n for (const [key, value] of Object.entries(full)) {\n const short = COMPACT_ENCODE[key];\n compact[short ?? key] = value;\n }\n\n // Also abbreviate top-level RCAN-specific fields used in params\n if (compact['p'] && typeof compact['p'] === 'object') {\n const params = compact['p'] as Record<string, unknown>;\n const compactParams: Record<string, unknown> = {};\n for (const [k, v] of Object.entries(params)) {\n const short = COMPACT_ENCODE[k];\n compactParams[short ?? k] = v;\n }\n compact['p'] = compactParams;\n }\n\n const json = JSON.stringify(compact);\n const encoder = new TextEncoder();\n return encoder.encode(json);\n}\n\n/* Deserialize compact JSON bytes to a RCANMessage. /\nexport function decodeCompact(data: Uint8Array): RCANMessage {\n const decoder = new TextDecoder();\n const json = decoder.decode(data);\n const compact = JSON.parse(json) as Record<string, unknown>;\n\n // Expand abbreviated keys back to full names\n const full: Record<string, unknown> = {};\n for (const [key, value] of Object.entries(compact)) {\n const long = COMPACT_DECODE[key];\n full[long ?? key] = value;\n }\n\n // Expand params too\n if (full['payload'] && typeof full['payload'] === 'object') {\n const params = full['payload'] as Record<string, unknown>;\n const expandedParams: Record<string, unknown> = {};\n for (const [k, v] of Object.entries(params)) {\n const long = COMPACT_DECODE[k];\n expandedParams[long ?? k] = v;\n }\n full['payload'] = expandedParams;\n }\n\n // Map compact top-level fields to RCANMessage constructor fields\n return new RCANMessage({\n rcan: (full['rcan'] as string \| undefined) ?? '1.6',\n rcanVersion: (full['rcanVersion'] as string \| undefined),\n cmd: (full['cmd'] as string),\n target: (full['target'] as string),\n params: (full['params'] as Record<string, unknown>) ?? (full['payload'] as Record<string, unknown>) ?? {},\n timestamp: (full['timestamp'] as string \| undefined),\n confidence: (full['confidence'] as number \| undefined),\n signature: (full['signature'] as import('./message.js').SignatureBlock \| undefined),\n });\n}\n\n// ── Minimal encoding (32 bytes, ESTOP only) ───────────────────────────────────\n\nconst MINIMAL_SIZE = 32;\nconst SAFETY_TYPE = 6;\n\n/\n Hash a UTF-8 string using SHA-256 (Web Crypto API, built-in Node 18+).\n * Returns the raw 32-byte digest.\n /\nasync function sha256Bytes(input: string): Promise<Uint8Array> {\n const encoded = new TextEncoder().encode(input);\n const ab = new ArrayBuffer(encoded.byteLength);\n new Uint8Array(ab).set(encoded);\n // Use globalThis.crypto (Node 18+) or fall back to node:crypto webcrypto\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const subtle: SubtleCrypto = (globalThis as any).crypto?.subtle\n ?? (await import('node:crypto' as string)).webcrypto.subtle;\n const hashBuffer = await subtle.digest('SHA-256', ab);\n return new Uint8Array(hashBuffer);\n}\n\n/\n Encode a SAFETY (type 6) message to a 32-byte minimal frame.\n \n Layout: [2B type][8B from_hash][8B to_hash][4B unix32][8B sig_truncated][2B checksum]\n \n - Only SAFETY (type 6) messages are accepted; throws `TransportError` for others.\n * - Runtime assertion: output MUST be exactly 32 bytes.\n /\nexport async function encodeMinimal(message: RCANMessage): Promise<Uint8Array> {\n const msgType = (message.params?.['msg_type'] as number \| undefined) ?? 0;\n if (msgType !== SAFETY_TYPE) {\n throw new TransportError(\n `encodeMinimal only supports SAFETY (type 6) messages; got type=${msgType}`,\n );\n }\n\n const fromRrn = (message.params?.['from_rrn'] as string \| undefined) ?? message.target ?? '';\n const toRrn = (message.params?.['to_rrn'] as string \| undefined) ?? message.target ?? '';\n\n const fromHash = await sha256Bytes(fromRrn); // 32 bytes, take first 8\n const toHash = await sha256Bytes(toRrn); // 32 bytes, take first 8\n\n const sig = (message.signature?.sig ?? '').replace(/[^A-Za-z0-9+/=]/g, '');\n let sigBytes: Uint8Array;\n try {\n if (typeof atob !== 'undefined') {\n const raw = atob(sig.slice(0, 16));\n sigBytes = new Uint8Array(raw.length);\n for (let i = 0; i < raw.length; i++) sigBytes[i] = raw.charCodeAt(i);\n } else {\n sigBytes = Buffer.from(sig.slice(0, 16), 'base64');\n }\n } catch {\n sigBytes = new Uint8Array(8);\n }\n\n // Parse timestamp to unix32 (seconds)\n const ts = message.timestamp ? Math.floor(new Date(message.timestamp).getTime() / 1000) : Math.floor(Date.now() / 1000);\n const unix32 = ts >>> 0; // clamp to uint32\n\n const out = new Uint8Array(MINIMAL_SIZE);\n const view = new DataView(out.buffer);\n\n // [0..1] type (2 bytes)\n view.setUint16(0, SAFETY_TYPE, false);\n // [2..9] from_hash (8 bytes)\n out.set(fromHash.subarray(0, 8), 2);\n // [10..17] to_hash (8 bytes)\n out.set(toHash.subarray(0, 8), 10);\n // [18..21] unix32 (4 bytes)\n view.setUint32(18, unix32, false);\n // [22..29] sig_truncated (8 bytes)\n const sigSlice = new Uint8Array(8);\n sigSlice.set(sigBytes.subarray(0, Math.min(8, sigBytes.length)));\n out.set(sigSlice, 22);\n // [30..31] checksum (2 bytes) — simple XOR-16 of bytes 0..29\n let checksum = 0;\n for (let i = 0; i < 30; i++) checksum ^= (out[i] ?? 0);\n view.setUint16(30, checksum & 0xffff, false);\n\n // Runtime assertion\n if (out.length !== MINIMAL_SIZE) {\n throw new TransportError(\n `encodeMinimal assertion failed: expected ${MINIMAL_SIZE} bytes, got ${out.length}`,\n );\n }\n\n return out;\n}\n\n/\n Decode a 32-byte minimal frame to a partial RCANMessage.\n /\nexport function decodeMinimal(data: Uint8Array): Partial<RCANMessage> {\n if (data.length !== MINIMAL_SIZE) {\n throw new TransportError(\n `decodeMinimal: expected ${MINIMAL_SIZE} bytes, got ${data.length}`,\n );\n }\n\n const view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n const msgType = view.getUint16(0, false);\n const fromHash = data.subarray(2, 10);\n const toHash = data.subarray(10, 18);\n const unix32 = view.getUint32(18, false);\n const sigTrunc = data.subarray(22, 30);\n // checksum at [30..31] — not verified here (structural decode only)\n\n const timestamp = new Date(unix32 1000).toISOString();\n const toHex = (b: Uint8Array) => Array.from(b).map(x => x.toString(16).padStart(2, '0')).join('');\n\n return {\n params: {\n msg_type: msgType,\n from_hash: toHex(fromHash),\n to_hash: toHex(toHash),\n timestamp_s: unix32,\n sig_truncated: toHex(sigTrunc),\n },\n timestamp,\n } as unknown as Partial<RCANMessage>;\n}\n\n// ── BLE frame fragmentation ───────────────────────────────────────────────────\n\nconst DEFAULT_MTU = 251;\n// 3-byte header: [1B frame_index][1B total_frames][1B flags (bit0=isFinal)]\nconst BLE_HEADER_SIZE = 3;\n\n/*\n Fragment a RCANMessage into BLE advertisement frames.\n * Compact JSON encoding is used for the payload; each chunk is ≤ `mtu` bytes.\n /\nexport function encodeBleFrames(message: RCANMessage, mtu: number = DEFAULT_MTU): Uint8Array[] {\n const payload = encodeCompact(message);\n const chunkSize = mtu - BLE_HEADER_SIZE;\n\n if (chunkSize <= 0) {\n throw new TransportError(`MTU ${mtu} is too small (need at least ${BLE_HEADER_SIZE + 1})`);\n }\n\n const totalChunks = Math.ceil(payload.length / chunkSize);\n const frames: Uint8Array[] = [];\n\n for (let i = 0; i < totalChunks; i++) {\n const chunk = payload.subarray(i chunkSize, (i + 1) * chunkSize);\n const frame = new Uint8Array(BLE_HEADER_SIZE + chunk.length);\n frame[0] = i; // frame index\n frame[1] = totalChunks; // total frames\n frame[2] = i === totalChunks - 1 ? 0x01 : 0x00; // flags: bit0 = isFinal\n frame.set(chunk, BLE_HEADER_SIZE);\n frames.push(frame);\n }\n\n return frames;\n}\n\n/*\n Reassemble BLE frames (in order) into a RCANMessage.\n /\nexport function decodeBleFrames(frames: Uint8Array[]): RCANMessage {\n if (frames.length === 0) {\n throw new TransportError('decodeBleFrames: no frames provided');\n }\n\n // Sort by frame index (byte 0)\n const sorted = [...frames].sort((a, b) => (a[0] ?? 0) - (b[0] ?? 0));\n\n // Validate total count consistency\n const expectedTotal = sorted[0]?.[1] ?? sorted.length;\n if (sorted.length !== expectedTotal) {\n throw new TransportError(\n `decodeBleFrames: expected ${expectedTotal} frames, got ${sorted.length}`,\n );\n }\n\n // Concatenate payload bytes (skip 3-byte header)\n const payloadChunks = sorted.map(f => f.subarray(BLE_HEADER_SIZE));\n const totalLen = payloadChunks.reduce((s, c) => s + c.length, 0);\n const payload = new Uint8Array(totalLen);\n let offset = 0;\n for (const chunk of payloadChunks) {\n payload.set(chunk, offset);\n offset += chunk.length;\n }\n\n return decodeCompact(payload);\n}\n\n// ── Transport selection ───────────────────────────────────────────────────────\n\n/\n Select the most appropriate transport encoding from an availability list.\n \n Priority:\n * - SAFETY (type 6) messages: prefer MINIMAL → BLE → COMPACT → HTTP\n * - All others: prefer HTTP → COMPACT → BLE\n /\nexport function selectTransport(\n available: TransportEncoding[],\n message: RCANMessage,\n): TransportEncoding {\n const msgType = (message.params?.['msg_type'] as number \| undefined) ?? 0;\n const isSafety = msgType === SAFETY_TYPE;\n\n const has = (enc: TransportEncoding) => available.includes(enc);\n\n if (isSafety) {\n if (has(TransportEncoding.MINIMAL)) return TransportEncoding.MINIMAL;\n if (has(TransportEncoding.BLE)) return TransportEncoding.BLE;\n if (has(TransportEncoding.COMPACT)) return TransportEncoding.COMPACT;\n if (has(TransportEncoding.HTTP)) return TransportEncoding.HTTP;\n } else {\n if (has(TransportEncoding.HTTP)) return TransportEncoding.HTTP;\n if (has(TransportEncoding.COMPACT)) return TransportEncoding.COMPACT;\n if (has(TransportEncoding.BLE)) return TransportEncoding.BLE;\n }\n\n throw new TransportError(\n `No suitable transport available from: [${available.join(', ')}]`,\n );\n}\n","/\n RCAN Multi-modal Data — GAP-18.\n \n Provides inline and by-reference media attachment for RCANMessage,\n * streaming chunk helpers, and training-data message construction.\n * SHA-256 is computed via the Web Crypto API (built-in Node 18+).\n /\n\nimport { RCANMessage, MessageType } from './message.js';\n\n// ── Enums & interfaces ────────────────────────────────────────────────────────\n\nexport enum MediaEncoding {\n BASE64 = 'base64',\n REF = 'ref',\n}\n\nexport interface MediaChunk {\n chunkId: string;\n mimeType: string;\n encoding: MediaEncoding;\n hashSha256: string;\n dataB64?: string;\n refUrl?: string;\n sizeBytes: number;\n}\n\nexport interface StreamChunk {\n streamId: string;\n chunkIndex: number;\n isFinal: boolean;\n chunk: MediaChunk;\n}\n\n// ── Helpers ───────────────────────────────────────────────────────────────────\n\nfunction generateId(): string {\n if (typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function') {\n return crypto.randomUUID();\n }\n const bytes = Array.from({ length: 16 }, () => Math.floor(Math.random() 256));\n bytes[6] = ((bytes[6] ?? 0) & 0x0f) \| 0x40;\n bytes[8] = ((bytes[8] ?? 0) & 0x3f) \| 0x80;\n const hex = bytes.map((b) => b.toString(16).padStart(2, '0'));\n return `${hex.slice(0, 4).join('')}-${hex.slice(4, 6).join('')}-${hex.slice(6, 8).join('')}-${hex.slice(8, 10).join('')}-${hex.slice(10).join('')}`;\n}\n\nasync function computeSha256Hex(data: Uint8Array): Promise<string> {\n // Use globalThis.crypto (Node 18+) or fall back to node:crypto webcrypto.\n // Bare `crypto` is not available in all Jest/Node environments.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const subtle: SubtleCrypto = (globalThis as any).crypto?.subtle\n ?? (await import('node:crypto' as string)).webcrypto.subtle;\n const ab = new ArrayBuffer(data.byteLength);\n new Uint8Array(ab).set(data);\n const hashBuffer = await subtle.digest('SHA-256', ab);\n const hashArray = new Uint8Array(hashBuffer);\n return Array.from(hashArray).map(b => b.toString(16).padStart(2, '0')).join('');\n}\n\nfunction uint8ToBase64(data: Uint8Array): string {\n if (typeof Buffer !== 'undefined') {\n return Buffer.from(data).toString('base64');\n }\n // Browser path\n let binary = '';\n for (let i = 0; i < data.length; i++) binary += String.fromCharCode(data[i] ?? 0);\n return btoa(binary);\n}\n\n/*\n Rebuild a RCANMessage from its toJSON() output with an overridden field.\n * We use RCANMessage.fromJSON which accepts Record<string, unknown>.\n /\nfunction rebuildMessage(\n base: RCANMessage,\n overrides: Record<string, unknown>,\n): RCANMessage {\n const data = { ...base.toJSON(), ...overrides };\n return RCANMessage.fromJSON(data as Record<string, unknown>);\n}\n\n// ── Core attachment helpers ───────────────────────────────────────────────────\n\n/\n Attach inline (base64-encoded) media to a message.\n * SHA-256 is computed via Web Crypto API.\n /\nexport async function addMediaInline(\n message: RCANMessage,\n data: Uint8Array,\n mimeType: string,\n): Promise<RCANMessage> {\n const hashSha256 = await computeSha256Hex(data);\n const dataB64 = uint8ToBase64(data);\n\n const chunk: MediaChunk = {\n chunkId: generateId(),\n mimeType,\n encoding: MediaEncoding.BASE64,\n hashSha256,\n dataB64,\n sizeBytes: data.length,\n };\n\n const existing = (message.mediaChunks as unknown as MediaChunk[] \| undefined) ?? [];\n return rebuildMessage(message, { mediaChunks: [...existing, chunk] });\n}\n\n/\n Attach a media reference (URL + pre-computed hash) to a message.\n /\nexport function addMediaRef(\n message: RCANMessage,\n refUrl: string,\n mimeType: string,\n hashSha256: string,\n sizeBytes: number,\n): RCANMessage {\n const chunk: MediaChunk = {\n chunkId: generateId(),\n mimeType,\n encoding: MediaEncoding.REF,\n hashSha256,\n refUrl,\n sizeBytes,\n };\n\n const existing = (message.mediaChunks as unknown as MediaChunk[] \| undefined) ?? [];\n return rebuildMessage(message, { mediaChunks: [...existing, chunk] });\n}\n\n/\n Validate media chunks on a message.\n * Checks that inline chunks have dataB64 and ref chunks have refUrl.\n /\nexport async function validateMediaChunks(\n message: RCANMessage,\n): Promise<{ valid: boolean; reason: string }> {\n const chunks = (message.mediaChunks as unknown as MediaChunk[] \| undefined) ?? [];\n\n if (chunks.length === 0) {\n return { valid: true, reason: 'no media chunks' };\n }\n\n for (let i = 0; i < chunks.length; i++) {\n const chunk = chunks[i]!;\n\n if (!chunk.chunkId) return { valid: false, reason: `chunk[${i}]: missing chunkId` };\n if (!chunk.mimeType) return { valid: false, reason: `chunk[${i}]: missing mimeType` };\n if (!chunk.hashSha256) return { valid: false, reason: `chunk[${i}]: missing hashSha256` };\n if (chunk.sizeBytes < 0) return { valid: false, reason: `chunk[${i}]: sizeBytes must be >= 0` };\n\n if (chunk.encoding === MediaEncoding.BASE64) {\n if (!chunk.dataB64) {\n return { valid: false, reason: `chunk[${i}]: BASE64 encoding requires dataB64` };\n }\n // Verify hash\n let decoded: Uint8Array;\n try {\n if (typeof Buffer !== 'undefined') {\n decoded = Buffer.from(chunk.dataB64, 'base64');\n } else {\n const raw = atob(chunk.dataB64);\n decoded = new Uint8Array(raw.length);\n for (let j = 0; j < raw.length; j++) decoded[j] = raw.charCodeAt(j);\n }\n } catch {\n return { valid: false, reason: `chunk[${i}]: failed to decode base64 data` };\n }\n const actualHash = await computeSha256Hex(decoded);\n if (actualHash !== chunk.hashSha256) {\n return {\n valid: false,\n reason: `chunk[${i}]: SHA-256 mismatch (expected ${chunk.hashSha256}, got ${actualHash})`,\n };\n }\n } else if (chunk.encoding === MediaEncoding.REF) {\n if (!chunk.refUrl) {\n return { valid: false, reason: `chunk[${i}]: REF encoding requires refUrl` };\n }\n } else {\n return { valid: false, reason: `chunk[${i}]: unknown encoding '${chunk.encoding as string}'` };\n }\n }\n\n return { valid: true, reason: 'ok' };\n}\n\n// ── Training data & streaming helpers ────────────────────────────────────────\n\n/\n Build a TRAINING_DATA message (MessageType 10) with multiple media attachments.\n /\nexport async function makeTrainingDataMessage(\n media: Array<{ data: Uint8Array; mimeType: string }>,\n): Promise<RCANMessage> {\n let msg = new RCANMessage({\n rcan: '1.6',\n rcanVersion: '1.6',\n cmd: 'training_data',\n target: 'rcan://training/data',\n params: {\n msg_type: MessageType.TRAINING_DATA,\n msg_id: generateId(),\n },\n timestamp: new Date().toISOString(),\n });\n\n for (const item of media) {\n msg = await addMediaInline(msg, item.data, item.mimeType);\n }\n\n return msg;\n}\n\n/\n Build a streaming chunk message wrapping a single media item.\n /\nexport async function makeStreamChunk(\n streamId: string,\n data: Uint8Array,\n mimeType: string,\n chunkIndex: number,\n isFinal: boolean,\n): Promise<RCANMessage> {\n const hashSha256 = await computeSha256Hex(data);\n const dataB64 = uint8ToBase64(data);\n\n const chunk: MediaChunk = {\n chunkId: generateId(),\n mimeType,\n encoding: MediaEncoding.BASE64,\n hashSha256,\n dataB64,\n sizeBytes: data.length,\n };\n\n const streamChunkMeta: StreamChunk = {\n streamId,\n chunkIndex,\n isFinal,\n chunk,\n };\n\n let msg = new RCANMessage({\n rcan: '1.6',\n rcanVersion: '1.6',\n cmd: 'stream_chunk',\n target: 'rcan://streaming/chunk',\n params: {\n msg_type: MessageType.SENSOR_DATA,\n msg_id: generateId(),\n stream_chunk: streamChunkMeta,\n },\n timestamp: new Date().toISOString(),\n });\n\n // Attach the chunk via mediaChunks for easy access\n msg = rebuildMessage(msg, { mediaChunks: [chunk] });\n return msg;\n}\n","/\n rcan/contribute — Idle Compute Contribution messages and scope.\n \n Implements the contribute scope and message types for RCAN v1.7+.\n * Robots can donate idle NPU/GPU/CPU compute to distributed science projects.\n \n Spec: §3 MessageTypes 33–35, Identity scope level 2.5\n /\n\nimport { MessageType } from \"./message.js\";\n\n// ── Scope ────────────────────────────────────────────────────────────────\n\n/* Contribute scope level — between chat (2) and control (3). /\nexport const CONTRIBUTE_SCOPE_LEVEL = 2.5;\n\n// ── Enums ────────────────────────────────────────────────────────────────\n\nexport type WorkUnitStatus =\n \| \"pending\"\n \| \"running\"\n \| \"completed\"\n \| \"failed\"\n \| \"cancelled\"\n \| \"preempted\";\n\nexport type ComputeResource = \"npu\" \| \"gpu\" \| \"cpu\" \| \"sensor\";\n\n// ── Message Types ────────────────────────────────────────────────────────\n\nexport interface ContributeRequest {\n type: typeof MessageType.CONTRIBUTE_REQUEST;\n request_id: string;\n project_id: string;\n project_name: string;\n work_unit_id: string;\n resource_type: ComputeResource;\n estimated_duration_s: number;\n priority: number;\n payload: Record<string, unknown>;\n timestamp: number;\n}\n\nexport interface ContributeResult {\n type: typeof MessageType.CONTRIBUTE_RESULT;\n request_id: string;\n work_unit_id: string;\n status: WorkUnitStatus;\n resource_type: ComputeResource;\n duration_s: number;\n compute_units: number;\n result_payload: Record<string, unknown>;\n error_message?: string;\n timestamp: number;\n}\n\nexport interface ContributeCancel {\n type: typeof MessageType.CONTRIBUTE_CANCEL;\n request_id: string;\n work_unit_id: string;\n reason: string;\n timestamp: number;\n}\n\n// ── Factory Functions ────────────────────────────────────────────────────\n\nlet _idCounter = 0;\n\nfunction _generateId(): string {\n return `cr-${Date.now()}-${++_idCounter}`;\n}\n\nexport function makeContributeRequest(\n params: Partial<Omit<ContributeRequest, \"type\">> = {},\n): ContributeRequest {\n return {\n type: MessageType.CONTRIBUTE_REQUEST,\n request_id: params.request_id ?? _generateId(),\n project_id: params.project_id ?? \"\",\n project_name: params.project_name ?? \"\",\n work_unit_id: params.work_unit_id ?? \"\",\n resource_type: params.resource_type ?? \"cpu\",\n estimated_duration_s: params.estimated_duration_s ?? 0,\n priority: params.priority ?? 0,\n payload: params.payload ?? {},\n timestamp: params.timestamp ?? Date.now() / 1000,\n };\n}\n\nexport function makeContributeResult(\n params: Partial<Omit<ContributeResult, \"type\">> = {},\n): ContributeResult {\n const result: ContributeResult = {\n type: MessageType.CONTRIBUTE_RESULT,\n request_id: params.request_id ?? \"\",\n work_unit_id: params.work_unit_id ?? \"\",\n status: params.status ?? \"completed\",\n resource_type: params.resource_type ?? \"cpu\",\n duration_s: params.duration_s ?? 0,\n compute_units: params.compute_units ?? 0,\n result_payload: params.result_payload ?? {},\n timestamp: params.timestamp ?? Date.now() / 1000,\n };\n if (params.error_message !== undefined) {\n result.error_message = params.error_message;\n }\n return result;\n}\n\nexport function makeContributeCancel(\n params: Partial<Omit<ContributeCancel, \"type\">> = {},\n): ContributeCancel {\n return {\n type: MessageType.CONTRIBUTE_CANCEL,\n request_id: params.request_id ?? \"\",\n work_unit_id: params.work_unit_id ?? \"\",\n reason: params.reason ?? \"\",\n timestamp: params.timestamp ?? Date.now() / 1000,\n };\n}\n\n// ── Scope Validation ────────────────────────────────────────────────────\n\n/\n Check if the given scope level permits contribute operations.\n \n Contribute requires scope >= 2.5 (between chat and control).\n /\nexport function validateContributeScope(\n scopeLevel: number,\n action: \"request\" \| \"result\" \| \"cancel\" = \"request\",\n): boolean {\n if (action === \"request\" \|\| action === \"result\") {\n return scopeLevel >= CONTRIBUTE_SCOPE_LEVEL;\n }\n if (action === \"cancel\") {\n // Cancel is permitted at chat level and above\n return scopeLevel >= 2.0;\n }\n return false;\n}\n\n/\n Check if the given scope level preempts contribution.\n \n Any scope >= control (3.0) preempts contribute immediately.\n * This is the P66 safety invariant — non-negotiable.\n /\nexport function isPreemptedBy(scopeLevel: number): boolean {\n return scopeLevel >= 3.0;\n}\n","/\n rcan/competition — Competition protocol messages and scope.\n \n Implements the competition scope and message types for RCAN v1.10+.\n * Robots can enter competitions, publish scores, receive season standings,\n * and log private personal research results.\n \n Spec: §3 MessageTypes 37–40\n /\n\nimport { MessageType } from \"./message.js\";\n\n// ── Scope ────────────────────────────────────────────────────────────────\n\n/* Competition scope level — chat-level scope (observation, not control). /\nexport const COMPETITION_SCOPE_LEVEL = 2.0;\n\n// ── Enums / Union Types ──────────────────────────────────────────────────\n\nexport type CompetitionFormat =\n \| \"sprint\"\n \| \"endurance\"\n \| \"precision\"\n \| \"efficiency\";\n\nexport type CompetitionBadge = \"gold\" \| \"silver\" \| \"bronze\" \| \"participant\";\n\nexport type RunType = \"personal\" \| \"community\";\n\n// ── Payload Types ────────────────────────────────────────────────────────\n\nexport interface StandingEntry {\n rank: number;\n rrn: string;\n score: number;\n badge: CompetitionBadge;\n}\n\nexport interface ResearchMetrics {\n success_rate: number;\n p66_rate: number;\n token_efficiency: number;\n latency_score: number;\n [key: string]: number;\n}\n\n// ── Message Interfaces ───────────────────────────────────────────────────\n\nexport interface CompetitionEnter {\n type: typeof MessageType.COMPETITION_ENTER;\n competition_id: string;\n competition_format: CompetitionFormat;\n hardware_tier: string;\n model_id: string;\n robot_rrn: string;\n entered_at: number;\n}\n\nexport interface CompetitionScore {\n type: typeof MessageType.COMPETITION_SCORE;\n competition_id: string;\n candidate_id: string;\n score: number;\n hardware_tier: string;\n verified: boolean;\n submitted_at: number;\n}\n\nexport interface SeasonStanding {\n type: typeof MessageType.SEASON_STANDING;\n season_id: string;\n class_id: string;\n standings: StandingEntry[];\n days_remaining: number;\n broadcast_at: number;\n}\n\nexport interface PersonalResearchResult {\n type: typeof MessageType.PERSONAL_RESEARCH_RESULT;\n run_id: string;\n run_type: RunType;\n candidate_id: string;\n score: number;\n hardware_tier: string;\n model_id: string;\n owner_uid: string;\n metrics: ResearchMetrics;\n submitted_to_community: boolean;\n created_at: number;\n}\n\n// ── Factory Functions ────────────────────────────────────────────────────\n\nlet _idCounter = 0;\n\nfunction _generateRunId(): string {\n return `run-${Date.now()}-${++_idCounter}`;\n}\n\nexport function makeCompetitionEnter(\n params: Partial<Omit<CompetitionEnter, \"type\">> = {},\n): CompetitionEnter {\n return {\n type: MessageType.COMPETITION_ENTER,\n competition_id: params.competition_id ?? \"\",\n competition_format: params.competition_format ?? \"sprint\",\n hardware_tier: params.hardware_tier ?? \"\",\n model_id: params.model_id ?? \"\",\n robot_rrn: params.robot_rrn ?? \"\",\n entered_at: params.entered_at ?? Date.now() / 1000,\n };\n}\n\nexport function makeCompetitionScore(\n params: Partial<Omit<CompetitionScore, \"type\">> = {},\n): CompetitionScore {\n const score = params.score ?? 0.0;\n if (score < 0.0 \|\| score > 1.0) {\n throw new Error(`score must be in [0.0, 1.0], got ${score}`);\n }\n return {\n type: MessageType.COMPETITION_SCORE,\n competition_id: params.competition_id ?? \"\",\n candidate_id: params.candidate_id ?? \"\",\n score,\n hardware_tier: params.hardware_tier ?? \"\",\n verified: params.verified ?? false,\n submitted_at: params.submitted_at ?? Date.now() / 1000,\n };\n}\n\nexport function makeSeasonStanding(\n params: Partial<Omit<SeasonStanding, \"type\">> = {},\n): SeasonStanding {\n return {\n type: MessageType.SEASON_STANDING,\n season_id: params.season_id ?? \"\",\n class_id: params.class_id ?? \"\",\n standings: params.standings ?? [],\n days_remaining: params.days_remaining ?? 0,\n broadcast_at: params.broadcast_at ?? Date.now() / 1000,\n };\n}\n\nexport function makePersonalResearchResult(\n params: Partial<Omit<PersonalResearchResult, \"type\">> = {},\n): PersonalResearchResult {\n const score = params.score ?? 0.0;\n if (score < 0.0 \|\| score > 1.0) {\n throw new Error(`score must be in [0.0, 1.0], got ${score}`);\n }\n return {\n type: MessageType.PERSONAL_RESEARCH_RESULT,\n run_id: params.run_id ?? _generateRunId(),\n run_type: params.run_type ?? \"personal\",\n candidate_id: params.candidate_id ?? \"\",\n score,\n hardware_tier: params.hardware_tier ?? \"\",\n model_id: params.model_id ?? \"\",\n owner_uid: params.owner_uid ?? \"\",\n metrics: params.metrics ?? {\n success_rate: 0,\n p66_rate: 0,\n token_efficiency: 0,\n latency_score: 0,\n },\n submitted_to_community: params.submitted_to_community ?? false,\n created_at: params.created_at ?? Date.now() / 1000,\n };\n}\n\n// ── Scope Validation ─────────────────────────────────────────────────────\n\n/\n Check if the given scope level permits competition operations.\n * Competition messages require scope >= 2.0 (chat level).\n /\nexport function validateCompetitionScope(scopeLevel: number): boolean {\n return scopeLevel >= COMPETITION_SCOPE_LEVEL;\n}\n","/\n rcan/firmware — RCAN v2.1 Firmware Manifest types and helpers.\n \n Every RCAN v2.1 robot MUST publish a signed firmware manifest at:\n * {ruri}/.well-known/rcan-firmware-manifest.json\n \n The manifest is Ed25519-signed by the manufacturer's key registered in the RRF.\n * The envelope field `firmwareHash` (field 13) carries a SHA-256 of the manifest.\n \n Spec: §11 — Firmware Manifests\n /\n\n/* Well-known endpoint path for firmware manifests. /\nexport const FIRMWARE_MANIFEST_PATH = \"/.well-known/rcan-firmware-manifest.json\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/* A single component entry in the firmware manifest. /\nexport interface FirmwareComponent {\n /* Component name, e.g. \"brain-runtime\" /\n name: string;\n /* Semantic version string /\n version: string;\n /* SHA-256 hash prefixed with \"sha256:\" /\n hash: string;\n}\n\n/* RCAN v2.1 firmware manifest. /\nexport interface FirmwareManifest {\n /* Robot Registration Number /\n rrn: string;\n /* Semver or CalVer version string /\n firmwareVersion: string;\n /* SHA-256 of the full firmware bundle, prefixed \"sha256:\" /\n buildHash: string;\n /* Per-component records /\n components: FirmwareComponent[];\n /* UTC ISO-8601 timestamp when the manifest was signed /\n signedAt: string;\n /* Ed25519 signature over canonical JSON (base64url), empty if unsigned /\n signature?: string;\n}\n\n/\n Serialized (wire) format of a firmware manifest.\n * Uses snake_case keys to match the JSON spec.\n /\nexport interface FirmwareManifestWire {\n rrn: string;\n firmware_version: string;\n build_hash: string;\n components: FirmwareComponent[];\n signed_at: string;\n signature?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Serialization helpers\n// ---------------------------------------------------------------------------\n\n/* Convert a camelCase FirmwareManifest to the wire (snake_case) format. /\nexport function manifestToWire(m: FirmwareManifest): FirmwareManifestWire {\n const wire: FirmwareManifestWire = {\n rrn: m.rrn,\n firmware_version: m.firmwareVersion,\n build_hash: m.buildHash,\n components: m.components,\n signed_at: m.signedAt,\n };\n if (m.signature) wire.signature = m.signature;\n return wire;\n}\n\n/* Parse a wire-format manifest into the typed FirmwareManifest. /\nexport function manifestFromWire(w: FirmwareManifestWire): FirmwareManifest {\n return {\n rrn: w.rrn,\n firmwareVersion: w.firmware_version,\n buildHash: w.build_hash,\n components: w.components ?? [],\n signedAt: w.signed_at ?? \"\",\n signature: w.signature,\n };\n}\n\n/\n Return the canonical JSON bytes of a manifest (no signature field, sorted keys).\n * This is the byte string that the Ed25519 signature covers.\n /\nexport function canonicalManifestJson(m: FirmwareManifest): string {\n const obj: Record<string, unknown> = {\n build_hash: m.buildHash,\n components: m.components.map(c => ({\n hash: c.hash,\n name: c.name,\n version: c.version,\n })),\n firmware_version: m.firmwareVersion,\n rrn: m.rrn,\n signed_at: m.signedAt,\n };\n // deterministic: keys are already sorted above\n return JSON.stringify(obj);\n}\n\n// ---------------------------------------------------------------------------\n// Exceptions\n// ---------------------------------------------------------------------------\n\n/* Thrown when firmware manifest signature verification fails. /\nexport class FirmwareIntegrityError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"FirmwareIntegrityError\";\n }\n}\n\n// ---------------------------------------------------------------------------\n// Validation\n// ---------------------------------------------------------------------------\n\n/* Validate a manifest structure and return a list of errors. /\nexport function validateManifest(m: FirmwareManifest): string[] {\n const errors: string[] = [];\n if (!m.rrn) errors.push(\"rrn is required\");\n if (!m.firmwareVersion) errors.push(\"firmwareVersion is required\");\n if (!m.buildHash) errors.push(\"buildHash is required\");\n if (!m.buildHash.startsWith(\"sha256:\")) errors.push(\"buildHash must start with 'sha256:'\");\n if (!m.signedAt) errors.push(\"signedAt is required\");\n if (!m.signature) errors.push(\"signature is required (manifest must be signed)\");\n for (const [i, c] of m.components.entries()) {\n if (!c.name) errors.push(`components[${i}].name is required`);\n if (!c.version) errors.push(`components[${i}].version is required`);\n if (!c.hash.startsWith(\"sha256:\")) errors.push(`components[${i}].hash must start with 'sha256:'`);\n }\n return errors;\n}\n","/\n rcan/authority — RCAN v2.1 Authority Access Protocol (EU AI Act §16(j)).\n \n Defines payload types for AUTHORITY_ACCESS (41) and AUTHORITY_RESPONSE (42)\n * message types, and helpers for building/validating authority requests.\n \n The authority access protocol enables regulatory bodies to request audit data\n * from robots under EU AI Act Article 16(j) and similar frameworks.\n \n Spec: §13 (Authority Access) — EU AI Act Art. 16 mapping\n /\n\nimport { MessageType } from \"./message.js\";\nimport { SPEC_VERSION } from \"./version.js\";\n\n// ---------------------------------------------------------------------------\n// Authority access data types\n// ---------------------------------------------------------------------------\n\n/* Allowed audit data categories that an authority may request. /\nexport type AuthorityDataCategory =\n \| \"audit_chain\"\n \| \"transparency_records\"\n \| \"sbom\"\n \| \"firmware_manifest\";\n\n/* Payload for AUTHORITY_ACCESS (41) — sent by a regulatory authority to a robot. /\nexport interface AuthorityAccessPayload {\n /* Unique request identifier (correlated in the response). /\n requestId: string;\n /* Authority identifier, e.g. \"EU-AI-ACT-NCA-DE\" /\n authorityId: string;\n /* Audit data categories requested. /\n requestedData: AuthorityDataCategory[];\n /* Human-readable justification for the request. /\n justification: string;\n /* Unix timestamp — request must be responded to before this time. /\n expiresAt: number;\n}\n\n/* Provided audit data in an AUTHORITY_RESPONSE. /\nexport interface AuthorityResponseData {\n auditChain?: unknown[];\n transparencyRecords?: unknown[];\n sbomUrl?: string;\n firmwareManifestUrl?: string;\n}\n\n/* Payload for AUTHORITY_RESPONSE (42) — sent by the robot in reply. /\nexport interface AuthorityResponsePayload {\n /* Correlates with the AUTHORITY_ACCESS requestId. /\n requestId: string;\n /* Robot Registration Number of the responding robot. /\n rrn: string;\n /* Unix timestamp when the data was packaged. /\n providedAt: number;\n /* Provided audit data. /\n data: AuthorityResponseData;\n}\n\n// ---------------------------------------------------------------------------\n// Wire-format helpers\n// ---------------------------------------------------------------------------\n\n/* Convert AuthorityAccessPayload to/from snake_case wire format. /\nexport interface AuthorityAccessPayloadWire {\n request_id: string;\n authority_id: string;\n requested_data: AuthorityDataCategory[];\n justification: string;\n expires_at: number;\n}\n\nexport function authorityAccessToWire(p: AuthorityAccessPayload): AuthorityAccessPayloadWire {\n return {\n request_id: p.requestId,\n authority_id: p.authorityId,\n requested_data: p.requestedData,\n justification: p.justification,\n expires_at: p.expiresAt,\n };\n}\n\nexport function authorityAccessFromWire(w: AuthorityAccessPayloadWire): AuthorityAccessPayload {\n return {\n requestId: w.request_id,\n authorityId: w.authority_id,\n requestedData: w.requested_data ?? [],\n justification: w.justification ?? \"\",\n expiresAt: w.expires_at ?? 0,\n };\n}\n\n// ---------------------------------------------------------------------------\n// Validation helpers\n// ---------------------------------------------------------------------------\n\n/\n Validate an authority access payload.\n * Returns an array of error strings (empty = valid).\n /\nexport function validateAuthorityAccess(p: AuthorityAccessPayload): string[] {\n const errors: string[] = [];\n if (!p.requestId) errors.push(\"requestId is required\");\n if (!p.authorityId) errors.push(\"authorityId is required\");\n if (!p.requestedData \|\| p.requestedData.length === 0)\n errors.push(\"requestedData must include at least one category\");\n if (!p.justification) errors.push(\"justification is required\");\n if (!p.expiresAt \|\| p.expiresAt <= 0) errors.push(\"expiresAt must be a positive Unix timestamp\");\n if (p.expiresAt < Date.now() / 1000) errors.push(\"expiresAt is in the past — request has expired\");\n return errors;\n}\n\n/* Return true if an AUTHORITY_ACCESS request is still within its deadline. /\nexport function isAuthorityRequestValid(p: AuthorityAccessPayload): boolean {\n return Date.now() / 1000 < p.expiresAt && validateAuthorityAccess(p).length === 0;\n}\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nexport const AUTHORITY_ERROR_CODES = {\n NOT_RECOGNIZED: \"AUTHORITY_NOT_RECOGNIZED\",\n REQUEST_EXPIRED: \"AUTHORITY_REQUEST_EXPIRED\",\n INVALID_TOKEN: \"AUTHORITY_INVALID_TOKEN\",\n RATE_LIMITED: \"AUTHORITY_RATE_LIMITED\",\n} as const;\n","/\n rcan/m2m — RCAN v2.1 Machine-to-Machine Authorization.\n \n M2M_PEER (JWT level 4): robot-to-robot, issued by ADMIN/CREATOR.\n * M2M_TRUSTED (JWT level 6): fleet orchestration, RRF-issued only.\n \n Spec: §2.8 M2M_PEER · §2.9 M2M_TRUSTED\n /\n\nimport { Role } from \"./identity.js\";\n\n// ---------------------------------------------------------------------------\n// RRF constants\n// ---------------------------------------------------------------------------\n\nexport const RRF_ROOT_PUBKEY_URL = \"https://api.rrf.rcan.dev/.well-known/rrf-root-pubkey.pem\";\nexport const RRF_REVOCATION_URL = \"https://api.rrf.rcan.dev/v2/revocations\";\nexport const M2M_TRUSTED_ISSUER = \"rrf.rcan.dev\";\n/* Revocation cache TTL in milliseconds (≤ 60 s per spec). /\nexport const RRF_REVOCATION_CACHE_TTL_MS = 55_000;\n/* Pubkey cache TTL in milliseconds. /\nexport const RRF_PUBKEY_CACHE_TTL_MS = 3_600_000;\n\n// ---------------------------------------------------------------------------\n// Claims types\n// ---------------------------------------------------------------------------\n\n/* Parsed claims from an M2M_PEER JWT. /\nexport interface M2MPeerClaims {\n /* Subject RRN of the peer robot. /\n sub: string;\n /* The robot this peer is authorized to command. /\n peerRrn: string;\n /* Authorized scopes. /\n scopes: string[];\n /* Unix expiry timestamp. /\n exp: number;\n /* Issuing principal (ADMIN or CREATOR RRN). /\n iss: string;\n}\n\n/* Parsed claims from an M2M_TRUSTED JWT (RRF-issued). /\nexport interface M2MTrustedClaims {\n /* Orchestrator identifier (not a robot RRN). /\n sub: string;\n /* Explicit allowlist of robots this token may command. /\n fleetRrns: string[];\n /* Must include \"fleet.trusted\". /\n scopes: string[];\n /* Unix expiry timestamp (max 24 h from issuance). /\n exp: number;\n /* Must be \"rrf.rcan.dev\". /\n iss: string;\n /* RRF Ed25519 signature over claims (base64url). /\n rrfSig: string;\n}\n\n// ---------------------------------------------------------------------------\n// Exceptions\n// ---------------------------------------------------------------------------\n\n/* Thrown when M2M token verification fails. /\nexport class M2MAuthError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"M2MAuthError\";\n }\n}\n\n// ---------------------------------------------------------------------------\n// JWT helpers\n// ---------------------------------------------------------------------------\n\nfunction decodeJwtPayload(token: string): Record<string, unknown> {\n const parts = token.split('.');\n if (parts.length < 2) throw new M2MAuthError(\"Invalid JWT structure\");\n const b64 = (parts[1] ?? '').replace(/-/g, '+').replace(/_/g, '/');\n const padded = b64 + '='.repeat((4 - b64.length % 4) % 4);\n try {\n return JSON.parse(atob(padded)) as Record<string, unknown>;\n } catch (e) {\n throw new M2MAuthError(`JWT payload decode failed: ${String(e)}`);\n }\n}\n\n// ---------------------------------------------------------------------------\n// M2M_PEER parsing\n// ---------------------------------------------------------------------------\n\n/\n Parse an M2M_PEER JWT without signature verification.\n * Validates expiry and required claims.\n /\nexport function parseM2mPeerToken(token: string): M2MPeerClaims {\n const payload = decodeJwtPayload(token);\n const exp = Number(payload['exp'] ?? 0);\n if (exp > 0 && Date.now() / 1000 > exp) {\n throw new M2MAuthError(`M2M_PEER token expired (sub=${String(payload['sub'])})`);\n }\n const peerRrn = String(payload['peer_rrn'] ?? '');\n if (!peerRrn) throw new M2MAuthError(\"M2M_PEER token missing peer_rrn claim\");\n\n return {\n sub: String(payload['sub'] ?? ''),\n peerRrn,\n scopes: Array.isArray(payload['rcan_scopes']) ? payload['rcan_scopes'] as string[]\n : Array.isArray(payload['scopes']) ? payload['scopes'] as string[] : [],\n exp,\n iss: String(payload['iss'] ?? ''),\n };\n}\n\n// ---------------------------------------------------------------------------\n// M2M_TRUSTED — token parsing (sync, no network)\n// ---------------------------------------------------------------------------\n\n/\n Parse an M2M_TRUSTED JWT claims WITHOUT signature verification.\n \n Checks issuer, scope, and expiry. Does not contact RRF.\n * For full verification use `verifyM2mTrustedTokenClaims`.\n /\nexport function parseM2mTrustedToken(token: string): M2MTrustedClaims {\n const payload = decodeJwtPayload(token);\n\n const iss = String(payload['iss'] ?? '');\n if (iss !== M2M_TRUSTED_ISSUER) {\n throw new M2MAuthError(\n `M2M_TRUSTED issuer must be '${M2M_TRUSTED_ISSUER}', got '${iss}'`\n );\n }\n\n const scopes: string[] = Array.isArray(payload['rcan_scopes'])\n ? payload['rcan_scopes'] as string[]\n : Array.isArray(payload['scopes']) ? payload['scopes'] as string[] : [];\n\n if (!scopes.includes('fleet.trusted')) {\n throw new M2MAuthError(\"M2M_TRUSTED token missing required 'fleet.trusted' scope\");\n }\n\n const exp = Number(payload['exp'] ?? 0);\n if (exp > 0 && Date.now() / 1000 > exp) {\n throw new M2MAuthError(`M2M_TRUSTED token expired (sub=${String(payload['sub'])})`);\n }\n\n const rrfSig = String(payload['rrf_sig'] ?? '');\n if (!rrfSig) throw new M2MAuthError(\"M2M_TRUSTED token missing rrf_sig claim\");\n\n const fleetRrns: string[] = Array.isArray(payload['fleet_rrns'])\n ? payload['fleet_rrns'] as string[] : [];\n\n return {\n sub: String(payload['sub'] ?? ''),\n fleetRrns,\n scopes,\n exp,\n iss,\n rrfSig,\n };\n}\n\n/\n Verify M2M_TRUSTED token claims and check that it authorizes `targetRrn`.\n \n This method validates claims structure only (no RRF network call).\n * In production, also check the RRF revocation list with `RRFRevocationCache`.\n /\nexport function verifyM2mTrustedTokenClaims(\n token: string,\n targetRrn: string\n): M2MTrustedClaims {\n const claims = parseM2mTrustedToken(token);\n\n if (!claims.fleetRrns.includes(targetRrn)) {\n throw new M2MAuthError(\n `M2M_TRUSTED token does not authorize commanding '${targetRrn}'. ` +\n `Authorized fleet: [${claims.fleetRrns.join(', ')}]`\n );\n }\n\n return claims;\n}\n\n// ---------------------------------------------------------------------------\n// RRF Revocation Cache (browser/Node-compatible, no native deps)\n// ---------------------------------------------------------------------------\n\ninterface RevocationCache {\n revokedOrchestrators: Set<string>;\n revokedJtis: Set<string>;\n fetchedAt: number;\n}\n\nlet _revocationCache: RevocationCache \| null = null;\n\n/\n Fetch the RRF revocation list and cache it.\n \n Uses `fetch()` (available in Node 18+ and all modern browsers).\n * TTL: 55 s (spec max: 60 s).\n /\nexport async function fetchRRFRevocations(\n url: string = RRF_REVOCATION_URL\n): Promise<RevocationCache> {\n const now = Date.now();\n if (_revocationCache && now - _revocationCache.fetchedAt < RRF_REVOCATION_CACHE_TTL_MS) {\n return _revocationCache;\n }\n\n try {\n const resp = await fetch(url, { signal: AbortSignal.timeout?.(5000) });\n const data = await resp.json() as {\n revoked_orchestrators?: string[];\n revoked_jtis?: string[];\n };\n _revocationCache = {\n revokedOrchestrators: new Set(data.revoked_orchestrators ?? []),\n revokedJtis: new Set(data.revoked_jtis ?? []),\n fetchedAt: now,\n };\n } catch {\n // Return stale cache if available, else empty\n if (_revocationCache) return _revocationCache;\n _revocationCache = { revokedOrchestrators: new Set(), revokedJtis: new Set(), fetchedAt: now };\n }\n\n return _revocationCache;\n}\n\n/\n Check whether an M2M_TRUSTED orchestrator sub is revoked.\n * Fetches the revocation list if the cache is stale.\n /\nexport async function isM2mTrustedRevoked(\n claims: M2MTrustedClaims,\n jti?: string\n): Promise<boolean> {\n const cache = await fetchRRFRevocations();\n if (cache.revokedOrchestrators.has(claims.sub)) return true;\n if (jti && cache.revokedJtis.has(jti)) return true;\n return false;\n}\n\n/\n Full async M2M_TRUSTED verification: claims check + revocation list.\n \n Note: Signature verification requires the RRF public key and is typically\n * done server-side using the rcan-py SDK or castor.auth middleware.\n /\nexport async function verifyM2mTrustedToken(\n token: string,\n targetRrn: string,\n options?: { skipRevocationCheck?: boolean }\n): Promise<M2MTrustedClaims> {\n const claims = verifyM2mTrustedTokenClaims(token, targetRrn);\n\n if (!options?.skipRevocationCheck) {\n const revoked = await isM2mTrustedRevoked(claims);\n if (revoked) {\n throw new M2MAuthError(\n `M2M_TRUSTED orchestrator '${claims.sub}' is on the RRF revocation list`\n );\n }\n }\n\n return claims;\n}\n","/\n RCAN v2.2 ML-DSA-65 Signing (NIST FIPS 204)\n \n Ed25519 is deprecated. ML-DSA-65 is the ONLY signing algorithm.\n * All signed messages carry a ``signature`` block with ``alg: \"ml-dsa-65\"``.\n \n Requires: @noble/post-quantum (npm install @noble/post-quantum)\n \n Spec: https://rcan.dev/spec/v2.2#section-7-2\n /\n\nimport type { RCANMessage, SignatureBlock } from \"./message.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface MLDSAKeyPairData {\n publicKey: Uint8Array;\n secretKey?: Uint8Array;\n keyId: string;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction toBase64url(bytes: Uint8Array): string {\n let binary = \"\";\n for (let i = 0; i < bytes.length; i++) binary += String.fromCharCode(bytes[i]!);\n return btoa(binary).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/=/g, \"\");\n}\n\nfunction fromBase64url(b64: string): Uint8Array {\n const padded = b64.replace(/-/g, \"+\").replace(/_/g, \"/\");\n const binary = atob(padded);\n const bytes = new Uint8Array(binary.length);\n for (let i = 0; i < binary.length; i++) bytes[i] = binary.charCodeAt(i);\n return bytes;\n}\n\nasync function sha256hex(data: Uint8Array): Promise<string> {\n if (typeof crypto !== \"undefined\" && crypto.subtle) {\n const buf = await crypto.subtle.digest(\"SHA-256\", data.buffer as ArrayBuffer);\n return Array.from(new Uint8Array(buf))\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\")\n .slice(0, 8);\n }\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n const { createHash } = require(\"node:crypto\") as { createHash: (alg: string) => { update: (d: Uint8Array) => { digest: (enc: string) => string } } };\n return createHash(\"sha256\").update(data).digest(\"hex\").slice(0, 8);\n}\n\nlet _mlDsaModule: { ml_dsa65: { keygen: () => { publicKey: Uint8Array; secretKey: Uint8Array }; sign: (msg: Uint8Array, sk: Uint8Array) => Uint8Array; verify: (sig: Uint8Array, msg: Uint8Array, pk: Uint8Array) => boolean } } \| undefined;\n\nasync function requireMlDsa() {\n if (_mlDsaModule) return _mlDsaModule;\n if (typeof require !== \"undefined\") {\n try {\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n _mlDsaModule = require(\"@noble/post-quantum/ml-dsa.js\") as typeof _mlDsaModule;\n return _mlDsaModule!;\n } catch { / fall through / }\n }\n try {\n _mlDsaModule = await import(\"@noble/post-quantum/ml-dsa.js\") as unknown as typeof _mlDsaModule;\n return _mlDsaModule!;\n } catch {\n throw new Error(\n \"ML-DSA-65 signing requires @noble/post-quantum. \" +\n \"Install with: npm install @noble/post-quantum\"\n );\n }\n}\n\n// ---------------------------------------------------------------------------\n// MLDSAKeyPair — the only signing key type in RCAN v2.2\n// ---------------------------------------------------------------------------\n\n/\n An ML-DSA-65 (CRYSTALS-Dilithium, NIST FIPS 204) key pair.\n \n This is the ONLY signing key type in RCAN v2.2+. Ed25519 is deprecated.\n /\nexport class MLDSAKeyPair {\n readonly keyId: string;\n readonly publicKey: Uint8Array;\n readonly secretKey: Uint8Array \| undefined;\n\n private constructor(data: MLDSAKeyPairData) {\n this.keyId = data.keyId;\n this.publicKey = data.publicKey;\n this.secretKey = data.secretKey;\n }\n\n static async generate(): Promise<MLDSAKeyPair> {\n const m = await requireMlDsa();\n const kp = m!.ml_dsa65.keygen();\n const keyId = await sha256hex(kp.publicKey);\n return new MLDSAKeyPair({ publicKey: kp.publicKey, secretKey: kp.secretKey, keyId });\n }\n\n static async fromPublicKey(publicKey: Uint8Array): Promise<MLDSAKeyPair> {\n const keyId = await sha256hex(publicKey);\n return new MLDSAKeyPair({ publicKey, keyId });\n }\n\n static async fromKeyMaterial(publicKey: Uint8Array, secretKey: Uint8Array): Promise<MLDSAKeyPair> {\n const keyId = await sha256hex(publicKey);\n return new MLDSAKeyPair({ publicKey, secretKey, keyId });\n }\n\n get hasPrivateKey(): boolean { return this.secretKey !== undefined; }\n\n async signBytes(data: Uint8Array): Promise<Uint8Array> {\n if (!this.secretKey) throw new Error(\"Cannot sign: MLDSAKeyPair has no private key (verify-only)\");\n const m = await requireMlDsa();\n return m!.ml_dsa65.sign(data, this.secretKey);\n }\n\n async verifyBytes(data: Uint8Array, signature: Uint8Array): Promise<void> {\n const m = await requireMlDsa();\n const ok = m!.ml_dsa65.verify(signature, data, this.publicKey);\n if (!ok) throw new Error(\"ML-DSA-65 signature verification failed\");\n }\n\n toString(): string {\n return `MLDSAKeyPair(keyId=${this.keyId}, alg=ML-DSA-65, ${this.hasPrivateKey ? \"private+public\" : \"public-only\"})`;\n }\n}\n\n// ---------------------------------------------------------------------------\n// Canonical message bytes\n// ---------------------------------------------------------------------------\n\nfunction canonicalMessageBytes(msg: RCANMessage): Uint8Array {\n const payload = {\n rcan: msg.rcan,\n msg_id: (msg as unknown as Record<string, unknown>)[\"msgId\"] ?? \"\",\n timestamp: msg.timestamp,\n cmd: msg.cmd,\n target: msg.target,\n params: msg.params,\n };\n return new TextEncoder().encode(\n JSON.stringify(Object.fromEntries(Object.entries(payload).sort()))\n );\n}\n\n// ---------------------------------------------------------------------------\n// sign / verify\n// ---------------------------------------------------------------------------\n\n/\n Sign an RCANMessage with ML-DSA-65 (the only signing algorithm in RCAN v2.2).\n \n Sets msg.signature = { alg: \"ml-dsa-65\", kid, sig }.\n /\nexport async function signMessage(\n msg: RCANMessage,\n keypair: MLDSAKeyPair\n): Promise<RCANMessage> {\n const payload = canonicalMessageBytes(msg);\n const rawSig = await keypair.signBytes(payload);\n (msg as unknown as Record<string, unknown>)[\"signature\"] = {\n alg: \"ml-dsa-65\",\n kid: keypair.keyId,\n sig: toBase64url(rawSig),\n } satisfies SignatureBlock;\n return msg;\n}\n\n/\n Verify the ML-DSA-65 signature on an RCANMessage.\n \n @throws {Error} if signature is missing, alg is not ml-dsa-65, key not found, or invalid.\n /\nexport async function verifyMessage(\n msg: RCANMessage,\n trustedKeys: MLDSAKeyPair[]\n): Promise<void> {\n const sig = msg.signature;\n if (!sig) throw new Error(\"Message is unsigned — signature field missing\");\n if (sig.alg !== \"ml-dsa-65\") {\n throw new Error(\n `Unsupported signature algorithm: ${sig.alg}. ` +\n \"RCAN v2.2 requires ml-dsa-65 (Ed25519 is deprecated).\"\n );\n }\n const matched = trustedKeys.find((k) => k.keyId === sig.kid);\n if (!matched) {\n throw new Error(\n `No trusted ML-DSA-65 key with kid=${sig.kid}. ` +\n `Known kids: [${trustedKeys.map((k) => k.keyId).join(\", \")}]`\n );\n }\n let rawSig: Uint8Array;\n try { rawSig = fromBase64url(sig.sig); } catch (e) { throw new Error(`Invalid base64url sig: ${e}`); }\n await matched.verifyBytes(canonicalMessageBytes(msg), rawSig);\n}\n\n// ---------------------------------------------------------------------------\n// Deprecated aliases for migration\n// ---------------------------------------------------------------------------\n\n/* @deprecated Use signMessage() — Ed25519 is removed in RCAN v2.2 /\nexport const addPQSignature = signMessage;\n\n/* @deprecated Use verifyMessage() — Ed25519 is removed in RCAN v2.2 /\nexport async function verifyPQSignature(\n msg: RCANMessage,\n trustedKeys: MLDSAKeyPair[],\n _requirePQ = true\n): Promise<void> {\n return verifyMessage(msg, trustedKeys);\n}\n","/\n rcan/mcp.ts — MCP integration types for RCAN v2.2 §22\n \n Provider-agnostic: LoA is tied to the token, not the model or AI provider.\n /\n\n/* LoA → RCAN command scopes mapping (§22.4) /\nexport const LOA_TO_SCOPES: Record<number, string[]> = {\n 0: ['discover', 'status', 'transparency'],\n 1: ['chat', 'control', 'system'],\n 3: ['system', 'safety'],\n};\n\n/* Required LoA for each MCP tool (§22.3) /\nexport const TOOL_LOA_REQUIREMENTS: Record<string, number> = {\n // Tier 0 — read\n robot_ping: 0,\n robot_status: 0,\n robot_telemetry: 0,\n fleet_list: 0,\n rrf_lookup: 0,\n compliance_report: 0,\n // Tier 1 — operate\n robot_command: 1,\n harness_get: 1,\n research_run: 1,\n contribute_toggle: 1,\n components_list: 1,\n // Tier 3 — admin\n harness_set: 3,\n system_upgrade: 3,\n loa_enable: 3,\n};\n\n/* MCP client entry stored in the RCAN yaml mcp_clients: block /\nexport interface McpClientConfig {\n name: string;\n token_hash: string; // \"sha256:<hex>\" — never the raw token\n loa: number; // 0, 1, or 3\n}\n\n/* Full MCP server configuration extracted from the RCAN yaml /\nexport interface McpServerConfig {\n rrn: string;\n clients: McpClientConfig[];\n}\n\n/* Check if a client's LoA satisfies a tool's requirement /\nexport function clientAllowsTool(client: McpClientConfig, toolName: string): boolean {\n const required = TOOL_LOA_REQUIREMENTS[toolName] ?? 99;\n return client.loa >= required;\n}\n\n/* Tool call result shapes /\nexport interface RobotStatusResult {\n rrn: string;\n status: Record<string, unknown>;\n}\n\nexport interface FleetListResult {\n fleet: Record<string, unknown>[];\n}\n\nexport interface RrfLookupResult {\n entity_id: string;\n record: Record<string, unknown>;\n}\n\nexport interface RobotCommandResult {\n rrn: string;\n instruction: string;\n scope: string;\n result: Record<string, unknown>;\n}\n\nexport interface ComplianceReportResult {\n rrn: string;\n compliance: Record<string, unknown>;\n}\n","/\n RCAN v2.2 Delegation and Media envelope types.\n * Spec: https://robotregistryfoundation.org/docs/mcp/\n /\n/* A single hop in a v2.2 delegation chain. /\nexport interface DelegationHop {\n robot_rrn: string;\n scope: string;\n issued_at: string;\n expires_at: string;\n sig?: string;\n}\n\n/* An inline or by-reference media attachment for v2.2 messages. /\nexport interface MediaChunk {\n chunk_id: string;\n mime_type: string;\n size_bytes: number;\n hash_sha256: string;\n data?: string;\n ref_url?: string;\n}\n\nexport const MAX_DELEGATION_DEPTH = 3;\n\nexport function validateDelegationChain(chain: DelegationHop[]): void {\n if (chain.length > MAX_DELEGATION_DEPTH) {\n throw new Error(\n `RCAN: delegation chain max depth is ${MAX_DELEGATION_DEPTH}, got ${chain.length}`\n );\n }\n}\n\n// Allow test environments to inject a hash function (avoids ESM/CJS require issues)\n// In production, crypto.createHash is used via dynamic detection.\n// @internal\nexport let _hashImpl: ((data: string) => string) \| undefined;\n\n/* @internal — for testing only /\nexport function _setHashImpl(fn: ((data: string) => string) \| undefined): void {\n _hashImpl = fn;\n}\n\nexport function verifyMediaChunkHash(chunk: MediaChunk): void {\n if (!chunk.data) return;\n let actual: string \| undefined;\n\n if (_hashImpl) {\n actual = _hashImpl(chunk.data);\n } else {\n try {\n // Works in Node.js CJS; skipped gracefully in pure ESM/browser\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n const m = typeof require !== \"undefined\" ? require : null;\n if (!m) return;\n const { createHash } = m(\"node:crypto\") as {\n createHash: (a: string) => { update: (d: string) => { digest: (e: string) => string } };\n };\n actual = \"sha256:\" + createHash(\"sha256\").update(chunk.data).digest(\"hex\");\n } catch {\n return; // crypto unavailable\n }\n }\n\n if (actual !== chunk.hash_sha256) {\n throw new Error(`MediaChunk hash mismatch: expected ${chunk.hash_sha256}, got ${actual}`);\n }\n}\n\n// Aliases\nexport type V22DelegationHop = DelegationHop;\nexport type V22MediaChunk = MediaChunk;\nexport { validateDelegationChain as validateV22DelegationChain };\nexport { verifyMediaChunkHash as verifyV22MediaChunkHash };\n","/\n rcan-ts — Official TypeScript SDK for RCAN v1.6\n * Robot Communication and Accountability Network\n \n @see https://rcan.dev\n * @see https://github.com/continuonai/rcan-ts\n /\n\nexport { RobotURI, RobotURIError } from \"./address.js\";\nexport type { RobotURIOptions } from \"./address.js\";\n\nexport { RCANMessage, RCANMessageError, MessageType, makeCloudRelayMessage, addDelegationHop, validateDelegationChain } from \"./message.js\";\nexport type { RCANMessageData, SignatureBlock, SenderType, DelegationHop } from \"./message.js\";\n\nexport { ConfidenceGate, HiTLGate, GateError } from \"./gates.js\";\nexport type { ApprovalStatus, PendingApproval } from \"./gates.js\";\n\nexport { CommitmentRecord, AuditChain, AuditError } from \"./audit.js\";\nexport type {\n CommitmentRecordData,\n CommitmentRecordJSON,\n ChainVerifyResult,\n} from \"./audit.js\";\n\nexport { validateURI, validateMessage, validateConfig } from \"./validate.js\";\nexport type { ValidationResult, RCANConfig } from \"./validate.js\";\nexport type { RCANMetadata, RCANAgentConfig, RCANMessageEnvelope } from \"./types.js\";\n\nexport {\n RCANError,\n RCANAddressError,\n RCANValidationError,\n RCANGateError,\n RCANSignatureError,\n RCANRegistryError,\n RCANNodeError,\n RCANNodeNotFoundError,\n RCANNodeSyncError,\n RCANNodeTrustError,\n // v1.5 errors\n RCANVersionIncompatibleError,\n RCANReplayAttackError,\n RCANDelegationChainError,\n RCANConfigAuthorizationError,\n} from \"./errors.js\";\n\nexport { RegistryClient } from \"./registry.js\";\nexport type {\n RobotRegistration,\n Robot,\n RegistrationResult,\n ListResult,\n} from \"./registry.js\";\n\nexport { NodeClient } from \"./node.js\";\nexport type { RCANRegistryNode, RCANResolveResult } from \"./types.js\";\n\nexport { fetchCanonicalSchema, validateConfigAgainstSchema, validateNodeAgainstSchema } from \"./schema.js\";\n\nexport {\n makeEstopMessage,\n makeStopMessage,\n makeResumeMessage,\n makeTransparencyMessage,\n isSafetyMessage,\n validateSafetyMessage,\n SAFETY_MESSAGE_TYPE,\n} from \"./safety.js\";\nexport type { SafetyMessage, SafetyEvent, TransparencyMessage } from \"./safety.js\";\n\n// ── v1.5: version ──────────────────────────────────────────────────────────────\nexport { SPEC_VERSION, SDK_VERSION, validateVersionCompat } from \"./version.js\";\n\n// ── v1.5: replay attack prevention (GAP-03) ────────────────────────────────────\nexport { ReplayCache, validateReplay } from \"./replay.js\";\nexport type { ReplayCheckResult, ReplayableMessage } from \"./replay.js\";\n\n// ── v1.5: clock synchronization (GAP-04) ───────────────────────────────────────\nexport { checkClockSync, assertClockSynced, ClockDriftError } from \"./clock.js\";\nexport type { ClockSyncStatus } from \"./clock.js\";\n\n// ── v1.5: QoS (GAP-11) ────────────────────────────────────────────────────────\nexport { QoSLevel, QoSManager, QoSAckTimeoutError, makeEstopWithQoS } from \"./qos.js\";\nexport type { QoSSendOptions, QoSResult } from \"./qos.js\";\n\n// ── v1.5: config update (GAP-07) ──────────────────────────────────────────────\nexport { makeConfigUpdate, validateConfigUpdate } from \"./configUpdate.js\";\n\n// ── v1.5: key rotation (GAP-09) ───────────────────────────────────────────────\nexport { KeyStore, makeKeyRotationMessage } from \"./keys.js\";\nexport type { JWKEntry, JWKSDocument } from \"./keys.js\";\n\n// ── v1.5: consent wire (GAP-05) ───────────────────────────────────────────────\nexport {\n makeConsentRequest,\n makeConsentGrant,\n makeConsentDeny,\n validateConsentMessage,\n} from \"./consent.js\";\nexport type { ConsentType, ConsentRequestParams, ConsentResponseParams } from \"./consent.js\";\n\n// ── v1.5: revocation (GAP-02) ─────────────────────────────────────────────────\nexport {\n RevocationCache,\n checkRevocation,\n makeRevocationBroadcast,\n} from \"./revocation.js\";\nexport type { RevocationStatus, RevocationStatusValue } from \"./revocation.js\";\n\n// ── v1.5: training data consent (GAP-10) ──────────────────────────────────────\nexport {\n DataCategory,\n makeTrainingConsentRequest,\n makeTrainingConsentGrant,\n makeTrainingConsentDeny,\n validateTrainingDataMessage,\n} from \"./trainingConsent.js\";\nexport type { TrainingConsentRequestParams } from \"./trainingConsent.js\";\n\n// ── v1.5: offline mode (GAP-06) ───────────────────────────────────────────────\nexport { OfflineModeManager } from \"./offline.js\";\nexport type { OfflineState, OfflineCommandResult, CachedKey } from \"./offline.js\";\n\n// ── v1.5: fault reporting (GAP-20) ────────────────────────────────────────────\nexport { FaultCode, makeFaultReport } from \"./faultReport.js\";\nexport type { FaultSeverity, FaultReportParams, AuditExportRequest } from \"./faultReport.js\";\n\n// ── v1.6 / v2.1: identity, roles & LoA (§2 RBAC) ─────────────────────────────\nexport {\n Role,\n LevelOfAssurance, // backward-compat alias for Role\n ROLE_JWT_LEVEL,\n SCOPE_MIN_ROLE,\n roleFromJwtLevel,\n DEFAULT_LOA_POLICY,\n PRODUCTION_LOA_POLICY,\n extractRoleFromJwt,\n extractLoaFromJwt, // backward-compat alias\n extractIdentityFromJwt,\n validateRoleForScope,\n validateLoaForScope,\n} from \"./identity.js\";\nexport type { LoaPolicy, IdentityRecord, ScopeValidationResult } from \"./identity.js\";\n\n// ── v1.6: federation (GAP-16) ─────────────────────────────────────────────────\nexport {\n RegistryTier,\n FederationSyncType,\n TrustAnchorCache,\n makeFederationSync,\n validateCrossRegistryCommand,\n} from \"./federation.js\";\nexport type { RegistryIdentity, FederationSyncPayload } from \"./federation.js\";\n\n// ── v1.6: transport encodings (GAP-17) ────────────────────────────────────────\nexport {\n TransportEncoding,\n TransportError,\n encodeCompact,\n decodeCompact,\n encodeMinimal,\n decodeMinimal,\n encodeBleFrames,\n decodeBleFrames,\n selectTransport,\n} from \"./transport.js\";\n\n// ── v1.6: multi-modal data (GAP-18) ───────────────────────────────────────────\nexport {\n MediaEncoding,\n addMediaInline,\n addMediaRef,\n validateMediaChunks,\n makeTrainingDataMessage,\n makeStreamChunk,\n} from \"./multimodal.js\";\nexport type { MediaChunk, StreamChunk } from \"./multimodal.js\";\n\nexport const VERSION = \"0.6.0\";\n/* @deprecated Use SPEC_VERSION from ./version instead /\nexport const RCAN_VERSION = \"1.6\";\n\nexport { makeContributeRequest, makeContributeResult, makeContributeCancel, validateContributeScope, isPreemptedBy, CONTRIBUTE_SCOPE_LEVEL } from \"./contribute\";\nexport type { ContributeRequest, ContributeResult, ContributeCancel, WorkUnitStatus, ComputeResource } from \"./contribute\";\n\n// ── v1.10: competition protocol ────────────────────────────────────────────────\nexport {\n COMPETITION_SCOPE_LEVEL,\n makeCompetitionEnter,\n makeCompetitionScore,\n makeSeasonStanding,\n makePersonalResearchResult,\n validateCompetitionScope,\n} from \"./competition.js\";\nexport type {\n CompetitionFormat,\n CompetitionBadge,\n RunType,\n StandingEntry,\n ResearchMetrics,\n CompetitionEnter,\n CompetitionScore,\n SeasonStanding,\n PersonalResearchResult,\n} from \"./competition.js\";\n\n// ── v2.1: Firmware Manifests (§11) ───────────────────────────────────────────\nexport {\n FIRMWARE_MANIFEST_PATH,\n FirmwareIntegrityError,\n manifestToWire,\n manifestFromWire,\n canonicalManifestJson,\n validateManifest,\n} from \"./firmware.js\";\nexport type {\n FirmwareComponent,\n FirmwareManifest,\n FirmwareManifestWire,\n} from \"./firmware.js\";\n\n// ── v2.1: Authority Access (§13 / EU AI Act §16) ────────────────────────────\nexport {\n AUTHORITY_ERROR_CODES,\n authorityAccessToWire,\n authorityAccessFromWire,\n validateAuthorityAccess,\n isAuthorityRequestValid,\n} from \"./authority.js\";\nexport type {\n AuthorityDataCategory,\n AuthorityAccessPayload,\n AuthorityAccessPayloadWire,\n AuthorityResponsePayload,\n AuthorityResponseData,\n} from \"./authority.js\";\n\n// ── v2.1: M2M Authorization (§2.8–§2.9) ────────────────────────────────────\nexport {\n M2MAuthError,\n M2M_TRUSTED_ISSUER,\n RRF_REVOCATION_URL,\n RRF_REVOCATION_CACHE_TTL_MS,\n parseM2mPeerToken,\n parseM2mTrustedToken,\n verifyM2mTrustedTokenClaims,\n verifyM2mTrustedToken,\n isM2mTrustedRevoked,\n fetchRRFRevocations,\n} from \"./m2m.js\";\nexport type { M2MPeerClaims, M2MTrustedClaims } from \"./m2m.js\";\n\n// v2.2: ML-DSA-65 signing (FIPS 204) — Ed25519 deprecated\nexport { MLDSAKeyPair, signMessage, verifyMessage, addPQSignature, verifyPQSignature } from \"./pqSigning.js\";\nexport type { MLDSAKeyPairData } from \"./pqSigning.js\";\n\n// v2.2: ML-DSA-65 PQC primitives + hybrid Ed25519+ML-DSA-65 (issue #40)\nexport {\n generateMlDsaKeypair,\n signMlDsa,\n verifyMlDsa,\n signHybrid,\n verifyHybrid,\n encodeHybridSig,\n decodeHybridSig,\n encodeMlDsaPublicKeyJwk,\n decodeMlDsaPublicKeyJwk,\n} from \"./crypto.js\";\nexport type { MlDsaKeyPair, HybridSignature } from \"./crypto.js\";\n\nexport from './mcp';\n\n// ── v2.2: Delegation and media envelope types ────────────────────────────────\nexport type { V22DelegationHop, V22MediaChunk } from './delegation.js';\nexport { validateV22DelegationChain, verifyV22MediaChunkHash } from './delegation.js';\n"],"mappings":";;;;;;;;;;;AAOO,IAAM,gBAAN,cAA4B,MAAM;AAAA,EACvC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAUO,IAAM,WAAN,MAAM,UAAS;AAAA,EAOZ,YAAY,MAAiC;AANrD,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAGP,SAAK,WAAW,KAAK;AACrB,SAAK,eAAe,KAAK;AACzB,SAAK,QAAQ,KAAK;AAClB,SAAK,UAAU,KAAK;AACpB,SAAK,WAAW,KAAK;AAAA,EACvB;AAAA;AAAA,EAGA,OAAO,MAAM,KAAuB;AAClC,QAAI,CAAC,IAAI,WAAW,SAAS,GAAG;AAC9B,YAAM,IAAI,cAAc,6CAAwC,GAAG,EAAE;AAAA,IACvE;AACA,UAAM,gBAAgB,IAAI,MAAM,UAAU,MAAM;AAChD,UAAM,QAAQ,cAAc,MAAM,GAAG;AACrC,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,oGAA+F,MAAM,MAAM,QAAQ,GAAG;AAAA,MACxH;AAAA,IACF;AACA,UAAM,CAAC,UAAU,cAAc,OAAO,SAAS,QAAQ,IAAI;AAC3D,eAAW,CAAC,MAAM,KAAK,KAAK;AAAA,MAC1B,CAAC,YAAY,QAAQ;AAAA,MACrB,CAAC,gBAAgB,YAAY;AAAA,MAC7B,CAAC,SAAS,KAAK;AAAA,MACf,CAAC,WAAW,OAAO;AAAA,MACnB,CAAC,aAAa,QAAQ;AAAA,IACxB,GAAyB;AACvB,UAAI,CAAC,SAAS,MAAM,KAAK,MAAM,IAAI;AACjC,cAAM,IAAI,cAAc,gBAAgB,IAAI,qBAAqB;AAAA,MACnE;AAAA,IACF;AACA,WAAO,IAAI,UAAS,EAAE,UAAU,cAAc,OAAO,SAAS,SAAS,CAAC;AAAA,EAC1E;AAAA;AAAA,EAGA,OAAO,MAAM,MAAiC;AAC5C,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,EAAE,cAAc,OAAO,SAAS,SAAS,IAAI;AACnD,eAAW,CAAC,MAAM,KAAK,KAAK;AAAA,MAC1B,CAAC,gBAAgB,YAAY;AAAA,MAC7B,CAAC,SAAS,KAAK;AAAA,MACf,CAAC,WAAW,OAAO;AAAA,MACnB,CAAC,YAAY,QAAQ;AAAA,IACvB,GAAyB;AACvB,UAAI,CAAC,SAAS,MAAM,KAAK,MAAM,IAAI;AACjC,cAAM,IAAI,cAAc,IAAI,IAAI,qBAAqB;AAAA,MACvD;AAAA,IACF;AACA,WAAO,IAAI,UAAS,EAAE,UAAU,cAAc,OAAO,SAAS,SAAS,CAAC;AAAA,EAC1E;AAAA;AAAA,EAGA,WAAmB;AACjB,WAAO,UAAU,KAAK,QAAQ,IAAI,KAAK,YAAY,IAAI,KAAK,KAAK,IAAI,KAAK,OAAO,IAAI,KAAK,QAAQ;AAAA,EACpG;AAAA;AAAA,EAGA,IAAI,YAAoB;AACtB,WAAO,GAAG,KAAK,YAAY,IAAI,KAAK,KAAK;AAAA,EAC3C;AAAA;AAAA,EAGA,IAAI,cAAsB;AACxB,WAAO,WAAW,KAAK,QAAQ,aAAa,KAAK,YAAY,IAAI,KAAK,KAAK,IAAI,KAAK,OAAO,IAAI,KAAK,QAAQ;AAAA,EAC9G;AAAA;AAAA,EAGA,OAAO,OAA0B;AAC/B,WAAO,KAAK,SAAS,MAAM,MAAM,SAAS;AAAA,EAC5C;AAAA,EAEA,SAAiB;AACf,WAAO;AAAA,MACL,KAAK,KAAK,SAAS;AAAA,MACnB,UAAU,KAAK;AAAA,MACf,cAAc,KAAK;AAAA,MACnB,OAAO,KAAK;AAAA,MACZ,SAAS,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,IACjB;AAAA,EACF;AACF;;;ACvGO,IAAM,eAAe;AAGrB,IAAM,cAAc;AAWpB,SAAS,sBACd,iBACA,eAAuB,cACd;AACT,QAAM,aAAa,CAAC,MAAgC;AAClD,UAAM,QAAQ,EAAE,MAAM,GAAG;AACzB,UAAM,QAAQ,SAAS,MAAM,CAAC,KAAK,KAAK,EAAE;AAC1C,UAAM,QAAQ,SAAS,MAAM,CAAC,KAAK,KAAK,EAAE;AAC1C,WAAO,CAAC,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK;AAAA,EAC5D;AAEA,QAAM,CAAC,OAAO,IAAI,WAAW,eAAe;AAC5C,QAAM,CAAC,UAAU,IAAI,WAAW,YAAY;AAG5C,SAAO,YAAY;AACrB;;;ACdO,IAAK,cAAL,kBAAKA,iBAAL;AAEL,EAAAA,0BAAA,aAAqB,KAArB;AACA,EAAAA,0BAAA,cAAqB,KAArB;AACA,EAAAA,0BAAA,YAAqB,KAArB;AACA,EAAAA,0BAAA,eAAqB,KAArB;AACA,EAAAA,0BAAA,YAAqB,KAArB;AACA,EAAAA,0BAAA,YAAqB,KAArB;AACA,EAAAA,0BAAA,UAAqB,KAArB;AACA,EAAAA,0BAAA,WAAqB,KAArB;AAGA,EAAAA,0BAAA,cAAqB,KAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,YAAqB,MAArB;AACA,EAAAA,0BAAA,mBAAqB,MAArB;AACA,EAAAA,0BAAA,mBAAqB,MAArB;AAGA,EAAAA,0BAAA,uBAAqB,MAArB;AACA,EAAAA,0BAAA,sBAAqB,MAArB;AAGA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,iBAAqB,MAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,sBAAqB,MAArB;AACA,EAAAA,0BAAA,qBAAqB,MAArB;AACA,EAAAA,0BAAA,mBAAqB,MAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AAGA,EAAAA,0BAAA,mBAAqB,MAArB;AACA,EAAAA,0BAAA,eAAqB,MAArB;AACA,EAAAA,0BAAA,iBAAqB,MAArB;AAGA,EAAAA,0BAAA,kBAAqB,MAArB;AACA,EAAAA,0BAAA,kBAAqB,MAArB;AACA,EAAAA,0BAAA,oBAAqB,MAArB;AAGA,EAAAA,0BAAA,iBAAqB,MAArB;AACA,EAAAA,0BAAA,8BAA2B,MAA3B;AACA,EAAAA,0BAAA,4BAA2B,MAA3B;AACA,EAAAA,0BAAA,2BAA2B,MAA3B;AAGA,EAAAA,0BAAA,wBAAqB,MAArB;AACA,EAAAA,0BAAA,uBAAqB,MAArB;AACA,EAAAA,0BAAA,uBAAqB,MAArB;AAGA,EAAAA,0BAAA,mBAAqB,MAArB;AAGA,EAAAA,0BAAA,uBAA6B,MAA7B;AACA,EAAAA,0BAAA,uBAA6B,MAA7B;AACA,EAAAA,0BAAA,qBAA6B,MAA7B;AACA,EAAAA,0BAAA,8BAA6B,MAA7B;AAIA,EAAAA,0BAAA,sBAA6B,MAA7B;AAEA,EAAAA,0BAAA,wBAA6B,MAA7B;AAEA,EAAAA,0BAAA,0BAA6B,MAA7B;AAEA,EAAAA,0BAAA,iBAA6B,MAA7B;AA3EU,SAAAA;AAAA,GAAA;AA4JL,IAAM,mBAAN,cAA+B,MAAM;AAAA,EAC1C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,cAAN,MAAM,aAAY;AAAA,EAkCvB,YAAY,MAAuB;AAjCnC,wBAAS;AAET;AAAA,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAET;AAAA,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAET;AAAA,wBAAS;AAGP,QAAI,CAAC,KAAK,OAAO,KAAK,IAAI,KAAK,MAAM,IAAI;AACvC,YAAM,IAAI,iBAAiB,mBAAmB;AAAA,IAChD;AACA,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAM,IAAI,iBAAiB,sBAAsB;AAAA,IACnD;AAEA,SAAK,OAAO,KAAK,QAAQ;AACzB,SAAK,cAAc,KAAK,eAAe;AACvC,SAAK,MAAM,KAAK;AAChB,SAAK,SACH,KAAK,kBAAkB,WAAW,KAAK,OAAO,SAAS,IAAI,OAAO,KAAK,MAAM;AAC/E,SAAK,SAAS,KAAK,UAAU,CAAC;AAC9B,SAAK,aAAa,KAAK;AACvB,SAAK,gBAAgB,KAAK,iBAAiB,KAAK;AAChD,SAAK,YAAY,KAAK;AACtB,SAAK,YAAY,KAAK,cAAa,oBAAI,KAAK,GAAE,YAAY;AAC1D,SAAK,aAAa,KAAK;AACvB,SAAK,gBAAgB,KAAK;AAC1B,SAAK,QAAQ,KAAK;AAClB,SAAK,kBAAkB,KAAK;AAC5B,SAAK,UAAU,KAAK;AACpB,SAAK,MAAM,KAAK;AAChB,SAAK,mBAAmB,KAAK;AAC7B,SAAK,kBAAkB,KAAK;AAC5B,SAAK,WAAW,KAAK;AACrB,SAAK,MAAM,KAAK;AAChB,SAAK,oBAAoB,KAAK;AAC9B,SAAK,cAAc,KAAK;AACxB,SAAK,eAAe,KAAK;AACzB,SAAK,iBAAiB,KAAK;AAC3B,SAAK,QAAQ,KAAK;AAGlB,QACE,KAAK,cAAc,UAClB,KAAK,UAAiD,KAAK,MAAM,WAClE;AACA,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,eAAe,QAAW;AACjC,UAAI,KAAK,aAAa,KAAK,KAAK,aAAa,GAAG;AAC9C,cAAM,IAAI;AAAA,UACR,+CAA0C,KAAK,UAAU;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAO,KAAK,cAAc,UAAa,KAAK,UAAU,QAAQ;AAAA,EAChE;AAAA;AAAA,EAGA,IAAI,aAAsB;AACxB,WAAO,KAAK,eAAe;AAAA,EAC7B;AAAA;AAAA,EAGA,SAAkC;AAChC,UAAM,MAA+B;AAAA,MACnC,MAAM,KAAK;AAAA,MACX,aAAa,KAAK;AAAA,MAClB,KAAK,KAAK;AAAA,MACV,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB;AACA,QAAI,OAAO,KAAK,KAAK,MAAM,EAAE,SAAS,EAAG,KAAI,SAAS,KAAK;AAC3D,QAAI,KAAK,eAAe,OAAW,KAAI,aAAa,KAAK;AACzD,QAAI,KAAK,cAAe,KAAI,iBAAiB,KAAK;AAClD,QAAI,KAAK,UAAW,KAAI,YAAY,KAAK;AACzC,QAAI,KAAK,eAAe,OAAW,KAAI,aAAa,KAAK;AACzD,QAAI,KAAK,kBAAkB,OAAW,KAAI,gBAAgB,KAAK;AAC/D,QAAI,KAAK,UAAU,OAAW,KAAI,QAAQ,KAAK;AAC/C,QAAI,KAAK,oBAAoB,OAAW,KAAI,kBAAkB,KAAK;AACnE,QAAI,KAAK,YAAY,OAAW,KAAI,UAAU,KAAK;AACnD,QAAI,KAAK,QAAQ,OAAW,KAAI,MAAM,KAAK;AAC3C,QAAI,KAAK,qBAAqB,OAAW,KAAI,mBAAmB,KAAK;AACrE,QAAI,KAAK,oBAAoB,OAAW,KAAI,kBAAkB,KAAK;AACnE,QAAI,KAAK,aAAa,OAAW,KAAI,WAAW,KAAK;AACrD,QAAI,KAAK,QAAQ,OAAW,KAAI,MAAM,KAAK;AAC3C,QAAI,KAAK,sBAAsB,OAAW,KAAI,oBAAoB,KAAK;AACvE,QAAI,KAAK,gBAAgB,OAAW,KAAI,cAAc,KAAK;AAC3D,QAAI,KAAK,iBAAiB,OAAW,KAAI,eAAe,KAAK;AAC7D,QAAI,KAAK,mBAAmB,OAAW,KAAI,iBAAiB,KAAK;AACjE,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,aAAa,QAAyB;AACpC,WAAO,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,MAAM;AAAA,EACnD;AAAA;AAAA,EAGA,OAAO,SAAS,MAAqD;AACnE,QAAI;AACJ,QAAI,OAAO,SAAS,UAAU;AAC5B,UAAI;AACF,cAAM,KAAK,MAAM,IAAI;AAAA,MACvB,QAAQ;AACN,cAAM,IAAI,iBAAiB,qBAAqB;AAAA,MAClD;AAAA,IACF,OAAO;AACL,YAAM;AAAA,IACR;AAEA,QAAI,CAAC,IAAI,IAAK,OAAM,IAAI,iBAAiB,+BAA+B;AACxE,QAAI,CAAC,IAAI,OAAQ,OAAM,IAAI,iBAAiB,kCAAkC;AAC9E,QAAI,CAAC,IAAI,KAAM,OAAM,IAAI,iBAAiB,gCAAgC;AAE1E,WAAO,IAAI,aAAY;AAAA,MACrB,MAAM,IAAI;AAAA,MACV,aAAc,IAAI;AAAA,MAClB,KAAK,IAAI;AAAA,MACT,QAAQ,IAAI;AAAA,MACZ,QAAS,IAAI,UAAsC,CAAC;AAAA,MACpD,YAAY,IAAI;AAAA,MAChB,eACG,IAAI,kBACJ,IAAI;AAAA,MACP,WAAW,IAAI;AAAA,MACf,WAAW,IAAI;AAAA,MACf,YAAY,IAAI;AAAA,MAChB,eAAe,IAAI;AAAA,MACnB,OAAO,IAAI;AAAA,MACX,iBAAiB,IAAI;AAAA,MACrB,SAAS,IAAI;AAAA,MACb,KAAK,IAAI;AAAA,MACT,kBAAkB,IAAI;AAAA,MACtB,iBAAiB,IAAI;AAAA,MACrB,UAAU,IAAI;AAAA,MACd,KAAK,IAAI;AAAA,MACT,mBAAmB,IAAI;AAAA,MACvB,aAAa,IAAI;AAAA,MACjB,cAAc,IAAI;AAAA,MAClB,gBAAgB,IAAI;AAAA,MACpB,OAAO,IAAI;AAAA,IACb,CAAC;AAAA,EACH;AACF;AASO,SAAS,sBACd,MACA,UACa;AACb,QAAM,OAAO,KAAK,OAAO;AACzB,OAAK,aAAa;AAClB,OAAK,gBAAgB;AACrB,SAAO,IAAI,YAAY,IAAI;AAC7B;AAOO,SAAS,iBACd,KACA,KACa;AACb,QAAM,QAAQ,IAAI,kBAAkB,CAAC,GAAG,IAAI,iBAAiB,GAAG,IAAI,CAAC,GAAG;AACxE,QAAM,OAAO,IAAI,OAAO;AACxB,OAAK,kBAAkB;AACvB,SAAO,IAAI,YAAY,IAAI;AAC7B;AAUO,SAAS,wBACd,OACoC;AACpC,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,EAAE,OAAO,OAAO,QAAQ,iDAAiD;AAAA,EAClF;AACA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,CAAC,IAAK,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,gBAAgB;AACjE,QAAI,CAAC,IAAI,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,uBAAuB;AACnF,QAAI,CAAC,IAAI,aAAc,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,yBAAyB;AACvF,QAAI,CAAC,IAAI,UAAW,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,sBAAsB;AACjF,QAAI,CAAC,IAAI,MAAO,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,kBAAkB;AACzE,QAAI,CAAC,IAAI,UAAW,QAAO,EAAE,OAAO,OAAO,QAAQ,OAAO,CAAC,sBAAsB;AAAA,EACnF;AACA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;;;ACvaA,SAAS,gBAAgB;;;ACMnB,SAAU,QAAQ,GAAU;AAChC,SAAO,aAAa,cAAe,YAAY,OAAO,CAAC,KAAK,EAAE,YAAY,SAAS;AACrF;AAGM,SAAU,QAAQ,GAAW,QAAgB,IAAE;AACnD,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,GAAG;AACrC,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,MAAM,GAAG,MAAM,8BAA8B,CAAC,EAAE;EAC5D;AACF;AAGM,SAAU,OAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,MAAM,OAAO;AACnB,QAAM,WAAW,WAAW;AAC5B,MAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,UAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,UAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;EACzE;AACA,SAAO;AACT;AAWM,SAAU,QAAQ,UAAe,gBAAgB,MAAI;AACzD,MAAI,SAAS;AAAW,UAAM,IAAI,MAAM,kCAAkC;AAC1E,MAAI,iBAAiB,SAAS;AAAU,UAAM,IAAI,MAAM,uCAAuC;AACjG;AAGM,SAAU,QAAQ,KAAU,UAAa;AAC7C,SAAO,KAAK,QAAW,qBAAqB;AAC5C,QAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,KAAK;AACpB,UAAM,IAAI,MAAM,sDAAsD,GAAG;EAC3E;AACF;AAkBM,SAAU,SAAS,QAAoB;AAC3C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,WAAO,CAAC,EAAE,KAAK,CAAC;EAClB;AACF;AAGM,SAAU,WAAW,KAAe;AACxC,SAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAChE;AA2CA,IAAM,gBAA0C;;EAE9C,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,UAAU,cAAc,OAAO,WAAW,YAAY;GAAW;AAG9F,IAAM,QAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAG,MAC5D,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAO3B,SAAU,WAAW,OAAiB;AAC1C,SAAO,KAAK;AAEZ,MAAI;AAAe,WAAO,MAAM,MAAK;AAErC,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAO,MAAM,MAAM,CAAC,CAAC;EACvB;AACA,SAAO;AACT;AAGA,IAAM,SAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,SAAS,cAAc,IAAU;AAC/B,MAAI,MAAM,OAAO,MAAM,MAAM,OAAO;AAAI,WAAO,KAAK,OAAO;AAC3D,MAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,WAAO,MAAM,OAAO,IAAI;AAC9D,MAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,WAAO,MAAM,OAAO,IAAI;AAC9D;AACF;AAMM,SAAU,WAAW,KAAW;AACpC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AAErF,MAAI;AAAe,WAAO,WAAW,QAAQ,GAAG;AAChD,QAAM,KAAK,IAAI;AACf,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK;AAAG,UAAM,IAAI,MAAM,qDAAqD,EAAE;AACnF,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,UAAM,KAAK,cAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,UAAM,KAAK,cAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,QAAI,OAAO,UAAa,OAAO,QAAW;AACxC,YAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB,EAAE;IAC5F;AACA,UAAM,EAAE,IAAI,KAAK,KAAK;EACxB;AACA,SAAO;AACT;AAoDM,SAAU,eAAe,QAAoB;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,CAAC;AACR,WAAO,EAAE;EACX;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC/C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;EACX;AACA,SAAO;AACT;AAoEM,SAAU,aACd,UACA,OAAiB,CAAA,GAAE;AAEnB,QAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,QAAM,MAAM,SAAS,MAAS;AAC9B,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,SAAO,OAAO,OAAO,IAAI;AACzB,SAAO,OAAO,OAAO,KAAK;AAC5B;AAGM,SAAU,YAAY,cAAc,IAAE;AAC1C,QAAM,KAAK,OAAO,eAAe,WAAY,WAAmB,SAAS;AACzE,MAAI,OAAO,IAAI,oBAAoB;AACjC,UAAM,IAAI,MAAM,wCAAwC;AAC1D,SAAO,GAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;AACvD;AAGO,IAAM,UAAU,CAAC,YAAwC;EAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;AC5TrF,IAAgB,SAAhB,MAAsB;EAoB1B,YAAY,UAAkB,WAAmB,WAAmB,MAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,oCAAW;AACX,kCAAS;AACT,+BAAM;AACN,qCAAY;AAGpB,SAAK,WAAW;AAChB,SAAK,YAAY;AACjB,SAAK,YAAY;AACjB,SAAK,OAAO;AACZ,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAO,WAAW,KAAK,MAAM;EACpC;EACA,OAAO,MAAgB;AACrB,YAAQ,IAAI;AACZ,WAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,UAAI,SAAS,UAAU;AACrB,cAAM,WAAW,WAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AAAU,eAAK,QAAQ,UAAU,GAAG;AACzE;MACF;AACA,aAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACzB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;MACb;IACF;AACA,SAAK,UAAU,KAAK;AACpB,SAAK,WAAU;AACf,WAAO;EACT;EACA,WAAW,KAAe;AACxB,YAAQ,IAAI;AACZ,YAAQ,KAAK,IAAI;AACjB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAQ,MAAM,UAAU,KAAI,IAAK;AACzC,QAAI,EAAE,IAAG,IAAK;AAEd,WAAO,KAAK,IAAI;AAChB,UAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,QAAI,KAAK,YAAY,WAAW,KAAK;AACnC,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM;IACR;AAEA,aAAS,IAAI,KAAK,IAAI,UAAU;AAAK,aAAO,CAAC,IAAI;AAIjD,SAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAG,IAAI;AAC7D,SAAK,QAAQ,MAAM,CAAC;AACpB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,MAAM,KAAK;AAEjB,QAAI,MAAM;AAAG,YAAM,IAAI,MAAM,2CAA2C;AACxE,UAAM,SAAS,MAAM;AACrB,UAAM,QAAQ,KAAK,IAAG;AACtB,QAAI,SAAS,MAAM;AAAQ,YAAM,IAAI,MAAM,oCAAoC;AAC/E,aAAS,IAAI,GAAG,IAAI,QAAQ;AAAK,YAAM,UAAU,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI;EACxE;EACA,SAAM;AACJ,UAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,SAAK,WAAW,MAAM;AACtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAO;AACZ,WAAO;EACT;EACA,WAAW,IAAM;AACf,gBAAO,IAAK,KAAK,YAAmB;AACpC,OAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,SAAS;AACZ,OAAG,MAAM;AACT,QAAI,SAAS;AAAU,SAAG,OAAO,IAAI,MAAM;AAC3C,WAAO;EACT;EACA,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;;AAyBK,IAAM,YAAyC,4BAAY,KAAK;EACrE;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;;;ACtJD,IAAM,aAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,IAAM,OAAuB,uBAAO,EAAE;AAEtC,SAAS,QACP,GACA,KAAK,OAAK;AAKV,MAAI;AAAI,WAAO,EAAE,GAAG,OAAO,IAAI,UAAU,GAAG,GAAG,OAAQ,KAAK,OAAQ,UAAU,EAAC;AAC/E,SAAO,EAAE,GAAG,OAAQ,KAAK,OAAQ,UAAU,IAAI,GAAG,GAAG,OAAO,IAAI,UAAU,IAAI,EAAC;AACjF;AAEA,SAAS,MAAM,KAAe,KAAK,OAAK;AACtC,QAAM,MAAM,IAAI;AAChB,MAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,MAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAM,EAAE,GAAG,EAAC,IAAK,QAAQ,IAAI,CAAC,GAAG,EAAE;AACnC,KAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;EACxB;AACA,SAAO,CAAC,IAAI,EAAE;AAChB;AAIA,IAAM,QAAQ,CAAC,GAAW,IAAY,MAAsB,MAAM;AAClE,IAAM,QAAQ,CAAC,GAAW,GAAW,MAAuB,KAAM,KAAK,IAAO,MAAM;AAEpF,IAAM,SAAS,CAAC,GAAW,GAAW,MAAuB,MAAM,IAAM,KAAM,KAAK;AACpF,IAAM,SAAS,CAAC,GAAW,GAAW,MAAuB,KAAM,KAAK,IAAO,MAAM;AAErF,IAAM,SAAS,CAAC,GAAW,GAAW,MAAuB,KAAM,KAAK,IAAO,MAAO,IAAI;AAC1F,IAAM,SAAS,CAAC,GAAW,GAAW,MAAuB,MAAO,IAAI,KAAQ,KAAM,KAAK;AAa3F,SAAS,IACP,IACA,IACA,IACA,IAAU;AAKV,QAAM,KAAK,OAAO,MAAM,OAAO;AAC/B,SAAO,EAAE,GAAI,KAAK,MAAO,IAAI,KAAK,KAAM,KAAM,GAAG,GAAG,IAAI,EAAC;AAC3D;AAEA,IAAM,QAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,IAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,IAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,IAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,IAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,IAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;ACuErD,IAAM,OAAwB,uBAAU,MAAM;EAC5C;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE;EAAsB;EAAsB;EAAsB;EAClE,IAAI,OAAK,OAAO,CAAC,CAAC,CAAC,GAAE;AACvB,IAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AACjD,IAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AAGjD,IAAM,aAA6B,oBAAI,YAAY,EAAE;AACrD,IAAM,aAA6B,oBAAI,YAAY,EAAE;AAGrD,IAAe,WAAf,cAAuD,OAAS;EAqB9D,YAAY,WAAiB;AAC3B,UAAM,KAAK,WAAW,IAAI,KAAK;EACjC;;EAEU,MAAG;AAIX,UAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,WAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;EACxE;;EAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;AACf,SAAK,KAAK,KAAK;EACjB;EACU,QAAQ,MAAgB,QAAc;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU,GAAG;AACxC,iBAAW,CAAC,IAAI,KAAK,UAAU,MAAM;AACrC,iBAAW,CAAC,IAAI,KAAK,UAAW,UAAU,CAAE;IAC9C;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,YAAM,OAAO,WAAW,IAAI,EAAE,IAAI;AAClC,YAAM,OAAO,WAAW,IAAI,EAAE,IAAI;AAClC,YAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAC3F,YAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAE3F,YAAM,MAAM,WAAW,IAAI,CAAC,IAAI;AAChC,YAAM,MAAM,WAAW,IAAI,CAAC,IAAI;AAChC,YAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AACvF,YAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AAEvF,YAAM,OAAW,MAAM,KAAK,KAAK,WAAW,IAAI,CAAC,GAAG,WAAW,IAAI,EAAE,CAAC;AACtE,YAAM,OAAW,MAAM,MAAM,KAAK,KAAK,WAAW,IAAI,CAAC,GAAG,WAAW,IAAI,EAAE,CAAC;AAC5E,iBAAW,CAAC,IAAI,OAAO;AACvB,iBAAW,CAAC,IAAI,OAAO;IACzB;AACA,QAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAE3B,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AAEvF,YAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,YAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,YAAM,OAAW,MAAM,IAAI,SAAS,MAAM,UAAU,CAAC,GAAG,WAAW,CAAC,CAAC;AACrE,YAAM,MAAU,MAAM,MAAM,IAAI,SAAS,MAAM,UAAU,CAAC,GAAG,WAAW,CAAC,CAAC;AAC1E,YAAM,MAAM,OAAO;AAEnB,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,YAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,YAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,YAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,WAAK,KAAK;AACV,YAAM,MAAU,MAAM,KAAK,SAAS,IAAI;AACxC,WAAS,MAAM,KAAK,KAAK,SAAS,IAAI;AACtC,WAAK,MAAM;IACb;AAEA,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,KAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,SAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;EACzE;EACU,aAAU;AAClB,UAAM,YAAY,UAAU;EAC9B;EACA,UAAO;AACL,UAAM,KAAK,MAAM;AACjB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;EACzD;;AAII,IAAO,UAAP,cAAuB,SAAiB;EAkB5C,cAAA;AACE,UAAM,EAAE;AAlBA,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,CAAC,IAAI;AAC5B,8BAAa,UAAU,EAAE,IAAI;AAC7B,8BAAa,UAAU,EAAE,IAAI;AAC7B,8BAAa,UAAU,EAAE,IAAI;AAC7B,8BAAa,UAAU,EAAE,IAAI;AAC7B,8BAAa,UAAU,EAAE,IAAI;AAC7B,8BAAa,UAAU,EAAE,IAAI;EAIvC;;AAiHK,IAAM,SAAyC;EACpD,MAAM,IAAI,QAAO;EACD,wBAAQ,CAAI;AAAC;;;ACxa/B,IAAM,MAAsB,uBAAO,CAAC;AACpC,IAAM,MAAsB,uBAAO,CAAC;AAS9B,SAAU,MAAM,OAAgB,QAAgB,IAAE;AACtD,MAAI,OAAO,UAAU,WAAW;AAC9B,UAAM,SAAS,SAAS,IAAI,KAAK;AACjC,UAAM,IAAI,MAAM,SAAS,gCAAgC,OAAO,KAAK;EACvE;AACA,SAAO;AACT;AAGA,SAAS,WAAW,GAAkB;AACpC,MAAI,OAAO,MAAM,UAAU;AACzB,QAAI,CAAC,SAAS,CAAC;AAAG,YAAM,IAAI,MAAM,mCAAmC,CAAC;EACxE;AAAO,YAAQ,CAAC;AAChB,SAAO;AACT;AAcM,SAAU,YAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AACrF,SAAO,QAAQ,KAAK,MAAM,OAAO,OAAO,GAAG;AAC7C;AAGM,SAAU,gBAAgB,OAAiB;AAC/C,SAAO,YAAY,WAAY,KAAK,CAAC;AACvC;AACM,SAAU,gBAAgB,OAAiB;AAC/C,SAAO,YAAY,WAAY,UAAU,OAAQ,KAAK,CAAC,EAAE,QAAO,CAAE,CAAC;AACrE;AAEM,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,UAAQ,GAAG;AACX,MAAI,WAAW,CAAC;AAChB,QAAM,MAAM,WAAY,EAAE,SAAS,EAAE,EAAE,SAAS,MAAM,GAAG,GAAG,CAAC;AAC7D,MAAI,IAAI,WAAW;AAAK,UAAM,IAAI,MAAM,kBAAkB;AAC1D,SAAO;AACT;AACM,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,SAAO,gBAAgB,GAAG,GAAG,EAAE,QAAO;AACxC;AAkBM,SAAU,UAAU,OAAiB;AACzC,SAAO,WAAW,KAAK,KAAK;AAC9B;AAoBA,IAAM,WAAW,CAAC,MAAc,OAAO,MAAM,YAAY,OAAO;AAE1D,SAAU,QAAQ,GAAW,KAAa,KAAW;AACzD,SAAO,SAAS,CAAC,KAAK,SAAS,GAAG,KAAK,SAAS,GAAG,KAAK,OAAO,KAAK,IAAI;AAC1E;AAOM,SAAU,SAAS,OAAe,GAAW,KAAa,KAAW;AAMzE,MAAI,CAAC,QAAQ,GAAG,KAAK,GAAG;AACtB,UAAM,IAAI,MAAM,oBAAoB,QAAQ,OAAO,MAAM,aAAa,MAAM,WAAW,CAAC;AAC5F;AAmCO,IAAM,UAAU,CAAC,OAAuB,OAAO,OAAO,CAAC,KAAK;AAoE7D,SAAU,eACd,QACA,SAAiC,CAAA,GACjC,YAAoC,CAAA,GAAE;AAEtC,MAAI,CAAC,UAAU,OAAO,WAAW;AAAU,UAAM,IAAI,MAAM,+BAA+B;AAE1F,WAAS,WAAW,WAAiB,cAAsB,OAAc;AACvE,UAAM,MAAM,OAAO,SAAS;AAC5B,QAAI,SAAS,QAAQ;AAAW;AAChC,UAAM,UAAU,OAAO;AACvB,QAAI,YAAY,gBAAgB,QAAQ;AACtC,YAAM,IAAI,MAAM,UAAU,SAAS,0BAA0B,YAAY,SAAS,OAAO,EAAE;EAC/F;AACA,QAAM,OAAO,CAAC,GAAkB,UAC9B,OAAO,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,WAAW,GAAG,GAAG,KAAK,CAAC;AAC/D,OAAK,QAAQ,KAAK;AAClB,OAAK,WAAW,IAAI;AACtB;AAaM,SAAU,SACd,IAA6B;AAE7B,QAAM,MAAM,oBAAI,QAAO;AACvB,SAAO,CAAC,QAAW,SAAc;AAC/B,UAAM,MAAM,IAAI,IAAI,GAAG;AACvB,QAAI,QAAQ;AAAW,aAAO;AAC9B,UAAM,WAAW,GAAG,KAAK,GAAG,IAAI;AAChC,QAAI,IAAI,KAAK,QAAQ;AACrB,WAAO;EACT;AACF;;;AC1QA,IAAMC,OAAsB,uBAAO,CAAC;AAApC,IAAuCC,OAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AAEtG,IAAM,MAAsB,uBAAO,CAAC;AAApC,IAAuC,MAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AAEtG,IAAM,MAAsB,uBAAO,CAAC;AAApC,IAAuC,MAAsB,uBAAO,CAAC;AAArE,IAAwE,MAAsB,uBAAO,CAAC;AACtG,IAAM,OAAuB,uBAAO,EAAE;AAGhC,SAAU,IAAI,GAAW,GAAS;AACtC,QAAM,SAAS,IAAI;AACnB,SAAO,UAAUD,OAAM,SAAS,IAAI;AACtC;AAYM,SAAU,KAAK,GAAW,OAAe,QAAc;AAC3D,MAAI,MAAM;AACV,SAAO,UAAUE,MAAK;AACpB,WAAO;AACP,WAAO;EACT;AACA,SAAO;AACT;AAMM,SAAU,OAAO,QAAgB,QAAc;AACnD,MAAI,WAAWA;AAAK,UAAM,IAAI,MAAM,kCAAkC;AACtE,MAAI,UAAUA;AAAK,UAAM,IAAI,MAAM,4CAA4C,MAAM;AAErF,MAAI,IAAI,IAAI,QAAQ,MAAM;AAC1B,MAAI,IAAI;AAER,MAAI,IAAIA,MAAK,IAAIC,MAAK,IAAIA,MAAK,IAAID;AACnC,SAAO,MAAMA,MAAK;AAEhB,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAElB,QAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;EACzC;AACA,QAAM,MAAM;AACZ,MAAI,QAAQC;AAAK,UAAM,IAAI,MAAM,wBAAwB;AACzD,SAAO,IAAI,GAAG,MAAM;AACtB;AAEA,SAAS,eAAkB,IAAe,MAAS,GAAI;AACrD,MAAI,CAAC,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,CAAC;AAAG,UAAM,IAAI,MAAM,yBAAyB;AACzE;AAMA,SAAS,UAAa,IAAe,GAAI;AACvC,QAAM,UAAU,GAAG,QAAQA,QAAO;AAClC,QAAM,OAAO,GAAG,IAAI,GAAG,MAAM;AAC7B,iBAAe,IAAI,MAAM,CAAC;AAC1B,SAAO;AACT;AAEA,SAAS,UAAa,IAAe,GAAI;AACvC,QAAM,UAAU,GAAG,QAAQ,OAAO;AAClC,QAAM,KAAK,GAAG,IAAI,GAAG,GAAG;AACxB,QAAM,IAAI,GAAG,IAAI,IAAI,MAAM;AAC3B,QAAM,KAAK,GAAG,IAAI,GAAG,CAAC;AACtB,QAAM,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,CAAC;AACnC,QAAM,OAAO,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC;AACzC,iBAAe,IAAI,MAAM,CAAC;AAC1B,SAAO;AACT;AAIA,SAAS,WAAW,GAAS;AAC3B,QAAM,MAAM,MAAM,CAAC;AACnB,QAAM,KAAK,cAAc,CAAC;AAC1B,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AACnC,QAAM,KAAK,GAAG,KAAK,EAAE;AACrB,QAAM,KAAK,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC;AAC9B,QAAM,MAAM,IAAI,OAAO;AACvB,SAAO,CAAI,IAAe,MAAQ;AAChC,QAAI,MAAM,GAAG,IAAI,GAAG,EAAE;AACtB,QAAI,MAAM,GAAG,IAAI,KAAK,EAAE;AACxB,UAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,UAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,UAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;AAChC,UAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;AAChC,UAAM,GAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,UAAM,GAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,UAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;AAChC,UAAM,OAAO,GAAG,KAAK,KAAK,KAAK,EAAE;AACjC,mBAAe,IAAI,MAAM,CAAC;AAC1B,WAAO;EACT;AACF;AASM,SAAU,cAAc,GAAS;AAGrC,MAAI,IAAI;AAAK,UAAM,IAAI,MAAM,qCAAqC;AAElE,MAAI,IAAI,IAAIA;AACZ,MAAI,IAAI;AACR,SAAO,IAAI,QAAQD,MAAK;AACtB,SAAK;AACL;EACF;AAGA,MAAI,IAAI;AACR,QAAM,MAAM,MAAM,CAAC;AACnB,SAAO,WAAW,KAAK,CAAC,MAAM,GAAG;AAG/B,QAAI,MAAM;AAAM,YAAM,IAAI,MAAM,+CAA+C;EACjF;AAEA,MAAI,MAAM;AAAG,WAAO;AAIpB,MAAI,KAAK,IAAI,IAAI,GAAG,CAAC;AACrB,QAAM,UAAU,IAAIC,QAAO;AAC3B,SAAO,SAAS,YAAe,IAAe,GAAI;AAChD,QAAI,GAAG,IAAI,CAAC;AAAG,aAAO;AAEtB,QAAI,WAAW,IAAI,CAAC,MAAM;AAAG,YAAM,IAAI,MAAM,yBAAyB;AAGtE,QAAI,IAAI;AACR,QAAI,IAAI,GAAG,IAAI,GAAG,KAAK,EAAE;AACzB,QAAI,IAAI,GAAG,IAAI,GAAG,CAAC;AACnB,QAAI,IAAI,GAAG,IAAI,GAAG,MAAM;AAIxB,WAAO,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG;AACzB,UAAI,GAAG,IAAI,CAAC;AAAG,eAAO,GAAG;AACzB,UAAI,IAAI;AAGR,UAAI,QAAQ,GAAG,IAAI,CAAC;AACpB,aAAO,CAAC,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG;AAC7B;AACA,gBAAQ,GAAG,IAAI,KAAK;AACpB,YAAI,MAAM;AAAG,gBAAM,IAAI,MAAM,yBAAyB;MACxD;AAGA,YAAM,WAAWA,QAAO,OAAO,IAAI,IAAI,CAAC;AACxC,YAAM,IAAI,GAAG,IAAI,GAAG,QAAQ;AAG5B,UAAI;AACJ,UAAI,GAAG,IAAI,CAAC;AACZ,UAAI,GAAG,IAAI,GAAG,CAAC;AACf,UAAI,GAAG,IAAI,GAAG,CAAC;IACjB;AACA,WAAO;EACT;AACF;AAaM,SAAU,OAAO,GAAS;AAE9B,MAAI,IAAI,QAAQ;AAAK,WAAO;AAE5B,MAAI,IAAI,QAAQ;AAAK,WAAO;AAE5B,MAAI,IAAI,SAAS;AAAK,WAAO,WAAW,CAAC;AAEzC,SAAO,cAAc,CAAC;AACxB;AAGO,IAAM,eAAe,CAAC,KAAa,YACvC,IAAI,KAAK,MAAM,IAAIA,UAASA;AA6C/B,IAAM,eAAe;EACnB;EAAU;EAAW;EAAO;EAAO;EAAO;EAAQ;EAClD;EAAO;EAAO;EAAO;EAAO;EAAO;EACnC;EAAQ;EAAQ;EAAQ;;AAEpB,SAAU,cAAiB,OAAgB;AAC/C,QAAM,UAAU;IACd,OAAO;IACP,OAAO;IACP,MAAM;;AAER,QAAM,OAAO,aAAa,OAAO,CAAC,KAAK,QAAe;AACpD,QAAI,GAAG,IAAI;AACX,WAAO;EACT,GAAG,OAAO;AACV,iBAAe,OAAO,IAAI;AAI1B,SAAO;AACT;AAQM,SAAU,MAAS,IAAe,KAAQ,OAAa;AAC3D,MAAI,QAAQD;AAAK,UAAM,IAAI,MAAM,yCAAyC;AAC1E,MAAI,UAAUA;AAAK,WAAO,GAAG;AAC7B,MAAI,UAAUC;AAAK,WAAO;AAC1B,MAAI,IAAI,GAAG;AACX,MAAI,IAAI;AACR,SAAO,QAAQD,MAAK;AAClB,QAAI,QAAQC;AAAK,UAAI,GAAG,IAAI,GAAG,CAAC;AAChC,QAAI,GAAG,IAAI,CAAC;AACZ,cAAUA;EACZ;AACA,SAAO;AACT;AAOM,SAAU,cAAiB,IAAe,MAAW,WAAW,OAAK;AACzE,QAAM,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,WAAW,GAAG,OAAO,MAAS;AAE3E,QAAM,gBAAgB,KAAK,OAAO,CAAC,KAAK,KAAK,MAAK;AAChD,QAAI,GAAG,IAAI,GAAG;AAAG,aAAO;AACxB,aAAS,CAAC,IAAI;AACd,WAAO,GAAG,IAAI,KAAK,GAAG;EACxB,GAAG,GAAG,GAAG;AAET,QAAM,cAAc,GAAG,IAAI,aAAa;AAExC,OAAK,YAAY,CAAC,KAAK,KAAK,MAAK;AAC/B,QAAI,GAAG,IAAI,GAAG;AAAG,aAAO;AACxB,aAAS,CAAC,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC;AACrC,WAAO,GAAG,IAAI,KAAK,GAAG;EACxB,GAAG,WAAW;AACd,SAAO;AACT;AAgBM,SAAU,WAAc,IAAe,GAAI;AAG/C,QAAM,UAAU,GAAG,QAAQC,QAAO;AAClC,QAAM,UAAU,GAAG,IAAI,GAAG,MAAM;AAChC,QAAM,MAAM,GAAG,IAAI,SAAS,GAAG,GAAG;AAClC,QAAM,OAAO,GAAG,IAAI,SAAS,GAAG,IAAI;AACpC,QAAM,KAAK,GAAG,IAAI,SAAS,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,MAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;AAAI,UAAM,IAAI,MAAM,gCAAgC;AAC1E,SAAO,MAAM,IAAI,OAAO,IAAI;AAC9B;AAUM,SAAU,QAAQ,GAAW,YAAmB;AAEpD,MAAI,eAAe;AAAW,YAAQ,UAAU;AAChD,QAAM,cAAc,eAAe,SAAY,aAAa,EAAE,SAAS,CAAC,EAAE;AAC1E,QAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,SAAO,EAAE,YAAY,aAAa,YAAW;AAC/C;AAWA,IAAM,SAAN,MAAY;EAUV,YAAY,OAAe,OAAkB,CAAA,GAAE;AATtC;AACA;AACA;AACA;AACA,gCAAOC;AACP,+BAAMC;AACN;AACD;AACS;;AAEf,QAAI,SAASD;AAAK,YAAM,IAAI,MAAM,4CAA4C,KAAK;AACnF,QAAI,cAAkC;AACtC,SAAK,OAAO;AACZ,QAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC5C,UAAI,OAAO,KAAK,SAAS;AAAU,sBAAc,KAAK;AACtD,UAAI,OAAO,KAAK,SAAS;AAAY,aAAK,OAAO,KAAK;AACtD,UAAI,OAAO,KAAK,SAAS;AAAW,aAAK,OAAO,KAAK;AACrD,UAAI,KAAK;AAAgB,aAAK,WAAW,KAAK,gBAAgB,MAAK;AACnE,UAAI,OAAO,KAAK,iBAAiB;AAAW,aAAK,OAAO,KAAK;IAC/D;AACA,UAAM,EAAE,YAAY,YAAW,IAAK,QAAQ,OAAO,WAAW;AAC9D,QAAI,cAAc;AAAM,YAAM,IAAI,MAAM,gDAAgD;AACxF,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,WAAO,kBAAkB,IAAI;EAC/B;EAEA,OAAO,KAAW;AAChB,WAAO,IAAI,KAAK,KAAK,KAAK;EAC5B;EACA,QAAQ,KAAW;AACjB,QAAI,OAAO,QAAQ;AACjB,YAAM,IAAI,MAAM,iDAAiD,OAAO,GAAG;AAC7E,WAAOA,QAAO,OAAO,MAAM,KAAK;EAClC;EACA,IAAI,KAAW;AACb,WAAO,QAAQA;EACjB;;EAEA,YAAY,KAAW;AACrB,WAAO,CAAC,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,GAAG;EAC3C;EACA,MAAM,KAAW;AACf,YAAQ,MAAMC,UAASA;EACzB;EACA,IAAI,KAAW;AACb,WAAO,IAAI,CAAC,KAAK,KAAK,KAAK;EAC7B;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,QAAQ;EACjB;EAEA,IAAI,KAAW;AACb,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,KAAK,KAAK,KAAK;EAClC;EACA,IAAI,KAAa,OAAa;AAC5B,WAAO,MAAM,MAAM,KAAK,KAAK;EAC/B;EACA,IAAI,KAAa,KAAW;AAC1B,WAAO,IAAI,MAAM,OAAO,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK;EACtD;;EAGA,KAAK,KAAW;AACd,WAAO,MAAM;EACf;EACA,KAAK,KAAa,KAAW;AAC3B,WAAO,MAAM;EACf;EACA,KAAK,KAAa,KAAW;AAC3B,WAAO,MAAM;EACf;EACA,KAAK,KAAa,KAAW;AAC3B,WAAO,MAAM;EACf;EAEA,IAAI,KAAW;AACb,WAAO,OAAO,KAAK,KAAK,KAAK;EAC/B;EACA,KAAK,KAAW;AAEd,QAAI,CAAC,KAAK;AAAO,WAAK,QAAQ,OAAO,KAAK,KAAK;AAC/C,WAAO,KAAK,MAAM,MAAM,GAAG;EAC7B;EACA,QAAQ,KAAW;AACjB,WAAO,KAAK,OAAO,gBAAgB,KAAK,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK,KAAK;EACvF;EACA,UAAU,OAAmB,iBAAiB,OAAK;AACjD,WAAO,KAAK;AACZ,UAAM,EAAE,UAAU,gBAAgB,OAAO,MAAM,OAAO,MAAM,aAAY,IAAK;AAC7E,QAAI,gBAAgB;AAClB,UAAI,CAAC,eAAe,SAAS,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO;AAClE,cAAM,IAAI,MACR,+BAA+B,iBAAiB,iBAAiB,MAAM,MAAM;MAEjF;AACA,YAAM,SAAS,IAAI,WAAW,KAAK;AAEnC,aAAO,IAAI,OAAO,OAAO,IAAI,OAAO,SAAS,MAAM,MAAM;AACzD,cAAQ;IACV;AACA,QAAI,MAAM,WAAW;AACnB,YAAM,IAAI,MAAM,+BAA+B,QAAQ,iBAAiB,MAAM,MAAM;AACtF,QAAI,SAAS,OAAO,gBAAgB,KAAK,IAAI,gBAAgB,KAAK;AAClE,QAAI;AAAc,eAAS,IAAI,QAAQ,KAAK;AAC5C,QAAI,CAAC;AACH,UAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,cAAM,IAAI,MAAM,kDAAkD;;AAGtE,WAAO;EACT;;EAEA,YAAY,KAAa;AACvB,WAAO,cAAc,MAAM,GAAG;EAChC;;;EAGA,KAAK,GAAW,GAAW,WAAkB;AAC3C,WAAO,YAAY,IAAI;EACzB;;AAsBI,SAAU,MAAM,OAAe,OAAkB,CAAA,GAAE;AACvD,SAAO,IAAI,OAAO,OAAO,IAAI;AAC/B;;;ACthBA,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AAqH9B,SAAU,SAAwC,WAAoB,MAAO;AACjF,QAAM,MAAM,KAAK,OAAM;AACvB,SAAO,YAAY,MAAM;AAC3B;AAQM,SAAU,WACd,GACA,QAAW;AAEX,QAAM,aAAa,cACjB,EAAE,IACF,OAAO,IAAI,CAAC,MAAM,EAAE,CAAE,CAAC;AAEzB,SAAO,OAAO,IAAI,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,SAAS,WAAW,CAAC,CAAC,CAAC,CAAC;AACrE;AAEA,SAAS,UAAU,GAAW,MAAY;AACxC,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,KAAK,KAAK,IAAI;AAC5C,UAAM,IAAI,MAAM,uCAAuC,OAAO,cAAc,CAAC;AACjF;AAWA,SAAS,UAAU,GAAW,YAAkB;AAC9C,YAAU,GAAG,UAAU;AACvB,QAAM,UAAU,KAAK,KAAK,aAAa,CAAC,IAAI;AAC5C,QAAM,aAAa,MAAM,IAAI;AAC7B,QAAM,YAAY,KAAK;AACvB,QAAM,OAAO,QAAQ,CAAC;AACtB,QAAM,UAAU,OAAO,CAAC;AACxB,SAAO,EAAE,SAAS,YAAY,MAAM,WAAW,QAAO;AACxD;AAEA,SAAS,YAAY,GAAW,QAAgB,OAAY;AAC1D,QAAM,EAAE,YAAY,MAAM,WAAW,QAAO,IAAK;AACjD,MAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,MAAI,QAAQ,KAAK;AAQjB,MAAI,QAAQ,YAAY;AAEtB,aAAS;AACT,aAASA;EACX;AACA,QAAM,cAAc,SAAS;AAC7B,QAAM,SAAS,cAAc,KAAK,IAAI,KAAK,IAAI;AAC/C,QAAM,SAAS,UAAU;AACzB,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,SAAS,MAAM;AAC9B,QAAM,UAAU;AAChB,SAAO,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO;AACxD;AAkBA,IAAM,mBAAmB,oBAAI,QAAO;AACpC,IAAM,mBAAmB,oBAAI,QAAO;AAEpC,SAAS,KAAK,GAAM;AAGlB,SAAO,iBAAiB,IAAI,CAAC,KAAK;AACpC;AAEA,SAAS,QAAQ,GAAS;AACxB,MAAI,MAAMC;AAAK,UAAM,IAAI,MAAM,cAAc;AAC/C;AAoBM,IAAO,OAAP,MAAW;;EAOf,YAAY,OAAW,MAAY;AANlB;AACA;AACA;AACR;AAIP,SAAK,OAAO,MAAM;AAClB,SAAK,OAAO,MAAM;AAClB,SAAK,KAAK,MAAM;AAChB,SAAK,OAAO;EACd;;EAGA,cAAc,KAAe,GAAW,IAAc,KAAK,MAAI;AAC7D,QAAI,IAAc;AAClB,WAAO,IAAIA,MAAK;AACd,UAAI,IAAIC;AAAK,YAAI,EAAE,IAAI,CAAC;AACxB,UAAI,EAAE,OAAM;AACZ,YAAMA;IACR;AACA,WAAO;EACT;;;;;;;;;;;;;EAcQ,iBAAiB,OAAiB,GAAS;AACjD,UAAM,EAAE,SAAS,WAAU,IAAK,UAAU,GAAG,KAAK,IAAI;AACtD,UAAM,SAAqB,CAAA;AAC3B,QAAI,IAAc;AAClB,QAAI,OAAO;AACX,aAAS,SAAS,GAAG,SAAS,SAAS,UAAU;AAC/C,aAAO;AACP,aAAO,KAAK,IAAI;AAEhB,eAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,eAAO,KAAK,IAAI,CAAC;AACjB,eAAO,KAAK,IAAI;MAClB;AACA,UAAI,KAAK,OAAM;IACjB;AACA,WAAO;EACT;;;;;;;EAQQ,KAAK,GAAW,aAAyB,GAAS;AAExD,QAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;AAAG,YAAM,IAAI,MAAM,gBAAgB;AAEzD,QAAI,IAAI,KAAK;AACb,QAAI,IAAI,KAAK;AAMb,UAAM,KAAK,UAAU,GAAG,KAAK,IAAI;AACjC,aAAS,SAAS,GAAG,SAAS,GAAG,SAAS,UAAU;AAElD,YAAM,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO,IAAK,YAAY,GAAG,QAAQ,EAAE;AACnF,UAAI;AACJ,UAAI,QAAQ;AAGV,YAAI,EAAE,IAAI,SAAS,QAAQ,YAAY,OAAO,CAAC,CAAC;MAClD,OAAO;AAEL,YAAI,EAAE,IAAI,SAAS,OAAO,YAAY,MAAM,CAAC,CAAC;MAChD;IACF;AACA,YAAQ,CAAC;AAIT,WAAO,EAAE,GAAG,EAAC;EACf;;;;;;EAOQ,WACN,GACA,aACA,GACA,MAAgB,KAAK,MAAI;AAEzB,UAAM,KAAK,UAAU,GAAG,KAAK,IAAI;AACjC,aAAS,SAAS,GAAG,SAAS,GAAG,SAAS,UAAU;AAClD,UAAI,MAAMD;AAAK;AACf,YAAM,EAAE,OAAO,QAAQ,QAAQ,MAAK,IAAK,YAAY,GAAG,QAAQ,EAAE;AAClE,UAAI;AACJ,UAAI,QAAQ;AAGV;MACF,OAAO;AACL,cAAM,OAAO,YAAY,MAAM;AAC/B,cAAM,IAAI,IAAI,QAAQ,KAAK,OAAM,IAAK,IAAI;MAC5C;IACF;AACA,YAAQ,CAAC;AACT,WAAO;EACT;EAEQ,eAAe,GAAW,OAAiB,WAA4B;AAE7E,QAAI,OAAO,iBAAiB,IAAI,KAAK;AACrC,QAAI,CAAC,MAAM;AACT,aAAO,KAAK,iBAAiB,OAAO,CAAC;AACrC,UAAI,MAAM,GAAG;AAEX,YAAI,OAAO,cAAc;AAAY,iBAAO,UAAU,IAAI;AAC1D,yBAAiB,IAAI,OAAO,IAAI;MAClC;IACF;AACA,WAAO;EACT;EAEA,OACE,OACA,QACA,WAA4B;AAE5B,UAAM,IAAI,KAAK,KAAK;AACpB,WAAO,KAAK,KAAK,GAAG,KAAK,eAAe,GAAG,OAAO,SAAS,GAAG,MAAM;EACtE;EAEA,OAAO,OAAiB,QAAgB,WAA8B,MAAe;AACnF,UAAM,IAAI,KAAK,KAAK;AACpB,QAAI,MAAM;AAAG,aAAO,KAAK,cAAc,OAAO,QAAQ,IAAI;AAC1D,WAAO,KAAK,WAAW,GAAG,KAAK,eAAe,GAAG,OAAO,SAAS,GAAG,QAAQ,IAAI;EAClF;;;;EAKA,YAAY,GAAa,GAAS;AAChC,cAAU,GAAG,KAAK,IAAI;AACtB,qBAAiB,IAAI,GAAG,CAAC;AACzB,qBAAiB,OAAO,CAAC;EAC3B;EAEA,SAAS,KAAa;AACpB,WAAO,KAAK,GAAG,MAAM;EACvB;;AA+KF,SAAS,YAAe,OAAe,OAAmB,MAAc;AACtE,MAAI,OAAO;AACT,QAAI,MAAM,UAAU;AAAO,YAAM,IAAI,MAAM,gDAAgD;AAC3F,kBAAc,KAAK;AACnB,WAAO;EACT,OAAO;AACL,WAAO,MAAM,OAAO,EAAE,KAAI,CAAE;EAC9B;AACF;AAIM,SAAU,kBACd,MACA,OACA,YAA8B,CAAA,GAC9B,QAAgB;AAEhB,MAAI,WAAW;AAAW,aAAS,SAAS;AAC5C,MAAI,CAAC,SAAS,OAAO,UAAU;AAAU,UAAM,IAAI,MAAM,kBAAkB,IAAI,eAAe;AAC9F,aAAW,KAAK,CAAC,KAAK,KAAK,GAAG,GAAY;AACxC,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,EAAE,OAAO,QAAQ,YAAY,MAAME;AACrC,YAAM,IAAI,MAAM,SAAS,CAAC,0BAA0B;EACxD;AACA,QAAM,KAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAM,KAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,QAAM,KAAgB,SAAS,gBAAgB,MAAM;AACrD,QAAM,SAAS,CAAC,MAAM,MAAM,KAAK,EAAE;AACnC,aAAW,KAAK,QAAQ;AAEtB,QAAI,CAAC,GAAG,QAAQ,MAAM,CAAC,CAAC;AACtB,YAAM,IAAI,MAAM,SAAS,CAAC,0CAA0C;EACxE;AACA,UAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,CAAC;AAC9C,SAAO,EAAE,OAAO,IAAI,GAAE;AACxB;AAMM,SAAU,aACd,iBACA,cAAoC;AAEpC,SAAO,SAAS,OAAO,MAAiB;AACtC,UAAM,YAAY,gBAAgB,IAAI;AACtC,WAAO,EAAE,WAAW,WAAW,aAAa,SAAS,EAAC;EACxD;AACF;;;ACllBA,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAAtD,IAAyDC,OAAM,OAAO,CAAC;AA0IvE,SAAS,YAAY,IAAoB,OAAoB,GAAW,GAAS;AAC/E,QAAM,KAAK,GAAG,IAAI,CAAC;AACnB,QAAM,KAAK,GAAG,IAAI,CAAC;AACnB,QAAM,OAAO,GAAG,IAAI,GAAG,IAAI,MAAM,GAAG,EAAE,GAAG,EAAE;AAC3C,QAAM,QAAQ,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,KAAK;AAC3B;AAEM,SAAU,QAAQ,QAAqB,YAA8B,CAAA,GAAE;AAC3E,QAAM,YAAY,kBAAkB,WAAW,QAAQ,WAAW,UAAU,MAAM;AAClF,QAAM,EAAE,IAAI,GAAE,IAAK;AACnB,MAAI,QAAQ,UAAU;AACtB,QAAM,EAAE,GAAG,SAAQ,IAAK;AACxB,iBAAe,WAAW,CAAA,GAAI,EAAE,SAAS,WAAU,CAAE;AAMrD,QAAM,OAAOD,QAAQ,OAAO,GAAG,QAAQ,CAAC,IAAID;AAC5C,QAAM,OAAO,CAAC,MAAc,GAAG,OAAO,CAAC;AAGvC,QAAMG,WACJ,UAAU,YACT,CAAC,GAAW,MAAa;AACxB,QAAI;AACF,aAAO,EAAE,SAAS,MAAM,OAAO,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,EAAC;IACtD,SAAS,GAAG;AACV,aAAO,EAAE,SAAS,OAAO,OAAOJ,KAAG;IACrC;EACF;AAIF,MAAI,CAAC,YAAY,IAAI,OAAO,MAAM,IAAI,MAAM,EAAE;AAC5C,UAAM,IAAI,MAAM,mCAAmC;AAMrD,WAAS,OAAO,OAAe,GAAW,UAAU,OAAK;AACvD,UAAM,MAAM,UAAUC,OAAMD;AAC5B,aAAS,gBAAgB,OAAO,GAAG,KAAK,IAAI;AAC5C,WAAO;EACT;AAEA,WAAS,SAAS,OAAc;AAC9B,QAAI,EAAE,iBAAiB;AAAQ,YAAM,IAAI,MAAM,uBAAuB;EACxE;AAGA,QAAM,eAAe,SAAS,CAAC,GAAU,OAAoC;AAC3E,UAAM,EAAE,GAAG,GAAG,EAAC,IAAK;AACpB,UAAM,MAAM,EAAE,IAAG;AACjB,QAAI,MAAM;AAAM,WAAK,MAAMG,OAAO,GAAG,IAAI,CAAC;AAC1C,UAAM,IAAI,KAAK,IAAI,EAAE;AACrB,UAAM,IAAI,KAAK,IAAI,EAAE;AACrB,UAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACvB,QAAI;AAAK,aAAO,EAAE,GAAGH,MAAK,GAAGC,KAAG;AAChC,QAAI,OAAOA;AAAK,YAAM,IAAI,MAAM,kBAAkB;AAClD,WAAO,EAAE,GAAG,EAAC;EACf,CAAC;AACD,QAAM,kBAAkB,SAAS,CAAC,MAAY;AAC5C,UAAM,EAAE,GAAG,EAAC,IAAK;AACjB,QAAI,EAAE,IAAG;AAAI,YAAM,IAAI,MAAM,iBAAiB;AAG9C,UAAM,EAAE,GAAG,GAAG,GAAG,EAAC,IAAK;AACvB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,KAAK,EAAE;AACvB,UAAM,MAAM,KAAK,KAAK,CAAC;AACvB,UAAM,OAAO,KAAK,KAAK,KAAK,MAAM,EAAE,CAAC;AACrC,UAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;AAC/C,QAAI,SAAS;AAAO,YAAM,IAAI,MAAM,uCAAuC;AAE3E,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,QAAI,OAAO;AAAI,YAAM,IAAI,MAAM,uCAAuC;AACtE,WAAO;EACT,CAAC;AAID,QAAM,SAAN,MAAM,OAAK;IAeT,YAAY,GAAW,GAAW,GAAW,GAAS;AAL7C;AACA;AACA;AACA;AAGP,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,WAAK,IAAI,OAAO,KAAK,GAAG,IAAI;AAC5B,WAAK,IAAI,OAAO,KAAK,CAAC;AACtB,aAAO,OAAO,IAAI;IACpB;IAEA,OAAO,QAAK;AACV,aAAO;IACT;IAEA,OAAO,WAAW,GAAsB;AACtC,UAAI,aAAa;AAAO,cAAM,IAAI,MAAM,4BAA4B;AACpE,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,CAAA;AACtB,aAAO,KAAK,CAAC;AACb,aAAO,KAAK,CAAC;AACb,aAAO,IAAI,OAAM,GAAG,GAAGA,MAAK,KAAK,IAAI,CAAC,CAAC;IACzC;;IAGA,OAAO,UAAU,OAAmB,SAAS,OAAK;AAChD,YAAM,MAAM,GAAG;AACf,YAAM,EAAE,GAAG,EAAC,IAAK;AACjB,cAAQ,UAAU,OAAO,OAAO,KAAK,OAAO,CAAC;AAC7C,YAAM,QAAQ,QAAQ;AACtB,YAAM,SAAS,UAAU,KAAK;AAC9B,YAAM,WAAW,MAAM,MAAM,CAAC;AAC9B,aAAO,MAAM,CAAC,IAAI,WAAW,CAAC;AAC9B,YAAM,IAAI,gBAAgB,MAAM;AAMhC,YAAM,MAAM,SAAS,OAAO,GAAG;AAC/B,eAAS,WAAW,GAAGD,MAAK,GAAG;AAI/B,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,IAAI,KAAK,KAAKC,IAAG;AACvB,YAAM,IAAI,KAAK,IAAI,KAAK,CAAC;AACzB,UAAI,EAAE,SAAS,OAAO,EAAC,IAAKG,SAAQ,GAAG,CAAC;AACxC,UAAI,CAAC;AAAS,cAAM,IAAI,MAAM,iCAAiC;AAC/D,YAAM,UAAU,IAAIH,UAASA;AAC7B,YAAM,iBAAiB,WAAW,SAAU;AAC5C,UAAI,CAAC,UAAU,MAAMD,QAAO;AAE1B,cAAM,IAAI,MAAM,0BAA0B;AAC5C,UAAI,kBAAkB;AAAQ,YAAI,KAAK,CAAC,CAAC;AACzC,aAAO,OAAM,WAAW,EAAE,GAAG,EAAC,CAAE;IAClC;IAEA,OAAO,QAAQ,KAAa,SAAS,OAAK;AACxC,aAAO,OAAM,UAAU,WAAW,GAAG,GAAG,MAAM;IAChD;IAEA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IACA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IAEA,WAAW,aAAqB,GAAG,SAAS,MAAI;AAC9C,WAAK,YAAY,MAAM,UAAU;AACjC,UAAI,CAAC;AAAQ,aAAK,SAASE,IAAG;AAC9B,aAAO;IACT;;IAGA,iBAAc;AACZ,sBAAgB,IAAI;IACtB;;IAGA,OAAO,OAAY;AACjB,eAAS,KAAK;AACd,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,YAAM,OAAO,KAAK,KAAK,EAAE;AACzB,aAAO,SAAS,QAAQ,SAAS;IACnC;IAEA,MAAG;AACD,aAAO,KAAK,OAAO,OAAM,IAAI;IAC/B;IAEA,SAAM;AAEJ,aAAO,IAAI,OAAM,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/D;;;;IAKA,SAAM;AACJ,YAAM,EAAE,EAAC,IAAK;AACd,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAKA,OAAM,KAAK,KAAK,EAAE,CAAC;AAClC,YAAM,IAAI,KAAK,IAAI,CAAC;AACpB,YAAM,OAAO,KAAK;AAClB,YAAM,IAAI,KAAK,KAAK,OAAO,IAAI,IAAI,IAAI,CAAC;AACxC,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,aAAO,IAAI,OAAM,IAAI,IAAI,IAAI,EAAE;IACjC;;;;IAKA,IAAI,OAAY;AACd,eAAS,KAAK;AACd,YAAM,EAAE,GAAG,EAAC,IAAK;AACjB,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AACvC,YAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AACvC,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,KAAK,KAAK,IAAI,EAAE;AAC1B,YAAM,IAAI,KAAK,KAAK,EAAE;AACtB,YAAM,IAAI,MAAM,KAAK,OAAO,KAAK,MAAM,IAAI,CAAC;AAC5C,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,IAAI;AACd,YAAM,IAAI,KAAK,IAAI,IAAI,CAAC;AACxB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,YAAM,KAAK,KAAK,IAAI,CAAC;AACrB,aAAO,IAAI,OAAM,IAAI,IAAI,IAAI,EAAE;IACjC;IAEA,SAAS,OAAY;AACnB,aAAO,KAAK,IAAI,MAAM,OAAM,CAAE;IAChC;;IAGA,SAAS,QAAc;AAErB,UAAI,CAAC,GAAG,YAAY,MAAM;AAAG,cAAM,IAAI,MAAM,4CAA4C;AACzF,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,OAAO,MAAM,QAAQ,CAACG,OAAM,WAAW,QAAOA,EAAC,CAAC;AACtE,aAAO,WAAW,QAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IACpC;;;;;;IAOA,eAAe,QAAgB,MAAM,OAAM,MAAI;AAE7C,UAAI,CAAC,GAAG,QAAQ,MAAM;AAAG,cAAM,IAAI,MAAM,4CAA4C;AACrF,UAAI,WAAWL;AAAK,eAAO,OAAM;AACjC,UAAI,KAAK,IAAG,KAAM,WAAWC;AAAK,eAAO;AACzC,aAAO,KAAK,OAAO,MAAM,QAAQ,CAAC,MAAM,WAAW,QAAO,CAAC,GAAG,GAAG;IACnE;;;;;IAMA,eAAY;AACV,aAAO,KAAK,eAAe,QAAQ,EAAE,IAAG;IAC1C;;;IAIA,gBAAa;AACX,aAAO,KAAK,OAAO,MAAM,MAAM,CAAC,EAAE,IAAG;IACvC;;;IAIA,SAAS,WAAkB;AACzB,aAAO,aAAa,MAAM,SAAS;IACrC;IAEA,gBAAa;AACX,UAAI,aAAaA;AAAK,eAAO;AAC7B,aAAO,KAAK,eAAe,QAAQ;IACrC;IAEA,UAAO;AACL,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,SAAQ;AAE9B,YAAM,QAAQ,GAAG,QAAQ,CAAC;AAG1B,YAAM,MAAM,SAAS,CAAC,KAAK,IAAIA,OAAM,MAAO;AAC5C,aAAO;IACT;IACA,QAAK;AACH,aAAO,WAAW,KAAK,QAAO,CAAE;IAClC;IAEA,WAAQ;AACN,aAAO,UAAU,KAAK,IAAG,IAAK,SAAS,KAAK,MAAK,CAAE;IACrD;;AA5NA;gBAFI,QAEY,QAAO,IAAI,OAAM,MAAM,IAAI,MAAM,IAAIA,MAAK,KAAK,MAAM,KAAK,MAAM,EAAE,CAAC;AAEnF;gBAJI,QAIY,QAAO,IAAI,OAAMD,MAAKC,MAAKA,MAAKD,IAAG;AAEnD;;gBANI,QAMY,MAAK;AAErB;gBARI,QAQY,MAAK;AARvB,MAAM,QAAN;AAgOA,QAAM,OAAO,IAAI,KAAK,OAAO,GAAG,IAAI;AACpC,QAAM,KAAK,WAAW,CAAC;AACvB,SAAO;AACT;AA8GM,SAAU,MAAM,OAAyB,OAAc,YAAuB,CAAA,GAAE;AACpF,MAAI,OAAO,UAAU;AAAY,UAAM,IAAI,MAAM,mCAAmC;AACpF,iBACE,WACA,CAAA,GACA;IACE,mBAAmB;IACnB,aAAa;IACb,QAAQ;IACR,SAAS;IACT,YAAY;GACb;AAGH,QAAM,EAAE,QAAO,IAAK;AACpB,QAAM,EAAE,MAAM,IAAI,GAAE,IAAK;AAEzB,QAAMM,eAAc,UAAU,eAAe;AAC7C,QAAMC,qBAAoB,UAAU,sBAAsB,CAAC,UAAsB;AACjF,QAAM,SACJ,UAAU,WACT,CAAC,MAAkB,KAAiB,WAAmB;AACtD,UAAM,QAAQ,QAAQ;AACtB,QAAI,IAAI,UAAU;AAAQ,YAAM,IAAI,MAAM,qCAAqC;AAC/E,WAAO;EACT;AAGF,WAAS,QAAQ,MAAgB;AAC/B,WAAO,GAAG,OAAO,gBAAgB,IAAI,CAAC;EACxC;AAGA,WAAS,iBAAiB,KAAe;AACvC,UAAM,MAAM,QAAQ;AACpB,WAAO,KAAK,QAAQ,WAAW,WAAW;AAG1C,UAAM,SAAS,OAAO,MAAM,GAAG,GAAG,IAAI,KAAK,iBAAiB;AAC5D,UAAM,OAAOA,mBAAkB,OAAO,MAAM,GAAG,GAAG,CAAC;AACnD,UAAM,SAAS,OAAO,MAAM,KAAK,IAAI,GAAG;AACxC,UAAM,SAAS,QAAQ,IAAI;AAC3B,WAAO,EAAE,MAAM,QAAQ,OAAM;EAC/B;AAGA,WAAS,qBAAqB,WAAqB;AACjD,UAAM,EAAE,MAAM,QAAQ,OAAM,IAAK,iBAAiB,SAAS;AAC3D,UAAM,QAAQ,KAAK,SAAS,MAAM;AAClC,UAAM,aAAa,MAAM,QAAO;AAChC,WAAO,EAAE,MAAM,QAAQ,QAAQ,OAAO,WAAU;EAClD;AAGA,WAAS,aAAa,WAAqB;AACzC,WAAO,qBAAqB,SAAS,EAAE;EACzC;AAGA,WAAS,mBAAmB,UAAsB,WAAW,GAAE,MAAO,MAAkB;AACtF,UAAM,MAAM,YAAY,GAAG,IAAI;AAC/B,WAAO,QAAQ,MAAM,OAAO,KAAK,OAAO,SAAS,QAAW,SAAS,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;EACrF;AAGA,WAAS,KACP,KACA,WACA,UAAoC,CAAA,GAAE;AAEtC,UAAM,OAAO,KAAK,QAAW,SAAS;AACtC,QAAI;AAAS,YAAM,QAAQ,GAAG;AAC9B,UAAM,EAAE,QAAQ,QAAQ,WAAU,IAAK,qBAAqB,SAAS;AACrE,UAAM,IAAI,mBAAmB,QAAQ,SAAS,QAAQ,GAAG;AACzD,UAAM,IAAI,KAAK,SAAS,CAAC,EAAE,QAAO;AAClC,UAAM,IAAI,mBAAmB,QAAQ,SAAS,GAAG,YAAY,GAAG;AAChE,UAAM,IAAI,GAAG,OAAO,IAAI,IAAI,MAAM;AAClC,QAAI,CAAC,GAAG,QAAQ,CAAC;AAAG,YAAM,IAAI,MAAM,wBAAwB;AAC5D,UAAM,KAAK,YAAY,GAAG,GAAG,QAAQ,CAAC,CAAC;AACvC,WAAO,OAAO,IAAI,QAAQ,WAAW,QAAQ;EAC/C;AAGA,QAAM,aAAyD,EAAE,QAAQ,KAAI;AAM7E,WAAS,OACP,KACA,KACA,WACA,UAAU,YAAU;AAEpB,UAAM,EAAE,SAAS,OAAM,IAAK;AAC5B,UAAM,MAAM,QAAQ;AACpB,UAAM,OAAO,KAAK,KAAK,WAAW;AAClC,UAAM,OAAO,KAAK,QAAW,SAAS;AACtC,gBAAY,OAAO,WAAW,QAAQ,WAAW,WAAW;AAC5D,QAAI,WAAW;AAAW,YAAM,QAAQ,QAAQ;AAChD,QAAI;AAAS,YAAM,QAAQ,GAAG;AAE9B,UAAM,MAAM,MAAM;AAClB,UAAM,IAAI,IAAI,SAAS,GAAG,GAAG;AAC7B,UAAM,IAAI,gBAAgB,IAAI,SAAS,KAAK,GAAG,CAAC;AAChD,QAAI,GAAG,GAAG;AACV,QAAI;AAIF,UAAI,MAAM,UAAU,WAAW,MAAM;AACrC,UAAI,MAAM,UAAU,GAAG,MAAM;AAC7B,WAAK,KAAK,eAAe,CAAC;IAC5B,SAAS,OAAO;AACd,aAAO;IACT;AACA,QAAI,CAAC,UAAU,EAAE,aAAY;AAAI,aAAO;AAExC,UAAM,IAAI,mBAAmB,SAAS,EAAE,QAAO,GAAI,EAAE,QAAO,GAAI,GAAG;AACnE,UAAM,MAAM,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;AAGrC,WAAO,IAAI,SAAS,EAAE,EAAE,cAAa,EAAG,IAAG;EAC7C;AAEA,QAAM,QAAQ,GAAG;AACjB,QAAM,UAAU;IACd,WAAW;IACX,WAAW;IACX,WAAW,IAAI;IACf,MAAM;;AAER,WAAS,gBAAgB,OAAOD,aAAY,QAAQ,IAAI,GAAC;AACvD,WAAO,OAAO,MAAM,QAAQ,MAAM,MAAM;EAC1C;AAEA,WAAS,iBAAiB,KAAe;AACvC,WAAO,QAAQ,GAAG,KAAK,IAAI,WAAW,GAAG;EAC3C;AAEA,WAAS,iBAAiB,KAAiB,QAAgB;AACzD,QAAI;AACF,aAAO,CAAC,CAAC,MAAM,UAAU,KAAK,MAAM;IACtC,SAAS,OAAO;AACd,aAAO;IACT;EACF;AAEA,QAAM,QAAQ;IACZ;IACA;IACA;IACA;;;;;;;;;;IAUA,aAAa,WAAqB;AAChC,YAAM,EAAE,EAAC,IAAK,MAAM,UAAU,SAAS;AACvC,YAAM,OAAO,QAAQ;AACrB,YAAM,UAAU,SAAS;AACzB,UAAI,CAAC,WAAW,SAAS;AAAI,cAAM,IAAI,MAAM,gCAAgC;AAC7E,YAAM,IAAI,UAAU,GAAG,IAAIE,OAAM,GAAGA,OAAM,CAAC,IAAI,GAAG,IAAI,IAAIA,MAAK,IAAIA,IAAG;AACtE,aAAO,GAAG,QAAQ,CAAC;IACrB;IACA,mBAAmB,WAAqB;AACtC,YAAM,OAAO,QAAQ;AACrB,aAAO,WAAW,IAAI;AACtB,YAAM,SAAS,MAAM,UAAU,SAAS,GAAG,IAAI,CAAC;AAChD,aAAOD,mBAAkB,MAAM,EAAE,SAAS,GAAG,IAAI;IACnD;;AAGF,SAAO,OAAO,OAAO;IACnB,QAAQ,aAAa,iBAAiB,YAAY;IAClD;IACA;IACA;IACA;IACA;IACA;GACD;AACH;;;AC1uBA,IAAuCE,OAAM,OAAO,CAAC;AAArD,IAAwDC,OAAM,OAAO,CAAC;AAEtE,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAGrC,IAAM,kBAAkB,OACtB,oEAAoE;AAKtE,IAAM,gBAA8C,wBAAO;EACzD,GAAG;EACH,GAAG,OAAO,oEAAoE;EAC9E,GAAGA;EACH,GAAG,OAAO,oEAAoE;EAC9E,GAAG,OAAO,oEAAoE;EAC9E,IAAI,OAAO,oEAAoE;EAC/E,IAAI,OAAO,oEAAoE;IAC9E;AAEH,SAAS,oBAAoB,GAAS;AAEpC,QAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC/E,QAAM,IAAI;AACV,QAAM,KAAM,IAAI,IAAK;AACrB,QAAM,KAAM,KAAK,IAAK;AACtB,QAAM,KAAM,KAAK,IAAIC,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,KAAM,KAAK,IAAIC,MAAK,CAAC,IAAI,IAAK;AACpC,QAAM,MAAO,KAAK,IAAIH,MAAK,CAAC,IAAI,KAAM;AACtC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAO,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,OAAQ,KAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AAC1C,QAAM,OAAQ,KAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,OAAQ,KAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,YAAa,KAAK,MAAME,MAAK,CAAC,IAAI,IAAK;AAE7C,SAAO,EAAE,WAAW,GAAE;AACxB;AAEA,SAAS,kBAAkB,OAAiB;AAG1C,QAAM,CAAC,KAAK;AAEZ,QAAM,EAAE,KAAK;AAEb,QAAM,EAAE,KAAK;AACb,SAAO;AACT;AAIA,IAAM,kBAAkC,uBACtC,+EAA+E;AAGjF,SAAS,QAAQ,GAAW,GAAS;AACnC,QAAM,IAAI;AACV,QAAM,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AAC3B,QAAM,KAAK,IAAI,KAAK,KAAK,GAAG,CAAC;AAE7B,QAAM,MAAM,oBAAoB,IAAI,EAAE,EAAE;AACxC,MAAI,IAAI,IAAI,IAAI,KAAK,KAAK,CAAC;AAC3B,QAAM,MAAM,IAAI,IAAI,IAAI,GAAG,CAAC;AAC5B,QAAM,QAAQ;AACd,QAAM,QAAQ,IAAI,IAAI,iBAAiB,CAAC;AACxC,QAAM,WAAW,QAAQ;AACzB,QAAM,WAAW,QAAQ,IAAI,CAAC,GAAG,CAAC;AAClC,QAAM,SAAS,QAAQ,IAAI,CAAC,IAAI,iBAAiB,CAAC;AAClD,MAAI;AAAU,QAAI;AAClB,MAAI,YAAY;AAAQ,QAAI;AAC5B,MAAI,aAAa,GAAG,CAAC;AAAG,QAAI,IAAI,CAAC,GAAG,CAAC;AACrC,SAAO,EAAE,SAAS,YAAY,UAAU,OAAO,EAAC;AAClD;AAEA,IAAM,gBAAgC,wBAAQ,eAAe,EAAE,QAAO,CAAE;AAcxE,SAAS,GAAG,MAAe;AACzB,SAAO,MAAM,eAAe,QAAQ,OAAO,OAAO,EAAE,kBAAiB,GAAI,IAAI,CAAC;AAChF;AAgBO,IAAM,UAAiC,mBAAG,CAAA,CAAE;;;AT5HnD,SAAS,SAAS,OAA2B;AAC3C,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,QAAO,OAAO,aAAa,MAAM,CAAC,CAAE;AAC3E,SAAO,KAAK,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,MAAM,EAAE;AAC3E;AAEA,SAAS,WAAW,GAAuB;AACzC,QAAM,SAAS,EAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACrD,QAAM,MAAM,KAAK,MAAM;AACvB,QAAM,MAAM,IAAI,WAAW,IAAI,MAAM;AACrC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,KAAI,CAAC,IAAI,IAAI,WAAW,CAAC;AAC9D,SAAO;AACT;AAKO,SAAS,uBAAqC;AACnD,QAAM,KAAK,SAAS,OAAO;AAC3B,SAAO,EAAE,YAAY,GAAG,WAAW,WAAW,GAAG,UAAU;AAC7D;AAGO,SAAS,UAAU,YAAwB,SAAiC;AACjF,SAAO,SAAS,KAAK,SAAS,UAAU;AAC1C;AAMO,SAAS,YAAY,WAAuB,SAAqB,KAA0B;AAChG,SAAO,SAAS,OAAO,KAAK,SAAS,SAAS;AAChD;AAQO,SAAS,WACd,aACA,WACA,KACiB;AACjB,SAAO;AAAA,IACL,SAAS;AAAA,IACT,YAAY,QAAQ,KAAK,KAAK,WAAW;AAAA,IACzC,UAAU,SAAS,KAAK,KAAK,SAAS;AAAA,EACxC;AACF;AAMO,SAAS,aACd,YACA,UACA,KACA,KACS;AACT,MAAI,IAAI,YAAY,gBAAiB,QAAO;AAC5C,SACE,QAAQ,OAAO,IAAI,YAAY,KAAK,UAAU,KAC9C,SAAS,OAAO,IAAI,UAAU,KAAK,QAAQ;AAE/C;AAQO,SAAS,gBAAgB,KAA8B;AAC5D,SAAO,iBAAiB,SAAS,IAAI,UAAU,CAAC,IAAI,SAAS,IAAI,QAAQ,CAAC;AAC5E;AAMO,SAAS,gBAAgB,GAA4B;AAC1D,QAAM,QAAQ,EAAE,MAAM,GAAG;AACzB,MAAI,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,iBAAiB;AACtD,UAAM,IAAI;AAAA,MACR,oFAAoF,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,IACpG;AAAA,EACF;AACA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,YAAY,WAAW,MAAM,CAAC,CAAE;AAAA,IAChC,UAAU,WAAW,MAAM,CAAC,CAAE;AAAA,EAChC;AACF;AAQO,SAAS,wBAAwB,KAAyB;AAC/D,SAAO;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,GAAG,SAAS,GAAG;AAAA,EACjB;AACF;AAMO,SAAS,wBAAwB,KAAyB;AAC/D,QAAM,IAAI;AACV,MAAI,EAAE,KAAK,MAAM,SAAS,EAAE,KAAK,MAAM,aAAa;AAClD,UAAM,IAAI;AAAA,MACR,uEACc,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC;AAAA,IAC1C;AAAA,EACF;AACA,QAAM,IAAI,EAAE,GAAG;AACf,MAAI,OAAO,MAAM,YAAY,EAAE,WAAW,GAAG;AAC3C,UAAM,IAAI,MAAM,iDAAiD;AAAA,EACnE;AACA,SAAO,WAAW,CAAC;AACrB;AAaO,SAAS,eAAuB;AACrC,MAAI,OAAO,WAAW,WAAW,eAAe,OAAO,WAAW,OAAO,eAAe,YAAY;AAClG,WAAO,WAAW,OAAO,WAAW;AAAA,EACtC;AAEA,MAAI;AAEF,UAAM,EAAE,WAAW,IAAI,UAAQ,QAAQ;AACvC,WAAO,WAAW;AAAA,EACpB,QAAQ;AAEN,WAAO,uCAAuC,QAAQ,SAAS,CAAC,MAAM;AACpE,YAAM,IAAK,KAAK,OAAO,IAAI,KAAM;AACjC,YAAM,IAAI,MAAM,MAAM,IAAK,IAAI,IAAO;AACtC,aAAO,EAAE,SAAS,EAAE;AAAA,IACtB,CAAC;AAAA,EACH;AACF;AAMO,SAAS,eAAe,QAAgB,MAAsB;AAEnE,MAAI,OAAO,YAAY,eAAe,QAAwB;AAC5D,QAAI;AAEF,YAAM,EAAE,WAAW,IAAI;AAGvB,aAAO,WAAW,UAAU,MAAM,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK;AAAA,IAC/D,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO,eAAe,QAAQ,IAAI;AACpC;AAKA,SAAS,OAAO,KAA6B;AAC3C,QAAM,IAAI;AAAA,IACR;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,IACpC;AAAA,IAAY;AAAA,IAAY;AAAA,IAAY;AAAA,EACtC;AACA,MAAI,KAAK,YAAY,KAAK,YAAY,KAAK,YAAY,KAAK;AAC5D,MAAI,KAAK,YAAY,KAAK,YAAY,KAAK,WAAY,KAAK;AAE5D,QAAM,SAAS,IAAI;AACnB,QAAME,UAAS,SAAS;AACxB,QAAM,SAAmB,CAAC,GAAG,GAAG;AAChC,SAAO,KAAK,GAAI;AAChB,SAAQ,OAAO,SAAS,OAAQ,GAAI,QAAO,KAAK,CAAC;AACjD,WAAS,IAAI,GAAG,KAAK,GAAG,IAAK,QAAO,KAAMA,UAAS,KAAK,IAAI,GAAG,IAAI,CAAC,IAAK,GAAI;AAE7E,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,IAAI;AAC1C,UAAM,IAAc,CAAC;AACrB,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAE,CAAC,IAAK,OAAO,IAAE,IAAE,CAAC,KAAG,KAAK,OAAO,IAAE,IAAE,IAAE,CAAC,KAAG,KAAK,OAAO,IAAE,IAAE,IAAE,CAAC,KAAG,IAAG,OAAO,IAAE,IAAE,IAAE,CAAC;AAAA,IACtF;AACA,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,KAAK,IAAI,EAAE,IAAE,EAAE,GAAE,CAAC,IAAE,IAAI,EAAE,IAAE,EAAE,GAAE,EAAE,IAAG,EAAE,IAAE,EAAE,MAAI;AACrD,YAAM,KAAK,IAAI,EAAE,IAAE,CAAC,GAAE,EAAE,IAAE,IAAI,EAAE,IAAE,CAAC,GAAE,EAAE,IAAG,EAAE,IAAE,CAAC,MAAI;AACnD,QAAE,CAAC,IAAK,EAAE,IAAE,EAAE,IAAE,KAAG,EAAE,IAAE,CAAC,IAAE,OAAQ;AAAA,IACpC;AACA,QAAI,CAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,IAAI,CAAC,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE;AAChD,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,KAAK,IAAI,GAAE,CAAC,IAAE,IAAI,GAAE,EAAE,IAAE,IAAI,GAAE,EAAE;AACtC,YAAM,KAAM,IAAE,IAAI,CAAC,IAAE;AACrB,YAAM,QAAS,IAAE,KAAG,KAAG,EAAE,CAAC,IAAE,EAAE,CAAC,MAAK;AACpC,YAAM,KAAK,IAAI,GAAE,CAAC,IAAE,IAAI,GAAE,EAAE,IAAE,IAAI,GAAE,EAAE;AACtC,YAAM,MAAO,IAAE,IAAI,IAAE,IAAI,IAAE;AAC3B,YAAM,QAAS,KAAG,QAAO;AACzB,OAAC,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,CAAC,IAAI,CAAC,GAAE,GAAE,GAAG,IAAE,UAAS,GAAE,GAAE,GAAE,GAAG,QAAM,UAAS,CAAC;AAAA,IAClE;AACA,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AACzD,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAG,SAAI,KAAG,MAAK;AAAA,EAC3D;AACA,QAAM,MAAM,IAAI,WAAW,EAAE;AAC7B,QAAM,OAAO,IAAI,SAAS,IAAI,MAAM;AACpC,GAAC,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,IAAG,EAAE,EAAE,QAAQ,CAAC,GAAE,MAAM,KAAK,UAAU,IAAE,GAAG,CAAC,CAAC;AACjE,SAAO;AACT;AAEA,SAAS,IAAI,GAAW,GAAmB;AAAE,SAAQ,MAAI,IAAI,KAAI,KAAG;AAAK;AAEzE,SAAS,QAAQ,GAAuB;AACtC,MAAI,OAAO,gBAAgB,YAAa,QAAO,IAAI,YAAY,EAAE,OAAO,CAAC;AACzE,QAAM,MAAM,IAAI,WAAW,EAAE,MAAM;AACnC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI;AAC9D,SAAO;AACT;AAEA,SAAS,MAAM,OAA2B;AACxC,SAAO,MAAM,KAAK,KAAK,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAE,GAAG,CAAC,EAAE,KAAK,EAAE;AAC3E;AAEA,SAAS,eAAe,KAAa,MAAsB;AACzD,QAAM,QAAQ;AACd,MAAI,WAAW,QAAQ,GAAG;AAC1B,MAAI,SAAS,SAAS,MAAO,YAAW,OAAO,QAAQ;AACvD,QAAM,OAAO,IAAI,WAAW,KAAK,GAAG,OAAO,IAAI,WAAW,KAAK;AAC/D,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,SAAK,CAAC,KAAK,SAAS,CAAC,KAAK,KAAK;AAC/B,SAAK,CAAC,KAAK,SAAS,CAAC,KAAK,KAAK;AAAA,EACjC;AACA,QAAM,YAAY,QAAQ,IAAI;AAC9B,QAAM,QAAQ,IAAI,WAAW,QAAQ,UAAU,MAAM;AACrD,QAAM,IAAI,IAAI;AAAG,QAAM,IAAI,WAAW,KAAK;AAC3C,QAAM,YAAY,OAAO,KAAK;AAC9B,QAAM,QAAQ,IAAI,WAAW,QAAQ,EAAE;AACvC,QAAM,IAAI,IAAI;AAAG,QAAM,IAAI,WAAW,KAAK;AAC3C,SAAO,MAAM,OAAO,KAAK,CAAC;AAC5B;;;AUtSO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAMO,IAAM,iBAAN,MAAqB;AAAA,EAG1B,YAAY,YAAY,KAAK;AAF7B,wBAAS;AAGP,QAAI,YAAY,KAAK,YAAY,GAAG;AAClC,YAAM,IAAI,UAAU,8CAAyC,SAAS,EAAE;AAAA,IAC1E;AACA,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAGA,OAAO,YAA6B;AAClC,WAAO,cAAc,KAAK;AAAA,EAC5B;AAAA;AAAA,EAGA,OAAO,YAA4B;AACjC,WAAO,aAAa,KAAK;AAAA,EAC3B;AAAA;AAAA,EAGA,OAAO,YAAoB,QAAuB;AAChD,QAAI,CAAC,KAAK,OAAO,UAAU,GAAG;AAC5B,YAAM,QAAQ,SAAS,gBAAgB,MAAM,MAAM;AACnD,YAAM,IAAI;AAAA,QACR,cAAc,UAAU,GAAG,KAAK,uBAAuB,KAAK,SAAS;AAAA,MACvE;AAAA,IACF;AAAA,EACF;AACF;AAiBO,IAAM,WAAN,MAAe;AAAA,EAAf;AACL,wBAAQ,YAAyC,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMzD,QAAQ,QAAgB,UAAmC,CAAC,GAAW;AACrE,UAAM,QAAQ,aAAa;AAC3B,SAAK,SAAS,IAAI,OAAO;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,QAAQ;AAAA,IACV,CAAC;AACD,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAQ,OAAqB;AAC3B,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK;AACxC,QAAI,CAAC,SAAU,OAAM,IAAI,UAAU,kBAAkB,KAAK,EAAE;AAC5D,aAAS,SAAS;AAAA,EACpB;AAAA;AAAA,EAGA,KAAK,OAAe,QAAuB;AACzC,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK;AACxC,QAAI,CAAC,SAAU,OAAM,IAAI,UAAU,kBAAkB,KAAK,EAAE;AAC5D,aAAS,SAAS;AAClB,QAAI,OAAQ,UAAS,SAAS;AAAA,EAChC;AAAA;AAAA,EAGA,MAAM,OAA+B;AACnC,UAAM,WAAW,KAAK,SAAS,IAAI,KAAK;AACxC,QAAI,CAAC,SAAU,OAAM,IAAI,UAAU,kBAAkB,KAAK,EAAE;AAC5D,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA,EAGA,IAAI,mBAAsC;AACxC,WAAO,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,SAAS;AAAA,EAChF;AAAA;AAAA,EAGA,YAAY,OAA4C;AACtD,WAAO,KAAK,SAAS,IAAI,KAAK;AAAA,EAChC;AAAA;AAAA,EAGA,gBAAsB;AACpB,eAAW,CAAC,OAAO,QAAQ,KAAK,KAAK,SAAS,QAAQ,GAAG;AACvD,UAAI,SAAS,WAAW,WAAW;AACjC,aAAK,SAAS,OAAO,KAAK;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACF;;;AC1FO,IAAM,aAAN,cAAyB,MAAM;AAAA,EACpC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEA,SAAS,mBACP,UACA,QACA,UACA,WACA,QACQ;AACR,QAAM,UAAU,KAAK;AAAA,IACnB,EAAE,UAAU,QAAQ,UAAU,WAAW,OAAO;AAAA,IAChD,OAAO,KAAK,EAAE,UAAU,QAAQ,UAAU,WAAW,OAAO,CAAC,EAAE,KAAK;AAAA,EACtE;AACA,SAAO,eAAe,qBAAqB,OAAO;AACpD;AAEA,SAAS,YAAY,QAAgB,MAAoC;AACvE,QAAM,EAAE,MAAM,UAAU,GAAG,KAAK,IAAI;AACpC,QAAM,UAAU,KAAK,UAAU,MAAM,OAAO,KAAK,IAAI,EAAE,KAAK,CAAC;AAC7D,SAAO,eAAe,QAAQ,OAAO;AACvC;AAEO,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EAapB,YAAY,MAA4B;AAZhD,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AACT,wBAAS;AAGP,SAAK,WAAW,KAAK;AACrB,SAAK,SAAS,KAAK;AACnB,SAAK,WAAW,KAAK;AACrB,SAAK,aAAa,KAAK;AACvB,SAAK,gBAAgB,KAAK;AAC1B,SAAK,SAAS,KAAK;AACnB,SAAK,iBAAiB,KAAK;AAC3B,SAAK,YAAY,KAAK;AACtB,SAAK,cAAc,KAAK;AACxB,SAAK,eAAe,KAAK;AACzB,SAAK,OAAO,KAAK;AAAA,EACnB;AAAA,EAEA,OAAO,OACL,MACA,QACA,eAA8B,MACZ;AAClB,UAAM,WAAW,aAAa;AAC9B,UAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,UAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,cAAc,mBAAmB,UAAU,KAAK,QAAQ,UAAU,WAAW,MAAM;AAEzF,UAAM,QAA8B;AAAA,MAClC;AAAA,MACA,QAAQ,KAAK;AAAA,MACb;AAAA,MACA,YAAY,KAAK;AAAA,MACjB,eAAe,KAAK;AAAA,MACpB;AAAA,MACA,gBAAgB,KAAK,kBAAkB;AAAA,MACvC;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM;AAAA,IACR;AACA,UAAM,OAAO,YAAY,QAAQ,KAAK;AACtC,WAAO,IAAI,kBAAiB,KAAK;AAAA,EACnC;AAAA,EAEA,OAAO,QAAyB;AAC9B,UAAM,WAAW,YAAY,QAAQ,KAAK,OAAO,CAAC;AAClD,WAAO,aAAa,KAAK;AAAA,EAC3B;AAAA,EAEA,SAA+B;AAC7B,WAAO;AAAA,MACL,UAAU,KAAK;AAAA,MACf,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,eAAe,KAAK;AAAA,MACpB,QAAQ,KAAK;AAAA,MACb,gBAAgB,KAAK;AAAA,MACrB,WAAW,KAAK;AAAA,MAChB,aAAa,KAAK;AAAA,MAClB,cAAc,KAAK;AAAA,MACnB,MAAM,KAAK;AAAA,IACb;AAAA,EACF;AAAA,EAEA,OAAO,SAAS,KAA6C;AAC3D,WAAO,IAAI,kBAAiB,GAAG;AAAA,EACjC;AACF;AAYO,IAAM,aAAN,MAAM,YAAW;AAAA,EAItB,YAAY,QAAgB;AAH5B,wBAAQ,YAA+B,CAAC;AACxC,wBAAQ;AAGN,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,UAAuC;AACzC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OAAO,MAA8C;AACnD,UAAM,OAAO,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC;AACnD,UAAM,WAAW,MAAM,eAAe;AACtC,UAAM,SAAS,iBAAiB,OAAO,MAAM,KAAK,SAAS,QAAQ;AACnE,SAAK,SAAS,KAAK,MAAM;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,YAA+B;AAC7B,UAAM,SAAmB,CAAC;AAC1B,QAAI,WAA0B;AAE9B,eAAW,UAAU,KAAK,UAAU;AAClC,UAAI,CAAC,OAAO,OAAO,KAAK,OAAO,GAAG;AAChC,eAAO,KAAK,2BAA2B,OAAO,SAAS,MAAM,GAAG,CAAC,CAAC,EAAE;AAAA,MACtE;AACA,UAAI,aAAa,QAAQ,OAAO,iBAAiB,UAAU;AACzD,eAAO;AAAA,UACL,mBAAmB,OAAO,SAAS,MAAM,GAAG,CAAC,CAAC,mBAAmB,SAAS,MAAM,GAAG,EAAE,CAAC;AAAA,QACxF;AAAA,MACF;AACA,iBAAW,OAAO;AAAA,IACpB;AAEA,WAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO,KAAK,SAAS,QAAQ,OAAO;AAAA,EAC3E;AAAA,EAEA,UAAkB;AAChB,WAAO,KAAK,SAAS,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI;AAAA,EAC3E;AAAA,EAEA,OAAO,UAAU,MAAc,QAA4B;AACzD,UAAM,QAAQ,IAAI,YAAW,MAAM;AACnC,UAAM,QAAQ,KAAK,KAAK,EAAE,MAAM,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,MAAM,EAAE;AACnE,eAAW,QAAQ,OAAO;AACxB,YAAM,MAAM,KAAK,MAAM,IAAI;AAC3B,YAAM,SAAS,KAAK,iBAAiB,SAAS,GAAG,CAAC;AAAA,IACpD;AACA,WAAO;AAAA,EACT;AACF;;;ACvLA,SAAS,aAA+B;AACtC,SAAO,EAAE,IAAI,MAAM,QAAQ,CAAC,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC,EAAE;AACxD;AAEA,SAAS,KAAK,QAA0B,KAAmB;AACzD,SAAO,KAAK;AACZ,SAAO,OAAO,KAAK,GAAG;AACxB;AAEA,SAAS,KAAK,QAA0B,KAAmB;AACzD,SAAO,SAAS,KAAK,GAAG;AAC1B;AAEA,SAAS,KAAK,QAA0B,KAAmB;AACzD,SAAO,KAAK,KAAK,GAAG;AACtB;AAMO,SAAS,YAAY,KAA+B;AACzD,QAAM,SAAS,WAAW;AAC1B,MAAI;AACF,UAAM,SAAS,SAAS,MAAM,GAAG;AACjC,SAAK,QAAQ,uBAAkB;AAC/B,SAAK,QAAQ,oBAAoB,OAAO,QAAQ,EAAE;AAClD,SAAK,QAAQ,oBAAoB,OAAO,YAAY,EAAE;AACtD,SAAK,QAAQ,oBAAoB,OAAO,KAAK,EAAE;AAC/C,SAAK,QAAQ,oBAAoB,OAAO,OAAO,EAAE;AACjD,SAAK,QAAQ,oBAAoB,OAAO,QAAQ,EAAE;AAAA,EACpD,SAAS,GAAG;AACV,SAAK,QAAQ,qBAAqB,aAAa,QAAQ,EAAE,UAAU,CAAC,EAAE;AAAA,EACxE;AACA,SAAO;AACT;AAMO,SAAS,gBAAgB,MAAiC;AAC/D,QAAM,SAAS,WAAW;AAE1B,MAAI;AACJ,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI;AACF,YAAM,KAAK,MAAM,IAAI;AAAA,IACvB,QAAQ;AACN,WAAK,QAAQ,qBAAqB;AAClC,aAAO;AAAA,IACT;AAAA,EACF,WAAW,OAAO,SAAS,YAAY,SAAS,MAAM;AACpD,UAAM;AAAA,EACR,OAAO;AACL,SAAK,QAAQ,gCAAgC;AAC7C,WAAO;AAAA,EACT;AAGA,aAAW,SAAS,CAAC,QAAQ,OAAO,QAAQ,GAAG;AAC7C,QAAI,EAAE,SAAS,QAAQ,CAAC,IAAI,KAAK,GAAG;AAClC,WAAK,QAAQ,4BAA4B,KAAK,GAAG;AAAA,IACnD;AAAA,EACF;AAEA,MAAI,CAAC,OAAO,GAAI,QAAO;AAEvB,MAAI;AACF,UAAM,MAAM,YAAY,SAAS,GAAG;AACpC,SAAK,QAAQ,+BAA0B,IAAI,IAAI,GAAG;AAClD,SAAK,QAAQ,cAAc,IAAI,GAAG,EAAE;AACpC,SAAK,QAAQ,cAAc,IAAI,MAAM,EAAE;AACvC,QAAI,IAAI,eAAe,QAAW;AAChC,WAAK,QAAQ,kBAAkB,IAAI,UAAU,EAAE;AAAA,IACjD,OAAO;AACL,WAAK,QAAQ,kEAA0D;AAAA,IACzE;AACA,QAAI,IAAI,UAAU;AAChB,WAAK,QAAQ,qBAAqB,IAAI,WAAW,GAAG,SAAS,IAAI,WAAW,GAAG,EAAE;AAAA,IACnF,OAAO;AACL,WAAK,QAAQ,kDAAkD;AAAA,IACjE;AAAA,EACF,SAAS,GAAG;AACV,SAAK,QAAQ,8BAA8B,aAAa,QAAQ,EAAE,UAAU,CAAC,EAAE;AAAA,EACjF;AAEA,SAAO;AACT;AAMO,SAAS,eAAe,QAA0C;AACvE,QAAM,SAAS,WAAW;AAC1B,QAAM,OAAO,OAAO,YAAY,CAAC;AACjC,QAAM,QAAQ,OAAO,SAAS,CAAC;AAC/B,QAAM,YAAY,OAAO,iBAAiB,CAAC;AAG3C,aAAW,OAAO,CAAC,gBAAgB,YAAY,OAAO,GAAY;AAChE,QAAI,EAAE,OAAO,WAAW,OAAO,GAAG,MAAM,UAAa,OAAO,GAAG,MAAM,MAAM;AACzE,WAAK,QAAQ,0BAA0B,GAAG,GAAG;AAAA,IAC/C;AAAA,EACF;AAGA,QAAM,KAAK,OAAO;AAClB,MAAI,IAAI;AACN,QAAI,CAAC,aAAa,KAAK,EAAE,GAAG;AAC1B,WAAK,QAAQ,iBAAiB,EAAE,uCAAuC;AAAA,IACzE;AAAA,EACF;AAGA,MAAI,CAAC,KAAK,aAAc,MAAK,QAAQ,+CAA4C;AACjF,MAAI,CAAC,KAAK,MAAO,MAAK,QAAQ,wCAAqC;AACnE,MAAI,CAAC,KAAK,aAAa,CAAC,KAAK,YAAY;AACvC,SAAK,QAAQ,4DAAyD;AAAA,EACxE;AAGA,MAAI,CAAC,UAAU,UAAU,SAAS;AAChC,SAAK,QAAQ,+DAA4D;AAAA,EAC3E;AACA,MAAI,CAAC,MAAM,oBAAoB,MAAM,iBAAiB,WAAW,GAAG;AAClE,SAAK,QAAQ,8CAA2C;AAAA,EAC1D;AAGA,MAAI,CAAC,MAAM,cAAc,MAAM,WAAW,WAAW,GAAG;AACtD,SAAK,QAAQ,wCAAqC;AAAA,EACpD;AACA,MAAI,CAAC,MAAM,kBAAkB,SAAS;AACpC,SAAK,QAAQ,2CAAwC;AAAA,EACvD;AAGA,MAAI,KAAK,KAAK;AACZ,SAAK,QAAQ,0BAAqB,KAAK,GAAG,EAAE;AAAA,EAC9C,OAAO;AACL,SAAK,QAAQ,8DAAyD;AAAA,EACxE;AAEA,MAAI,OAAO,MAAM,OAAO,OAAO,WAAW,GAAG;AAC3C,UAAM,OAAO,CAAC,OAAO,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,CAAC;AAC5D,UAAM,OAAO,QAAQ,CAAC,OAAO,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,CAAC;AACpE,UAAM,OAAO,QAAQ,CAAC,OAAO,SAAS,KAAK,CAAC,MAAM,EAAE,WAAW,IAAI,CAAC;AACpE,UAAM,QAAQ,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO;AACxD,SAAK,QAAQ,iDAAuC,KAAK,EAAE;AAAA,EAC7D;AAEA,SAAO;AACT;;;ACxKO,IAAM,YAAN,cAAwB,MAAM;AAAA,EACnC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAEZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,mBAAN,cAA+B,UAAU;AAAA,EAC9C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,sBAAN,cAAkC,UAAU;AAAA,EACjD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,gBAAN,cAA4B,UAAU;AAAA,EAC3C,YACE,SACO,UACA,OACA,WACP;AACA,UAAM,OAAO;AAJN;AACA;AACA;AAGP,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,qBAAN,cAAiC,UAAU;AAAA,EAChD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAEO,IAAM,oBAAN,cAAgC,UAAU;AAAA,EAC/C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,WAAW,SAAS;AAAA,EAClD;AACF;AAIO,IAAM,gBAAN,MAAM,uBAAsB,UAAU;AAAA,EAC3C,YAAY,SAAiC,SAAkB;AAC7D,UAAM,OAAO;AAD8B;AAE3C,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,eAAc,SAAS;AAAA,EACrD;AACF;AAEO,IAAM,wBAAN,MAAM,+BAA8B,cAAc;AAAA,EACvD,YAA4B,KAAa,SAAkB;AACzD,UAAM,gCAAgC,GAAG,IAAI,OAAO;AAD1B;AAE1B,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,uBAAsB,SAAS;AAAA,EAC7D;AACF;AAEO,IAAM,oBAAN,MAAM,2BAA0B,cAAc;AAAA,EACnD,YACE,SACA,SACgB,OAChB;AACA,UAAM,SAAS,OAAO;AAFN;AAGhB,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,mBAAkB,SAAS;AAAA,EACzD;AACF;AAEO,IAAM,qBAAN,MAAM,4BAA2B,cAAc;AAAA,EAGpD,YAAY,QAAsC,SAAkB;AAClE,UAAM,mCAAmC,MAAM,IAAI,OAAO;AAH5D,wBAAgB;AAId,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,WAAO,eAAe,MAAM,oBAAmB,SAAS;AAAA,EAC1D;AACF;AAKO,IAAM,+BAAN,MAAM,sCAAqC,UAAU;AAAA,EAC1D,YAAY,iBAAyB,cAAsB;AACzD,UAAM,kCAAkC,eAAe,WAAW,YAAY,EAAE;AAChF,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,8BAA6B,SAAS;AAAA,EACpE;AACF;AAGO,IAAM,wBAAN,MAAM,+BAA8B,UAAU;AAAA,EACnD,YAAY,QAAgB;AAC1B,UAAM,oBAAoB,MAAM,EAAE;AAClC,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,uBAAsB,SAAS;AAAA,EAC7D;AACF;AAGO,IAAM,2BAAN,MAAM,kCAAiC,UAAU;AAAA,EACtD,YAAY,QAAgB;AAC1B,UAAM,2BAA2B,MAAM,EAAE;AACzC,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,0BAAyB,SAAS;AAAA,EAChE;AACF;AAGO,IAAM,+BAAN,MAAM,sCAAqC,UAAU;AAAA,EAC1D,YAAY,QAAgB;AAC1B,UAAM,sBAAsB,MAAM,EAAE;AACpC,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,8BAA6B,SAAS;AAAA,EACpE;AACF;;;AC/HA,IAAM,mBAAmB;AAqClB,IAAM,iBAAN,MAAqB;AAAA,EAK1B,YAAY,MAAgE;AAJ5E,wBAAQ;AACR,wBAAQ;AACR,wBAAQ;AAGN,SAAK,WAAW,MAAM,WAAW,kBAAkB,QAAQ,OAAO,EAAE;AACpE,SAAK,SAAS,MAAM;AACpB,SAAK,UAAU,MAAM,WAAW;AAAA,EAClC;AAAA;AAAA,EAIA,MAAc,OACZ,MACA,OAAoB,CAAC,GACF;AACnB,UAAM,MAAM,GAAG,KAAK,OAAO,GAAG,IAAI;AAClC,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,KAAK,OAAO;AAE/D,QAAI;AACF,YAAM,WAAW,MAAM,MAAM,KAAK;AAAA,QAChC,GAAG;AAAA,QACH,QAAQ,WAAW;AAAA,QACnB,SAAS;AAAA,UACP,gBAAgB;AAAA,UAChB,GAAI,KAAK,WAAW,CAAC;AAAA,QACvB;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT,UAAE;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAAA,EAEQ,eAAuC;AAC7C,QAAI,CAAC,KAAK,QAAQ;AAChB,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,eAAe,UAAU,KAAK,MAAM,GAAG;AAAA,EAClD;AAAA,EAEA,MAAc,eAAkB,MAA4B;AAC1D,QAAI,CAAC,KAAK,IAAI;AACZ,UAAI,MAAM,uBAAuB,KAAK,MAAM;AAC5C,UAAI;AACF,cAAM,OAAQ,MAAM,KAAK,KAAK;AAC9B,YAAI,MAAM,MAAO,OAAM,KAAK;AAAA,MAC9B,QAAQ;AAAA,MAER;AACA,YAAM,IAAI,kBAAkB,GAAG;AAAA,IACjC;AACA,WAAQ,MAAM,KAAK,KAAK;AAAA,EAC1B;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,OAAuD;AACpE,UAAM,OAAO,MAAM,KAAK,OAAO,kBAAkB;AAAA,MAC/C,QAAQ;AAAA,MACR,MAAM,KAAK,UAAU,KAAK;AAAA,IAC5B,CAAC;AACD,WAAO,KAAK,eAAmC,IAAI;AAAA,EACrD;AAAA;AAAA,EAGA,MAAM,IAAI,KAA6B;AACrC,UAAM,OAAO,MAAM,KAAK,OAAO,kBAAkB,mBAAmB,GAAG,CAAC,EAAE;AAC1E,WAAO,KAAK,eAAsB,IAAI;AAAA,EACxC;AAAA;AAAA,EAGA,MAAM,KAAK,MAIa;AACtB,UAAM,SAAS,IAAI,gBAAgB;AACnC,QAAI,MAAM,UAAU,OAAW,QAAO,IAAI,SAAS,OAAO,KAAK,KAAK,CAAC;AACrE,QAAI,MAAM,WAAW,OAAW,QAAO,IAAI,UAAU,OAAO,KAAK,MAAM,CAAC;AACxE,QAAI,MAAM,KAAM,QAAO,IAAI,QAAQ,KAAK,IAAI;AAC5C,UAAM,KAAK,OAAO,SAAS,IAAI,IAAI,MAAM,KAAK;AAC9C,UAAM,OAAO,MAAM,KAAK,OAAO,iBAAiB,EAAE,EAAE;AACpD,WAAO,KAAK,eAA2B,IAAI;AAAA,EAC7C;AAAA;AAAA,EAGA,MAAM,MAAM,KAAa,SAAyC;AAChE,UAAM,OAAO,MAAM,KAAK;AAAA,MACtB,kBAAkB,mBAAmB,GAAG,CAAC;AAAA,MACzC;AAAA,QACE,QAAQ;AAAA,QACR,SAAS,KAAK,aAAa;AAAA,QAC3B,MAAM,KAAK,UAAU,OAAO;AAAA,MAC9B;AAAA,IACF;AACA,WAAO,KAAK,eAAsB,IAAI;AAAA,EACxC;AAAA;AAAA,EAGA,MAAM,OAAO,KAA4B;AACvC,UAAM,OAAO,MAAM,KAAK;AAAA,MACtB,kBAAkB,mBAAmB,GAAG,CAAC;AAAA,MACzC;AAAA,QACE,QAAQ;AAAA,QACR,SAAS,KAAK,aAAa;AAAA,MAC7B;AAAA,IACF;AACA,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,KAAK,eAAqB,IAAI;AAAA,IACtC;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,OAAO,MAKQ;AACnB,UAAM,SAAS,IAAI,gBAAgB;AACnC,QAAI,KAAK,EAAG,QAAO,IAAI,KAAK,KAAK,CAAC;AAClC,QAAI,KAAK,aAAc,QAAO,IAAI,gBAAgB,KAAK,YAAY;AACnE,QAAI,KAAK,MAAO,QAAO,IAAI,SAAS,KAAK,KAAK;AAC9C,QAAI,KAAK,KAAM,QAAO,IAAI,QAAQ,KAAK,IAAI;AAC3C,UAAM,KAAK,OAAO,SAAS,IAAI,IAAI,MAAM,KAAK;AAC9C,UAAM,OAAO,MAAM,KAAK,OAAO,wBAAwB,EAAE,EAAE;AAC3D,QAAI,CAAC,KAAK,IAAI;AAEZ,YAAM,WAAW,MAAM,KAAK,OAAO,iBAAiB,EAAE,EAAE;AACxD,YAAMC,QAAO,MAAM,KAAK,eAAmD,QAAQ;AACnF,UAAI,YAAYA,MAAM,QAAOA,MAAK;AAClC,UAAI,aAAaA,SAAQA,MAAK,QAAS,QAAOA,MAAK;AACnD,aAAO,CAAC;AAAA,IACV;AACA,UAAM,OAAQ,MAAM,KAAK,KAAK;AAC9B,QAAI,MAAM,QAAQ,IAAI,EAAG,QAAO;AAChC,QAAI,aAAa,QAAQ,KAAK,QAAS,QAAO,KAAK;AACnD,QAAI,YAAY,KAAM,QAAQ,KAAoB;AAClD,WAAO,CAAC;AAAA,EACV;AACF;;;AC9KA,IAAM,gBAAgB;AACtB,IAAM,qBAAqB;AAE3B,IAAM,mBAAmB,oBAAI,IAAY;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAYD,SAAS,kBACP,KAIO;AACP,QAAM,YAAY,IAAI,MAAM,kCAAkC;AAC9D,MAAI,UAAW,QAAO,EAAE,MAAM,aAAa,QAAQ,UAAU,CAAC,GAAG,QAAQ,UAAU,CAAC,EAAE;AACtF,QAAM,OAAO,IAAI,MAAM,kBAAkB;AACzC,MAAI,KAAM,QAAO,EAAE,MAAM,QAAQ,QAAQ,KAAK,CAAC,EAAE;AACjD,SAAO;AACT;AAIO,IAAM,aAAN,MAAiB;AAAA,EAItB,YAAY,UAAU,eAAe,YAAY,KAAQ;AAHzD,wBAAiB;AACjB,wBAAiB;AAGf,SAAK,UAAU,QAAQ,QAAQ,OAAO,EAAE;AACxC,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAIA,MAAc,OAAO,KAAgC;AACnD,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,KAAK,SAAS;AACjE,QAAI;AACF,aAAO,MAAM,WAAW,MAAM,KAAK,EAAE,QAAQ,WAAW,OAAO,CAAC;AAAA,IAClE,SAAS,KAAK;AACZ,UAAI,eAAe,SAAS,IAAI,SAAS,cAAc;AACrD,cAAM,IAAI,kBAAkB,sBAAsB,GAAG,IAAI,KAAK,GAAG;AAAA,MACnE;AACA,YAAM,IAAI;AAAA,QACR,0BAA0B,GAAG,KAAM,IAAc,OAAO;AAAA,QACxD;AAAA,QACA,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF,UAAE;AACA,mBAAa,KAAK;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,gBAAgB,SAA4C;AAChE,UAAM,MAAM,GAAG,QAAQ,QAAQ,OAAO,EAAE,CAAC,GAAG,kBAAkB;AAC9D,UAAM,OAAO,MAAM,KAAK,OAAO,GAAG;AAElC,QAAI,CAAC,KAAK,IAAI;AACZ,UAAI,KAAK,WAAW,KAAK;AACvB,cAAM,IAAI,sBAAsB,KAAK,OAAO;AAAA,MAC9C;AACA,YAAM,IAAI;AAAA,QACR,sCAAsC,OAAO,UAAU,KAAK,MAAM;AAAA,QAClE;AAAA,MACF;AAAA,IACF;AAEA,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK;AAAA,IACzB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,sCAAsC,OAAO;AAAA,QAC7C;AAAA,QACA,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AAEA,QAAI,CAAC,KAAK,WAAW,IAAI,GAAG;AAC1B,YAAM,IAAI,mBAAmB,kBAAkB,OAAO;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU,QAA8C;AAC5D,UAAM,KAAK,SAAS,WAAW,mBAAmB,MAAM,CAAC,KAAK;AAC9D,UAAM,MAAM,GAAG,KAAK,OAAO,gBAAgB,EAAE;AAC7C,UAAM,OAAO,MAAM,KAAK,OAAO,GAAG;AAElC,QAAI,CAAC,KAAK,IAAI;AACZ,YAAM,IAAI;AAAA,QACR,6BAA6B,GAAG,UAAU,KAAK,MAAM;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AAEA,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,KAAK;AAAA,IACzB,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,mCAAmC,GAAG;AAAA,QACtC;AAAA,QACA,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AAEA,QAAI,MAAM,QAAQ,IAAI,EAAG,QAAO;AAChC,QAAI,QAAQ,OAAO,SAAS,YAAY,WAAW,MAAM;AACvD,aAAQ,KAAuC;AAAA,IACjD;AACA,WAAO,CAAC;AAAA,EACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,SAAS,KAAwC;AACrD,UAAM,SAAS,kBAAkB,GAAG;AAEpC,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,sBAAsB,KAAK,KAAK,OAAO;AAAA,IACnD;AAEA,QAAI,OAAO,SAAS,QAAQ;AAC1B,aAAO,KAAK,gBAAgB,KAAK,OAAO;AAAA,IAC1C;AAGA,UAAM,QAAQ,MAAM,KAAK,UAAU,OAAO,MAAM;AAChD,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,sBAAsB,KAAK,KAAK,OAAO;AAAA,IACnD;AACA,WAAO,MAAM,CAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,QAAQ,KAAyC;AACrD,UAAM,aAAa,GAAG,KAAK,OAAO,mBAAmB,mBAAmB,GAAG,CAAC;AAE5E,QAAI;AACJ,QAAI;AACF,aAAO,MAAM,KAAK,OAAO,UAAU;AAAA,IACrC,SAAS,KAAK;AAEZ,YAAM;AAAA,IACR;AAEA,QAAI,KAAK,IAAI;AACX,UAAI;AACF,eAAQ,MAAM,KAAK,KAAK;AAAA,MAC1B,SAAS,KAAK;AACZ,cAAM,IAAI;AAAA,UACR,wCAAwC,GAAG;AAAA,UAC3C,KAAK;AAAA,UACL,eAAe,QAAQ,MAAM;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,KAAK,WAAW,KAAK;AACvB,YAAM,IAAI;AAAA,QACR,mBAAmB,KAAK,MAAM,cAAc,GAAG;AAAA,QAC/C,KAAK;AAAA,MACP;AAAA,IACF;AAGA,UAAM,OAAO,MAAM,KAAK,SAAS,GAAG;AACpC,UAAM,cAAc,GAAG,KAAK,SAAS,QAAQ,OAAO,EAAE,CAAC,WAAW,mBAAmB,GAAG,CAAC;AACzF,UAAM,eAAe,MAAM,KAAK,OAAO,WAAW;AAElD,QAAI,CAAC,aAAa,IAAI;AACpB,UAAI,aAAa,WAAW,KAAK;AAC/B,cAAM,IAAI,sBAAsB,KAAK,KAAK,QAAQ;AAAA,MACpD;AACA,YAAM,IAAI;AAAA,QACR,QAAQ,aAAa,MAAM,gCAAgC,GAAG;AAAA,QAC9D,KAAK;AAAA,MACP;AAAA,IACF;AAEA,QAAI;AACF,aAAQ,MAAM,aAAa,KAAK;AAAA,IAClC,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,iDAAiD,GAAG;AAAA,QACpD,KAAK;AAAA,QACL,eAAe,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,UAAiD;AAC1D,QAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,UAAM,IAAI;AAEV,QAAI,OAAO,EAAE,sBAAsB,YAAY,CAAC,EAAE,kBAAmB,QAAO;AAC5E,QAAI,OAAO,EAAE,cAAc,YAAY,CAAC,iBAAiB,IAAI,EAAE,SAAmB,EAAG,QAAO;AAC5F,QAAI,OAAO,EAAE,aAAa,YAAY,CAAC,EAAE,SAAU,QAAO;AAC1D,QAAI,OAAO,EAAE,qBAAqB,YAAY,CAAC,EAAE,iBAAkB,QAAO;AAC1E,QAAI,OAAO,EAAE,eAAe,YAAY,CAAC,EAAE,WAAW,WAAW,UAAU,EAAG,QAAO;AACrF,QAAI,OAAO,EAAE,aAAa,YAAY,CAAC,EAAE,SAAS,WAAW,UAAU,EAAG,QAAO;AAEjF,WAAO;AAAA,EACT;AACF;;;AC7PA,IAAM,cAAc;AACpB,IAAM,cAAc,oBAAI,IAAoB;AAO5C,eAAsB,qBAAqB,YAA4C;AACrF,MAAI,YAAY,IAAI,UAAU,EAAG,QAAO,YAAY,IAAI,UAAU;AAClE,MAAI;AACF,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,QAAQ,WAAW,MAAM,WAAW,MAAM,GAAG,GAAI;AAEvD,IAAC,MAA4C,QAAQ;AACrD,UAAM,MAAM,MAAM,MAAM,GAAG,WAAW,IAAI,UAAU,IAAI,EAAE,QAAQ,WAAW,OAAO,CAAC;AACrF,iBAAa,KAAK;AAClB,QAAI,CAAC,IAAI,GAAI,QAAO;AACpB,UAAM,SAAS,MAAM,IAAI,KAAK;AAC9B,gBAAY,IAAI,YAAY,MAAM;AAClC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,eAAsB,4BACpB,QACmE;AACnE,QAAM,SAAS,MAAM,qBAAqB,yBAAyB;AACnE,MAAI,CAAC,OAAQ,QAAO,EAAE,OAAO,MAAM,SAAS,KAAK;AAGjD,QAAM,SAAmB,CAAC;AAC1B,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,WAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,0BAA0B,EAAE;AAAA,EAC9D;AACA,QAAM,MAAM;AACZ,QAAM,WAAY,OAAe,YAAY,CAAC;AAC9C,aAAW,OAAO,UAAU;AAC1B,QAAI,EAAE,OAAO,KAAM,QAAO,KAAK,2BAA2B,GAAG,EAAE;AAAA,EACjE;AACA,SAAO,OAAO,WAAW,IAAI,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO,OAAO,OAAO;AACxE;AAEA,eAAsB,0BACpB,UACmE;AACnE,QAAM,SAAS,MAAM,qBAAqB,uBAAuB;AACjE,MAAI,CAAC,OAAQ,QAAO,EAAE,OAAO,MAAM,SAAS,KAAK;AAEjD,QAAM,SAAmB,CAAC;AAC1B,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,WAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,4BAA4B,EAAE;AAAA,EAChE;AACA,QAAM,IAAI;AACV,QAAM,WAAY,OAAe,YAAY,CAAC;AAC9C,aAAW,OAAO,UAAU;AAC1B,QAAI,EAAE,OAAO,GAAI,QAAO,KAAK,2BAA2B,GAAG,EAAE;AAAA,EAC/D;AACA,SAAO,OAAO,WAAW,IAAI,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO,OAAO,OAAO;AACxE;;;ACxDO,IAAK,WAAL,kBAAKC,cAAL;AACL,EAAAA,oBAAA,qBAAkB,KAAlB;AACA,EAAAA,oBAAA,kBAAkB,KAAlB;AACA,EAAAA,oBAAA,kBAAkB,KAAlB;AAHU,SAAAA;AAAA,GAAA;AAOL,IAAM,qBAAN,MAAM,4BAA2B,MAAM;AAAA,EAC5C,YAAY,OAAe;AACzB,UAAM,2BAA2B,KAAK,8BAAyB;AAC/D,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,oBAAmB,SAAS;AAAA,EAC1D;AACF;AA0BO,IAAM,aAAN,MAAiB;AAAA,EAItB,YACE,MACA,YACA;AANF,wBAAiB;AACjB,wBAAiB;AAMf,SAAK,QAAQ;AACb,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,YACJ,KACA,OAAuB,CAAC,GACJ;AACpB,UAAM,MAAM,KAAK,OAAO;AACxB,UAAM,aAAa,KAAK,cAAc;AACtC,UAAM,mBAAmB,KAAK,oBAAoB;AAClD,UAAM,eAAe,KAAK,gBAAgB;AAE1C,QAAI,QAAQ,yBAA0B;AACpC,YAAM,KAAK,MAAM,GAAG;AACpB,aAAO,EAAE,WAAW,MAAM,UAAU,GAAG,QAAQ,kBAAkB;AAAA,IACnE;AAGA,UAAM,QAAS,IAAiD,cAC1D,IAAiD,UAClD;AAEL,QAAI,WAAW;AACf,QAAI,YAAY;AAEhB,WAAO,YAAY,YAAY;AAC7B,YAAM,KAAK,MAAM,GAAG;AACpB;AAEA,YAAM,QAAQ,MAAM,KAAK,YAAY,OAAO,YAAY;AACxD,UAAI,OAAO;AACT,eAAO,EAAE,WAAW,MAAM,UAAU,QAAQ,QAAQ,uBAAwB,iBAAiB,eAAe;AAAA,MAC9G;AAEA,UAAI,WAAW,WAAY;AAG3B,YAAM,MAAM,SAAS;AACrB,kBAAY,KAAK,IAAI,YAAY,GAAG,GAAI;AAAA,IAC1C;AAEA,WAAO,EAAE,WAAW,OAAO,UAAU,QAAQ,0BAA0B,UAAU,WAAW;AAAA,EAC9F;AACF;AAMO,SAAS,iBACd,MACA,QACmC;AACnC,QAAM,MAAyC;AAAA,IAC7C,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAY,WAAW;AAAA,IACvB,KAAK;AAAA,EACP;AACA,SAAO;AACT;AAEA,SAAS,aAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAEA,SAAS,MAAM,IAA2B;AACxC,SAAO,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;;;ACtIO,IAAM,sBAAsB;AAcnC,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AAEA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,CAAC,IAAK,MAAM,CAAC,IAAK,KAAQ;AAChC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAQO,SAAS,iBAAiB,MAAc,QAA+B;AAC5E,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,IACvB;AAAA,EACF;AACF;AAMO,SAAS,gBAAgB,MAAc,QAA+B;AAC3E,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,EACzB;AACF;AAMO,SAAS,kBAAkB,MAAc,QAA+B;AAC7E,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,OAAO,MAAM,GAAG,GAAG;AAAA,IAC3B,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,EACzB;AACF;AAKO,SAAS,gBAAgB,KAAoC;AAClE,SACE,OAAO,QAAQ,YACf,QAAQ,QACP,IAAgC,iBAAiB;AAEtD;AAKO,SAAS,sBAAsB,KAAuC;AAC3E,QAAM,SAAmB,CAAC;AAC1B,MAAI,IAAI,iBAAiB,EAAG,QAAO,KAAK,wBAAwB;AAChE,MAAI,CAAC,IAAI,KAAM,QAAO,KAAK,kBAAkB;AAC7C,MAAI,CAAC,CAAC,SAAS,QAAQ,QAAQ,EAAE,SAAS,IAAI,gBAAgB,EAAE,GAAG;AACjE,WAAO,KAAK,6CAA6C;AAAA,EAC3D;AACA,MAAI,CAAC,IAAI,UAAU,IAAI,OAAO,WAAW,EAAG,QAAO,KAAK,oBAAoB;AAC5E,MAAI,CAAC,IAAI,WAAY,QAAO,KAAK,wBAAwB;AACzD,MAAI,CAAC,IAAI,gBAAgB,IAAI,gBAAgB,EAAG,QAAO,KAAK,+BAA+B;AAC3F,SAAO;AACT;AAmBO,SAAS,wBACd,MACA,YACA,iBACqB;AACrB,SAAO;AAAA,IACL,cAAc;AAAA,IACd;AAAA,IACA;AAAA,IACA,cAAc,KAAK,IAAI;AAAA,IACvB,YAAYA,YAAW;AAAA,IACvB,kBAAkB;AAAA,EACpB;AACF;;;ACvIA,IAAMC,uBAAsB;AAC5B,IAAM,sBAAsB;AAC5B,IAAM,mBAAmB;AACzB,IAAM,mBAAmB;AAqBlB,IAAM,cAAN,MAAkB;AAAA,EAMvB,YAAY,gBAAwB,kBAAkB,UAAkB,kBAAkB;AAL1F,wBAAiB;AACjB,wBAAiB;AAEjB;AAAA,wBAAiB;AAGf,SAAK,gBAAgB;AACrB,SAAK,UAAU;AACf,SAAK,QAAQ,oBAAI,IAAI;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eACE,OACA,WACA,WAAW,OACQ;AACnB,UAAM,MAAM,KAAK,IAAI;AAGrB,SAAK,OAAO,GAAG;AAGf,UAAM,SAAS,WACX,KAAK,IAAI,KAAK,eAAe,mBAAmB,IAChD,KAAK;AAGT,UAAM,MAAM,iBAAiB,SAAS;AACtC,QAAI,QAAQ,MAAM;AAChB,aAAO,EAAE,SAAS,OAAO,QAAQ,6BAA6B,SAAS,GAAG;AAAA,IAC5E;AAGA,UAAM,QAAQ,MAAM;AACpB,UAAM,WAAW,SAAS;AAC1B,QAAI,QAAQ,UAAU;AACpB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ,wBAAwB,KAAK,MAAM,QAAQ,GAAI,CAAC,cAAc,MAAM;AAAA,MAC9E;AAAA,IACF;AACA,QAAI,MAAM,MAAM,KAAM;AAEpB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAGA,QAAI,KAAK,MAAM,IAAI,KAAK,GAAG;AACzB,aAAO,EAAE,SAAS,OAAO,QAAQ,2BAA2B,KAAK,gBAAgB;AAAA,IACnF;AAGA,QAAI,KAAK,MAAM,QAAQ,KAAK,SAAS;AACnC,YAAM,WAAW,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AAC1C,WAAK,MAAM,OAAO,QAAQ;AAAA,IAC5B;AAGA,UAAM,YAAY,MAAM;AACxB,SAAK,MAAM,IAAI,OAAO,SAAS;AAE/B,WAAO,EAAE,SAAS,MAAM,QAAQ,KAAK;AAAA,EACvC;AAAA;AAAA,EAGQ,OAAO,KAAmB;AAChC,eAAW,CAAC,IAAI,SAAS,KAAK,KAAK,OAAO;AACxC,UAAI,aAAa,KAAK;AACpB,aAAK,MAAM,OAAO,EAAE;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AACF;AAKO,SAAS,eACd,SACA,OACoC;AACpC,QAAM,MAAM;AAGZ,QAAM,QACH,IAAsB,cAAe,IAA0B;AAClE,MAAI,CAAC,OAAO;AACV,WAAO,EAAE,OAAO,OAAO,QAAQ,8BAA8B;AAAA,EAC/D;AAGA,MAAI;AACJ,MAAI,OAAQ,IAAsB,iBAAiB,UAAU;AAE3D,gBAAY,OAAQ,IAAsB,eAAgB,GAAI;AAAA,EAChE,WAAW,IAAI,cAAc,QAAW;AACtC,gBAAY,OAAO,IAAI,SAAS;AAAA,EAClC;AACA,MAAI,CAAC,WAAW;AACd,WAAO,EAAE,OAAO,OAAO,QAAQ,oBAAoB;AAAA,EACrD;AAEA,QAAM,WAAY,IAAsB,iBAAiBA,wBACtD,IAA0B,iBAAiBA;AAE9C,QAAM,SAAS,MAAM,eAAe,OAAO,WAAW,QAAQ;AAC9D,SAAO,EAAE,OAAO,OAAO,SAAS,QAAQ,OAAO,OAAO;AACxD;AAWA,SAAS,iBAAiB,IAA2B;AAEnD,MAAI,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,GAAG,GAAG;AACxC,UAAM,IAAI,IAAI,KAAK,EAAE;AACrB,QAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAG,QAAO,EAAE,QAAQ;AAAA,EAC5C;AAEA,QAAM,IAAI,WAAW,EAAE;AACvB,MAAI,MAAM,CAAC,EAAG,QAAO;AAErB,MAAI,IAAI,KAAM,QAAO;AACrB,SAAO,IAAI;AACb;;;ACrKO,IAAM,kBAAN,MAAM,yBAAwB,MAAM;AAAA,EAEzC,YAAY,eAAuB,iBAAyB;AAC1D;AAAA,MACE,iCAAiC,cAAc,QAAQ,CAAC,CAAC,WAAW,eAAe;AAAA,IACrF;AAJF,wBAAS;AAKP,SAAK,OAAO;AACZ,SAAK,gBAAgB;AACrB,WAAO,eAAe,MAAM,iBAAgB,SAAS;AAAA,EACvD;AACF;AAgBA,eAAsB,eACpB,YAC0B;AAC1B,QAAM,SAAS,cAAc;AAE7B,MAAI;AACF,UAAM,SAAS,KAAK,IAAI;AACxB,UAAM,OAAO,MAAM,MAAM,QAAQ,EAAE,QAAQ,QAAQ,QAAQ,YAAY,QAAQ,GAAI,EAAE,CAAC;AACtF,UAAM,QAAQ,KAAK,IAAI;AAGvB,UAAM,aAAa,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK,QAAQ,IAAI,MAAM;AACtE,QAAI,CAAC,YAAY;AAEf,aAAO;AAAA,QACL,cAAc;AAAA,QACd,eAAe;AAAA,QACf,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,KAAK,UAAU,EAAE,QAAQ;AAC9C,QAAI,MAAM,QAAQ,GAAG;AACnB,aAAO,EAAE,cAAc,MAAM,eAAe,GAAG,QAAQ,oCAAoC;AAAA,IAC7F;AAGA,UAAM,iBAAiB,SAAS,SAAS;AACzC,UAAM,iBAAiB,gBAAgB,YAAY;AACnD,UAAM,eAAe,KAAK,IAAI,aAAa,KAAK;AAEhD,WAAO,EAAE,cAAc,eAAe,QAAQ,OAAO;AAAA,EACvD,QAAQ;AAEN,WAAO,EAAE,cAAc,MAAM,eAAe,GAAG,QAAQ,gCAAgC;AAAA,EACzF;AACF;AASA,eAAsB,kBAAkB,kBAAkB,GAAkB;AAC1E,QAAM,SAAS,MAAM,eAAe;AACpC,MAAI,CAAC,OAAO,gBAAgB,KAAK,IAAI,OAAO,aAAa,IAAI,iBAAiB;AAC5E,UAAM,IAAI,gBAAgB,OAAO,eAAe,eAAe;AAAA,EACjE;AACF;;;ACxEA,eAAe,SAAS,MAAgD;AACtE,QAAM,OAAO,KAAK,UAAU,MAAM,OAAO,KAAK,IAAI,EAAE,KAAK,CAAC;AAC1D,MAAI,OAAO,WAAW,eAAe,OAAO,QAAQ;AAClD,UAAM,UAAU,IAAI,YAAY,EAAE,OAAO,IAAI;AAC7C,UAAM,UAAU,MAAM,OAAO,OAAO,OAAO,WAAW,OAAO;AAC7D,WAAO,MAAM,KAAK,IAAI,WAAW,OAAO,CAAC,EACtC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AAAA,EACZ;AAEA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAQ,KAAK,WAAW,CAAC;AACzB,WAAQ,OAAO,aAAc;AAAA,EAC/B;AACA,SAAO,KAAK,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC1C;AAUA,eAAsB,iBACpB,MACA,OACA,UACA,SAAS,uBACT,kBAAkB,OACI;AACtB,QAAM,aAAa,MAAM,SAAS,IAAI;AACtC,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,kBAAkB;AAAA,IACpB;AAAA,EACF,CAAC;AACH;AAWO,SAAS,qBACd,KACoC;AACpC,QAAM,IAAI,IAAI;AAEd,MAAI,CAAC,EAAE,QAAQ,OAAO,EAAE,SAAS,UAAU;AACzC,WAAO,EAAE,OAAO,OAAO,QAAQ,sCAAsC;AAAA,EACvE;AACA,MAAI,CAAC,EAAE,eAAe,OAAO,EAAE,gBAAgB,UAAU;AACvD,WAAO,EAAE,OAAO,OAAO,QAAQ,6CAA6C;AAAA,EAC9E;AACA,MAAI,EAAE,cAAc,IAAI;AACtB,WAAO,EAAE,OAAO,OAAO,QAAQ,0CAA0C;AAAA,EAC3E;AACA,MAAI,EAAE,qBAAqB,QAAQ,EAAE,UAAU,WAAW;AACxD,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;;;ACxFA,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,SAAO,GAAG,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAC7D;AAsBO,IAAM,WAAN,MAAe;AAAA,EAAf;AACL,wBAAQ,SAAoB,CAAC;AAAA;AAAA;AAAA,EAG7B,OAAO,OAAuB;AAC5B,SAAK,MAAM,KAAK,KAAK;AAAA,EACvB;AAAA;AAAA,EAGA,UAAwB;AACtB,WAAO,EAAE,MAAM,CAAC,GAAG,KAAK,KAAK,EAAE;AAAA,EACjC;AAAA;AAAA,EAGA,QAAQ,KAAmC;AACzC,WAAO,KAAK,MAAM,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG;AAAA,EAC7C;AAAA;AAAA,EAGA,WAAW,KAAa,OAAyB;AAC/C,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,OAAO,SAAS,KAAK,IAAI,KAAK;AACpC,QAAI,MAAM,eAAe,UAAa,MAAM,cAAc,IAAK,QAAO;AACtE,QAAI,MAAM,QAAQ,UAAa,MAAM,MAAM,IAAK,QAAO;AACvD,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,UAAU,KAAa,WAA0B;AAC/C,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,OAAO;AACT,YAAM,MAAM,aAAa,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAAA,IACvD;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,KAAmB;AAC3B,UAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAI,OAAO;AACT,YAAM,aAAa,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAAA,IACjD;AAAA,EACF;AAAA;AAAA,EAGA,UAAU,OAA4B;AACpC,WAAO,KAAK,MAAM,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,KAAK,KAAK,CAAC;AAAA,EAC/D;AACF;AAUO,SAAS,uBACd,cACA,UACA,iBAAiB,KACjB,SAAS,qBACI;AACb,QAAM,SAASA,YAAW,EAAE,MAAM,GAAG,CAAC;AACtC,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN;AAAA,MACA,gBAAgB;AAAA,MAChB,SAAS;AAAA,MACT,SAAS;AAAA,MACT,iBAAiB;AAAA,MACjB,eAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,IACvC;AAAA,IACA,OAAO;AAAA,EACT,CAAC;AACH;;;ACvGA,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,SAAO,GAAG,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAC7D;AA4BO,SAAS,mBAAmB,QAA2C;AAC5E,QAAM,YAAY,OAAO,aAAaA,YAAW;AACjD,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,QAAQ;AAAA,MACN;AAAA,MACA,gBAAgB,OAAO;AAAA,MACvB,iBAAiB,OAAO;AAAA,MACxB,aAAa,OAAO;AAAA,MACpB,kBAAkB,OAAO;AAAA,MACzB,gBAAgB,OAAO;AAAA,MACvB,eAAe,OAAO;AAAA,MACtB,YAAY;AAAA,MACZ,cAAc,OAAO,eAAe;AAAA,MACpC,iBAAiB,OAAO,kBAAkB,CAAC;AAAA,IAC7C;AAAA,EACF,CAAC;AACH;AAOO,SAAS,iBAAiB,QAA4C;AAC3E,QAAM,YACJ,OAAO,aAAa,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO,GAAI,EAAE,YAAY;AAC1E,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,gBAAgB,OAAO,iBAAiB,CAAC;AAAA,MACzC,YAAY;AAAA,MACZ,QAAQ,OAAO,UAAU;AAAA,IAC3B;AAAA,EACF,CAAC;AACH;AAOO,SAAS,gBAAgB,QAA4C;AAC1E,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,QAAQ,OAAO,UAAU;AAAA,IAC3B;AAAA,EACF,CAAC;AACH;AAQO,SAAS,uBACd,KACoC;AACpC,QAAM,MAAM,IAAI;AAChB,QAAM,IAAI,IAAI;AACd,QAAM,UAAU,EAAE;AAElB,MAAI,QAAQ,mBAAmB;AAC7B,QAAI,sCAAyC;AAC3C,aAAO,EAAE,OAAO,OAAO,QAAQ,4CAA4C;AAAA,IAC7E;AACA,QAAI,CAAC,EAAE,eAAgB,QAAO,EAAE,OAAO,OAAO,QAAQ,yBAAyB;AAC/E,QAAI,CAAC,EAAE,YAAa,QAAO,EAAE,OAAO,OAAO,QAAQ,sBAAsB;AACzE,QAAI,CAAC,EAAE,oBAAoB,CAAC,MAAM,QAAQ,EAAE,gBAAgB,KAAM,EAAE,iBAA8B,WAAW,GAAG;AAC9G,aAAO,EAAE,OAAO,OAAO,QAAQ,6CAA6C;AAAA,IAC9E;AACA,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,QAAI,CAAC,EAAE,cAAe,QAAO,EAAE,OAAO,OAAO,QAAQ,wBAAwB;AAC7E,WAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AAAA,EACrC;AAEA,MAAI,QAAQ,iBAAiB;AAC3B,QAAI,oCAAuC;AACzC,aAAO,EAAE,OAAO,OAAO,QAAQ,0CAA0C;AAAA,IAC3E;AACA,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,WAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AAAA,EACrC;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,QAAI,mCAAsC;AACxC,aAAO,EAAE,OAAO,OAAO,QAAQ,yCAAyC;AAAA,IAC1E;AACA,QAAI,CAAC,EAAE,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,qBAAqB;AACvE,WAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AAAA,EACrC;AAEA,SAAO,EAAE,OAAO,OAAO,QAAQ,4BAA4B,GAAG,GAAG;AACnE;;;AClIA,IAAM,eAAe,KAAK,KAAK;AAKxB,IAAM,kBAAN,MAAsB;AAAA,EAAtB;AACL,wBAAiB,UAAwC,oBAAI,IAAI;AAAA;AAAA;AAAA,EAGjE,IAAI,KAAa,OAA8C;AAC7D,UAAM,QAAQ,KAAK,OAAO,IAAI,GAAG;AACjC,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,QAAI,MAAM,gBAAgB,UAAa,MAAM,cAAc,KAAK;AAC9D,WAAK,OAAO,OAAO,GAAG;AACtB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,QAA0B,OAAsB;AAClD,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,SAAK,OAAO,IAAI,OAAO,KAAK;AAAA,MAC1B,GAAG;AAAA,MACH,aAAa,MAAM;AAAA,IACrB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,WAAW,KAAmB;AAC5B,SAAK,OAAO,OAAO,GAAG;AAAA,EACxB;AAAA;AAAA,EAGA,IAAI,OAAe;AACjB,WAAO,KAAK,OAAO;AAAA,EACrB;AACF;AAUA,eAAsB,gBACpB,KACA,aACA,OAC2B;AAC3B,QAAM,IAAI,SAAS,IAAI,gBAAgB;AAGvC,QAAM,SAAS,EAAE,IAAI,GAAG;AACxB,MAAI,OAAQ,QAAO;AAEnB,QAAM,MAAM,GAAG,YAAY,QAAQ,OAAO,EAAE,CAAC,kBAAkB,mBAAmB,GAAG,CAAC;AAEtF,MAAI;AACF,UAAM,OAAO,MAAM,MAAM,KAAK,EAAE,QAAQ,YAAY,QAAQ,GAAI,EAAE,CAAC;AACnE,QAAI,CAAC,KAAK,IAAI;AAEZ,YAAMC,UAA2B,EAAE,KAAK,QAAQ,UAAU,QAAQ,qBAAqB,KAAK,MAAM,GAAG;AACrG,QAAE,IAAIA,OAAM;AACZ,aAAOA;AAAA,IACT;AACA,UAAM,OAAQ,MAAM,KAAK,KAAK;AAC9B,UAAM,SAA2B;AAAA,MAC/B;AAAA,MACA,QAAS,KAAK,UAAoC;AAAA,MAClD,WAAW,KAAK;AAAA,MAChB,QAAQ,KAAK;AAAA,MACb,WAAW,KAAK;AAAA,IAClB;AACA,MAAE,IAAI,MAAM;AACZ,WAAO;AAAA,EACT,QAAQ;AAEN,UAAM,SAA2B,EAAE,KAAK,QAAQ,UAAU,QAAQ,sBAAsB;AACxF,WAAO;AAAA,EACT;AACF;AAQO,SAAS,wBACd,KACA,QACa;AACb,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrC;AAAA,EACF,CAAC;AACH;;;AClHO,IAAK,eAAL,kBAAKC,kBAAL;AACL,EAAAA,cAAA,WAAY;AACZ,EAAAA,cAAA,WAAY;AACZ,EAAAA,cAAA,cAAY;AACZ,EAAAA,cAAA,eAAY;AACZ,EAAAA,cAAA,eAAY;AALF,SAAAA;AAAA,GAAA;AAwBL,SAAS,2BACd,QACa;AACb,SAAO,mBAAmB;AAAA,IACxB,eAAe,OAAO;AAAA,IACtB,gBAAgB,OAAO;AAAA,IACvB,YAAY,OAAO;AAAA,IACnB,iBAAiB,CAAC,eAAe;AAAA,IACjC,eAAe,OAAO;AAAA,IACtB,eAAe,OAAO;AAAA,IACtB,WAAW,OAAO;AAAA,IAClB,aAAa;AAAA,IACb,gBAAgB,OAAO;AAAA,EACzB,CAAC;AACH;AAOO,SAAS,yBACd,QACa;AACb,SAAO,iBAAiB,MAAM;AAChC;AAOO,SAAS,wBACd,QACa;AACb,SAAO,gBAAgB,MAAM;AAC/B;AAOO,SAAS,4BACd,KACoC;AACpC,MAAI,IAAI,OAAO,yCAA4C;AACzD,WAAO,EAAE,OAAO,OAAO,QAAQ,8BAA8B;AAAA,EAC/D;AACA,QAAM,QAAQ,IAAI,OAAO;AACzB,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAAI;AAC9D,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;;;ACtFA,IAAMC,uBAAsB;AAC5B,IAAM,8BAA8B;AACpC,IAAM,oBAAoB;AA4BnB,IAAM,qBAAN,MAAyB;AAAA,EAK9B,YACE,mBAA2B,6BAC3B,UAAkB,mBAClB;AAPF,wBAAiB;AACjB,wBAAiB;AACjB,wBAAQ,eAA2B,CAAC;AAMlC,SAAK,mBAAmB;AACxB,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,iBACE,KACA,WACA,cACA,UAAU,MACV,eAAe,OACf,gBACA,OACsB;AAEtB,QACE,OACA,IAAI,iBAAiBA,wBACrB,IAAI,iBAAiB,SACrB;AACA,aAAO,EAAE,SAAS,MAAM,QAAQ,sCAAsC;AAAA,IACxE;AAEA,QAAI,CAAC,WAAW;AACd,aAAO,EAAE,SAAS,MAAM,QAAQ,cAAc;AAAA,IAChD;AAGA,QAAI,CAAC,cAAc;AACjB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAEA,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAGA,QAAI,gBAAgB,mBAAmB,QAAW;AAChD,YAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,YAAM,kBAAkB,MAAM,kBAAkB;AAChD,UAAI,iBAAiB,KAAK,kBAAkB;AAC1C,eAAO;AAAA,UACL,SAAS;AAAA,UACT,QAAQ,mDAAmD,KAAK,MAAM,cAAc,CAAC,OAAO,KAAK,gBAAgB;AAAA,QACnH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA,EAGA,SAAS,OAAqD,OAAsB;AAClF,UAAM,MAAM,SAAS,KAAK,IAAI;AAE9B,SAAK,cAAc,KAAK,YAAY,OAAO,CAAC,MAAM,EAAE,QAAQ,MAAM,GAAG;AACrE,SAAK,YAAY,KAAK;AAAA,MACpB,GAAG;AAAA,MACH,YAAY;AAAA,MACZ,YAAY,KAAK;AAAA,IACnB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,aAAa,KAAa,OAAuC;AAC/D,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,UAAM,QAAQ,KAAK,YAAY,KAAK,CAAC,MAAM,EAAE,QAAQ,GAAG;AACxD,QAAI,CAAC,MAAO,QAAO;AACnB,UAAM,OAAO,MAAM,MAAM,cAAc;AACvC,QAAI,MAAM,MAAM,YAAY;AAC1B,WAAK,cAAc,KAAK,YAAY,OAAO,CAAC,MAAM,EAAE,QAAQ,GAAG;AAC/D,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,kBACE,gBACA,OACoD;AACpD,QAAI,mBAAmB,QAAW;AAChC,aAAO,EAAE,cAAc,OAAO,iBAAiB,EAAE;AAAA,IACnD;AACA,UAAM,MAAM,SAAS,KAAK,IAAI;AAC9B,WAAO;AAAA,MACL,cAAc;AAAA,MACd,iBAAiB,KAAK,OAAO,MAAM,kBAAkB,GAAI;AAAA,IAC3D;AAAA,EACF;AACF;;;ACjJO,IAAK,YAAL,kBAAKC,eAAL;AAEL,EAAAA,WAAA,8BAA2B;AAC3B,EAAAA,WAAA,2BAA2B;AAC3B,EAAAA,WAAA,wBAA2B;AAE3B,EAAAA,WAAA,uBAA2B;AAC3B,EAAAA,WAAA,oBAA2B;AAC3B,EAAAA,WAAA,iBAA2B;AAE3B,EAAAA,WAAA,sBAA2B;AAC3B,EAAAA,WAAA,iBAA2B;AAE3B,EAAAA,WAAA,qBAA2B;AAC3B,EAAAA,WAAA,kCAA+B;AAE/B,EAAAA,WAAA,wBAA2B;AAC3B,EAAAA,WAAA,6BAA2B;AAE3B,EAAAA,WAAA,aAA2B;AAnBjB,SAAAA;AAAA,GAAA;AAqCL,SAAS,gBAAgB,QAAwC;AACtE,SAAO,IAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,KAAK;AAAA,IACL,QAAQ,OAAO,UAAU;AAAA,IACzB,QAAQ;AAAA,MACN;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,UAAU,OAAO;AAAA,MACjB,WAAW,OAAO;AAAA,MAClB,gBAAgB,OAAO;AAAA,MACvB,kBAAkB,OAAO;AAAA,MACzB,aAAa,OAAO,eAAe;AAAA,MACnC,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACtC;AAAA,EACF,CAAC;AACH;;;AC3CO,IAAK,OAAL,kBAAKC,UAAL;AACL,EAAAA,YAAA,WAAc,KAAd;AACA,EAAAA,YAAA,cAAc,KAAd;AACA,EAAAA,YAAA,iBAAc,KAAd;AACA,EAAAA,YAAA,WAAc,KAAd;AACA,EAAAA,YAAA,cAAc,KAAd;AACA,EAAAA,YAAA,aAAc,KAAd;AACA,EAAAA,YAAA,iBAAc,KAAd;AAPU,SAAAA;AAAA,GAAA;AAWL,IAAM,mBAAmB;AAKzB,IAAM,iBAAuC;AAAA,EAClD,CAAC,aAAU,GAAS;AAAA,EACpB,CAAC,gBAAa,GAAM;AAAA,EACpB,CAAC,mBAAgB,GAAG;AAAA,EACpB,CAAC,aAAU,GAAS;AAAA,EACpB,CAAC,gBAAa,GAAM;AAAA,EACpB,CAAC,eAAY,GAAO;AAAA,EACpB,CAAC,mBAAgB,GAAG;AACtB;AAEA,IAAM,oBAAuC,IAAI;AAAA,EAC9C,OAAO,QAAQ,cAAc,EAAyB;AAAA,IACrD,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,OAAO,OAAO,IAAI,CAAS;AAAA,EACjD;AACF;AAGO,SAAS,iBAAiB,OAAiC;AAChE,SAAO,kBAAkB,IAAI,KAAK;AACpC;AAMO,IAAM,iBAAuC;AAAA,EAClD,UAAiB;AAAA,EACjB,YAAiB;AAAA,EACjB,QAAiB;AAAA,EACjB,YAAiB;AAAA,EACjB,cAAiB;AAAA,EACjB,WAAiB;AAAA,EACjB,UAAiB;AAAA,EACjB,YAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,UAAiB;AAAA,EACjB,aAAiB;AAAA,EACjB,SAAiB;AAAA,EACjB,UAAiB;AAAA,EACjB,SAAiB;AAAA,EACjB,iBAAiB;AACnB;AA0CO,IAAM,qBAAgC;AAAA,EAC3C,oBAAoB;AAAA,EACpB,kBAAoB;AAAA,EACpB,gBAAoB;AAAA,EACpB,mBAAoB;AAAA,EACpB,kBAAoB;AACtB;AAGO,IAAM,wBAAmC;AAAA,EAC9C,oBAAoB;AAAA,EACpB,kBAAoB;AAAA,EACpB,gBAAoB;AAAA,EACpB,mBAAoB;AAAA,EACpB,kBAAoB;AACtB;AAMA,SAAS,iBAAiB,OAA+C;AACvE,MAAI;AACF,UAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,QAAI,MAAM,SAAS,EAAG,QAAO;AAC7B,UAAM,cAAc,MAAM,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACxE,UAAM,SAAS,aAAa,IAAI,QAAQ,IAAI,WAAW,SAAS,KAAK,CAAC;AACtE,WAAO,KAAK,MAAM,KAAK,MAAM,CAAC;AAAA,EAChC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQO,SAAS,mBAAmB,OAAqB;AACtD,QAAM,UAAU,iBAAiB,KAAK;AACtC,MAAI,CAAC,QAAS,QAAO;AAGrB,QAAM,WAAW,QAAQ,WAAW;AACpC,MAAI,aAAa,UAAa,aAAa,MAAM;AAC/C,UAAM,OAAO,iBAAiB,OAAO,QAAQ,CAAC;AAC9C,QAAI,SAAS,OAAW,QAAO;AAAA,EACjC;AAGA,QAAM,MAAM,QAAQ,KAAK;AACzB,MAAI,QAAQ,UAAa,QAAQ,MAAM;AACrC,UAAM,OAAO,iBAAiB,OAAO,GAAG,CAAC;AACzC,QAAI,SAAS,OAAW,QAAO;AAAA,EACjC;AAEA,SAAO;AACT;AAGO,SAAS,kBAAkB,OAAqB;AACrD,SAAO,mBAAmB,KAAK;AACjC;AAOO,SAAS,uBAAuB,OAA+B;AACpE,QAAM,UAAU,iBAAiB,KAAK;AACtC,MAAI,CAAC,SAAS;AACZ,WAAO,EAAE,KAAK,IAAI,MAAM,eAAY,UAAU,GAAG,QAAQ,CAAC,EAAE;AAAA,EAC9D;AAEA,QAAM,WAAW,QAAQ,WAAW;AACpC,QAAM,MAAM,QAAQ,KAAK;AACzB,QAAM,WAAW,aAAa,SAAY,OAAO,QAAQ,IAAI,QAAQ,SAAY,OAAO,GAAG,IAAI;AAC/F,QAAM,OAAO,iBAAiB,QAAQ,KAAK;AAE3C,QAAM,SAAS,MAAM,QAAQ,QAAQ,aAAa,CAAC,IAC9C,QAAQ,aAAa,IACtB,MAAM,QAAQ,QAAQ,QAAQ,CAAC,IAC5B,QAAQ,QAAQ,IACjB,CAAC;AAEP,SAAO;AAAA,IACL,KAAc,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,IACzC;AAAA,IACA,UAAc,eAAe,IAAI;AAAA,IACjC,aAAc,QAAQ,cAAc;AAAA,IACpC;AAAA,IACA,YAAc,QAAQ,aAAa;AAAA,IACnC,SAAc,QAAQ,UAAU;AAAA,IAChC,WAAc,MAAM,QAAQ,QAAQ,YAAY,CAAC,IAC9B,QAAQ,YAAY,IACrB;AAAA,EACpB;AACF;AAcO,SAAS,qBAAqB,MAAY,OAAsC;AACrF,QAAM,WAAW,eAAe,MAAM,YAAY,CAAC;AACnD,MAAI,aAAa,QAAW;AAE1B,QAAI,QAAQ,iBAAe,QAAO,EAAE,IAAI,MAAM,QAAQ,GAAG;AACzD,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,QAAQ,kBAAkB,KAAK,4CAA4C,KAAK,IAAI,CAAC;AAAA,IACvF;AAAA,EACF;AACA,MAAI,QAAQ,SAAU,QAAO,EAAE,IAAI,MAAM,QAAQ,GAAG;AACpD,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,QAAQ,UAAU,KAAK,cAAc,KAAK,QAAQ,CAAC,eAAe,eAAe,QAAQ,CAAC,qBAAqB,KAAK,IAAI,CAAC,eAAe,eAAe,IAAI,CAAC;AAAA,EAC9J;AACF;AAGO,SAAS,oBAAoB,MAAY,OAAsC;AACpF,SAAO,qBAAqB,MAAM,KAAK;AACzC;;;AChPO,IAAK,eAAL,kBAAKC,kBAAL;AACL,EAAAA,cAAA,UAAgB;AAChB,EAAAA,cAAA,mBAAgB;AAChB,EAAAA,cAAA,eAAgB;AAHN,SAAAA;AAAA,GAAA;AAML,IAAK,qBAAL,kBAAKC,wBAAL;AACL,EAAAA,oBAAA,aAAa;AACb,EAAAA,oBAAA,gBAAa;AACb,EAAAA,oBAAA,SAAa;AAHH,SAAAA;AAAA,GAAA;AAwBZ,IAAMC,gBAAe,KAAK,KAAK,KAAK;AAa7B,IAAM,mBAAN,MAAuB;AAAA,EAAvB;AACL,wBAAiB,SAAQ,oBAAI,IAAwB;AAAA;AAAA;AAAA,EAGrD,IAAI,UAAkC;AACpC,SAAK,MAAM,IAAI,SAAS,aAAa;AAAA,MACnC;AAAA,MACA,WAAW,KAAK,IAAI,IAAIA;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KAA2C;AAChD,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,QAAI,CAAC,MAAO,QAAO;AACnB,QAAI,KAAK,IAAI,IAAI,MAAM,WAAW;AAChC,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;AAAA,IACT;AACA,WAAO,MAAM;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,eAAe,QAAuD;AAC1E,UAAM,WAAW,kBAAkB,MAAM;AACzC,QAAI;AAEJ,QAAI;AAGF,YAAM,YAAY,UAAQ,KAAK;AAC/B,gBAAU,MAAM,UAAU,SAAS,WAAW,QAAQ;AAAA,IACxD,QAAQ;AACN,aAAO;AAAA,IACT;AAGA,eAAW,UAAU,SAAS;AAC5B,YAAM,OAAO,OAAO,KAAK,EAAE;AAC3B,UAAI;AACF,cAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,YACE,OAAO,eACP,OAAO,QACP,OAAO,gBACP,OAAO,QACP;AACA,gBAAM,WAA6B;AAAA,YACjC,aAAc,OAAO;AAAA,YACrB,MAAc,OAAO;AAAA,YACrB,cAAc,OAAO;AAAA,YACrB,QAAc,OAAO;AAAA,YACrB,aAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,UACvC;AACA,eAAK,IAAI,QAAQ;AACjB,iBAAO;AAAA,QACT;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,kBACJ,OACA,KAC2B;AAC3B,UAAM,WAAW,KAAK,OAAO,GAAG;AAChC,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,qBAAqB,GAAG,4BAA4B;AAAA,IACtE;AAGA,QAAI;AACJ,QAAI;AACF,YAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,YAAM,cAAc,MAAM,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACxE,YAAM,SAAS,aAAa,IAAI,QAAQ,IAAK,WAAW,SAAS,KAAM,CAAC;AACxE,UAAI;AACJ,UAAI,OAAO,SAAS,aAAa;AAC/B,eAAO,KAAK,MAAM;AAAA,MACpB,OAAO;AACL,eAAO,OAAO,KAAK,QAAQ,QAAQ,EAAE,SAAS,OAAO;AAAA,MACvD;AACA,YAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,YAAM,OAAO,OAAO,KAAK,MAAM,WAAW,OAAO,KAAK,IAAI;AAAA,IAC5D,QAAQ;AACN,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AAEA,QAAI,QAAQ,KAAK;AACf,YAAM,IAAI;AAAA,QACR,2CAA2C,GAAG,aAAa,OAAO,QAAQ;AAAA,MAC5E;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAIA,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAKO,SAAS,mBACd,QACA,QACA,UACA,SACa;AACb,SAAO,IAAI,YAAY;AAAA,IACrB,MAAa;AAAA,IACb,aAAa;AAAA,IACb,KAAa;AAAA,IACb;AAAA,IACA,QAAQ;AAAA,MACN;AAAA,MACA,QAAiBA,YAAW;AAAA,MAC5B,iBAAiB;AAAA,MACjB,iBAAiB;AAAA,MACjB,WAAiB;AAAA,MACjB;AAAA,IACF;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC,CAAC;AACH;AAYA,eAAsB,6BACpB,KACA,eACA,YAC6C;AAE7C,QAAM,UAAU,IAAI,SAAS,UAAU;AACvC,QAAM,UACJ,8BACA,YAAY,KACZ,IAAI,QAAQ,WACZ,IAAI,QAAQ;AAEd,MAAI,SAAS;AACX,WAAO,EAAE,OAAO,MAAM,QAAQ,yCAAyC;AAAA,EACzE;AAGA,QAAM,iBAAkB,IAAI,SAAS,iBAAiB,KACnD,IAAI,SAAS,eAAe;AAE/B,MAAI,CAAC,kBAAkB,mBAAmB,eAAe;AAEvD,WAAO,EAAE,OAAO,MAAM,QAAQ,6CAA6C;AAAA,EAC7E;AAGA,QAAM,WAAW,WAAW,OAAO,cAAc;AACjD,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,MACL,OAAQ;AAAA,MACR,QAAQ,qBAAqB,cAAc;AAAA,IAC7C;AAAA,EACF;AAGA,MAAI;AACJ,QAAM,cAAc,IAAI,SAAS,cAAc;AAC/C,MAAI,aAAa;AACf,UAAM,kBAAkB,WAAW;AAAA,EACrC,WAAW,OAAO,IAAI,QAAQ,UAAU;AACtC,UAAM,IAAI;AAAA,EACZ;AAEA,MAAI,wBAAqB;AACvB,WAAO;AAAA,MACL,OAAQ;AAAA,MACR,QAAQ,iFAAiF,GAAG;AAAA,IAC9F;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,QAAQ,kCAAkC;AAClE;;;AC3QO,IAAM,iBAAN,MAAM,wBAAuB,MAAM;AAAA,EACxC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,WAAO,eAAe,MAAM,gBAAe,SAAS;AAAA,EACtD;AACF;AAIO,IAAK,oBAAL,kBAAKC,uBAAL;AACL,EAAAA,mBAAA,UAAU;AACV,EAAAA,mBAAA,aAAU;AACV,EAAAA,mBAAA,aAAU;AACV,EAAAA,mBAAA,SAAU;AAJA,SAAAA;AAAA,GAAA;AAgBZ,IAAM,iBAAyC;AAAA,EAC7C,UAAW;AAAA,EACX,QAAW;AAAA,EACX,WAAW;AAAA,EACX,UAAW;AAAA,EACX,QAAW;AAAA,EACX,OAAW;AAAA,EACX,SAAW;AAAA,EACX,WAAW;AACb;AAEA,IAAM,iBAAyC,OAAO;AAAA,EACpD,OAAO,QAAQ,cAAc,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACvD;AAGO,SAAS,cAAc,SAAkC;AAC9D,QAAM,OAAO,QAAQ,OAAO;AAC5B,QAAM,UAAmC,CAAC;AAE1C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC/C,UAAM,QAAQ,eAAe,GAAG;AAChC,YAAQ,SAAS,GAAG,IAAI;AAAA,EAC1B;AAGA,MAAI,QAAQ,GAAG,KAAK,OAAO,QAAQ,GAAG,MAAM,UAAU;AACpD,UAAM,SAAS,QAAQ,GAAG;AAC1B,UAAM,gBAAyC,CAAC;AAChD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,YAAM,QAAQ,eAAe,CAAC;AAC9B,oBAAc,SAAS,CAAC,IAAI;AAAA,IAC9B;AACA,YAAQ,GAAG,IAAI;AAAA,EACjB;AAEA,QAAM,OAAO,KAAK,UAAU,OAAO;AACnC,QAAM,UAAU,IAAI,YAAY;AAChC,SAAO,QAAQ,OAAO,IAAI;AAC5B;AAGO,SAAS,cAAc,MAA+B;AAC3D,QAAM,UAAU,IAAI,YAAY;AAChC,QAAM,OAAO,QAAQ,OAAO,IAAI;AAChC,QAAM,UAAU,KAAK,MAAM,IAAI;AAG/B,QAAM,OAAgC,CAAC;AACvC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AAClD,UAAM,OAAO,eAAe,GAAG;AAC/B,SAAK,QAAQ,GAAG,IAAI;AAAA,EACtB;AAGA,MAAI,KAAK,SAAS,KAAK,OAAO,KAAK,SAAS,MAAM,UAAU;AAC1D,UAAM,SAAS,KAAK,SAAS;AAC7B,UAAM,iBAA0C,CAAC;AACjD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,MAAM,GAAG;AAC3C,YAAM,OAAO,eAAe,CAAC;AAC7B,qBAAe,QAAQ,CAAC,IAAI;AAAA,IAC9B;AACA,SAAK,SAAS,IAAI;AAAA,EACpB;AAGA,SAAO,IAAI,YAAY;AAAA,IACrB,MAAc,KAAK,MAAM,KAA4B;AAAA,IACrD,aAAc,KAAK,aAAa;AAAA,IAChC,KAAc,KAAK,KAAK;AAAA,IACxB,QAAc,KAAK,QAAQ;AAAA,IAC3B,QAAc,KAAK,QAAQ,KAAkC,KAAK,SAAS,KAAiC,CAAC;AAAA,IAC7G,WAAc,KAAK,WAAW;AAAA,IAC9B,YAAc,KAAK,YAAY;AAAA,IAC/B,WAAc,KAAK,WAAW;AAAA,EAChC,CAAC;AACH;AAIA,IAAM,eAAe;AACrB,IAAM,cAAe;AAMrB,eAAe,YAAY,OAAoC;AAC7D,QAAM,UAAU,IAAI,YAAY,EAAE,OAAO,KAAK;AAC9C,QAAM,KAAK,IAAI,YAAY,QAAQ,UAAU;AAC7C,MAAI,WAAW,EAAE,EAAE,IAAI,OAAO;AAG9B,QAAM,SAAwB,WAAmB,QAAQ,WACnD,MAAM,OAAO,QAAuB,GAAG,UAAU;AACvD,QAAM,aAAa,MAAM,OAAO,OAAO,WAAW,EAAE;AACpD,SAAO,IAAI,WAAW,UAAU;AAClC;AAUA,eAAsB,cAAc,SAA2C;AAC7E,QAAM,UAAW,QAAQ,SAAS,UAAU,KAA4B;AACxE,MAAI,YAAY,aAAa;AAC3B,UAAM,IAAI;AAAA,MACR,kEAAkE,OAAO;AAAA,IAC3E;AAAA,EACF;AAEA,QAAM,UAAW,QAAQ,SAAS,UAAU,KAA4B,QAAQ,UAAU;AAC1F,QAAM,QAAW,QAAQ,SAAS,QAAQ,KAA8B,QAAQ,UAAU;AAE1F,QAAM,WAAW,MAAM,YAAY,OAAO;AAC1C,QAAM,SAAW,MAAM,YAAY,KAAK;AAExC,QAAM,OAAY,QAAQ,WAAW,OAAO,IAAI,QAAQ,oBAAoB,EAAE;AAC9E,MAAI;AACJ,MAAI;AACF,QAAI,OAAO,SAAS,aAAa;AAC/B,YAAM,MAAM,KAAK,IAAI,MAAM,GAAG,EAAE,CAAC;AACjC,iBAAW,IAAI,WAAW,IAAI,MAAM;AACpC,eAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,UAAS,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,IACrE,OAAO;AACL,iBAAW,OAAO,KAAK,IAAI,MAAM,GAAG,EAAE,GAAG,QAAQ;AAAA,IACnD;AAAA,EACF,QAAQ;AACN,eAAW,IAAI,WAAW,CAAC;AAAA,EAC7B;AAGA,QAAM,KAAK,QAAQ,YAAY,KAAK,MAAM,IAAI,KAAK,QAAQ,SAAS,EAAE,QAAQ,IAAI,GAAI,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AACtH,QAAM,SAAS,OAAO;AAEtB,QAAM,MAAM,IAAI,WAAW,YAAY;AACvC,QAAM,OAAO,IAAI,SAAS,IAAI,MAAM;AAGpC,OAAK,UAAU,GAAG,aAAa,KAAK;AAEpC,MAAI,IAAI,SAAS,SAAS,GAAG,CAAC,GAAG,CAAC;AAElC,MAAI,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG,EAAE;AAEjC,OAAK,UAAU,IAAI,QAAQ,KAAK;AAEhC,QAAM,WAAW,IAAI,WAAW,CAAC;AACjC,WAAS,IAAI,SAAS,SAAS,GAAG,KAAK,IAAI,GAAG,SAAS,MAAM,CAAC,CAAC;AAC/D,MAAI,IAAI,UAAU,EAAE;AAEpB,MAAI,WAAW;AACf,WAAS,IAAI,GAAG,IAAI,IAAI,IAAK,aAAa,IAAI,CAAC,KAAK;AACpD,OAAK,UAAU,IAAI,WAAW,OAAQ,KAAK;AAG3C,MAAI,IAAI,WAAW,cAAc;AAC/B,UAAM,IAAI;AAAA,MACR,4CAA4C,YAAY,eAAe,IAAI,MAAM;AAAA,IACnF;AAAA,EACF;AAEA,SAAO;AACT;AAKO,SAAS,cAAc,MAAwC;AACpE,MAAI,KAAK,WAAW,cAAc;AAChC,UAAM,IAAI;AAAA,MACR,2BAA2B,YAAY,eAAe,KAAK,MAAM;AAAA,IACnE;AAAA,EACF;AAEA,QAAM,OAAW,IAAI,SAAS,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU;AAC3E,QAAM,UAAW,KAAK,UAAU,GAAG,KAAK;AACxC,QAAM,WAAW,KAAK,SAAS,GAAG,EAAE;AACpC,QAAM,SAAW,KAAK,SAAS,IAAI,EAAE;AACrC,QAAM,SAAW,KAAK,UAAU,IAAI,KAAK;AACzC,QAAM,WAAW,KAAK,SAAS,IAAI,EAAE;AAGrC,QAAM,YAAY,IAAI,KAAK,SAAS,GAAI,EAAE,YAAY;AACtD,QAAMC,SAAQ,CAAC,MAAkB,MAAM,KAAK,CAAC,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAEhG,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,UAAa;AAAA,MACb,WAAaA,OAAM,QAAQ;AAAA,MAC3B,SAAaA,OAAM,MAAM;AAAA,MACzB,aAAa;AAAA,MACb,eAAeA,OAAM,QAAQ;AAAA,IAC/B;AAAA,IACA;AAAA,EACF;AACF;AAIA,IAAM,cAAc;AAEpB,IAAM,kBAAkB;AAMjB,SAAS,gBAAgB,SAAsB,MAAc,aAA2B;AAC7F,QAAM,UAAU,cAAc,OAAO;AACrC,QAAM,YAAY,MAAM;AAExB,MAAI,aAAa,GAAG;AAClB,UAAM,IAAI,eAAe,OAAO,GAAG,gCAAgC,kBAAkB,CAAC,GAAG;AAAA,EAC3F;AAEA,QAAM,cAAc,KAAK,KAAK,QAAQ,SAAS,SAAS;AACxD,QAAM,SAAuB,CAAC;AAE9B,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,UAAM,QAAQ,QAAQ,SAAS,IAAI,YAAY,IAAI,KAAK,SAAS;AACjE,UAAM,QAAQ,IAAI,WAAW,kBAAkB,MAAM,MAAM;AAC3D,UAAM,CAAC,IAAI;AACX,UAAM,CAAC,IAAI;AACX,UAAM,CAAC,IAAI,MAAM,cAAc,IAAI,IAAO;AAC1C,UAAM,IAAI,OAAO,eAAe;AAChC,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,SAAO;AACT;AAKO,SAAS,gBAAgB,QAAmC;AACjE,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,eAAe,qCAAqC;AAAA,EAChE;AAGA,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,OAAO,EAAE,CAAC,KAAK,MAAM,EAAE,CAAC,KAAK,EAAE;AAGnE,QAAM,gBAAgB,OAAO,CAAC,IAAI,CAAC,KAAK,OAAO;AAC/C,MAAI,OAAO,WAAW,eAAe;AACnC,UAAM,IAAI;AAAA,MACR,6BAA6B,aAAa,gBAAgB,OAAO,MAAM;AAAA,IACzE;AAAA,EACF;AAGA,QAAM,gBAAgB,OAAO,IAAI,OAAK,EAAE,SAAS,eAAe,CAAC;AACjE,QAAM,WAAW,cAAc,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;AAC/D,QAAM,UAAU,IAAI,WAAW,QAAQ;AACvC,MAAI,SAAS;AACb,aAAW,SAAS,eAAe;AACjC,YAAQ,IAAI,OAAO,MAAM;AACzB,cAAU,MAAM;AAAA,EAClB;AAEA,SAAO,cAAc,OAAO;AAC9B;AAWO,SAAS,gBACd,WACA,SACmB;AACnB,QAAM,UAAW,QAAQ,SAAS,UAAU,KAA4B;AACxE,QAAM,WAAW,YAAY;AAE7B,QAAM,MAAM,CAAC,QAA2B,UAAU,SAAS,GAAG;AAE9D,MAAI,UAAU;AACZ,QAAI,IAAI,uBAAyB,EAAG,QAAO;AAC3C,QAAI,IAAI,eAAqB,EAAO,QAAO;AAC3C,QAAI,IAAI,uBAAyB,EAAG,QAAO;AAC3C,QAAI,IAAI,iBAAsB,EAAM,QAAO;AAAA,EAC7C,OAAO;AACL,QAAI,IAAI,iBAAsB,EAAM,QAAO;AAC3C,QAAI,IAAI,uBAAyB,EAAG,QAAO;AAC3C,QAAI,IAAI,eAAqB,EAAO,QAAO;AAAA,EAC7C;AAEA,QAAM,IAAI;AAAA,IACR,0CAA0C,UAAU,KAAK,IAAI,CAAC;AAAA,EAChE;AACF;;;ACrUO,IAAK,gBAAL,kBAAKC,mBAAL;AACL,EAAAA,eAAA,YAAS;AACT,EAAAA,eAAA,SAAS;AAFC,SAAAA;AAAA,GAAA;AAwBZ,SAASC,cAAqB;AAC5B,MAAI,OAAO,WAAW,eAAe,OAAO,OAAO,eAAe,YAAY;AAC5E,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG,CAAC;AAC9E,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,CAAC,KAAM,MAAM,CAAC,KAAK,KAAK,KAAQ;AACtC,QAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAC5D,SAAO,GAAG,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,IAAI,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC;AACnJ;AAEA,eAAe,iBAAiB,MAAmC;AAIjE,QAAM,SAAwB,WAAmB,QAAQ,WACnD,MAAM,OAAO,QAAuB,GAAG,UAAU;AACvD,QAAM,KAAK,IAAI,YAAY,KAAK,UAAU;AAC1C,MAAI,WAAW,EAAE,EAAE,IAAI,IAAI;AAC3B,QAAM,aAAa,MAAM,OAAO,OAAO,WAAW,EAAE;AACpD,QAAM,YAAa,IAAI,WAAW,UAAU;AAC5C,SAAO,MAAM,KAAK,SAAS,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,EAAE;AAChF;AAEA,SAAS,cAAc,MAA0B;AAC/C,MAAI,OAAO,WAAW,aAAa;AACjC,WAAO,OAAO,KAAK,IAAI,EAAE,SAAS,QAAQ;AAAA,EAC5C;AAEA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,WAAU,OAAO,aAAa,KAAK,CAAC,KAAK,CAAC;AAChF,SAAO,KAAK,MAAM;AACpB;AAMA,SAAS,eACP,MACA,WACa;AACb,QAAM,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG,GAAG,UAAU;AAC9C,SAAO,YAAY,SAAS,IAA+B;AAC7D;AAQA,eAAsB,eACpB,SACA,MACA,UACsB;AACtB,QAAM,aAAa,MAAM,iBAAiB,IAAI;AAC9C,QAAM,UAAa,cAAc,IAAI;AAErC,QAAM,QAAoB;AAAA,IACxB,SAAYA,YAAW;AAAA,IACvB;AAAA,IACA,UAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,WAAY,KAAK;AAAA,EACnB;AAEA,QAAM,WAAY,QAAQ,eAAuD,CAAC;AAClF,SAAO,eAAe,SAAS,EAAE,aAAa,CAAC,GAAG,UAAU,KAAK,EAAE,CAAC;AACtE;AAKO,SAAS,YACd,SACA,QACA,UACA,YACA,WACa;AACb,QAAM,QAAoB;AAAA,IACxB,SAAYA,YAAW;AAAA,IACvB;AAAA,IACA,UAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,QAAM,WAAY,QAAQ,eAAuD,CAAC;AAClF,SAAO,eAAe,SAAS,EAAE,aAAa,CAAC,GAAG,UAAU,KAAK,EAAE,CAAC;AACtE;AAMA,eAAsB,oBACpB,SAC6C;AAC7C,QAAM,SAAU,QAAQ,eAAuD,CAAC;AAEhF,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,OAAO,MAAM,QAAQ,kBAAkB;AAAA,EAClD;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,QAAQ,OAAO,CAAC;AAEtB,QAAI,CAAC,MAAM,QAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,qBAAqB;AACrF,QAAI,CAAC,MAAM,SAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,sBAAsB;AACtF,QAAI,CAAC,MAAM,WAAY,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,wBAAwB;AACxF,QAAI,MAAM,YAAY,EAAG,QAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,4BAA4B;AAE9F,QAAI,MAAM,aAAa,uBAAsB;AAC3C,UAAI,CAAC,MAAM,SAAS;AAClB,eAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,sCAAsC;AAAA,MACjF;AAEA,UAAI;AACJ,UAAI;AACF,YAAI,OAAO,WAAW,aAAa;AACjC,oBAAU,OAAO,KAAK,MAAM,SAAS,QAAQ;AAAA,QAC/C,OAAO;AACL,gBAAM,MAAM,KAAK,MAAM,OAAO;AAC9B,oBAAU,IAAI,WAAW,IAAI,MAAM;AACnC,mBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,SAAQ,CAAC,IAAI,IAAI,WAAW,CAAC;AAAA,QACpE;AAAA,MACF,QAAQ;AACN,eAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,kCAAkC;AAAA,MAC7E;AACA,YAAM,aAAa,MAAM,iBAAiB,OAAO;AACjD,UAAI,eAAe,MAAM,YAAY;AACnC,eAAO;AAAA,UACL,OAAQ;AAAA,UACR,QAAQ,SAAS,CAAC,iCAAiC,MAAM,UAAU,SAAS,UAAU;AAAA,QACxF;AAAA,MACF;AAAA,IACF,WAAW,MAAM,aAAa,iBAAmB;AAC/C,UAAI,CAAC,MAAM,QAAQ;AACjB,eAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,kCAAkC;AAAA,MAC7E;AAAA,IACF,OAAO;AACL,aAAO,EAAE,OAAO,OAAO,QAAQ,SAAS,CAAC,wBAAwB,MAAM,QAAkB,IAAI;AAAA,IAC/F;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,MAAM,QAAQ,KAAK;AACrC;AAOA,eAAsB,wBACpB,OACsB;AACtB,MAAI,MAAM,IAAI,YAAY;AAAA,IACxB,MAAa;AAAA,IACb,aAAa;AAAA,IACb,KAAa;AAAA,IACb,QAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,MACA,QAAUA,YAAW;AAAA,IACvB;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC,CAAC;AAED,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,eAAe,KAAK,KAAK,MAAM,KAAK,QAAQ;AAAA,EAC1D;AAEA,SAAO;AACT;AAKA,eAAsB,gBACpB,UACA,MACA,UACA,YACA,SACsB;AACtB,QAAM,aAAa,MAAM,iBAAiB,IAAI;AAC9C,QAAM,UAAa,cAAc,IAAI;AAErC,QAAM,QAAoB;AAAA,IACxB,SAAYA,YAAW;AAAA,IACvB;AAAA,IACA,UAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,WAAY,KAAK;AAAA,EACnB;AAEA,QAAM,kBAA+B;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,MAAM,IAAI,YAAY;AAAA,IACxB,MAAa;AAAA,IACb,aAAa;AAAA,IACb,KAAa;AAAA,IACb,QAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,MACA,QAAcA,YAAW;AAAA,MACzB,cAAc;AAAA,IAChB;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC,CAAC;AAGD,QAAM,eAAe,KAAK,EAAE,aAAa,CAAC,KAAK,EAAE,CAAC;AAClD,SAAO;AACT;;;ACvPO,IAAM,yBAAyB;AAoDtC,IAAI,aAAa;AAEjB,SAAS,cAAsB;AAC7B,SAAO,MAAM,KAAK,IAAI,CAAC,IAAI,EAAE,UAAU;AACzC;AAEO,SAAS,sBACd,SAAmD,CAAC,GACjC;AACnB,SAAO;AAAA,IACL;AAAA,IACA,YAAY,OAAO,cAAc,YAAY;AAAA,IAC7C,YAAY,OAAO,cAAc;AAAA,IACjC,cAAc,OAAO,gBAAgB;AAAA,IACrC,cAAc,OAAO,gBAAgB;AAAA,IACrC,eAAe,OAAO,iBAAiB;AAAA,IACvC,sBAAsB,OAAO,wBAAwB;AAAA,IACrD,UAAU,OAAO,YAAY;AAAA,IAC7B,SAAS,OAAO,WAAW,CAAC;AAAA,IAC5B,WAAW,OAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EAC9C;AACF;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,QAAM,SAA2B;AAAA,IAC/B;AAAA,IACA,YAAY,OAAO,cAAc;AAAA,IACjC,cAAc,OAAO,gBAAgB;AAAA,IACrC,QAAQ,OAAO,UAAU;AAAA,IACzB,eAAe,OAAO,iBAAiB;AAAA,IACvC,YAAY,OAAO,cAAc;AAAA,IACjC,eAAe,OAAO,iBAAiB;AAAA,IACvC,gBAAgB,OAAO,kBAAkB,CAAC;AAAA,IAC1C,WAAW,OAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EAC9C;AACA,MAAI,OAAO,kBAAkB,QAAW;AACtC,WAAO,gBAAgB,OAAO;AAAA,EAChC;AACA,SAAO;AACT;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,SAAO;AAAA,IACL;AAAA,IACA,YAAY,OAAO,cAAc;AAAA,IACjC,cAAc,OAAO,gBAAgB;AAAA,IACrC,QAAQ,OAAO,UAAU;AAAA,IACzB,WAAW,OAAO,aAAa,KAAK,IAAI,IAAI;AAAA,EAC9C;AACF;AASO,SAAS,wBACd,YACA,SAA0C,WACjC;AACT,MAAI,WAAW,aAAa,WAAW,UAAU;AAC/C,WAAO,cAAc;AAAA,EACvB;AACA,MAAI,WAAW,UAAU;AAEvB,WAAO,cAAc;AAAA,EACvB;AACA,SAAO;AACT;AAQO,SAAS,cAAc,YAA6B;AACzD,SAAO,cAAc;AACvB;;;ACvIO,IAAM,0BAA0B;AA8EvC,IAAIC,cAAa;AAEjB,SAAS,iBAAyB;AAChC,SAAO,OAAO,KAAK,IAAI,CAAC,IAAI,EAAEA,WAAU;AAC1C;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,OAAO,kBAAkB;AAAA,IACzC,oBAAoB,OAAO,sBAAsB;AAAA,IACjD,eAAe,OAAO,iBAAiB;AAAA,IACvC,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW,OAAO,aAAa;AAAA,IAC/B,YAAY,OAAO,cAAc,KAAK,IAAI,IAAI;AAAA,EAChD;AACF;AAEO,SAAS,qBACd,SAAkD,CAAC,GACjC;AAClB,QAAM,QAAQ,OAAO,SAAS;AAC9B,MAAI,QAAQ,KAAO,QAAQ,GAAK;AAC9B,UAAM,IAAI,MAAM,oCAAoC,KAAK,EAAE;AAAA,EAC7D;AACA,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,OAAO,kBAAkB;AAAA,IACzC,cAAc,OAAO,gBAAgB;AAAA,IACrC;AAAA,IACA,eAAe,OAAO,iBAAiB;AAAA,IACvC,UAAU,OAAO,YAAY;AAAA,IAC7B,cAAc,OAAO,gBAAgB,KAAK,IAAI,IAAI;AAAA,EACpD;AACF;AAEO,SAAS,mBACd,SAAgD,CAAC,GACjC;AAChB,SAAO;AAAA,IACL;AAAA,IACA,WAAW,OAAO,aAAa;AAAA,IAC/B,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW,OAAO,aAAa,CAAC;AAAA,IAChC,gBAAgB,OAAO,kBAAkB;AAAA,IACzC,cAAc,OAAO,gBAAgB,KAAK,IAAI,IAAI;AAAA,EACpD;AACF;AAEO,SAAS,2BACd,SAAwD,CAAC,GACjC;AACxB,QAAM,QAAQ,OAAO,SAAS;AAC9B,MAAI,QAAQ,KAAO,QAAQ,GAAK;AAC9B,UAAM,IAAI,MAAM,oCAAoC,KAAK,EAAE;AAAA,EAC7D;AACA,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,OAAO,UAAU,eAAe;AAAA,IACxC,UAAU,OAAO,YAAY;AAAA,IAC7B,cAAc,OAAO,gBAAgB;AAAA,IACrC;AAAA,IACA,eAAe,OAAO,iBAAiB;AAAA,IACvC,UAAU,OAAO,YAAY;AAAA,IAC7B,WAAW,OAAO,aAAa;AAAA,IAC/B,SAAS,OAAO,WAAW;AAAA,MACzB,cAAc;AAAA,MACd,UAAU;AAAA,MACV,kBAAkB;AAAA,MAClB,eAAe;AAAA,IACjB;AAAA,IACA,wBAAwB,OAAO,0BAA0B;AAAA,IACzD,YAAY,OAAO,cAAc,KAAK,IAAI,IAAI;AAAA,EAChD;AACF;AAQO,SAAS,yBAAyB,YAA6B;AACpE,SAAO,cAAc;AACvB;;;ACtKO,IAAM,yBAAyB;AAkD/B,SAAS,eAAe,GAA2C;AACxE,QAAM,OAA6B;AAAA,IACjC,KAAkB,EAAE;AAAA,IACpB,kBAAkB,EAAE;AAAA,IACpB,YAAkB,EAAE;AAAA,IACpB,YAAkB,EAAE;AAAA,IACpB,WAAkB,EAAE;AAAA,EACtB;AACA,MAAI,EAAE,UAAW,MAAK,YAAY,EAAE;AACpC,SAAO;AACT;AAGO,SAAS,iBAAiB,GAA2C;AAC1E,SAAO;AAAA,IACL,KAAiB,EAAE;AAAA,IACnB,iBAAiB,EAAE;AAAA,IACnB,WAAiB,EAAE;AAAA,IACnB,YAAiB,EAAE,cAAc,CAAC;AAAA,IAClC,UAAiB,EAAE,aAAa;AAAA,IAChC,WAAiB,EAAE;AAAA,EACrB;AACF;AAMO,SAAS,sBAAsB,GAA6B;AACjE,QAAM,MAA+B;AAAA,IACnC,YAAkB,EAAE;AAAA,IACpB,YAAkB,EAAE,WAAW,IAAI,QAAM;AAAA,MACvC,MAAS,EAAE;AAAA,MACX,MAAS,EAAE;AAAA,MACX,SAAS,EAAE;AAAA,IACb,EAAE;AAAA,IACF,kBAAkB,EAAE;AAAA,IACpB,KAAkB,EAAE;AAAA,IACpB,WAAkB,EAAE;AAAA,EACtB;AAEA,SAAO,KAAK,UAAU,GAAG;AAC3B;AAOO,IAAM,yBAAN,cAAqC,MAAM;AAAA,EAChD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAOO,SAAS,iBAAiB,GAA+B;AAC9D,QAAM,SAAmB,CAAC;AAC1B,MAAI,CAAC,EAAE,IAAK,QAAO,KAAK,iBAAiB;AACzC,MAAI,CAAC,EAAE,gBAAiB,QAAO,KAAK,6BAA6B;AACjE,MAAI,CAAC,EAAE,UAAW,QAAO,KAAK,uBAAuB;AACrD,MAAI,CAAC,EAAE,UAAU,WAAW,SAAS,EAAG,QAAO,KAAK,qCAAqC;AACzF,MAAI,CAAC,EAAE,SAAU,QAAO,KAAK,sBAAsB;AACnD,MAAI,CAAC,EAAE,UAAW,QAAO,KAAK,iDAAiD;AAC/E,aAAW,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,QAAQ,GAAG;AAC3C,QAAI,CAAC,EAAE,KAAM,QAAO,KAAK,cAAc,CAAC,oBAAoB;AAC5D,QAAI,CAAC,EAAE,QAAS,QAAO,KAAK,cAAc,CAAC,uBAAuB;AAClE,QAAI,CAAC,EAAE,KAAK,WAAW,SAAS,EAAG,QAAO,KAAK,cAAc,CAAC,kCAAkC;AAAA,EAClG;AACA,SAAO;AACT;;;ACjEO,SAAS,sBAAsB,GAAuD;AAC3F,SAAO;AAAA,IACL,YAAgB,EAAE;AAAA,IAClB,cAAgB,EAAE;AAAA,IAClB,gBAAgB,EAAE;AAAA,IAClB,eAAgB,EAAE;AAAA,IAClB,YAAgB,EAAE;AAAA,EACpB;AACF;AAEO,SAAS,wBAAwB,GAAuD;AAC7F,SAAO;AAAA,IACL,WAAe,EAAE;AAAA,IACjB,aAAe,EAAE;AAAA,IACjB,eAAe,EAAE,kBAAkB,CAAC;AAAA,IACpC,eAAe,EAAE,iBAAiB;AAAA,IAClC,WAAe,EAAE,cAAc;AAAA,EACjC;AACF;AAUO,SAAS,wBAAwB,GAAqC;AAC3E,QAAM,SAAmB,CAAC;AAC1B,MAAI,CAAC,EAAE,UAAW,QAAO,KAAK,uBAAuB;AACrD,MAAI,CAAC,EAAE,YAAa,QAAO,KAAK,yBAAyB;AACzD,MAAI,CAAC,EAAE,iBAAiB,EAAE,cAAc,WAAW;AACjD,WAAO,KAAK,kDAAkD;AAChE,MAAI,CAAC,EAAE,cAAe,QAAO,KAAK,2BAA2B;AAC7D,MAAI,CAAC,EAAE,aAAa,EAAE,aAAa,EAAG,QAAO,KAAK,6CAA6C;AAC/F,MAAI,EAAE,YAAY,KAAK,IAAI,IAAI,IAAM,QAAO,KAAK,qDAAgD;AACjG,SAAO;AACT;AAGO,SAAS,wBAAwB,GAAoC;AAC1E,SAAO,KAAK,IAAI,IAAI,MAAO,EAAE,aAAa,wBAAwB,CAAC,EAAE,WAAW;AAClF;AAMO,IAAM,wBAAwB;AAAA,EACnC,gBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,eAAiB;AAAA,EACjB,cAAiB;AACnB;;;AC/GO,IAAM,qBAAsB;AAC5B,IAAM,qBAAsB;AAE5B,IAAM,8BAA8B;AA2CpC,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAMA,SAASC,kBAAiB,OAAwC;AAChE,QAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,MAAI,MAAM,SAAS,EAAG,OAAM,IAAI,aAAa,uBAAuB;AACpE,QAAM,OAAO,MAAM,CAAC,KAAK,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACjE,QAAM,SAAS,MAAM,IAAI,QAAQ,IAAI,IAAI,SAAS,KAAK,CAAC;AACxD,MAAI;AACF,WAAO,KAAK,MAAM,KAAK,MAAM,CAAC;AAAA,EAChC,SAAS,GAAG;AACV,UAAM,IAAI,aAAa,8BAA8B,OAAO,CAAC,CAAC,EAAE;AAAA,EAClE;AACF;AAUO,SAAS,kBAAkB,OAA8B;AAC9D,QAAM,UAAUA,kBAAiB,KAAK;AACtC,QAAM,MAAM,OAAO,QAAQ,KAAK,KAAK,CAAC;AACtC,MAAI,MAAM,KAAK,KAAK,IAAI,IAAI,MAAO,KAAK;AACtC,UAAM,IAAI,aAAa,+BAA+B,OAAO,QAAQ,KAAK,CAAC,CAAC,GAAG;AAAA,EACjF;AACA,QAAM,UAAU,OAAO,QAAQ,UAAU,KAAK,EAAE;AAChD,MAAI,CAAC,QAAS,OAAM,IAAI,aAAa,uCAAuC;AAE5E,SAAO;AAAA,IACL,KAAS,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,IACpC;AAAA,IACA,QAAS,MAAM,QAAQ,QAAQ,aAAa,CAAC,IAAI,QAAQ,aAAa,IAC3D,MAAM,QAAQ,QAAQ,QAAQ,CAAC,IAAI,QAAQ,QAAQ,IAAgB,CAAC;AAAA,IAC/E;AAAA,IACA,KAAS,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,EACtC;AACF;AAYO,SAAS,qBAAqB,OAAiC;AACpE,QAAM,UAAUA,kBAAiB,KAAK;AAEtC,QAAM,MAAM,OAAO,QAAQ,KAAK,KAAK,EAAE;AACvC,MAAI,QAAQ,oBAAoB;AAC9B,UAAM,IAAI;AAAA,MACR,+BAA+B,kBAAkB,WAAW,GAAG;AAAA,IACjE;AAAA,EACF;AAEA,QAAM,SAAmB,MAAM,QAAQ,QAAQ,aAAa,CAAC,IACzD,QAAQ,aAAa,IACrB,MAAM,QAAQ,QAAQ,QAAQ,CAAC,IAAI,QAAQ,QAAQ,IAAgB,CAAC;AAExE,MAAI,CAAC,OAAO,SAAS,eAAe,GAAG;AACrC,UAAM,IAAI,aAAa,0DAA0D;AAAA,EACnF;AAEA,QAAM,MAAM,OAAO,QAAQ,KAAK,KAAK,CAAC;AACtC,MAAI,MAAM,KAAK,KAAK,IAAI,IAAI,MAAO,KAAK;AACtC,UAAM,IAAI,aAAa,kCAAkC,OAAO,QAAQ,KAAK,CAAC,CAAC,GAAG;AAAA,EACpF;AAEA,QAAM,SAAS,OAAO,QAAQ,SAAS,KAAK,EAAE;AAC9C,MAAI,CAAC,OAAQ,OAAM,IAAI,aAAa,yCAAyC;AAE7E,QAAM,YAAsB,MAAM,QAAQ,QAAQ,YAAY,CAAC,IAC3D,QAAQ,YAAY,IAAgB,CAAC;AAEzC,SAAO;AAAA,IACL,KAAK,OAAO,QAAQ,KAAK,KAAK,EAAE;AAAA,IAChC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAQO,SAAS,4BACd,OACA,WACkB;AAClB,QAAM,SAAS,qBAAqB,KAAK;AAEzC,MAAI,CAAC,OAAO,UAAU,SAAS,SAAS,GAAG;AACzC,UAAM,IAAI;AAAA,MACR,oDAAoD,SAAS,yBACvC,OAAO,UAAU,KAAK,IAAI,CAAC;AAAA,IACnD;AAAA,EACF;AAEA,SAAO;AACT;AAYA,IAAI,mBAA2C;AAQ/C,eAAsB,oBACpB,MAAc,oBACY;AAC1B,QAAM,MAAM,KAAK,IAAI;AACrB,MAAI,oBAAoB,MAAM,iBAAiB,YAAY,6BAA6B;AACtF,WAAO;AAAA,EACT;AAEA,MAAI;AACF,UAAM,OAAO,MAAM,MAAM,KAAK,EAAE,QAAQ,YAAY,UAAU,GAAI,EAAE,CAAC;AACrE,UAAM,OAAO,MAAM,KAAK,KAAK;AAI7B,uBAAmB;AAAA,MACjB,sBAAsB,IAAI,IAAI,KAAK,yBAAyB,CAAC,CAAC;AAAA,MAC9D,aAAsB,IAAI,IAAI,KAAK,gBAAgB,CAAC,CAAC;AAAA,MACrD,WAAsB;AAAA,IACxB;AAAA,EACF,QAAQ;AAEN,QAAI,iBAAkB,QAAO;AAC7B,uBAAmB,EAAE,sBAAsB,oBAAI,IAAI,GAAG,aAAa,oBAAI,IAAI,GAAG,WAAW,IAAI;AAAA,EAC/F;AAEA,SAAO;AACT;AAMA,eAAsB,oBACpB,QACA,KACkB;AAClB,QAAM,QAAQ,MAAM,oBAAoB;AACxC,MAAI,MAAM,qBAAqB,IAAI,OAAO,GAAG,EAAG,QAAO;AACvD,MAAI,OAAO,MAAM,YAAY,IAAI,GAAG,EAAG,QAAO;AAC9C,SAAO;AACT;AAQA,eAAsB,sBACpB,OACA,WACA,SAC2B;AAC3B,QAAM,SAAS,4BAA4B,OAAO,SAAS;AAE3D,MAAI,CAAC,SAAS,qBAAqB;AACjC,UAAM,UAAU,MAAM,oBAAoB,MAAM;AAChD,QAAI,SAAS;AACX,YAAM,IAAI;AAAA,QACR,6BAA6B,OAAO,GAAG;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;AC/OA,SAAS,YAAY,OAA2B;AAC9C,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,WAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAC9E,SAAO,KAAK,MAAM,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,MAAM,EAAE;AAC9E;AAEA,SAAS,cAAc,KAAyB;AAC9C,QAAM,SAAS,IAAI,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AACvD,QAAM,SAAS,KAAK,MAAM;AAC1B,QAAM,QAAQ,IAAI,WAAW,OAAO,MAAM;AAC1C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,OAAM,CAAC,IAAI,OAAO,WAAW,CAAC;AACtE,SAAO;AACT;AAEA,eAAe,UAAU,MAAmC;AAC1D,MAAI,OAAO,WAAW,eAAe,OAAO,QAAQ;AAClD,UAAM,MAAM,MAAM,OAAO,OAAO,OAAO,WAAW,KAAK,MAAqB;AAC5E,WAAO,MAAM,KAAK,IAAI,WAAW,GAAG,CAAC,EAClC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE,EACP,MAAM,GAAG,CAAC;AAAA,EACf;AAEA,QAAM,EAAE,WAAW,IAAI,UAAQ,QAAa;AAC5C,SAAO,WAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,CAAC;AACnE;AAEA,IAAI;AAEJ,eAAe,eAAe;AAC5B,MAAI,aAAc,QAAO;AACzB,MAAI,OAAO,cAAY,aAAa;AAClC,QAAI;AAEF,qBAAe,UAAQ,+BAA+B;AACtD,aAAO;AAAA,IACT,QAAQ;AAAA,IAAqB;AAAA,EAC/B;AACA,MAAI;AACF,mBAAe,MAAM,OAAO,+BAA+B;AAC3D,WAAO;AAAA,EACT,QAAQ;AACN,UAAM,IAAI;AAAA,MACR;AAAA,IAEF;AAAA,EACF;AACF;AAWO,IAAM,eAAN,MAAM,cAAa;AAAA,EAKhB,YAAY,MAAwB;AAJ5C,wBAAS;AACT,wBAAS;AACT,wBAAS;AAGP,SAAK,QAAQ,KAAK;AAClB,SAAK,YAAY,KAAK;AACtB,SAAK,YAAY,KAAK;AAAA,EACxB;AAAA,EAEA,aAAa,WAAkC;AAC7C,UAAM,IAAI,MAAM,aAAa;AAC7B,UAAM,KAAK,EAAG,SAAS,OAAO;AAC9B,UAAM,QAAQ,MAAM,UAAU,GAAG,SAAS;AAC1C,WAAO,IAAI,cAAa,EAAE,WAAW,GAAG,WAAW,WAAW,GAAG,WAAW,MAAM,CAAC;AAAA,EACrF;AAAA,EAEA,aAAa,cAAc,WAA8C;AACvE,UAAM,QAAQ,MAAM,UAAU,SAAS;AACvC,WAAO,IAAI,cAAa,EAAE,WAAW,MAAM,CAAC;AAAA,EAC9C;AAAA,EAEA,aAAa,gBAAgB,WAAuB,WAA8C;AAChG,UAAM,QAAQ,MAAM,UAAU,SAAS;AACvC,WAAO,IAAI,cAAa,EAAE,WAAW,WAAW,MAAM,CAAC;AAAA,EACzD;AAAA,EAEA,IAAI,gBAAyB;AAAE,WAAO,KAAK,cAAc;AAAA,EAAW;AAAA,EAEpE,MAAM,UAAU,MAAuC;AACrD,QAAI,CAAC,KAAK,UAAW,OAAM,IAAI,MAAM,4DAA4D;AACjG,UAAM,IAAI,MAAM,aAAa;AAC7B,WAAO,EAAG,SAAS,KAAK,MAAM,KAAK,SAAS;AAAA,EAC9C;AAAA,EAEA,MAAM,YAAY,MAAkB,WAAsC;AACxE,UAAM,IAAI,MAAM,aAAa;AAC7B,UAAM,KAAK,EAAG,SAAS,OAAO,WAAW,MAAM,KAAK,SAAS;AAC7D,QAAI,CAAC,GAAI,OAAM,IAAI,MAAM,yCAAyC;AAAA,EACpE;AAAA,EAEA,WAAmB;AACjB,WAAO,sBAAsB,KAAK,KAAK,oBAAoB,KAAK,gBAAgB,mBAAmB,aAAa;AAAA,EAClH;AACF;AAMA,SAAS,sBAAsB,KAA8B;AAC3D,QAAM,UAAU;AAAA,IACd,MAAM,IAAI;AAAA,IACV,QAAS,IAA2C,OAAO,KAAK;AAAA,IAChE,WAAW,IAAI;AAAA,IACf,KAAK,IAAI;AAAA,IACT,QAAQ,IAAI;AAAA,IACZ,QAAQ,IAAI;AAAA,EACd;AACA,SAAO,IAAI,YAAY,EAAE;AAAA,IACvB,KAAK,UAAU,OAAO,YAAY,OAAO,QAAQ,OAAO,EAAE,KAAK,CAAC,CAAC;AAAA,EACnE;AACF;AAWA,eAAsB,YACpB,KACA,SACsB;AACtB,QAAM,UAAU,sBAAsB,GAAG;AACzC,QAAM,SAAS,MAAM,QAAQ,UAAU,OAAO;AAC9C,EAAC,IAA2C,WAAW,IAAI;AAAA,IACzD,KAAK;AAAA,IACL,KAAK,QAAQ;AAAA,IACb,KAAK,YAAY,MAAM;AAAA,EACzB;AACA,SAAO;AACT;AAOA,eAAsB,cACpB,KACA,aACe;AACf,QAAM,MAAM,IAAI;AAChB,MAAI,CAAC,IAAK,OAAM,IAAI,MAAM,oDAA+C;AACzE,MAAI,IAAI,QAAQ,aAAa;AAC3B,UAAM,IAAI;AAAA,MACR,oCAAoC,IAAI,GAAG;AAAA,IAE7C;AAAA,EACF;AACA,QAAM,UAAU,YAAY,KAAK,CAAC,MAAM,EAAE,UAAU,IAAI,GAAG;AAC3D,MAAI,CAAC,SAAS;AACZ,UAAM,IAAI;AAAA,MACR,qCAAqC,IAAI,GAAG,kBAC1B,YAAY,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC;AAAA,IAC9D;AAAA,EACF;AACA,MAAI;AACJ,MAAI;AAAE,aAAS,cAAc,IAAI,GAAG;AAAA,EAAG,SAAS,GAAG;AAAE,UAAM,IAAI,MAAM,0BAA0B,CAAC,EAAE;AAAA,EAAG;AACrG,QAAM,QAAQ,YAAY,sBAAsB,GAAG,GAAG,MAAM;AAC9D;AAOO,IAAM,iBAAiB;AAG9B,eAAsB,kBACpB,KACA,aACA,aAAa,MACE;AACf,SAAO,cAAc,KAAK,WAAW;AACvC;;;ACjNO,IAAM,gBAA0C;AAAA,EACrD,GAAG,CAAC,YAAY,UAAU,cAAc;AAAA,EACxC,GAAG,CAAC,QAAQ,WAAW,QAAQ;AAAA,EAC/B,GAAG,CAAC,UAAU,QAAQ;AACxB;AAGO,IAAM,wBAAgD;AAAA;AAAA,EAE3D,YAAY;AAAA,EACZ,cAAc;AAAA,EACd,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,mBAAmB;AAAA;AAAA,EAEnB,eAAe;AAAA,EACf,aAAa;AAAA,EACb,cAAc;AAAA,EACd,mBAAmB;AAAA,EACnB,iBAAiB;AAAA;AAAA,EAEjB,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,YAAY;AACd;AAgBO,SAAS,iBAAiB,QAAyB,UAA2B;AACnF,QAAM,WAAW,sBAAsB,QAAQ,KAAK;AACpD,SAAO,OAAO,OAAO;AACvB;;;AC5BO,IAAM,uBAAuB;AAE7B,SAASC,yBAAwB,OAA8B;AACpE,MAAI,MAAM,SAAS,sBAAsB;AACvC,UAAM,IAAI;AAAA,MACR,uCAAuC,oBAAoB,SAAS,MAAM,MAAM;AAAA,IAClF;AAAA,EACF;AACF;AAKO,IAAI;AAOJ,SAAS,qBAAqB,OAAyB;AAC5D,MAAI,CAAC,MAAM,KAAM;AACjB,MAAI;AAEJ,MAAI,WAAW;AACb,aAAS,UAAU,MAAM,IAAI;AAAA,EAC/B,OAAO;AACL,QAAI;AAGF,YAAM,IAAI,OAAO,cAAY,cAAc,YAAU;AACrD,UAAI,CAAC,EAAG;AACR,YAAM,EAAE,WAAW,IAAI,EAAE,aAAa;AAGtC,eAAS,YAAY,WAAW,QAAQ,EAAE,OAAO,MAAM,IAAI,EAAE,OAAO,KAAK;AAAA,IAC3E,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,MAAM,aAAa;AAChC,UAAM,IAAI,MAAM,sCAAsC,MAAM,WAAW,SAAS,MAAM,EAAE;AAAA,EAC1F;AACF;;;AC+GO,IAAM,UAAU;AAEhB,IAAM,eAAe;","names":["MessageType","_0n","_1n","_0n","_1n","_1n","_0n","_1n","_0n","_1n","_0n","_1n","_0n","_0n","_1n","_2n","_8n","uvRatio","p","randomBytes","adjustScalarBytes","_1n","_1n","_2n","_5n","_8n","_2n","_1n","bitLen","data","QoSLevel","generateId","SAFETY_MESSAGE_TYPE","generateId","generateId","status","DataCategory","SAFETY_MESSAGE_TYPE","FaultCode","Role","RegistryTier","FederationSyncType","CACHE_TTL_MS","generateId","TransportEncoding","toHex","MediaEncoding","generateId","_idCounter","decodeJwtPayload","validateDelegationChain"]}