@gardenfi/utils 2.1.1 → 2.1.2

package/dist/index67.js

@@ -1,43 +1,226 @@
-import { ahash as c, aexists as a, abytes as u } from "./index68.js";
-import { Hash as H, toBytes as p } from "./index69.js";
-class r extends H {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, c(t);
-    const h = p(i);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new Error("Expected instance of class which extends utils.Hash");
-    this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
-    const o = this.blockLen, e = new Uint8Array(o);
-    e.set(h.length > o ? t.create().update(h).digest() : h);
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 54;
-    this.iHash.update(e), this.oHash = t.create();
-    for (let s = 0; s < e.length; s++)
-      e[s] ^= 106;
-    this.oHash.update(e), e.fill(0);
-  }
-  update(t) {
-    return a(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a(this), u(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+import { numberToBytesLE as S, numberToBytesBE as x, bitMask as _, bytesToNumberLE as y, bytesToNumberBE as L, validateObject as M } from "./index68.js";
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = BigInt(0), c = BigInt(1), w = /* @__PURE__ */ BigInt(2), C = /* @__PURE__ */ BigInt(3), b = /* @__PURE__ */ BigInt(4), N = /* @__PURE__ */ BigInt(5), m = /* @__PURE__ */ BigInt(8);
+function g(t, i) {
+  const r = t % i;
+  return r >= d ? r : i + r;
+}
+function Z(t, i, r) {
+  if (i < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r <= d)
+    throw new Error("invalid modulus");
+  if (r === c)
+    return d;
+  let e = c;
+  for (; i > d; )
+    i & c && (e = e * t % r), t = t * t % r, i >>= c;
+  return e;
+}
+function V(t, i, r) {
+  let e = t;
+  for (; i-- > d; )
+    e *= e, e %= r;
+  return e;
+}
+function I(t, i) {
+  if (t === d)
+    throw new Error("invert: expected non-zero number");
+  if (i <= d)
+    throw new Error("invert: expected positive modulus, got " + i);
+  let r = g(t, i), e = i, s = d, u = c;
+  for (; r !== d; ) {
+    const o = e / r, n = e % r, l = s - u * o;
+    e = r, r = n, s = u, u = l;
   }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
+  if (e !== c)
+    throw new Error("invert: does not exist");
+  return g(s, i);
+}
+function j(t) {
+  const i = (t - c) / w;
+  let r, e, s;
+  for (r = t - c, e = 0; r % w === d; r /= w, e++)
+    ;
+  for (s = w; s < t && Z(s, i, t) !== t - c; s++)
+    if (s > 1e3)
+      throw new Error("Cannot find square root: likely non-prime P");
+  if (e === 1) {
+    const f = (t + c) / b;
+    return function(n, l) {
+      const h = n.pow(l, f);
+      if (!n.eql(n.sqr(h), l))
+        throw new Error("Cannot find square root");
+      return h;
+    };
   }
-  _cloneInto(t) {
-    t || (t = Object.create(Object.getPrototypeOf(this), {}));
-    const { oHash: i, iHash: h, finished: o, destroyed: e, blockLen: s, outputLen: d } = this;
-    return t = t, t.finished = o, t.destroyed = e, t.blockLen = s, t.outputLen = d, t.oHash = i._cloneInto(t.oHash), t.iHash = h._cloneInto(t.iHash), t;
+  const u = (r + c) / w;
+  return function(o, n) {
+    if (o.pow(n, i) === o.neg(o.ONE))
+      throw new Error("Cannot find square root");
+    let l = e, h = o.pow(o.mul(o.ONE, s), r), v = o.pow(n, u), a = o.pow(n, r);
+    for (; !o.eql(a, o.ONE); ) {
+      if (o.eql(a, o.ZERO))
+        return o.ZERO;
+      let q = 1;
+      for (let B = o.sqr(a); q < l && !o.eql(B, o.ONE); q++)
+        B = o.sqr(B);
+      const E = o.pow(h, c << BigInt(l - q - 1));
+      h = o.sqr(E), v = o.mul(v, E), a = o.mul(a, h), l = q;
+    }
+    return v;
+  };
+}
+function z(t) {
+  if (t % b === C) {
+    const i = (t + c) / b;
+    return function(e, s) {
+      const u = e.pow(s, i);
+      if (!e.eql(e.sqr(u), s))
+        throw new Error("Cannot find square root");
+      return u;
+    };
   }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+  if (t % m === N) {
+    const i = (t - N) / m;
+    return function(e, s) {
+      const u = e.mul(s, w), f = e.pow(u, i), o = e.mul(s, f), n = e.mul(e.mul(o, w), f), l = e.mul(o, e.sub(n, e.ONE));
+      if (!e.eql(e.sqr(l), s))
+        throw new Error("Cannot find square root");
+      return l;
+    };
   }
+  return j(t);
+}
+const A = [
+  "create",
+  "isValid",
+  "is0",
+  "neg",
+  "inv",
+  "sqrt",
+  "sqr",
+  "eql",
+  "add",
+  "sub",
+  "mul",
+  "pow",
+  "div",
+  "addN",
+  "subN",
+  "mulN",
+  "sqrN"
+];
+function Y(t) {
+  const i = {
+    ORDER: "bigint",
+    MASK: "bigint",
+    BYTES: "isSafeInteger",
+    BITS: "isSafeInteger"
+  }, r = A.reduce((e, s) => (e[s] = "function", e), i);
+  return M(t, r);
+}
+function k(t, i, r) {
+  if (r < d)
+    throw new Error("invalid exponent, negatives unsupported");
+  if (r === d)
+    return t.ONE;
+  if (r === c)
+    return i;
+  let e = t.ONE, s = i;
+  for (; r > d; )
+    r & c && (e = t.mul(e, s)), s = t.sqr(s), r >>= c;
+  return e;
+}
+function H(t, i) {
+  const r = new Array(i.length), e = i.reduce((u, f, o) => t.is0(f) ? u : (r[o] = u, t.mul(u, f)), t.ONE), s = t.inv(e);
+  return i.reduceRight((u, f, o) => t.is0(f) ? u : (r[o] = t.mul(u, r[o]), t.mul(u, f)), s), r;
+}
+function K(t, i) {
+  const r = i !== void 0 ? i : t.toString(2).length, e = Math.ceil(r / 8);
+  return { nBitLength: r, nByteLength: e };
+}
+function p(t, i, r = !1, e = {}) {
+  if (t <= d)
+    throw new Error("invalid field: expected ORDER > 0, got " + t);
+  const { nBitLength: s, nByteLength: u } = K(t, i);
+  if (u > 2048)
+    throw new Error("invalid field: expected ORDER of <= 2048 bytes");
+  let f;
+  const o = Object.freeze({
+    ORDER: t,
+    isLE: r,
+    BITS: s,
+    BYTES: u,
+    MASK: _(s),
+    ZERO: d,
+    ONE: c,
+    create: (n) => g(n, t),
+    isValid: (n) => {
+      if (typeof n != "bigint")
+        throw new Error("invalid field element: expected bigint, got " + typeof n);
+      return d <= n && n < t;
+    },
+    is0: (n) => n === d,
+    isOdd: (n) => (n & c) === c,
+    neg: (n) => g(-n, t),
+    eql: (n, l) => n === l,
+    sqr: (n) => g(n * n, t),
+    add: (n, l) => g(n + l, t),
+    sub: (n, l) => g(n - l, t),
+    mul: (n, l) => g(n * l, t),
+    pow: (n, l) => k(o, n, l),
+    div: (n, l) => g(n * I(l, t), t),
+    // Same as above, but doesn't normalize
+    sqrN: (n) => n * n,
+    addN: (n, l) => n + l,
+    subN: (n, l) => n - l,
+    mulN: (n, l) => n * l,
+    inv: (n) => I(n, t),
+    sqrt: e.sqrt || ((n) => (f || (f = z(t)), f(o, n))),
+    invertBatch: (n) => H(o, n),
+    // TODO: do we really need constant cmov?
+    // We don't have const-time bigints anyway, so probably will be not very useful
+    cmov: (n, l, h) => h ? l : n,
+    toBytes: (n) => r ? S(n, u) : x(n, u),
+    fromBytes: (n) => {
+      if (n.length !== u)
+        throw new Error("Field.fromBytes: expected " + u + " bytes, got " + n.length);
+      return r ? y(n) : L(n);
+    }
+  });
+  return Object.freeze(o);
+}
+function T(t) {
+  if (typeof t != "bigint")
+    throw new Error("field order must be bigint");
+  const i = t.toString(2).length;
+  return Math.ceil(i / 8);
+}
+function O(t) {
+  const i = T(t);
+  return i + Math.ceil(i / 2);
+}
+function G(t, i, r = !1) {
+  const e = t.length, s = T(i), u = O(i);
+  if (e < 16 || e < u || e > 1024)
+    throw new Error("expected " + u + "-1024 bytes of input, got " + e);
+  const f = r ? y(t) : L(t), o = g(f, i - c) + c;
+  return r ? S(o, s) : x(o, s);
 }
-const l = (n, t, i) => new r(n, t).update(i).digest();
-l.create = (n, t) => new r(n, t);
 export {
-  r as HMAC,
-  l as hmac
+  p as Field,
+  H as FpInvertBatch,
+  k as FpPow,
+  z as FpSqrt,
+  T as getFieldBytesLength,
+  O as getMinHashLength,
+  I as invert,
+  G as mapHashToField,
+  g as mod,
+  K as nLength,
+  Z as pow,
+  V as pow2,
+  j as tonelliShanks,
+  Y as validateField
 };

package/dist/index68.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function r(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function i(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function o(e,...t){if(!i(e))throw new Error("Uint8Array expected");if(t.length>0&&!t.includes(e.length))throw new Error("Uint8Array expected of length "+t+", got length="+e.length)}function a(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");r(e.outputLen),r(e.blockLen)}function s(e,t=!0){if(e.destroyed)throw new Error("Hash instance has been destroyed");if(t&&e.finished)throw new Error("Hash#digest() has already been called")}function u(e,t){o(e);const n=t.outputLen;if(e.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}exports.abytes=o;exports.aexists=s;exports.ahash=a;exports.anumber=r;exports.aoutput=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const y=BigInt(0),d=BigInt(1),N=BigInt(2);function b(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&t.constructor.name==="Uint8Array"}function m(t){if(!b(t))throw new Error("Uint8Array expected")}function _(t,e){if(typeof e!="boolean")throw new Error(t+" boolean expected, got "+e)}const k=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function B(t){m(t);let e="";for(let r=0;r<t.length;r++)e+=k[t[r]];return e}function x(t){const e=t.toString(16);return e.length&1?"0"+e:e}function E(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);return t===""?y:BigInt("0x"+t)}const f={_0:48,_9:57,A:65,F:70,a:97,f:102};function T(t){if(t>=f._0&&t<=f._9)return t-f._0;if(t>=f.A&&t<=f.F)return t-(f.A-10);if(t>=f.a&&t<=f.f)return t-(f.a-10)}function p(t){if(typeof t!="string")throw new Error("hex string expected, got "+typeof t);const e=t.length,r=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const n=new Uint8Array(r);for(let o=0,i=0;o<r;o++,i+=2){const a=T(t.charCodeAt(i)),s=T(t.charCodeAt(i+1));if(a===void 0||s===void 0){const c=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+c+'" at index '+i)}n[o]=a*16+s}return n}function H(t){return E(B(t))}function O(t){return m(t),E(B(Uint8Array.from(t).reverse()))}function U(t,e){return p(t.toString(16).padStart(e*2,"0"))}function F(t,e){return U(t,e).reverse()}function V(t){return p(x(t))}function M(t,e,r){let n;if(typeof e=="string")try{n=p(e)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else if(b(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+" of length "+r+" expected, got "+o);return n}function I(...t){let e=0;for(let n=0;n<t.length;n++){const o=t[n];m(o),e+=o.length}const r=new Uint8Array(e);for(let n=0,o=0;n<t.length;n++){const i=t[n];r.set(i,o),o+=i.length}return r}function R(t,e){if(t.length!==e.length)return!1;let r=0;for(let n=0;n<t.length;n++)r|=t[n]^e[n];return r===0}function j(t){if(typeof t!="string")throw new Error("string expected");return new Uint8Array(new TextEncoder().encode(t))}const w=t=>typeof t=="bigint"&&y<=t;function S(t,e,r){return w(t)&&w(e)&&w(r)&&e<=t&&t<r}function z(t,e,r,n){if(!S(e,r,n))throw new Error("expected valid "+t+": "+r+" <= n < "+n+", got "+e)}function C(t){let e;for(e=0;t>y;t>>=d,e+=1);return e}function D(t,e){return t>>BigInt(e)&d}function G(t,e,r){return t|(r?d:y)<<BigInt(e)}const L=t=>(N<<BigInt(t-1))-d,h=t=>new Uint8Array(t),A=t=>Uint8Array.from(t);function P(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=h(t),o=h(t),i=0;const a=()=>{n.fill(1),o.fill(0),i=0},s=(...u)=>r(o,n,...u),c=(u=h())=>{o=s(A([0]),u),n=s(),u.length!==0&&(o=s(A([1]),u),n=s())},v=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let u=0;const l=[];for(;u<e;){n=s();const g=n.slice();l.push(g),u+=n.length}return I(...l)};return(u,l)=>{a(),c(u);let g;for(;!(g=l(v()));)c();return a(),g}}const q={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"||b(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 W(t,e,r={}){const n=(o,i,a)=>{const s=q[i];if(typeof s!="function")throw new Error("invalid validator function");const c=t[o];if(!(a&&c===void 0)&&!s(c,t))throw new Error("param "+String(o)+" is invalid. Expected "+i+", got "+c)};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}const J=()=>{throw new Error("not implemented")};function K(t){const e=new WeakMap;return(r,...n)=>{const o=e.get(r);if(o!==void 0)return o;const i=t(r,...n);return e.set(r,i),i}}exports.aInRange=z;exports.abool=_;exports.abytes=m;exports.bitGet=D;exports.bitLen=C;exports.bitMask=L;exports.bitSet=G;exports.bytesToHex=B;exports.bytesToNumberBE=H;exports.bytesToNumberLE=O;exports.concatBytes=I;exports.createHmacDrbg=P;exports.ensureBytes=M;exports.equalBytes=R;exports.hexToBytes=p;exports.hexToNumber=E;exports.inRange=S;exports.isBytes=b;exports.memoized=K;exports.notImplemented=J;exports.numberToBytesBE=U;exports.numberToBytesLE=F;exports.numberToHexUnpadded=x;exports.numberToVarBytesBE=V;exports.utf8ToBytes=j;exports.validateObject=W;

package/dist/index68.js

@@ -1,37 +1,234 @@
-function n(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
+/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
+function h(t) {
+  return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
 }
-function o(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function i(e, ...t) {
-  if (!o(e))
+function b(t) {
+  if (!h(t))
     throw new Error("Uint8Array expected");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error("Uint8Array expected of length " + t + ", got length=" + e.length);
-}
-function f(e) {
-  if (typeof e != "function" || typeof e.create != "function")
-    throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  n(e.outputLen), n(e.blockLen);
-}
-function s(e, t = !0) {
-  if (e.destroyed)
-    throw new Error("Hash instance has been destroyed");
-  if (t && e.finished)
-    throw new Error("Hash#digest() has already been called");
-}
-function u(e, t) {
-  i(e);
-  const r = t.outputLen;
-  if (e.length < r)
-    throw new Error("digestInto() expects output buffer of length at least " + r);
+}
+function O(t, n) {
+  if (typeof n != "boolean")
+    throw new Error(t + " boolean expected, got " + n);
+}
+const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
+function B(t) {
+  b(t);
+  let n = "";
+  for (let r = 0; r < t.length; r++)
+    n += T[t[r]];
+  return n;
+}
+function S(t) {
+  const n = t.toString(16);
+  return n.length & 1 ? "0" + n : n;
+}
+function U(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  return t === "" ? d : BigInt("0x" + t);
+}
+const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
+function E(t) {
+  if (t >= s._0 && t <= s._9)
+    return t - s._0;
+  if (t >= s.A && t <= s.F)
+    return t - (s.A - 10);
+  if (t >= s.a && t <= s.f)
+    return t - (s.a - 10);
+}
+function m(t) {
+  if (typeof t != "string")
+    throw new Error("hex string expected, got " + typeof t);
+  const n = t.length, r = n / 2;
+  if (n % 2)
+    throw new Error("hex string expected, got unpadded hex of length " + n);
+  const e = new Uint8Array(r);
+  for (let o = 0, i = 0; o < r; o++, i += 2) {
+    const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
+    if (a === void 0 || f === void 0) {
+      const c = t[i] + t[i + 1];
+      throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
+    }
+    e[o] = a * 16 + f;
+  }
+  return e;
+}
+function V(t) {
+  return U(B(t));
+}
+function H(t) {
+  return b(t), U(B(Uint8Array.from(t).reverse()));
+}
+function v(t, n) {
+  return m(t.toString(16).padStart(n * 2, "0"));
+}
+function C(t, n) {
+  return v(t, n).reverse();
+}
+function M(t) {
+  return m(S(t));
+}
+function R(t, n, r) {
+  let e;
+  if (typeof n == "string")
+    try {
+      e = m(n);
+    } catch (i) {
+      throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
+    }
+  else if (h(n))
+    e = Uint8Array.from(n);
+  else
+    throw new Error(t + " must be hex string or Uint8Array");
+  const o = e.length;
+  if (typeof r == "number" && o !== r)
+    throw new Error(t + " of length " + r + " expected, got " + o);
+  return e;
+}
+function _(...t) {
+  let n = 0;
+  for (let e = 0; e < t.length; e++) {
+    const o = t[e];
+    b(o), n += o.length;
+  }
+  const r = new Uint8Array(n);
+  for (let e = 0, o = 0; e < t.length; e++) {
+    const i = t[e];
+    r.set(i, o), o += i.length;
+  }
+  return r;
+}
+function j(t, n) {
+  if (t.length !== n.length)
+    return !1;
+  let r = 0;
+  for (let e = 0; e < t.length; e++)
+    r |= t[e] ^ n[e];
+  return r === 0;
+}
+function z(t) {
+  if (typeof t != "string")
+    throw new Error("string expected");
+  return new Uint8Array(new TextEncoder().encode(t));
+}
+const w = (t) => typeof t == "bigint" && d <= t;
+function N(t, n, r) {
+  return w(t) && w(n) && w(r) && n <= t && t < r;
+}
+function D(t, n, r, e) {
+  if (!N(n, r, e))
+    throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
+}
+function G(t) {
+  let n;
+  for (n = 0; t > d; t >>= y, n += 1)
+    ;
+  return n;
+}
+function P(t, n) {
+  return t >> BigInt(n) & y;
+}
+function W(t, n, r) {
+  return t | (r ? y : d) << BigInt(n);
+}
+const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
+function J(t, n, r) {
+  if (typeof t != "number" || t < 2)
+    throw new Error("hashLen must be a number");
+  if (typeof n != "number" || n < 2)
+    throw new Error("qByteLen must be a number");
+  if (typeof r != "function")
+    throw new Error("hmacFn must be a function");
+  let e = p(t), o = p(t), i = 0;
+  const a = () => {
+    e.fill(1), o.fill(0), i = 0;
+  }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
+    o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
+  }, x = () => {
+    if (i++ >= 1e3)
+      throw new Error("drbg: tried 1000 values");
+    let u = 0;
+    const l = [];
+    for (; u < n; ) {
+      e = f();
+      const g = e.slice();
+      l.push(g), u += e.length;
+    }
+    return _(...l);
+  };
+  return (u, l) => {
+    a(), c(u);
+    let g;
+    for (; !(g = l(x())); )
+      c();
+    return a(), g;
+  };
+}
+const k = {
+  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" || h(t),
+  isSafeInteger: (t) => Number.isSafeInteger(t),
+  array: (t) => Array.isArray(t),
+  field: (t, n) => n.Fp.isValid(t),
+  hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
+};
+function K(t, n, r = {}) {
+  const e = (o, i, a) => {
+    const f = k[i];
+    if (typeof f != "function")
+      throw new Error("invalid validator function");
+    const c = t[o];
+    if (!(a && c === void 0) && !f(c, t))
+      throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
+  };
+  for (const [o, i] of Object.entries(n))
+    e(o, i, !1);
+  for (const [o, i] of Object.entries(r))
+    e(o, i, !0);
+  return t;
+}
+const Q = () => {
+  throw new Error("not implemented");
+};
+function X(t) {
+  const n = /* @__PURE__ */ new WeakMap();
+  return (r, ...e) => {
+    const o = n.get(r);
+    if (o !== void 0)
+      return o;
+    const i = t(r, ...e);
+    return n.set(r, i), i;
+  };
 }
 export {
-  i as abytes,
-  s as aexists,
-  f as ahash,
-  n as anumber,
-  u as aoutput
+  D as aInRange,
+  O as abool,
+  b as abytes,
+  P as bitGet,
+  G as bitLen,
+  q as bitMask,
+  W as bitSet,
+  B as bytesToHex,
+  V as bytesToNumberBE,
+  H as bytesToNumberLE,
+  _ as concatBytes,
+  J as createHmacDrbg,
+  R as ensureBytes,
+  j as equalBytes,
+  m as hexToBytes,
+  U as hexToNumber,
+  N as inRange,
+  h as isBytes,
+  X as memoized,
+  Q as notImplemented,
+  v as numberToBytesBE,
+  C as numberToBytesLE,
+  S as numberToHexUnpadded,
+  M as numberToVarBytesBE,
+  z as utf8ToBytes,
+  K as validateObject
 };

package/dist/index69.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index71.cjs"),f=require("./index68.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function p(t){return new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4))}function a(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function l(t,e){return t<<32-e|t>>>e}const b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;function i(t){return t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255}function w(t){for(let e=0;e<t.length;e++)t[e]=i(t[e])}function y(t){if(typeof t!="string")throw new Error("utf8ToBytes expected string, got "+typeof t);return new Uint8Array(new TextEncoder().encode(t))}function s(t){return typeof t=="string"&&(t=y(t)),f.abytes(t),t}function g(...t){let e=0;for(let n=0;n<t.length;n++){const u=t[n];f.abytes(u),e+=u.length}const r=new Uint8Array(e);for(let n=0,u=0;n<t.length;n++){const c=t[n];r.set(c,u),u+=c.length}return r}class m{clone(){return this._cloneInto()}}function B(t){const e=n=>t().update(s(n)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function d(t=32){if(o.crypto&&typeof o.crypto.getRandomValues=="function")return o.crypto.getRandomValues(new Uint8Array(t));if(o.crypto&&typeof o.crypto.randomBytes=="function")return o.crypto.randomBytes(t);throw new Error("crypto.getRandomValues must be defined")}exports.Hash=m;exports.byteSwap=i;exports.byteSwap32=w;exports.concatBytes=g;exports.createView=a;exports.isLE=b;exports.randomBytes=d;exports.rotr=l;exports.toBytes=s;exports.u32=p;exports.utf8ToBytes=y;exports.wrapConstructor=B;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index71.cjs");class i extends n.BaseError{constructor({max:e,min:r,signed:s,size:t,value:a}){super(`Number "${a}" is not in safe ${t?`${t*8}-bit ${s?"signed":"unsigned"} `:""}integer range ${e?`(${r} to ${e})`:`(above ${r})`}`,{name:"IntegerOutOfRangeError"})}}class u extends n.BaseError{constructor({givenSize:e,maxSize:r}){super(`Size cannot exceed ${r} bytes. Given size: ${e} bytes.`,{name:"SizeOverflowError"})}}exports.IntegerOutOfRangeError=i;exports.SizeOverflowError=u;

package/dist/index69.js

@@ -1,72 +1,15 @@
-import { crypto as o } from "./index71.js";
-import { abytes as i } from "./index68.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-function g(t) {
-  return new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4));
-}
-function m(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength);
-}
-function w(t, e) {
-  return t << 32 - e | t >>> e;
-}
-const b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function c(t) {
-  return t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-}
-function a(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = c(t[e]);
-}
-function s(t) {
-  if (typeof t != "string")
-    throw new Error("utf8ToBytes expected string, got " + typeof t);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function y(t) {
-  return typeof t == "string" && (t = s(t)), i(t), t;
-}
-function x(...t) {
-  let e = 0;
-  for (let n = 0; n < t.length; n++) {
-    const r = t[n];
-    i(r), e += r.length;
-  }
-  const f = new Uint8Array(e);
-  for (let n = 0, r = 0; n < t.length; n++) {
-    const u = t[n];
-    f.set(u, r), r += u.length;
+import { BaseError as t } from "./index71.js";
+class $ extends t {
+  constructor({ max: e, min: r, signed: s, size: n, value: a }) {
+    super(`Number "${a}" is not in safe ${n ? `${n * 8}-bit ${s ? "signed" : "unsigned"} ` : ""}integer range ${e ? `(${r} to ${e})` : `(above ${r})`}`, { name: "IntegerOutOfRangeError" });
   }
-  return f;
 }
-class h {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
+class c extends t {
+  constructor({ givenSize: e, maxSize: r }) {
+    super(`Size cannot exceed ${r} bytes. Given size: ${e} bytes.`, { name: "SizeOverflowError" });
   }
 }
-function B(t) {
-  const e = (n) => t().update(y(n)).digest(), f = t();
-  return e.outputLen = f.outputLen, e.blockLen = f.blockLen, e.create = () => t(), e;
-}
-function d(t = 32) {
-  if (o && typeof o.getRandomValues == "function")
-    return o.getRandomValues(new Uint8Array(t));
-  if (o && typeof o.randomBytes == "function")
-    return o.randomBytes(t);
-  throw new Error("crypto.getRandomValues must be defined");
-}
 export {
-  h as Hash,
-  c as byteSwap,
-  a as byteSwap32,
-  x as concatBytes,
-  m as createView,
-  b as isLE,
-  d as randomBytes,
-  w as rotr,
-  y as toBytes,
-  g as u32,
-  s as utf8ToBytes,
-  B as wrapConstructor
+  $ as IntegerOutOfRangeError,
+  c as SizeOverflowError
 };

package/dist/index70.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index68.cjs"),c=require("./index69.cjs");function a(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function d(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class w extends c.Hash{constructor(t,s,i,n){super(),this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=c.createView(this.buffer)}update(t){p.aexists(this);const{view:s,buffer:i,blockLen:n}=this;t=c.toBytes(t);const r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=c.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){p.aexists(this),p.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,this.buffer.subarray(e).fill(0),this.padOffset>n-e&&(this.process(i,0),e=0);for(let f=e;f<n;f++)s[f]=0;a(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=c.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let f=0;f<l;f++)h.setUint32(4*f,g[f],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.length=n,t.pos=h,t.finished=r,t.destroyed=e,n%s&&t.buffer.set(i),t}}exports.Chi=d;exports.HashMD=w;exports.Maj=b;exports.setBigUint64=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index107.cjs");function p(e,{dir:n,size:t=32}={}){return typeof e=="string"?o(e,{dir:n,size:t}):l(e,{dir:n,size:t})}function o(e,{dir:n,size:t=32}={}){if(t===null)return e;const r=e.replace("0x","");if(r.length>t*2)throw new i.SizeExceedsPaddingSizeError({size:Math.ceil(r.length/2),targetSize:t,type:"hex"});return`0x${r[n==="right"?"padEnd":"padStart"](t*2,"0")}`}function l(e,{dir:n,size:t=32}={}){if(t===null)return e;if(e.length>t)throw new i.SizeExceedsPaddingSizeError({size:e.length,targetSize:t,type:"bytes"});const r=new Uint8Array(t);for(let a=0;a<t;a++){const d=n==="right";r[d?a:t-a-1]=e[d?a:e.length-a-1]}return r}exports.pad=p;exports.padBytes=l;exports.padHex=o;