@gardenfi/swap 0.0.1 → 0.0.2

package/dist/index345.js

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

package/dist/index346.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index376.cjs"),x=require("./index345.cjs"),_=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),f=new Uint32Array(64);class u extends e.HashMD{constructor(o=32){super(64,o,8,!1),this.A=e.SHA256_IV[0]|0,this.B=e.SHA256_IV[1]|0,this.C=e.SHA256_IV[2]|0,this.D=e.SHA256_IV[3]|0,this.E=e.SHA256_IV[4]|0,this.F=e.SHA256_IV[5]|0,this.G=e.SHA256_IV[6]|0,this.H=e.SHA256_IV[7]|0}get(){const{A:o,B:h,C:s,D:a,E:r,F:b,G:c,H:i}=this;return[o,h,s,a,r,b,c,i]}set(o,h,s,a,r,b,c,i){this.A=o|0,this.B=h|0,this.C=s|0,this.D=a|0,this.E=r|0,this.F=b|0,this.G=c|0,this.H=i|0}process(o,h){for(let t=0;t<16;t++,h+=4)f[t]=o.getUint32(h,!1);for(let t=16;t<64;t++){const H=f[t-15],d=f[t-2],S=x.rotr(H,7)^x.rotr(H,18)^H>>>3,l=x.rotr(d,17)^x.rotr(d,19)^d>>>10;f[t]=l+f[t-7]+S+f[t-16]|0}let{A:s,B:a,C:r,D:b,E:c,F:i,G:n,H:A}=this;for(let t=0;t<64;t++){const H=x.rotr(c,6)^x.rotr(c,11)^x.rotr(c,25),d=A+H+e.Chi(c,i,n)+_[t]+f[t]|0,l=(x.rotr(s,2)^x.rotr(s,13)^x.rotr(s,22))+e.Maj(s,a,r)|0;A=n,n=i,i=c,c=b+d|0,b=r,r=a,a=s,s=d+l|0}s=s+this.A|0,a=a+this.B|0,r=r+this.C|0,b=b+this.D|0,c=c+this.E|0,i=i+this.F|0,n=n+this.G|0,A=A+this.H|0,this.set(s,a,r,b,c,i,n,A)}roundClean(){x.clean(f)}destroy(){this.set(0,0,0,0,0,0,0,0),x.clean(this.buffer)}}const I=x.createHasher(()=>new u);exports.SHA256=u;exports.sha256=I;

package/dist/index346.js

