@bcts/frost-hubert 1.0.0-alpha.22 → 1.0.0-beta.0

package/dist/parallel-D6zc6VW4.mjs

@@ -0,0 +1,235 @@
+//#region src/cmd/parallel.ts
+/**
+* Create a Pending status.
+*/
+function fetchStatusPending() {
+	return { type: "Pending" };
+}
+/**
+* Create a Success status.
+*/
+function fetchStatusSuccess(envelope) {
+	return {
+		type: "Success",
+		envelope
+	};
+}
+/**
+* Create a Rejected status.
+*/
+function fetchStatusRejected(reason) {
+	return {
+		type: "Rejected",
+		reason
+	};
+}
+/**
+* Create an Error status.
+*/
+function fetchStatusError(error) {
+	return {
+		type: "Error",
+		error
+	};
+}
+/**
+* Create a Timeout status.
+*/
+function fetchStatusTimeout() {
+	return { type: "Timeout" };
+}
+/**
+* Direction of the operation (get or put).
+*
+* Port of `enum Direction` from cmd/parallel.rs.
+*/
+let Direction = /* @__PURE__ */ function(Direction) {
+	/** Downloading from storage */
+	Direction["Get"] = "Get";
+	/** Uploading to storage */
+	Direction["Put"] = "Put";
+	return Direction;
+}({});
+/**
+* Get the emoji for a direction.
+*
+* Port of `Direction::emoji()` from cmd/parallel.rs.
+*/
+function directionEmoji(direction) {
+	switch (direction) {
+		case "Get": return "⬇️";
+		case "Put": return "⬆️";
+	}
+}
+/**
+* Default timeout in seconds (10 minutes).
+*/
+const DEFAULT_TIMEOUT_SECONDS = 600;
+/**
+* Create a config with the specified timeout.
+*/
+function parallelFetchConfigWithTimeout(timeoutSeconds) {
+	return { timeoutSeconds };
+}
+/**
+* Result of collecting responses from multiple participants.
+*
+* Port of `struct CollectionResult` from cmd/parallel.rs.
+*/
+var CollectionResult = class {
+	/** Successful responses as [XID, T] tuples */
+	successes;
+	/** Participants who explicitly rejected as [XID, reason] tuples */
+	rejections;
+	/** Participants with network/parsing errors as [XID, error] tuples */
+	errors;
+	/** Participants who timed out */
+	timeouts;
+	constructor() {
+		this.successes = [];
+		this.rejections = [];
+		this.errors = [];
+		this.timeouts = [];
+	}
+	/**
+	* Check if enough responses were received to proceed.
+	*
+	* Port of `CollectionResult::can_proceed()` from cmd/parallel.rs.
+	*/
+	canProceed(minRequired) {
+		return this.successes.length >= minRequired;
+	}
+	/**
+	* Total number of participants.
+	*
+	* Port of `CollectionResult::total()` from cmd/parallel.rs.
+	*/
+	total() {
+		return this.successes.length + this.rejections.length + this.errors.length + this.timeouts.length;
+	}
+	/**
+	* Check if all responses succeeded.
+	*
+	* Port of `CollectionResult::all_succeeded()` from cmd/parallel.rs.
+	*/
+	allSucceeded() {
+		return this.rejections.length === 0 && this.errors.length === 0 && this.timeouts.length === 0;
+	}
+};
+/**
+* Create an empty collection result.
+*/
+function emptyCollectionResult() {
+	return new CollectionResult();
+}
+/**
+* Helper to build request tuples from pending requests and registry.
+*
+* Port of `build_fetch_requests()` from cmd/parallel.rs.
+*/
+function buildFetchRequests(pending, getName) {
+	const requests = [];
+	for (const [xid, arid] of pending) {
+		const name = getName(xid);
+		requests.push([
+			xid,
+			arid,
+			name
+		]);
+	}
+	return requests;
+}
+/**
+* Simple progress output for non-interactive terminals.
+*/
+function logProgress(direction, name, status, message) {
+	const emoji = directionEmoji(direction);
+	switch (status) {
+		case "success":
+			console.error(`${emoji}  ✅ ${name}`);
+			break;
+		case "error":
+			console.error(`${emoji}  ❌ ${name}: ${message ?? "Error"}`);
+			break;
+		case "timeout":
+			console.error(`${emoji}  ❌ ${name}: Timeout`);
+			break;
+	}
+}
+/**
+* Fetch messages from multiple ARIDs in parallel.
+*
+* Port of `parallel_fetch()` from cmd/parallel.rs.
+*/
+async function parallelFetch(client, requests, validate, config) {
+	const result = new CollectionResult();
+	const timeoutSeconds = config.timeoutSeconds ?? 600;
+	if (config.verbose === true) console.error(`Waiting for ${requests.length} responses...`);
+	const promises = requests.map(async ([xid, arid, name]) => {
+		try {
+			const envelope = await client.get(arid, timeoutSeconds);
+			if (!envelope) {
+				result.timeouts.push(xid);
+				if (config.verbose === true) logProgress("Get", name, "timeout");
+				return;
+			}
+			const parsed = validate(envelope, xid);
+			if (parsed !== null && typeof parsed === "object" && "rejected" in parsed) {
+				result.rejections.push([xid, parsed.rejected]);
+				if (config.verbose === true) logProgress("Get", name, "error", parsed.rejected);
+			} else {
+				result.successes.push([xid, parsed]);
+				if (config.verbose === true) logProgress("Get", name, "success");
+			}
+		} catch (error) {
+			const errorMessage = error instanceof Error ? error.message : String(error);
+			if (errorMessage.includes("Timeout") || errorMessage.includes("timeout")) {
+				result.timeouts.push(xid);
+				if (config.verbose === true) logProgress("Get", name, "timeout");
+			} else {
+				result.errors.push([xid, `${name}: ${errorMessage}`]);
+				if (config.verbose === true) logProgress("Get", name, "error", errorMessage);
+			}
+		}
+	});
+	await Promise.all(promises);
+	if (config.verbose === true) {
+		console.error(`Collected ${result.successes.length} responses`);
+		if (result.rejections.length > 0) console.error(`  ${result.rejections.length} rejections`);
+		if (result.errors.length > 0) console.error(`  ${result.errors.length} errors`);
+		if (result.timeouts.length > 0) console.error(`  ${result.timeouts.length} timeouts`);
+	}
+	return result;
+}
+/**
+* Send messages to multiple ARIDs in parallel.
+*
+* Port of `parallel_send()` from cmd/parallel.rs.
+*/
+async function parallelSend(client, messages, verbose) {
+	const results = [];
+	if (verbose === true) console.error(`Sending to ${messages.length} participants...`);
+	const promises = messages.map(async ([xid, arid, envelope, name]) => {
+		try {
+			await client.put(arid, envelope);
+			results.push([xid, null]);
+			if (verbose === true) logProgress("Put", name, "success");
+		} catch (error) {
+			const err = error instanceof Error ? error : new Error(String(error));
+			results.push([xid, err]);
+			if (verbose === true) logProgress("Put", name, "error", err.message);
+		}
+	});
+	await Promise.all(promises);
+	if (verbose === true) {
+		const successes = results.filter(([_, err]) => err === null).length;
+		const failures = results.length - successes;
+		console.error(`Sent ${successes} messages`);
+		if (failures > 0) console.error(`  ${failures} failed`);
+	}
+	return results;
+}
+//#endregion
+export { directionEmoji as a, fetchStatusPending as c, fetchStatusTimeout as d, parallelFetch as f, buildFetchRequests as i, fetchStatusRejected as l, parallelSend as m, DEFAULT_TIMEOUT_SECONDS as n, emptyCollectionResult as o, parallelFetchConfigWithTimeout as p, Direction as r, fetchStatusError as s, CollectionResult as t, fetchStatusSuccess as u };
+
+//# sourceMappingURL=parallel-D6zc6VW4.mjs.map

