@gardenfi/swap 0.1.3-beta.13 → 0.1.3-beta.15

package/dist/index325.js

@@ -1,217 +1,29 @@
-import { anumber as C } from "./index319.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);
+import { BaseError as u } from "./index180.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;
     }
-    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);
+  }
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return 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
+  a as normalizeSignature
 };

package/dist/index326.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var d=i=>{throw TypeError(i)},p=(i,t,e)=>t.has(i)||d("Cannot "+e),r=(i,t,e)=>(p(i,t,"read from private field"),t.get(i)),o=(i,t,e)=>t.has(i)?d("Cannot add the same private member more than once"):t instanceof WeakSet?t.add(i):t.set(i,e),l=(i,t,e,a)=>(p(i,t,"write to private field"),t.set(i,e),e),h,s;const u=class f{constructor({prefix:t,cache:e}={}){o(this,h),o(this,s),l(this,h,t??[]),l(this,s,e??new Map)}read(t,e){const a=[r(this,h),...t].join(":");if(r(this,s).has(a))return r(this,s).get(a);const n=e();return r(this,s).set(a,n),typeof n=="object"&&n!==null&&"then"in n?Promise.resolve(n).then(c=>(r(this,s).set(a,c),c)).catch(c=>{throw r(this,s).delete(a),c}):n}readSync(t,e){const a=[r(this,h),...t].join(":");if(r(this,s).has(a))return r(this,s).get(a);const n=e();return r(this,s).set(a,n),n}clear(t){const e=[...r(this,h),...t??[]].join(":");if(!e){r(this,s).clear();return}for(const a of r(this,s).keys())a.startsWith(e)&&r(this,s).delete(a)}scope(t){return new f({prefix:[...r(this,h),...Array.isArray(t)?t:[t]],cache:r(this,s)})}};h=new WeakMap;s=new WeakMap;let y=u;exports.ClientCache=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index369.cjs"),s=require("./index321.cjs"),o=require("./index370.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/index326.js

@@ -1,45 +1,19 @@
-var p = (a) => {
-  throw TypeError(a);
-}, d = (a, t, e) => t.has(a) || p("Cannot " + e), r = (a, t, e) => (d(a, t, "read from private field"), t.get(a)), o = (a, t, e) => t.has(a) ? p("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(a) : t.set(a, e), l = (a, t, e, i) => (d(a, t, "write to private field"), t.set(a, e), e), n, s;
-const _ = class f {
-  constructor({ prefix: t, cache: e } = {}) {
-    o(this, n), o(this, s), l(this, n, t ?? []), l(this, s, e ?? /* @__PURE__ */ new Map());
-  }
-  read(t, e) {
-    const i = [r(this, n), ...t].join(":");
-    if (r(this, s).has(i))
-      return r(this, s).get(i);
-    const h = e();
-    return r(this, s).set(i, h), typeof h == "object" && h !== null && "then" in h ? Promise.resolve(h).then((c) => (r(this, s).set(i, c), c)).catch((c) => {
-      throw r(this, s).delete(i), c;
-    }) : h;
-  }
-  readSync(t, e) {
-    const i = [r(this, n), ...t].join(":");
-    if (r(this, s).has(i))
-      return r(this, s).get(i);
-    const h = e();
-    return r(this, s).set(i, h), h;
-  }
-  clear(t) {
-    const e = [...r(this, n), ...t ?? []].join(":");
-    if (!e) {
-      r(this, s).clear();
-      return;
-    }
-    for (const i of r(this, s).keys())
-      i.startsWith(e) && r(this, s).delete(i);
-  }
-  scope(t) {
-    return new f({
-      prefix: [...r(this, n), ...Array.isArray(t) ? t : [t]],
-      cache: r(this, s)
-    });
-  }
-};
-n = /* @__PURE__ */ new WeakMap();
-s = /* @__PURE__ */ new WeakMap();
-let u = _;
+import { hmac as c } from "./index369.js";
+import { randomBytes as m, concatBytes as n } from "./index321.js";
+import { weierstrass as a } from "./index370.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 {
-  u as ClientCache
+  p as createCurve,
+  i as getHash
 };

