@defuse-protocol/intents-sdk 0.51.0 → 0.52.0

package/dist/src/bridges/poa-bridge/poa-bridge-utils.cjs

@@ -40,7 +40,8 @@ const caip2Mapping = {
 	[require_caip2.Chains.Aptos]: "aptos:mainnet",
 	[require_caip2.Chains.Cardano]: "cardano:mainnet",
 	[require_caip2.Chains.Litecoin]: "ltc:mainnet",
-	[require_caip2.Chains.Starknet]: "starknet:mainnet"
+	[require_caip2.Chains.Starknet]: "starknet:mainnet",
+	[require_caip2.Chains.Aleo]: "aleo:mainnet"
 };
 function toPoaNetwork(caip2) {
 	if (caip2Mapping[caip2] == null) throw new Error(`Unsupported POA Bridge chain = ${caip2}`);
@@ -63,7 +64,8 @@ const tokenPrefixMapping = {
 	aptos: require_caip2.Chains.Aptos,
 	cardano: require_caip2.Chains.Cardano,
 	ltc: require_caip2.Chains.Litecoin,
-	starknet: require_caip2.Chains.Starknet
+	starknet: require_caip2.Chains.Starknet,
+	aleo: require_caip2.Chains.Aleo
 };
 function contractIdToCaip2(contractId) {
 	for (const [prefix, caip2] of Object.entries(tokenPrefixMapping)) if (contractId.startsWith(`${prefix}.`) || contractId.startsWith(`${prefix}-`)) return caip2;

package/dist/src/bridges/poa-bridge/poa-bridge-utils.js

@@ -39,7 +39,8 @@ const caip2Mapping = {
 	[Chains.Aptos]: "aptos:mainnet",
 	[Chains.Cardano]: "cardano:mainnet",
 	[Chains.Litecoin]: "ltc:mainnet",
-	[Chains.Starknet]: "starknet:mainnet"
+	[Chains.Starknet]: "starknet:mainnet",
+	[Chains.Aleo]: "aleo:mainnet"
 };
 function toPoaNetwork(caip2) {
 	if (caip2Mapping[caip2] == null) throw new Error(`Unsupported POA Bridge chain = ${caip2}`);
@@ -62,7 +63,8 @@ const tokenPrefixMapping = {
 	aptos: Chains.Aptos,
 	cardano: Chains.Cardano,
 	ltc: Chains.Litecoin,
-	starknet: Chains.Starknet
+	starknet: Chains.Starknet,
+	aleo: Chains.Aleo
 };
 function contractIdToCaip2(contractId) {
 	for (const [prefix, caip2] of Object.entries(tokenPrefixMapping)) if (contractId.startsWith(`${prefix}.`) || contractId.startsWith(`${prefix}-`)) return caip2;

package/dist/src/lib/caip2.cjs

@@ -34,7 +34,8 @@ const Chains = {
 	Cardano: "cip34:1-764824073",
 	Starknet: "starknet:SN_MAIN",
 	Plasma: "eip155:9745",
-	Scroll: "eip155:534352"
+	Scroll: "eip155:534352",
+	Aleo: "aleo:0"
 };
 function getEIP155ChainId(chain) {
 	(0, _defuse_protocol_internal_utils.assert)(chain.startsWith("eip155:"), "Chain is not an EIP-155 chain");

package/dist/src/lib/caip2.d.cts

@@ -32,6 +32,7 @@ declare const Chains: {
   readonly Starknet: "starknet:SN_MAIN";
   readonly Plasma: "eip155:9745";
   readonly Scroll: "eip155:534352";
+  readonly Aleo: "aleo:0";
 };
 type Chain = (typeof Chains)[keyof typeof Chains];
 //#endregion

package/dist/src/lib/caip2.d.ts

@@ -32,6 +32,7 @@ declare const Chains: {
   readonly Starknet: "starknet:SN_MAIN";
   readonly Plasma: "eip155:9745";
   readonly Scroll: "eip155:534352";
+  readonly Aleo: "aleo:0";
 };
 type Chain = (typeof Chains)[keyof typeof Chains];
 //#endregion

package/dist/src/lib/caip2.js

@@ -33,7 +33,8 @@ const Chains = {
 	Cardano: "cip34:1-764824073",
 	Starknet: "starknet:SN_MAIN",
 	Plasma: "eip155:9745",
-	Scroll: "eip155:534352"
+	Scroll: "eip155:534352",
+	Aleo: "aleo:0"
 };
 function getEIP155ChainId(chain) {
 	assert(chain.startsWith("eip155:"), "Chain is not an EIP-155 chain");

package/dist/src/lib/validateAddress.cjs

@@ -46,6 +46,7 @@ function validateAddress(address, blockchain) {
 		case require_caip2.Chains.Berachain:
 		case require_caip2.Chains.Plasma:
 		case require_caip2.Chains.Scroll: return validateEthAddress(address);
+		case require_caip2.Chains.Aleo: return validateAleoAddress(address);
 		default: return false;
 	}
 }
@@ -266,6 +267,154 @@ function validateLitecoinBech32Address(address) {
 	}
 	return false;
 }
+/** Base field modulus (= scalar field order of BLS12-377). */
+const P = 8444461749428370424248824938781546531375899335154063827935233455917409239041n;
+/** Edwards curve coefficient d.  Curve: -x² + y² = 1 + d·x²·y² (a = -1). */
+const D = 3021n;
+/** Prime-order subgroup order (= scalar field of Edwards BLS12-377, cofactor = 4). */
+const SUBGROUP_ORDER = 2111115437357092606062206234695386632838870926408408195193685246394721360383n;
+function modPow(base, exp, m) {
+	let result = 1n;
+	base = (base % m + m) % m;
+	while (exp > 0n) {
+		if (exp & 1n) result = result * base % m;
+		exp >>= 1n;
+		base = base * base % m;
+	}
+	return result;
+}
+/** Tonelli-Shanks square root in F_P. Returns null when n is a non-residue. */
+function modSqrt(n) {
+	n = (n % P + P) % P;
+	if (n === 0n) return 0n;
+	if (modPow(n, (P - 1n) / 2n, P) !== 1n) return null;
+	let s = 0;
+	let q = P - 1n;
+	while ((q & 1n) === 0n) {
+		s++;
+		q >>= 1n;
+	}
+	let z = 2n;
+	while (modPow(z, (P - 1n) / 2n, P) !== P - 1n) z++;
+	let m = s;
+	let c = modPow(z, q, P);
+	let t = modPow(n, q, P);
+	let r = modPow(n, (q + 1n) / 2n, P);
+	for (;;) {
+		if (t === 1n) return r;
+		let i = 1;
+		let tmp = t * t % P;
+		while (tmp !== 1n) {
+			tmp = tmp * tmp % P;
+			i++;
+		}
+		let b = c;
+		for (let j = 0; j < m - i - 1; j++) b = b * b % P;
+		m = i;
+		c = b * b % P;
+		t = t * c % P;
+		r = r * b % P;
+	}
+}
+const EXT_ZERO = [
+	0n,
+	1n,
+	0n,
+	1n
+];
+function extAdd(a, b) {
+	const [X1, Y1, T1, Z1] = a;
+	const [X2, Y2, T2, Z2] = b;
+	const A = X1 * X2 % P;
+	const B = Y1 * Y2 % P;
+	const C = T1 * D % P * T2 % P;
+	const Dd = Z1 * Z2 % P;
+	const E = ((X1 + Y1) % P * ((X2 + Y2) % P) % P - A - B + 2n * P) % P;
+	const F = ((Dd - C) % P + P) % P;
+	const G = (Dd + C) % P;
+	const H = (B + A) % P;
+	return [
+		E * F % P,
+		G * H % P,
+		E * H % P,
+		F * G % P
+	];
+}
+function extDouble(a) {
+	const [X, Y, _T, Z] = a;
+	const A = X * X % P;
+	const B = Y * Y % P;
+	const C = 2n * (Z * Z % P) % P;
+	const Dd = (P - A) % P;
+	const E = ((X + Y) % P * ((X + Y) % P) % P - A - B + 2n * P) % P;
+	const G = (Dd + B) % P;
+	const F = ((G - C) % P + P) % P;
+	const H = ((Dd - B) % P + P) % P;
+	return [
+		E * F % P,
+		G * H % P,
+		E * H % P,
+		F * G % P
+	];
+}
+function scalarMul(pt, scalar) {
+	let result = EXT_ZERO;
+	let base = pt;
+	let s = scalar;
+	while (s > 0n) {
+		if (s & 1n) result = extAdd(result, base);
+		base = extDouble(base);
+		s >>= 1n;
+	}
+	return result;
+}
+/** Check whether an extended point is the identity (0, 1). */
+function isIdentity(pt) {
+	return pt[0] === 0n && pt[1] === pt[3];
+}
+/**
+* Validates an Aleo address by decoding the bech32m payload, decompressing
+* the Edwards BLS12-377 point, and verifying it lies in the prime-order
+* subgroup — matching snarkVM's `Group::from_x_coordinate` exactly.
+*
+* Compressed format: x-coordinate (little-endian, 32 bytes) with y-sign
+* flag in bit 7 of byte 31.
+*/
+function validateAleoAddress(address) {
+	try {
+		const decoded = _scure_base.bech32m.decodeToBytes(address);
+		if (decoded.prefix !== "aleo") return false;
+		if (decoded.bytes.length !== 32) return false;
+		const bytes = new Uint8Array(decoded.bytes);
+		bytes[31] = bytes[31] & 127;
+		let x = 0n;
+		for (let i = 31; i >= 0; i--) x = x << 8n | BigInt(bytes[i]);
+		if (x >= P) return false;
+		const x2 = x * x % P;
+		const num = (1n + x2) % P;
+		const den = ((1n - D * x2 % P) % P + P) % P;
+		if (den === 0n) return false;
+		const y = modSqrt(num * modPow(den, P - 2n, P) % P);
+		if (y === null) return false;
+		const negY = y === 0n ? 0n : P - y;
+		const p1 = [
+			x,
+			y,
+			x * y % P,
+			1n
+		];
+		const p2 = [
+			x,
+			negY,
+			x * negY % P,
+			1n
+		];
+		for (const pt of [p1, p2]) if (isIdentity(scalarMul(pt, SUBGROUP_ORDER))) return true;
+		return false;
+	} catch {
+		return false;
+	}
+}
 
 //#endregion
 exports.validateAddress = validateAddress;

package/dist/src/lib/validateAddress.js

@@ -45,6 +45,7 @@ function validateAddress(address, blockchain) {
 		case Chains.Berachain:
 		case Chains.Plasma:
 		case Chains.Scroll: return validateEthAddress(address);
+		case Chains.Aleo: return validateAleoAddress(address);
 		default: return false;
 	}
 }
@@ -265,6 +266,154 @@ function validateLitecoinBech32Address(address) {
 	}
 	return false;
 }
+/** Base field modulus (= scalar field order of BLS12-377). */
+const P = 8444461749428370424248824938781546531375899335154063827935233455917409239041n;
+/** Edwards curve coefficient d.  Curve: -x² + y² = 1 + d·x²·y² (a = -1). */
+const D = 3021n;
+/** Prime-order subgroup order (= scalar field of Edwards BLS12-377, cofactor = 4). */
+const SUBGROUP_ORDER = 2111115437357092606062206234695386632838870926408408195193685246394721360383n;
+function modPow(base, exp, m) {
+	let result = 1n;
+	base = (base % m + m) % m;
+	while (exp > 0n) {
+		if (exp & 1n) result = result * base % m;
+		exp >>= 1n;
+		base = base * base % m;
+	}
+	return result;
+}
+/** Tonelli-Shanks square root in F_P. Returns null when n is a non-residue. */
+function modSqrt(n) {
+	n = (n % P + P) % P;
+	if (n === 0n) return 0n;
+	if (modPow(n, (P - 1n) / 2n, P) !== 1n) return null;
+	let s = 0;
+	let q = P - 1n;
+	while ((q & 1n) === 0n) {
+		s++;
+		q >>= 1n;
+	}
+	let z = 2n;
+	while (modPow(z, (P - 1n) / 2n, P) !== P - 1n) z++;
+	let m = s;
+	let c = modPow(z, q, P);
+	let t = modPow(n, q, P);
+	let r = modPow(n, (q + 1n) / 2n, P);
+	for (;;) {
+		if (t === 1n) return r;
+		let i = 1;
+		let tmp = t * t % P;
+		while (tmp !== 1n) {
+			tmp = tmp * tmp % P;
+			i++;
+		}
+		let b = c;
+		for (let j = 0; j < m - i - 1; j++) b = b * b % P;
+		m = i;
+		c = b * b % P;
+		t = t * c % P;
+		r = r * b % P;
+	}
+}
+const EXT_ZERO = [
+	0n,
+	1n,
+	0n,
+	1n
+];
+function extAdd(a, b) {
+	const [X1, Y1, T1, Z1] = a;
+	const [X2, Y2, T2, Z2] = b;
+	const A = X1 * X2 % P;
+	const B = Y1 * Y2 % P;
+	const C = T1 * D % P * T2 % P;
+	const Dd = Z1 * Z2 % P;
+	const E = ((X1 + Y1) % P * ((X2 + Y2) % P) % P - A - B + 2n * P) % P;
+	const F = ((Dd - C) % P + P) % P;
+	const G = (Dd + C) % P;
+	const H = (B + A) % P;
+	return [
+		E * F % P,
+		G * H % P,
+		E * H % P,
+		F * G % P
+	];
+}
+function extDouble(a) {
+	const [X, Y, _T, Z] = a;
+	const A = X * X % P;
+	const B = Y * Y % P;
+	const C = 2n * (Z * Z % P) % P;
+	const Dd = (P - A) % P;
+	const E = ((X + Y) % P * ((X + Y) % P) % P - A - B + 2n * P) % P;
+	const G = (Dd + B) % P;
+	const F = ((G - C) % P + P) % P;
+	const H = ((Dd - B) % P + P) % P;
+	return [
+		E * F % P,
+		G * H % P,
+		E * H % P,
+		F * G % P
+	];
+}
+function scalarMul(pt, scalar) {
+	let result = EXT_ZERO;
+	let base = pt;
+	let s = scalar;
+	while (s > 0n) {
+		if (s & 1n) result = extAdd(result, base);
+		base = extDouble(base);
+		s >>= 1n;
+	}
+	return result;
+}
+/** Check whether an extended point is the identity (0, 1). */
+function isIdentity(pt) {
+	return pt[0] === 0n && pt[1] === pt[3];
+}
+/**
+* Validates an Aleo address by decoding the bech32m payload, decompressing
+* the Edwards BLS12-377 point, and verifying it lies in the prime-order
+* subgroup — matching snarkVM's `Group::from_x_coordinate` exactly.
+*
+* Compressed format: x-coordinate (little-endian, 32 bytes) with y-sign
+* flag in bit 7 of byte 31.
+*/
+function validateAleoAddress(address) {
+	try {
+		const decoded = bech32m.decodeToBytes(address);
+		if (decoded.prefix !== "aleo") return false;
+		if (decoded.bytes.length !== 32) return false;
+		const bytes = new Uint8Array(decoded.bytes);
+		bytes[31] = bytes[31] & 127;
+		let x = 0n;
+		for (let i = 31; i >= 0; i--) x = x << 8n | BigInt(bytes[i]);
+		if (x >= P) return false;
+		const x2 = x * x % P;
+		const num = (1n + x2) % P;
+		const den = ((1n - D * x2 % P) % P + P) % P;
+		if (den === 0n) return false;
+		const y = modSqrt(num * modPow(den, P - 2n, P) % P);
+		if (y === null) return false;
+		const negY = y === 0n ? 0n : P - y;
+		const p1 = [
+			x,
+			y,
+			x * y % P,
+			1n
+		];
+		const p2 = [
+			x,
+			negY,
+			x * negY % P,
+			1n
+		];
+		for (const pt of [p1, p2]) if (isIdentity(scalarMul(pt, SUBGROUP_ORDER))) return true;
+		return false;
+	} catch {
+		return false;
+	}
+}
 
 //#endregion
 export { validateAddress };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@defuse-protocol/intents-sdk",
-  "version": "0.51.0",
+  "version": "0.52.0",
   "private": false,
   "type": "module",
   "repository": {
@@ -46,7 +46,7 @@
     "valibot": "^1.0.0",
     "viem": "^2.0.0",
     "@defuse-protocol/contract-types": "0.6.0",
-    "@defuse-protocol/internal-utils": "0.26.0"
+    "@defuse-protocol/internal-utils": "0.27.0"
   },
   "devDependencies": {
     "tsdown": "0.19.0"