@ozdao/prometheus-framework 0.2.31 → 0.2.33

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

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

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

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

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

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