package/dist/parallel-D6zc6VW4.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"parallel-D6zc6VW4.mjs","names":[],"sources":["../src/cmd/parallel.ts"],"sourcesContent":["/**\n * Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n *\n *\n * Parallel fetch and send utilities for coordinator commands.\n *\n * This module provides utilities for fetching responses from multiple\n * participants in parallel with progress display.\n *\n * Port of cmd/parallel.rs from frost-hubert-rust.\n *\n * @module\n */\n\nimport { type ARID, type XID } from \"@bcts/components\";\nimport { type Envelope } from \"@bcts/envelope\";\n\nimport { type StorageClient } from \"./storage.js\";\n\n/**\n * Status of a participant's response fetch.\n *\n * Port of `enum FetchStatus` from cmd/parallel.rs.\n */\nexport type FetchStatus =\n  | { type: \"Pending\" }\n  | { type: \"Success\"; envelope: Envelope }\n  | { type: \"Rejected\"; reason: string }\n  | { type: \"Error\"; error: string }\n  | { type: \"Timeout\" };\n\n/**\n * Create a Pending status.\n */\nexport function fetchStatusPending(): FetchStatus {\n  return { type: \"Pending\" };\n}\n\n/**\n * Create a Success status.\n */\nexport function fetchStatusSuccess(envelope: Envelope): FetchStatus {\n  return { type: \"Success\", envelope };\n}\n\n/**\n * Create a Rejected status.\n */\nexport function fetchStatusRejected(reason: string): FetchStatus {\n  return { type: \"Rejected\", reason };\n}\n\n/**\n * Create an Error status.\n */\nexport function fetchStatusError(error: string): FetchStatus {\n  return { type: \"Error\", error };\n}\n\n/**\n * Create a Timeout status.\n */\nexport function fetchStatusTimeout(): FetchStatus {\n  return { type: \"Timeout\" };\n}\n\n/**\n * Direction of the operation (get or put).\n *\n * Port of `enum Direction` from cmd/parallel.rs.\n */\nexport enum Direction {\n  /** Downloading from storage */\n  Get = \"Get\",\n  /** Uploading to storage */\n  Put = \"Put\",\n}\n\n/**\n * Get the emoji for a direction.\n *\n * Port of `Direction::emoji()` from cmd/parallel.rs.\n */\nexport function directionEmoji(direction: Direction): string {\n  switch (direction) {\n    case Direction.Get:\n      return \"⬇️\";\n    case Direction.Put:\n      return \"⬆️\";\n  }\n}\n\n/**\n * Configuration for parallel fetch operations.\n *\n * Port of `struct ParallelFetchConfig` from cmd/parallel.rs.\n */\nexport interface ParallelFetchConfig {\n  /** Maximum time to wait for all responses (in seconds) */\n  timeoutSeconds?: number | undefined;\n  /** Whether to show verbose output */\n  verbose?: boolean | undefined;\n}\n\n/**\n * Default timeout in seconds (10 minutes).\n */\nexport const DEFAULT_TIMEOUT_SECONDS = 600;\n\n/**\n * Create a config with the specified timeout.\n */\nexport function parallelFetchConfigWithTimeout(timeoutSeconds?: number): ParallelFetchConfig {\n  return { timeoutSeconds };\n}\n\n/**\n * Result of collecting responses from multiple participants.\n *\n * Port of `struct CollectionResult` from cmd/parallel.rs.\n */\nexport class CollectionResult<T> {\n  /** Successful responses as [XID, T] tuples */\n  successes: [XID, T][];\n  /** Participants who explicitly rejected as [XID, reason] tuples */\n  rejections: [XID, string][];\n  /** Participants with network/parsing errors as [XID, error] tuples */\n  errors: [XID, string][];\n  /** Participants who timed out */\n  timeouts: XID[];\n\n  constructor() {\n    this.successes = [];\n    this.rejections = [];\n    this.errors = [];\n    this.timeouts = [];\n  }\n\n  /**\n   * Check if enough responses were received to proceed.\n   *\n   * Port of `CollectionResult::can_proceed()` from cmd/parallel.rs.\n   */\n  canProceed(minRequired: number): boolean {\n    return this.successes.length >= minRequired;\n  }\n\n  /**\n   * Total number of participants.\n   *\n   * Port of `CollectionResult::total()` from cmd/parallel.rs.\n   */\n  total(): number {\n    return (\n      this.successes.length + this.rejections.length + this.errors.length + this.timeouts.length\n    );\n  }\n\n  /**\n   * Check if all responses succeeded.\n   *\n   * Port of `CollectionResult::all_succeeded()` from cmd/parallel.rs.\n   */\n  allSucceeded(): boolean {\n    return this.rejections.length === 0 && this.errors.length === 0 && this.timeouts.length === 0;\n  }\n}\n\n/**\n * Create an empty collection result.\n */\nexport function emptyCollectionResult<T>(): CollectionResult<T> {\n  return new CollectionResult<T>();\n}\n\n/**\n * Helper to build request tuples from pending requests and registry.\n *\n * Port of `build_fetch_requests()` from cmd/parallel.rs.\n */\nexport function buildFetchRequests(\n  pending: Iterable<[XID, ARID]>,\n  getName: (xid: XID) => string,\n): [XID, ARID, string][] {\n  const requests: [XID, ARID, string][] = [];\n  for (const [xid, arid] of pending) {\n    const name = getName(xid);\n    requests.push([xid, arid, name]);\n  }\n  return requests;\n}\n\n/**\n * Simple progress output for non-interactive terminals.\n */\nfunction logProgress(\n  direction: Direction,\n  name: string,\n  status: \"success\" | \"error\" | \"timeout\",\n  message?: string,\n): void {\n  const emoji = directionEmoji(direction);\n  switch (status) {\n    case \"success\":\n      console.error(`${emoji}  ✅ ${name}`);\n      break;\n    case \"error\":\n      console.error(`${emoji}  ❌ ${name}: ${message ?? \"Error\"}`);\n      break;\n    case \"timeout\":\n      console.error(`${emoji}  ❌ ${name}: Timeout`);\n      break;\n  }\n}\n\n/**\n * Fetch messages from multiple ARIDs in parallel.\n *\n * Port of `parallel_fetch()` from cmd/parallel.rs.\n */\nexport async function parallelFetch<T>(\n  client: StorageClient,\n  requests: [XID, ARID, string][],\n  validate: (envelope: Envelope, xid: XID) => T | { rejected: string },\n  config: ParallelFetchConfig,\n): Promise<CollectionResult<T>> {\n  const result = new CollectionResult<T>();\n  const timeoutSeconds = config.timeoutSeconds ?? DEFAULT_TIMEOUT_SECONDS;\n\n  if (config.verbose === true) {\n    console.error(`Waiting for ${requests.length} responses...`);\n  }\n\n  const promises = requests.map(async ([xid, arid, name]) => {\n    try {\n      const envelope = await client.get(arid, timeoutSeconds);\n\n      if (!envelope) {\n        result.timeouts.push(xid);\n        if (config.verbose === true) {\n          logProgress(Direction.Get, name, \"timeout\");\n        }\n        return;\n      }\n\n      const parsed = validate(envelope, xid);\n\n      if (parsed !== null && typeof parsed === \"object\" && \"rejected\" in parsed) {\n        result.rejections.push([xid, parsed.rejected]);\n        if (config.verbose === true) {\n          logProgress(Direction.Get, name, \"error\", parsed.rejected);\n        }\n      } else {\n        result.successes.push([xid, parsed]);\n        if (config.verbose === true) {\n          logProgress(Direction.Get, name, \"success\");\n        }\n      }\n    } catch (error) {\n      const errorMessage = error instanceof Error ? error.message : String(error);\n      if (errorMessage.includes(\"Timeout\") || errorMessage.includes(\"timeout\")) {\n        result.timeouts.push(xid);\n        if (config.verbose === true) {\n          logProgress(Direction.Get, name, \"timeout\");\n        }\n      } else {\n        result.errors.push([xid, `${name}: ${errorMessage}`]);\n        if (config.verbose === true) {\n          logProgress(Direction.Get, name, \"error\", errorMessage);\n        }\n      }\n    }\n  });\n\n  await Promise.all(promises);\n\n  if (config.verbose === true) {\n    console.error(`Collected ${result.successes.length} responses`);\n    if (result.rejections.length > 0) {\n      console.error(`  ${result.rejections.length} rejections`);\n    }\n    if (result.errors.length > 0) {\n      console.error(`  ${result.errors.length} errors`);\n    }\n    if (result.timeouts.length > 0) {\n      console.error(`  ${result.timeouts.length} timeouts`);\n    }\n  }\n\n  return result;\n}\n\n/**\n * Send messages to multiple ARIDs in parallel.\n *\n * Port of `parallel_send()` from cmd/parallel.rs.\n */\nexport async function parallelSend(\n  client: StorageClient,\n  messages: [XID, ARID, Envelope, string][],\n  verbose?: boolean,\n): Promise<[XID, Error | null][]> {\n  const results: [XID, Error | null][] = [];\n\n  if (verbose === true) {\n    console.error(`Sending to ${messages.length} participants...`);\n  }\n\n  const promises = messages.map(async ([xid, arid, envelope, name]) => {\n    try {\n      await client.put(arid, envelope);\n      results.push([xid, null]);\n      if (verbose === true) {\n        logProgress(Direction.Put, name, \"success\");\n      }\n    } catch (error) {\n      const err = error instanceof Error ? error : new Error(String(error));\n      results.push([xid, err]);\n      if (verbose === true) {\n        logProgress(Direction.Put, name, \"error\", err.message);\n      }\n    }\n  });\n\n  await Promise.all(promises);\n\n  if (verbose === true) {\n    const successes = results.filter(([_, err]) => err === null).length;\n    const failures = results.length - successes;\n    console.error(`Sent ${successes} messages`);\n    if (failures > 0) {\n      console.error(`  ${failures} failed`);\n    }\n  }\n\n  return results;\n}\n"],"mappings":";;;;AAmCA,SAAgB,qBAAkC;AAChD,QAAO,EAAE,MAAM,WAAW;;;;;AAM5B,SAAgB,mBAAmB,UAAiC;AAClE,QAAO;EAAE,MAAM;EAAW;EAAU;;;;;AAMtC,SAAgB,oBAAoB,QAA6B;AAC/D,QAAO;EAAE,MAAM;EAAY;EAAQ;;;;;AAMrC,SAAgB,iBAAiB,OAA4B;AAC3D,QAAO;EAAE,MAAM;EAAS;EAAO;;;;;AAMjC,SAAgB,qBAAkC;AAChD,QAAO,EAAE,MAAM,WAAW;;;;;;;AAQ5B,IAAY,YAAL,yBAAA,WAAA;;AAEL,WAAA,SAAA;;AAEA,WAAA,SAAA;;KACD;;;;;;AAOD,SAAgB,eAAe,WAA8B;AAC3D,SAAQ,WAAR;EACE,KAAA,MACE,QAAO;EACT,KAAA,MACE,QAAO;;;;;;AAmBb,MAAa,0BAA0B;;;;AAKvC,SAAgB,+BAA+B,gBAA8C;AAC3F,QAAO,EAAE,gBAAgB;;;;;;;AAQ3B,IAAa,mBAAb,MAAiC;;CAE/B;;CAEA;;CAEA;;CAEA;CAEA,cAAc;AACZ,OAAK,YAAY,EAAE;AACnB,OAAK,aAAa,EAAE;AACpB,OAAK,SAAS,EAAE;AAChB,OAAK,WAAW,EAAE;;;;;;;CAQpB,WAAW,aAA8B;AACvC,SAAO,KAAK,UAAU,UAAU;;;;;;;CAQlC,QAAgB;AACd,SACE,KAAK,UAAU,SAAS,KAAK,WAAW,SAAS,KAAK,OAAO,SAAS,KAAK,SAAS;;;;;;;CASxF,eAAwB;AACtB,SAAO,KAAK,WAAW,WAAW,KAAK,KAAK,OAAO,WAAW,KAAK,KAAK,SAAS,WAAW;;;;;;AAOhG,SAAgB,wBAAgD;AAC9D,QAAO,IAAI,kBAAqB;;;;;;;AAQlC,SAAgB,mBACd,SACA,SACuB;CACvB,MAAM,WAAkC,EAAE;AAC1C,MAAK,MAAM,CAAC,KAAK,SAAS,SAAS;EACjC,MAAM,OAAO,QAAQ,IAAI;AACzB,WAAS,KAAK;GAAC;GAAK;GAAM;GAAK,CAAC;;AAElC,QAAO;;;;;AAMT,SAAS,YACP,WACA,MACA,QACA,SACM;CACN,MAAM,QAAQ,eAAe,UAAU;AACvC,SAAQ,QAAR;EACE,KAAK;AACH,WAAQ,MAAM,GAAG,MAAM,MAAM,OAAO;AACpC;EACF,KAAK;AACH,WAAQ,MAAM,GAAG,MAAM,MAAM,KAAK,IAAI,WAAW,UAAU;AAC3D;EACF,KAAK;AACH,WAAQ,MAAM,GAAG,MAAM,MAAM,KAAK,WAAW;AAC7C;;;;;;;;AASN,eAAsB,cACpB,QACA,UACA,UACA,QAC8B;CAC9B,MAAM,SAAS,IAAI,kBAAqB;CACxC,MAAM,iBAAiB,OAAO,kBAAA;AAE9B,KAAI,OAAO,YAAY,KACrB,SAAQ,MAAM,eAAe,SAAS,OAAO,eAAe;CAG9D,MAAM,WAAW,SAAS,IAAI,OAAO,CAAC,KAAK,MAAM,UAAU;AACzD,MAAI;GACF,MAAM,WAAW,MAAM,OAAO,IAAI,MAAM,eAAe;AAEvD,OAAI,CAAC,UAAU;AACb,WAAO,SAAS,KAAK,IAAI;AACzB,QAAI,OAAO,YAAY,KACrB,aAAA,OAA2B,MAAM,UAAU;AAE7C;;GAGF,MAAM,SAAS,SAAS,UAAU,IAAI;AAEtC,OAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,cAAc,QAAQ;AACzE,WAAO,WAAW,KAAK,CAAC,KAAK,OAAO,SAAS,CAAC;AAC9C,QAAI,OAAO,YAAY,KACrB,aAAA,OAA2B,MAAM,SAAS,OAAO,SAAS;UAEvD;AACL,WAAO,UAAU,KAAK,CAAC,KAAK,OAAO,CAAC;AACpC,QAAI,OAAO,YAAY,KACrB,aAAA,OAA2B,MAAM,UAAU;;WAGxC,OAAO;GACd,MAAM,eAAe,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM;AAC3E,OAAI,aAAa,SAAS,UAAU,IAAI,aAAa,SAAS,UAAU,EAAE;AACxE,WAAO,SAAS,KAAK,IAAI;AACzB,QAAI,OAAO,YAAY,KACrB,aAAA,OAA2B,MAAM,UAAU;UAExC;AACL,WAAO,OAAO,KAAK,CAAC,KAAK,GAAG,KAAK,IAAI,eAAe,CAAC;AACrD,QAAI,OAAO,YAAY,KACrB,aAAA,OAA2B,MAAM,SAAS,aAAa;;;GAI7D;AAEF,OAAM,QAAQ,IAAI,SAAS;AAE3B,KAAI,OAAO,YAAY,MAAM;AAC3B,UAAQ,MAAM,aAAa,OAAO,UAAU,OAAO,YAAY;AAC/D,MAAI,OAAO,WAAW,SAAS,EAC7B,SAAQ,MAAM,KAAK,OAAO,WAAW,OAAO,aAAa;AAE3D,MAAI,OAAO,OAAO,SAAS,EACzB,SAAQ,MAAM,KAAK,OAAO,OAAO,OAAO,SAAS;AAEnD,MAAI,OAAO,SAAS,SAAS,EAC3B,SAAQ,MAAM,KAAK,OAAO,SAAS,OAAO,WAAW;;AAIzD,QAAO;;;;;;;AAQT,eAAsB,aACpB,QACA,UACA,SACgC;CAChC,MAAM,UAAiC,EAAE;AAEzC,KAAI,YAAY,KACd,SAAQ,MAAM,cAAc,SAAS,OAAO,kBAAkB;CAGhE,MAAM,WAAW,SAAS,IAAI,OAAO,CAAC,KAAK,MAAM,UAAU,UAAU;AACnE,MAAI;AACF,SAAM,OAAO,IAAI,MAAM,SAAS;AAChC,WAAQ,KAAK,CAAC,KAAK,KAAK,CAAC;AACzB,OAAI,YAAY,KACd,aAAA,OAA2B,MAAM,UAAU;WAEtC,OAAO;GACd,MAAM,MAAM,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,MAAM,CAAC;AACrE,WAAQ,KAAK,CAAC,KAAK,IAAI,CAAC;AACxB,OAAI,YAAY,KACd,aAAA,OAA2B,MAAM,SAAS,IAAI,QAAQ;;GAG1D;AAEF,OAAM,QAAQ,IAAI,SAAS;AAE3B,KAAI,YAAY,MAAM;EACpB,MAAM,YAAY,QAAQ,QAAQ,CAAC,GAAG,SAAS,QAAQ,KAAK,CAAC;EAC7D,MAAM,WAAW,QAAQ,SAAS;AAClC,UAAQ,MAAM,QAAQ,UAAU,WAAW;AAC3C,MAAI,WAAW,EACb,SAAQ,MAAM,KAAK,SAAS,SAAS;;AAIzC,QAAO"}

