@gardenfi/swap 0.1.3-beta.1 → 0.1.3-beta.11

package/dist/index346.js

@@ -1,217 +1,19 @@
-import { anumber as C } from "./index340.js";
-import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index359.js";
+import { hmac as c } from "./index379.js";
+import { randomBytes as m, concatBytes as n } from "./index341.js";
+import { weierstrass as a } from "./index380.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
-function w(t, n) {
-  const o = t % n;
-  return o >= d ? o : n + o;
-}
-function $(t, n, o) {
-  let r = t;
-  for (; n-- > d; )
-    r *= r, r %= o;
-  return r;
-}
-function B(t, n) {
-  if (t === d)
-    throw new Error("invert: expected non-zero number");
-  if (n <= d)
-    throw new Error("invert: expected positive modulus, got " + n);
-  let o = w(t, n), r = n, s = d, l = f;
-  for (; o !== d; ) {
-    const c = r / o, e = r % o, i = s - l * c;
-    r = o, o = e, s = l, l = i;
-  }
-  if (r !== f)
-    throw new Error("invert: does not exist");
-  return w(s, n);
-}
-function M(t, n) {
-  const o = (t.ORDER + f) / L, r = t.pow(n, o);
-  if (!t.eql(t.sqr(r), n))
-    throw new Error("Cannot find square root");
-  return r;
-}
-function H(t, n) {
-  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
-  if (!t.eql(t.sqr(c), n))
-    throw new Error("Cannot find square root");
-  return c;
-}
-function K(t) {
-  if (t < BigInt(3))
-    throw new Error("sqrt is not defined for small field");
-  let n = t - f, o = 0;
-  for (; n % g === d; )
-    n /= g, o++;
-  let r = g;
-  const s = J(t);
-  for (; N(s, r) === 1; )
-    if (r++ > 1e3)
-      throw new Error("Cannot find square root: probably non-prime P");
-  if (o === 1)
-    return M;
-  let l = s.pow(r, n);
-  const u = (n + f) / g;
-  return function(e, i) {
-    if (e.is0(i))
-      return i;
-    if (N(e, i) !== 1)
-      throw new Error("Cannot find square root");
-    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
-    for (; !e.eql(a, e.ONE); ) {
-      if (e.is0(a))
-        return e.ZERO;
-      let q = 1, v = e.sqr(a);
-      for (; !e.eql(v, e.ONE); )
-        if (q++, v = e.sqr(v), q === h)
-          throw new Error("Cannot find square root");
-      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
-      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
-    }
-    return m;
+function i(r) {
+  return {
+    hash: r,
+    hmac: (e, ...t) => c(r, e, n(...t)),
+    randomBytes: m
   };
 }
-function Q(t) {
-  return t % L === j ? M : t % T === _ ? H : K(t);
-}
-const V = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
-];
-function P(t) {
-  const n = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
-  return z(t, o);
-}
-function Y(t, n, o) {
-  if (o < d)
-    throw new Error("invalid exponent, negatives unsupported");
-  if (o === d)
-    return t.ONE;
-  if (o === f)
-    return n;
-  let r = t.ONE, s = n;
-  for (; o > d; )
-    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
-  return r;
-}
-function k(t, n, o = !1) {
-  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
-  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
-}
-function N(t, n) {
-  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
-  if (!s && !l && !u)
-    throw new Error("invalid Legendre symbol result");
-  return s ? 1 : l ? 0 : -1;
-}
-function G(t, n) {
-  n !== void 0 && C(n);
-  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
-  return { nBitLength: o, nByteLength: r };
-}
-function J(t, n, o = !1, r = {}) {
-  if (t <= d)
-    throw new Error("invalid field: expected ORDER > 0, got " + t);
-  const { nBitLength: s, nByteLength: l } = G(t, n);
-  if (l > 2048)
-    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
-  let u;
-  const c = Object.freeze({
-    ORDER: t,
-    isLE: o,
-    BITS: s,
-    BYTES: l,
-    MASK: Z(s),
-    ZERO: d,
-    ONE: f,
-    create: (e) => w(e, t),
-    isValid: (e) => {
-      if (typeof e != "bigint")
-        throw new Error("invalid field element: expected bigint, got " + typeof e);
-      return d <= e && e < t;
-    },
-    is0: (e) => e === d,
-    isOdd: (e) => (e & f) === f,
-    neg: (e) => w(-e, t),
-    eql: (e, i) => e === i,
-    sqr: (e) => w(e * e, t),
-    add: (e, i) => w(e + i, t),
-    sub: (e, i) => w(e - i, t),
-    mul: (e, i) => w(e * i, t),
-    pow: (e, i) => Y(c, e, i),
-    div: (e, i) => w(e * B(i, t), t),
-    // Same as above, but doesn't normalize
-    sqrN: (e) => e * e,
-    addN: (e, i) => e + i,
-    subN: (e, i) => e - i,
-    mulN: (e, i) => e * i,
-    inv: (e) => B(e, t),
-    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
-    toBytes: (e) => o ? I(e, l) : y(e, l),
-    fromBytes: (e) => {
-      if (e.length !== l)
-        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
-      return o ? S(e) : x(e);
-    },
-    // TODO: we don't need it here, move out to separate fn
-    invertBatch: (e) => k(c, e),
-    // We can't move this out because Fp6, Fp12 implement it
-    // and it's unclear what to return in there.
-    cmov: (e, i, h) => h ? i : e
-  });
-  return Object.freeze(c);
-}
-function O(t) {
-  if (typeof t != "bigint")
-    throw new Error("field order must be bigint");
-  const n = t.toString(2).length;
-  return Math.ceil(n / 8);
-}
-function U(t) {
-  const n = O(t);
-  return n + Math.ceil(n / 2);
-}
-function D(t, n, o = !1) {
-  const r = t.length, s = O(n), l = U(n);
-  if (r < 16 || r < l || r > 1024)
-    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
-  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
-  return o ? I(c, s) : y(c, s);
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
 }
 export {
-  J as Field,
-  k as FpInvertBatch,
-  N as FpLegendre,
-  Y as FpPow,
-  Q as FpSqrt,
-  O as getFieldBytesLength,
-  U as getMinHashLength,
-  B as invert,
-  D as mapHashToField,
-  w as mod,
-  G as nLength,
-  $ as pow2,
-  K as tonelliShanks,
-  P as validateField
+  p as createCurve,
+  i as getHash
 };

package/dist/index347.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index247.cjs"),o=require("./index348.cjs"),n=require("./index277.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index341.cjs"),a=require("./index360.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const d=BigInt(0),f=BigInt(1),h=BigInt(2),K=BigInt(3),I=BigInt(4),L=BigInt(5),T=BigInt(8);function g(t,n){const o=t%n;return o>=d?o:n+o}function Q(t,n,o){let r=t;for(;n-- >d;)r*=r,r%=o;return r}function B(t,n){if(t===d)throw new Error("invert: expected non-zero number");if(n<=d)throw new Error("invert: expected positive modulus, got "+n);let o=g(t,n),r=n,s=d,l=f;for(;o!==d;){const c=r/o,e=r%o,i=s-l*c;r=o,o=e,s=l,l=i}if(r!==f)throw new Error("invert: does not exist");return g(s,n)}function x(t,n){const o=(t.ORDER+f)/I,r=t.pow(n,o);if(!t.eql(t.sqr(r),n))throw new Error("Cannot find square root");return r}function V(t,n){const o=(t.ORDER-L)/T,r=t.mul(n,h),s=t.pow(r,o),l=t.mul(n,s),u=t.mul(t.mul(l,h),s),c=t.mul(l,t.sub(u,t.ONE));if(!t.eql(t.sqr(c),n))throw new Error("Cannot find square root");return c}function _(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let n=t-f,o=0;for(;n%h===d;)n/=h,o++;let r=h;const s=Z(t);for(;y(s,r)===1;)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(o===1)return x;let l=s.pow(r,n);const u=(n+f)/h;return function(e,i){if(e.is0(i))return i;if(y(e,i)!==1)throw new Error("Cannot find square root");let w=o,v=e.mul(e.ONE,l),b=e.pow(i,n),E=e.pow(i,u);for(;!e.eql(b,e.ONE);){if(e.is0(b))return e.ZERO;let q=1,m=e.sqr(b);for(;!e.eql(m,e.ONE);)if(q++,m=e.sqr(m),q===w)throw new Error("Cannot find square root");const z=f<<BigInt(w-q-1),S=e.pow(v,z);w=q,v=e.sqr(S),b=e.mul(b,v),E=e.mul(E,S)}return E}}function M(t){return t%I===K?x:t%T===L?V:_(t)}const Y=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function k(t){const n={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},o=Y.reduce((r,s)=>(r[s]="function",r),n);return a.validateObject(t,o)}function O(t,n,o){if(o<d)throw new Error("invalid exponent, negatives unsupported");if(o===d)return t.ONE;if(o===f)return n;let r=t.ONE,s=n;for(;o>d;)o&f&&(r=t.mul(r,s)),s=t.sqr(s),o>>=f;return r}function A(t,n,o=!1){const r=new Array(n.length).fill(o?t.ZERO:void 0),s=n.reduce((u,c,e)=>t.is0(c)?u:(r[e]=u,t.mul(u,c)),t.ONE),l=t.inv(s);return n.reduceRight((u,c,e)=>t.is0(c)?u:(r[e]=t.mul(u,r[e]),t.mul(u,c)),l),r}function y(t,n){const o=(t.ORDER-f)/h,r=t.pow(n,o),s=t.eql(r,t.ONE),l=t.eql(r,t.ZERO),u=t.eql(r,t.neg(t.ONE));if(!s&&!l&&!u)throw new Error("invalid Legendre symbol result");return s?1:l?0:-1}function C(t,n){n!==void 0&&H.anumber(n);const o=n!==void 0?n:t.toString(2).length,r=Math.ceil(o/8);return{nBitLength:o,nByteLength:r}}function Z(t,n,o=!1,r={}){if(t<=d)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:s,nByteLength:l}=C(t,n);if(l>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let u;const c=Object.freeze({ORDER:t,isLE:o,BITS:s,BYTES:l,MASK:a.bitMask(s),ZERO:d,ONE:f,create:e=>g(e,t),isValid:e=>{if(typeof e!="bigint")throw new Error("invalid field element: expected bigint, got "+typeof e);return d<=e&&e<t},is0:e=>e===d,isOdd:e=>(e&f)===f,neg:e=>g(-e,t),eql:(e,i)=>e===i,sqr:e=>g(e*e,t),add:(e,i)=>g(e+i,t),sub:(e,i)=>g(e-i,t),mul:(e,i)=>g(e*i,t),pow:(e,i)=>O(c,e,i),div:(e,i)=>g(e*B(i,t),t),sqrN:e=>e*e,addN:(e,i)=>e+i,subN:(e,i)=>e-i,mulN:(e,i)=>e*i,inv:e=>B(e,t),sqrt:r.sqrt||(e=>(u||(u=M(t)),u(c,e))),toBytes:e=>o?a.numberToBytesLE(e,l):a.numberToBytesBE(e,l),fromBytes:e=>{if(e.length!==l)throw new Error("Field.fromBytes: expected "+l+" bytes, got "+e.length);return o?a.bytesToNumberLE(e):a.bytesToNumberBE(e)},invertBatch:e=>A(c,e),cmov:(e,i,w)=>w?i:e});return Object.freeze(c)}function N(t){if(typeof t!="bigint")throw new Error("field order must be bigint");const n=t.toString(2).length;return Math.ceil(n/8)}function j(t){const n=N(t);return n+Math.ceil(n/2)}function P(t,n,o=!1){const r=t.length,s=N(n),l=j(n);if(r<16||r<l||r>1024)throw new Error("expected "+l+"-1024 bytes of input, got "+r);const u=o?a.bytesToNumberLE(t):a.bytesToNumberBE(t),c=g(u,n-f)+f;return o?a.numberToBytesLE(c,s):a.numberToBytesBE(c,s)}exports.Field=Z;exports.FpInvertBatch=A;exports.FpLegendre=y;exports.FpPow=O;exports.FpSqrt=M;exports.getFieldBytesLength=N;exports.getMinHashLength=j;exports.invert=B;exports.mapHashToField=P;exports.mod=g;exports.nLength=C;exports.pow2=Q;exports.tonelliShanks=_;exports.validateField=k;

package/dist/index347.js

@@ -1,10 +1,217 @@
-import { keccak_256 as f } from "./index247.js";
-import { from as m } from "./index348.js";
-import { fromBytes as s } from "./index277.js";
-function p(t, o = {}) {
-  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
-  return e === "Bytes" ? r : s(r);
+import { anumber as C } from "./index341.js";
+import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index360.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), f = BigInt(1), g = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(3), L = /* @__PURE__ */ BigInt(4), _ = /* @__PURE__ */ BigInt(5), T = /* @__PURE__ */ BigInt(8);
+function w(t, n) {
+  const o = t % n;
+  return o >= d ? o : n + o;
+}
+function $(t, n, o) {
+  let r = t;
+  for (; n-- > d; )
+    r *= r, r %= o;
+  return r;
+}
+function B(t, n) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (n <= d)
+    throw new Error("invert: expected positive modulus, got " + n);
+  let o = w(t, n), r = n, s = d, l = f;
+  for (; o !== d; ) {
+    const c = r / o, e = r % o, i = s - l * c;
+    r = o, o = e, s = l, l = i;
+  }
+  if (r !== f)
+    throw new Error("invert: does not exist");
+  return w(s, n);
+}
+function M(t, n) {
+  const o = (t.ORDER + f) / L, r = t.pow(n, o);
+  if (!t.eql(t.sqr(r), n))
+    throw new Error("Cannot find square root");
+  return r;
+}
+function H(t, n) {
+  const o = (t.ORDER - _) / T, r = t.mul(n, g), s = t.pow(r, o), l = t.mul(n, s), u = t.mul(t.mul(l, g), s), c = t.mul(l, t.sub(u, t.ONE));
+  if (!t.eql(t.sqr(c), n))
+    throw new Error("Cannot find square root");
+  return c;
+}
+function K(t) {
+  if (t < BigInt(3))
+    throw new Error("sqrt is not defined for small field");
+  let n = t - f, o = 0;
+  for (; n % g === d; )
+    n /= g, o++;
+  let r = g;
+  const s = J(t);
+  for (; N(s, r) === 1; )
+    if (r++ > 1e3)
+      throw new Error("Cannot find square root: probably non-prime P");
+  if (o === 1)
+    return M;
+  let l = s.pow(r, n);
+  const u = (n + f) / g;
+  return function(e, i) {
+    if (e.is0(i))
+      return i;
+    if (N(e, i) !== 1)
+      throw new Error("Cannot find square root");
+    let h = o, b = e.mul(e.ONE, l), a = e.pow(i, n), m = e.pow(i, u);
+    for (; !e.eql(a, e.ONE); ) {
+      if (e.is0(a))
+        return e.ZERO;
+      let q = 1, v = e.sqr(a);
+      for (; !e.eql(v, e.ONE); )
+        if (q++, v = e.sqr(v), q === h)
+          throw new Error("Cannot find square root");
+      const A = f << BigInt(h - q - 1), E = e.pow(b, A);
+      h = q, b = e.sqr(E), a = e.mul(a, b), m = e.mul(m, E);
+    }
+    return m;
+  };
+}
+function Q(t) {
+  return t % L === j ? M : t % T === _ ? H : K(t);
+}
+const V = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function P(t) {
+  const n = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, o = V.reduce((r, s) => (r[s] = "function", r), n);
+  return z(t, o);
+}
+function Y(t, n, o) {
+  if (o < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (o === d)
+    return t.ONE;
+  if (o === f)
+    return n;
+  let r = t.ONE, s = n;
+  for (; o > d; )
+    o & f && (r = t.mul(r, s)), s = t.sqr(s), o >>= f;
+  return r;
+}
+function k(t, n, o = !1) {
+  const r = new Array(n.length).fill(o ? t.ZERO : void 0), s = n.reduce((u, c, e) => t.is0(c) ? u : (r[e] = u, t.mul(u, c)), t.ONE), l = t.inv(s);
+  return n.reduceRight((u, c, e) => t.is0(c) ? u : (r[e] = t.mul(u, r[e]), t.mul(u, c)), l), r;
+}
+function N(t, n) {
+  const o = (t.ORDER - f) / g, r = t.pow(n, o), s = t.eql(r, t.ONE), l = t.eql(r, t.ZERO), u = t.eql(r, t.neg(t.ONE));
+  if (!s && !l && !u)
+    throw new Error("invalid Legendre symbol result");
+  return s ? 1 : l ? 0 : -1;
+}
+function G(t, n) {
+  n !== void 0 && C(n);
+  const o = n !== void 0 ? n : t.toString(2).length, r = Math.ceil(o / 8);
+  return { nBitLength: o, nByteLength: r };
+}
+function J(t, n, o = !1, r = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: l } = G(t, n);
+  if (l > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let u;
+  const c = Object.freeze({
+    ORDER: t,
+    isLE: o,
+    BITS: s,
+    BYTES: l,
+    MASK: Z(s),
+    ZERO: d,
+    ONE: f,
+    create: (e) => w(e, t),
+    isValid: (e) => {
+      if (typeof e != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof e);
+      return d <= e && e < t;
+    },
+    is0: (e) => e === d,
+    isOdd: (e) => (e & f) === f,
+    neg: (e) => w(-e, t),
+    eql: (e, i) => e === i,
+    sqr: (e) => w(e * e, t),
+    add: (e, i) => w(e + i, t),
+    sub: (e, i) => w(e - i, t),
+    mul: (e, i) => w(e * i, t),
+    pow: (e, i) => Y(c, e, i),
+    div: (e, i) => w(e * B(i, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (e) => e * e,
+    addN: (e, i) => e + i,
+    subN: (e, i) => e - i,
+    mulN: (e, i) => e * i,
+    inv: (e) => B(e, t),
+    sqrt: r.sqrt || ((e) => (u || (u = Q(t)), u(c, e))),
+    toBytes: (e) => o ? I(e, l) : y(e, l),
+    fromBytes: (e) => {
+      if (e.length !== l)
+        throw new Error("Field.fromBytes: expected " + l + " bytes, got " + e.length);
+      return o ? S(e) : x(e);
+    },
+    // TODO: we don't need it here, move out to separate fn
+    invertBatch: (e) => k(c, e),
+    // We can't move this out because Fp6, Fp12 implement it
+    // and it's unclear what to return in there.
+    cmov: (e, i, h) => h ? i : e
+  });
+  return Object.freeze(c);
+}
+function O(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const n = t.toString(2).length;
+  return Math.ceil(n / 8);
+}
+function U(t) {
+  const n = O(t);
+  return n + Math.ceil(n / 2);
+}
+function D(t, n, o = !1) {
+  const r = t.length, s = O(n), l = U(n);
+  if (r < 16 || r < l || r > 1024)
+    throw new Error("expected " + l + "-1024 bytes of input, got " + r);
+  const u = o ? S(t) : x(t), c = w(u, n - f) + f;
+  return o ? I(c, s) : y(c, s);
 }
 export {
-  p as keccak256
+  J as Field,
+  k as FpInvertBatch,
+  N as FpLegendre,
+  Y as FpPow,
+  Q as FpSqrt,
+  O as getFieldBytesLength,
+  U as getMinHashLength,
+  B as invert,
+  D as mapHashToField,
+  w as mod,
+  G as nLength,
+  $ as pow2,
+  K as tonelliShanks,
+  P as validateField
 };

package/dist/index348.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index278.cjs"),s=require("./index277.cjs"),o=require("./index358.cjs"),S=require("./index279.cjs"),x=new TextDecoder,E=new TextEncoder;function p(e){return e instanceof Uint8Array?e:typeof e=="string"?b(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function b(e,t={}){const{size:n}=t;let r=e;n&&(S.assertSize(e,n),r=s.padRight(e,n));let i=r.slice(2);i.length%2&&(i=`0${i}`);const u=i.length/2,d=new Uint8Array(u);for(let f=0,c=0;f<u;f++){const l=o.charCodeToBase16(i.charCodeAt(c++)),y=o.charCodeToBase16(i.charCodeAt(c++));if(l===void 0||y===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[c-2]}${i[c-1]}" in "${i}").`);d[f]=l<<4|y}return d}function w(e,t={}){const{size:n}=t,r=E.encode(e);return typeof n=="number"?(o.assertSize(r,n),h(r,n)):r}function h(e,t){return o.pad(e,{dir:"right",size:t})}function $(e){return e.length}function v(e,t,n,r={}){const{strict:i}=r;return e.slice(t,n)}function A(e,t={}){const{size:n}=t;typeof n<"u"&&o.assertSize(e,n);const r=s.fromBytes(e,t);return s.toBigInt(r,t)}function I(e,t={}){const{size:n}=t;let r=e;if(typeof n<"u"&&(o.assertSize(r,n),r=m(r)),r.length>1||r[0]>1)throw new B(r);return!!r[0]}function O(e,t={}){const{size:n}=t;typeof n<"u"&&o.assertSize(e,n);const r=s.fromBytes(e,t);return s.toNumber(r,t)}function P(e,t={}){const{size:n}=t;let r=e;return typeof n<"u"&&(o.assertSize(r,n),r=z(r)),x.decode(r)}function m(e){return o.trim(e,{dir:"left"})}function z(e){return o.trim(e,{dir:"right"})}class B extends a.BaseError{constructor(t){super(`Bytes value \`${t}\` is not a valid boolean.`,{metaMessages:["The bytes array must contain a single byte of either a `0` or `1` value."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.InvalidBytesBooleanError"})}}class C extends a.BaseError{constructor({givenSize:t,maxSize:n}){super(`Size cannot exceed \`${n}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class R extends a.BaseError{constructor({size:t,targetSize:n,type:r}){super(`${r.charAt(0).toUpperCase()}${r.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${n}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.InvalidBytesBooleanError=B;exports.SizeExceedsPaddingSizeError=R;exports.SizeOverflowError=C;exports.from=p;exports.fromArray=g;exports.fromHex=b;exports.fromString=w;exports.padRight=h;exports.size=$;exports.slice=v;exports.toBigInt=A;exports.toBoolean=I;exports.toNumber=O;exports.toString=P;exports.trimLeft=m;exports.trimRight=z;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index249.cjs"),o=require("./index349.cjs"),n=require("./index278.cjs");function i(e,r={}){const{as:s=typeof e=="string"?"Hex":"Bytes"}=r,t=c.keccak_256(o.from(e));return s==="Bytes"?t:n.fromBytes(t)}exports.keccak256=i;

package/dist/index348.js

@@ -1,122 +1,10 @@
-import { BaseError as c } from "./index278.js";
-import { padRight as g, fromBytes as m, toNumber as h, toBigInt as z } from "./index277.js";
-import { charCodeToBase16 as b, assertSize as o, trim as y, pad as p } from "./index358.js";
-import { assertSize as x } from "./index279.js";
-const B = /* @__PURE__ */ new TextDecoder(), $ = /* @__PURE__ */ new TextEncoder();
-function U(e) {
-  return e instanceof Uint8Array ? e : typeof e == "string" ? S(e) : w(e);
-}
-function w(e) {
-  return e instanceof Uint8Array ? e : new Uint8Array(e);
-}
-function S(e, r = {}) {
-  const { size: n } = r;
-  let t = e;
-  n && (x(e, n), t = g(e, n));
-  let i = t.slice(2);
-  i.length % 2 && (i = `0${i}`);
-  const a = i.length / 2, f = new Uint8Array(a);
-  for (let u = 0, s = 0; u < a; u++) {
-    const d = b(i.charCodeAt(s++)), l = b(i.charCodeAt(s++));
-    if (d === void 0 || l === void 0)
-      throw new c(`Invalid byte sequence ("${i[s - 2]}${i[s - 1]}" in "${i}").`);
-    f[u] = d << 4 | l;
-  }
-  return f;
-}
-function j(e, r = {}) {
-  const { size: n } = r, t = $.encode(e);
-  return typeof n == "number" ? (o(t, n), E(t, n)) : t;
-}
-function E(e, r) {
-  return p(e, { dir: "right", size: r });
-}
-function T(e) {
-  return e.length;
-}
-function _(e, r, n, t = {}) {
-  const { strict: i } = t;
-  return e.slice(r, n);
-}
-function L(e, r = {}) {
-  const { size: n } = r;
-  typeof n < "u" && o(e, n);
-  const t = m(e, r);
-  return z(t, r);
-}
-function N(e, r = {}) {
-  const { size: n } = r;
-  let t = e;
-  if (typeof n < "u" && (o(t, n), t = A(t)), t.length > 1 || t[0] > 1)
-    throw new I(t);
-  return !!t[0];
-}
-function q(e, r = {}) {
-  const { size: n } = r;
-  typeof n < "u" && o(e, n);
-  const t = m(e, r);
-  return h(t, r);
-}
-function D(e, r = {}) {
-  const { size: n } = r;
-  let t = e;
-  return typeof n < "u" && (o(t, n), t = v(t)), B.decode(t);
-}
-function A(e) {
-  return y(e, { dir: "left" });
-}
-function v(e) {
-  return y(e, { dir: "right" });
-}
-class I extends c {
-  constructor(r) {
-    super(`Bytes value \`${r}\` is not a valid boolean.`, {
-      metaMessages: [
-        "The bytes array must contain a single byte of either a `0` or `1` value."
-      ]
-    }), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.InvalidBytesBooleanError"
-    });
-  }
-}
-class G extends c {
-  constructor({ givenSize: r, maxSize: n }) {
-    super(`Size cannot exceed \`${n}\` bytes. Given size: \`${r}\` bytes.`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.SizeOverflowError"
-    });
-  }
-}
-class H extends c {
-  constructor({ size: r, targetSize: n, type: t }) {
-    super(`${t.charAt(0).toUpperCase()}${t.slice(1).toLowerCase()} size (\`${r}\`) exceeds padding size (\`${n}\`).`), Object.defineProperty(this, "name", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: "Bytes.SizeExceedsPaddingSizeError"
-    });
-  }
+import { keccak_256 as f } from "./index249.js";
+import { from as m } from "./index349.js";
+import { fromBytes as s } from "./index278.js";
+function p(t, o = {}) {
+  const { as: e = typeof t == "string" ? "Hex" : "Bytes" } = o, r = f(m(t));
+  return e === "Bytes" ? r : s(r);
 }
 export {
-  I as InvalidBytesBooleanError,
-  H as SizeExceedsPaddingSizeError,
-  G as SizeOverflowError,
-  U as from,
-  w as fromArray,
-  S as fromHex,
-  j as fromString,
-  E as padRight,
-  T as size,
-  _ as slice,
-  L as toBigInt,
-  N as toBoolean,
-  q as toNumber,
-  D as toString,
-  A as trimLeft,
-  v as trimRight
+  p as keccak256
 };

