@silvana-one/coordination 1.0.15

package/dist/web/base58/base58.js

@@ -0,0 +1,108 @@
+import { sha256 } from "js-sha256";
+import { changeBase } from "./bigint-helpers.js";
+export { fromBase58Check, alphabet };
+const alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz".split("");
+let inverseAlphabet = {};
+alphabet.forEach((c, i) => {
+    inverseAlphabet[c] = i;
+});
+export function toBytesWithVersionNumber(t, versionNumber) {
+    let bytes = toBytes(t, versionNumber);
+    bytes.unshift(versionNumber);
+    return bytes;
+}
+function bigIntToBytes(x, length) {
+    if (x < 0n) {
+        throw Error(`bigIntToBytes: negative numbers are not supported, got ${x}`);
+    }
+    let bytes = Array(length);
+    for (let i = 0; i < length; i++, x >>= 8n) {
+        bytes[i] = Number(x & 0xffn);
+    }
+    if (x > 0n) {
+        throw Error(`bigIntToBytes: input does not fit in ${length} bytes`);
+    }
+    return bytes;
+}
+function toBytes(t, versionNumber) {
+    if (t.length !== 2)
+        throw new Error("Expected 2 elements in t");
+    let bytes = [];
+    /*
+    let n = 2;
+    for (let i = 0; i < 2; i++) {
+      let subBytes = bigIntToBytes(t[i], 32);
+      bytes.push(...subBytes);
+    }
+      */
+    let subBytes1 = bigIntToBytes(t[0], 32);
+    subBytes1.unshift(versionNumber);
+    bytes.push(...subBytes1);
+    bytes.push(Number(t[1]));
+    return bytes;
+}
+export function toBase58Check(input, versionByte) {
+    let withVersion = [versionByte, ...input];
+    let checksum = computeChecksum(withVersion);
+    let withChecksum = withVersion.concat(checksum);
+    return toBase58(withChecksum);
+}
+function toBase58(bytes) {
+    // count the leading zeroes. these get turned into leading zeroes in the output
+    let z = 0;
+    while (bytes[z] === 0)
+        z++;
+    // for some reason, this is big-endian, so we need to reverse
+    let digits = [...bytes].map(BigInt).reverse();
+    // change base and reverse
+    let base58Digits = changeBase(digits, 256n, 58n).reverse();
+    // add leading zeroes, map into alphabet
+    base58Digits = Array(z).fill(0n).concat(base58Digits);
+    return base58Digits.map((x) => alphabet[Number(x)]).join("");
+}
+function fromBase58Check(base58, versionByte) {
+    // throws on invalid character
+    let bytes = fromBase58(base58);
+    // check checksum
+    let checksum = bytes.slice(-4);
+    let originalBytes = bytes.slice(0, -4);
+    let actualChecksum = computeChecksum(originalBytes);
+    if (!arrayEqual(checksum, actualChecksum))
+        throw Error("fromBase58Check: invalid checksum");
+    // check version byte
+    if (originalBytes[0] !== versionByte)
+        throw Error(`fromBase58Check: input version byte ${versionByte} does not match encoded version byte ${originalBytes[0]}`);
+    // return result
+    return originalBytes.slice(1);
+}
+function fromBase58(base58) {
+    let base58Digits = [...base58].map((c) => {
+        let digit = inverseAlphabet[c];
+        if (digit === undefined)
+            throw Error("fromBase58: invalid character");
+        return BigInt(digit);
+    });
+    let z = 0;
+    while (base58Digits[z] === 0n)
+        z++;
+    let digits = changeBase(base58Digits.reverse(), 58n, 256n).reverse();
+    digits = Array(z).fill(0n).concat(digits);
+    return digits.map(Number);
+}
+function computeChecksum(input) {
+    let hash1 = sha256.create();
+    hash1.update(input);
+    let hash2 = sha256.create();
+    hash2.update(hash1.array());
+    return hash2.array().slice(0, 4);
+}
+function arrayEqual(a, b) {
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=base58.js.map

package/dist/web/base58/base58.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base58.js","sourceRoot":"","sources":["../../../src/base58/base58.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnC,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC;AAErC,MAAM,QAAQ,GACZ,4DAA4D,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AACzE,IAAI,eAAe,GAA2B,EAAE,CAAC;AACjD,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;IACxB,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC,CAAC,CAAC;AAEH,MAAM,UAAU,wBAAwB,CAAC,CAAW,EAAE,aAAqB;IACzE,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACtC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,aAAa,CAAC,CAAS,EAAE,MAAc;IAC9C,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,MAAM,KAAK,CAAC,0DAA0D,CAAC,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,IAAI,KAAK,GAAa,KAAK,CAAC,MAAM,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,MAAM,KAAK,CAAC,wCAAwC,MAAM,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,OAAO,CAAC,CAAW,EAAE,aAAqB;IACjD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAEhE,IAAI,KAAK,GAAa,EAAE,CAAC;IACzB;;;;;;QAMI;IAEJ,IAAI,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACxC,SAAS,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IACjC,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IACzB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,WAAmB;IAEnB,IAAI,WAAW,GAAG,CAAC,WAAW,EAAE,GAAG,KAAK,CAAC,CAAC;IAC1C,IAAI,QAAQ,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAC5C,IAAI,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChD,OAAO,QAAQ,CAAC,YAAY,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,QAAQ,CAAC,KAA4B;IAC5C,+EAA+E;IAC/E,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAAE,CAAC,EAAE,CAAC;IAC3B,6DAA6D;IAC7D,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,0BAA0B;IAC1B,IAAI,YAAY,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;IAC3D,wCAAwC;IACxC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACtD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,eAAe,CAAC,MAAc,EAAE,WAAmB;IAC1D,8BAA8B;IAC9B,IAAI,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAC/B,iBAAiB;IACjB,IAAI,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvC,IAAI,cAAc,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,cAAc,CAAC;QACvC,MAAM,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACnD,qBAAqB;IACrB,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,WAAW;QAClC,MAAM,KAAK,CACT,uCAAuC,WAAW,wCAAwC,aAAa,CAAC,CAAC,CAAC,EAAE,CAC7G,CAAC;IACJ,gBAAgB;IAChB,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,UAAU,CAAC,MAAc;IAChC,IAAI,YAAY,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACvC,IAAI,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACtE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE;QAAE,CAAC,EAAE,CAAC;IACnC,IAAI,MAAM,GAAG,UAAU,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;IACrE,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,eAAe,CAAC,KAA4B;IACnD,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;IAC5B,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACpB,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;IAC5B,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,UAAU,CAAC,CAAY,EAAE,CAAY;IAC5C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/web/base58/bigint-helpers.d.ts

@@ -0,0 +1,24 @@
+export { changeBase, bytesToBigInt, bigIntToBytes, bigIntToBits, parseHexString32, log2, max, abs, sign, bytesToBigint32, bigintToBytes32, };
+declare function bytesToBigint32(bytes: Uint8Array): bigint;
+declare function bigintToBytes32(x: bigint, bytes: Uint8Array): Uint8Array;
+declare function bytesToBigInt(bytes: Uint8Array | number[]): bigint;
+declare function parseHexString32(input: string): bigint;
+/**
+ * Transforms bigint to little-endian array of bytes (numbers between 0 and 255) of a given length.
+ * Throws an error if the bigint doesn't fit in the given number of bytes.
+ */
+declare function bigIntToBytes(x: bigint, length?: number): number[];
+/**
+ * Transforms bigint to little-endian array of bits (booleans).
+ * The length of the bit array is determined as needed.
+ */
+declare function bigIntToBits(x: bigint): boolean[];
+declare function changeBase(digits: bigint[], base: bigint, newBase: bigint): bigint[];
+/**
+ * ceil(log2(n))
+ * = smallest k such that n <= 2^k
+ */
+declare function log2(n: number | bigint): number;
+declare function max(a: bigint, b: bigint): bigint;
+declare function abs(x: bigint): bigint;
+declare function sign(x: bigint): 1n | -1n;

package/dist/web/base58/bigint-helpers.js

@@ -0,0 +1,214 @@
+export { changeBase, bytesToBigInt, bigIntToBytes, bigIntToBits, parseHexString32, log2, max, abs, sign, bytesToBigint32, bigintToBytes32, };
+function bytesToBigint32(bytes) {
+    let words = new BigUint64Array(bytes.buffer, bytes.byteOffset, 4);
+    return words[0] | (words[1] << 64n) | (words[2] << 128n) | (words[3] << 192n);
+}
+const mask64 = (1n << 64n) - 1n;
+function bigintToBytes32(x, bytes) {
+    let words = new BigUint64Array(bytes.buffer, bytes.byteOffset, 4);
+    words[0] = x & mask64;
+    words[1] = (x >> 64n) & mask64;
+    words[2] = (x >> 128n) & mask64;
+    words[3] = x >> 192n;
+    return bytes;
+}
+function bytesToBigInt(bytes) {
+    let x = 0n;
+    let bitPosition = 0n;
+    for (let byte of bytes) {
+        x += BigInt(byte) << bitPosition;
+        bitPosition += 8n;
+    }
+    return x;
+}
+let hexToNum = {};
+for (let i = 0; i < 16; i++)
+    hexToNum[i.toString(16).charCodeAt(0)] = i;
+let encoder = new TextEncoder();
+const tmpBytes = new Uint8Array(64);
+function parseHexString32(input) {
+    // Parse the bytes explicitly, Bigint endianness is wrong
+    encoder.encodeInto(input, tmpBytes);
+    for (let j = 0; j < 32; j++) {
+        let n1 = hexToNum[tmpBytes[2 * j]];
+        let n0 = hexToNum[tmpBytes[2 * j + 1]];
+        tmpBytes[j] = (n1 << 4) | n0;
+    }
+    return bytesToBigint32(tmpBytes);
+}
+/**
+ * Transforms bigint to little-endian array of bytes (numbers between 0 and 255) of a given length.
+ * Throws an error if the bigint doesn't fit in the given number of bytes.
+ */
+function bigIntToBytes(x, length) {
+    if (x < 0n) {
+        throw Error(`bigIntToBytes: negative numbers are not supported, got ${x}`);
+    }
+    if (length === undefined)
+        return bigintToBytesFlexible(x);
+    let bytes = Array(length);
+    for (let i = 0; i < length; i++, x >>= 8n) {
+        bytes[i] = Number(x & 0xffn);
+    }
+    if (x > 0n) {
+        throw Error(`bigIntToBytes: input does not fit in ${length} bytes`);
+    }
+    return bytes;
+}
+function bigintToBytesFlexible(x) {
+    let bytes = [];
+    for (; x > 0n; x >>= 8n) {
+        bytes.push(Number(x & 0xffn));
+    }
+    return bytes;
+}
+/**
+ * Transforms bigint to little-endian array of bits (booleans).
+ * The length of the bit array is determined as needed.
+ */
+function bigIntToBits(x) {
+    if (x < 0n) {
+        throw Error(`bigIntToBits: negative numbers are not supported, got ${x}`);
+    }
+    let bits = [];
+    for (; x > 0n; x >>= 1n) {
+        let bit = !!(x & 1n);
+        bits.push(bit);
+    }
+    return bits;
+}
+function changeBase(digits, base, newBase) {
+    // 1. accumulate digits into one gigantic bigint `x`
+    let x = fromBase(digits, base);
+    // 2. compute new digits from `x`
+    let newDigits = toBase(x, newBase);
+    return newDigits;
+}
+/**
+ * the algorithm for toBase / fromBase is more complicated than it naively has to be,
+ * but that is for performance reasons.
+ *
+ * we'll explain it for `fromBase`. this function is about taking an array of digits
+ * `[x0, ..., xn]`
+ * and returning the integer (bigint) that has those digits in the given `base`:
+ * ```
+ * let x = x0 + x1*base + x2*base**2 + ... + xn*base**n
+ * ```
+ *
+ * naively, we could just accumulate digits from left to right:
+ * ```
+ * let x = 0n;
+ * let p = 1n;
+ * for (let i=0; i<n; i++) {
+ *   x += X[i] * p;
+ *   p *= base;
+ * }
+ * ```
+ *
+ * in the ith step, `p = base**i` which is multiplied with `xi` and added to the sum.
+ * however, note that this algorithm is `O(n^2)`: let `l = log2(base)`. the base power `p` is a bigint of bit length `i*l`,
+ * which is multiplied by a "small" number `xi` (length l), which takes `O(i)` time in every step.
+ * since this is done for `i = 0,...,n`, we end up with an `O(n^2)` algorithm.
+ *
+ * HOWEVER, it turns out that there are fast multiplication algorithms, and JS bigints have them built in!
+ * the Schönhage-Strassen algorithm (implemented in the V8 engine, see https://github.com/v8/v8/blob/main/src/bigint/mul-fft.cc)
+ * can multiply two n-bit numbers in time `O(n log(n) loglog(n))`, when n is large.
+ *
+ * to take advantage of asymptotically fast multiplication, we need to re-structure our algorithm such that it multiplies roughly equal-sized
+ * numbers with each other (there is no asymptotic boost for multiplying a small with a large number). so, what we do is to go from the
+ * original digit array to arrays of successively larger digits:
+ * ```
+ * step 0:                  step 1:                              step 2:
+ * [x0, x1, x2, x3, ...] -> [x0 + base*x1, x2 + base*x3, ...] -> [x0 + base*x1 + base^2*(x2 + base*x3), ...] -> ...
+ * ```
+ *
+ * ...until after a log(n) number of steps we end up with a single "digit" which is equal to the entire sum.
+ *
+ * in the ith step, we multiply `n/2^i` pairs of numbers of bit length `2^i*l`. each of these multiplications takes
+ * time `O(2^i log(2^i) loglog(2^i))`. if we bound that with `O(2^i log(n) loglog(n))`, we get a runtime bounded by
+ * ```
+ * O(n/2^i * 2^i log(n) loglog(n)) = O(n log(n) loglog(n))
+ * ```
+ * in each step. Since we have `log(n)` steps, the result is `O(n log(n)^2 loglog(n))`.
+ *
+ * empirically, this method is a huge improvement over the naive `O(n^2)` algorithm and scales much better with n (the number of digits).
+ *
+ * similar conclusions hold for `toBase`.
+ */
+function fromBase(digits, base) {
+    if (base <= 0n)
+        throw Error("fromBase: base must be positive");
+    // compute powers base, base^2, base^4, ..., base^(2^k)
+    // with largest k s.t. n = 2^k < digits.length
+    let basePowers = [];
+    for (let power = base, n = 1; n < digits.length; power **= 2n, n *= 2) {
+        basePowers.push(power);
+    }
+    let k = basePowers.length;
+    // pad digits array with zeros s.t. digits.length === 2^k
+    digits = digits.concat(Array(2 ** k - digits.length).fill(0n));
+    // accumulate [x0, x1, x2, x3, ...] -> [x0 + base*x1, x2 + base*x3, ...] -> [x0 + base*x1 + base^2*(x2 + base*x3), ...] -> ...
+    // until we end up with a single element
+    for (let i = 0; i < k; i++) {
+        let newDigits = Array(digits.length >> 1);
+        let basePower = basePowers[i];
+        for (let j = 0; j < newDigits.length; j++) {
+            newDigits[j] = digits[2 * j] + basePower * digits[2 * j + 1];
+        }
+        digits = newDigits;
+    }
+    console.assert(digits.length === 1);
+    let [digit] = digits;
+    return digit;
+}
+function toBase(x, base) {
+    if (base <= 0n)
+        throw Error("toBase: base must be positive");
+    // compute powers base, base^2, base^4, ..., base^(2^k)
+    // with largest k s.t. base^(2^k) < x
+    let basePowers = [];
+    for (let power = base; power < x; power **= 2n) {
+        basePowers.push(power);
+    }
+    let digits = [x]; // single digit w.r.t base^(2^(k+1))
+    // successively split digits w.r.t. base^(2^j) into digits w.r.t. base^(2^(j-1))
+    // until we arrive at digits w.r.t. base
+    let k = basePowers.length;
+    for (let i = 0; i < k; i++) {
+        let newDigits = Array(2 * digits.length);
+        let basePower = basePowers[k - 1 - i];
+        for (let j = 0; j < digits.length; j++) {
+            let x = digits[j];
+            let high = x / basePower;
+            newDigits[2 * j + 1] = high;
+            newDigits[2 * j] = x - high * basePower;
+        }
+        digits = newDigits;
+    }
+    // pop "leading" zero digits
+    while (digits[digits.length - 1] === 0n) {
+        digits.pop();
+    }
+    return digits;
+}
+/**
+ * ceil(log2(n))
+ * = smallest k such that n <= 2^k
+ */
+function log2(n) {
+    if (typeof n === "number")
+        n = BigInt(n);
+    if (n === 1n)
+        return 0;
+    return (n - 1n).toString(2).length;
+}
+function max(a, b) {
+    return a > b ? a : b;
+}
+function abs(x) {
+    return x < 0n ? -x : x;
+}
+function sign(x) {
+    return x >= 0 ? 1n : -1n;
+}
+//# sourceMappingURL=bigint-helpers.js.map

package/dist/web/base58/bigint-helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bigint-helpers.js","sourceRoot":"","sources":["../../../src/base58/bigint-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,UAAU,EACV,aAAa,EACb,aAAa,EACb,YAAY,EACZ,gBAAgB,EAChB,IAAI,EACJ,GAAG,EACH,GAAG,EACH,IAAI,EACJ,eAAe,EACf,eAAe,GAChB,CAAC;AAEF,SAAS,eAAe,CAAC,KAAiB;IACxC,IAAI,KAAK,GAAG,IAAI,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAClE,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;AAChF,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;AAEhC,SAAS,eAAe,CAAC,CAAS,EAAE,KAAiB;IACnD,IAAI,KAAK,GAAG,IAAI,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAClE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC;IAC/B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC;IAChC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IACrB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,aAAa,CAAC,KAA4B;IACjD,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC;QACjC,WAAW,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,IAAI,QAAQ,GAAsC,EAAE,CAAC;AACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;IAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACxE,IAAI,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;AAEhC,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;AAEpC,SAAS,gBAAgB,CAAC,KAAa;IACrC,yDAAyD;IACzD,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;IAC/B,CAAC;IACD,OAAO,eAAe,CAAC,QAAQ,CAAC,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,CAAS,EAAE,MAAe;IAC/C,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,MAAM,KAAK,CAAC,0DAA0D,CAAC,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC;IAC1D,IAAI,KAAK,GAAa,KAAK,CAAC,MAAM,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,MAAM,KAAK,CAAC,wCAAwC,MAAM,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAS;IACtC,IAAI,KAAK,GAAa,EAAE,CAAC;IACzB,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACX,MAAM,KAAK,CAAC,yDAAyD,CAAC,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,IAAI,GAAc,EAAE,CAAC;IACzB,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CAAC,MAAgB,EAAE,IAAY,EAAE,OAAe;IACjE,oDAAoD;IACpD,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/B,iCAAiC;IACjC,IAAI,SAAS,GAAG,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACnC,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AACH,SAAS,QAAQ,CAAC,MAAgB,EAAE,IAAY;IAC9C,IAAI,IAAI,IAAI,EAAE;QAAE,MAAM,KAAK,CAAC,iCAAiC,CAAC,CAAC;IAC/D,uDAAuD;IACvD,8CAA8C;IAC9C,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAC1B,yDAAyD;IACzD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/D,8HAA8H;IAC9H,wCAAwC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC1C,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;IACD,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;IACrB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,IAAY;IACrC,IAAI,IAAI,IAAI,EAAE;QAAE,MAAM,KAAK,CAAC,+BAA+B,CAAC,CAAC;IAC7D,uDAAuD;IACvD,qCAAqC;IACrC,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,KAAK,EAAE,EAAE,CAAC;QAC/C,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAoC;IACtD,gFAAgF;IAChF,wCAAwC;IACxC,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,IAAI,GAAG,CAAC,GAAG,SAAS,CAAC;YACzB,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;YAC5B,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;QAC1C,CAAC;QACD,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;IACD,4BAA4B;IAC5B,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,EAAE,CAAC;IACf,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,IAAI,CAAC,CAAkB;IAC9B,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC;IACvB,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACrC,CAAC;AAED,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;IAC/B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,GAAG,CAAC,CAAS;IACpB,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,IAAI,CAAC,CAAS;IACrB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3B,CAAC"}

package/dist/web/base58/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./signature.js";
+export * from "./public-key.js";

package/dist/web/base58/index.js

@@ -0,0 +1,3 @@
+export * from "./signature.js";
+export * from "./public-key.js";
+//# sourceMappingURL=index.js.map

package/dist/web/base58/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/base58/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,iBAAiB,CAAC"}

package/dist/web/base58/public-key.d.ts

@@ -0,0 +1,4 @@
+export declare function convertFieldsToPublicKey(fields: {
+    x: bigint;
+    isOdd: boolean;
+}): string;

package/dist/web/base58/public-key.js

@@ -0,0 +1,7 @@
+import { toBase58Check, toBytesWithVersionNumber } from "./base58.js";
+import { versionNumbers, versionBytes } from "./versions.js";
+export function convertFieldsToPublicKey(fields) {
+    let bytes = toBytesWithVersionNumber([fields.x, fields.isOdd ? 1n : 0n], versionNumbers.publicKey);
+    return toBase58Check(bytes, versionBytes.publicKey);
+}
+//# sourceMappingURL=public-key.js.map

package/dist/web/base58/public-key.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"public-key.js","sourceRoot":"","sources":["../../../src/base58/public-key.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7D,MAAM,UAAU,wBAAwB,CAAC,MAGxC;IACC,IAAI,KAAK,GAAG,wBAAwB,CAClC,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAClC,cAAc,CAAC,SAAS,CACzB,CAAC;IACF,OAAO,aAAa,CAAC,KAAK,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;AACtD,CAAC"}

package/dist/web/base58/signature.d.ts

@@ -0,0 +1,3 @@
+import { MinaSignature } from "../types.js";
+export declare function convertMinaSignatureFromBase58(signature: string): MinaSignature;
+export declare function convertMinaSignatureToBase58(signature: MinaSignature): string;

package/dist/web/base58/signature.js

@@ -0,0 +1,65 @@
+import { fromBase58Check, toBase58Check } from "./base58.js";
+import { versionNumbers, versionBytes } from "./versions.js";
+function assertNonNegativeInteger(n, message) {
+    if (!Number.isInteger(n) || n < 0)
+        throw Error(message);
+}
+function bytesToBigInt(bytes) {
+    let x = 0n;
+    let bitPosition = 0n;
+    for (let byte of bytes) {
+        x += BigInt(byte) << bitPosition;
+        bitPosition += 8n;
+    }
+    return x;
+}
+function readBytesInternal(bytes, start) {
+    const rBytes = bytes.slice(start, start + 32);
+    const sBytes = bytes.slice(start + 32, start + 64);
+    const r = bytesToBigInt(rBytes);
+    const s = bytesToBigInt(sBytes);
+    return { r, s };
+}
+function readBytes(bytes, offset, versionNumber) {
+    let version = bytes[offset++];
+    if (version !== versionNumber) {
+        throw Error(`fromBytes: Invalid version byte. Expected ${versionNumber}, got ${version}.`);
+    }
+    return readBytesInternal(bytes, offset);
+}
+let readBytes_ = (bytes, offset) => {
+    assertNonNegativeInteger(offset, "readBytes: offset must be integer >= 0");
+    if (offset >= bytes.length)
+        throw Error("readBytes: offset must be within bytes length");
+    return readBytes(bytes, offset, versionNumbers.signature);
+};
+function fromBytes(bytes) {
+    return readBytes_(bytes, 0);
+}
+function toBytes(signature) {
+    const result = new Array(65);
+    result[0] = versionNumbers.signature;
+    // Convert r to bytes
+    let r = signature.r;
+    for (let i = 0; i < 32; i++) {
+        result[i + 1] = Number(r & 0xffn);
+        r >>= 8n;
+    }
+    // Convert s to bytes
+    let s = signature.s;
+    for (let i = 0; i < 32; i++) {
+        result[i + 33] = Number(s & 0xffn);
+        s >>= 8n;
+    }
+    return result;
+}
+export function convertMinaSignatureFromBase58(signature) {
+    const bytes = fromBase58Check(signature, versionBytes.signature);
+    const minaSignature = fromBytes(bytes);
+    return minaSignature;
+}
+export function convertMinaSignatureToBase58(signature) {
+    const bytes = toBytes(signature);
+    return toBase58Check(bytes, versionBytes.signature);
+}
+//# sourceMappingURL=signature.js.map

package/dist/web/base58/signature.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"signature.js","sourceRoot":"","sources":["../../../src/base58/signature.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAQ7D,SAAS,wBAAwB,CAAC,CAAS,EAAE,OAAe;IAC1D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,aAAa,CAAC,KAAe;IACpC,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC;QACjC,WAAW,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAe,EAAE,KAAa;IACvD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;IACnD,MAAM,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAChC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAClB,CAAC;AAED,SAAS,SAAS,CAAC,KAAe,EAAE,MAAc,EAAE,aAAqB;IACvE,IAAI,OAAO,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9B,IAAI,OAAO,KAAK,aAAa,EAAE,CAAC;QAC9B,MAAM,KAAK,CACT,6CAA6C,aAAa,SAAS,OAAO,GAAG,CAC9E,CAAC;IACJ,CAAC;IACD,OAAO,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC1C,CAAC;AAED,IAAI,UAAU,GAAG,CACf,KAAe,EACf,MAA6B,EAC7B,EAAE;IACF,wBAAwB,CAAC,MAAM,EAAE,wCAAwC,CAAC,CAAC;IAC3E,IAAI,MAAM,IAAI,KAAK,CAAC,MAAM;QACxB,MAAM,KAAK,CAAC,+CAA+C,CAAC,CAAC;IAC/D,OAAO,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,SAAS,CAAC,CAAC;AAC5D,CAAC,CAAC;AAEF,SAAS,SAAS,CAAC,KAAe;IAChC,OAAO,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,OAAO,CAAC,SAAwB;IACvC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,EAAE,CAAC,CAAC;IACrC,MAAM,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC;IAErC,qBAAqB;IACrB,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAClC,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IAED,qBAAqB;IACrB,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QACnC,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,8BAA8B,CAC5C,SAAiB;IAEjB,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;IACjE,MAAM,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,4BAA4B,CAAC,SAAwB;IACnE,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACjC,OAAO,aAAa,CAAC,KAAK,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;AACtD,CAAC"}

package/dist/web/base58/versions.d.ts

@@ -0,0 +1,11 @@
+export declare const versionNumbers: {
+    field: number;
+    scalar: number;
+    publicKey: number;
+    signature: number;
+};
+export declare const versionBytes: {
+    publicKey: number;
+    privateKey: number;
+    signature: number;
+};

package/dist/web/base58/versions.js

@@ -0,0 +1,12 @@
+export const versionNumbers = {
+    field: 1,
+    scalar: 1,
+    publicKey: 1,
+    signature: 1,
+};
+export const versionBytes = {
+    publicKey: 203,
+    privateKey: 90,
+    signature: 154,
+};
+//# sourceMappingURL=versions.js.map

package/dist/web/base58/versions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"versions.js","sourceRoot":"","sources":["../../../src/base58/versions.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,KAAK,EAAE,CAAC;IACR,MAAM,EAAE,CAAC;IACT,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,CAAC;CACb,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,SAAS,EAAE,GAAG;IACd,UAAU,EAAE,EAAE;IACd,SAAS,EAAE,GAAG;CACf,CAAC"}

package/dist/web/execute.d.ts

@@ -0,0 +1,16 @@
+import { SuiTransactionBlockResponse } from "@mysten/sui/client";
+import { Transaction } from "@mysten/sui/transactions";
+import { Secp256k1Keypair } from "@mysten/sui/keypairs/secp256k1";
+import { Ed25519Keypair } from "@mysten/sui/keypairs/ed25519";
+export declare function executeTx(params: {
+    tx: Transaction;
+    keyPair: Secp256k1Keypair | Ed25519Keypair;
+    useParallelExecutor?: boolean;
+    showErrors?: boolean;
+}): Promise<{
+    tx: SuiTransactionBlockResponse;
+    digest: string;
+    events: object;
+    executeTime: number;
+} | undefined>;
+export declare function waitTx(digest: string): Promise<SuiTransactionBlockResponse>;

package/dist/web/execute.js

@@ -0,0 +1,142 @@
+import { ParallelTransactionExecutor, } from "@mysten/sui/transactions";
+import { suiClient } from "./sui-client.js";
+import { nanoid } from "nanoid";
+import { sleep } from "./sleep.js";
+const executors = {};
+const locks = {};
+const LOCK_TIMEOUT = 1000 * 60 * 2; // 5 minutes
+async function getLock(address) {
+    const id = nanoid();
+    let locked = false;
+    const start = Date.now();
+    while (!locked && Date.now() - start < LOCK_TIMEOUT) {
+        if (locks[address]) {
+            await sleep(Math.floor(Math.random() * 10) + 10);
+        }
+        else {
+            locks[address] = id;
+            await sleep(10);
+            if (locks[address] === id) {
+                locked = true;
+                return id;
+            }
+        }
+    }
+    return undefined;
+}
+async function releaseLock(params) {
+    const { address, id } = params;
+    if (locks[address] === id) {
+        locks[address] = undefined;
+    }
+}
+function getExecutor(keyPair) {
+    const keyPairId = keyPair.toSuiAddress();
+    if (!executors[keyPairId]) {
+        executors[keyPairId] = new ParallelTransactionExecutor({
+            client: suiClient,
+            signer: keyPair,
+            initialCoinBalance: 500000000n,
+            minimumCoinBalance: 300000000n,
+            maxPoolSize: 5,
+        });
+        locks[keyPairId] = undefined;
+    }
+    return executors[keyPairId];
+}
+export async function executeTx(params) {
+    let lockId;
+    let address;
+    try {
+        const { tx, keyPair, useParallelExecutor = false, showErrors = true, } = params;
+        let executedTx;
+        let start = 0;
+        let end = 0;
+        if (useParallelExecutor) {
+            address = keyPair.toSuiAddress();
+            lockId = await getLock(address);
+            if (!lockId) {
+                throw new Error("Failed to get lock");
+            }
+            start = Date.now();
+            const executor = getExecutor(keyPair);
+            executedTx = (await executor.executeTransaction(tx, {
+                showEffects: true,
+                showObjectChanges: true,
+                showInput: true,
+                showEvents: true,
+                showBalanceChanges: true,
+            })).data;
+            end = Date.now();
+            await waitTx(executedTx.digest);
+            await sleep(1000);
+            await releaseLock({ address: address, id: lockId });
+        }
+        else {
+            address = keyPair.toSuiAddress();
+            lockId = await getLock(address);
+            if (!lockId) {
+                throw new Error("Failed to get lock");
+            }
+            const signedTx = await tx.sign({
+                signer: keyPair,
+                client: suiClient,
+            });
+            start = Date.now();
+            // const dryRun = await suiClient.devInspectTransactionBlock({
+            //   sender: keypair.toSuiAddress(),
+            //   transactionBlock: signedTx.bytes
+            // });
+            // dryRun.effects.gasUsed.computationCost
+            // const gasPrice = await suiClient.getReferenceGasPrice();
+            executedTx = await suiClient.executeTransactionBlock({
+                transactionBlock: signedTx.bytes,
+                signature: signedTx.signature,
+                options: {
+                    showEffects: true,
+                    showObjectChanges: true,
+                    showInput: true,
+                    showEvents: true,
+                    showBalanceChanges: true,
+                },
+            });
+            end = Date.now();
+            await releaseLock({ address, id: lockId });
+        }
+        if (executedTx?.effects?.status?.status === "failure") {
+            if (showErrors) {
+                console.log(`Errors for tx ${executedTx.digest}:`, executedTx?.effects?.status?.error);
+                throw new Error(`tx execution failed: ${executedTx.digest}`);
+            }
+        }
+        return {
+            tx: executedTx,
+            digest: executedTx.digest,
+            events: executedTx?.events?.[0]?.parsedJson,
+            executeTime: end - start,
+        };
+    }
+    catch (error) {
+        if (lockId && address) {
+            await releaseLock({ address, id: lockId });
+        }
+        console.error("Error in executeTx", error.message);
+        return undefined;
+    }
+}
+export async function waitTx(digest) {
+    console.time(`wait sui tx`);
+    const txWaitResult = await suiClient.waitForTransaction({
+        digest,
+        options: {
+            showEffects: true,
+            showObjectChanges: true,
+            showInput: true,
+            showEvents: true,
+            showBalanceChanges: true,
+        },
+    });
+    console.timeEnd(`wait sui tx`);
+    return txWaitResult;
+}
+//# sourceMappingURL=execute.js.map