package/dist/proposed-participant-Dm1Eq6mX.cjs

@@ -0,0 +1,141 @@
+require("./chunk-CZWwpsFl.cjs");
+let _bcts_envelope = require("@bcts/envelope");
+let _bcts_xid = require("@bcts/xid");
+let _bcts_uniform_resources = require("@bcts/uniform-resources");
+//#region src/dkg/proposed-participant.ts
+/**
+* A proposed participant in a DKG session.
+*
+* Port of `struct DkgProposedParticipant` from proposed_participant.rs lines 8-13.
+*/
+var DkgProposedParticipant = class DkgProposedParticipant {
+	_urString;
+	_envelope;
+	_document;
+	_responseArid;
+	constructor(urString, envelope, document, responseArid) {
+		this._urString = urString;
+		this._envelope = envelope;
+		this._document = document;
+		this._responseArid = responseArid;
+	}
+	/**
+	* Create a new DkgProposedParticipant from a UR string and response ARID.
+	*
+	* Port of `DkgProposedParticipant::new()` from proposed_participant.rs lines 22-26.
+	*/
+	static create(urString, responseArid) {
+		const [envelope, document] = parseXidEnvelope(urString);
+		return new DkgProposedParticipant(urString, envelope, document, responseArid);
+	}
+	/**
+	* Get the XID of this participant.
+	*
+	* Port of `DkgProposedParticipant::xid()` from proposed_participant.rs line 28.
+	*/
+	xid() {
+		return this._document.xid();
+	}
+	/**
+	* Get the XID document of this participant.
+	*
+	* Port of `DkgProposedParticipant::xid_document()` from proposed_participant.rs line 30.
+	*/
+	xidDocument() {
+		return this._document;
+	}
+	/**
+	* Get the UR string of the XID document.
+	*
+	* Port of `DkgProposedParticipant::xid_document_ur()` from proposed_participant.rs line 32.
+	*/
+	xidDocumentUr() {
+		return this._urString;
+	}
+	/**
+	* Get the envelope containing the XID document.
+	*
+	* Port of `DkgProposedParticipant::xid_document_envelope()` from proposed_participant.rs line 34.
+	*/
+	xidDocumentEnvelope() {
+		return this._envelope;
+	}
+	/**
+	* Get the response ARID for this participant.
+	*
+	* Port of `DkgProposedParticipant::response_arid()` from proposed_participant.rs line 36.
+	*/
+	responseArid() {
+		return this._responseArid;
+	}
+	/**
+	* Compare participants by XID for sorting.
+	*
+	* Mirrors Rust `PartialOrd::partial_cmp` which uses
+	* `self.xid().cmp(&other.xid())` — i.e. the underlying 32-byte XID
+	* data is compared lexicographically (`Vec<u8>` ordering). The
+	* earlier port used `xid.toString().localeCompare(...)`, which (a)
+	* compares the UR-encoded base32-ish string, not the bytes, and (b)
+	* is locale-aware. Sorting on UR strings differs from the byte
+	* order whenever the underlying bytes contain values ≥ 0x80, so
+	* Rust and TS would assign different FROST identifiers to the same
+	* participant set — producing different secret shares.
+	*/
+	compareTo(other) {
+		return compareXidBytes(this.xid().toData(), other.xid().toData());
+	}
+};
+/**
+* Lexicographic byte compare matching Rust's `Vec<u8>::cmp` /
+* `XID::cmp`. Exported so the cmd-tree call sites (round1 / finalize)
+* can use the same comparator when they sort deduplicated XID lists.
+*
+* `XID` is exactly 32 bytes so this only ever compares two equal-length
+* inputs; the length-tiebreak branch mirrors the generic `Ord` impl on
+* `Vec<u8>` and is included for correctness if ever applied to other
+* byte sequences.
+*
+* @internal
+*/
+function compareXidBytes(a, b) {
+	const minLen = Math.min(a.length, b.length);
+	for (let i = 0; i < minLen; i++) if (a[i] !== b[i]) return a[i] < b[i] ? -1 : 1;
+	if (a.length !== b.length) return a.length < b.length ? -1 : 1;
+	return 0;
+}
+/**
+* Parse a XID envelope from a UR string.
+*
+* Port of `parse_xid_envelope()` from proposed_participant.rs lines 39-60.
+*/
+function parseXidEnvelope(input) {
+	const trimmed = input.trim();
+	if (trimmed.length === 0) throw new Error("XID document is required");
+	const ur = _bcts_uniform_resources.UR.fromURString(trimmed);
+	const urType = ur.urTypeStr();
+	if (urType !== "xid" && urType !== "envelope") throw new Error(`Expected a ur:xid document, found ur:${urType}`);
+	const envelopeCbor = ur.cbor();
+	let envelope;
+	try {
+		envelope = _bcts_envelope.Envelope.fromTaggedCbor(envelopeCbor);
+	} catch {
+		envelope = _bcts_envelope.Envelope.fromUntaggedCbor(envelopeCbor);
+	}
+	const document = _bcts_xid.XIDDocument.fromEnvelope(envelope, void 0, _bcts_xid.XIDVerifySignature.Inception);
+	return [envelope, document];
+}
+//#endregion
+Object.defineProperty(exports, "DkgProposedParticipant", {
+	enumerable: true,
+	get: function() {
+		return DkgProposedParticipant;
+	}
+});
+Object.defineProperty(exports, "compareXidBytes", {
+	enumerable: true,
+	get: function() {
+		return compareXidBytes;
+	}
+});
+
+//# sourceMappingURL=proposed-participant-Dm1Eq6mX.cjs.map

