@coinbase/cdp-core 0.0.51 → 0.0.52

package/dist/native/index.native122.js

@@ -1,12 +1,4 @@
-import n from "./index.native137.js";
-import s from "./index.native138.js";
-import a from "./index.native139.js";
-const y = async (t, o, e) => {
-  const r = await a(t, o, "sign");
-  s(t, r);
-  const i = await crypto.subtle.sign(n(t, r.algorithm), r, e);
-  return new Uint8Array(i);
-};
+const o = "2.33.0";
 export {
-  y as default
+  o as version
 };

package/dist/native/index.native123.js

@@ -1,22 +1,23 @@
-const a = (...o) => {
-  const t = o.filter(Boolean);
-  if (t.length === 0 || t.length === 1)
-    return !0;
-  let e;
-  for (const s of t) {
-    const r = Object.keys(s);
-    if (!e || e.size === 0) {
-      e = new Set(r);
-      continue;
-    }
-    for (const n of r) {
-      if (e.has(n))
-        return !1;
-      e.add(n);
-    }
+import { BaseError as o } from "./index.native71.js";
+class i extends o {
+  constructor({ offset: e }) {
+    super(`Offset \`${e}\` cannot be negative.`, {
+      name: "NegativeOffsetError"
+    });
   }
-  return !0;
-};
+}
+class n extends o {
+  constructor({ length: e, position: r }) {
+    super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
+  }
+}
+class c extends o {
+  constructor({ count: e, limit: r }) {
+    super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
+  }
+}
 export {
-  a as default
+  i as NegativeOffsetError,
+  n as PositionOutOfBoundsError,
+  c as RecursiveReadLimitExceededError
 };

package/dist/native/index.native124.js

@@ -1,96 +1,41 @@
-import { withAlg as n } from "./index.native140.js";
-import c from "./index.native141.js";
-import { isJWK as p, isSecretJWK as a, isPublicJWK as y, isPrivateJWK as f } from "./index.native142.js";
-const s = (r) => r?.[Symbol.toStringTag], o = (r, e, t) => {
-  if (e.use !== void 0) {
-    let i;
-    switch (t) {
-      case "sign":
-      case "verify":
-        i = "sig";
-        break;
-      case "encrypt":
-      case "decrypt":
-        i = "enc";
-        break;
-    }
-    if (e.use !== i)
-      throw new TypeError(`Invalid key for this operation, its "use" must be "${i}" when present`);
-  }
-  if (e.alg !== void 0 && e.alg !== r)
-    throw new TypeError(`Invalid key for this operation, its "alg" must be "${r}" when present`);
-  if (Array.isArray(e.key_ops)) {
-    let i;
-    switch (!0) {
-      case t === "sign":
-      case r === "dir":
-      case r.includes("CBC-HS"):
-        i = t;
-        break;
-      case r.startsWith("PBES2"):
-        i = "deriveBits";
-        break;
-      case /^A\d{3}(?:GCM)?(?:KW)?$/.test(r):
-        !r.includes("GCM") && r.endsWith("KW") ? i = "unwrapKey" : i = t;
-        break;
-      case t === "encrypt":
-        i = "wrapKey";
-        break;
-      case t === "decrypt":
-        i = r.startsWith("RSA") ? "unwrapKey" : "deriveBits";
-        break;
-    }
-    if (i && e.key_ops?.includes?.(i) === !1)
-      throw new TypeError(`Invalid key for this operation, its "key_ops" must include "${i}" when present`);
-  }
-  return !0;
-}, h = (r, e, t) => {
-  if (!(e instanceof Uint8Array)) {
-    if (p(e)) {
-      if (a(e) && o(r, e, t))
-        return;
-      throw new TypeError('JSON Web Key for symmetric algorithms must have JWK "kty" (Key Type) equal to "oct" and the JWK "k" (Key Value) present');
-    }
-    if (!c(e))
-      throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key", "Uint8Array"));
-    if (e.type !== "secret")
-      throw new TypeError(`${s(e)} instances for symmetric algorithms must be of type "secret"`);
-  }
-}, m = (r, e, t) => {
-  if (p(e))
-    switch (t) {
-      case "decrypt":
-      case "sign":
-        if (f(e) && o(r, e, t))
-          return;
-        throw new TypeError("JSON Web Key for this operation be a private JWK");
-      case "encrypt":
-      case "verify":
-        if (y(e) && o(r, e, t))
-          return;
-        throw new TypeError("JSON Web Key for this operation be a public JWK");
-    }
-  if (!c(e))
-    throw new TypeError(n(r, e, "CryptoKey", "KeyObject", "JSON Web Key"));
-  if (e.type === "secret")
-    throw new TypeError(`${s(e)} instances for asymmetric algorithms must not be of type "secret"`);
-  if (e.type === "public")
-    switch (t) {
-      case "sign":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm signing must be of type "private"`);
-      case "decrypt":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm decryption must be of type "private"`);
-    }
-  if (e.type === "private")
-    switch (t) {
-      case "verify":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm verifying must be of type "public"`);
-      case "encrypt":
-        throw new TypeError(`${s(e)} instances for asymmetric algorithm encryption must be of type "public"`);
-    }
-}, d = (r, e, t) => {
-  r.startsWith("HS") || r === "dir" || r.startsWith("PBES2") || /^A(?:128|192|256)(?:GCM)?(?:KW)?$/.test(r) || /^A(?:128|192|256)CBC-HS(?:256|384|512)$/.test(r) ? h(r, e, t) : m(r, e, t);
-};
+import { __module as h } from "./index.native125.js";
+import { __require as S } from "./index.native126.js";
+import { __require as q } from "./index.native127.js";
+import { __require as w } from "./index.native128.js";
+var x;
+function G() {
+  return x ? h.exports : (x = 1, function() {
+    var v = S(), p = q().utf8, B = w(), F = q().bin, d = function(o, f) {
+      o.constructor == String ? f && f.encoding === "binary" ? o = F.stringToBytes(o) : o = p.stringToBytes(o) : B(o) ? o = Array.prototype.slice.call(o, 0) : !Array.isArray(o) && o.constructor !== Uint8Array && (o = o.toString());
+      for (var u = v.bytesToWords(o), a = o.length * 8, n = 1732584193, r = -271733879, i = -1732584194, t = 271733878, e = 0; e < u.length; e++)
+        u[e] = (u[e] << 8 | u[e] >>> 24) & 16711935 | (u[e] << 24 | u[e] >>> 8) & 4278255360;
+      u[a >>> 5] |= 128 << a % 32, u[(a + 64 >>> 9 << 4) + 14] = a;
+      for (var _ = d._ff, c = d._gg, l = d._hh, y = d._ii, e = 0; e < u.length; e += 16) {
+        var T = n, b = r, A = i, I = t;
+        n = _(n, r, i, t, u[e + 0], 7, -680876936), t = _(t, n, r, i, u[e + 1], 12, -389564586), i = _(i, t, n, r, u[e + 2], 17, 606105819), r = _(r, i, t, n, u[e + 3], 22, -1044525330), n = _(n, r, i, t, u[e + 4], 7, -176418897), t = _(t, n, r, i, u[e + 5], 12, 1200080426), i = _(i, t, n, r, u[e + 6], 17, -1473231341), r = _(r, i, t, n, u[e + 7], 22, -45705983), n = _(n, r, i, t, u[e + 8], 7, 1770035416), t = _(t, n, r, i, u[e + 9], 12, -1958414417), i = _(i, t, n, r, u[e + 10], 17, -42063), r = _(r, i, t, n, u[e + 11], 22, -1990404162), n = _(n, r, i, t, u[e + 12], 7, 1804603682), t = _(t, n, r, i, u[e + 13], 12, -40341101), i = _(i, t, n, r, u[e + 14], 17, -1502002290), r = _(r, i, t, n, u[e + 15], 22, 1236535329), n = c(n, r, i, t, u[e + 1], 5, -165796510), t = c(t, n, r, i, u[e + 6], 9, -1069501632), i = c(i, t, n, r, u[e + 11], 14, 643717713), r = c(r, i, t, n, u[e + 0], 20, -373897302), n = c(n, r, i, t, u[e + 5], 5, -701558691), t = c(t, n, r, i, u[e + 10], 9, 38016083), i = c(i, t, n, r, u[e + 15], 14, -660478335), r = c(r, i, t, n, u[e + 4], 20, -405537848), n = c(n, r, i, t, u[e + 9], 5, 568446438), t = c(t, n, r, i, u[e + 14], 9, -1019803690), i = c(i, t, n, r, u[e + 3], 14, -187363961), r = c(r, i, t, n, u[e + 8], 20, 1163531501), n = c(n, r, i, t, u[e + 13], 5, -1444681467), t = c(t, n, r, i, u[e + 2], 9, -51403784), i = c(i, t, n, r, u[e + 7], 14, 1735328473), r = c(r, i, t, n, u[e + 12], 20, -1926607734), n = l(n, r, i, t, u[e + 5], 4, -378558), t = l(t, n, r, i, u[e + 8], 11, -2022574463), i = l(i, t, n, r, u[e + 11], 16, 1839030562), r = l(r, i, t, n, u[e + 14], 23, -35309556), n = l(n, r, i, t, u[e + 1], 4, -1530992060), t = l(t, n, r, i, u[e + 4], 11, 1272893353), i = l(i, t, n, r, u[e + 7], 16, -155497632), r = l(r, i, t, n, u[e + 10], 23, -1094730640), n = l(n, r, i, t, u[e + 13], 4, 681279174), t = l(t, n, r, i, u[e + 0], 11, -358537222), i = l(i, t, n, r, u[e + 3], 16, -722521979), r = l(r, i, t, n, u[e + 6], 23, 76029189), n = l(n, r, i, t, u[e + 9], 4, -640364487), t = l(t, n, r, i, u[e + 12], 11, -421815835), i = l(i, t, n, r, u[e + 15], 16, 530742520), r = l(r, i, t, n, u[e + 2], 23, -995338651), n = y(n, r, i, t, u[e + 0], 6, -198630844), t = y(t, n, r, i, u[e + 7], 10, 1126891415), i = y(i, t, n, r, u[e + 14], 15, -1416354905), r = y(r, i, t, n, u[e + 5], 21, -57434055), n = y(n, r, i, t, u[e + 12], 6, 1700485571), t = y(t, n, r, i, u[e + 3], 10, -1894986606), i = y(i, t, n, r, u[e + 10], 15, -1051523), r = y(r, i, t, n, u[e + 1], 21, -2054922799), n = y(n, r, i, t, u[e + 8], 6, 1873313359), t = y(t, n, r, i, u[e + 15], 10, -30611744), i = y(i, t, n, r, u[e + 6], 15, -1560198380), r = y(r, i, t, n, u[e + 13], 21, 1309151649), n = y(n, r, i, t, u[e + 4], 6, -145523070), t = y(t, n, r, i, u[e + 11], 10, -1120210379), i = y(i, t, n, r, u[e + 2], 15, 718787259), r = y(r, i, t, n, u[e + 9], 21, -343485551), n = n + T >>> 0, r = r + b >>> 0, i = i + A >>> 0, t = t + I >>> 0;
+      }
+      return v.endian([n, r, i, t]);
+    };
+    d._ff = function(o, f, u, a, n, r, i) {
+      var t = o + (f & u | ~f & a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._gg = function(o, f, u, a, n, r, i) {
+      var t = o + (f & a | u & ~a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._hh = function(o, f, u, a, n, r, i) {
+      var t = o + (f ^ u ^ a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._ii = function(o, f, u, a, n, r, i) {
+      var t = o + (u ^ (f | ~a)) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._blocksize = 16, d._digestsize = 16, h.exports = function(o, f) {
+      if (o == null)
+        throw new Error("Illegal argument " + o);
+      var u = v.wordsToBytes(d(o, f));
+      return f && f.asBytes ? u : f && f.asString ? F.bytesToString(u) : v.bytesToHex(u);
+    };
+  }(), h.exports);
+}
 export {
-  d as default
+  G as __require
 };

package/dist/native/index.native125.js

@@ -1,23 +1,4 @@
-import { JOSENotSupported as f } from "./index.native48.js";
-const w = (n, r, a, e, s) => {
-  if (s.crit !== void 0 && e?.crit === void 0)
-    throw new n('"crit" (Critical) Header Parameter MUST be integrity protected');
-  if (!e || e.crit === void 0)
-    return /* @__PURE__ */ new Set();
-  if (!Array.isArray(e.crit) || e.crit.length === 0 || e.crit.some((i) => typeof i != "string" || i.length === 0))
-    throw new n('"crit" (Critical) Header Parameter MUST be an array of non-empty strings when present');
-  let t;
-  a !== void 0 ? t = new Map([...Object.entries(a), ...r.entries()]) : t = r;
-  for (const i of e.crit) {
-    if (!t.has(i))
-      throw new f(`Extension Header Parameter "${i}" is not recognized`);
-    if (s[i] === void 0)
-      throw new n(`Extension Header Parameter "${i}" is missing`);
-    if (t.get(i) && e[i] === void 0)
-      throw new n(`Extension Header Parameter "${i}" MUST be integrity protected`);
-  }
-  return new Set(e.crit);
-};
+var e = { exports: {} };
 export {
-  w as default
+  e as __module
 };

package/dist/native/index.native126.js

@@ -1,120 +1,72 @@
-import { isJWK as p } from "./index.native142.js";
-import { decode as m } from "./index.native121.js";
-import y from "./index.native143.js";
-import { isCryptoKey as S, isKeyObject as K } from "./index.native141.js";
-let c;
-const f = async (e, r, s, i = !1) => {
-  c ||= /* @__PURE__ */ new WeakMap();
-  let n = c.get(e);
-  if (n?.[s])
-    return n[s];
-  const t = await y({ ...r, alg: s });
-  return i && Object.freeze(e), n ? n[s] = t : c.set(e, { [s]: t }), t;
-}, E = (e, r) => {
-  c ||= /* @__PURE__ */ new WeakMap();
-  let s = c.get(e);
-  if (s?.[r])
-    return s[r];
-  const i = e.type === "public", n = !!i;
-  let t;
-  if (e.asymmetricKeyType === "x25519") {
-    switch (r) {
-      case "ECDH-ES":
-      case "ECDH-ES+A128KW":
-      case "ECDH-ES+A192KW":
-      case "ECDH-ES+A256KW":
-        break;
-      default:
-        throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    }
-    t = e.toCryptoKey(e.asymmetricKeyType, n, i ? [] : ["deriveBits"]);
-  }
-  if (e.asymmetricKeyType === "ed25519") {
-    if (r !== "EdDSA" && r !== "Ed25519")
-      throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    t = e.toCryptoKey(e.asymmetricKeyType, n, [
-      i ? "verify" : "sign"
-    ]);
-  }
-  if (e.asymmetricKeyType === "rsa") {
-    let a;
-    switch (r) {
-      case "RSA-OAEP":
-        a = "SHA-1";
-        break;
-      case "RS256":
-      case "PS256":
-      case "RSA-OAEP-256":
-        a = "SHA-256";
-        break;
-      case "RS384":
-      case "PS384":
-      case "RSA-OAEP-384":
-        a = "SHA-384";
-        break;
-      case "RS512":
-      case "PS512":
-      case "RSA-OAEP-512":
-        a = "SHA-512";
-        break;
-      default:
-        throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    }
-    if (r.startsWith("RSA-OAEP"))
-      return e.toCryptoKey({
-        name: "RSA-OAEP",
-        hash: a
-      }, n, i ? ["encrypt"] : ["decrypt"]);
-    t = e.toCryptoKey({
-      name: r.startsWith("PS") ? "RSA-PSS" : "RSASSA-PKCS1-v1_5",
-      hash: a
-    }, n, [i ? "verify" : "sign"]);
-  }
-  if (e.asymmetricKeyType === "ec") {
-    const o = (/* @__PURE__ */ new Map([
-      ["prime256v1", "P-256"],
-      ["secp384r1", "P-384"],
-      ["secp521r1", "P-521"]
-    ])).get(e.asymmetricKeyDetails?.namedCurve);
-    if (!o)
-      throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-    r === "ES256" && o === "P-256" && (t = e.toCryptoKey({
-      name: "ECDSA",
-      namedCurve: o
-    }, n, [i ? "verify" : "sign"])), r === "ES384" && o === "P-384" && (t = e.toCryptoKey({
-      name: "ECDSA",
-      namedCurve: o
-    }, n, [i ? "verify" : "sign"])), r === "ES512" && o === "P-521" && (t = e.toCryptoKey({
-      name: "ECDSA",
-      namedCurve: o
-    }, n, [i ? "verify" : "sign"])), r.startsWith("ECDH-ES") && (t = e.toCryptoKey({
-      name: "ECDH",
-      namedCurve: o
-    }, n, i ? [] : ["deriveBits"]));
-  }
-  if (!t)
-    throw new TypeError("given KeyObject instance cannot be used for this algorithm");
-  return s ? s[r] = t : c.set(e, { [r]: t }), t;
-}, d = async (e, r) => {
-  if (e instanceof Uint8Array || S(e))
-    return e;
-  if (K(e)) {
-    if (e.type === "secret")
-      return e.export();
-    if ("toCryptoKey" in e && typeof e.toCryptoKey == "function")
-      try {
-        return E(e, r);
-      } catch (i) {
-        if (i instanceof TypeError)
-          throw i;
+import { __module as a } from "./index.native145.js";
+var h;
+function c() {
+  return h ? a.exports : (h = 1, function() {
+    var f = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = {
+      // Bit-wise rotation left
+      rotl: function(r, t) {
+        return r << t | r >>> 32 - t;
+      },
+      // Bit-wise rotation right
+      rotr: function(r, t) {
+        return r << 32 - t | r >>> t;
+      },
+      // Swap big-endian to little-endian and vice versa
+      endian: function(r) {
+        if (r.constructor == Number)
+          return u.rotl(r, 8) & 16711935 | u.rotl(r, 24) & 4278255360;
+        for (var t = 0; t < r.length; t++)
+          r[t] = u.endian(r[t]);
+        return r;
+      },
+      // Generate an array of any length of random bytes
+      randomBytes: function(r) {
+        for (var t = []; r > 0; r--)
+          t.push(Math.floor(Math.random() * 256));
+        return t;
+      },
+      // Convert a byte array to big-endian 32-bit words
+      bytesToWords: function(r) {
+        for (var t = [], n = 0, o = 0; n < r.length; n++, o += 8)
+          t[o >>> 5] |= r[n] << 24 - o % 32;
+        return t;
+      },
+      // Convert big-endian 32-bit words to a byte array
+      wordsToBytes: function(r) {
+        for (var t = [], n = 0; n < r.length * 32; n += 8)
+          t.push(r[n >>> 5] >>> 24 - n % 32 & 255);
+        return t;
+      },
+      // Convert a byte array to a hex string
+      bytesToHex: function(r) {
+        for (var t = [], n = 0; n < r.length; n++)
+          t.push((r[n] >>> 4).toString(16)), t.push((r[n] & 15).toString(16));
+        return t.join("");
+      },
+      // Convert a hex string to a byte array
+      hexToBytes: function(r) {
+        for (var t = [], n = 0; n < r.length; n += 2)
+          t.push(parseInt(r.substr(n, 2), 16));
+        return t;
+      },
+      // Convert a byte array to a base-64 string
+      bytesToBase64: function(r) {
+        for (var t = [], n = 0; n < r.length; n += 3)
+          for (var o = r[n] << 16 | r[n + 1] << 8 | r[n + 2], e = 0; e < 4; e++)
+            n * 8 + e * 6 <= r.length * 8 ? t.push(f.charAt(o >>> 6 * (3 - e) & 63)) : t.push("=");
+        return t.join("");
+      },
+      // Convert a base-64 string to a byte array
+      base64ToBytes: function(r) {
+        r = r.replace(/[^A-Z0-9+\/]/ig, "");
+        for (var t = [], n = 0, o = 0; n < r.length; o = ++n % 4)
+          o != 0 && t.push((f.indexOf(r.charAt(n - 1)) & Math.pow(2, -2 * o + 8) - 1) << o * 2 | f.indexOf(r.charAt(n)) >>> 6 - o * 2);
+        return t;
       }
-    let s = e.export({ format: "jwk" });
-    return f(e, s, r);
-  }
-  if (p(e))
-    return e.k ? m(e.k) : f(e, e, r, !0);
-  throw new Error("unreachable");
-};
+    };
+    a.exports = u;
+  }(), a.exports);
+}
 export {
-  d as default
+  c as __require
 };

package/dist/native/index.native127.js

@@ -1,17 +1,37 @@
-import { SizeExceedsPaddingSizeError as a } from "./index.native100.js";
-function o(r, i = {}) {
-  const { dir: n, size: e = 32 } = i;
-  if (e === 0)
-    return r;
-  const t = r.replace("0x", "");
-  if (t.length > e * 2)
-    throw new a({
-      size: Math.ceil(t.length / 2),
-      targetSize: e,
-      type: "Hex"
-    });
-  return `0x${t[n === "right" ? "padEnd" : "padStart"](e * 2, "0")}`;
+var o, u;
+function c() {
+  if (u) return o;
+  u = 1;
+  var t = {
+    // UTF-8 encoding
+    utf8: {
+      // Convert a string to a byte array
+      stringToBytes: function(n) {
+        return t.bin.stringToBytes(unescape(encodeURIComponent(n)));
+      },
+      // Convert a byte array to a string
+      bytesToString: function(n) {
+        return decodeURIComponent(escape(t.bin.bytesToString(n)));
+      }
+    },
+    // Binary encoding
+    bin: {
+      // Convert a string to a byte array
+      stringToBytes: function(n) {
+        for (var e = [], r = 0; r < n.length; r++)
+          e.push(n.charCodeAt(r) & 255);
+        return e;
+      },
+      // Convert a byte array to a string
+      bytesToString: function(n) {
+        for (var e = [], r = 0; r < n.length; r++)
+          e.push(String.fromCharCode(n[r]));
+        return e.join("");
+      }
+    }
+  };
+  return o = t, o;
 }
 export {
-  o as pad
+  c as __require
 };

package/dist/native/index.native128.js

@@ -1,4 +1,23 @@
-var r = { exports: {} };
+/*!
+ * Determine if an object is a Buffer
+ *
+ * @author   Feross Aboukhadijeh <https://feross.org>
+ * @license  MIT
+ */
+var f, e;
+function t() {
+  if (e) return f;
+  e = 1, f = function(r) {
+    return r != null && (u(r) || n(r) || !!r._isBuffer);
+  };
+  function u(r) {
+    return !!r.constructor && typeof r.constructor.isBuffer == "function" && r.constructor.isBuffer(r);
+  }
+  function n(r) {
+    return typeof r.readFloatLE == "function" && typeof r.slice == "function" && u(r.slice(0, 0));
+  }
+  return f;
+}
 export {
-  r as __module
+  t as __require
 };

package/dist/native/index.native129.js

@@ -1,7 +1,22 @@
-const e = 32, s = 4096, t = 131072, l = 761855;
+const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
+function s(t, r = !1) {
+  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+}
+function h(t, r = !1) {
+  const n = t.length;
+  let l = new Uint32Array(n), c = new Uint32Array(n);
+  for (let e = 0; e < n; e++) {
+    const { h: u, l: f } = s(t[e], r);
+    [l[e], c[e]] = [u, f];
+  }
+  return [l, c];
+}
+const m = (t, r, n) => t << n | r >>> 32 - n, A = (t, r, n) => r << n | t >>> 32 - n, B = (t, r, n) => r << n - 32 | t >>> 64 - n, a = (t, r, n) => t << n - 32 | r >>> 64 - n;
 export {
-  t as bytesPerBlob,
-  e as bytesPerFieldElement,
-  s as fieldElementsPerBlob,
-  l as maxBytesPerTransaction
+  s as fromBig,
+  B as rotlBH,
+  a as rotlBL,
+  m as rotlSH,
+  A as rotlSL,
+  h as split
 };

package/dist/native/index.native130.js

@@ -1,4 +1,82 @@
-const o = "0.1.1";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function o(e) {
+  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
+}
+function w(e) {
+  if (!Number.isSafeInteger(e) || e < 0)
+    throw new Error("positive integer expected, got " + e);
+}
+function r(e, ...t) {
+  if (!o(e))
+    throw new Error("Uint8Array expected");
+  if (t.length > 0 && !t.includes(e.length))
+    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
+}
+function h(e, t = !0) {
+  if (e.destroyed)
+    throw new Error("Hash instance has been destroyed");
+  if (t && e.finished)
+    throw new Error("Hash#digest() has already been called");
+}
+function l(e, t) {
+  r(e);
+  const n = t.outputLen;
+  if (e.length < n)
+    throw new Error("digestInto() expects output buffer of length at least " + n);
+}
+function a(e) {
+  return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
+}
+function g(...e) {
+  for (let t = 0; t < e.length; t++)
+    e[t].fill(0);
+}
+function p(e) {
+  return new DataView(e.buffer, e.byteOffset, e.byteLength);
+}
+function b(e, t) {
+  return e << 32 - t | e >>> t;
+}
+const i = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function u(e) {
+  return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
+}
+function c(e) {
+  for (let t = 0; t < e.length; t++)
+    e[t] = u(e[t]);
+  return e;
+}
+const x = i ? (e) => e : c;
+function s(e) {
+  if (typeof e != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(e));
+}
+function y(e) {
+  return typeof e == "string" && (e = s(e)), r(e), e;
+}
+class d {
+}
+function E(e) {
+  const t = (f) => e().update(y(f)).digest(), n = e();
+  return t.outputLen = n.outputLen, t.blockLen = n.blockLen, t.create = () => e(), t;
+}
 export {
-  o as version
+  d as Hash,
+  r as abytes,
+  h as aexists,
+  w as anumber,
+  l as aoutput,
+  u as byteSwap,
+  c as byteSwap32,
+  g as clean,
+  E as createHasher,
+  p as createView,
+  o as isBytes,
+  i as isLE,
+  b as rotr,
+  x as swap32IfBE,
+  y as toBytes,
+  a as u32,
+  s as utf8ToBytes
 };