npm - @bcts/sskr - Versions diffs - 1.0.0-alpha.9 → 1.0.0-beta.0 - Mend

@bcts/sskr 1.0.0-alpha.9 → 1.0.0-beta.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 (18) hide show

package/dist/index.mjs CHANGED Viewed

@@ -1,27 +1,26 @@
 import { MAX_SECRET_LEN as MAX_SECRET_LEN$1, MAX_SHARE_COUNT as MAX_SHARE_COUNT$1, MIN_SECRET_LEN as MIN_SECRET_LEN$1, ShamirError, recoverSecret, splitSecret } from "@bcts/shamir";
 import { SecureRandomNumberGenerator } from "@bcts/rand";
 //#region src/error.ts
 /**
 * Error types for SSKR operations.
 */
-let SSKRErrorType = /* @__PURE__ */ function(SSKRErrorType$1) {
-	SSKRErrorType$1["DuplicateMemberIndex"] = "DuplicateMemberIndex";
-	SSKRErrorType$1["GroupSpecInvalid"] = "GroupSpecInvalid";
-	SSKRErrorType$1["GroupCountInvalid"] = "GroupCountInvalid";
-	SSKRErrorType$1["GroupThresholdInvalid"] = "GroupThresholdInvalid";
-	SSKRErrorType$1["MemberCountInvalid"] = "MemberCountInvalid";
-	SSKRErrorType$1["MemberThresholdInvalid"] = "MemberThresholdInvalid";
-	SSKRErrorType$1["NotEnoughGroups"] = "NotEnoughGroups";
-	SSKRErrorType$1["SecretLengthNotEven"] = "SecretLengthNotEven";
-	SSKRErrorType$1["SecretTooLong"] = "SecretTooLong";
-	SSKRErrorType$1["SecretTooShort"] = "SecretTooShort";
-	SSKRErrorType$1["ShareLengthInvalid"] = "ShareLengthInvalid";
-	SSKRErrorType$1["ShareReservedBitsInvalid"] = "ShareReservedBitsInvalid";
-	SSKRErrorType$1["SharesEmpty"] = "SharesEmpty";
-	SSKRErrorType$1["ShareSetInvalid"] = "ShareSetInvalid";
-	SSKRErrorType$1["ShamirError"] = "ShamirError";
-	return SSKRErrorType$1;
+let SSKRErrorType = /* @__PURE__ */ function(SSKRErrorType) {
+	SSKRErrorType["DuplicateMemberIndex"] = "DuplicateMemberIndex";
+	SSKRErrorType["GroupSpecInvalid"] = "GroupSpecInvalid";
+	SSKRErrorType["GroupCountInvalid"] = "GroupCountInvalid";
+	SSKRErrorType["GroupThresholdInvalid"] = "GroupThresholdInvalid";
+	SSKRErrorType["MemberCountInvalid"] = "MemberCountInvalid";
+	SSKRErrorType["MemberThresholdInvalid"] = "MemberThresholdInvalid";
+	SSKRErrorType["NotEnoughGroups"] = "NotEnoughGroups";
+	SSKRErrorType["SecretLengthNotEven"] = "SecretLengthNotEven";
+	SSKRErrorType["SecretTooLong"] = "SecretTooLong";
+	SSKRErrorType["SecretTooShort"] = "SecretTooShort";
+	SSKRErrorType["ShareLengthInvalid"] = "ShareLengthInvalid";
+	SSKRErrorType["ShareReservedBitsInvalid"] = "ShareReservedBitsInvalid";
+	SSKRErrorType["SharesEmpty"] = "SharesEmpty";
+	SSKRErrorType["ShareSetInvalid"] = "ShareSetInvalid";
+	SSKRErrorType["ShamirError"] = "ShamirError";
+	return SSKRErrorType;
 }({});
 /**
 * Error class for SSKR operations.
@@ -37,31 +36,35 @@ var SSKRError = class SSKRError extends Error {
 	}
 	static defaultMessage(type, shamirError) {
 		switch (type) {
-			case SSKRErrorType.DuplicateMemberIndex: return "When combining shares, the provided shares contained a duplicate member index";
-			case SSKRErrorType.GroupSpecInvalid: return "Invalid group specification";
-			case SSKRErrorType.GroupCountInvalid: return "When creating a split spec, the group count is invalid";
-			case SSKRErrorType.GroupThresholdInvalid: return "SSKR group threshold is invalid";
-			case SSKRErrorType.MemberCountInvalid: return "SSKR member count is invalid";
-			case SSKRErrorType.MemberThresholdInvalid: return "SSKR member threshold is invalid";
-			case SSKRErrorType.NotEnoughGroups: return "SSKR shares did not contain enough groups";
-			case SSKRErrorType.SecretLengthNotEven: return "SSKR secret is not of even length";
-			case SSKRErrorType.SecretTooLong: return "SSKR secret is too long";
-			case SSKRErrorType.SecretTooShort: return "SSKR secret is too short";
-			case SSKRErrorType.ShareLengthInvalid: return "SSKR shares did not contain enough serialized bytes";
-			case SSKRErrorType.ShareReservedBitsInvalid: return "SSKR shares contained invalid reserved bits";
-			case SSKRErrorType.SharesEmpty: return "SSKR shares were empty";
-			case SSKRErrorType.ShareSetInvalid: return "SSKR shares were invalid";
-			case SSKRErrorType.ShamirError: return shamirError != null ? `SSKR Shamir error: ${shamirError.message}` : "SSKR Shamir error";
+			case "DuplicateMemberIndex": return "When combining shares, the provided shares contained a duplicate member index";
+			case "GroupSpecInvalid": return "Invalid group specification.";
+			case "GroupCountInvalid": return "When creating a split spec, the group count is invalid";
+			case "GroupThresholdInvalid": return "SSKR group threshold is invalid";
+			case "MemberCountInvalid": return "SSKR member count is invalid";
+			case "MemberThresholdInvalid": return "SSKR member threshold is invalid";
+			case "NotEnoughGroups": return "SSKR shares did not contain enough groups";
+			case "SecretLengthNotEven": return "SSKR secret is not of even length";
+			case "SecretTooLong": return "SSKR secret is too long";
+			case "SecretTooShort": return "SSKR secret is too short";
+			case "ShareLengthInvalid": return "SSKR shares did not contain enough serialized bytes";
+			case "ShareReservedBitsInvalid": return "SSKR shares contained invalid reserved bits";
+			case "SharesEmpty": return "SSKR shares were empty";
+			case "ShareSetInvalid": return "SSKR shares were invalid";
+			case "ShamirError": return shamirError != null ? `SSKR Shamir error: ${shamirError.message}` : "SSKR Shamir error";
 		}
 	}
 	static fromShamirError(error) {
-		return new SSKRError(SSKRErrorType.ShamirError, void 0, error);
+		return new SSKRError("ShamirError", void 0, error);
 	}
 };
 //#endregion
 //#region src/secret.ts
 /**
+* Copyright © 2023-2026 Blockchain Commons, LLC
+* Copyright © 2025-2026 Parity Technologies
+*
+*/
+/**
 * A secret to be split into shares.
 */
 var Secret = class Secret {
@@ -80,9 +83,9 @@ var Secret = class Secret {
 	static new(data) {
 		const bytes = typeof data === "string" ? new TextEncoder().encode(data) : data;
 		const len = bytes.length;
-		if (len < MIN_SECRET_LEN) throw new SSKRError(SSKRErrorType.SecretTooShort);
-		if (len > MAX_SECRET_LEN) throw new SSKRError(SSKRErrorType.SecretTooLong);
-		if ((len & 1) !== 0) throw new SSKRError(SSKRErrorType.SecretLengthNotEven);
+		if (len < MIN_SECRET_LEN) throw new SSKRError("SecretTooShort");
+		if (len > MAX_SECRET_LEN) throw new SSKRError("SecretTooLong");
+		if ((len & 1) !== 0) throw new SSKRError("SecretLengthNotEven");
 		return new Secret(new Uint8Array(bytes));
 	}
 	/**
@@ -99,12 +102,24 @@ var Secret = class Secret {
 	}
 	/**
 	* Returns a reference to the secret data.
+	*
+	* Mirrors Rust's `Secret::data(&self) -> &[u8]`
+	* (`bc-sskr-rust/src/secret.rs:43`).
 	*/
 	getData() {
 		return this.data;
 	}
 	/**
 	* Returns the secret data as a Uint8Array.
+	*
+	* Mirrors Rust's `impl AsRef<[u8]> for Secret`
+	* (`bc-sskr-rust/src/secret.rs:46-49`). In Rust, `as_ref()` is
+	* provided via the `AsRef<[u8]>` trait, which lets the `Secret` flow
+	* naturally through any API expecting `impl AsRef<[u8]>`. TypeScript
+	* has no equivalent of that trait, so we expose the same backing
+	* buffer through both {@link getData} (the field accessor) and
+	* `asRef` (the trait-style accessor) for ergonomic parity. Callers
+	* may pick whichever name reads better at the call site.
 	*/
 	asRef() {
 		return this.data;
@@ -124,10 +139,30 @@ var Secret = class Secret {
 		return new Secret(new Uint8Array(this.data));
 	}
 };
 //#endregion
 //#region src/spec.ts
 /**
+* Copyright © 2023-2026 Blockchain Commons, LLC
+* Copyright © 2025-2026 Parity Technologies
+*
+*/
+/**
+* Strictly parses a non-negative integer string the way Rust's
+* `<usize as FromStr>::from_str` does (`bc-sskr-rust/src/spec.rs:102, 108`).
+*
+* Accepts an optional leading `+` followed by one or more decimal digits.
+* Rejects whitespace, decimals (`"2.5"`), trailing characters (`"2x"`),
+* the `-` sign, and the empty string. Returns `undefined` on rejection so
+* callers surface the appropriate `GroupSpecInvalid` error in the same
+* spot Rust's `?` would.
+*/
+const STRICT_USIZE_RE = /^\+?\d+$/;
+function parseStrictUsize(s) {
+	if (!STRICT_USIZE_RE.test(s)) return void 0;
+	const n = Number(s);
+	return Number.isSafeInteger(n) ? n : void 0;
+}
+/**
 * A specification for a group of shares within an SSKR split.
 */
 var GroupSpec = class GroupSpec {
@@ -149,9 +184,9 @@ var GroupSpec = class GroupSpec {
 	*   greater than the member count.
 	*/
 	static new(memberThreshold, memberCount) {
-		if (memberCount === 0) throw new SSKRError(SSKRErrorType.MemberCountInvalid);
-		if (memberCount > MAX_SHARE_COUNT$1) throw new SSKRError(SSKRErrorType.MemberCountInvalid);
-		if (memberThreshold > memberCount) throw new SSKRError(SSKRErrorType.MemberThresholdInvalid);
+		if (memberCount === 0) throw new SSKRError("MemberCountInvalid");
+		if (memberCount > MAX_SHARE_COUNT$1) throw new SSKRError("MemberCountInvalid");
+		if (memberThreshold > memberCount) throw new SSKRError("MemberThresholdInvalid");
 		return new GroupSpec(memberThreshold, memberCount);
 	}
 	/**
@@ -168,16 +203,24 @@ var GroupSpec = class GroupSpec {
 	}
 	/**
 	* Parses a group specification from a string.
-	* Format: "M-of-N" where M is the threshold and N is the count.
+	* Format: `"M-of-N"` where `M` is the threshold and `N` is the count.
+	*
+	* Mirrors Rust's `GroupSpec::parse` (`bc-sskr-rust/src/spec.rs:97-112`),
+	* which calls `parts[0].parse::<usize>()`. Rust's `usize::FromStr` is
+	* strict: it rejects whitespace, decimals, trailing characters, and the
+	* `-` sign, accepting only an optional `+` prefix followed by digits.
+	* We mirror that with the regex `^\+?\d+$` so strings like `"2.5"`,
+	* `"2x"`, `" 2"`, `"-2"`, and `""` all surface
+	* {@link SSKRErrorType.GroupSpecInvalid} on both sides.
 	*/
 	static parse(s) {
 		const parts = s.split("-");
-		if (parts.length !== 3) throw new SSKRError(SSKRErrorType.GroupSpecInvalid);
-		const memberThreshold = parseInt(parts[0], 10);
-		if (isNaN(memberThreshold)) throw new SSKRError(SSKRErrorType.GroupSpecInvalid);
-		if (parts[1] !== "of") throw new SSKRError(SSKRErrorType.GroupSpecInvalid);
-		const memberCount = parseInt(parts[2], 10);
-		if (isNaN(memberCount)) throw new SSKRError(SSKRErrorType.GroupSpecInvalid);
+		if (parts.length !== 3) throw new SSKRError("GroupSpecInvalid");
+		const memberThreshold = parseStrictUsize(parts[0]);
+		if (memberThreshold === void 0) throw new SSKRError("GroupSpecInvalid");
+		if (parts[1] !== "of") throw new SSKRError("GroupSpecInvalid");
+		const memberCount = parseStrictUsize(parts[2]);
+		if (memberCount === void 0) throw new SSKRError("GroupSpecInvalid");
 		return GroupSpec.new(memberThreshold, memberCount);
 	}
 	/**
@@ -216,9 +259,9 @@ var Spec = class Spec {
 	*   greater than the maximum share count.
 	*/
 	static new(groupThreshold, groups) {
-		if (groupThreshold === 0) throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);
-		if (groupThreshold > groups.length) throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);
-		if (groups.length > MAX_SHARE_COUNT$1) throw new SSKRError(SSKRErrorType.GroupCountInvalid);
+		if (groupThreshold === 0) throw new SSKRError("GroupThresholdInvalid");
+		if (groupThreshold > groups.length) throw new SSKRError("GroupThresholdInvalid");
+		if (groups.length > MAX_SHARE_COUNT$1) throw new SSKRError("GroupCountInvalid");
 		return new Spec(groupThreshold, groups);
 	}
 	/**
@@ -246,7 +289,6 @@ var Spec = class Spec {
 		return this._groups.reduce((sum, g) => sum + g.memberCount(), 0);
 	}
 };
 //#endregion
 //#region src/share.ts
 /**
@@ -291,7 +333,6 @@ var SSKRShare = class {
 		return this._value;
 	}
 };
 //#endregion
 //#region src/encoding.ts
 /**
@@ -337,7 +378,7 @@ function sskrCombine(shares) {
 }
 function serializeShare(share) {
 	const valueData = share.value().getData();
-	const result = new Uint8Array(valueData.length + METADATA_SIZE_BYTES);
+	const result = new Uint8Array(valueData.length + 5);
 	const id = share.identifier();
 	const gt = share.groupThreshold() - 1 & 15;
 	const gc = share.groupCount() - 1 & 15;
@@ -351,19 +392,19 @@ function serializeShare(share) {
 	result[2] = gt << 4 | gc;
 	result[3] = gi << 4 | mt;
 	result[4] = mi;
-	result.set(valueData, METADATA_SIZE_BYTES);
+	result.set(valueData, 5);
 	return result;
 }
 function deserializeShare(source) {
-	if (source.length < METADATA_SIZE_BYTES) throw new SSKRError(SSKRErrorType.ShareLengthInvalid);
+	if (source.length < 5) throw new SSKRError("ShareLengthInvalid");
 	const groupThreshold = (source[2] >> 4) + 1;
 	const groupCount = (source[2] & 15) + 1;
-	if (groupThreshold > groupCount) throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);
+	if (groupThreshold > groupCount) throw new SSKRError("GroupThresholdInvalid");
 	const identifier = source[0] << 8 | source[1];
 	const groupIndex = source[3] >> 4;
 	const memberThreshold = (source[3] & 15) + 1;
-	if (source[4] >> 4 !== 0) throw new SSKRError(SSKRErrorType.ShareReservedBitsInvalid);
-	return new SSKRShare(identifier, groupIndex, groupThreshold, groupCount, source[4] & 15, memberThreshold, Secret.new(source.subarray(METADATA_SIZE_BYTES)));
+	if (source[4] >> 4 !== 0) throw new SSKRError("ShareReservedBitsInvalid");
+	return new SSKRShare(identifier, groupIndex, groupThreshold, groupCount, source[4] & 15, memberThreshold, Secret.new(source.subarray(5)));
 }
 function generateShares(spec, masterSecret, randomGenerator) {
 	const identifierBytes = new Uint8Array(2);
@@ -399,7 +440,7 @@ function combineShares(shares) {
 	let identifier = 0;
 	let groupThreshold = 0;
 	let groupCount = 0;
-	if (shares.length === 0) throw new SSKRError(SSKRErrorType.SharesEmpty);
+	if (shares.length === 0) throw new SSKRError("SharesEmpty");
 	let nextGroup = 0;
 	const groups = [];
 	let secretLen = 0;
@@ -410,12 +451,12 @@ function combineShares(shares) {
 			groupCount = share.groupCount();
 			groupThreshold = share.groupThreshold();
 			secretLen = share.value().len();
-		} else if (share.identifier() !== identifier || share.groupThreshold() !== groupThreshold || share.groupCount() !== groupCount || share.value().len() !== secretLen) throw new SSKRError(SSKRErrorType.ShareSetInvalid);
+		} else if (share.identifier() !== identifier || share.groupThreshold() !== groupThreshold || share.groupCount() !== groupCount || share.value().len() !== secretLen) throw new SSKRError("ShareSetInvalid");
 		let groupFound = false;
 		for (const group of groups) if (share.groupIndex() === group.groupIndex) {
 			groupFound = true;
-			if (share.memberThreshold() !== group.memberThreshold) throw new SSKRError(SSKRErrorType.MemberThresholdInvalid);
-			for (const memberIndex of group.memberIndexes) if (share.memberIndex() === memberIndex) throw new SSKRError(SSKRErrorType.DuplicateMemberIndex);
+			if (share.memberThreshold() !== group.memberThreshold) throw new SSKRError("MemberThresholdInvalid");
+			for (const memberIndex of group.memberIndexes) if (share.memberIndex() === memberIndex) throw new SSKRError("DuplicateMemberIndex");
 			if (group.memberIndexes.length < group.memberThreshold) {
 				group.memberIndexes.push(share.memberIndex());
 				group.memberShares.push(share.value().clone());
@@ -432,7 +473,7 @@ function combineShares(shares) {
 			nextGroup++;
 		}
 	}
-	if (nextGroup < groupThreshold) throw new SSKRError(SSKRErrorType.NotEnoughGroups);
+	if (nextGroup < groupThreshold) throw new SSKRError("NotEnoughGroups");
 	const masterIndexes = [];
 	const masterShares = [];
 	for (const group of groups) {
@@ -442,12 +483,13 @@ function combineShares(shares) {
 			const groupSecret = recoverSecret(group.memberIndexes, memberSharesData);
 			masterIndexes.push(group.groupIndex);
 			masterShares.push(groupSecret);
-		} catch {
-			continue;
+		} catch (e) {
+			if (e instanceof ShamirError) continue;
+			throw e;
 		}
 		if (masterIndexes.length === groupThreshold) break;
 	}
-	if (masterIndexes.length < groupThreshold) throw new SSKRError(SSKRErrorType.NotEnoughGroups);
+	if (masterIndexes.length < groupThreshold) throw new SSKRError("NotEnoughGroups");
 	let masterSecretData;
 	try {
 		masterSecretData = recoverSecret(masterIndexes, masterShares);
@@ -457,10 +499,14 @@ function combineShares(shares) {
 	}
 	return Secret.new(masterSecretData);
 }
 //#endregion
 //#region src/index.ts
 /**
+* Copyright © 2023-2026 Blockchain Commons, LLC
+* Copyright © 2025-2026 Parity Technologies
+*
+*/
+/**
 * The minimum length of a secret.
 */
 const MIN_SECRET_LEN = MIN_SECRET_LEN$1;
@@ -483,8 +529,8 @@ const METADATA_SIZE_BYTES = 5;
 /**
 * The minimum number of bytes required to encode a share.
 */
-const MIN_SERIALIZE_SIZE_BYTES = METADATA_SIZE_BYTES + MIN_SECRET_LEN;
+const MIN_SERIALIZE_SIZE_BYTES = 5 + MIN_SECRET_LEN;
 //#endregion
-export { GroupSpec, MAX_GROUPS_COUNT, MAX_SECRET_LEN, MAX_SHARE_COUNT, METADATA_SIZE_BYTES, MIN_SECRET_LEN, MIN_SERIALIZE_SIZE_BYTES, SSKRError, SSKRErrorType, SSKRShare, Secret, Spec, sskrCombine, sskrGenerate, sskrGenerateUsing };
+export { GroupSpec, MAX_GROUPS_COUNT, MAX_SECRET_LEN, MAX_SHARE_COUNT, METADATA_SIZE_BYTES, MIN_SECRET_LEN, MIN_SERIALIZE_SIZE_BYTES, SSKRError, SSKRErrorType, Secret, Spec, sskrCombine, sskrGenerate, sskrGenerateUsing };
 //# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.mjs","names":["MAX_SHARE_COUNT","sskrShares: SSKRShare[]","groupsShares: SSKRShare[][]","groupSecrets: Uint8Array[]","memberSecrets: Uint8Array[]","memberSSKRShares: SSKRShare[]","groups: Group[]","g: Group","masterIndexes: number[]","masterShares: Uint8Array[]","masterSecretData: Uint8Array","SHAMIR_MIN_SECRET_LEN","SHAMIR_MAX_SECRET_LEN","SHAMIR_MAX_SHARE_COUNT"],"sources":["../src/error.ts","../src/secret.ts","../src/spec.ts","../src/share.ts","../src/encoding.ts","../src/index.ts"],"sourcesContent":["// Ported from bc-sskr-rust/src/error.rs\n\nimport type { ShamirError } from \"@bcts/shamir\";\n\n/*\n Error types for SSKR operations.\n /\nexport enum SSKRErrorType {\n DuplicateMemberIndex = \"DuplicateMemberIndex\",\n GroupSpecInvalid = \"GroupSpecInvalid\",\n GroupCountInvalid = \"GroupCountInvalid\",\n GroupThresholdInvalid = \"GroupThresholdInvalid\",\n MemberCountInvalid = \"MemberCountInvalid\",\n MemberThresholdInvalid = \"MemberThresholdInvalid\",\n NotEnoughGroups = \"NotEnoughGroups\",\n SecretLengthNotEven = \"SecretLengthNotEven\",\n SecretTooLong = \"SecretTooLong\",\n SecretTooShort = \"SecretTooShort\",\n ShareLengthInvalid = \"ShareLengthInvalid\",\n ShareReservedBitsInvalid = \"ShareReservedBitsInvalid\",\n SharesEmpty = \"SharesEmpty\",\n ShareSetInvalid = \"ShareSetInvalid\",\n ShamirError = \"ShamirError\",\n}\n\n/\n Error class for SSKR operations.\n /\nexport class SSKRError extends Error {\n readonly type: SSKRErrorType;\n readonly shamirError?: ShamirError \| undefined;\n\n constructor(type: SSKRErrorType, message?: string, shamirError?: ShamirError) {\n super(message ?? SSKRError.defaultMessage(type, shamirError));\n this.type = type;\n this.shamirError = shamirError;\n this.name = \"SSKRError\";\n }\n\n private static defaultMessage(type: SSKRErrorType, shamirError?: ShamirError): string {\n switch (type) {\n case SSKRErrorType.DuplicateMemberIndex:\n return \"When combining shares, the provided shares contained a duplicate member index\";\n case SSKRErrorType.GroupSpecInvalid:\n return \"Invalid group specification\";\n case SSKRErrorType.GroupCountInvalid:\n return \"When creating a split spec, the group count is invalid\";\n case SSKRErrorType.GroupThresholdInvalid:\n return \"SSKR group threshold is invalid\";\n case SSKRErrorType.MemberCountInvalid:\n return \"SSKR member count is invalid\";\n case SSKRErrorType.MemberThresholdInvalid:\n return \"SSKR member threshold is invalid\";\n case SSKRErrorType.NotEnoughGroups:\n return \"SSKR shares did not contain enough groups\";\n case SSKRErrorType.SecretLengthNotEven:\n return \"SSKR secret is not of even length\";\n case SSKRErrorType.SecretTooLong:\n return \"SSKR secret is too long\";\n case SSKRErrorType.SecretTooShort:\n return \"SSKR secret is too short\";\n case SSKRErrorType.ShareLengthInvalid:\n return \"SSKR shares did not contain enough serialized bytes\";\n case SSKRErrorType.ShareReservedBitsInvalid:\n return \"SSKR shares contained invalid reserved bits\";\n case SSKRErrorType.SharesEmpty:\n return \"SSKR shares were empty\";\n case SSKRErrorType.ShareSetInvalid:\n return \"SSKR shares were invalid\";\n case SSKRErrorType.ShamirError:\n return shamirError != null\n ? `SSKR Shamir error: ${shamirError.message}`\n : \"SSKR Shamir error\";\n }\n }\n\n static fromShamirError(error: ShamirError): SSKRError {\n return new SSKRError(SSKRErrorType.ShamirError, undefined, error);\n }\n}\n\nexport type SSKRResult<T> = T;\n","// Ported from bc-sskr-rust/src/secret.rs\n\nimport { MIN_SECRET_LEN, MAX_SECRET_LEN } from \"./index.js\";\nimport { SSKRError, SSKRErrorType } from \"./error.js\";\n\n/\n A secret to be split into shares.\n /\nexport class Secret {\n private readonly data: Uint8Array;\n\n private constructor(data: Uint8Array) {\n this.data = data;\n }\n\n /\n Creates a new Secret instance with the given data.\n \n @param data - The secret data to be split into shares.\n * @returns A new Secret instance.\n * @throws SSKRError if the length of the secret is less than\n * MIN_SECRET_LEN, greater than MAX_SECRET_LEN, or not even.\n /\n static new(data: Uint8Array \| string): Secret {\n const bytes = typeof data === \"string\" ? new TextEncoder().encode(data) : data;\n const len = bytes.length;\n\n if (len < MIN_SECRET_LEN) {\n throw new SSKRError(SSKRErrorType.SecretTooShort);\n }\n if (len > MAX_SECRET_LEN) {\n throw new SSKRError(SSKRErrorType.SecretTooLong);\n }\n if ((len & 1) !== 0) {\n throw new SSKRError(SSKRErrorType.SecretLengthNotEven);\n }\n\n return new Secret(new Uint8Array(bytes));\n }\n\n /\n Returns the length of the secret.\n /\n len(): number {\n return this.data.length;\n }\n\n /\n Returns true if the secret is empty.\n /\n isEmpty(): boolean {\n return this.len() === 0;\n }\n\n /\n Returns a reference to the secret data.\n /\n getData(): Uint8Array {\n return this.data;\n }\n\n /\n Returns the secret data as a Uint8Array.\n /\n asRef(): Uint8Array {\n return this.data;\n }\n\n /\n Check equality with another Secret.\n /\n equals(other: Secret): boolean {\n if (this.data.length !== other.data.length) {\n return false;\n }\n for (let i = 0; i < this.data.length; i++) {\n if (this.data[i] !== other.data[i]) {\n return false;\n }\n }\n return true;\n }\n\n /\n Clone the secret.\n /\n clone(): Secret {\n return new Secret(new Uint8Array(this.data));\n }\n}\n","// Ported from bc-sskr-rust/src/spec.rs\n\nimport { MAX_SHARE_COUNT } from \"@bcts/shamir\";\nimport { SSKRError, SSKRErrorType } from \"./error.js\";\n\n/\n A specification for a group of shares within an SSKR split.\n /\nexport class GroupSpec {\n private readonly _memberThreshold: number;\n private readonly _memberCount: number;\n\n private constructor(memberThreshold: number, memberCount: number) {\n this._memberThreshold = memberThreshold;\n this._memberCount = memberCount;\n }\n\n /\n Creates a new GroupSpec instance with the given member threshold and count.\n \n @param memberThreshold - The minimum number of member shares required to\n * reconstruct the secret within the group.\n * @param memberCount - The total number of member shares in the group.\n * @returns A new GroupSpec instance.\n * @throws SSKRError if the member count is zero, if the member count is\n * greater than the maximum share count, or if the member threshold is\n * greater than the member count.\n /\n static new(memberThreshold: number, memberCount: number): GroupSpec {\n if (memberCount === 0) {\n throw new SSKRError(SSKRErrorType.MemberCountInvalid);\n }\n if (memberCount > MAX_SHARE_COUNT) {\n throw new SSKRError(SSKRErrorType.MemberCountInvalid);\n }\n if (memberThreshold > memberCount) {\n throw new SSKRError(SSKRErrorType.MemberThresholdInvalid);\n }\n return new GroupSpec(memberThreshold, memberCount);\n }\n\n /\n Returns the member share threshold for this group.\n /\n memberThreshold(): number {\n return this._memberThreshold;\n }\n\n /\n Returns the number of member shares in this group.\n /\n memberCount(): number {\n return this._memberCount;\n }\n\n /\n Parses a group specification from a string.\n * Format: \"M-of-N\" where M is the threshold and N is the count.\n /\n static parse(s: string): GroupSpec {\n const parts = s.split(\"-\");\n if (parts.length !== 3) {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n const memberThreshold = parseInt(parts[0], 10);\n if (isNaN(memberThreshold)) {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n if (parts[1] !== \"of\") {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n const memberCount = parseInt(parts[2], 10);\n if (isNaN(memberCount)) {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n return GroupSpec.new(memberThreshold, memberCount);\n }\n\n /\n Creates a default GroupSpec (1-of-1).\n /\n static default(): GroupSpec {\n return GroupSpec.new(1, 1);\n }\n\n /\n Returns a string representation of the group spec.\n /\n toString(): string {\n return `${this._memberThreshold}-of-${this._memberCount}`;\n }\n}\n\n/\n A specification for an SSKR split.\n /\nexport class Spec {\n private readonly _groupThreshold: number;\n private readonly _groups: GroupSpec[];\n\n private constructor(groupThreshold: number, groups: GroupSpec[]) {\n this._groupThreshold = groupThreshold;\n this._groups = groups;\n }\n\n /\n Creates a new Spec instance with the given group threshold and groups.\n \n @param groupThreshold - The minimum number of groups required to\n * reconstruct the secret.\n * @param groups - The list of GroupSpec instances that define the groups\n * and their members.\n * @returns A new Spec instance.\n * @throws SSKRError if the group threshold is zero, if the group threshold\n * is greater than the number of groups, or if the number of groups is\n * greater than the maximum share count.\n /\n static new(groupThreshold: number, groups: GroupSpec[]): Spec {\n if (groupThreshold === 0) {\n throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);\n }\n if (groupThreshold > groups.length) {\n throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);\n }\n if (groups.length > MAX_SHARE_COUNT) {\n throw new SSKRError(SSKRErrorType.GroupCountInvalid);\n }\n return new Spec(groupThreshold, groups);\n }\n\n /\n Returns the group threshold.\n /\n groupThreshold(): number {\n return this._groupThreshold;\n }\n\n /\n Returns a slice of the group specifications.\n /\n groups(): GroupSpec[] {\n return this._groups;\n }\n\n /\n Returns the number of groups.\n /\n groupCount(): number {\n return this._groups.length;\n }\n\n /\n Returns the total number of shares across all groups.\n /\n shareCount(): number {\n return this._groups.reduce((sum, g) => sum + g.memberCount(), 0);\n }\n}\n","// Ported from bc-sskr-rust/src/share.rs\n\nimport type { Secret } from \"./secret.js\";\n\n/\n A share in the SSKR scheme.\n /\nexport class SSKRShare {\n private readonly _identifier: number;\n private readonly _groupIndex: number;\n private readonly _groupThreshold: number;\n private readonly _groupCount: number;\n private readonly _memberIndex: number;\n private readonly _memberThreshold: number;\n private readonly _value: Secret;\n\n constructor(\n identifier: number,\n groupIndex: number,\n groupThreshold: number,\n groupCount: number,\n memberIndex: number,\n memberThreshold: number,\n value: Secret,\n ) {\n this._identifier = identifier;\n this._groupIndex = groupIndex;\n this._groupThreshold = groupThreshold;\n this._groupCount = groupCount;\n this._memberIndex = memberIndex;\n this._memberThreshold = memberThreshold;\n this._value = value;\n }\n\n identifier(): number {\n return this._identifier;\n }\n\n groupIndex(): number {\n return this._groupIndex;\n }\n\n groupThreshold(): number {\n return this._groupThreshold;\n }\n\n groupCount(): number {\n return this._groupCount;\n }\n\n memberIndex(): number {\n return this._memberIndex;\n }\n\n memberThreshold(): number {\n return this._memberThreshold;\n }\n\n value(): Secret {\n return this._value;\n }\n}\n","// Ported from bc-sskr-rust/src/encoding.rs\n\nimport type { RandomNumberGenerator } from \"@bcts/rand\";\nimport { SecureRandomNumberGenerator } from \"@bcts/rand\";\nimport { splitSecret, recoverSecret, ShamirError } from \"@bcts/shamir\";\n\nimport { SSKRError, SSKRErrorType } from \"./error.js\";\nimport { Secret } from \"./secret.js\";\nimport type { Spec } from \"./spec.js\";\nimport { SSKRShare } from \"./share.js\";\nimport { METADATA_SIZE_BYTES } from \"./index.js\";\n\n/\n Generates SSKR shares for the given Spec and Secret.\n \n @param spec - The Spec instance that defines the group and member thresholds.\n * @param masterSecret - The Secret instance to be split into shares.\n * @returns A vector of groups, each containing a vector of shares,\n * each of which is a Uint8Array.\n /\nexport function sskrGenerate(spec: Spec, masterSecret: Secret): Uint8Array[][] {\n const rng = new SecureRandomNumberGenerator();\n return sskrGenerateUsing(spec, masterSecret, rng);\n}\n\n/\n Generates SSKR shares for the given Spec and Secret using the provided\n * random number generator.\n \n @param spec - The Spec instance that defines the group and member thresholds.\n * @param masterSecret - The Secret instance to be split into shares.\n * @param randomGenerator - The random number generator to use for generating\n * shares.\n * @returns A vector of groups, each containing a vector of shares,\n * each of which is a Uint8Array.\n /\nexport function sskrGenerateUsing(\n spec: Spec,\n masterSecret: Secret,\n randomGenerator: RandomNumberGenerator,\n): Uint8Array[][] {\n const groupsShares = generateShares(spec, masterSecret, randomGenerator);\n\n const result: Uint8Array[][] = groupsShares.map((group) => group.map(serializeShare));\n\n return result;\n}\n\n/\n Combines the given SSKR shares into a Secret.\n \n @param shares - A array of SSKR shares to be combined.\n * @returns The reconstructed Secret.\n * @throws SSKRError if the shares do not meet the necessary quorum of groups\n * and member shares within each group.\n /\nexport function sskrCombine(shares: Uint8Array[]): Secret {\n const sskrShares: SSKRShare[] = [];\n\n for (const share of shares) {\n const sskrShare = deserializeShare(share);\n sskrShares.push(sskrShare);\n }\n\n return combineShares(sskrShares);\n}\n\nfunction serializeShare(share: SSKRShare): Uint8Array {\n // pack the id, group and member data into 5 bytes:\n // 76543210 76543210 76543210\n // 76543210 76543210\n // ----------------====----====----====----\n // identifier: 16\n // group-threshold: 4\n // group-count: 4\n // group-index: 4\n // member-threshold: 4\n // reserved (MUST be zero): 4\n // member-index: 4\n\n const valueData = share.value().getData();\n const result = new Uint8Array(valueData.length + METADATA_SIZE_BYTES);\n\n const id = share.identifier();\n const gt = (share.groupThreshold() - 1) & 0xf;\n const gc = (share.groupCount() - 1) & 0xf;\n const gi = share.groupIndex() & 0xf;\n const mt = (share.memberThreshold() - 1) & 0xf;\n const mi = share.memberIndex() & 0xf;\n\n const id1 = id >> 8;\n const id2 = id & 0xff;\n\n result[0] = id1;\n result[1] = id2;\n result[2] = (gt << 4) \| gc;\n result[3] = (gi << 4) \| mt;\n result[4] = mi;\n result.set(valueData, METADATA_SIZE_BYTES);\n\n return result;\n}\n\nfunction deserializeShare(source: Uint8Array): SSKRShare {\n if (source.length < METADATA_SIZE_BYTES) {\n throw new SSKRError(SSKRErrorType.ShareLengthInvalid);\n }\n\n const groupThreshold = (source[2] >> 4) + 1;\n const groupCount = (source[2] & 0xf) + 1;\n\n if (groupThreshold > groupCount) {\n throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);\n }\n\n const identifier = (source[0] << 8) \| source[1];\n const groupIndex = source[3] >> 4;\n const memberThreshold = (source[3] & 0xf) + 1;\n const reserved = source[4] >> 4;\n if (reserved !== 0) {\n throw new SSKRError(SSKRErrorType.ShareReservedBitsInvalid);\n }\n const memberIndex = source[4] & 0xf;\n const value = Secret.new(source.subarray(METADATA_SIZE_BYTES));\n\n return new SSKRShare(\n identifier,\n groupIndex,\n groupThreshold,\n groupCount,\n memberIndex,\n memberThreshold,\n value,\n );\n}\n\nfunction generateShares(\n spec: Spec,\n masterSecret: Secret,\n randomGenerator: RandomNumberGenerator,\n): SSKRShare[][] {\n // assign a random identifier\n const identifierBytes = new Uint8Array(2);\n randomGenerator.fillRandomData(identifierBytes);\n const identifier = (identifierBytes[0] << 8) \| identifierBytes[1];\n\n const groupsShares: SSKRShare[][] = [];\n\n let groupSecrets: Uint8Array[];\n try {\n groupSecrets = splitSecret(\n spec.groupThreshold(),\n spec.groupCount(),\n masterSecret.getData(),\n randomGenerator,\n );\n } catch (e) {\n if (e instanceof ShamirError) {\n throw SSKRError.fromShamirError(e);\n }\n throw e;\n }\n\n for (let groupIndex = 0; groupIndex < spec.groups().length; groupIndex++) {\n const group = spec.groups()[groupIndex];\n const groupSecret = groupSecrets[groupIndex];\n\n let memberSecrets: Uint8Array[];\n try {\n memberSecrets = splitSecret(\n group.memberThreshold(),\n group.memberCount(),\n groupSecret,\n randomGenerator,\n );\n } catch (e) {\n if (e instanceof ShamirError) {\n throw SSKRError.fromShamirError(e);\n }\n throw e;\n }\n\n const memberSSKRShares: SSKRShare[] = memberSecrets.map((memberSecret, memberIndex) => {\n const secret = Secret.new(memberSecret);\n return new SSKRShare(\n identifier,\n groupIndex,\n spec.groupThreshold(),\n spec.groupCount(),\n memberIndex,\n group.memberThreshold(),\n secret,\n );\n });\n\n groupsShares.push(memberSSKRShares);\n }\n\n return groupsShares;\n}\n\ninterface Group {\n groupIndex: number;\n memberThreshold: number;\n memberIndexes: number[];\n memberShares: Secret[];\n}\n\nfunction combineShares(shares: SSKRShare[]): Secret {\n let identifier = 0;\n let groupThreshold = 0;\n let groupCount = 0;\n\n if (shares.length === 0) {\n throw new SSKRError(SSKRErrorType.SharesEmpty);\n }\n\n let nextGroup = 0;\n const groups: Group[] = [];\n let secretLen = 0;\n\n for (let i = 0; i < shares.length; i++) {\n const share = shares[i];\n\n if (i === 0) {\n // on the first one, establish expected values for common metadata\n identifier = share.identifier();\n groupCount = share.groupCount();\n groupThreshold = share.groupThreshold();\n secretLen = share.value().len();\n } else {\n // on subsequent shares, check that common metadata matches\n if (\n share.identifier() !== identifier \|\|\n share.groupThreshold() !== groupThreshold \|\|\n share.groupCount() !== groupCount \|\|\n share.value().len() !== secretLen\n ) {\n throw new SSKRError(SSKRErrorType.ShareSetInvalid);\n }\n }\n\n // sort shares into member groups\n let groupFound = false;\n for (const group of groups) {\n if (share.groupIndex() === group.groupIndex) {\n groupFound = true;\n if (share.memberThreshold() !== group.memberThreshold) {\n throw new SSKRError(SSKRErrorType.MemberThresholdInvalid);\n }\n for (const memberIndex of group.memberIndexes) {\n if (share.memberIndex() === memberIndex) {\n throw new SSKRError(SSKRErrorType.DuplicateMemberIndex);\n }\n }\n if (group.memberIndexes.length < group.memberThreshold) {\n group.memberIndexes.push(share.memberIndex());\n group.memberShares.push(share.value().clone());\n }\n }\n }\n\n if (!groupFound) {\n const g: Group = {\n groupIndex: share.groupIndex(),\n memberThreshold: share.memberThreshold(),\n memberIndexes: [share.memberIndex()],\n memberShares: [share.value().clone()],\n };\n groups.push(g);\n nextGroup++;\n }\n }\n\n // Check that we have enough groups to recover the master secret\n if (nextGroup < groupThreshold) {\n throw new SSKRError(SSKRErrorType.NotEnoughGroups);\n }\n\n // Here, all of the shares are unpacked into member groups. Now we go\n // through each group and recover the group secret, and then use the\n // result to recover the master secret\n const masterIndexes: number[] = [];\n const masterShares: Uint8Array[] = [];\n\n for (const group of groups) {\n // Only attempt to recover the group secret if we have enough shares\n if (group.memberIndexes.length < group.memberThreshold) {\n continue;\n }\n\n // Recover the group secret\n try {\n const memberSharesData = group.memberShares.map((s) => s.getData());\n const groupSecret = recoverSecret(group.memberIndexes, memberSharesData);\n masterIndexes.push(group.groupIndex);\n masterShares.push(groupSecret);\n } catch {\n // If we can't recover this group, just skip it\n continue;\n }\n\n // Stop if we have enough groups to recover the master secret\n if (masterIndexes.length === groupThreshold) {\n break;\n }\n }\n\n // If we don't have enough groups to recover the master secret, return an error\n if (masterIndexes.length < groupThreshold) {\n throw new SSKRError(SSKRErrorType.NotEnoughGroups);\n }\n\n // Recover the master secret\n let masterSecretData: Uint8Array;\n try {\n masterSecretData = recoverSecret(masterIndexes, masterShares);\n } catch (e) {\n if (e instanceof ShamirError) {\n throw SSKRError.fromShamirError(e);\n }\n throw e;\n }\n\n return Secret.new(masterSecretData);\n}\n","// Blockchain Commons Sharded Secret Key Reconstruction (SSKR)\n// Ported from bc-sskr-rust\n//\n// Sharded Secret Key Reconstruction (SSKR) is a protocol for splitting a\n// secret into a set of shares across one or more groups, such that the\n// secret can be reconstructed from any combination of shares totaling or\n// exceeding a threshold number of shares within each group and across all\n// groups. SSKR is a generalization of Shamir's Secret Sharing (SSS) that\n// allows for multiple groups and multiple thresholds.\n\nimport {\n MIN_SECRET_LEN as SHAMIR_MIN_SECRET_LEN,\n MAX_SECRET_LEN as SHAMIR_MAX_SECRET_LEN,\n MAX_SHARE_COUNT as SHAMIR_MAX_SHARE_COUNT,\n} from \"@bcts/shamir\";\n\n/\n The minimum length of a secret.\n /\nexport const MIN_SECRET_LEN = SHAMIR_MIN_SECRET_LEN;\n\n/\n The maximum length of a secret.\n /\nexport const MAX_SECRET_LEN = SHAMIR_MAX_SECRET_LEN;\n\n/\n The maximum number of shares that can be generated from a secret.\n /\nexport const MAX_SHARE_COUNT = SHAMIR_MAX_SHARE_COUNT;\n\n/\n The maximum number of groups in a split.\n /\nexport const MAX_GROUPS_COUNT = MAX_SHARE_COUNT;\n\n/\n The number of bytes used to encode the metadata for a share.\n /\nexport const METADATA_SIZE_BYTES = 5;\n\n/\n The minimum number of bytes required to encode a share.\n */\nexport const MIN_SERIALIZE_SIZE_BYTES = METADATA_SIZE_BYTES + MIN_SECRET_LEN;\n\n// Error types\nexport { SSKRError, SSKRErrorType, type SSKRResult } from \"./error.js\";\n\n// Secret\nexport { Secret } from \"./secret.js\";\n\n// Specifications\nexport { GroupSpec, Spec } from \"./spec.js\";\n\n// Share\nexport { SSKRShare } from \"./share.js\";\n\n// Encoding/Decoding\nexport { sskrGenerate, sskrGenerateUsing, sskrCombine } from \"./encoding.js\";\n"],"mappings":";;;;;;;AAOA,IAAY,0DAAL;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;AAMF,IAAa,YAAb,MAAa,kBAAkB,MAAM;CACnC,AAAS;CACT,AAAS;CAET,YAAY,MAAqB,SAAkB,aAA2B;AAC5E,QAAM,WAAW,UAAU,eAAe,MAAM,YAAY,CAAC;AAC7D,OAAK,OAAO;AACZ,OAAK,cAAc;AACnB,OAAK,OAAO;;CAGd,OAAe,eAAe,MAAqB,aAAmC;AACpF,UAAQ,MAAR;GACE,KAAK,cAAc,qBACjB,QAAO;GACT,KAAK,cAAc,iBACjB,QAAO;GACT,KAAK,cAAc,kBACjB,QAAO;GACT,KAAK,cAAc,sBACjB,QAAO;GACT,KAAK,cAAc,mBACjB,QAAO;GACT,KAAK,cAAc,uBACjB,QAAO;GACT,KAAK,cAAc,gBACjB,QAAO;GACT,KAAK,cAAc,oBACjB,QAAO;GACT,KAAK,cAAc,cACjB,QAAO;GACT,KAAK,cAAc,eACjB,QAAO;GACT,KAAK,cAAc,mBACjB,QAAO;GACT,KAAK,cAAc,yBACjB,QAAO;GACT,KAAK,cAAc,YACjB,QAAO;GACT,KAAK,cAAc,gBACjB,QAAO;GACT,KAAK,cAAc,YACjB,QAAO,eAAe,OAClB,sBAAsB,YAAY,YAClC;;;CAIV,OAAO,gBAAgB,OAA+B;AACpD,SAAO,IAAI,UAAU,cAAc,aAAa,QAAW,MAAM;;;;;;;;;ACrErE,IAAa,SAAb,MAAa,OAAO;CAClB,AAAiB;CAEjB,AAAQ,YAAY,MAAkB;AACpC,OAAK,OAAO;;;;;;;;;;CAWd,OAAO,IAAI,MAAmC;EAC5C,MAAM,QAAQ,OAAO,SAAS,WAAW,IAAI,aAAa,CAAC,OAAO,KAAK,GAAG;EAC1E,MAAM,MAAM,MAAM;AAElB,MAAI,MAAM,eACR,OAAM,IAAI,UAAU,cAAc,eAAe;AAEnD,MAAI,MAAM,eACR,OAAM,IAAI,UAAU,cAAc,cAAc;AAElD,OAAK,MAAM,OAAO,EAChB,OAAM,IAAI,UAAU,cAAc,oBAAoB;AAGxD,SAAO,IAAI,OAAO,IAAI,WAAW,MAAM,CAAC;;;;;CAM1C,MAAc;AACZ,SAAO,KAAK,KAAK;;;;;CAMnB,UAAmB;AACjB,SAAO,KAAK,KAAK,KAAK;;;;;CAMxB,UAAsB;AACpB,SAAO,KAAK;;;;;CAMd,QAAoB;AAClB,SAAO,KAAK;;;;;CAMd,OAAO,OAAwB;AAC7B,MAAI,KAAK,KAAK,WAAW,MAAM,KAAK,OAClC,QAAO;AAET,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IACpC,KAAI,KAAK,KAAK,OAAO,MAAM,KAAK,GAC9B,QAAO;AAGX,SAAO;;;;;CAMT,QAAgB;AACd,SAAO,IAAI,OAAO,IAAI,WAAW,KAAK,KAAK,CAAC;;;;;;;;;AC/EhD,IAAa,YAAb,MAAa,UAAU;CACrB,AAAiB;CACjB,AAAiB;CAEjB,AAAQ,YAAY,iBAAyB,aAAqB;AAChE,OAAK,mBAAmB;AACxB,OAAK,eAAe;;;;;;;;;;;;;CActB,OAAO,IAAI,iBAAyB,aAAgC;AAClE,MAAI,gBAAgB,EAClB,OAAM,IAAI,UAAU,cAAc,mBAAmB;AAEvD,MAAI,cAAcA,kBAChB,OAAM,IAAI,UAAU,cAAc,mBAAmB;AAEvD,MAAI,kBAAkB,YACpB,OAAM,IAAI,UAAU,cAAc,uBAAuB;AAE3D,SAAO,IAAI,UAAU,iBAAiB,YAAY;;;;;CAMpD,kBAA0B;AACxB,SAAO,KAAK;;;;;CAMd,cAAsB;AACpB,SAAO,KAAK;;;;;;CAOd,OAAO,MAAM,GAAsB;EACjC,MAAM,QAAQ,EAAE,MAAM,IAAI;AAC1B,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,UAAU,cAAc,iBAAiB;EAGrD,MAAM,kBAAkB,SAAS,MAAM,IAAI,GAAG;AAC9C,MAAI,MAAM,gBAAgB,CACxB,OAAM,IAAI,UAAU,cAAc,iBAAiB;AAGrD,MAAI,MAAM,OAAO,KACf,OAAM,IAAI,UAAU,cAAc,iBAAiB;EAGrD,MAAM,cAAc,SAAS,MAAM,IAAI,GAAG;AAC1C,MAAI,MAAM,YAAY,CACpB,OAAM,IAAI,UAAU,cAAc,iBAAiB;AAGrD,SAAO,UAAU,IAAI,iBAAiB,YAAY;;;;;CAMpD,OAAO,UAAqB;AAC1B,SAAO,UAAU,IAAI,GAAG,EAAE;;;;;CAM5B,WAAmB;AACjB,SAAO,GAAG,KAAK,iBAAiB,MAAM,KAAK;;;;;;AAO/C,IAAa,OAAb,MAAa,KAAK;CAChB,AAAiB;CACjB,AAAiB;CAEjB,AAAQ,YAAY,gBAAwB,QAAqB;AAC/D,OAAK,kBAAkB;AACvB,OAAK,UAAU;;;;;;;;;;;;;;CAejB,OAAO,IAAI,gBAAwB,QAA2B;AAC5D,MAAI,mBAAmB,EACrB,OAAM,IAAI,UAAU,cAAc,sBAAsB;AAE1D,MAAI,iBAAiB,OAAO,OAC1B,OAAM,IAAI,UAAU,cAAc,sBAAsB;AAE1D,MAAI,OAAO,SAASA,kBAClB,OAAM,IAAI,UAAU,cAAc,kBAAkB;AAEtD,SAAO,IAAI,KAAK,gBAAgB,OAAO;;;;;CAMzC,iBAAyB;AACvB,SAAO,KAAK;;;;;CAMd,SAAsB;AACpB,SAAO,KAAK;;;;;CAMd,aAAqB;AACnB,SAAO,KAAK,QAAQ;;;;;CAMtB,aAAqB;AACnB,SAAO,KAAK,QAAQ,QAAQ,KAAK,MAAM,MAAM,EAAE,aAAa,EAAE,EAAE;;;;;;;;;ACxJpE,IAAa,YAAb,MAAuB;CACrB,AAAiB;CACjB,AAAiB;CACjB,AAAiB;CACjB,AAAiB;CACjB,AAAiB;CACjB,AAAiB;CACjB,AAAiB;CAEjB,YACE,YACA,YACA,gBACA,YACA,aACA,iBACA,OACA;AACA,OAAK,cAAc;AACnB,OAAK,cAAc;AACnB,OAAK,kBAAkB;AACvB,OAAK,cAAc;AACnB,OAAK,eAAe;AACpB,OAAK,mBAAmB;AACxB,OAAK,SAAS;;CAGhB,aAAqB;AACnB,SAAO,KAAK;;CAGd,aAAqB;AACnB,SAAO,KAAK;;CAGd,iBAAyB;AACvB,SAAO,KAAK;;CAGd,aAAqB;AACnB,SAAO,KAAK;;CAGd,cAAsB;AACpB,SAAO,KAAK;;CAGd,kBAA0B;AACxB,SAAO,KAAK;;CAGd,QAAgB;AACd,SAAO,KAAK;;;;;;;;;;;;;;ACvChB,SAAgB,aAAa,MAAY,cAAsC;AAE7E,QAAO,kBAAkB,MAAM,cADnB,IAAI,6BAA6B,CACI;;;;;;;;;;;;;AAcnD,SAAgB,kBACd,MACA,cACA,iBACgB;AAKhB,QAJqB,eAAe,MAAM,cAAc,gBAAgB,CAE5B,KAAK,UAAU,MAAM,IAAI,eAAe,CAAC;;;;;;;;;;AAavF,SAAgB,YAAY,QAA8B;CACxD,MAAMC,aAA0B,EAAE;AAElC,MAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,YAAY,iBAAiB,MAAM;AACzC,aAAW,KAAK,UAAU;;AAG5B,QAAO,cAAc,WAAW;;AAGlC,SAAS,eAAe,OAA8B;CAapD,MAAM,YAAY,MAAM,OAAO,CAAC,SAAS;CACzC,MAAM,SAAS,IAAI,WAAW,UAAU,SAAS,oBAAoB;CAErE,MAAM,KAAK,MAAM,YAAY;CAC7B,MAAM,KAAM,MAAM,gBAAgB,GAAG,IAAK;CAC1C,MAAM,KAAM,MAAM,YAAY,GAAG,IAAK;CACtC,MAAM,KAAK,MAAM,YAAY,GAAG;CAChC,MAAM,KAAM,MAAM,iBAAiB,GAAG,IAAK;CAC3C,MAAM,KAAK,MAAM,aAAa,GAAG;CAEjC,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,KAAK;AAEjB,QAAO,KAAK;AACZ,QAAO,KAAK;AACZ,QAAO,KAAM,MAAM,IAAK;AACxB,QAAO,KAAM,MAAM,IAAK;AACxB,QAAO,KAAK;AACZ,QAAO,IAAI,WAAW,oBAAoB;AAE1C,QAAO;;AAGT,SAAS,iBAAiB,QAA+B;AACvD,KAAI,OAAO,SAAS,oBAClB,OAAM,IAAI,UAAU,cAAc,mBAAmB;CAGvD,MAAM,kBAAkB,OAAO,MAAM,KAAK;CAC1C,MAAM,cAAc,OAAO,KAAK,MAAO;AAEvC,KAAI,iBAAiB,WACnB,OAAM,IAAI,UAAU,cAAc,sBAAsB;CAG1D,MAAM,aAAc,OAAO,MAAM,IAAK,OAAO;CAC7C,MAAM,aAAa,OAAO,MAAM;CAChC,MAAM,mBAAmB,OAAO,KAAK,MAAO;AAE5C,KADiB,OAAO,MAAM,MACb,EACf,OAAM,IAAI,UAAU,cAAc,yBAAyB;AAK7D,QAAO,IAAI,UACT,YACA,YACA,gBACA,YAPkB,OAAO,KAAK,IAS9B,iBARY,OAAO,IAAI,OAAO,SAAS,oBAAoB,CAAC,CAU7D;;AAGH,SAAS,eACP,MACA,cACA,iBACe;CAEf,MAAM,kBAAkB,IAAI,WAAW,EAAE;AACzC,iBAAgB,eAAe,gBAAgB;CAC/C,MAAM,aAAc,gBAAgB,MAAM,IAAK,gBAAgB;CAE/D,MAAMC,eAA8B,EAAE;CAEtC,IAAIC;AACJ,KAAI;AACF,iBAAe,YACb,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,aAAa,SAAS,EACtB,gBACD;UACM,GAAG;AACV,MAAI,aAAa,YACf,OAAM,UAAU,gBAAgB,EAAE;AAEpC,QAAM;;AAGR,MAAK,IAAI,aAAa,GAAG,aAAa,KAAK,QAAQ,CAAC,QAAQ,cAAc;EACxE,MAAM,QAAQ,KAAK,QAAQ,CAAC;EAC5B,MAAM,cAAc,aAAa;EAEjC,IAAIC;AACJ,MAAI;AACF,mBAAgB,YACd,MAAM,iBAAiB,EACvB,MAAM,aAAa,EACnB,aACA,gBACD;WACM,GAAG;AACV,OAAI,aAAa,YACf,OAAM,UAAU,gBAAgB,EAAE;AAEpC,SAAM;;EAGR,MAAMC,mBAAgC,cAAc,KAAK,cAAc,gBAAgB;GACrF,MAAM,SAAS,OAAO,IAAI,aAAa;AACvC,UAAO,IAAI,UACT,YACA,YACA,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,aACA,MAAM,iBAAiB,EACvB,OACD;IACD;AAEF,eAAa,KAAK,iBAAiB;;AAGrC,QAAO;;AAUT,SAAS,cAAc,QAA6B;CAClD,IAAI,aAAa;CACjB,IAAI,iBAAiB;CACrB,IAAI,aAAa;AAEjB,KAAI,OAAO,WAAW,EACpB,OAAM,IAAI,UAAU,cAAc,YAAY;CAGhD,IAAI,YAAY;CAChB,MAAMC,SAAkB,EAAE;CAC1B,IAAI,YAAY;AAEhB,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AAErB,MAAI,MAAM,GAAG;AAEX,gBAAa,MAAM,YAAY;AAC/B,gBAAa,MAAM,YAAY;AAC/B,oBAAiB,MAAM,gBAAgB;AACvC,eAAY,MAAM,OAAO,CAAC,KAAK;aAI7B,MAAM,YAAY,KAAK,cACvB,MAAM,gBAAgB,KAAK,kBAC3B,MAAM,YAAY,KAAK,cACvB,MAAM,OAAO,CAAC,KAAK,KAAK,UAExB,OAAM,IAAI,UAAU,cAAc,gBAAgB;EAKtD,IAAI,aAAa;AACjB,OAAK,MAAM,SAAS,OAClB,KAAI,MAAM,YAAY,KAAK,MAAM,YAAY;AAC3C,gBAAa;AACb,OAAI,MAAM,iBAAiB,KAAK,MAAM,gBACpC,OAAM,IAAI,UAAU,cAAc,uBAAuB;AAE3D,QAAK,MAAM,eAAe,MAAM,cAC9B,KAAI,MAAM,aAAa,KAAK,YAC1B,OAAM,IAAI,UAAU,cAAc,qBAAqB;AAG3D,OAAI,MAAM,cAAc,SAAS,MAAM,iBAAiB;AACtD,UAAM,cAAc,KAAK,MAAM,aAAa,CAAC;AAC7C,UAAM,aAAa,KAAK,MAAM,OAAO,CAAC,OAAO,CAAC;;;AAKpD,MAAI,CAAC,YAAY;GACf,MAAMC,IAAW;IACf,YAAY,MAAM,YAAY;IAC9B,iBAAiB,MAAM,iBAAiB;IACxC,eAAe,CAAC,MAAM,aAAa,CAAC;IACpC,cAAc,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC;IACtC;AACD,UAAO,KAAK,EAAE;AACd;;;AAKJ,KAAI,YAAY,eACd,OAAM,IAAI,UAAU,cAAc,gBAAgB;CAMpD,MAAMC,gBAA0B,EAAE;CAClC,MAAMC,eAA6B,EAAE;AAErC,MAAK,MAAM,SAAS,QAAQ;AAE1B,MAAI,MAAM,cAAc,SAAS,MAAM,gBACrC;AAIF,MAAI;GACF,MAAM,mBAAmB,MAAM,aAAa,KAAK,MAAM,EAAE,SAAS,CAAC;GACnE,MAAM,cAAc,cAAc,MAAM,eAAe,iBAAiB;AACxE,iBAAc,KAAK,MAAM,WAAW;AACpC,gBAAa,KAAK,YAAY;UACxB;AAEN;;AAIF,MAAI,cAAc,WAAW,eAC3B;;AAKJ,KAAI,cAAc,SAAS,eACzB,OAAM,IAAI,UAAU,cAAc,gBAAgB;CAIpD,IAAIC;AACJ,KAAI;AACF,qBAAmB,cAAc,eAAe,aAAa;UACtD,GAAG;AACV,MAAI,aAAa,YACf,OAAM,UAAU,gBAAgB,EAAE;AAEpC,QAAM;;AAGR,QAAO,OAAO,IAAI,iBAAiB;;;;;;;;ACjTrC,MAAa,iBAAiBC;;;;AAK9B,MAAa,iBAAiBC;;;;AAK9B,MAAa,kBAAkBC;;;;AAK/B,MAAa,mBAAmB;;;;AAKhC,MAAa,sBAAsB;;;;AAKnC,MAAa,2BAA2B,sBAAsB"}
1	+ {"version":3,"file":"index.mjs","names":["MAX_SHARE_COUNT","SHAMIR_MIN_SECRET_LEN","SHAMIR_MAX_SECRET_LEN","SHAMIR_MAX_SHARE_COUNT"],"sources":["../src/error.ts","../src/secret.ts","../src/spec.ts","../src/share.ts","../src/encoding.ts","../src/index.ts"],"sourcesContent":["/*\n Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n \n /\n\n// Ported from bc-sskr-rust/src/error.rs\n\nimport type { ShamirError } from \"@bcts/shamir\";\n\n/*\n Error types for SSKR operations.\n /\nexport enum SSKRErrorType {\n DuplicateMemberIndex = \"DuplicateMemberIndex\",\n GroupSpecInvalid = \"GroupSpecInvalid\",\n GroupCountInvalid = \"GroupCountInvalid\",\n GroupThresholdInvalid = \"GroupThresholdInvalid\",\n MemberCountInvalid = \"MemberCountInvalid\",\n MemberThresholdInvalid = \"MemberThresholdInvalid\",\n NotEnoughGroups = \"NotEnoughGroups\",\n SecretLengthNotEven = \"SecretLengthNotEven\",\n SecretTooLong = \"SecretTooLong\",\n SecretTooShort = \"SecretTooShort\",\n ShareLengthInvalid = \"ShareLengthInvalid\",\n ShareReservedBitsInvalid = \"ShareReservedBitsInvalid\",\n SharesEmpty = \"SharesEmpty\",\n ShareSetInvalid = \"ShareSetInvalid\",\n ShamirError = \"ShamirError\",\n}\n\n/\n Error class for SSKR operations.\n /\nexport class SSKRError extends Error {\n readonly type: SSKRErrorType;\n readonly shamirError?: ShamirError \| undefined;\n\n constructor(type: SSKRErrorType, message?: string, shamirError?: ShamirError) {\n super(message ?? SSKRError.defaultMessage(type, shamirError));\n this.type = type;\n this.shamirError = shamirError;\n this.name = \"SSKRError\";\n }\n\n private static defaultMessage(type: SSKRErrorType, shamirError?: ShamirError): string {\n switch (type) {\n case SSKRErrorType.DuplicateMemberIndex:\n return \"When combining shares, the provided shares contained a duplicate member index\";\n case SSKRErrorType.GroupSpecInvalid:\n return \"Invalid group specification.\";\n case SSKRErrorType.GroupCountInvalid:\n return \"When creating a split spec, the group count is invalid\";\n case SSKRErrorType.GroupThresholdInvalid:\n return \"SSKR group threshold is invalid\";\n case SSKRErrorType.MemberCountInvalid:\n return \"SSKR member count is invalid\";\n case SSKRErrorType.MemberThresholdInvalid:\n return \"SSKR member threshold is invalid\";\n case SSKRErrorType.NotEnoughGroups:\n return \"SSKR shares did not contain enough groups\";\n case SSKRErrorType.SecretLengthNotEven:\n return \"SSKR secret is not of even length\";\n case SSKRErrorType.SecretTooLong:\n return \"SSKR secret is too long\";\n case SSKRErrorType.SecretTooShort:\n return \"SSKR secret is too short\";\n case SSKRErrorType.ShareLengthInvalid:\n return \"SSKR shares did not contain enough serialized bytes\";\n case SSKRErrorType.ShareReservedBitsInvalid:\n return \"SSKR shares contained invalid reserved bits\";\n case SSKRErrorType.SharesEmpty:\n return \"SSKR shares were empty\";\n case SSKRErrorType.ShareSetInvalid:\n return \"SSKR shares were invalid\";\n case SSKRErrorType.ShamirError:\n return shamirError != null\n ? `SSKR Shamir error: ${shamirError.message}`\n : \"SSKR Shamir error\";\n }\n }\n\n static fromShamirError(error: ShamirError): SSKRError {\n return new SSKRError(SSKRErrorType.ShamirError, undefined, error);\n }\n}\n\n/\n Mirrors Rust's `Result<T, Error>` (`bc-sskr-rust/src/error.rs:54`).\n \n The TypeScript port surfaces failures by throwing {@link SSKRError}\n * rather than returning a sum type, so this alias is a no-op\n * (`SSKRResult<T>` ≡ `T`). It is kept so signatures published in\n * `@bcts/sskr` remain visually parallel to their Rust counterparts.\n /\nexport type SSKRResult<T> = T;\n","/\n Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n \n /\n\n// Ported from bc-sskr-rust/src/secret.rs\n\nimport { MIN_SECRET_LEN, MAX_SECRET_LEN } from \"./index.js\";\nimport { SSKRError, SSKRErrorType } from \"./error.js\";\n\n/*\n A secret to be split into shares.\n /\nexport class Secret {\n private readonly data: Uint8Array;\n\n private constructor(data: Uint8Array) {\n this.data = data;\n }\n\n /\n Creates a new Secret instance with the given data.\n \n @param data - The secret data to be split into shares.\n * @returns A new Secret instance.\n * @throws SSKRError if the length of the secret is less than\n * MIN_SECRET_LEN, greater than MAX_SECRET_LEN, or not even.\n /\n static new(data: Uint8Array \| string): Secret {\n const bytes = typeof data === \"string\" ? new TextEncoder().encode(data) : data;\n const len = bytes.length;\n\n if (len < MIN_SECRET_LEN) {\n throw new SSKRError(SSKRErrorType.SecretTooShort);\n }\n if (len > MAX_SECRET_LEN) {\n throw new SSKRError(SSKRErrorType.SecretTooLong);\n }\n if ((len & 1) !== 0) {\n throw new SSKRError(SSKRErrorType.SecretLengthNotEven);\n }\n\n return new Secret(new Uint8Array(bytes));\n }\n\n /\n Returns the length of the secret.\n /\n len(): number {\n return this.data.length;\n }\n\n /\n Returns true if the secret is empty.\n /\n isEmpty(): boolean {\n return this.len() === 0;\n }\n\n /\n Returns a reference to the secret data.\n \n Mirrors Rust's `Secret::data(&self) -> &[u8]`\n * (`bc-sskr-rust/src/secret.rs:43`).\n /\n getData(): Uint8Array {\n return this.data;\n }\n\n /\n Returns the secret data as a Uint8Array.\n \n Mirrors Rust's `impl AsRef<[u8]> for Secret`\n * (`bc-sskr-rust/src/secret.rs:46-49`). In Rust, `as_ref()` is\n * provided via the `AsRef<[u8]>` trait, which lets the `Secret` flow\n * naturally through any API expecting `impl AsRef<[u8]>`. TypeScript\n * has no equivalent of that trait, so we expose the same backing\n * buffer through both {@link getData} (the field accessor) and\n * `asRef` (the trait-style accessor) for ergonomic parity. Callers\n * may pick whichever name reads better at the call site.\n /\n asRef(): Uint8Array {\n return this.data;\n }\n\n /\n Check equality with another Secret.\n /\n equals(other: Secret): boolean {\n if (this.data.length !== other.data.length) {\n return false;\n }\n for (let i = 0; i < this.data.length; i++) {\n if (this.data[i] !== other.data[i]) {\n return false;\n }\n }\n return true;\n }\n\n /\n Clone the secret.\n /\n clone(): Secret {\n return new Secret(new Uint8Array(this.data));\n }\n}\n","/\n Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n \n /\n\n// Ported from bc-sskr-rust/src/spec.rs\n\nimport { MAX_SHARE_COUNT } from \"@bcts/shamir\";\nimport { SSKRError, SSKRErrorType } from \"./error.js\";\n\n/*\n Strictly parses a non-negative integer string the way Rust's\n * `<usize as FromStr>::from_str` does (`bc-sskr-rust/src/spec.rs:102, 108`).\n \n Accepts an optional leading `+` followed by one or more decimal digits.\n * Rejects whitespace, decimals (`\"2.5\"`), trailing characters (`\"2x\"`),\n * the `-` sign, and the empty string. Returns `undefined` on rejection so\n * callers surface the appropriate `GroupSpecInvalid` error in the same\n * spot Rust's `?` would.\n /\nconst STRICT_USIZE_RE = /^\\+?\\d+$/;\nfunction parseStrictUsize(s: string): number \| undefined {\n if (!STRICT_USIZE_RE.test(s)) return undefined;\n const n = Number(s);\n // `Number.isSafeInteger` rejects values outside ±2^53; usize on\n // 64-bit Rust covers a larger range but for SSKR's `member_count`\n // (capped at 16) this is far beyond any meaningful input.\n return Number.isSafeInteger(n) ? n : undefined;\n}\n\n/\n A specification for a group of shares within an SSKR split.\n /\nexport class GroupSpec {\n private readonly _memberThreshold: number;\n private readonly _memberCount: number;\n\n private constructor(memberThreshold: number, memberCount: number) {\n this._memberThreshold = memberThreshold;\n this._memberCount = memberCount;\n }\n\n /\n Creates a new GroupSpec instance with the given member threshold and count.\n \n @param memberThreshold - The minimum number of member shares required to\n * reconstruct the secret within the group.\n * @param memberCount - The total number of member shares in the group.\n * @returns A new GroupSpec instance.\n * @throws SSKRError if the member count is zero, if the member count is\n * greater than the maximum share count, or if the member threshold is\n * greater than the member count.\n /\n static new(memberThreshold: number, memberCount: number): GroupSpec {\n if (memberCount === 0) {\n throw new SSKRError(SSKRErrorType.MemberCountInvalid);\n }\n if (memberCount > MAX_SHARE_COUNT) {\n throw new SSKRError(SSKRErrorType.MemberCountInvalid);\n }\n if (memberThreshold > memberCount) {\n throw new SSKRError(SSKRErrorType.MemberThresholdInvalid);\n }\n return new GroupSpec(memberThreshold, memberCount);\n }\n\n /\n Returns the member share threshold for this group.\n /\n memberThreshold(): number {\n return this._memberThreshold;\n }\n\n /\n Returns the number of member shares in this group.\n /\n memberCount(): number {\n return this._memberCount;\n }\n\n /\n Parses a group specification from a string.\n * Format: `\"M-of-N\"` where `M` is the threshold and `N` is the count.\n \n Mirrors Rust's `GroupSpec::parse` (`bc-sskr-rust/src/spec.rs:97-112`),\n * which calls `parts[0].parse::<usize>()`. Rust's `usize::FromStr` is\n * strict: it rejects whitespace, decimals, trailing characters, and the\n * `-` sign, accepting only an optional `+` prefix followed by digits.\n * We mirror that with the regex `^\\+?\\d+$` so strings like `\"2.5\"`,\n * `\"2x\"`, `\" 2\"`, `\"-2\"`, and `\"\"` all surface\n * {@link SSKRErrorType.GroupSpecInvalid} on both sides.\n /\n static parse(s: string): GroupSpec {\n const parts = s.split(\"-\");\n if (parts.length !== 3) {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n const memberThreshold = parseStrictUsize(parts[0]);\n if (memberThreshold === undefined) {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n if (parts[1] !== \"of\") {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n const memberCount = parseStrictUsize(parts[2]);\n if (memberCount === undefined) {\n throw new SSKRError(SSKRErrorType.GroupSpecInvalid);\n }\n\n return GroupSpec.new(memberThreshold, memberCount);\n }\n\n /\n Creates a default GroupSpec (1-of-1).\n /\n static default(): GroupSpec {\n return GroupSpec.new(1, 1);\n }\n\n /\n Returns a string representation of the group spec.\n /\n toString(): string {\n return `${this._memberThreshold}-of-${this._memberCount}`;\n }\n}\n\n/\n A specification for an SSKR split.\n /\nexport class Spec {\n private readonly _groupThreshold: number;\n private readonly _groups: GroupSpec[];\n\n private constructor(groupThreshold: number, groups: GroupSpec[]) {\n this._groupThreshold = groupThreshold;\n this._groups = groups;\n }\n\n /\n Creates a new Spec instance with the given group threshold and groups.\n \n @param groupThreshold - The minimum number of groups required to\n * reconstruct the secret.\n * @param groups - The list of GroupSpec instances that define the groups\n * and their members.\n * @returns A new Spec instance.\n * @throws SSKRError if the group threshold is zero, if the group threshold\n * is greater than the number of groups, or if the number of groups is\n * greater than the maximum share count.\n /\n static new(groupThreshold: number, groups: GroupSpec[]): Spec {\n if (groupThreshold === 0) {\n throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);\n }\n if (groupThreshold > groups.length) {\n throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);\n }\n if (groups.length > MAX_SHARE_COUNT) {\n throw new SSKRError(SSKRErrorType.GroupCountInvalid);\n }\n return new Spec(groupThreshold, groups);\n }\n\n /\n Returns the group threshold.\n /\n groupThreshold(): number {\n return this._groupThreshold;\n }\n\n /\n Returns a slice of the group specifications.\n /\n groups(): GroupSpec[] {\n return this._groups;\n }\n\n /\n Returns the number of groups.\n /\n groupCount(): number {\n return this._groups.length;\n }\n\n /\n Returns the total number of shares across all groups.\n /\n shareCount(): number {\n return this._groups.reduce((sum, g) => sum + g.memberCount(), 0);\n }\n}\n","/\n Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n \n /\n\n// Ported from bc-sskr-rust/src/share.rs\n\nimport type { Secret } from \"./secret.js\";\n\n/*\n A share in the SSKR scheme.\n /\nexport class SSKRShare {\n private readonly _identifier: number;\n private readonly _groupIndex: number;\n private readonly _groupThreshold: number;\n private readonly _groupCount: number;\n private readonly _memberIndex: number;\n private readonly _memberThreshold: number;\n private readonly _value: Secret;\n\n constructor(\n identifier: number,\n groupIndex: number,\n groupThreshold: number,\n groupCount: number,\n memberIndex: number,\n memberThreshold: number,\n value: Secret,\n ) {\n this._identifier = identifier;\n this._groupIndex = groupIndex;\n this._groupThreshold = groupThreshold;\n this._groupCount = groupCount;\n this._memberIndex = memberIndex;\n this._memberThreshold = memberThreshold;\n this._value = value;\n }\n\n identifier(): number {\n return this._identifier;\n }\n\n groupIndex(): number {\n return this._groupIndex;\n }\n\n groupThreshold(): number {\n return this._groupThreshold;\n }\n\n groupCount(): number {\n return this._groupCount;\n }\n\n memberIndex(): number {\n return this._memberIndex;\n }\n\n memberThreshold(): number {\n return this._memberThreshold;\n }\n\n value(): Secret {\n return this._value;\n }\n}\n","/\n Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n \n /\n\n// Ported from bc-sskr-rust/src/encoding.rs\n\nimport type { RandomNumberGenerator } from \"@bcts/rand\";\nimport { SecureRandomNumberGenerator } from \"@bcts/rand\";\nimport { splitSecret, recoverSecret, ShamirError } from \"@bcts/shamir\";\n\nimport { SSKRError, SSKRErrorType } from \"./error.js\";\nimport { Secret } from \"./secret.js\";\nimport type { Spec } from \"./spec.js\";\nimport { SSKRShare } from \"./share.js\";\nimport { METADATA_SIZE_BYTES } from \"./index.js\";\n\n/*\n Generates SSKR shares for the given Spec and Secret.\n \n @param spec - The Spec instance that defines the group and member thresholds.\n * @param masterSecret - The Secret instance to be split into shares.\n * @returns A vector of groups, each containing a vector of shares,\n * each of which is a Uint8Array.\n /\nexport function sskrGenerate(spec: Spec, masterSecret: Secret): Uint8Array[][] {\n const rng = new SecureRandomNumberGenerator();\n return sskrGenerateUsing(spec, masterSecret, rng);\n}\n\n/\n Generates SSKR shares for the given Spec and Secret using the provided\n * random number generator.\n \n @param spec - The Spec instance that defines the group and member thresholds.\n * @param masterSecret - The Secret instance to be split into shares.\n * @param randomGenerator - The random number generator to use for generating\n * shares.\n * @returns A vector of groups, each containing a vector of shares,\n * each of which is a Uint8Array.\n /\nexport function sskrGenerateUsing(\n spec: Spec,\n masterSecret: Secret,\n randomGenerator: RandomNumberGenerator,\n): Uint8Array[][] {\n const groupsShares = generateShares(spec, masterSecret, randomGenerator);\n\n const result: Uint8Array[][] = groupsShares.map((group) => group.map(serializeShare));\n\n return result;\n}\n\n/\n Combines the given SSKR shares into a Secret.\n \n @param shares - A array of SSKR shares to be combined.\n * @returns The reconstructed Secret.\n * @throws SSKRError if the shares do not meet the necessary quorum of groups\n * and member shares within each group.\n /\nexport function sskrCombine(shares: Uint8Array[]): Secret {\n const sskrShares: SSKRShare[] = [];\n\n for (const share of shares) {\n const sskrShare = deserializeShare(share);\n sskrShares.push(sskrShare);\n }\n\n return combineShares(sskrShares);\n}\n\nfunction serializeShare(share: SSKRShare): Uint8Array {\n // pack the id, group and member data into 5 bytes:\n // 76543210 76543210 76543210\n // 76543210 76543210\n // ----------------====----====----====----\n // identifier: 16\n // group-threshold: 4\n // group-count: 4\n // group-index: 4\n // member-threshold: 4\n // reserved (MUST be zero): 4\n // member-index: 4\n\n const valueData = share.value().getData();\n const result = new Uint8Array(valueData.length + METADATA_SIZE_BYTES);\n\n const id = share.identifier();\n const gt = (share.groupThreshold() - 1) & 0xf;\n const gc = (share.groupCount() - 1) & 0xf;\n const gi = share.groupIndex() & 0xf;\n const mt = (share.memberThreshold() - 1) & 0xf;\n const mi = share.memberIndex() & 0xf;\n\n const id1 = id >> 8;\n const id2 = id & 0xff;\n\n result[0] = id1;\n result[1] = id2;\n result[2] = (gt << 4) \| gc;\n result[3] = (gi << 4) \| mt;\n result[4] = mi;\n result.set(valueData, METADATA_SIZE_BYTES);\n\n return result;\n}\n\nfunction deserializeShare(source: Uint8Array): SSKRShare {\n if (source.length < METADATA_SIZE_BYTES) {\n throw new SSKRError(SSKRErrorType.ShareLengthInvalid);\n }\n\n const groupThreshold = (source[2] >> 4) + 1;\n const groupCount = (source[2] & 0xf) + 1;\n\n if (groupThreshold > groupCount) {\n throw new SSKRError(SSKRErrorType.GroupThresholdInvalid);\n }\n\n const identifier = (source[0] << 8) \| source[1];\n const groupIndex = source[3] >> 4;\n const memberThreshold = (source[3] & 0xf) + 1;\n const reserved = source[4] >> 4;\n if (reserved !== 0) {\n throw new SSKRError(SSKRErrorType.ShareReservedBitsInvalid);\n }\n const memberIndex = source[4] & 0xf;\n const value = Secret.new(source.subarray(METADATA_SIZE_BYTES));\n\n return new SSKRShare(\n identifier,\n groupIndex,\n groupThreshold,\n groupCount,\n memberIndex,\n memberThreshold,\n value,\n );\n}\n\nfunction generateShares(\n spec: Spec,\n masterSecret: Secret,\n randomGenerator: RandomNumberGenerator,\n): SSKRShare[][] {\n // assign a random identifier\n const identifierBytes = new Uint8Array(2);\n randomGenerator.fillRandomData(identifierBytes);\n const identifier = (identifierBytes[0] << 8) \| identifierBytes[1];\n\n const groupsShares: SSKRShare[][] = [];\n\n let groupSecrets: Uint8Array[];\n try {\n groupSecrets = splitSecret(\n spec.groupThreshold(),\n spec.groupCount(),\n masterSecret.getData(),\n randomGenerator,\n );\n } catch (e) {\n if (e instanceof ShamirError) {\n throw SSKRError.fromShamirError(e);\n }\n throw e;\n }\n\n for (let groupIndex = 0; groupIndex < spec.groups().length; groupIndex++) {\n const group = spec.groups()[groupIndex];\n const groupSecret = groupSecrets[groupIndex];\n\n let memberSecrets: Uint8Array[];\n try {\n memberSecrets = splitSecret(\n group.memberThreshold(),\n group.memberCount(),\n groupSecret,\n randomGenerator,\n );\n } catch (e) {\n if (e instanceof ShamirError) {\n throw SSKRError.fromShamirError(e);\n }\n throw e;\n }\n\n const memberSSKRShares: SSKRShare[] = memberSecrets.map((memberSecret, memberIndex) => {\n const secret = Secret.new(memberSecret);\n return new SSKRShare(\n identifier,\n groupIndex,\n spec.groupThreshold(),\n spec.groupCount(),\n memberIndex,\n group.memberThreshold(),\n secret,\n );\n });\n\n groupsShares.push(memberSSKRShares);\n }\n\n return groupsShares;\n}\n\ninterface Group {\n groupIndex: number;\n memberThreshold: number;\n memberIndexes: number[];\n memberShares: Secret[];\n}\n\nfunction combineShares(shares: SSKRShare[]): Secret {\n let identifier = 0;\n let groupThreshold = 0;\n let groupCount = 0;\n\n if (shares.length === 0) {\n throw new SSKRError(SSKRErrorType.SharesEmpty);\n }\n\n let nextGroup = 0;\n const groups: Group[] = [];\n let secretLen = 0;\n\n for (let i = 0; i < shares.length; i++) {\n const share = shares[i];\n\n if (i === 0) {\n // on the first one, establish expected values for common metadata\n identifier = share.identifier();\n groupCount = share.groupCount();\n groupThreshold = share.groupThreshold();\n secretLen = share.value().len();\n } else {\n // on subsequent shares, check that common metadata matches\n if (\n share.identifier() !== identifier \|\|\n share.groupThreshold() !== groupThreshold \|\|\n share.groupCount() !== groupCount \|\|\n share.value().len() !== secretLen\n ) {\n throw new SSKRError(SSKRErrorType.ShareSetInvalid);\n }\n }\n\n // sort shares into member groups\n let groupFound = false;\n for (const group of groups) {\n if (share.groupIndex() === group.groupIndex) {\n groupFound = true;\n if (share.memberThreshold() !== group.memberThreshold) {\n throw new SSKRError(SSKRErrorType.MemberThresholdInvalid);\n }\n for (const memberIndex of group.memberIndexes) {\n if (share.memberIndex() === memberIndex) {\n throw new SSKRError(SSKRErrorType.DuplicateMemberIndex);\n }\n }\n if (group.memberIndexes.length < group.memberThreshold) {\n group.memberIndexes.push(share.memberIndex());\n group.memberShares.push(share.value().clone());\n }\n }\n }\n\n if (!groupFound) {\n const g: Group = {\n groupIndex: share.groupIndex(),\n memberThreshold: share.memberThreshold(),\n memberIndexes: [share.memberIndex()],\n memberShares: [share.value().clone()],\n };\n groups.push(g);\n nextGroup++;\n }\n }\n\n // Check that we have enough groups to recover the master secret\n if (nextGroup < groupThreshold) {\n throw new SSKRError(SSKRErrorType.NotEnoughGroups);\n }\n\n // Here, all of the shares are unpacked into member groups. Now we go\n // through each group and recover the group secret, and then use the\n // result to recover the master secret\n const masterIndexes: number[] = [];\n const masterShares: Uint8Array[] = [];\n\n for (const group of groups) {\n // Only attempt to recover the group secret if we have enough shares\n if (group.memberIndexes.length < group.memberThreshold) {\n continue;\n }\n\n // Recover the group secret. Mirrors Rust's `if let Ok(group_secret)\n // = recover_secret(...)` (`bc-sskr-rust/src/encoding.rs:289-294`):\n // we silently skip groups whose Shamir recovery fails (the\n // seedtool-cli #6 fix), but rethrow any non-Shamir error* so\n // unexpected exceptions don't get swallowed — Rust's match-by-Result\n // already enforces that distinction at the type level.\n try {\n const memberSharesData = group.memberShares.map((s) => s.getData());\n const groupSecret = recoverSecret(group.memberIndexes, memberSharesData);\n masterIndexes.push(group.groupIndex);\n masterShares.push(groupSecret);\n } catch (e) {\n if (e instanceof ShamirError) {\n // Equivalent to Rust's \"Err arm\" of `if let Ok` — the seedtool\n // #6 fix demands we keep iterating to other groups.\n continue;\n }\n throw e;\n }\n\n // Stop if we have enough groups to recover the master secret\n if (masterIndexes.length === groupThreshold) {\n break;\n }\n }\n\n // If we don't have enough groups to recover the master secret, return an error\n if (masterIndexes.length < groupThreshold) {\n throw new SSKRError(SSKRErrorType.NotEnoughGroups);\n }\n\n // Recover the master secret\n let masterSecretData: Uint8Array;\n try {\n masterSecretData = recoverSecret(masterIndexes, masterShares);\n } catch (e) {\n if (e instanceof ShamirError) {\n throw SSKRError.fromShamirError(e);\n }\n throw e;\n }\n\n return Secret.new(masterSecretData);\n}\n","/*\n Copyright © 2023-2026 Blockchain Commons, LLC\n * Copyright © 2025-2026 Parity Technologies\n \n /\n\n// Blockchain Commons Sharded Secret Key Reconstruction (SSKR)\n// Ported from bc-sskr-rust\n//\n// Sharded Secret Key Reconstruction (SSKR) is a protocol for splitting a\n// secret into a set of shares across one or more groups, such that the\n// secret can be reconstructed from any combination of shares totaling or\n// exceeding a threshold number of shares within each group and across all\n// groups. SSKR is a generalization of Shamir's Secret Sharing (SSS) that\n// allows for multiple groups and multiple thresholds.\n\nimport {\n MIN_SECRET_LEN as SHAMIR_MIN_SECRET_LEN,\n MAX_SECRET_LEN as SHAMIR_MAX_SECRET_LEN,\n MAX_SHARE_COUNT as SHAMIR_MAX_SHARE_COUNT,\n} from \"@bcts/shamir\";\n\n/*\n The minimum length of a secret.\n /\nexport const MIN_SECRET_LEN = SHAMIR_MIN_SECRET_LEN;\n\n/\n The maximum length of a secret.\n /\nexport const MAX_SECRET_LEN = SHAMIR_MAX_SECRET_LEN;\n\n/\n The maximum number of shares that can be generated from a secret.\n /\nexport const MAX_SHARE_COUNT = SHAMIR_MAX_SHARE_COUNT;\n\n/\n The maximum number of groups in a split.\n /\nexport const MAX_GROUPS_COUNT = MAX_SHARE_COUNT;\n\n/\n The number of bytes used to encode the metadata for a share.\n /\nexport const METADATA_SIZE_BYTES = 5;\n\n/\n The minimum number of bytes required to encode a share.\n */\nexport const MIN_SERIALIZE_SIZE_BYTES = METADATA_SIZE_BYTES + MIN_SECRET_LEN;\n\n// Error types\nexport { SSKRError, SSKRErrorType, type SSKRResult } from \"./error.js\";\n\n// Secret\nexport { Secret } from \"./secret.js\";\n\n// Specifications\nexport { GroupSpec, Spec } from \"./spec.js\";\n\n// Encoding/Decoding\nexport { sskrGenerate, sskrGenerateUsing, sskrCombine } from \"./encoding.js\";\n"],"mappings":";;;;;;AAaA,IAAY,gBAAL,yBAAA,eAAA;AACL,eAAA,0BAAA;AACA,eAAA,sBAAA;AACA,eAAA,uBAAA;AACA,eAAA,2BAAA;AACA,eAAA,wBAAA;AACA,eAAA,4BAAA;AACA,eAAA,qBAAA;AACA,eAAA,yBAAA;AACA,eAAA,mBAAA;AACA,eAAA,oBAAA;AACA,eAAA,wBAAA;AACA,eAAA,8BAAA;AACA,eAAA,iBAAA;AACA,eAAA,qBAAA;AACA,eAAA,iBAAA;;KACD;;;;AAKD,IAAa,YAAb,MAAa,kBAAkB,MAAM;CACnC;CACA;CAEA,YAAY,MAAqB,SAAkB,aAA2B;AAC5E,QAAM,WAAW,UAAU,eAAe,MAAM,YAAY,CAAC;AAC7D,OAAK,OAAO;AACZ,OAAK,cAAc;AACnB,OAAK,OAAO;;CAGd,OAAe,eAAe,MAAqB,aAAmC;AACpF,UAAQ,MAAR;GACE,KAAA,uBACE,QAAO;GACT,KAAA,mBACE,QAAO;GACT,KAAA,oBACE,QAAO;GACT,KAAA,wBACE,QAAO;GACT,KAAA,qBACE,QAAO;GACT,KAAA,yBACE,QAAO;GACT,KAAA,kBACE,QAAO;GACT,KAAA,sBACE,QAAO;GACT,KAAA,gBACE,QAAO;GACT,KAAA,iBACE,QAAO;GACT,KAAA,qBACE,QAAO;GACT,KAAA,2BACE,QAAO;GACT,KAAA,cACE,QAAO;GACT,KAAA,kBACE,QAAO;GACT,KAAA,cACE,QAAO,eAAe,OAClB,sBAAsB,YAAY,YAClC;;;CAIV,OAAO,gBAAgB,OAA+B;AACpD,SAAO,IAAI,UAAA,eAAqC,KAAA,GAAW,MAAM;;;;;;;;;;;;;ACrErE,IAAa,SAAb,MAAa,OAAO;CAClB;CAEA,YAAoB,MAAkB;AACpC,OAAK,OAAO;;;;;;;;;;CAWd,OAAO,IAAI,MAAmC;EAC5C,MAAM,QAAQ,OAAO,SAAS,WAAW,IAAI,aAAa,CAAC,OAAO,KAAK,GAAG;EAC1E,MAAM,MAAM,MAAM;AAElB,MAAI,MAAM,eACR,OAAM,IAAI,UAAA,iBAAuC;AAEnD,MAAI,MAAM,eACR,OAAM,IAAI,UAAA,gBAAsC;AAElD,OAAK,MAAM,OAAO,EAChB,OAAM,IAAI,UAAA,sBAA4C;AAGxD,SAAO,IAAI,OAAO,IAAI,WAAW,MAAM,CAAC;;;;;CAM1C,MAAc;AACZ,SAAO,KAAK,KAAK;;;;;CAMnB,UAAmB;AACjB,SAAO,KAAK,KAAK,KAAK;;;;;;;;CASxB,UAAsB;AACpB,SAAO,KAAK;;;;;;;;;;;;;;CAed,QAAoB;AAClB,SAAO,KAAK;;;;;CAMd,OAAO,OAAwB;AAC7B,MAAI,KAAK,KAAK,WAAW,MAAM,KAAK,OAClC,QAAO;AAET,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,IACpC,KAAI,KAAK,KAAK,OAAO,MAAM,KAAK,GAC9B,QAAO;AAGX,SAAO;;;;;CAMT,QAAgB;AACd,SAAO,IAAI,OAAO,IAAI,WAAW,KAAK,KAAK,CAAC;;;;;;;;;;;;;;;;;;;;ACpFhD,MAAM,kBAAkB;AACxB,SAAS,iBAAiB,GAA+B;AACvD,KAAI,CAAC,gBAAgB,KAAK,EAAE,CAAE,QAAO,KAAA;CACrC,MAAM,IAAI,OAAO,EAAE;AAInB,QAAO,OAAO,cAAc,EAAE,GAAG,IAAI,KAAA;;;;;AAMvC,IAAa,YAAb,MAAa,UAAU;CACrB;CACA;CAEA,YAAoB,iBAAyB,aAAqB;AAChE,OAAK,mBAAmB;AACxB,OAAK,eAAe;;;;;;;;;;;;;CActB,OAAO,IAAI,iBAAyB,aAAgC;AAClE,MAAI,gBAAgB,EAClB,OAAM,IAAI,UAAA,qBAA2C;AAEvD,MAAI,cAAcA,kBAChB,OAAM,IAAI,UAAA,qBAA2C;AAEvD,MAAI,kBAAkB,YACpB,OAAM,IAAI,UAAA,yBAA+C;AAE3D,SAAO,IAAI,UAAU,iBAAiB,YAAY;;;;;CAMpD,kBAA0B;AACxB,SAAO,KAAK;;;;;CAMd,cAAsB;AACpB,SAAO,KAAK;;;;;;;;;;;;;;CAed,OAAO,MAAM,GAAsB;EACjC,MAAM,QAAQ,EAAE,MAAM,IAAI;AAC1B,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,UAAA,mBAAyC;EAGrD,MAAM,kBAAkB,iBAAiB,MAAM,GAAG;AAClD,MAAI,oBAAoB,KAAA,EACtB,OAAM,IAAI,UAAA,mBAAyC;AAGrD,MAAI,MAAM,OAAO,KACf,OAAM,IAAI,UAAA,mBAAyC;EAGrD,MAAM,cAAc,iBAAiB,MAAM,GAAG;AAC9C,MAAI,gBAAgB,KAAA,EAClB,OAAM,IAAI,UAAA,mBAAyC;AAGrD,SAAO,UAAU,IAAI,iBAAiB,YAAY;;;;;CAMpD,OAAO,UAAqB;AAC1B,SAAO,UAAU,IAAI,GAAG,EAAE;;;;;CAM5B,WAAmB;AACjB,SAAO,GAAG,KAAK,iBAAiB,MAAM,KAAK;;;;;;AAO/C,IAAa,OAAb,MAAa,KAAK;CAChB;CACA;CAEA,YAAoB,gBAAwB,QAAqB;AAC/D,OAAK,kBAAkB;AACvB,OAAK,UAAU;;;;;;;;;;;;;;CAejB,OAAO,IAAI,gBAAwB,QAA2B;AAC5D,MAAI,mBAAmB,EACrB,OAAM,IAAI,UAAA,wBAA8C;AAE1D,MAAI,iBAAiB,OAAO,OAC1B,OAAM,IAAI,UAAA,wBAA8C;AAE1D,MAAI,OAAO,SAASA,kBAClB,OAAM,IAAI,UAAA,oBAA0C;AAEtD,SAAO,IAAI,KAAK,gBAAgB,OAAO;;;;;CAMzC,iBAAyB;AACvB,SAAO,KAAK;;;;;CAMd,SAAsB;AACpB,SAAO,KAAK;;;;;CAMd,aAAqB;AACnB,SAAO,KAAK,QAAQ;;;;;CAMtB,aAAqB;AACnB,SAAO,KAAK,QAAQ,QAAQ,KAAK,MAAM,MAAM,EAAE,aAAa,EAAE,EAAE;;;;;;;;ACpLpE,IAAa,YAAb,MAAuB;CACrB;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,YACE,YACA,YACA,gBACA,YACA,aACA,iBACA,OACA;AACA,OAAK,cAAc;AACnB,OAAK,cAAc;AACnB,OAAK,kBAAkB;AACvB,OAAK,cAAc;AACnB,OAAK,eAAe;AACpB,OAAK,mBAAmB;AACxB,OAAK,SAAS;;CAGhB,aAAqB;AACnB,SAAO,KAAK;;CAGd,aAAqB;AACnB,SAAO,KAAK;;CAGd,iBAAyB;AACvB,SAAO,KAAK;;CAGd,aAAqB;AACnB,SAAO,KAAK;;CAGd,cAAsB;AACpB,SAAO,KAAK;;CAGd,kBAA0B;AACxB,SAAO,KAAK;;CAGd,QAAgB;AACd,SAAO,KAAK;;;;;;;;;;;;;ACvChB,SAAgB,aAAa,MAAY,cAAsC;AAE7E,QAAO,kBAAkB,MAAM,cAAc,IAD7B,6BACgC,CAAC;;;;;;;;;;;;;AAcnD,SAAgB,kBACd,MACA,cACA,iBACgB;AAKhB,QAJqB,eAAe,MAAM,cAAc,gBAEb,CAAC,KAAK,UAAU,MAAM,IAAI,eAAe,CAEvE;;;;;;;;;;AAWf,SAAgB,YAAY,QAA8B;CACxD,MAAM,aAA0B,EAAE;AAElC,MAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,YAAY,iBAAiB,MAAM;AACzC,aAAW,KAAK,UAAU;;AAG5B,QAAO,cAAc,WAAW;;AAGlC,SAAS,eAAe,OAA8B;CAapD,MAAM,YAAY,MAAM,OAAO,CAAC,SAAS;CACzC,MAAM,SAAS,IAAI,WAAW,UAAU,SAAA,EAA6B;CAErE,MAAM,KAAK,MAAM,YAAY;CAC7B,MAAM,KAAM,MAAM,gBAAgB,GAAG,IAAK;CAC1C,MAAM,KAAM,MAAM,YAAY,GAAG,IAAK;CACtC,MAAM,KAAK,MAAM,YAAY,GAAG;CAChC,MAAM,KAAM,MAAM,iBAAiB,GAAG,IAAK;CAC3C,MAAM,KAAK,MAAM,aAAa,GAAG;CAEjC,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,KAAK;AAEjB,QAAO,KAAK;AACZ,QAAO,KAAK;AACZ,QAAO,KAAM,MAAM,IAAK;AACxB,QAAO,KAAM,MAAM,IAAK;AACxB,QAAO,KAAK;AACZ,QAAO,IAAI,WAAA,EAA+B;AAE1C,QAAO;;AAGT,SAAS,iBAAiB,QAA+B;AACvD,KAAI,OAAO,SAAA,EACT,OAAM,IAAI,UAAA,qBAA2C;CAGvD,MAAM,kBAAkB,OAAO,MAAM,KAAK;CAC1C,MAAM,cAAc,OAAO,KAAK,MAAO;AAEvC,KAAI,iBAAiB,WACnB,OAAM,IAAI,UAAA,wBAA8C;CAG1D,MAAM,aAAc,OAAO,MAAM,IAAK,OAAO;CAC7C,MAAM,aAAa,OAAO,MAAM;CAChC,MAAM,mBAAmB,OAAO,KAAK,MAAO;AAE5C,KADiB,OAAO,MAAM,MACb,EACf,OAAM,IAAI,UAAA,2BAAiD;AAK7D,QAAO,IAAI,UACT,YACA,YACA,gBACA,YAPkB,OAAO,KAAK,IAS9B,iBARY,OAAO,IAAI,OAAO,SAAA,EAA6B,CAStD,CACN;;AAGH,SAAS,eACP,MACA,cACA,iBACe;CAEf,MAAM,kBAAkB,IAAI,WAAW,EAAE;AACzC,iBAAgB,eAAe,gBAAgB;CAC/C,MAAM,aAAc,gBAAgB,MAAM,IAAK,gBAAgB;CAE/D,MAAM,eAA8B,EAAE;CAEtC,IAAI;AACJ,KAAI;AACF,iBAAe,YACb,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,aAAa,SAAS,EACtB,gBACD;UACM,GAAG;AACV,MAAI,aAAa,YACf,OAAM,UAAU,gBAAgB,EAAE;AAEpC,QAAM;;AAGR,MAAK,IAAI,aAAa,GAAG,aAAa,KAAK,QAAQ,CAAC,QAAQ,cAAc;EACxE,MAAM,QAAQ,KAAK,QAAQ,CAAC;EAC5B,MAAM,cAAc,aAAa;EAEjC,IAAI;AACJ,MAAI;AACF,mBAAgB,YACd,MAAM,iBAAiB,EACvB,MAAM,aAAa,EACnB,aACA,gBACD;WACM,GAAG;AACV,OAAI,aAAa,YACf,OAAM,UAAU,gBAAgB,EAAE;AAEpC,SAAM;;EAGR,MAAM,mBAAgC,cAAc,KAAK,cAAc,gBAAgB;GACrF,MAAM,SAAS,OAAO,IAAI,aAAa;AACvC,UAAO,IAAI,UACT,YACA,YACA,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,aACA,MAAM,iBAAiB,EACvB,OACD;IACD;AAEF,eAAa,KAAK,iBAAiB;;AAGrC,QAAO;;AAUT,SAAS,cAAc,QAA6B;CAClD,IAAI,aAAa;CACjB,IAAI,iBAAiB;CACrB,IAAI,aAAa;AAEjB,KAAI,OAAO,WAAW,EACpB,OAAM,IAAI,UAAA,cAAoC;CAGhD,IAAI,YAAY;CAChB,MAAM,SAAkB,EAAE;CAC1B,IAAI,YAAY;AAEhB,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AAErB,MAAI,MAAM,GAAG;AAEX,gBAAa,MAAM,YAAY;AAC/B,gBAAa,MAAM,YAAY;AAC/B,oBAAiB,MAAM,gBAAgB;AACvC,eAAY,MAAM,OAAO,CAAC,KAAK;aAI7B,MAAM,YAAY,KAAK,cACvB,MAAM,gBAAgB,KAAK,kBAC3B,MAAM,YAAY,KAAK,cACvB,MAAM,OAAO,CAAC,KAAK,KAAK,UAExB,OAAM,IAAI,UAAA,kBAAwC;EAKtD,IAAI,aAAa;AACjB,OAAK,MAAM,SAAS,OAClB,KAAI,MAAM,YAAY,KAAK,MAAM,YAAY;AAC3C,gBAAa;AACb,OAAI,MAAM,iBAAiB,KAAK,MAAM,gBACpC,OAAM,IAAI,UAAA,yBAA+C;AAE3D,QAAK,MAAM,eAAe,MAAM,cAC9B,KAAI,MAAM,aAAa,KAAK,YAC1B,OAAM,IAAI,UAAA,uBAA6C;AAG3D,OAAI,MAAM,cAAc,SAAS,MAAM,iBAAiB;AACtD,UAAM,cAAc,KAAK,MAAM,aAAa,CAAC;AAC7C,UAAM,aAAa,KAAK,MAAM,OAAO,CAAC,OAAO,CAAC;;;AAKpD,MAAI,CAAC,YAAY;GACf,MAAM,IAAW;IACf,YAAY,MAAM,YAAY;IAC9B,iBAAiB,MAAM,iBAAiB;IACxC,eAAe,CAAC,MAAM,aAAa,CAAC;IACpC,cAAc,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC;IACtC;AACD,UAAO,KAAK,EAAE;AACd;;;AAKJ,KAAI,YAAY,eACd,OAAM,IAAI,UAAA,kBAAwC;CAMpD,MAAM,gBAA0B,EAAE;CAClC,MAAM,eAA6B,EAAE;AAErC,MAAK,MAAM,SAAS,QAAQ;AAE1B,MAAI,MAAM,cAAc,SAAS,MAAM,gBACrC;AASF,MAAI;GACF,MAAM,mBAAmB,MAAM,aAAa,KAAK,MAAM,EAAE,SAAS,CAAC;GACnE,MAAM,cAAc,cAAc,MAAM,eAAe,iBAAiB;AACxE,iBAAc,KAAK,MAAM,WAAW;AACpC,gBAAa,KAAK,YAAY;WACvB,GAAG;AACV,OAAI,aAAa,YAGf;AAEF,SAAM;;AAIR,MAAI,cAAc,WAAW,eAC3B;;AAKJ,KAAI,cAAc,SAAS,eACzB,OAAM,IAAI,UAAA,kBAAwC;CAIpD,IAAI;AACJ,KAAI;AACF,qBAAmB,cAAc,eAAe,aAAa;UACtD,GAAG;AACV,MAAI,aAAa,YACf,OAAM,UAAU,gBAAgB,EAAE;AAEpC,QAAM;;AAGR,QAAO,OAAO,IAAI,iBAAiB;;;;;;;;;;;;AC1TrC,MAAa,iBAAiBC;;;;AAK9B,MAAa,iBAAiBC;;;;AAK9B,MAAa,kBAAkBC;;;;AAK/B,MAAa,mBAAmB;;;;AAKhC,MAAa,sBAAsB;;;;AAKnC,MAAa,2BAAA,IAAiD"}

package/package.json CHANGED Viewed

@@ -1,18 +1,18 @@
 {
   "name": "@bcts/sskr",
-  "version": "1.0.0-alpha.9",
+  "version": "1.0.0-beta.0",
   "type": "module",
   "description": "Blockchain Commons Sharded Secret Key Reconstruction (SSKR) for TypeScript",
   "license": "BSD-2-Clause-Patent",
-  "author": "Leonardo Custodio <leonardo@custodio.me>",
-  "homepage": "https://github.com/leonardocustodio/bcts",
+  "author": "Parity Technologies <admin@parity.io> (https://parity.io)",
+  "homepage": "https://bcts.dev",
   "repository": {
     "type": "git",
-    "url": "https://github.com/leonardocustodio/bcts",
+    "url": "https://github.com/paritytech/bcts",
     "directory": "packages/sskr"
   },
   "bugs": {
-    "url": "https://github.com/leonardocustodio/bcts/issues"
+    "url": "https://github.com/paritytech/bcts/issues"
   },
   "main": "dist/index.cjs",
   "module": "dist/index.mjs",
@@ -33,11 +33,10 @@
   ],
   "scripts": {
     "build": "tsdown",
-    "dev": "tsdown --watch",
     "test": "vitest run",
     "test:watch": "vitest",
-    "lint": "eslint 'src/**/*.ts'",
-    "lint:fix": "eslint 'src/**/*.ts' --fix",
+    "lint": "eslint 'src/**/*.ts' 'tests/**/*.ts'",
+    "lint:fix": "eslint 'src/**/*.ts' 'tests/**/*.ts' --fix",
     "typecheck": "tsc --noEmit",
     "clean": "rm -rf dist",
     "docs": "typedoc",
@@ -57,19 +56,19 @@
     "node": ">=18.0.0"
   },
   "dependencies": {
-    "@bcts/rand": "^1.0.0-alpha.9",
-    "@bcts/shamir": "^1.0.0-alpha.9"
+    "@bcts/rand": "^1.0.0-beta.0",
+    "@bcts/shamir": "^1.0.0-beta.0"
   },
   "devDependencies": {
     "@bcts/eslint": "^0.1.0",
     "@bcts/tsconfig": "^0.1.0",
-    "@eslint/js": "^9.39.1",
-    "@types/node": "^24.10.2",
-    "eslint": "^9.39.1",
+    "@eslint/js": "^10.0.1",
+    "@types/node": "^25.6.0",
+    "eslint": "^10.2.1",
     "ts-node": "^10.9.2",
-    "tsdown": "^0.17.2",
-    "typedoc": "^0.28.15",
-    "typescript": "^5.9.3",
-    "vitest": "^3.2.4"
+    "tsdown": "^0.21.0",
+    "typedoc": "^0.28.19",
+    "typescript": "^6.0.3",
+    "vitest": "^4.1.5"
   }
 }

package/src/encoding.ts CHANGED Viewed

@@ -1,3 +1,9 @@
+/**
+ * Copyright © 2023-2026 Blockchain Commons, LLC
+ * Copyright © 2025-2026 Parity Technologies
+ *
+ */
 // Ported from bc-sskr-rust/src/encoding.rs
 import type { RandomNumberGenerator } from "@bcts/rand";
@@ -289,15 +295,24 @@ function combineShares(shares: SSKRShare[]): Secret {
       continue;
     }
-    // Recover the group secret
+    // Recover the group secret. Mirrors Rust's `if let Ok(group_secret)
+    // = recover_secret(...)` (`bc-sskr-rust/src/encoding.rs:289-294`):
+    // we silently skip groups whose Shamir recovery fails (the
+    // seedtool-cli #6 fix), but **rethrow any non-Shamir error** so
+    // unexpected exceptions don't get swallowed — Rust's match-by-Result
+    // already enforces that distinction at the type level.
     try {
       const memberSharesData = group.memberShares.map((s) => s.getData());
       const groupSecret = recoverSecret(group.memberIndexes, memberSharesData);
       masterIndexes.push(group.groupIndex);
       masterShares.push(groupSecret);
-    } catch {
-      // If we can't recover this group, just skip it
-      continue;
+    } catch (e) {
+      if (e instanceof ShamirError) {
+        // Equivalent to Rust's "Err arm" of `if let Ok` — the seedtool
+        // #6 fix demands we keep iterating to other groups.
+        continue;
+      }
+      throw e;
     }
     // Stop if we have enough groups to recover the master secret