package/dist/proposed-participant-Dm1Eq6mX.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"proposed-participant-Dm1Eq6mX.cjs","names":["UR","Envelope","XIDDocument","XIDVerifySignature"],"sources":["../src/dkg/proposed-participant.ts"],"sourcesContent":["/**\n * Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n *\n *\n * DKG Proposed Participant.\n *\n * Port of dkg/proposed_participant.rs from frost-hubert-rust.\n *\n * @module\n */\n\nimport { type ARID, type XID } from \"@bcts/components\";\nimport { Envelope } from \"@bcts/envelope\";\nimport { UR } from \"@bcts/uniform-resources\";\nimport { XIDDocument, XIDVerifySignature } from \"@bcts/xid\";\n\n/**\n * A proposed participant in a DKG session.\n *\n * Port of `struct DkgProposedParticipant` from proposed_participant.rs lines 8-13.\n */\nexport class DkgProposedParticipant {\n  private readonly _urString: string;\n  private readonly _envelope: Envelope;\n  private readonly _document: XIDDocument;\n  private readonly _responseArid: ARID;\n\n  private constructor(\n    urString: string,\n    envelope: Envelope,\n    document: XIDDocument,\n    responseArid: ARID,\n  ) {\n    this._urString = urString;\n    this._envelope = envelope;\n    this._document = document;\n    this._responseArid = responseArid;\n  }\n\n  /**\n   * Create a new DkgProposedParticipant from a UR string and response ARID.\n   *\n   * Port of `DkgProposedParticipant::new()` from proposed_participant.rs lines 22-26.\n   */\n  static create(urString: string, responseArid: ARID): DkgProposedParticipant {\n    const [envelope, document] = parseXidEnvelope(urString);\n    return new DkgProposedParticipant(urString, envelope, document, responseArid);\n  }\n\n  /**\n   * Get the XID of this participant.\n   *\n   * Port of `DkgProposedParticipant::xid()` from proposed_participant.rs line 28.\n   */\n  xid(): XID {\n    return this._document.xid();\n  }\n\n  /**\n   * Get the XID document of this participant.\n   *\n   * Port of `DkgProposedParticipant::xid_document()` from proposed_participant.rs line 30.\n   */\n  xidDocument(): XIDDocument {\n    return this._document;\n  }\n\n  /**\n   * Get the UR string of the XID document.\n   *\n   * Port of `DkgProposedParticipant::xid_document_ur()` from proposed_participant.rs line 32.\n   */\n  xidDocumentUr(): string {\n    return this._urString;\n  }\n\n  /**\n   * Get the envelope containing the XID document.\n   *\n   * Port of `DkgProposedParticipant::xid_document_envelope()` from proposed_participant.rs line 34.\n   */\n  xidDocumentEnvelope(): Envelope {\n    return this._envelope;\n  }\n\n  /**\n   * Get the response ARID for this participant.\n   *\n   * Port of `DkgProposedParticipant::response_arid()` from proposed_participant.rs line 36.\n   */\n  responseArid(): ARID {\n    return this._responseArid;\n  }\n\n  /**\n   * Compare participants by XID for sorting.\n   *\n   * Mirrors Rust `PartialOrd::partial_cmp` which uses\n   * `self.xid().cmp(&other.xid())` — i.e. the underlying 32-byte XID\n   * data is compared lexicographically (`Vec<u8>` ordering). The\n   * earlier port used `xid.toString().localeCompare(...)`, which (a)\n   * compares the UR-encoded base32-ish string, not the bytes, and (b)\n   * is locale-aware. Sorting on UR strings differs from the byte\n   * order whenever the underlying bytes contain values ≥ 0x80, so\n   * Rust and TS would assign different FROST identifiers to the same\n   * participant set — producing different secret shares.\n   */\n  compareTo(other: DkgProposedParticipant): number {\n    return compareXidBytes(this.xid().toData(), other.xid().toData());\n  }\n}\n\n/**\n * Lexicographic byte compare matching Rust's `Vec<u8>::cmp` /\n * `XID::cmp`. Exported so the cmd-tree call sites (round1 / finalize)\n * can use the same comparator when they sort deduplicated XID lists.\n *\n * `XID` is exactly 32 bytes so this only ever compares two equal-length\n * inputs; the length-tiebreak branch mirrors the generic `Ord` impl on\n * `Vec<u8>` and is included for correctness if ever applied to other\n * byte sequences.\n *\n * @internal\n */\nexport function compareXidBytes(a: Uint8Array, b: Uint8Array): number {\n  const minLen = Math.min(a.length, b.length);\n  for (let i = 0; i < minLen; i++) {\n    if (a[i] !== b[i]) return a[i] < b[i] ? -1 : 1;\n  }\n  if (a.length !== b.length) return a.length < b.length ? -1 : 1;\n  return 0;\n}\n\n/**\n * Parse a XID envelope from a UR string.\n *\n * Port of `parse_xid_envelope()` from proposed_participant.rs lines 39-60.\n */\nfunction parseXidEnvelope(input: string): [Envelope, XIDDocument] {\n  const trimmed = input.trim();\n  if (trimmed.length === 0) {\n    throw new Error(\"XID document is required\");\n  }\n\n  const ur = UR.fromURString(trimmed);\n  const urType = ur.urTypeStr();\n  if (urType !== \"xid\" && urType !== \"envelope\") {\n    throw new Error(`Expected a ur:xid document, found ur:${urType}`);\n  }\n\n  const envelopeCbor = ur.cbor();\n  // Try tagged CBOR first, then untagged\n  let envelope: Envelope;\n  try {\n    envelope = Envelope.fromTaggedCbor(envelopeCbor);\n  } catch {\n    envelope = Envelope.fromUntaggedCbor(envelopeCbor);\n  }\n\n  const document = XIDDocument.fromEnvelope(envelope, undefined, XIDVerifySignature.Inception);\n\n  return [envelope, document];\n}\n"],"mappings":";;;;;;;;;;AAsBA,IAAa,yBAAb,MAAa,uBAAuB;CAClC;CACA;CACA;CACA;CAEA,YACE,UACA,UACA,UACA,cACA;AACA,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,gBAAgB;;;;;;;CAQvB,OAAO,OAAO,UAAkB,cAA4C;EAC1E,MAAM,CAAC,UAAU,YAAY,iBAAiB,SAAS;AACvD,SAAO,IAAI,uBAAuB,UAAU,UAAU,UAAU,aAAa;;;;;;;CAQ/E,MAAW;AACT,SAAO,KAAK,UAAU,KAAK;;;;;;;CAQ7B,cAA2B;AACzB,SAAO,KAAK;;;;;;;CAQd,gBAAwB;AACtB,SAAO,KAAK;;;;;;;CAQd,sBAAgC;AAC9B,SAAO,KAAK;;;;;;;CAQd,eAAqB;AACnB,SAAO,KAAK;;;;;;;;;;;;;;;CAgBd,UAAU,OAAuC;AAC/C,SAAO,gBAAgB,KAAK,KAAK,CAAC,QAAQ,EAAE,MAAM,KAAK,CAAC,QAAQ,CAAC;;;;;;;;;;;;;;;AAgBrE,SAAgB,gBAAgB,GAAe,GAAuB;CACpE,MAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAO;AAC3C,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,KAAI,EAAE,OAAO,EAAE,GAAI,QAAO,EAAE,KAAK,EAAE,KAAK,KAAK;AAE/C,KAAI,EAAE,WAAW,EAAE,OAAQ,QAAO,EAAE,SAAS,EAAE,SAAS,KAAK;AAC7D,QAAO;;;;;;;AAQT,SAAS,iBAAiB,OAAwC;CAChE,MAAM,UAAU,MAAM,MAAM;AAC5B,KAAI,QAAQ,WAAW,EACrB,OAAM,IAAI,MAAM,2BAA2B;CAG7C,MAAM,KAAKA,wBAAAA,GAAG,aAAa,QAAQ;CACnC,MAAM,SAAS,GAAG,WAAW;AAC7B,KAAI,WAAW,SAAS,WAAW,WACjC,OAAM,IAAI,MAAM,wCAAwC,SAAS;CAGnE,MAAM,eAAe,GAAG,MAAM;CAE9B,IAAI;AACJ,KAAI;AACF,aAAWC,eAAAA,SAAS,eAAe,aAAa;SAC1C;AACN,aAAWA,eAAAA,SAAS,iBAAiB,aAAa;;CAGpD,MAAM,WAAWC,UAAAA,YAAY,aAAa,UAAU,KAAA,GAAWC,UAAAA,mBAAmB,UAAU;AAE5F,QAAO,CAAC,UAAU,SAAS"}