package/dist/index327.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const T=require("./index261.cjs"),E=require("./index262.cjs"),S=require("./index263.cjs"),k=require("./index370.cjs"),O=require("./index371.cjs"),I=require("./index372.cjs");var x=s=>{throw TypeError(s)},$=(s,r,e)=>r.has(s)||x("Cannot "+e),d=(s,r,e)=>($(s,r,"read from private field"),e?e.call(s):r.get(s)),B=(s,r,e)=>r.has(s)?x("Cannot add the same private member more than once"):r instanceof WeakSet?r.add(s):r.set(s,e),m=(s,r,e,i)=>($(s,r,"write to private field"),r.set(s,e),e),u,f,z,h;const j=class b{constructor(r){B(this,u),B(this,f),this.name=r.name,this.read=r.read,this.serializedSize=r.serializedSize??(()=>null),m(this,u,r.write),m(this,f,r.serialize??((e,i)=>{const t=new I.BcsWriter({initialSize:this.serializedSize(e)??void 0,...i});return d(this,u).call(this,e,t),t.toBytes()})),this.validate=r.validate??(()=>{})}write(r,e){this.validate(r),d(this,u).call(this,r,e)}serialize(r,e){return this.validate(r),new _(this,d(this,f).call(this,r,e))}parse(r){const e=new k.BcsReader(r);return this.read(e)}fromHex(r){return this.parse(S.fromHex(r))}fromBase58(r){return this.parse(T.fromBase58(r))}fromBase64(r){return this.parse(E.fromBase64(r))}transform({name:r,input:e,output:i,validate:t}){return new b({name:r??this.name,read:a=>i?i(this.read(a)):this.read(a),write:(a,n)=>d(this,u).call(this,e?e(a):a,n),serializedSize:a=>this.serializedSize(e?e(a):a),serialize:(a,n)=>d(this,f).call(this,e?e(a):a,n),validate:a=>{t==null||t(a),this.validate(e?e(a):a)}})}};u=new WeakMap;f=new WeakMap;let y=j;const v=Symbol.for("@mysten/serialized-bcs");function p(s){return!!s&&typeof s=="object"&&s[v]===!0}class _{constructor(r,e){B(this,z),B(this,h),m(this,z,r),m(this,h,e)}get[v](){return!0}toBytes(){return d(this,h)}toHex(){return S.toHex(d(this,h))}toBase64(){return E.toBase64(d(this,h))}toBase58(){return T.toBase58(d(this,h))}parse(){return d(this,z).parse(d(this,h))}}z=new WeakMap;h=new WeakMap;function o({size:s,...r}){return new y({...r,serializedSize:()=>s})}function U({readMethod:s,writeMethod:r,...e}){return o({...e,read:i=>i[s](),write:(i,t)=>t[r](i),validate:i=>{var t;if(i<0||i>e.maxValue)throw new TypeError(`Invalid ${e.name} value: ${i}. Expected value in range 0-${e.maxValue}`);(t=e.validate)==null||t.call(e,i)}})}function L({readMethod:s,writeMethod:r,...e}){return o({...e,read:i=>i[s](),write:(i,t)=>t[r](BigInt(i)),validate:i=>{var a;const t=BigInt(i);if(t<0||t>e.maxValue)throw new TypeError(`Invalid ${e.name} value: ${t}. Expected value in range 0-${e.maxValue}`);(a=e.validate)==null||a.call(e,t)}})}function q({serialize:s,...r}){const e=new y({...r,serialize:s,write:(i,t)=>{for(const a of e.serialize(i).toBytes())t.write8(a)}});return e}function A({toBytes:s,fromBytes:r,...e}){return new y({...e,read:i=>{const t=i.readULEB(),a=i.readBytes(t);return r(a)},write:(i,t)=>{const a=s(i);t.writeULEB(a.length);for(let n=0;n<a.length;n++)t.write8(a[n])},serialize:i=>{const t=s(i),a=O.ulebEncode(t.length),n=new Uint8Array(a.length+t.length);return n.set(a,0),n.set(t,a.length),n},validate:i=>{var t;if(typeof i!="string")throw new TypeError(`Invalid ${e.name} value: ${i}. Expected string`);(t=e.validate)==null||t.call(e,i)}})}function W(s){let r=null;function e(){return r||(r=s()),r}return new y({name:"lazy",read:i=>e().read(i),serializedSize:i=>e().serializedSize(i),write:(i,t)=>e().write(i,t),serialize:(i,t)=>e().serialize(i,t).toBytes()})}class M extends y{constructor({name:r,fields:e,...i}){const t=Object.entries(e);super({name:r,serializedSize:a=>{let n=0;for(const[l,c]of t){const w=c.serializedSize(a[l]);if(w==null)return null;n+=w}return n},read:a=>{const n={};for(const[l,c]of t)n[l]=c.read(a);return n},write:(a,n)=>{for(const[l,c]of t)c.write(a[l],n)},...i,validate:a=>{var n;if((n=i==null?void 0:i.validate)==null||n.call(i,a),typeof a!="object"||a==null)throw new TypeError(`Expected object, found ${typeof a}`)}})}}class C extends y{constructor({fields:r,...e}){const i=Object.entries(r);super({read:t=>{const a=t.readULEB(),n=i[a];if(!n)throw new TypeError(`Unknown value ${a} for enum ${e.name}`);const[l,c]=n;return{[l]:(c==null?void 0:c.read(t))??!0,$kind:l}},write:(t,a)=>{const[n,l]=Object.entries(t).filter(([c])=>Object.hasOwn(r,c))[0];for(let c=0;c<i.length;c++){const[w,g]=i[c];if(w===n){a.writeULEB(c),g==null||g.write(l,a);return}}},...e,validate:t=>{var l;if((l=e==null?void 0:e.validate)==null||l.call(e,t),typeof t!="object"||t==null)throw new TypeError(`Expected object, found ${typeof t}`);const a=Object.keys(t).filter(c=>t[c]!==void 0&&Object.hasOwn(r,c));if(a.length!==1)throw new TypeError(`Expected object with one key, but found ${a.length} for type ${e.name}}`);const[n]=a;if(!Object.hasOwn(r,n))throw new TypeError(`Invalid enum variant ${n}`)}})}}class H extends y{constructor({fields:r,name:e,...i}){super({name:e??`(${r.map(t=>t.name).join(", ")})`,serializedSize:t=>{let a=0;for(let n=0;n<r.length;n++){const l=r[n].serializedSize(t[n]);if(l==null)return null;a+=l}return a},read:t=>{const a=[];for(const n of r)a.push(n.read(t));return a},write:(t,a)=>{for(let n=0;n<r.length;n++)r[n].write(t[n],a)},...i,validate:t=>{var a;if((a=i==null?void 0:i.validate)==null||a.call(i,t),!Array.isArray(t))throw new TypeError(`Expected array, found ${typeof t}`);if(t.length!==r.length)throw new TypeError(`Expected array of length ${r.length}, found ${t.length}`)}})}}exports.BcsEnum=C;exports.BcsStruct=M;exports.BcsTuple=H;exports.BcsType=y;exports.SerializedBcs=_;exports.bigUIntBcsType=L;exports.dynamicSizeBcsType=q;exports.fixedSizeBcsType=o;exports.isSerializedBcs=p;exports.lazyBcsType=W;exports.stringLikeBcsType=A;exports.uIntBcsType=U;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index321.cjs"),a=require("./index362.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;