@@ -0,0 +1,106 @@
+import { HashMD as D, SHA256_IV as b, Chi as g, Maj as p } from "./index376.js";
+import { createHasher as u, clean as C, rotr as i } from "./index345.js";
+const B = /* @__PURE__ */ Uint32Array.from([
+  1116352408,
+  1899447441,
+  3049323471,
+  3921009573,
+  961987163,
+  1508970993,
+  2453635748,
+  2870763221,
+  3624381080,
+  310598401,
+  607225278,
+  1426881987,
+  1925078388,
+  2162078206,
+  2614888103,
+  3248222580,
+  3835390401,
+  4022224774,
+  264347078,
+  604807628,
+  770255983,
+  1249150122,
+  1555081692,
+  1996064986,
+  2554220882,
+  2821834349,
+  2952996808,
+  3210313671,
+  3336571891,
+  3584528711,
+  113926993,
+  338241895,
+  666307205,
+  773529912,
+  1294757372,
+  1396182291,
+  1695183700,
+  1986661051,
+  2177026350,
+  2456956037,
+  2730485921,
+  2820302411,
+  3259730800,
+  3345764771,
+  3516065817,
+  3600352804,
+  4094571909,
+  275423344,
+  430227734,
+  506948616,
+  659060556,
+  883997877,
+  958139571,
+  1322822218,
+  1537002063,
+  1747873779,
+  1955562222,
+  2024104815,
+  2227730452,
+  2361852424,
+  2428436474,
+  2756734187,
+  3204031479,
+  3329325298
+]), h = /* @__PURE__ */ new Uint32Array(64);
+class E extends D {
+  constructor(o = 32) {
+    super(64, o, 8, !1), this.A = b[0] | 0, this.B = b[1] | 0, this.C = b[2] | 0, this.D = b[3] | 0, this.E = b[4] | 0, this.F = b[5] | 0, this.G = b[6] | 0, this.H = b[7] | 0;
+  }
+  get() {
+    const { A: o, B: r, C: t, D: s, E: a, F: f, G: c, H: e } = this;
+    return [o, r, t, s, a, f, c, e];
+  }
+  // prettier-ignore
+  set(o, r, t, s, a, f, c, e) {
+    this.A = o | 0, this.B = r | 0, this.C = t | 0, this.D = s | 0, this.E = a | 0, this.F = f | 0, this.G = c | 0, this.H = e | 0;
+  }
+  process(o, r) {
+    for (let x = 0; x < 16; x++, r += 4)
+      h[x] = o.getUint32(r, !1);
+    for (let x = 16; x < 64; x++) {
+      const H = h[x - 15], d = h[x - 2], m = i(H, 7) ^ i(H, 18) ^ H >>> 3, l = i(d, 17) ^ i(d, 19) ^ d >>> 10;
+      h[x] = l + h[x - 7] + m + h[x - 16] | 0;
+    }
+    let { A: t, B: s, C: a, D: f, E: c, F: e, G: n, H: A } = this;
+    for (let x = 0; x < 64; x++) {
+      const H = i(c, 6) ^ i(c, 11) ^ i(c, 25), d = A + H + g(c, e, n) + B[x] + h[x] | 0, l = (i(t, 2) ^ i(t, 13) ^ i(t, 22)) + p(t, s, a) | 0;
+      A = n, n = e, e = c, c = f + d | 0, f = a, a = s, s = t, t = d + l | 0;
+    }
+    t = t + this.A | 0, s = s + this.B | 0, a = a + this.C | 0, f = f + this.D | 0, c = c + this.E | 0, e = e + this.F | 0, n = n + this.G | 0, A = A + this.H | 0, this.set(t, s, a, f, c, e, n, A);
+  }
+  roundClean() {
+    C(h);
+  }
+  destroy() {
+    this.set(0, 0, 0, 0, 0, 0, 0, 0), C(this.buffer);
+  }
+}
+const y = /* @__PURE__ */ u(() => new E());
+export {
+  E as SHA256,
+  y as sha256
+};

package/dist/index347.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index214.cjs"),r=require("./index226.cjs"),c=e=>r.keccak256(t.toBytes(e));function n(e){return c(e)}exports.hashSignature=n;

package/dist/index347.js

@@ -0,0 +1,9 @@
+import { toBytes as o } from "./index214.js";
+import { keccak256 as r } from "./index226.js";
+const e = (t) => r(o(t));
+function c(t) {
+  return e(t);
+}
+export {
+  c as hashSignature
+};

package/dist/index348.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index349.cjs"),n=require("./index290.cjs"),i=t=>{const r=typeof t=="string"?t:n.formatAbiItem(t);return e.normalizeSignature(r)};exports.toSignature=i;

package/dist/index348.js

@@ -0,0 +1,9 @@
+import { normalizeSignature as o } from "./index349.js";
+import { formatAbiItem as n } from "./index290.js";
+const m = (r) => {
+  const t = typeof r == "string" ? r : n(r);
+  return o(t);
+};
+export {
+  m as toSignature
+};