package/dist/proposed-participant-cWM7iUrO.mjs

@@ -0,0 +1,129 @@
+import { Envelope } from "@bcts/envelope";
+import { XIDDocument, XIDVerifySignature } from "@bcts/xid";
+import { UR } from "@bcts/uniform-resources";
+//#region src/dkg/proposed-participant.ts
+/**
+* A proposed participant in a DKG session.
+*
+* Port of `struct DkgProposedParticipant` from proposed_participant.rs lines 8-13.
+*/
+var DkgProposedParticipant = class DkgProposedParticipant {
+	_urString;
+	_envelope;
+	_document;
+	_responseArid;
+	constructor(urString, envelope, document, responseArid) {
+		this._urString = urString;
+		this._envelope = envelope;
+		this._document = document;
+		this._responseArid = responseArid;
+	}
+	/**
+	* Create a new DkgProposedParticipant from a UR string and response ARID.
+	*
+	* Port of `DkgProposedParticipant::new()` from proposed_participant.rs lines 22-26.
+	*/
+	static create(urString, responseArid) {
+		const [envelope, document] = parseXidEnvelope(urString);
+		return new DkgProposedParticipant(urString, envelope, document, responseArid);
+	}
+	/**
+	* Get the XID of this participant.
+	*
+	* Port of `DkgProposedParticipant::xid()` from proposed_participant.rs line 28.
+	*/
+	xid() {
+		return this._document.xid();
+	}
+	/**
+	* Get the XID document of this participant.
+	*
+	* Port of `DkgProposedParticipant::xid_document()` from proposed_participant.rs line 30.
+	*/
+	xidDocument() {
+		return this._document;
+	}
+	/**
+	* Get the UR string of the XID document.
+	*
+	* Port of `DkgProposedParticipant::xid_document_ur()` from proposed_participant.rs line 32.
+	*/
+	xidDocumentUr() {
+		return this._urString;
+	}
+	/**
+	* Get the envelope containing the XID document.
+	*
+	* Port of `DkgProposedParticipant::xid_document_envelope()` from proposed_participant.rs line 34.
+	*/
+	xidDocumentEnvelope() {
+		return this._envelope;
+	}
+	/**
+	* Get the response ARID for this participant.
+	*
+	* Port of `DkgProposedParticipant::response_arid()` from proposed_participant.rs line 36.
+	*/
+	responseArid() {
+		return this._responseArid;
+	}
+	/**
+	* Compare participants by XID for sorting.
+	*
+	* Mirrors Rust `PartialOrd::partial_cmp` which uses
+	* `self.xid().cmp(&other.xid())` — i.e. the underlying 32-byte XID
+	* data is compared lexicographically (`Vec<u8>` ordering). The
+	* earlier port used `xid.toString().localeCompare(...)`, which (a)
+	* compares the UR-encoded base32-ish string, not the bytes, and (b)
+	* is locale-aware. Sorting on UR strings differs from the byte
+	* order whenever the underlying bytes contain values ≥ 0x80, so
+	* Rust and TS would assign different FROST identifiers to the same
+	* participant set — producing different secret shares.
+	*/
+	compareTo(other) {
+		return compareXidBytes(this.xid().toData(), other.xid().toData());
+	}
+};
+/**
+* Lexicographic byte compare matching Rust's `Vec<u8>::cmp` /
+* `XID::cmp`. Exported so the cmd-tree call sites (round1 / finalize)
+* can use the same comparator when they sort deduplicated XID lists.
+*
+* `XID` is exactly 32 bytes so this only ever compares two equal-length
+* inputs; the length-tiebreak branch mirrors the generic `Ord` impl on
+* `Vec<u8>` and is included for correctness if ever applied to other
+* byte sequences.
+*
+* @internal
+*/
+function compareXidBytes(a, b) {
+	const minLen = Math.min(a.length, b.length);
+	for (let i = 0; i < minLen; i++) if (a[i] !== b[i]) return a[i] < b[i] ? -1 : 1;
+	if (a.length !== b.length) return a.length < b.length ? -1 : 1;
+	return 0;
+}
+/**
+* Parse a XID envelope from a UR string.
+*
+* Port of `parse_xid_envelope()` from proposed_participant.rs lines 39-60.
+*/
+function parseXidEnvelope(input) {
+	const trimmed = input.trim();
+	if (trimmed.length === 0) throw new Error("XID document is required");
+	const ur = UR.fromURString(trimmed);
+	const urType = ur.urTypeStr();
+	if (urType !== "xid" && urType !== "envelope") throw new Error(`Expected a ur:xid document, found ur:${urType}`);
+	const envelopeCbor = ur.cbor();
+	let envelope;
+	try {
+		envelope = Envelope.fromTaggedCbor(envelopeCbor);
+	} catch {
+		envelope = Envelope.fromUntaggedCbor(envelopeCbor);
+	}
+	const document = XIDDocument.fromEnvelope(envelope, void 0, XIDVerifySignature.Inception);
+	return [envelope, document];
+}
+//#endregion
+export { compareXidBytes as n, DkgProposedParticipant as t };
+
+//# sourceMappingURL=proposed-participant-cWM7iUrO.mjs.map

