@argent/x-shared 1.79.0 → 1.79.1

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.cjs"),t=require("../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.cjs");require("./abstract/weierstrass.cjs");function o(e){return{hash:e,hmac:(r,...c)=>n.hmac(e,r,t.concatBytes(...c)),randomBytes:t.randomBytes}}exports.getHash=o;
+require(`./abstract/weierstrass.cjs`);const e=require(`../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.cjs`),t=require(`../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.cjs`);function n(n){return{hash:n,hmac:(r,...i)=>t.hmac(n,r,e.concatBytes(...i)),randomBytes:e.randomBytes}}exports.getHash=n;

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.js

@@ -1,13 +1,13 @@
-import { hmac as m } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.js";
-import { randomBytes as c, concatBytes as e } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js";
 import "./abstract/weierstrass.js";
-function p(t) {
-  return {
-    hash: t,
-    hmac: (o, ...r) => m(t, o, e(...r)),
-    randomBytes: c
-  };
+import { concatBytes as e, randomBytes as t } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js";
+import { hmac as n } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.js";
+//#region node_modules/.pnpm/@noble+curves@1.0.0/node_modules/@noble/curves/esm/_shortw_utils.js
+function r(r) {
+	return {
+		hash: r,
+		hmac: (t, ...i) => n(r, t, e(...i)),
+		randomBytes: t
+	};
 }
-export {
-  p as getHash
-};
+//#endregion
+export { r as getHash };

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/curve.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./modular.cjs"),m=require("./utils.cjs");const O=BigInt(0),u=BigInt(1);function A(o,p){const w=(t,e)=>{const n=e.negate();return t?n:e},g=t=>{const e=Math.ceil(p/t)+1,n=2**(t-1);return{windows:e,windowSize:n}};return{constTimeNegate:w,unsafeLadder(t,e){let n=o.ZERO,a=t;for(;e>O;)e&u&&(n=n.add(a)),a=a.double(),e>>=u;return n},precomputeWindow(t,e){const{windows:n,windowSize:a}=g(e),s=[];let i=t,d=i;for(let c=0;c<n;c++){d=i,s.push(d);for(let l=1;l<a;l++)d=d.add(i),s.push(d);i=d.double()}return s},wNAF(t,e,n){const{windows:a,windowSize:s}=g(t);let i=o.ZERO,d=o.BASE;const c=BigInt(2**t-1),l=2**t,B=BigInt(t);for(let f=0;f<a;f++){const h=f*s;let r=Number(n&c);n>>=B,r>s&&(r-=l,n+=u);const N=h,S=h+Math.abs(r)-1,F=f%2!==0,I=r<0;r===0?d=d.add(w(F,e[N])):i=i.add(w(I,e[S]))}return{p:i,f:d}},wNAFCached(t,e,n,a){const s=t._WINDOW_SIZE||1;let i=e.get(t);return i||(i=this.precomputeWindow(t,s),s!==1&&e.set(t,a(i))),this.wNAF(s,i,n)}}}function y(o){return b.validateField(o.Fp),m.validateObject(o,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...b.nLength(o.n,o.nBitLength),...o,p:o.Fp.ORDER})}exports.validateBasic=y;exports.wNAF=A;
+const e=require(`./utils.cjs`),t=require(`./modular.cjs`);var n=BigInt(0),r=BigInt(1);function i(e,t){let i=(e,t)=>{let n=t.negate();return e?n:t},a=e=>({windows:Math.ceil(t/e)+1,windowSize:2**(e-1)});return{constTimeNegate:i,unsafeLadder(t,i){let a=e.ZERO,o=t;for(;i>n;)i&r&&(a=a.add(o)),o=o.double(),i>>=r;return a},precomputeWindow(e,t){let{windows:n,windowSize:r}=a(t),i=[],o=e,s=o;for(let e=0;e<n;e++){s=o,i.push(s);for(let e=1;e<r;e++)s=s.add(o),i.push(s);o=s.double()}return i},wNAF(t,n,o){let{windows:s,windowSize:c}=a(t),l=e.ZERO,u=e.BASE,d=BigInt(2**t-1),f=2**t,p=BigInt(t);for(let e=0;e<s;e++){let t=e*c,a=Number(o&d);o>>=p,a>c&&(a-=f,o+=r);let s=t,m=t+Math.abs(a)-1,h=e%2!=0,g=a<0;a===0?u=u.add(i(h,n[s])):l=l.add(i(g,n[m]))}return{p:l,f:u}},wNAFCached(e,t,n,r){let i=e._WINDOW_SIZE||1,a=t.get(e);return a||(a=this.precomputeWindow(e,i),i!==1&&t.set(e,r(a))),this.wNAF(i,a,n)}}}function a(n){return t.validateField(n.Fp),e.validateObject(n,{n:`bigint`,h:`bigint`,Gx:`field`,Gy:`field`},{nBitLength:`isSafeInteger`,nByteLength:`isSafeInteger`}),Object.freeze({...t.nLength(n.n,n.nBitLength),...n,p:n.Fp.ORDER})}exports.validateBasic=a,exports.wNAF=i;

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/curve.js

@@ -1,87 +1,64 @@
-import { validateField as F, nLength as S } from "./modular.js";
-import { validateObject as O } from "./utils.js";
-const A = BigInt(0), g = BigInt(1);
-function z(i, u) {
-  const l = (t, n) => {
-    const e = n.negate();
-    return t ? e : n;
-  }, h = (t) => {
-    const n = Math.ceil(u / t) + 1, e = 2 ** (t - 1);
-    return { windows: n, windowSize: e };
-  };
-  return {
-    constTimeNegate: l,
-    // non-const time multiplication ladder
-    unsafeLadder(t, n) {
-      let e = i.ZERO, f = t;
-      for (; n > A; )
-        n & g && (e = e.add(f)), f = f.double(), n >>= g;
-      return e;
-    },
-    /**
-     * Creates a wNAF precomputation window. Used for caching.
-     * Default window size is set by `utils.precompute()` and is equal to 8.
-     * Number of precomputed points depends on the curve size:
-     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
-     * - 𝑊 is the window size
-     * - 𝑛 is the bitlength of the curve order.
-     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
-     * @returns precomputed point tables flattened to a single array
-     */
-    precomputeWindow(t, n) {
-      const { windows: e, windowSize: f } = h(n), s = [];
-      let o = t, d = o;
-      for (let w = 0; w < e; w++) {
-        d = o, s.push(d);
-        for (let a = 1; a < f; a++)
-          d = d.add(o), s.push(d);
-        o = d.double();
-      }
-      return s;
-    },
-    /**
-     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
-     * @param W window size
-     * @param precomputes precomputed tables
-     * @param n scalar (we don't check here, but should be less than curve order)
-     * @returns real and fake (for const-time) points
-     */
-    wNAF(t, n, e) {
-      const { windows: f, windowSize: s } = h(t);
-      let o = i.ZERO, d = i.BASE;
-      const w = BigInt(2 ** t - 1), a = 2 ** t, b = BigInt(t);
-      for (let c = 0; c < f; c++) {
-        const p = c * s;
-        let r = Number(e & w);
-        e >>= b, r > s && (r -= a, e += g);
-        const B = p, m = p + Math.abs(r) - 1, I = c % 2 !== 0, N = r < 0;
-        r === 0 ? d = d.add(l(I, n[B])) : o = o.add(l(N, n[m]));
-      }
-      return { p: o, f: d };
-    },
-    wNAFCached(t, n, e, f) {
-      const s = t._WINDOW_SIZE || 1;
-      let o = n.get(t);
-      return o || (o = this.precomputeWindow(t, s), s !== 1 && n.set(t, f(o))), this.wNAF(s, o, e);
-    }
-  };
+import { validateObject as e } from "./utils.js";
+import { nLength as t, validateField as n } from "./modular.js";
+//#region node_modules/.pnpm/@noble+curves@1.0.0/node_modules/@noble/curves/esm/abstract/curve.js
+var r = BigInt(0), i = BigInt(1);
+function a(e, t) {
+	let n = (e, t) => {
+		let n = t.negate();
+		return e ? n : t;
+	}, a = (e) => ({
+		windows: Math.ceil(t / e) + 1,
+		windowSize: 2 ** (e - 1)
+	});
+	return {
+		constTimeNegate: n,
+		unsafeLadder(t, n) {
+			let a = e.ZERO, o = t;
+			for (; n > r;) n & i && (a = a.add(o)), o = o.double(), n >>= i;
+			return a;
+		},
+		precomputeWindow(e, t) {
+			let { windows: n, windowSize: r } = a(t), i = [], o = e, s = o;
+			for (let e = 0; e < n; e++) {
+				s = o, i.push(s);
+				for (let e = 1; e < r; e++) s = s.add(o), i.push(s);
+				o = s.double();
+			}
+			return i;
+		},
+		wNAF(t, r, o) {
+			let { windows: s, windowSize: c } = a(t), l = e.ZERO, u = e.BASE, d = BigInt(2 ** t - 1), f = 2 ** t, p = BigInt(t);
+			for (let e = 0; e < s; e++) {
+				let t = e * c, a = Number(o & d);
+				o >>= p, a > c && (a -= f, o += i);
+				let s = t, m = t + Math.abs(a) - 1, h = e % 2 != 0, g = a < 0;
+				a === 0 ? u = u.add(n(h, r[s])) : l = l.add(n(g, r[m]));
+			}
+			return {
+				p: l,
+				f: u
+			};
+		},
+		wNAFCached(e, t, n, r) {
+			let i = e._WINDOW_SIZE || 1, a = t.get(e);
+			return a || (a = this.precomputeWindow(e, i), i !== 1 && t.set(e, r(a))), this.wNAF(i, a, n);
+		}
+	};
 }
-function R(i) {
-  return F(i.Fp), O(i, {
-    n: "bigint",
-    h: "bigint",
-    Gx: "field",
-    Gy: "field"
-  }, {
-    nBitLength: "isSafeInteger",
-    nByteLength: "isSafeInteger"
-  }), Object.freeze({
-    ...S(i.n, i.nBitLength),
-    ...i,
-    p: i.Fp.ORDER
-  });
+function o(r) {
+	return n(r.Fp), e(r, {
+		n: "bigint",
+		h: "bigint",
+		Gx: "field",
+		Gy: "field"
+	}, {
+		nBitLength: "isSafeInteger",
+		nByteLength: "isSafeInteger"
+	}), Object.freeze({
+		...t(r.n, r.nBitLength),
+		...r,
+		p: r.Fp.ORDER
+	});
 }
-export {
-  R as validateBasic,
-  z as wNAF
-};
+//#endregion
+export { o as validateBasic, a as wNAF };

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./utils.cjs");const f=BigInt(0),u=BigInt(1),h=BigInt(2),M=BigInt(3),b=BigInt(4),y=BigInt(5),m=BigInt(8);BigInt(9);BigInt(16);function a(e,o){const n=e%o;return n>=f?n:o+n}function T(e,o,n){if(n<=f||o<f)throw new Error("Expected power/modulo > 0");if(n===u)return f;let r=u;for(;o>f;)o&u&&(r=r*e%n),e=e*e%n,o>>=u;return r}function N(e,o){if(e===f||o<=f)throw new Error(`invert: expected positive integers, got n=${e} mod=${o}`);let n=a(e,o),r=o,s=f,c=u;for(;n!==f;){const i=r/n,t=r%n,l=s-c*i;r=n,n=t,s=c,c=l}if(r!==u)throw new Error("invert: does not exist");return a(s,o)}function L(e){const o=(e-u)/h;let n,r,s;for(n=e-u,r=0;n%h===f;n/=h,r++);for(s=h;s<e&&T(s,o,e)!==e-u;s++);if(r===1){const d=(e+u)/b;return function(t,l){const w=t.pow(l,d);if(!t.eql(t.sqr(w),l))throw new Error("Cannot find square root");return w}}const c=(n+u)/h;return function(i,t){if(i.pow(t,o)===i.neg(i.ONE))throw new Error("Cannot find square root");let l=r,w=i.pow(i.mul(i.ONE,s),n),v=i.pow(t,c),q=i.pow(t,n);for(;!i.eql(q,i.ONE);){if(i.eql(q,i.ZERO))return i.ZERO;let B=1;for(let E=i.sqr(q);B<l&&!i.eql(E,i.ONE);B++)E=i.sqr(E);const I=i.pow(w,u<<BigInt(l-B-1));w=i.sqr(I),v=i.mul(v,I),q=i.mul(q,w),l=B}return v}}function x(e){if(e%b===M){const o=(e+u)/b;return function(r,s){const c=r.pow(s,o);if(!r.eql(r.sqr(c),s))throw new Error("Cannot find square root");return c}}if(e%m===y){const o=(e-y)/m;return function(r,s){const c=r.mul(s,h),d=r.pow(c,o),i=r.mul(s,d),t=r.mul(r.mul(i,h),d),l=r.mul(i,r.sub(t,r.ONE));if(!r.eql(r.sqr(l),s))throw new Error("Cannot find square root");return l}}return L(e)}const C=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function j(e){const o={ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"},n=C.reduce((r,s)=>(r[s]="function",r),o);return g.validateObject(e,n)}function _(e,o,n){if(n<f)throw new Error("Expected power > 0");if(n===f)return e.ONE;if(n===u)return o;let r=e.ONE,s=o;for(;n>f;)n&u&&(r=e.mul(r,s)),s=e.sqr(s),n>>=u;return r}function $(e,o){const n=new Array(o.length),r=o.reduce((c,d,i)=>e.is0(d)?c:(n[i]=c,e.mul(c,d)),e.ONE),s=e.inv(r);return o.reduceRight((c,d,i)=>e.is0(d)?c:(n[i]=e.mul(c,n[i]),e.mul(c,d)),s),n}function S(e,o){const n=o!==void 0?o:e.toString(2).length,r=Math.ceil(n/8);return{nBitLength:n,nByteLength:r}}function k(e,o,n=!1,r={}){if(e<=f)throw new Error(`Expected Fp ORDER > 0, got ${e}`);const{nBitLength:s,nByteLength:c}=S(e,o);if(c>2048)throw new Error("Field lengths over 2048 bytes are not supported");const d=x(e),i=Object.freeze({ORDER:e,BITS:s,BYTES:c,MASK:g.bitMask(s),ZERO:f,ONE:u,create:t=>a(t,e),isValid:t=>{if(typeof t!="bigint")throw new Error(`Invalid field element: expected bigint, got ${typeof t}`);return f<=t&&t<e},is0:t=>t===f,isOdd:t=>(t&u)===u,neg:t=>a(-t,e),eql:(t,l)=>t===l,sqr:t=>a(t*t,e),add:(t,l)=>a(t+l,e),sub:(t,l)=>a(t-l,e),mul:(t,l)=>a(t*l,e),pow:(t,l)=>_(i,t,l),div:(t,l)=>a(t*N(l,e),e),sqrN:t=>t*t,addN:(t,l)=>t+l,subN:(t,l)=>t-l,mulN:(t,l)=>t*l,inv:t=>N(t,e),sqrt:r.sqrt||(t=>d(i,t)),invertBatch:t=>$(i,t),cmov:(t,l,w)=>w?l:t,toBytes:t=>n?g.numberToBytesLE(t,c):g.numberToBytesBE(t,c),fromBytes:t=>{if(t.length!==c)throw new Error(`Fp.fromBytes: expected ${c}, got ${t.length}`);return n?g.bytesToNumberLE(t):g.bytesToNumberBE(t)}});return Object.freeze(i)}function O(e,o,n=!1){e=g.ensureBytes("privateHash",e);const r=e.length,s=S(o).nByteLength+8;if(s<24||r<s||r>1024)throw new Error(`hashToPrivateScalar: expected ${s}-1024 bytes of input, got ${r}`);const c=n?g.bytesToNumberLE(e):g.bytesToNumberBE(e);return a(c,o-u)+u}exports.Field=k;exports.FpInvertBatch=$;exports.FpPow=_;exports.FpSqrt=x;exports.hashToPrivateScalar=O;exports.invert=N;exports.mod=a;exports.nLength=S;exports.pow=T;exports.tonelliShanks=L;exports.validateField=j;
+const e=require(`./utils.cjs`);var t=BigInt(0),n=BigInt(1),r=BigInt(2),i=BigInt(3),a=BigInt(4),o=BigInt(5),s=BigInt(8),c=BigInt(16);function l(e,n){let r=e%n;return r>=t?r:n+r}function u(e,r,i){if(i<=t||r<t)throw Error(`Expected power/modulo > 0`);if(i===n)return t;let a=n;for(;r>t;)r&n&&(a=a*e%i),e=e*e%i,r>>=n;return a}function d(e,r){if(e===t||r<=t)throw Error(`invert: expected positive integers, got n=${e} mod=${r}`);let i=l(e,r),a=r,o=t,s=n,c=n,u=t;for(;i!==t;){let e=a/i,t=a%i,n=o-c*e,r=s-u*e;a=i,i=t,o=c,s=u,c=n,u=r}if(a!==n)throw Error(`invert: does not exist`);return l(o,r)}function f(e){let i=(e-n)/r,o,s,c;for(o=e-n,s=0;o%r===t;o/=r,s++);for(c=r;c<e&&u(c,i,e)!==e-n;c++);if(s===1){let t=(e+n)/a;return function(e,n){let r=e.pow(n,t);if(!e.eql(e.sqr(r),n))throw Error(`Cannot find square root`);return r}}let l=(o+n)/r;return function(e,t){if(e.pow(t,i)===e.neg(e.ONE))throw Error(`Cannot find square root`);let r=s,a=e.pow(e.mul(e.ONE,c),o),u=e.pow(t,l),d=e.pow(t,o);for(;!e.eql(d,e.ONE);){if(e.eql(d,e.ZERO))return e.ZERO;let t=1;for(let n=e.sqr(d);t<r&&!e.eql(n,e.ONE);t++)n=e.sqr(n);let i=e.pow(a,n<<BigInt(r-t-1));a=e.sqr(i),u=e.mul(u,i),d=e.mul(d,a),r=t}return u}}function p(e){if(e%a===i){let t=(e+n)/a;return function(e,n){let r=e.pow(n,t);if(!e.eql(e.sqr(r),n))throw Error(`Cannot find square root`);return r}}if(e%s===o){let t=(e-o)/s;return function(e,n){let i=e.mul(n,r),a=e.pow(i,t),o=e.mul(n,a),s=e.mul(e.mul(o,r),a),c=e.mul(o,e.sub(s,e.ONE));if(!e.eql(e.sqr(c),n))throw Error(`Cannot find square root`);return c}}return e%c,f(e)}var m=[`create`,`isValid`,`is0`,`neg`,`inv`,`sqrt`,`sqr`,`eql`,`add`,`sub`,`mul`,`pow`,`div`,`addN`,`subN`,`mulN`,`sqrN`];function h(t){return e.validateObject(t,m.reduce((e,t)=>(e[t]=`function`,e),{ORDER:`bigint`,MASK:`bigint`,BYTES:`isSafeInteger`,BITS:`isSafeInteger`}))}function g(e,r,i){if(i<t)throw Error(`Expected power > 0`);if(i===t)return e.ONE;if(i===n)return r;let a=e.ONE,o=r;for(;i>t;)i&n&&(a=e.mul(a,o)),o=e.sqr(o),i>>=n;return a}function _(e,t){let n=Array(t.length),r=t.reduce((t,r,i)=>e.is0(r)?t:(n[i]=t,e.mul(t,r)),e.ONE),i=e.inv(r);return t.reduceRight((t,r,i)=>e.is0(r)?t:(n[i]=e.mul(t,n[i]),e.mul(t,r)),i),n}function v(e,t){let n=t===void 0?e.toString(2).length:t;return{nBitLength:n,nByteLength:Math.ceil(n/8)}}function y(r,i,a=!1,o={}){if(r<=t)throw Error(`Expected Fp ORDER > 0, got ${r}`);let{nBitLength:s,nByteLength:c}=v(r,i);if(c>2048)throw Error(`Field lengths over 2048 bytes are not supported`);let u=p(r),f=Object.freeze({ORDER:r,BITS:s,BYTES:c,MASK:e.bitMask(s),ZERO:t,ONE:n,create:e=>l(e,r),isValid:e=>{if(typeof e!=`bigint`)throw Error(`Invalid field element: expected bigint, got ${typeof e}`);return t<=e&&e<r},is0:e=>e===t,isOdd:e=>(e&n)===n,neg:e=>l(-e,r),eql:(e,t)=>e===t,sqr:e=>l(e*e,r),add:(e,t)=>l(e+t,r),sub:(e,t)=>l(e-t,r),mul:(e,t)=>l(e*t,r),pow:(e,t)=>g(f,e,t),div:(e,t)=>l(e*d(t,r),r),sqrN:e=>e*e,addN:(e,t)=>e+t,subN:(e,t)=>e-t,mulN:(e,t)=>e*t,inv:e=>d(e,r),sqrt:o.sqrt||(e=>u(f,e)),invertBatch:e=>_(f,e),cmov:(e,t,n)=>n?t:e,toBytes:t=>a?e.numberToBytesLE(t,c):e.numberToBytesBE(t,c),fromBytes:t=>{if(t.length!==c)throw Error(`Fp.fromBytes: expected ${c}, got ${t.length}`);return a?e.bytesToNumberLE(t):e.bytesToNumberBE(t)}});return Object.freeze(f)}function b(t,r,i=!1){t=e.ensureBytes(`privateHash`,t);let a=t.length,o=v(r).nByteLength+8;if(o<24||a<o||a>1024)throw Error(`hashToPrivateScalar: expected ${o}-1024 bytes of input, got ${a}`);return l(i?e.bytesToNumberLE(t):e.bytesToNumberBE(t),r-n)+n}exports.Field=y,exports.FpPow=g,exports.hashToPrivateScalar=b,exports.invert=d,exports.mod=l,exports.nLength=v,exports.validateField=h;

package/dist/node_modules/.pnpm/@noble_curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.js

@@ -1,202 +1,165 @@
-import { numberToBytesLE as L, numberToBytesBE as T, bitMask as _, bytesToNumberLE as y, bytesToNumberBE as m, ensureBytes as $, validateObject as C } from "./utils.js";
-const f = BigInt(0), u = BigInt(1), w = BigInt(2), M = BigInt(3), E = BigInt(4), b = BigInt(5), I = BigInt(8);
-BigInt(9);
-BigInt(16);
-function g(e, o) {
-  const n = e % o;
-  return n >= f ? n : o + n;
+import { bitMask as e, bytesToNumberBE as t, bytesToNumberLE as n, ensureBytes as r, numberToBytesBE as i, numberToBytesLE as a, validateObject as o } from "./utils.js";
+//#region node_modules/.pnpm/@noble+curves@1.0.0/node_modules/@noble/curves/esm/abstract/modular.js
+var s = BigInt(0), c = BigInt(1), l = BigInt(2), u = BigInt(3), d = BigInt(4), f = BigInt(5), p = BigInt(8), m = BigInt(16);
+function h(e, t) {
+	let n = e % t;
+	return n >= s ? n : t + n;
 }
-function Z(e, o, n) {
-  if (n <= f || o < f)
-    throw new Error("Expected power/modulo > 0");
-  if (n === u)
-    return f;
-  let r = u;
-  for (; o > f; )
-    o & u && (r = r * e % n), e = e * e % n, o >>= u;
-  return r;
+function g(e, t, n) {
+	if (n <= s || t < s) throw Error("Expected power/modulo > 0");
+	if (n === c) return s;
+	let r = c;
+	for (; t > s;) t & c && (r = r * e % n), e = e * e % n, t >>= c;
+	return r;
 }
-function S(e, o) {
-  if (e === f || o <= f)
-    throw new Error(`invert: expected positive integers, got n=${e} mod=${o}`);
-  let n = g(e, o), r = o, s = f, c = u;
-  for (; n !== f; ) {
-    const i = r / n, t = r % n, l = s - c * i;
-    r = n, n = t, s = c, c = l;
-  }
-  if (r !== u)
-    throw new Error("invert: does not exist");
-  return g(s, o);
+function _(e, t) {
+	if (e === s || t <= s) throw Error(`invert: expected positive integers, got n=${e} mod=${t}`);
+	let n = h(e, t), r = t, i = s, a = c, o = c, l = s;
+	for (; n !== s;) {
+		let e = r / n, t = r % n, s = i - o * e, c = a - l * e;
+		r = n, n = t, i = o, a = l, o = s, l = c;
+	}
+	if (r !== c) throw Error("invert: does not exist");
+	return h(i, t);
 }
-function j(e) {
-  const o = (e - u) / w;
-  let n, r, s;
-  for (n = e - u, r = 0; n % w === f; n /= w, r++)
-    ;
-  for (s = w; s < e && Z(s, o, e) !== e - u; s++)
-    ;
-  if (r === 1) {
-    const d = (e + u) / E;
-    return function(t, l) {
-      const a = t.pow(l, d);
-      if (!t.eql(t.sqr(a), l))
-        throw new Error("Cannot find square root");
-      return a;
-    };
-  }
-  const c = (n + u) / w;
-  return function(i, t) {
-    if (i.pow(t, o) === i.neg(i.ONE))
-      throw new Error("Cannot find square root");
-    let l = r, a = i.pow(i.mul(i.ONE, s), n), B = i.pow(t, c), h = i.pow(t, n);
-    for (; !i.eql(h, i.ONE); ) {
-      if (i.eql(h, i.ZERO))
-        return i.ZERO;
-      let q = 1;
-      for (let v = i.sqr(h); q < l && !i.eql(v, i.ONE); q++)
-        v = i.sqr(v);
-      const N = i.pow(a, u << BigInt(l - q - 1));
-      a = i.sqr(N), B = i.mul(B, N), h = i.mul(h, a), l = q;
-    }
-    return B;
-  };
+function v(e) {
+	let t = (e - c) / l, n, r, i;
+	for (n = e - c, r = 0; n % l === s; n /= l, r++);
+	for (i = l; i < e && g(i, t, e) !== e - c; i++);
+	if (r === 1) {
+		let t = (e + c) / d;
+		return function(e, n) {
+			let r = e.pow(n, t);
+			if (!e.eql(e.sqr(r), n)) throw Error("Cannot find square root");
+			return r;
+		};
+	}
+	let a = (n + c) / l;
+	return function(e, o) {
+		if (e.pow(o, t) === e.neg(e.ONE)) throw Error("Cannot find square root");
+		let s = r, l = e.pow(e.mul(e.ONE, i), n), u = e.pow(o, a), d = e.pow(o, n);
+		for (; !e.eql(d, e.ONE);) {
+			if (e.eql(d, e.ZERO)) return e.ZERO;
+			let t = 1;
+			for (let n = e.sqr(d); t < s && !e.eql(n, e.ONE); t++) n = e.sqr(n);
+			let n = e.pow(l, c << BigInt(s - t - 1));
+			l = e.sqr(n), u = e.mul(u, n), d = e.mul(d, l), s = t;
+		}
+		return u;
+	};
 }
-function k(e) {
-  if (e % E === M) {
-    const o = (e + u) / E;
-    return function(r, s) {
-      const c = r.pow(s, o);
-      if (!r.eql(r.sqr(c), s))
-        throw new Error("Cannot find square root");
-      return c;
-    };
-  }
-  if (e % I === b) {
-    const o = (e - b) / I;
-    return function(r, s) {
-      const c = r.mul(s, w), d = r.pow(c, o), i = r.mul(s, d), t = r.mul(r.mul(i, w), d), l = r.mul(i, r.sub(t, r.ONE));
-      if (!r.eql(r.sqr(l), s))
-        throw new Error("Cannot find square root");
-      return l;
-    };
-  }
-  return j(e);
+function y(e) {
+	if (e % d === u) {
+		let t = (e + c) / d;
+		return function(e, n) {
+			let r = e.pow(n, t);
+			if (!e.eql(e.sqr(r), n)) throw Error("Cannot find square root");
+			return r;
+		};
+	}
+	if (e % p === f) {
+		let t = (e - f) / p;
+		return function(e, n) {
+			let r = e.mul(n, l), i = e.pow(r, t), a = e.mul(n, i), o = e.mul(e.mul(a, l), i), s = e.mul(a, e.sub(o, e.ONE));
+			if (!e.eql(e.sqr(s), n)) throw Error("Cannot find square root");
+			return s;
+		};
+	}
+	return e % m, v(e);
 }
-const A = [
-  "create",
-  "isValid",
-  "is0",
-  "neg",
-  "inv",
-  "sqrt",
-  "sqr",
-  "eql",
-  "add",
-  "sub",
-  "mul",
-  "pow",
-  "div",
-  "addN",
-  "subN",
-  "mulN",
-  "sqrN"
+var b = [
+	"create",
+	"isValid",
+	"is0",
+	"neg",
+	"inv",
+	"sqrt",
+	"sqr",
+	"eql",
+	"add",
+	"sub",
+	"mul",
+	"pow",
+	"div",
+	"addN",
+	"subN",
+	"mulN",
+	"sqrN"
 ];
-function Q(e) {
-  const o = {
-    ORDER: "bigint",
-    MASK: "bigint",
-    BYTES: "isSafeInteger",
-    BITS: "isSafeInteger"
-  }, n = A.reduce((r, s) => (r[s] = "function", r), o);
-  return C(e, n);
+function x(e) {
+	return o(e, b.reduce((e, t) => (e[t] = "function", e), {
+		ORDER: "bigint",
+		MASK: "bigint",
+		BYTES: "isSafeInteger",
+		BITS: "isSafeInteger"
+	}));
 }
-function O(e, o, n) {
-  if (n < f)
-    throw new Error("Expected power > 0");
-  if (n === f)
-    return e.ONE;
-  if (n === u)
-    return o;
-  let r = e.ONE, s = o;
-  for (; n > f; )
-    n & u && (r = e.mul(r, s)), s = e.sqr(s), n >>= u;
-  return r;
+function S(e, t, n) {
+	if (n < s) throw Error("Expected power > 0");
+	if (n === s) return e.ONE;
+	if (n === c) return t;
+	let r = e.ONE, i = t;
+	for (; n > s;) n & c && (r = e.mul(r, i)), i = e.sqr(i), n >>= c;
+	return r;
 }
-function z(e, o) {
-  const n = new Array(o.length), r = o.reduce((c, d, i) => e.is0(d) ? c : (n[i] = c, e.mul(c, d)), e.ONE), s = e.inv(r);
-  return o.reduceRight((c, d, i) => e.is0(d) ? c : (n[i] = e.mul(c, n[i]), e.mul(c, d)), s), n;
+function C(e, t) {
+	let n = Array(t.length), r = t.reduce((t, r, i) => e.is0(r) ? t : (n[i] = t, e.mul(t, r)), e.ONE), i = e.inv(r);
+	return t.reduceRight((t, r, i) => e.is0(r) ? t : (n[i] = e.mul(t, n[i]), e.mul(t, r)), i), n;
 }
-function x(e, o) {
-  const n = o !== void 0 ? o : e.toString(2).length, r = Math.ceil(n / 8);
-  return { nBitLength: n, nByteLength: r };
+function w(e, t) {
+	let n = t === void 0 ? e.toString(2).length : t;
+	return {
+		nBitLength: n,
+		nByteLength: Math.ceil(n / 8)
+	};
 }
-function V(e, o, n = !1, r = {}) {
-  if (e <= f)
-    throw new Error(`Expected Fp ORDER > 0, got ${e}`);
-  const { nBitLength: s, nByteLength: c } = x(e, o);
-  if (c > 2048)
-    throw new Error("Field lengths over 2048 bytes are not supported");
-  const d = k(e), i = Object.freeze({
-    ORDER: e,
-    BITS: s,
-    BYTES: c,
-    MASK: _(s),
-    ZERO: f,
-    ONE: u,
-    create: (t) => g(t, e),
-    isValid: (t) => {
-      if (typeof t != "bigint")
-        throw new Error(`Invalid field element: expected bigint, got ${typeof t}`);
-      return f <= t && t < e;
-    },
-    is0: (t) => t === f,
-    isOdd: (t) => (t & u) === u,
-    neg: (t) => g(-t, e),
-    eql: (t, l) => t === l,
-    sqr: (t) => g(t * t, e),
-    add: (t, l) => g(t + l, e),
-    sub: (t, l) => g(t - l, e),
-    mul: (t, l) => g(t * l, e),
-    pow: (t, l) => O(i, t, l),
-    div: (t, l) => g(t * S(l, e), e),
-    // Same as above, but doesn't normalize
-    sqrN: (t) => t * t,
-    addN: (t, l) => t + l,
-    subN: (t, l) => t - l,
-    mulN: (t, l) => t * l,
-    inv: (t) => S(t, e),
-    sqrt: r.sqrt || ((t) => d(i, t)),
-    invertBatch: (t) => z(i, t),
-    // TODO: do we really need constant cmov?
-    // We don't have const-time bigints anyway, so probably will be not very useful
-    cmov: (t, l, a) => a ? l : t,
-    toBytes: (t) => n ? L(t, c) : T(t, c),
-    fromBytes: (t) => {
-      if (t.length !== c)
-        throw new Error(`Fp.fromBytes: expected ${c}, got ${t.length}`);
-      return n ? y(t) : m(t);
-    }
-  });
-  return Object.freeze(i);
+function T(r, o, l = !1, u = {}) {
+	if (r <= s) throw Error(`Expected Fp ORDER > 0, got ${r}`);
+	let { nBitLength: d, nByteLength: f } = w(r, o);
+	if (f > 2048) throw Error("Field lengths over 2048 bytes are not supported");
+	let p = y(r), m = Object.freeze({
+		ORDER: r,
+		BITS: d,
+		BYTES: f,
+		MASK: e(d),
+		ZERO: s,
+		ONE: c,
+		create: (e) => h(e, r),
+		isValid: (e) => {
+			if (typeof e != "bigint") throw Error(`Invalid field element: expected bigint, got ${typeof e}`);
+			return s <= e && e < r;
+		},
+		is0: (e) => e === s,
+		isOdd: (e) => (e & c) === c,
+		neg: (e) => h(-e, r),
+		eql: (e, t) => e === t,
+		sqr: (e) => h(e * e, r),
+		add: (e, t) => h(e + t, r),
+		sub: (e, t) => h(e - t, r),
+		mul: (e, t) => h(e * t, r),
+		pow: (e, t) => S(m, e, t),
+		div: (e, t) => h(e * _(t, r), r),
+		sqrN: (e) => e * e,
+		addN: (e, t) => e + t,
+		subN: (e, t) => e - t,
+		mulN: (e, t) => e * t,
+		inv: (e) => _(e, r),
+		sqrt: u.sqrt || ((e) => p(m, e)),
+		invertBatch: (e) => C(m, e),
+		cmov: (e, t, n) => n ? t : e,
+		toBytes: (e) => l ? a(e, f) : i(e, f),
+		fromBytes: (e) => {
+			if (e.length !== f) throw Error(`Fp.fromBytes: expected ${f}, got ${e.length}`);
+			return l ? n(e) : t(e);
+		}
+	});
+	return Object.freeze(m);
 }
-function Y(e, o, n = !1) {
-  e = $("privateHash", e);
-  const r = e.length, s = x(o).nByteLength + 8;
-  if (s < 24 || r < s || r > 1024)
-    throw new Error(`hashToPrivateScalar: expected ${s}-1024 bytes of input, got ${r}`);
-  const c = n ? y(e) : m(e);
-  return g(c, o - u) + u;
+function E(e, i, a = !1) {
+	e = r("privateHash", e);
+	let o = e.length, s = w(i).nByteLength + 8;
+	if (s < 24 || o < s || o > 1024) throw Error(`hashToPrivateScalar: expected ${s}-1024 bytes of input, got ${o}`);
+	return h(a ? n(e) : t(e), i - c) + c;
 }
-export {
-  V as Field,
-  z as FpInvertBatch,
-  O as FpPow,
-  k as FpSqrt,
-  Y as hashToPrivateScalar,
-  S as invert,
-  g as mod,
-  x as nLength,
-  Z as pow,
-  j as tonelliShanks,
-  Q as validateField
-};
+//#endregion
+export { T as Field, S as FpPow, E as hashToPrivateScalar, _ as invert, h as mod, w as nLength, x as validateField };