package/dist/index349.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index350.cjs"),f=require("./index348.cjs"),d=require("./index278.cjs"),i=require("./index277.cjs"),y=require("./index351.cjs"),S=require("./index352.cjs"),g=require("./index282.cjs"),E=require("./index294.cjs"),$=require("./index286.cjs");function M(e,r,n={}){const{as:t="Array",checksumAddress:a=!1}=n,s=typeof r=="string"?f.fromHex(r):r,m=S.create(s);if(f.size(s)===0&&e.length>0)throw new P;if(f.size(s)&&f.size(s)<32)throw new A({data:typeof r=="string"?r:i.fromBytes(r),parameters:e,size:f.size(s)});let h=0;const c=t==="Array"?[]:{};for(let o=0;o<e.length;++o){const u=e[o];m.setPosition(h);const[l,z]=y.decodeParameter(m,u,{checksumAddress:a,staticPosition:0});h+=z,t==="Array"?c.push(l):c[u.name??o]=l}return c}function L(e,r,n){const{checksumAddress:t=!1}={};if(e.length!==r.length)throw new p({expectedLength:e.length,givenLength:r.length});const a=y.prepareParameters({checksumAddress:t,parameters:e,values:r}),s=y.encode(a);return s.length===0?"0x":s}function b(e,r){if(e.length!==r.length)throw new p({expectedLength:e.length,givenLength:r.length});const n=[];for(let t=0;t<e.length;t++){const a=e[t],s=r[t];n.push(b.encode(a,s))}return i.concat(...n)}(function(e){function r(n,t,a=!1){if(n==="address"){const c=t;return B.assert(c),i.padLeft(c.toLowerCase(),a?32:0)}if(n==="string")return i.fromString(t);if(n==="bytes")return t;if(n==="bool")return i.padLeft(i.fromBoolean(t),a?32:1);const s=n.match(g.integerRegex);if(s){const[c,o,u="256"]=s,l=Number.parseInt(u,10)/8;return i.fromNumber(t,{size:a?32:l,signed:o==="int"})}const m=n.match(g.bytesRegex);if(m){const[c,o]=m;if(Number.parseInt(o,10)!==(t.length-2)/2)throw new w({expectedSize:Number.parseInt(o,10),value:t});return i.padRight(t,a?32:0)}const h=n.match(g.arrayRegex);if(h&&Array.isArray(t)){const[c,o]=h,u=[];for(let l=0;l<t.length;l++)u.push(r(o,t[l],!0));return u.length===0?"0x":i.concat(...u)}throw new x(n)}e.encode=r})(b||(b={}));function v(e){return Array.isArray(e)&&typeof e[0]=="string"||typeof e=="string"?E.parseAbiParameters(e):e}class A extends d.BaseError{constructor({data:r,parameters:n,size:t}){super(`Data size of ${t} bytes is too small for given parameters.`,{metaMessages:[`Params: (${$.formatAbiParameters(n)})`,`Data:   ${r} (${t} bytes)`]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.DataSizeTooSmallError"})}}class P extends d.BaseError{constructor(){super('Cannot decode zero data ("0x") with ABI parameters.'),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ZeroDataError"})}}class I extends d.BaseError{constructor({expectedLength:r,givenLength:n,type:t}){super(`Array length mismatch for type \`${t}\`. Expected: \`${r}\`. Given: \`${n}\`.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.ArrayLengthMismatchError"})}}class w extends d.BaseError{constructor({expectedSize:r,value:n}){super(`Size of bytes "${n}" (bytes${i.size(n)}) does not match expected size (bytes${r}).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.BytesSizeMismatchError"})}}class p extends d.BaseError{constructor({expectedLength:r,givenLength:n}){super(["ABI encoding parameters/values length mismatch.",`Expected length (parameters): ${r}`,`Given length (values): ${n}`].join(`
-`)),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.LengthMismatchError"})}}class T extends d.BaseError{constructor(r){super(`Value \`${r}\` is not a valid array.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidArrayError"})}}class x extends d.BaseError{constructor(r){super(`Type \`${r}\` is not a valid ABI Type.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiParameters.InvalidTypeError"})}}exports.ArrayLengthMismatchError=I;exports.BytesSizeMismatchError=w;exports.DataSizeTooSmallError=A;exports.InvalidArrayError=T;exports.InvalidTypeError=x;exports.LengthMismatchError=p;exports.ZeroDataError=P;exports.decode=M;exports.encode=L;exports.encodePacked=b;exports.from=v;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index279.cjs"),s=require("./index278.cjs"),o=require("./index358.cjs"),S=require("./index280.cjs"),x=new TextDecoder,E=new TextEncoder;function p(e){return e instanceof Uint8Array?e:typeof e=="string"?b(e):g(e)}function g(e){return e instanceof Uint8Array?e:new Uint8Array(e)}function b(e,t={}){const{size:n}=t;let r=e;n&&(S.assertSize(e,n),r=s.padRight(e,n));let i=r.slice(2);i.length%2&&(i=`0${i}`);const u=i.length/2,d=new Uint8Array(u);for(let f=0,c=0;f<u;f++){const l=o.charCodeToBase16(i.charCodeAt(c++)),y=o.charCodeToBase16(i.charCodeAt(c++));if(l===void 0||y===void 0)throw new a.BaseError(`Invalid byte sequence ("${i[c-2]}${i[c-1]}" in "${i}").`);d[f]=l<<4|y}return d}function w(e,t={}){const{size:n}=t,r=E.encode(e);return typeof n=="number"?(o.assertSize(r,n),h(r,n)):r}function h(e,t){return o.pad(e,{dir:"right",size:t})}function $(e){return e.length}function v(e,t,n,r={}){const{strict:i}=r;return e.slice(t,n)}function A(e,t={}){const{size:n}=t;typeof n<"u"&&o.assertSize(e,n);const r=s.fromBytes(e,t);return s.toBigInt(r,t)}function I(e,t={}){const{size:n}=t;let r=e;if(typeof n<"u"&&(o.assertSize(r,n),r=m(r)),r.length>1||r[0]>1)throw new B(r);return!!r[0]}function O(e,t={}){const{size:n}=t;typeof n<"u"&&o.assertSize(e,n);const r=s.fromBytes(e,t);return s.toNumber(r,t)}function P(e,t={}){const{size:n}=t;let r=e;return typeof n<"u"&&(o.assertSize(r,n),r=z(r)),x.decode(r)}function m(e){return o.trim(e,{dir:"left"})}function z(e){return o.trim(e,{dir:"right"})}class B extends a.BaseError{constructor(t){super(`Bytes value \`${t}\` is not a valid boolean.`,{metaMessages:["The bytes array must contain a single byte of either a `0` or `1` value."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.InvalidBytesBooleanError"})}}class C extends a.BaseError{constructor({givenSize:t,maxSize:n}){super(`Size cannot exceed \`${n}\` bytes. Given size: \`${t}\` bytes.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeOverflowError"})}}class R extends a.BaseError{constructor({size:t,targetSize:n,type:r}){super(`${r.charAt(0).toUpperCase()}${r.slice(1).toLowerCase()} size (\`${t}\`) exceeds padding size (\`${n}\`).`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"Bytes.SizeExceedsPaddingSizeError"})}}exports.InvalidBytesBooleanError=B;exports.SizeExceedsPaddingSizeError=R;exports.SizeOverflowError=C;exports.from=p;exports.fromArray=g;exports.fromHex=b;exports.fromString=w;exports.padRight=h;exports.size=$;exports.slice=v;exports.toBigInt=A;exports.toBoolean=I;exports.toNumber=O;exports.toString=P;exports.trimLeft=m;exports.trimRight=z;