package/dist/proposed-participant-cWM7iUrO.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"proposed-participant-cWM7iUrO.mjs","names":[],"sources":["../src/dkg/proposed-participant.ts"],"sourcesContent":["/**\n * Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n *\n *\n * DKG Proposed Participant.\n *\n * Port of dkg/proposed_participant.rs from frost-hubert-rust.\n *\n * @module\n */\n\nimport { type ARID, type XID } from \"@bcts/components\";\nimport { Envelope } from \"@bcts/envelope\";\nimport { UR } from \"@bcts/uniform-resources\";\nimport { XIDDocument, XIDVerifySignature } from \"@bcts/xid\";\n\n/**\n * A proposed participant in a DKG session.\n *\n * Port of `struct DkgProposedParticipant` from proposed_participant.rs lines 8-13.\n */\nexport class DkgProposedParticipant {\n  private readonly _urString: string;\n  private readonly _envelope: Envelope;\n  private readonly _document: XIDDocument;\n  private readonly _responseArid: ARID;\n\n  private constructor(\n    urString: string,\n    envelope: Envelope,\n    document: XIDDocument,\n    responseArid: ARID,\n  ) {\n    this._urString = urString;\n    this._envelope = envelope;\n    this._document = document;\n    this._responseArid = responseArid;\n  }\n\n  /**\n   * Create a new DkgProposedParticipant from a UR string and response ARID.\n   *\n   * Port of `DkgProposedParticipant::new()` from proposed_participant.rs lines 22-26.\n   */\n  static create(urString: string, responseArid: ARID): DkgProposedParticipant {\n    const [envelope, document] = parseXidEnvelope(urString);\n    return new DkgProposedParticipant(urString, envelope, document, responseArid);\n  }\n\n  /**\n   * Get the XID of this participant.\n   *\n   * Port of `DkgProposedParticipant::xid()` from proposed_participant.rs line 28.\n   */\n  xid(): XID {\n    return this._document.xid();\n  }\n\n  /**\n   * Get the XID document of this participant.\n   *\n   * Port of `DkgProposedParticipant::xid_document()` from proposed_participant.rs line 30.\n   */\n  xidDocument(): XIDDocument {\n    return this._document;\n  }\n\n  /**\n   * Get the UR string of the XID document.\n   *\n   * Port of `DkgProposedParticipant::xid_document_ur()` from proposed_participant.rs line 32.\n   */\n  xidDocumentUr(): string {\n    return this._urString;\n  }\n\n  /**\n   * Get the envelope containing the XID document.\n   *\n   * Port of `DkgProposedParticipant::xid_document_envelope()` from proposed_participant.rs line 34.\n   */\n  xidDocumentEnvelope(): Envelope {\n    return this._envelope;\n  }\n\n  /**\n   * Get the response ARID for this participant.\n   *\n   * Port of `DkgProposedParticipant::response_arid()` from proposed_participant.rs line 36.\n   */\n  responseArid(): ARID {\n    return this._responseArid;\n  }\n\n  /**\n   * Compare participants by XID for sorting.\n   *\n   * Mirrors Rust `PartialOrd::partial_cmp` which uses\n   * `self.xid().cmp(&other.xid())` — i.e. the underlying 32-byte XID\n   * data is compared lexicographically (`Vec<u8>` ordering). The\n   * earlier port used `xid.toString().localeCompare(...)`, which (a)\n   * compares the UR-encoded base32-ish string, not the bytes, and (b)\n   * is locale-aware. Sorting on UR strings differs from the byte\n   * order whenever the underlying bytes contain values ≥ 0x80, so\n   * Rust and TS would assign different FROST identifiers to the same\n   * participant set — producing different secret shares.\n   */\n  compareTo(other: DkgProposedParticipant): number {\n    return compareXidBytes(this.xid().toData(), other.xid().toData());\n  }\n}\n\n/**\n * Lexicographic byte compare matching Rust's `Vec<u8>::cmp` /\n * `XID::cmp`. Exported so the cmd-tree call sites (round1 / finalize)\n * can use the same comparator when they sort deduplicated XID lists.\n *\n * `XID` is exactly 32 bytes so this only ever compares two equal-length\n * inputs; the length-tiebreak branch mirrors the generic `Ord` impl on\n * `Vec<u8>` and is included for correctness if ever applied to other\n * byte sequences.\n *\n * @internal\n */\nexport function compareXidBytes(a: Uint8Array, b: Uint8Array): number {\n  const minLen = Math.min(a.length, b.length);\n  for (let i = 0; i < minLen; i++) {\n    if (a[i] !== b[i]) return a[i] < b[i] ? -1 : 1;\n  }\n  if (a.length !== b.length) return a.length < b.length ? -1 : 1;\n  return 0;\n}\n\n/**\n * Parse a XID envelope from a UR string.\n *\n * Port of `parse_xid_envelope()` from proposed_participant.rs lines 39-60.\n */\nfunction parseXidEnvelope(input: string): [Envelope, XIDDocument] {\n  const trimmed = input.trim();\n  if (trimmed.length === 0) {\n    throw new Error(\"XID document is required\");\n  }\n\n  const ur = UR.fromURString(trimmed);\n  const urType = ur.urTypeStr();\n  if (urType !== \"xid\" && urType !== \"envelope\") {\n    throw new Error(`Expected a ur:xid document, found ur:${urType}`);\n  }\n\n  const envelopeCbor = ur.cbor();\n  // Try tagged CBOR first, then untagged\n  let envelope: Envelope;\n  try {\n    envelope = Envelope.fromTaggedCbor(envelopeCbor);\n  } catch {\n    envelope = Envelope.fromUntaggedCbor(envelopeCbor);\n  }\n\n  const document = XIDDocument.fromEnvelope(envelope, undefined, XIDVerifySignature.Inception);\n\n  return [envelope, document];\n}\n"],"mappings":";;;;;;;;;AAsBA,IAAa,yBAAb,MAAa,uBAAuB;CAClC;CACA;CACA;CACA;CAEA,YACE,UACA,UACA,UACA,cACA;AACA,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,YAAY;AACjB,OAAK,gBAAgB;;;;;;;CAQvB,OAAO,OAAO,UAAkB,cAA4C;EAC1E,MAAM,CAAC,UAAU,YAAY,iBAAiB,SAAS;AACvD,SAAO,IAAI,uBAAuB,UAAU,UAAU,UAAU,aAAa;;;;;;;CAQ/E,MAAW;AACT,SAAO,KAAK,UAAU,KAAK;;;;;;;CAQ7B,cAA2B;AACzB,SAAO,KAAK;;;;;;;CAQd,gBAAwB;AACtB,SAAO,KAAK;;;;;;;CAQd,sBAAgC;AAC9B,SAAO,KAAK;;;;;;;CAQd,eAAqB;AACnB,SAAO,KAAK;;;;;;;;;;;;;;;CAgBd,UAAU,OAAuC;AAC/C,SAAO,gBAAgB,KAAK,KAAK,CAAC,QAAQ,EAAE,MAAM,KAAK,CAAC,QAAQ,CAAC;;;;;;;;;;;;;;;AAgBrE,SAAgB,gBAAgB,GAAe,GAAuB;CACpE,MAAM,SAAS,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAO;AAC3C,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IAC1B,KAAI,EAAE,OAAO,EAAE,GAAI,QAAO,EAAE,KAAK,EAAE,KAAK,KAAK;AAE/C,KAAI,EAAE,WAAW,EAAE,OAAQ,QAAO,EAAE,SAAS,EAAE,SAAS,KAAK;AAC7D,QAAO;;;;;;;AAQT,SAAS,iBAAiB,OAAwC;CAChE,MAAM,UAAU,MAAM,MAAM;AAC5B,KAAI,QAAQ,WAAW,EACrB,OAAM,IAAI,MAAM,2BAA2B;CAG7C,MAAM,KAAK,GAAG,aAAa,QAAQ;CACnC,MAAM,SAAS,GAAG,WAAW;AAC7B,KAAI,WAAW,SAAS,WAAW,WACjC,OAAM,IAAI,MAAM,wCAAwC,SAAS;CAGnE,MAAM,eAAe,GAAG,MAAM;CAE9B,IAAI;AACJ,KAAI;AACF,aAAW,SAAS,eAAe,aAAa;SAC1C;AACN,aAAW,SAAS,iBAAiB,aAAa;;CAGpD,MAAM,WAAW,YAAY,aAAa,UAAU,KAAA,GAAW,mBAAmB,UAAU;AAE5F,QAAO,CAAC,UAAU,SAAS"}