@gardenfi/utils 2.5.3 → 3.0.0

package/dist/index23.js

@@ -1,38 +1,15 @@
-import { secp256k1 as e } from "./index32.js";
-import { toHex as a } from "./index33.js";
-import { toAccount as m } from "./index34.js";
-import { publicKeyToAddress as u } from "./index35.js";
-import { sign as g } from "./index36.js";
-import { signAuthorization as p } from "./index37.js";
-import { signMessage as f } from "./index38.js";
-import { signTransaction as y } from "./index39.js";
-import { signTypedData as d } from "./index40.js";
-function H(n, t = {}) {
-  const { nonceManager: s } = t, r = a(e.getPublicKey(n.slice(2), !1)), c = u(r);
-  return {
-    ...m({
-      address: c,
-      nonceManager: s,
-      async sign({ hash: o }) {
-        return g({ hash: o, privateKey: n, to: "hex" });
-      },
-      async signAuthorization(o) {
-        return p({ ...o, privateKey: n });
-      },
-      async signMessage({ message: o }) {
-        return f({ message: o, privateKey: n });
-      },
-      async signTransaction(o, { serializer: i } = {}) {
-        return y({ privateKey: n, transaction: o, serializer: i });
-      },
-      async signTypedData(o) {
-        return d({ ...o, privateKey: n });
-      }
-    }),
-    publicKey: r,
-    source: "privateKey"
-  };
+import { createClient as i } from "./index46.js";
+import { walletActions as o } from "./index49.js";
+function m(t) {
+  const { key: e = "wallet", name: l = "Wallet Client", transport: n } = t;
+  return i({
+    ...t,
+    key: e,
+    name: l,
+    transport: n,
+    type: "walletClient"
+  }).extend(o);
 }
 export {
-  H as privateKeyToAccount
+  m as createWalletClient
 };

package/dist/index230.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index235.cjs"),e={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new o.RecursiveReadLimitExceededError({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new o.PositionOutOfBoundsError({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position-t;this.assertPosition(i),this.position=i},getReadCount(t){return this.positionReadCount.get(t||this.position)||0},incrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position+t;this.assertPosition(i),this.position=i},inspectByte(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectBytes(t,i){const s=i??this.position;return this.assertPosition(s+t-1),this.bytes.subarray(s,s+t)},inspectUint8(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectUint16(t){const i=t??this.position;return this.assertPosition(i+1),this.dataView.getUint16(i)},inspectUint24(t){const i=t??this.position;return this.assertPosition(i+2),(this.dataView.getUint16(i)<<8)+this.dataView.getUint8(i+2)},inspectUint32(t){const i=t??this.position;return this.assertPosition(i+3),this.dataView.getUint32(i)},pushByte(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushBytes(t){this.assertPosition(this.position+t.length-1),this.bytes.set(t,this.position),this.position+=t.length},pushUint8(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushUint16(t){this.assertPosition(this.position+1),this.dataView.setUint16(this.position,t),this.position+=2},pushUint24(t){this.assertPosition(this.position+2),this.dataView.setUint16(this.position,t>>8),this.dataView.setUint8(this.position+2,t&255),this.position+=3},pushUint32(t){this.assertPosition(this.position+3),this.dataView.setUint32(this.position,t),this.position+=4},readByte(){this.assertReadLimit(),this._touch();const t=this.inspectByte();return this.position++,t},readBytes(t,i){this.assertReadLimit(),this._touch();const s=this.inspectBytes(t);return this.position+=i??t,s},readUint8(){this.assertReadLimit(),this._touch();const t=this.inspectUint8();return this.position+=1,t},readUint16(){this.assertReadLimit(),this._touch();const t=this.inspectUint16();return this.position+=2,t},readUint24(){this.assertReadLimit(),this._touch();const t=this.inspectUint24();return this.position+=3,t},readUint32(){this.assertReadLimit(),this._touch();const t=this.inspectUint32();return this.position+=4,t},get remaining(){return this.bytes.length-this.position},setPosition(t){const i=this.position;return this.assertPosition(t),this.position=t,()=>this.position=i},_touch(){if(this.recursiveReadLimit===Number.POSITIVE_INFINITY)return;const t=this.getReadCount();this.positionReadCount.set(this.position,t+1),t>0&&this.recursiveReadCount++}};function n(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(e);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}exports.createCursor=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index38.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/index230.js

@@ -1,130 +1,29 @@
-import { NegativeOffsetError as o, PositionOutOfBoundsError as e, RecursiveReadLimitExceededError as n } from "./index235.js";
-const h = {
-  bytes: new Uint8Array(),
-  dataView: new DataView(new ArrayBuffer(0)),
-  position: 0,
-  positionReadCount: /* @__PURE__ */ new Map(),
-  recursiveReadCount: 0,
-  recursiveReadLimit: Number.POSITIVE_INFINITY,
-  assertReadLimit() {
-    if (this.recursiveReadCount >= this.recursiveReadLimit)
-      throw new n({
-        count: this.recursiveReadCount + 1,
-        limit: this.recursiveReadLimit
-      });
-  },
-  assertPosition(t) {
-    if (t < 0 || t > this.bytes.length - 1)
-      throw new e({
-        length: this.bytes.length,
-        position: t
-      });
-  },
-  decrementPosition(t) {
-    if (t < 0)
-      throw new o({ offset: t });
-    const i = this.position - t;
-    this.assertPosition(i), this.position = i;
-  },
-  getReadCount(t) {
-    return this.positionReadCount.get(t || this.position) || 0;
-  },
-  incrementPosition(t) {
-    if (t < 0)
-      throw new o({ offset: t });
-    const i = this.position + t;
-    this.assertPosition(i), this.position = i;
-  },
-  inspectByte(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i), this.bytes[i];
-  },
-  inspectBytes(t, i) {
-    const s = i ?? this.position;
-    return this.assertPosition(s + t - 1), this.bytes.subarray(s, s + t);
-  },
-  inspectUint8(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i), this.bytes[i];
-  },
-  inspectUint16(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i + 1), this.dataView.getUint16(i);
-  },
-  inspectUint24(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i + 2), (this.dataView.getUint16(i) << 8) + this.dataView.getUint8(i + 2);
-  },
-  inspectUint32(t) {
-    const i = t ?? this.position;
-    return this.assertPosition(i + 3), this.dataView.getUint32(i);
-  },
-  pushByte(t) {
-    this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
-  },
-  pushBytes(t) {
-    this.assertPosition(this.position + t.length - 1), this.bytes.set(t, this.position), this.position += t.length;
-  },
-  pushUint8(t) {
-    this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
-  },
-  pushUint16(t) {
-    this.assertPosition(this.position + 1), this.dataView.setUint16(this.position, t), this.position += 2;
-  },
-  pushUint24(t) {
-    this.assertPosition(this.position + 2), this.dataView.setUint16(this.position, t >> 8), this.dataView.setUint8(this.position + 2, t & 255), this.position += 3;
-  },
-  pushUint32(t) {
-    this.assertPosition(this.position + 3), this.dataView.setUint32(this.position, t), this.position += 4;
-  },
-  readByte() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectByte();
-    return this.position++, t;
-  },
-  readBytes(t, i) {
-    this.assertReadLimit(), this._touch();
-    const s = this.inspectBytes(t);
-    return this.position += i ?? t, s;
-  },
-  readUint8() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint8();
-    return this.position += 1, t;
-  },
-  readUint16() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint16();
-    return this.position += 2, t;
-  },
-  readUint24() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint24();
-    return this.position += 3, t;
-  },
-  readUint32() {
-    this.assertReadLimit(), this._touch();
-    const t = this.inspectUint32();
-    return this.position += 4, t;
-  },
-  get remaining() {
-    return this.bytes.length - this.position;
-  },
-  setPosition(t) {
-    const i = this.position;
-    return this.assertPosition(t), this.position = t, () => this.position = i;
-  },
-  _touch() {
-    if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)
-      return;
-    const t = this.getReadCount();
-    this.positionReadCount.set(this.position, t + 1), t > 0 && this.recursiveReadCount++;
+import { BaseError as u } from "./index38.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;
+    }
   }
