@argent/x-shared 1.37.0 → 1.38.1

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

@@ -0,0 +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");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function o(e){return{hash:e,hmac:(r,...c)=>n.hmac(e,r,t.concatBytes(...c)),randomBytes:t.randomBytes}}exports.getHash=o;

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

@@ -0,0 +1,14 @@
+import { hmac as m } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.js";
+import { concatBytes as c, randomBytes as e } from "../../../../../@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js";
+import "./abstract/weierstrass.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function p(t) {
+  return {
+    hash: t,
+    hmac: (o, ...r) => m(t, o, c(...r)),
+    randomBytes: e
+  };
+}
+export {
+  p as getHash
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=require("./modular.cjs"),m=require("./utils.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */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;

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

@@ -0,0 +1,88 @@
+import { validateField as F, nLength as S } from "./modular.js";
+import { validateObject as O } from "./utils.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+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);
+    }
+  };
+}
+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
+  });
+}
+export {
+  R as validateBasic,
+  z as wNAF
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./utils.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */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;

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

@@ -0,0 +1,203 @@
+import { bitMask as L, numberToBytesLE as T, numberToBytesBE as _, bytesToNumberLE as y, bytesToNumberBE as m, validateObject as $, ensureBytes as C } from "./utils.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+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;
+}
+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 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 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 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);
+}
+const A = [
+  "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 $(e, n);
+}
+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 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 x(e, o) {
+  const n = o !== void 0 ? o : e.toString(2).length, r = Math.ceil(n / 8);
+  return { nBitLength: n, nByteLength: r };
+}
+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: L(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 ? T(t, c) : _(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 Y(e, o, n = !1) {
+  e = C("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;
+}
+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
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./modular.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function c(r){const{Fp:e}=r;h.validateField(e);for(const n of["t","roundsFull","roundsPartial"])if(typeof r[n]!="number"||!Number.isSafeInteger(r[n]))throw new Error(`Poseidon: invalid param ${n}=${r[n]} (${typeof r[n]})`);if(r.reversePartialPowIdx!==void 0&&typeof r.reversePartialPowIdx!="boolean")throw new Error(`Poseidon: invalid param reversePartialPowIdx=${r.reversePartialPowIdx}`);let t=r.sboxPower;if(t===void 0&&(t=5),typeof t!="number"||!Number.isSafeInteger(t))throw new Error(`Poseidon wrong sboxPower=${t}`);const f=BigInt(t);let u=n=>h.FpPow(e,n,f);if(t===3?u=n=>e.mul(e.sqrN(n),n):t===5&&(u=n=>e.mul(e.sqrN(e.sqrN(n)),n)),r.roundsFull%2!==0)throw new Error(`Poseidon roundsFull is not even: ${r.roundsFull}`);const w=r.roundsFull+r.roundsPartial;if(!Array.isArray(r.roundConstants)||r.roundConstants.length!==w)throw new Error("Poseidon: wrong round constants");const l=r.roundConstants.map(n=>{if(!Array.isArray(n)||n.length!==r.t)throw new Error(`Poseidon wrong round constants: ${n}`);return n.map(d=>{if(typeof d!="bigint"||!e.isValid(d))throw new Error(`Poseidon wrong round constant=${d}`);return e.create(d)})});if(!Array.isArray(r.mds)||r.mds.length!==r.t)throw new Error("Poseidon: wrong MDS matrix");const P=r.mds.map(n=>{if(!Array.isArray(n)||n.length!==r.t)throw new Error(`Poseidon MDS matrix row: ${n}`);return n.map(d=>{if(typeof d!="bigint")throw new Error(`Poseidon MDS matrix value=${d}`);return e.create(d)})});return Object.freeze({...r,rounds:w,sboxFn:u,roundConstants:l,mds:P})}function b(r){const{t:e,Fp:t,rounds:f,sboxFn:u,reversePartialPowIdx:w}=c(r),l=Math.floor(r.roundsFull/2),P=w?e-1:0,n=(a,i,s)=>(a=a.map((o,m)=>t.add(o,r.roundConstants[s][m])),i?a=a.map(o=>u(o)):a[P]=u(a[P]),a=r.mds.map(o=>o.reduce((m,g,y)=>t.add(m,t.mulN(g,a[y])),t.ZERO)),a),d=function(i){if(!Array.isArray(i)||i.length!==e)throw new Error(`Poseidon: wrong values (expected array of bigints with length ${e})`);i=i.map(o=>{if(typeof o!="bigint")throw new Error(`Poseidon: wrong value=${o} (${typeof o})`);return t.create(o)});let s=0;for(let o=0;o<l;o++)i=n(i,!0,s++);for(let o=0;o<r.roundsPartial;o++)i=n(i,!1,s++);for(let o=0;o<l;o++)i=n(i,!0,s++);if(s!==f)throw new Error(`Poseidon: wrong number of rounds: last round=${s}, total=${f}`);return i};return d.roundConstants=r.roundConstants,d}exports.poseidon=b;exports.validateOpts=c;

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

@@ -0,0 +1,68 @@
+import { validateField as c, FpPow as y } from "./modular.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+function b(r) {
+  const { Fp: e } = r;
+  c(e);
+  for (const n of ["t", "roundsFull", "roundsPartial"])
+    if (typeof r[n] != "number" || !Number.isSafeInteger(r[n]))
+      throw new Error(`Poseidon: invalid param ${n}=${r[n]} (${typeof r[n]})`);
+  if (r.reversePartialPowIdx !== void 0 && typeof r.reversePartialPowIdx != "boolean")
+    throw new Error(`Poseidon: invalid param reversePartialPowIdx=${r.reversePartialPowIdx}`);
+  let t = r.sboxPower;
+  if (t === void 0 && (t = 5), typeof t != "number" || !Number.isSafeInteger(t))
+    throw new Error(`Poseidon wrong sboxPower=${t}`);
+  const u = BigInt(t);
+  let f = (n) => y(e, n, u);
+  if (t === 3 ? f = (n) => e.mul(e.sqrN(n), n) : t === 5 && (f = (n) => e.mul(e.sqrN(e.sqrN(n)), n)), r.roundsFull % 2 !== 0)
+    throw new Error(`Poseidon roundsFull is not even: ${r.roundsFull}`);
+  const w = r.roundsFull + r.roundsPartial;
+  if (!Array.isArray(r.roundConstants) || r.roundConstants.length !== w)
+    throw new Error("Poseidon: wrong round constants");
+  const l = r.roundConstants.map((n) => {
+    if (!Array.isArray(n) || n.length !== r.t)
+      throw new Error(`Poseidon wrong round constants: ${n}`);
+    return n.map((d) => {
+      if (typeof d != "bigint" || !e.isValid(d))
+        throw new Error(`Poseidon wrong round constant=${d}`);
+      return e.create(d);
+    });
+  });
+  if (!Array.isArray(r.mds) || r.mds.length !== r.t)
+    throw new Error("Poseidon: wrong MDS matrix");
+  const P = r.mds.map((n) => {
+    if (!Array.isArray(n) || n.length !== r.t)
+      throw new Error(`Poseidon MDS matrix row: ${n}`);
+    return n.map((d) => {
+      if (typeof d != "bigint")
+        throw new Error(`Poseidon MDS matrix value=${d}`);
+      return e.create(d);
+    });
+  });
+  return Object.freeze({ ...r, rounds: w, sboxFn: f, roundConstants: l, mds: P });
+}
+function $(r) {
+  const { t: e, Fp: t, rounds: u, sboxFn: f, reversePartialPowIdx: w } = b(r), l = Math.floor(r.roundsFull / 2), P = w ? e - 1 : 0, n = (a, i, s) => (a = a.map((o, m) => t.add(o, r.roundConstants[s][m])), i ? a = a.map((o) => f(o)) : a[P] = f(a[P]), a = r.mds.map((o) => o.reduce((m, h, g) => t.add(m, t.mulN(h, a[g])), t.ZERO)), a), d = function(i) {
+    if (!Array.isArray(i) || i.length !== e)
+      throw new Error(`Poseidon: wrong values (expected array of bigints with length ${e})`);
+    i = i.map((o) => {
+      if (typeof o != "bigint")
+        throw new Error(`Poseidon: wrong value=${o} (${typeof o})`);
+      return t.create(o);
+    });
+    let s = 0;
+    for (let o = 0; o < l; o++)
+      i = n(i, !0, s++);
+    for (let o = 0; o < r.roundsPartial; o++)
+      i = n(i, !1, s++);
+    for (let o = 0; o < l; o++)
+      i = n(i, !0, s++);
+    if (s !== u)
+      throw new Error(`Poseidon: wrong number of rounds: last round=${s}, total=${u}`);
+    return i;
+  };
+  return d.roundConstants = r.roundConstants, d;
+}
+export {
+  $ as poseidon,
+  b as validateOpts
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const p=BigInt(0),y=BigInt(1),v=BigInt(2),g=t=>t instanceof Uint8Array,U=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function w(t){if(!g(t))throw new Error("Uint8Array expected");let e="";for(let r=0;r<t.length;r++)e+=U[t[r]];return e}function B(t){const e=t.toString(16);return e.length&1?`0${e}`:e}function h(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return BigInt(t===""?"0":`0x${t}`)}function b(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);if(t.length%2)throw new Error("hex string is invalid: unpadded "+t.length);const e=new Uint8Array(t.length/2);for(let r=0;r<e.length;r++){const n=r*2,o=t.slice(n,n+2),i=Number.parseInt(o,16);if(Number.isNaN(i)||i<0)throw new Error("invalid byte sequence");e[r]=i}return e}function $(t){return h(w(t))}function A(t){if(!g(t))throw new Error("Uint8Array expected");return h(w(Uint8Array.from(t).reverse()))}const E=(t,e)=>b(t.toString(16).padStart(e*2,"0")),I=(t,e)=>E(t,e).reverse(),N=t=>b(B(t));function S(t,e,r){let n;if(typeof e=="string")try{n=b(e)}catch(i){throw new Error(`${t} must be valid hex string, got "${e}". Cause: ${i}`)}else if(g(e))n=Uint8Array.from(e);else throw new Error(`${t} must be hex string or Uint8Array`);const o=n.length;if(typeof r=="number"&&o!==r)throw new Error(`${t} expected ${r} bytes, got ${o}`);return n}function T(...t){const e=new Uint8Array(t.reduce((n,o)=>n+o.length,0));let r=0;return t.forEach(n=>{if(!g(n))throw new Error("Uint8Array expected");e.set(n,r),r+=n.length}),e}function H(t,e){if(t.length!==e.length)return!1;for(let r=0;r<t.length;r++)if(t[r]!==e[r])return!1;return!0}function k(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new TextEncoder().encode(t)}function O(t){let e;for(e=0;t>p;t>>=y,e+=1);return e}const j=(t,e)=>t>>BigInt(e)&y,V=(t,e,r)=>t|(r?y:p)<<BigInt(e),F=t=>(v<<BigInt(t-1))-y,d=t=>new Uint8Array(t),m=t=>Uint8Array.from(t);function M(t,e,r){if(typeof t!="number"||t<2)throw new Error("hashLen must be a number");if(typeof e!="number"||e<2)throw new Error("qByteLen must be a number");if(typeof r!="function")throw new Error("hmacFn must be a function");let n=d(t),o=d(t),i=0;const c=()=>{n.fill(1),o.fill(0),i=0},u=(...s)=>r(o,n,...s),f=(s=d())=>{o=u(m([0]),s),n=u(),s.length!==0&&(o=u(m([1]),s),n=u())},x=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let s=0;const a=[];for(;s<e;){n=u();const l=n.slice();a.push(l),s+=n.length}return T(...a)};return(s,a)=>{c(),f(s);let l;for(;!(l=a(x()));)f();return c(),l}}const _={bigint:t=>typeof t=="bigint",function:t=>typeof t=="function",boolean:t=>typeof t=="boolean",string:t=>typeof t=="string",isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>typeof t=="function"&&Number.isSafeInteger(t.outputLen)};function q(t,e,r={}){const n=(o,i,c)=>{const u=_[i];if(typeof u!="function")throw new Error(`Invalid validator "${i}", expected function`);const f=t[o];if(!(c&&f===void 0)&&!u(f,t))throw new Error(`Invalid param ${String(o)}=${f} (${typeof f}), expected ${i}`)};for(const[o,i]of Object.entries(e))n(o,i,!1);for(const[o,i]of Object.entries(r))n(o,i,!0);return t}exports.bitGet=j;exports.bitLen=O;exports.bitMask=F;exports.bitSet=V;exports.bytesToHex=w;exports.bytesToNumberBE=$;exports.bytesToNumberLE=A;exports.concatBytes=T;exports.createHmacDrbg=M;exports.ensureBytes=S;exports.equalBytes=H;exports.hexToBytes=b;exports.hexToNumber=h;exports.numberToBytesBE=E;exports.numberToBytesLE=I;exports.numberToHexUnpadded=B;exports.numberToVarBytesBE=N;exports.utf8ToBytes=k;exports.validateObject=q;

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

@@ -0,0 +1,166 @@
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const h = BigInt(0), g = BigInt(1), B = BigInt(2), y = (t) => t instanceof Uint8Array, $ = Array.from({ length: 256 }, (t, e) => e.toString(16).padStart(2, "0"));
+function b(t) {
+  if (!y(t))
+    throw new Error("Uint8Array expected");
+  let e = "";
+  for (let r = 0; r < t.length; r++)
+    e += $[t[r]];
+  return e;
+}
+function A(t) {
+  const e = t.toString(16);
+  return e.length & 1 ? `0${e}` : e;
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return BigInt(t === "" ? "0" : `0x${t}`);
+}
+function d(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  if (t.length % 2)
+    throw new Error("hex string is invalid: unpadded " + t.length);
+  const e = new Uint8Array(t.length / 2);
+  for (let r = 0; r < e.length; r++) {
+    const n = r * 2, o = t.slice(n, n + 2), i = Number.parseInt(o, 16);
+    if (Number.isNaN(i) || i < 0)
+      throw new Error("invalid byte sequence");
+    e[r] = i;
+  }
+  return e;
+}
+function T(t) {
+  return m(b(t));
+}
+function N(t) {
+  if (!y(t))
+    throw new Error("Uint8Array expected");
+  return m(b(Uint8Array.from(t).reverse()));
+}
+const U = (t, e) => d(t.toString(16).padStart(e * 2, "0")), S = (t, e) => U(t, e).reverse(), k = (t) => d(A(t));
+function F(t, e, r) {
+  let n;
+  if (typeof e == "string")
+    try {
+      n = d(e);
+    } catch (i) {
+      throw new Error(`${t} must be valid hex string, got "${e}". Cause: ${i}`);
+    }
+  else if (y(e))
+    n = Uint8Array.from(e);
+  else
+    throw new Error(`${t} must be hex string or Uint8Array`);
+  const o = n.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(`${t} expected ${r} bytes, got ${o}`);
+  return n;
+}
+function v(...t) {
+  const e = new Uint8Array(t.reduce((n, o) => n + o.length, 0));
+  let r = 0;
+  return t.forEach((n) => {
+    if (!y(n))
+      throw new Error("Uint8Array expected");
+    e.set(n, r), r += n.length;
+  }), e;
+}
+function H(t, e) {
+  if (t.length !== e.length)
+    return !1;
+  for (let r = 0; r < t.length; r++)
+    if (t[r] !== e[r])
+      return !1;
+  return !0;
+}
+function O(t) {
+  if (typeof t != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
+  return new TextEncoder().encode(t);
+}
+function V(t) {
+  let e;
+  for (e = 0; t > h; t >>= g, e += 1)
+    ;
+  return e;
+}
+const _ = (t, e) => t >> BigInt(e) & g, j = (t, e, r) => t | (r ? g : h) << BigInt(e), q = (t) => (B << BigInt(t - 1)) - g, w = (t) => new Uint8Array(t), p = (t) => Uint8Array.from(t);
+function C(t, e, r) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof e != "number" || e < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof r != "function")
+    throw new Error("hmacFn must be a function");
+  let n = w(t), o = w(t), i = 0;
+  const c = () => {
+    n.fill(1), o.fill(0), i = 0;
+  }, s = (...f) => r(o, n, ...f), u = (f = w()) => {
+    o = s(p([0]), f), n = s(), f.length !== 0 && (o = s(p([1]), f), n = s());
+  }, E = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let f = 0;
+    const a = [];
+    for (; f < e; ) {
+      n = s();
+      const l = n.slice();
+      a.push(l), f += n.length;
+    }
+    return v(...a);
+  };
+  return (f, a) => {
+    c(), u(f);
+    let l;
+    for (; !(l = a(E())); )
+      u();
+    return c(), l;
+  };
+}
+const x = {
+  bigint: (t) => typeof t == "bigint",
+  function: (t) => typeof t == "function",
+  boolean: (t) => typeof t == "boolean",
+  string: (t) => typeof t == "string",
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, e) => e.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function D(t, e, r = {}) {
+  const n = (o, i, c) => {
+    const s = x[i];
+    if (typeof s != "function")
+      throw new Error(`Invalid validator "${i}", expected function`);
+    const u = t[o];
+    if (!(c && u === void 0) && !s(u, t))
+      throw new Error(`Invalid param ${String(o)}=${u} (${typeof u}), expected ${i}`);
+  };
+  for (const [o, i] of Object.entries(e))
+    n(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    n(o, i, !0);
+  return t;
+}
+export {
+  _ as bitGet,
+  V as bitLen,
+  q as bitMask,
+  j as bitSet,
+  b as bytesToHex,
+  T as bytesToNumberBE,
+  N as bytesToNumberLE,
+  v as concatBytes,
+  C as createHmacDrbg,
+  F as ensureBytes,
+  H as equalBytes,
+  d as hexToBytes,
+  m as hexToNumber,
+  U as numberToBytesBE,
+  S as numberToBytesLE,
+  A as numberToHexUnpadded,
+  k as numberToVarBytesBE,
+  O as utf8ToBytes,
+  D as validateObject
+};

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

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const _=require("./modular.cjs"),m=require("./utils.cjs"),et=require("./curve.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function at(v){const n=et.validateBasic(v);m.validateObject(n,{a:"field",b:"field"},{allowedPrivateKeyLengths:"array",wrapPrivateKey:"boolean",isTorsionFree:"function",clearCofactor:"function",allowInfinityPoint:"boolean",fromBytes:"function",toBytes:"function"});const{endo:t,Fp:x,a:O}=n;if(t){if(!x.eql(O,x.ZERO))throw new Error("Endomorphism can only be defined for Koblitz curves that have a=0");if(typeof t!="object"||typeof t.beta!="bigint"||typeof t.splitScalar!="function")throw new Error("Expected endomorphism with beta: bigint and splitScalar: function")}return Object.freeze({...n})}const{bytesToNumberBE:ct,hexToBytes:ut}=m,$={Err:class extends Error{constructor(n=""){super(n)}},_parseInt(v){const{Err:n}=$;if(v.length<2||v[0]!==2)throw new n("Invalid signature integer tag");const t=v[1],x=v.subarray(2,t+2);if(!t||x.length!==t)throw new n("Invalid signature integer: wrong length");if(x[0]&128)throw new n("Invalid signature integer: negative");if(x[0]===0&&!(x[1]&128))throw new n("Invalid signature integer: unnecessary leading zero");return{d:ct(x),l:v.subarray(t+2)}},toSig(v){const{Err:n}=$,t=typeof v=="string"?ut(v):v;if(!(t instanceof Uint8Array))throw new Error("ui8a expected");let x=t.length;if(x<2||t[0]!=48)throw new n("Invalid signature tag");if(t[1]!==x-2)throw new n("Invalid signature: incorrect length");const{d:O,l:T}=$._parseInt(t.subarray(2)),{d:F,l:R}=$._parseInt(T);if(R.length)throw new n("Invalid signature: left bytes after parsing");return{r:O,s:F}},hexFromSig(v){const n=S=>Number.parseInt(S[0],16)&8?"00"+S:S,t=S=>{const V=S.toString(16);return V.length&1?`0${V}`:V},x=n(t(v.s)),O=n(t(v.r)),T=x.length/2,F=O.length/2,R=t(T),L=t(F);return`30${t(F+T+4)}02${L}${O}02${R}${x}`}},P=BigInt(0),U=BigInt(1);BigInt(2);const ot=BigInt(3);BigInt(4);function it(v){const n=at(v),{Fp:t}=n,x=n.toBytes||((y,r,i)=>{const o=r.toAffine();return m.concatBytes(Uint8Array.from([4]),t.toBytes(o.x),t.toBytes(o.y))}),O=n.fromBytes||(y=>{const r=y.subarray(1),i=t.fromBytes(r.subarray(0,t.BYTES)),o=t.fromBytes(r.subarray(t.BYTES,2*t.BYTES));return{x:i,y:o}});function T(y){const{a:r,b:i}=n,o=t.sqr(y),u=t.mul(o,y);return t.add(t.add(u,t.mul(y,r)),i)}if(!t.eql(t.sqr(n.Gy),T(n.Gx)))throw new Error("bad generator point: equation left != right");function F(y){return typeof y=="bigint"&&P<y&&y<n.n}function R(y){if(!F(y))throw new Error("Expected valid bigint: 0 < bigint < curve.n")}function L(y){const{allowedPrivateKeyLengths:r,nByteLength:i,wrapPrivateKey:o,n:u}=n;if(r&&typeof y!="bigint"){if(y instanceof Uint8Array&&(y=m.bytesToHex(y)),typeof y!="string"||!r.includes(y.length))throw new Error("Invalid key");y=y.padStart(i*2,"0")}let f;try{f=typeof y=="bigint"?y:m.bytesToNumberBE(m.ensureBytes("private key",y,i))}catch{throw new Error(`private key must be ${i} bytes, hex or bigint, not ${typeof y}`)}return o&&(f=_.mod(f,u)),R(f),f}const S=new Map;function V(y){if(!(y instanceof w))throw new Error("ProjectivePoint expected")}class w{constructor(r,i,o){if(this.px=r,this.py=i,this.pz=o,r==null||!t.isValid(r))throw new Error("x required");if(i==null||!t.isValid(i))throw new Error("y required");if(o==null||!t.isValid(o))throw new Error("z required")}static fromAffine(r){const{x:i,y:o}=r||{};if(!r||!t.isValid(i)||!t.isValid(o))throw new Error("invalid affine point");if(r instanceof w)throw new Error("projective point not allowed");const u=f=>t.eql(f,t.ZERO);return u(i)&&u(o)?w.ZERO:new w(i,o,t.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(r){const i=t.invertBatch(r.map(o=>o.pz));return r.map((o,u)=>o.toAffine(i[u])).map(w.fromAffine)}static fromHex(r){const i=w.fromAffine(O(m.ensureBytes("pointHex",r)));return i.assertValidity(),i}static fromPrivateKey(r){return w.BASE.multiply(L(r))}_setWindowSize(r){this._WINDOW_SIZE=r,S.delete(this)}assertValidity(){if(this.is0()){if(n.allowInfinityPoint)return;throw new Error("bad point: ZERO")}const{x:r,y:i}=this.toAffine();if(!t.isValid(r)||!t.isValid(i))throw new Error("bad point: x or y not FE");const o=t.sqr(i),u=T(r);if(!t.eql(o,u))throw new Error("bad point: equation left != right");if(!this.isTorsionFree())throw new Error("bad point: not in prime-order subgroup")}hasEvenY(){const{y:r}=this.toAffine();if(t.isOdd)return!t.isOdd(r);throw new Error("Field doesn't support isOdd")}equals(r){V(r);const{px:i,py:o,pz:u}=this,{px:f,py:g,pz:h}=r,a=t.eql(t.mul(i,h),t.mul(f,u)),c=t.eql(t.mul(o,h),t.mul(g,u));return a&&c}negate(){return new w(this.px,t.neg(this.py),this.pz)}double(){const{a:r,b:i}=n,o=t.mul(i,ot),{px:u,py:f,pz:g}=this;let h=t.ZERO,a=t.ZERO,c=t.ZERO,d=t.mul(u,u),q=t.mul(f,f),B=t.mul(g,g),p=t.mul(u,f);return p=t.add(p,p),c=t.mul(u,g),c=t.add(c,c),h=t.mul(r,c),a=t.mul(o,B),a=t.add(h,a),h=t.sub(q,a),a=t.add(q,a),a=t.mul(h,a),h=t.mul(p,h),c=t.mul(o,c),B=t.mul(r,B),p=t.sub(d,B),p=t.mul(r,p),p=t.add(p,c),c=t.add(d,d),d=t.add(c,d),d=t.add(d,B),d=t.mul(d,p),a=t.add(a,d),B=t.mul(f,g),B=t.add(B,B),d=t.mul(B,p),h=t.sub(h,d),c=t.mul(B,q),c=t.add(c,c),c=t.add(c,c),new w(h,a,c)}add(r){V(r);const{px:i,py:o,pz:u}=this,{px:f,py:g,pz:h}=r;let a=t.ZERO,c=t.ZERO,d=t.ZERO;const q=n.a,B=t.mul(n.b,ot);let p=t.mul(i,f),N=t.mul(o,g),Z=t.mul(u,h),H=t.add(i,o),e=t.add(f,g);H=t.mul(H,e),e=t.add(p,N),H=t.sub(H,e),e=t.add(i,u);let s=t.add(f,h);return e=t.mul(e,s),s=t.add(p,Z),e=t.sub(e,s),s=t.add(o,u),a=t.add(g,h),s=t.mul(s,a),a=t.add(N,Z),s=t.sub(s,a),d=t.mul(q,e),a=t.mul(B,Z),d=t.add(a,d),a=t.sub(N,d),d=t.add(N,d),c=t.mul(a,d),N=t.add(p,p),N=t.add(N,p),Z=t.mul(q,Z),e=t.mul(B,e),N=t.add(N,Z),Z=t.sub(p,Z),Z=t.mul(q,Z),e=t.add(e,Z),p=t.mul(N,e),c=t.add(c,p),p=t.mul(s,e),a=t.mul(H,a),a=t.sub(a,p),p=t.mul(H,N),d=t.mul(s,d),d=t.add(d,p),new w(a,c,d)}subtract(r){return this.add(r.negate())}is0(){return this.equals(w.ZERO)}wNAF(r){return C.wNAFCached(this,S,r,i=>{const o=t.invertBatch(i.map(u=>u.pz));return i.map((u,f)=>u.toAffine(o[f])).map(w.fromAffine)})}multiplyUnsafe(r){const i=w.ZERO;if(r===P)return i;if(R(r),r===U)return this;const{endo:o}=n;if(!o)return C.unsafeLadder(this,r);let{k1neg:u,k1:f,k2neg:g,k2:h}=o.splitScalar(r),a=i,c=i,d=this;for(;f>P||h>P;)f&U&&(a=a.add(d)),h&U&&(c=c.add(d)),d=d.double(),f>>=U,h>>=U;return u&&(a=a.negate()),g&&(c=c.negate()),c=new w(t.mul(c.px,o.beta),c.py,c.pz),a.add(c)}multiply(r){R(r);let i=r,o,u;const{endo:f}=n;if(f){const{k1neg:g,k1:h,k2neg:a,k2:c}=f.splitScalar(i);let{p:d,f:q}=this.wNAF(h),{p:B,f:p}=this.wNAF(c);d=C.constTimeNegate(g,d),B=C.constTimeNegate(a,B),B=new w(t.mul(B.px,f.beta),B.py,B.pz),o=d.add(B),u=q.add(p)}else{const{p:g,f:h}=this.wNAF(i);o=g,u=h}return w.normalizeZ([o,u])[0]}multiplyAndAddUnsafe(r,i,o){const u=w.BASE,f=(h,a)=>a===P||a===U||!h.equals(u)?h.multiplyUnsafe(a):h.multiply(a),g=f(this,i).add(f(r,o));return g.is0()?void 0:g}toAffine(r){const{px:i,py:o,pz:u}=this,f=this.is0();r==null&&(r=f?t.ONE:t.inv(u));const g=t.mul(i,r),h=t.mul(o,r),a=t.mul(u,r);if(f)return{x:t.ZERO,y:t.ZERO};if(!t.eql(a,t.ONE))throw new Error("invZ was invalid");return{x:g,y:h}}isTorsionFree(){const{h:r,isTorsionFree:i}=n;if(r===U)return!0;if(i)return i(w,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:r,clearCofactor:i}=n;return r===U?this:i?i(w,this):this.multiplyUnsafe(n.h)}toRawBytes(r=!0){return this.assertValidity(),x(w,this,r)}toHex(r=!0){return m.bytesToHex(this.toRawBytes(r))}}w.BASE=new w(n.Gx,n.Gy,t.ONE),w.ZERO=new w(t.ZERO,t.ONE,t.ZERO);const W=n.nBitLength,C=et.wNAF(w,n.endo?Math.ceil(W/2):W);return{CURVE:n,ProjectivePoint:w,normPrivateKeyToScalar:L,weierstrassEquation:T,isWithinCurveOrder:F}}function lt(v){const n=et.validateBasic(v);return m.validateObject(n,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...n})}function ft(v){const n=lt(v),{Fp:t,n:x}=n,O=t.BYTES+1,T=2*t.BYTES+1;function F(e){return P<e&&e<t.ORDER}function R(e){return _.mod(e,x)}function L(e){return _.invert(e,x)}const{ProjectivePoint:S,normPrivateKeyToScalar:V,weierstrassEquation:w,isWithinCurveOrder:W}=it({...n,toBytes(e,s,l){const b=s.toAffine(),E=t.toBytes(b.x),A=m.concatBytes;return l?A(Uint8Array.from([s.hasEvenY()?2:3]),E):A(Uint8Array.from([4]),E,t.toBytes(b.y))},fromBytes(e){const s=e.length,l=e[0],b=e.subarray(1);if(s===O&&(l===2||l===3)){const E=m.bytesToNumberBE(b);if(!F(E))throw new Error("Point is not on curve");const A=w(E);let z=t.sqrt(A);const I=(z&U)===U;return(l&1)===1!==I&&(z=t.neg(z)),{x:E,y:z}}else if(s===T&&l===4){const E=t.fromBytes(b.subarray(0,t.BYTES)),A=t.fromBytes(b.subarray(t.BYTES,2*t.BYTES));return{x:E,y:A}}else throw new Error(`Point of length ${s} was invalid. Expected ${O} compressed bytes or ${T} uncompressed bytes`)}}),C=e=>m.bytesToHex(m.numberToBytesBE(e,n.nByteLength));function y(e){const s=x>>U;return e>s}function r(e){return y(e)?R(-e):e}const i=(e,s,l)=>m.bytesToNumberBE(e.slice(s,l));class o{constructor(s,l,b){this.r=s,this.s=l,this.recovery=b,this.assertValidity()}static fromCompact(s){const l=n.nByteLength;return s=m.ensureBytes("compactSignature",s,l*2),new o(i(s,0,l),i(s,l,2*l))}static fromDER(s){const{r:l,s:b}=$.toSig(m.ensureBytes("DER",s));return new o(l,b)}assertValidity(){if(!W(this.r))throw new Error("r must be 0 < r < CURVE.n");if(!W(this.s))throw new Error("s must be 0 < s < CURVE.n")}addRecoveryBit(s){return new o(this.r,this.s,s)}recoverPublicKey(s){const{r:l,s:b,recovery:E}=this,A=c(m.ensureBytes("msgHash",s));if(E==null||![0,1,2,3].includes(E))throw new Error("recovery id invalid");const z=E===2||E===3?l+n.n:l;if(z>=t.ORDER)throw new Error("recovery id 2 or 3 invalid");const I=E&1?"03":"02",D=S.fromHex(I+C(z)),j=L(z),X=R(-A*j),J=R(b*j),K=S.BASE.multiplyAndAddUnsafe(D,X,J);if(!K)throw new Error("point at infinify");return K.assertValidity(),K}hasHighS(){return y(this.s)}normalizeS(){return this.hasHighS()?new o(this.r,R(-this.s),this.recovery):this}toDERRawBytes(){return m.hexToBytes(this.toDERHex())}toDERHex(){return $.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return m.hexToBytes(this.toCompactHex())}toCompactHex(){return C(this.r)+C(this.s)}}const u={isValidPrivateKey(e){try{return V(e),!0}catch{return!1}},normPrivateKeyToScalar:V,randomPrivateKey:()=>{const e=n.randomBytes(t.BYTES+8),s=_.hashToPrivateScalar(e,x);return m.numberToBytesBE(s,n.nByteLength)},precompute(e=8,s=S.BASE){return s._setWindowSize(e),s.multiply(BigInt(3)),s}};function f(e,s=!0){return S.fromPrivateKey(e).toRawBytes(s)}function g(e){const s=e instanceof Uint8Array,l=typeof e=="string",b=(s||l)&&e.length;return s?b===O||b===T:l?b===2*O||b===2*T:e instanceof S}function h(e,s,l=!0){if(g(e))throw new Error("first arg must be private key");if(!g(s))throw new Error("second arg must be public key");return S.fromHex(s).multiply(V(e)).toRawBytes(l)}const a=n.bits2int||function(e){const s=m.bytesToNumberBE(e),l=e.length*8-n.nBitLength;return l>0?s>>BigInt(l):s},c=n.bits2int_modN||function(e){return R(a(e))},d=m.bitMask(n.nBitLength);function q(e){if(typeof e!="bigint")throw new Error("bigint expected");if(!(P<=e&&e<d))throw new Error(`bigint expected < 2^${n.nBitLength}`);return m.numberToBytesBE(e,n.nByteLength)}function B(e,s,l=p){if(["recovered","canonical"].some(k=>k in l))throw new Error("sign() legacy options not supported");const{hash:b,randomBytes:E}=n;let{lowS:A,prehash:z,extraEntropy:I}=l;A==null&&(A=!0),e=m.ensureBytes("msgHash",e),z&&(e=m.ensureBytes("prehashed msgHash",b(e)));const D=c(e),j=V(s),X=[q(j),q(D)];if(I!=null){const k=I===!0?E(t.BYTES):I;X.push(m.ensureBytes("extraEntropy",k,t.BYTES))}const J=m.concatBytes(...X),K=D;function tt(k){const G=a(k);if(!W(G))return;const rt=L(G),M=S.BASE.multiply(G).toAffine(),Y=R(M.x);if(Y===P)return;const Q=R(rt*R(K+Y*j));if(Q===P)return;let nt=(M.x===Y?0:2)|Number(M.y&U),st=Q;return A&&y(Q)&&(st=r(Q),nt^=1),new o(Y,st,nt)}return{seed:J,k2sig:tt}}const p={lowS:n.lowS,prehash:!1},N={lowS:n.lowS,prehash:!1};function Z(e,s,l=p){const{seed:b,k2sig:E}=B(e,s,l);return m.createHmacDrbg(n.hash.outputLen,n.nByteLength,n.hmac)(b,E)}S.BASE._setWindowSize(8);function H(e,s,l,b=N){var M;const E=e;if(s=m.ensureBytes("msgHash",s),l=m.ensureBytes("publicKey",l),"strict"in b)throw new Error("options.strict was renamed to lowS");const{lowS:A,prehash:z}=b;let I,D;try{if(typeof E=="string"||E instanceof Uint8Array)try{I=o.fromDER(E)}catch(Y){if(!(Y instanceof $.Err))throw Y;I=o.fromCompact(E)}else if(typeof E=="object"&&typeof E.r=="bigint"&&typeof E.s=="bigint"){const{r:Y,s:Q}=E;I=new o(Y,Q)}else throw new Error("PARSE");D=S.fromHex(l)}catch(Y){if(Y.message==="PARSE")throw new Error("signature must be Signature instance, Uint8Array or hex string");return!1}if(A&&I.hasHighS())return!1;z&&(s=n.hash(s));const{r:j,s:X}=I,J=c(s),K=L(X),tt=R(J*K),k=R(j*K),G=(M=S.BASE.multiplyAndAddUnsafe(D,tt,k))==null?void 0:M.toAffine();return G?R(G.x)===j:!1}return{CURVE:n,getPublicKey:f,getSharedSecret:h,sign:Z,verify:H,ProjectivePoint:S,Signature:o,utils:u}}exports.DER=$;exports.weierstrass=ft;exports.weierstrassPoints=it;