package/dist/index349.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index189.cjs");function a(r){let l=!0,i="",o=0,t="",u=!1;for(let n=0;n<r.length;n++){const e=r[n];if(["(",")",","].includes(e)&&(l=!0),e==="("&&o++,e===")"&&o--,!!l){if(o===0){if(e===" "&&["event","function",""].includes(t))t="";else if(t+=e,e===")"){u=!0;break}continue}if(e===" "){r[n-1]!==","&&i!==","&&i!==",("&&(i="",l=!1);continue}t+=e,i+=e}}if(!u)throw new f.BaseError("Unable to normalize signature.");return t}exports.normalizeSignature=a;

package/dist/index349.js

@@ -0,0 +1,29 @@
+import { BaseError as u } from "./index189.js";
+function a(r) {
+  let l = !0, i = "", f = 0, t = "", o = !1;
+  for (let n = 0; n < r.length; n++) {
+    const e = r[n];
+    if (["(", ")", ","].includes(e) && (l = !0), e === "(" && f++, e === ")" && f--, !!l) {
+      if (f === 0) {
+        if (e === " " && ["event", "function", ""].includes(t))
+          t = "";
+        else if (t += e, e === ")") {
+          o = !0;
+          break;
+        }
+        continue;
+      }
+      if (e === " ") {
+        r[n - 1] !== "," && i !== "," && i !== ",(" && (i = "", l = !1);
+        continue;
+      }
+      t += e, i += e;
+    }
+  }
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return t;
+}
+export {
+  a as normalizeSignature
+};

package/dist/index35.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("react"),t=require("@gardenfi/garden-book"),s=({text:r})=>{const[c,o]=e.useState(!1),a=()=>{navigator.clipboard.writeText(r),o(!0),setTimeout(()=>{o(!1)},1500)};return c?e.createElement(t.CheckIcon,{className:"h-3 w-6"}):e.createElement(t.CopyIcon,{className:"h-4 w-4 cursor-pointer",onClick:a})};exports.CopyToClipboard=s;

package/dist/index35.js

@@ -0,0 +1,13 @@
+import o, { useState as a } from "react";
+import { CheckIcon as s, CopyIcon as i } from "@gardenfi/garden-book";
+const l = ({ text: t }) => {
+  const [r, e] = a(!1), c = () => {
+    navigator.clipboard.writeText(t), e(!0), setTimeout(() => {
+      e(!1);
+    }, 1500);
+  };
+  return r ? /* @__PURE__ */ o.createElement(s, { className: "h-3 w-6" }) : /* @__PURE__ */ o.createElement(i, { className: "h-4 w-4 cursor-pointer", onClick: c });
+};
+export {
+  l as CopyToClipboard
+};

package/dist/index350.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index378.cjs"),s=require("./index345.cjs"),o=require("./index379.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(e){return{hash:e,hmac:(r,...t)=>a.hmac(e,r,s.concatBytes(...t)),randomBytes:s.randomBytes}}function u(e,r){const t=n=>o.weierstrass({...e,...c(n)});return{...t(r),create:t}}exports.createCurve=u;exports.getHash=c;

package/dist/index350.js

@@ -0,0 +1,19 @@
+import { hmac as c } from "./index378.js";
+import { randomBytes as m, concatBytes as n } from "./index345.js";
+import { weierstrass as a } from "./index379.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function i(r) {
+  return {
+    hash: r,
+    hmac: (e, ...t) => c(r, e, n(...t)),
+    randomBytes: m
+  };
+}
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
+}
+export {
+  p as createCurve,
+  i as getHash
+};

package/dist/index351.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index345.cjs"),a=require("./index359.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/index351.js

@@ -0,0 +1,217 @@
+import { anumber as C } from "./index345.js";
+import { numberToBytesLE as I, numberToBytesBE as y, bitMask as Z, bytesToNumberLE as S, bytesToNumberBE as x, validateObject as z } from "./index359.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 {
+  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/index352.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const B=require("./index281.cjs"),f=require("./index282.cjs"),d=require("./index278.cjs"),i=require("./index277.cjs"),y=require("./index381.cjs"),S=require("./index382.cjs"),g=require("./index287.cjs"),E=require("./index299.cjs"),$=require("./index291.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;