-};
-function a(t, { recursiveReadLimit: i = 8192 } = {}) {
-  const s = Object.create(h);
-  return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
+  if (!o)
+    throw new u("Unable to normalize signature.");
+  return t;
 }
 export {
-  a as createCursor
+  a as normalizeSignature
 };

package/dist/index231.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index221.cjs"),r=require("./index61.cjs"),n=require("./index44.cjs"),o=require("./index33.cjs");function u(t,i={}){typeof i.size<"u"&&n.assertSize(t,{size:i.size});const e=o.bytesToHex(t,i);return n.hexToBigInt(e,i)}function f(t,i={}){let e=t;if(typeof i.size<"u"&&(n.assertSize(e,{size:i.size}),e=r.trim(e)),e.length>1||e[0]>1)throw new s.InvalidBytesBooleanError(e);return!!e[0]}function y(t,i={}){typeof i.size<"u"&&n.assertSize(t,{size:i.size});const e=o.bytesToHex(t,i);return n.hexToNumber(e,i)}function d(t,i={}){let e=t;return typeof i.size<"u"&&(n.assertSize(e,{size:i.size}),e=r.trim(e,{dir:"right"})),new TextDecoder().decode(e)}exports.bytesToBigInt=u;exports.bytesToBool=f;exports.bytesToNumber=y;exports.bytesToString=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index236.cjs"),s=require("./index226.cjs"),o=require("./index242.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/index231.js

@@ -1,30 +1,19 @@
-import { InvalidBytesBooleanError as f } from "./index221.js";
-import { trim as o } from "./index61.js";
-import { assertSize as r, hexToNumber as s, hexToBigInt as u } from "./index44.js";
-import { bytesToHex as t } from "./index33.js";
-function c(n, i = {}) {
-  typeof i.size < "u" && r(n, { size: i.size });
-  const e = t(n, i);
-  return u(e, i);
+import { hmac as c } from "./index236.js";
+import { randomBytes as m, concatBytes as n } from "./index226.js";
+import { weierstrass as a } from "./index242.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 T(n, i = {}) {
-  let e = n;
-  if (typeof i.size < "u" && (r(e, { size: i.size }), e = o(e)), e.length > 1 || e[0] > 1)
-    throw new f(e);
-  return !!e[0];
-}
-function b(n, i = {}) {
-  typeof i.size < "u" && r(n, { size: i.size });
-  const e = t(n, i);
-  return s(e, i);
-}
-function h(n, i = {}) {
-  let e = n;
-  return typeof i.size < "u" && (r(e, { size: i.size }), e = o(e, { dir: "right" })), new TextDecoder().decode(e);
+function p(r, e) {
+  const t = (o) => a({ ...r, ...i(o) });
+  return { ...t(e), create: t };
 }
 export {
-  c as bytesToBigInt,
-  T as bytesToBool,
-  b as bytesToNumber,
-  h as bytesToString
+  p as createCurve,
+  i as getHash
 };

package/dist/index232.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index134.cjs"),g=require("./index41.cjs"),l=require("./index78.cjs"),b=require("./index221.cjs"),x=require("./index42.cjs"),u=require("./index137.cjs"),d=require("./index237.cjs"),y=require("./index212.cjs"),A=require("./index159.cjs"),a=require("./index33.cjs"),z=require("./index238.cjs");function w(e,n){if(e.length!==n.length)throw new f.AbiEncodingLengthMismatchError({expectedLength:e.length,givenLength:n.length});const o=H({params:e,values:n}),t=p(o);return t.length===0?"0x":t}function H({params:e,values:n}){const o=[];for(let t=0;t<e.length;t++)o.push(h({param:e[t],value:n[t]}));return o}function h({param:e,value:n}){const o=m(e.type);if(o){const[t,r]=o;return P(n,{length:t,param:{...e,type:r}})}if(e.type==="tuple")return L(n,{param:e});if(e.type==="address")return E(n);if(e.type==="bool")return q(n);if(e.type.startsWith("uint")||e.type.startsWith("int")){const t=e.type.startsWith("int"),[,,r="256"]=z.integerRegex.exec(e.type)??[];return T(n,{signed:t,size:Number(r)})}if(e.type.startsWith("bytes"))return S(n,{param:e});if(e.type==="string")return I(n);throw new f.InvalidAbiEncodingTypeError(e.type,{docsPath:"/docs/contract/encodeAbiParameters"})}function p(e){let n=0;for(let i=0;i<e.length;i++){const{dynamic:c,encoded:s}=e[i];c?n+=32:n+=y.size(s)}const o=[],t=[];let r=0;for(let i=0;i<e.length;i++){const{dynamic:c,encoded:s}=e[i];c?(o.push(a.numberToHex(n+r,{size:32})),t.push(s),r+=y.size(s)):o.push(s)}return u.concat([...o,...t])}function E(e){if(!x.isAddress(e))throw new g.InvalidAddressError({address:e});return{dynamic:!1,encoded:d.padHex(e.toLowerCase())}}function P(e,{length:n,param:o}){const t=n===null;if(!Array.isArray(e))throw new f.InvalidArrayError(e);if(!t&&e.length!==n)throw new f.AbiEncodingArrayLengthMismatchError({expectedLength:n,givenLength:e.length,type:`${o.type}[${n}]`});let r=!1;const i=[];for(let c=0;c<e.length;c++){const s=h({param:o,value:e[c]});s.dynamic&&(r=!0),i.push(s)}if(t||r){const c=p(i);if(t){const s=a.numberToHex(i.length,{size:32});return{dynamic:!0,encoded:i.length>0?u.concat([s,c]):s}}if(r)return{dynamic:!0,encoded:c}}return{dynamic:!1,encoded:u.concat(i.map(({encoded:c})=>c))}}function S(e,{param:n}){const[,o]=n.type.split("bytes"),t=y.size(e);if(!o){let r=e;return t%32!==0&&(r=d.padHex(r,{dir:"right",size:Math.ceil((e.length-2)/2/32)*32})),{dynamic:!0,encoded:u.concat([d.padHex(a.numberToHex(t,{size:32})),r])}}if(t!==Number.parseInt(o))throw new f.AbiEncodingBytesSizeMismatchError({expectedSize:Number.parseInt(o),value:e});return{dynamic:!1,encoded:d.padHex(e,{dir:"right"})}}function q(e){if(typeof e!="boolean")throw new l.BaseError(`Invalid boolean value: "${e}" (type: ${typeof e}). Expected: \`true\` or \`false\`.`);return{dynamic:!1,encoded:d.padHex(a.boolToHex(e))}}function T(e,{signed:n,size:o=256}){if(typeof o=="number"){const t=2n**(BigInt(o)-(n?1n:0n))-1n,r=n?-t-1n:0n;if(e>t||e<r)throw new b.IntegerOutOfRangeError({max:t.toString(),min:r.toString(),signed:n,size:o/8,value:e.toString()})}return{dynamic:!1,encoded:a.numberToHex(e,{size:32,signed:n})}}function I(e){const n=a.stringToHex(e),o=Math.ceil(y.size(n)/32),t=[];for(let r=0;r<o;r++)t.push(d.padHex(A.slice(n,r*32,(r+1)*32),{dir:"right"}));return{dynamic:!0,encoded:u.concat([d.padHex(a.numberToHex(y.size(n),{size:32})),...t])}}function L(e,{param:n}){let o=!1;const t=[];for(let r=0;r<n.components.length;r++){const i=n.components[r],c=Array.isArray(e)?r:i.name,s=h({param:i,value:e[c]});t.push(s),s.dynamic&&(o=!0)}return{dynamic:o,encoded:o?p(t):u.concat(t.map(({encoded:r})=>r))}}function m(e){const n=e.match(/^(.*)\[(\d+)?\]$/);return n?[n[2]?Number(n[2]):null,n[1]]:void 0}exports.encodeAbiParameters=w;exports.getArrayComponents=m;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const H=require("./index226.cjs"),a=require("./index243.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;