@argent/x-shared 1.79.0 → 1.79.1

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/_assert.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});function o(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`Wrong positive integer: ${e}`)}function i(e){if(typeof e!="boolean")throw new Error(`Expected boolean, not ${e}`)}function r(e,...t){if(!(e instanceof Uint8Array))throw new TypeError("Expected Uint8Array");if(t.length>0&&!t.includes(e.length))throw new TypeError(`Expected Uint8Array of length ${t}, not of length=${e.length}`)}function u(e){if(typeof e!="function"||typeof e.create!="function")throw new Error("Hash should be wrapped by utils.wrapConstructor");o(e.outputLen),o(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 f(e,t){r(e);const n=t.outputLen;if(e.length<n)throw new Error(`digestInto() expects output buffer of length at least ${n}`)}const a={number:o,bool:i,bytes:r,hash:u,exists:s,output:f};exports.bool=i;exports.bytes=r;exports.default=a;exports.exists=s;exports.hash=u;exports.number=o;exports.output=f;
+function e(e){if(!Number.isSafeInteger(e)||e<0)throw Error(`Wrong positive integer: ${e}`)}function t(e){if(typeof e!=`boolean`)throw Error(`Expected boolean, not ${e}`)}function n(e,...t){if(!(e instanceof Uint8Array))throw TypeError(`Expected Uint8Array`);if(t.length>0&&!t.includes(e.length))throw TypeError(`Expected Uint8Array of length ${t}, not of length=${e.length}`)}function r(t){if(typeof t!=`function`||typeof t.create!=`function`)throw Error(`Hash should be wrapped by utils.wrapConstructor`);e(t.outputLen),e(t.blockLen)}function i(e,t=!0){if(e.destroyed)throw Error(`Hash instance has been destroyed`);if(t&&e.finished)throw Error(`Hash#digest() has already been called`)}function a(e,t){n(e);let r=t.outputLen;if(e.length<r)throw Error(`digestInto() expects output buffer of length at least ${r}`)}var o={number:e,bool:t,bytes:n,hash:r,exists:i,output:a};exports.default=o;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/_assert.js

@@ -1,48 +1,34 @@
-function r(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error(`Wrong positive integer: ${e}`);
+//#region node_modules/.pnpm/@noble+hashes@1.3.0/node_modules/@noble/hashes/esm/_assert.js
+function e(e) {
+	if (!Number.isSafeInteger(e) || e < 0) throw Error(`Wrong positive integer: ${e}`);
 }
-function i(e) {
-  if (typeof e != "boolean")
-    throw new Error(`Expected boolean, not ${e}`);
+function t(e) {
+	if (typeof e != "boolean") throw Error(`Expected boolean, not ${e}`);
 }
 function n(e, ...t) {
-  if (!(e instanceof Uint8Array))
-    throw new TypeError("Expected Uint8Array");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new TypeError(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
+	if (!(e instanceof Uint8Array)) throw TypeError("Expected Uint8Array");
+	if (t.length > 0 && !t.includes(e.length)) throw TypeError(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
 }
-function f(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 r(t) {
+	if (typeof t != "function" || typeof t.create != "function") throw Error("Hash should be wrapped by utils.wrapConstructor");
+	e(t.outputLen), e(t.blockLen);
 }
-function u(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 i(e, t = !0) {
+	if (e.destroyed) throw Error("Hash instance has been destroyed");
+	if (t && e.finished) throw Error("Hash#digest() has already been called");
 }
-function s(e, t) {
-  n(e);
-  const o = t.outputLen;
-  if (e.length < o)
-    throw new Error(`digestInto() expects output buffer of length at least ${o}`);
+function a(e, t) {
+	n(e);
+	let r = t.outputLen;
+	if (e.length < r) throw Error(`digestInto() expects output buffer of length at least ${r}`);
 }
-const a = {
-  number: r,
-  bool: i,
-  bytes: n,
-  hash: f,
-  exists: u,
-  output: s
-};
-export {
-  i as bool,
-  n as bytes,
-  a as default,
-  u as exists,
-  f as hash,
-  r as number,
-  s as output
+var o = {
+	number: e,
+	bool: t,
+	bytes: n,
+	hash: r,
+	exists: i,
+	output: a
 };
+//#endregion
+export { o as default };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/crypto.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;
+var e=typeof globalThis==`object`&&`crypto`in globalThis?globalThis.crypto:void 0;exports.crypto=e;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/crypto.js

@@ -1,4 +1,4 @@
-const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
-export {
-  o as crypto
-};
+//#region node_modules/.pnpm/@noble+hashes@1.3.0/node_modules/@noble/hashes/esm/crypto.js
+var e = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+//#endregion
+export { e as crypto };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./_assert.cjs"),r=require("./utils.cjs");class d extends r.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.default.hash(t);const h=r.toBytes(i);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new TypeError("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(h.length>a?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 o.default.exists(this),this.iHash.update(t),this}digestInto(t){o.default.exists(this),o.default.bytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:i,iHash:h,finished:a,destroyed:e,blockLen:s,outputLen:u}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=u,t.oHash=i._cloneInto(t.oHash),t.iHash=h._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(n,t,i)=>new d(n,t).update(i).digest();c.create=(n,t)=>new d(n,t);exports.hmac=c;
+const e=require(`./_assert.cjs`),t=require(`./utils.cjs`);var n=class extends t.Hash{constructor(n,r){super(),this.finished=!1,this.destroyed=!1,e.default.hash(n);let i=t.toBytes(r);if(this.iHash=n.create(),typeof this.iHash.update!=`function`)throw TypeError(`Expected instance of class which extends utils.Hash`);this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;let a=this.blockLen,o=new Uint8Array(a);o.set(i.length>a?n.create().update(i).digest():i);for(let e=0;e<o.length;e++)o[e]^=54;this.iHash.update(o),this.oHash=n.create();for(let e=0;e<o.length;e++)o[e]^=106;this.oHash.update(o),o.fill(0)}update(t){return e.default.exists(this),this.iHash.update(t),this}digestInto(t){e.default.exists(this),e.default.bytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){let e=new Uint8Array(this.oHash.outputLen);return this.digestInto(e),e}_cloneInto(e){e||=Object.create(Object.getPrototypeOf(this),{});let{oHash:t,iHash:n,finished:r,destroyed:i,blockLen:a,outputLen:o}=this;return e=e,e.finished=r,e.destroyed=i,e.blockLen=a,e.outputLen=o,e.oHash=t._cloneInto(e.oHash),e.iHash=n._cloneInto(e.iHash),e}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}},r=(e,t,r)=>new n(e,t).update(r).digest();r.create=(e,t)=>new n(e,t),exports.hmac=r;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.js

@@ -1,42 +1,38 @@
-import a from "./_assert.js";
-import { Hash as c, toBytes as u } from "./utils.js";
-class r extends c {
-  constructor(t, i) {
-    super(), this.finished = !1, this.destroyed = !1, a.hash(t);
-    const h = u(i);
-    if (this.iHash = t.create(), typeof this.iHash.update != "function")
-      throw new TypeError("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.exists(this), this.iHash.update(t), this;
-  }
-  digestInto(t) {
-    a.exists(this), a.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
-  }
-  digest() {
-    const t = new Uint8Array(this.oHash.outputLen);
-    return this.digestInto(t), t;
-  }
-  _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;
-  }
-  destroy() {
-    this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
-  }
-}
-const p = (n, t, i) => new r(n, t).update(i).digest();
-p.create = (n, t) => new r(n, t);
-export {
-  p as hmac
-};
+import e from "./_assert.js";
+import { Hash as t, toBytes as n } from "./utils.js";
+//#region node_modules/.pnpm/@noble+hashes@1.3.0/node_modules/@noble/hashes/esm/hmac.js
+var r = class extends t {
+	constructor(t, r) {
+		super(), this.finished = !1, this.destroyed = !1, e.hash(t);
+		let i = n(r);
+		if (this.iHash = t.create(), typeof this.iHash.update != "function") throw TypeError("Expected instance of class which extends utils.Hash");
+		this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
+		let a = this.blockLen, o = new Uint8Array(a);
+		o.set(i.length > a ? t.create().update(i).digest() : i);
+		for (let e = 0; e < o.length; e++) o[e] ^= 54;
+		this.iHash.update(o), this.oHash = t.create();
+		for (let e = 0; e < o.length; e++) o[e] ^= 106;
+		this.oHash.update(o), o.fill(0);
+	}
+	update(t) {
+		return e.exists(this), this.iHash.update(t), this;
+	}
+	digestInto(t) {
+		e.exists(this), e.bytes(t, this.outputLen), this.finished = !0, this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
+	}
+	digest() {
+		let e = new Uint8Array(this.oHash.outputLen);
+		return this.digestInto(e), e;
+	}
+	_cloneInto(e) {
+		e ||= Object.create(Object.getPrototypeOf(this), {});
+		let { oHash: t, iHash: n, finished: r, destroyed: i, blockLen: a, outputLen: o } = this;
+		return e = e, e.finished = r, e.destroyed = i, e.blockLen = a, e.outputLen = o, e.oHash = t._cloneInto(e.oHash), e.iHash = n._cloneInto(e.iHash), e;
+	}
+	destroy() {
+		this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
+	}
+}, i = (e, t, n) => new r(e, t).update(n).digest();
+i.create = (e, t) => new r(e, t);
+//#endregion
+export { i as hmac };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./crypto.cjs");const s=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68;if(!s)throw new Error("Non little-endian hardware is not supported");Array.from({length:256},(t,r)=>r.toString(16).padStart(2,"0"));function y(t){if(typeof t!="string")throw new TypeError(`utf8ToBytes expected string, got ${typeof t}`);return new TextEncoder().encode(t)}function f(t){if(typeof t=="string"&&(t=y(t)),!(t instanceof Uint8Array))throw new TypeError(`Expected input type is Uint8Array (got ${typeof t})`);return t}function u(...t){if(!t.every(e=>e instanceof Uint8Array))throw new Error("Uint8Array list expected");if(t.length===1)return t[0];const r=t.reduce((e,n)=>e+n.length,0),i=new Uint8Array(r);for(let e=0,n=0;e<t.length;e++){const c=t[e];i.set(c,n),n+=c.length}return i}class p{clone(){return this._cloneInto()}}function l(t=32){if(o.crypto&&typeof o.crypto.getRandomValues=="function")return o.crypto.getRandomValues(new Uint8Array(t));throw new Error("crypto.getRandomValues must be defined")}exports.Hash=p;exports.concatBytes=u;exports.isLE=s;exports.randomBytes=l;exports.toBytes=f;exports.utf8ToBytes=y;
+const e=require(`./crypto.cjs`);if(new Uint8Array(new Uint32Array([287454020]).buffer)[0]!==68)throw Error(`Non little-endian hardware is not supported`);Array.from({length:256},(e,t)=>t.toString(16).padStart(2,`0`));function t(e){if(typeof e!=`string`)throw TypeError(`utf8ToBytes expected string, got ${typeof e}`);return new TextEncoder().encode(e)}function n(e){if(typeof e==`string`&&(e=t(e)),!(e instanceof Uint8Array))throw TypeError(`Expected input type is Uint8Array (got ${typeof e})`);return e}function r(...e){if(!e.every(e=>e instanceof Uint8Array))throw Error(`Uint8Array list expected`);if(e.length===1)return e[0];let t=e.reduce((e,t)=>e+t.length,0),n=new Uint8Array(t);for(let t=0,r=0;t<e.length;t++){let i=e[t];n.set(i,r),r+=i.length}return n}var i=class{clone(){return this._cloneInto()}};function a(t=32){if(e.crypto&&typeof e.crypto.getRandomValues==`function`)return e.crypto.getRandomValues(new Uint8Array(t));throw Error(`crypto.getRandomValues must be defined`)}exports.Hash=i,exports.concatBytes=r,exports.randomBytes=a,exports.toBytes=n;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.0/node_modules/@noble/hashes/esm/utils.js

@@ -1,46 +1,32 @@
-import { crypto as o } from "./crypto.js";
-const c = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-if (!c)
-  throw new Error("Non little-endian hardware is not supported");
-Array.from({ length: 256 }, (t, r) => r.toString(16).padStart(2, "0"));
-function s(t) {
-  if (typeof t != "string")
-    throw new TypeError(`utf8ToBytes expected string, got ${typeof t}`);
-  return new TextEncoder().encode(t);
+import { crypto as e } from "./crypto.js";
+if (new Uint8Array(new Uint32Array([287454020]).buffer)[0] !== 68) throw Error("Non little-endian hardware is not supported");
+Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function t(e) {
+	if (typeof e != "string") throw TypeError(`utf8ToBytes expected string, got ${typeof e}`);
+	return new TextEncoder().encode(e);
 }
-function p(t) {
-  if (typeof t == "string" && (t = s(t)), !(t instanceof Uint8Array))
-    throw new TypeError(`Expected input type is Uint8Array (got ${typeof t})`);
-  return t;
+function n(e) {
+	if (typeof e == "string" && (e = t(e)), !(e instanceof Uint8Array)) throw TypeError(`Expected input type is Uint8Array (got ${typeof e})`);
+	return e;
 }
-function y(...t) {
-  if (!t.every((e) => e instanceof Uint8Array))
-    throw new Error("Uint8Array list expected");
-  if (t.length === 1)
-    return t[0];
-  const r = t.reduce((e, n) => e + n.length, 0), i = new Uint8Array(r);
-  for (let e = 0, n = 0; e < t.length; e++) {
-    const f = t[e];
-    i.set(f, n), n += f.length;
-  }
-  return i;
+function r(...e) {
+	if (!e.every((e) => e instanceof Uint8Array)) throw Error("Uint8Array list expected");
+	if (e.length === 1) return e[0];
+	let t = e.reduce((e, t) => e + t.length, 0), n = new Uint8Array(t);
+	for (let t = 0, r = 0; t < e.length; t++) {
+		let i = e[t];
+		n.set(i, r), r += i.length;
+	}
+	return n;
 }
-class l {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-function w(t = 32) {
-  if (o && typeof o.getRandomValues == "function")
-    return o.getRandomValues(new Uint8Array(t));
-  throw new Error("crypto.getRandomValues must be defined");
-}
-export {
-  l as Hash,
-  y as concatBytes,
-  c as isLE,
-  w as randomBytes,
-  p as toBytes,
-  s as utf8ToBytes
+var i = class {
+	clone() {
+		return this._cloneInto();
+	}
 };
+function a(t = 32) {
+	if (e && typeof e.getRandomValues == "function") return e.getRandomValues(new Uint8Array(t));
+	throw Error("crypto.getRandomValues must be defined");
+}
+//#endregion
+export { i as Hash, r as concatBytes, a as randomBytes, n as toBytes };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_assert.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function o(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`Wrong positive integer: ${e}`)}function i(e){return e instanceof Uint8Array||e!=null&&typeof e=="object"&&e.constructor.name==="Uint8Array"}function n(e,...t){if(!i(e))throw new Error("Expected Uint8Array");if(t.length>0&&!t.includes(e.length))throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`)}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){n(e);const r=t.outputLen;if(e.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=n;exports.exists=s;exports.number=o;exports.output=u;
+function e(e){if(!Number.isSafeInteger(e)||e<0)throw Error(`Wrong positive integer: ${e}`)}function t(e){return e instanceof Uint8Array||typeof e==`object`&&!!e&&e.constructor.name===`Uint8Array`}function n(e,...n){if(!t(e))throw Error(`Expected Uint8Array`);if(n.length>0&&!n.includes(e.length))throw Error(`Expected Uint8Array of length ${n}, not of length=${e.length}`)}function r(e,t=!0){if(e.destroyed)throw Error(`Hash instance has been destroyed`);if(t&&e.finished)throw Error(`Hash#digest() has already been called`)}function i(e,t){n(e);let r=t.outputLen;if(e.length<r)throw Error(`digestInto() expects output buffer of length at least ${r}`)}exports.bytes=n,exports.exists=r,exports.number=e,exports.output=i;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_assert.js

@@ -1,31 +1,22 @@
-function i(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error(`Wrong positive integer: ${e}`);
+//#region node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/esm/_assert.js
+function e(e) {
+	if (!Number.isSafeInteger(e) || e < 0) throw Error(`Wrong positive integer: ${e}`);
 }
-function n(e) {
-  return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
+function t(e) {
+	return e instanceof Uint8Array || typeof e == "object" && !!e && e.constructor.name === "Uint8Array";
 }
-function o(e, ...t) {
-  if (!n(e))
-    throw new Error("Expected Uint8Array");
-  if (t.length > 0 && !t.includes(e.length))
-    throw new Error(`Expected Uint8Array of length ${t}, not of length=${e.length}`);
+function n(e, ...n) {
+	if (!t(e)) throw Error("Expected Uint8Array");
+	if (n.length > 0 && !n.includes(e.length)) throw Error(`Expected Uint8Array of length ${n}, not of length=${e.length}`);
 }
-function f(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 r(e, t = !0) {
+	if (e.destroyed) throw Error("Hash instance has been destroyed");
+	if (t && e.finished) throw Error("Hash#digest() has already been called");
 }
-function s(e, t) {
-  o(e);
-  const r = t.outputLen;
-  if (e.length < r)
-    throw new Error(`digestInto() expects output buffer of length at least ${r}`);
+function i(e, t) {
+	n(e);
+	let r = t.outputLen;
+	if (e.length < r) throw Error(`digestInto() expects output buffer of length at least ${r}`);
 }
-export {
-  o as bytes,
-  f as exists,
-  i as number,
-  s as output
-};
+//#endregion
+export { n as bytes, r as exists, e as number, i as output };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_sha2.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./_assert.cjs"),c=require("./utils.cjs");function b(u,t,n,e){if(typeof u.setBigUint64=="function")return u.setBigUint64(t,n,e);const i=BigInt(32),o=BigInt(4294967295),s=Number(n>>i&o),r=Number(n&o),f=e?4:0,l=e?0:4;u.setUint32(t+f,s,e),u.setUint32(t+l,r,e)}class d extends c.Hash{constructor(t,n,e,i){super(),this.blockLen=t,this.outputLen=n,this.padOffset=e,this.isLE=i,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.exists(this);const{view:n,buffer:e,blockLen:i}=this;t=c.toBytes(t);const o=t.length;for(let s=0;s<o;){const r=Math.min(i-this.pos,o-s);if(r===i){const f=c.createView(t);for(;i<=o-s;s+=i)this.process(f,s);continue}e.set(t.subarray(s,s+r),this.pos),this.pos+=r,s+=r,this.pos===i&&(this.process(n,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){p.exists(this),p.output(t,this),this.finished=!0;const{buffer:n,view:e,blockLen:i,isLE:o}=this;let{pos:s}=this;n[s++]=128,this.buffer.subarray(s).fill(0),this.padOffset>i-s&&(this.process(e,0),s=0);for(let h=s;h<i;h++)n[h]=0;b(e,i-8,BigInt(this.length*8),o),this.process(e,0);const r=c.createView(t),f=this.outputLen;if(f%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=f/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let h=0;h<l;h++)r.setUint32(4*h,g[h],o)}digest(){const{buffer:t,outputLen:n}=this;this.digestInto(t);const e=t.slice(0,n);return this.destroy(),e}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:n,buffer:e,length:i,finished:o,destroyed:s,pos:r}=this;return t.length=i,t.pos=r,t.finished=o,t.destroyed=s,i%n&&t.buffer.set(e),t}}exports.SHA2=d;
+const e=require(`./_assert.cjs`),t=require(`./utils.cjs`);function n(e,t,n,r){if(typeof e.setBigUint64==`function`)return e.setBigUint64(t,n,r);let i=BigInt(32),a=BigInt(4294967295),o=Number(n>>i&a),s=Number(n&a),c=r?4:0,l=r?0:4;e.setUint32(t+c,o,r),e.setUint32(t+l,s,r)}var r=class extends t.Hash{constructor(e,n,r,i){super(),this.blockLen=e,this.outputLen=n,this.padOffset=r,this.isLE=i,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(e),this.view=t.createView(this.buffer)}update(n){e.exists(this);let{view:r,buffer:i,blockLen:a}=this;n=t.toBytes(n);let o=n.length;for(let e=0;e<o;){let s=Math.min(a-this.pos,o-e);if(s===a){let r=t.createView(n);for(;a<=o-e;e+=a)this.process(r,e);continue}i.set(n.subarray(e,e+s),this.pos),this.pos+=s,e+=s,this.pos===a&&(this.process(r,0),this.pos=0)}return this.length+=n.length,this.roundClean(),this}digestInto(r){e.exists(this),e.output(r,this),this.finished=!0;let{buffer:i,view:a,blockLen:o,isLE:s}=this,{pos:c}=this;i[c++]=128,this.buffer.subarray(c).fill(0),this.padOffset>o-c&&(this.process(a,0),c=0);for(let e=c;e<o;e++)i[e]=0;n(a,o-8,BigInt(this.length*8),s),this.process(a,0);let l=t.createView(r),u=this.outputLen;if(u%4)throw Error(`_sha2: outputLen should be aligned to 32bit`);let d=u/4,f=this.get();if(d>f.length)throw Error(`_sha2: outputLen bigger than state`);for(let e=0;e<d;e++)l.setUint32(4*e,f[e],s)}digest(){let{buffer:e,outputLen:t}=this;this.digestInto(e);let n=e.slice(0,t);return this.destroy(),n}_cloneInto(e){e||=new this.constructor,e.set(...this.get());let{blockLen:t,buffer:n,length:r,finished:i,destroyed:a,pos:o}=this;return e.length=r,e.pos=o,e.finished=i,e.destroyed=a,r%t&&e.buffer.set(n),e}};exports.SHA2=r;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_sha2.js

@@ -1,61 +1,54 @@
-import { exists as g, output as b } from "./_assert.js";
-import { Hash as d, createView as p, toBytes as a } from "./utils.js";
-function w(u, t, n, e) {
-  if (typeof u.setBigUint64 == "function")
-    return u.setBigUint64(t, n, e);
-  const i = BigInt(32), o = BigInt(4294967295), s = Number(n >> i & o), h = Number(n & o), f = e ? 4 : 0, c = e ? 0 : 4;
-  u.setUint32(t + f, s, e), u.setUint32(t + c, h, e);
+import { exists as e, output as t } from "./_assert.js";
+import { Hash as n, createView as r, toBytes as i } from "./utils.js";
+//#region node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/esm/_sha2.js
+function a(e, t, n, r) {
+	if (typeof e.setBigUint64 == "function") return e.setBigUint64(t, n, r);
+	let i = BigInt(32), a = BigInt(4294967295), o = Number(n >> i & a), s = Number(n & a), c = r ? 4 : 0, l = r ? 0 : 4;
+	e.setUint32(t + c, o, r), e.setUint32(t + l, s, r);
 }
-class B extends d {
-  constructor(t, n, e, i) {
-    super(), this.blockLen = t, this.outputLen = n, this.padOffset = e, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
-  }
-  update(t) {
-    g(this);
-    const { view: n, buffer: e, blockLen: i } = this;
-    t = a(t);
-    const o = t.length;
-    for (let s = 0; s < o; ) {
-      const h = Math.min(i - this.pos, o - s);
-      if (h === i) {
-        const f = p(t);
-        for (; i <= o - s; s += i)
-          this.process(f, s);
-        continue;
-      }
-      e.set(t.subarray(s, s + h), this.pos), this.pos += h, s += h, this.pos === i && (this.process(n, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    g(this), b(t, this), this.finished = !0;
-    const { buffer: n, view: e, blockLen: i, isLE: o } = this;
-    let { pos: s } = this;
-    n[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(e, 0), s = 0);
-    for (let r = s; r < i; r++)
-      n[r] = 0;
-    w(e, i - 8, BigInt(this.length * 8), o), this.process(e, 0);
-    const h = p(t), f = this.outputLen;
-    if (f % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const c = f / 4, l = this.get();
-    if (c > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let r = 0; r < c; r++)
-      h.setUint32(4 * r, l[r], o);
-  }
-  digest() {
-    const { buffer: t, outputLen: n } = this;
-    this.digestInto(t);
-    const e = t.slice(0, n);
-    return this.destroy(), e;
-  }
-  _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: n, buffer: e, length: i, finished: o, destroyed: s, pos: h } = this;
-    return t.length = i, t.pos = h, t.finished = o, t.destroyed = s, i % n && t.buffer.set(e), t;
-  }
-}
-export {
-  B as SHA2
+var o = class extends n {
+	constructor(e, t, n, i) {
+		super(), this.blockLen = e, this.outputLen = t, this.padOffset = n, this.isLE = i, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(e), this.view = r(this.buffer);
+	}
+	update(t) {
+		e(this);
+		let { view: n, buffer: a, blockLen: o } = this;
+		t = i(t);
+		let s = t.length;
+		for (let e = 0; e < s;) {
+			let i = Math.min(o - this.pos, s - e);
+			if (i === o) {
+				let n = r(t);
+				for (; o <= s - e; e += o) this.process(n, e);
+				continue;
+			}
+			a.set(t.subarray(e, e + i), this.pos), this.pos += i, e += i, this.pos === o && (this.process(n, 0), this.pos = 0);
+		}
+		return this.length += t.length, this.roundClean(), this;
+	}
+	digestInto(n) {
+		e(this), t(n, this), this.finished = !0;
+		let { buffer: i, view: o, blockLen: s, isLE: c } = this, { pos: l } = this;
+		i[l++] = 128, this.buffer.subarray(l).fill(0), this.padOffset > s - l && (this.process(o, 0), l = 0);
+		for (let e = l; e < s; e++) i[e] = 0;
+		a(o, s - 8, BigInt(this.length * 8), c), this.process(o, 0);
+		let u = r(n), d = this.outputLen;
+		if (d % 4) throw Error("_sha2: outputLen should be aligned to 32bit");
+		let f = d / 4, p = this.get();
+		if (f > p.length) throw Error("_sha2: outputLen bigger than state");
+		for (let e = 0; e < f; e++) u.setUint32(4 * e, p[e], c);
+	}
+	digest() {
+		let { buffer: e, outputLen: t } = this;
+		this.digestInto(e);
+		let n = e.slice(0, t);
+		return this.destroy(), n;
+	}
+	_cloneInto(e) {
+		e ||= new this.constructor(), e.set(...this.get());
+		let { blockLen: t, buffer: n, length: r, finished: i, destroyed: a, pos: o } = this;
+		return e.length = r, e.pos = o, e.finished = i, e.destroyed = a, r % t && e.buffer.set(n), e;
+	}
 };
+//#endregion
+export { o as SHA2 };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_u64.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=BigInt(2**32-1),i=BigInt(32);function u(t,e=!1){return e?{h:Number(t&n),l:Number(t>>i&n)}:{h:Number(t>>i&n)|0,l:Number(t&n)|0}}function g(t,e=!1){let r=new Uint32Array(t.length),l=new Uint32Array(t.length);for(let o=0;o<t.length;o++){const{h:c,l:f}=u(t[o],e);[r[o],l[o]]=[c,f]}return[r,l]}const B=(t,e,r)=>t<<r|e>>>32-r,h=(t,e,r)=>e<<r|t>>>32-r,m=(t,e,r)=>e<<r-32|t>>>64-r,S=(t,e,r)=>t<<r-32|e>>>64-r;exports.fromBig=u;exports.rotlBH=m;exports.rotlBL=S;exports.rotlSH=B;exports.rotlSL=h;exports.split=g;
+var e=BigInt(2**32-1),t=BigInt(32);function n(n,r=!1){return r?{h:Number(n&e),l:Number(n>>t&e)}:{h:Number(n>>t&e)|0,l:Number(n&e)|0}}function r(e,t=!1){let r=new Uint32Array(e.length),i=new Uint32Array(e.length);for(let a=0;a<e.length;a++){let{h:o,l:s}=n(e[a],t);[r[a],i[a]]=[o,s]}return[r,i]}var i=(e,t,n)=>e<<n|t>>>32-n,a=(e,t,n)=>t<<n|e>>>32-n,o=(e,t,n)=>t<<n-32|e>>>64-n,s=(e,t,n)=>e<<n-32|t>>>64-n;exports.rotlBH=o,exports.rotlBL=s,exports.rotlSH=i,exports.rotlSL=a,exports.split=r;

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/_u64.js

@@ -1,21 +1,22 @@
-const o = /* @__PURE__ */ BigInt(4294967295), i = /* @__PURE__ */ BigInt(32);
-function f(t, r = !1) {
-  return r ? { h: Number(t & o), l: Number(t >> i & o) } : { h: Number(t >> i & o) | 0, l: Number(t & o) | 0 };
+//#region node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/esm/_u64.js
+var e = /* @__PURE__ */ BigInt(2 ** 32 - 1), t = /* @__PURE__ */ BigInt(32);
+function n(n, r = !1) {
+	return r ? {
+		h: Number(n & e),
+		l: Number(n >> t & e)
+	} : {
+		h: Number(n >> t & e) | 0,
+		l: Number(n & e) | 0
+	};
 }
-function h(t, r = !1) {
-  let n = new Uint32Array(t.length), l = new Uint32Array(t.length);
-  for (let e = 0; e < t.length; e++) {
-    const { h: c, l: u } = f(t[e], r);
-    [n[e], l[e]] = [c, u];
-  }
-  return [n, l];
+function r(e, t = !1) {
+	let r = new Uint32Array(e.length), i = new Uint32Array(e.length);
+	for (let a = 0; a < e.length; a++) {
+		let { h: o, l: s } = n(e[a], t);
+		[r[a], i[a]] = [o, s];
+	}
+	return [r, i];
 }
-const g = (t, r, n) => t << n | r >>> 32 - n, m = (t, r, n) => r << n | t >>> 32 - n, A = (t, r, n) => r << n - 32 | t >>> 64 - n, B = (t, r, n) => t << n - 32 | r >>> 64 - n;
-export {
-  f as fromBig,
-  A as rotlBH,
-  B as rotlBL,
-  g as rotlSH,
-  m as rotlSL,
-  h as split
-};
+var i = (e, t, n) => e << n | t >>> 32 - n, a = (e, t, n) => t << n | e >>> 32 - n, o = (e, t, n) => t << n - 32 | e >>> 64 - n, s = (e, t, n) => e << n - 32 | t >>> 64 - n;
+//#endregion
+export { o as rotlBH, s as rotlBL, i as rotlSH, a as rotlSL, r as split };

package/dist/node_modules/.pnpm/@noble_hashes@1.3.3/node_modules/@noble/hashes/esm/sha256.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./_sha2.cjs"),e=require("./utils.cjs"),y=(n,a,c)=>n&a^~n&c,S=(n,a,c)=>n&a^n&c^a&c,w=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),o=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),h=new Uint32Array(64);class B extends g.SHA2{constructor(){super(64,32,8,!1),this.A=o[0]|0,this.B=o[1]|0,this.C=o[2]|0,this.D=o[3]|0,this.E=o[4]|0,this.F=o[5]|0,this.G=o[6]|0,this.H=o[7]|0}get(){const{A:a,B:c,C:x,D:r,E:i,F:b,G:s,H:f}=this;return[a,c,x,r,i,b,s,f]}set(a,c,x,r,i,b,s,f){this.A=a|0,this.B=c|0,this.C=x|0,this.D=r|0,this.E=i|0,this.F=b|0,this.G=s|0,this.H=f|0}process(a,c){for(let t=0;t<16;t++,c+=4)h[t]=a.getUint32(c,!1);for(let t=16;t<64;t++){const A=h[t-15],l=h[t-2],C=e.rotr(A,7)^e.rotr(A,18)^A>>>3,H=e.rotr(l,17)^e.rotr(l,19)^l>>>10;h[t]=H+h[t-7]+C+h[t-16]|0}let{A:x,B:r,C:i,D:b,E:s,F:f,G:d,H:u}=this;for(let t=0;t<64;t++){const A=e.rotr(s,6)^e.rotr(s,11)^e.rotr(s,25),l=u+A+y(s,f,d)+w[t]+h[t]|0,H=(e.rotr(x,2)^e.rotr(x,13)^e.rotr(x,22))+S(x,r,i)|0;u=d,d=f,f=s,s=b+l|0,b=i,i=r,r=x,x=l+H|0}x=x+this.A|0,r=r+this.B|0,i=i+this.C|0,b=b+this.D|0,s=s+this.E|0,f=f+this.F|0,d=d+this.G|0,u=u+this.H|0,this.set(x,r,i,b,s,f,d,u)}roundClean(){h.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const D=e.wrapConstructor(()=>new B);exports.sha256=D;
+const e=require(`./utils.cjs`),t=require(`./_sha2.cjs`);var n=(e,t,n)=>e&t^~e&n,r=(e,t,n)=>e&t^e&n^t&n,i=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),a=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),o=new Uint32Array(64),s=class extends t.SHA2{constructor(){super(64,32,8,!1),this.A=a[0]|0,this.B=a[1]|0,this.C=a[2]|0,this.D=a[3]|0,this.E=a[4]|0,this.F=a[5]|0,this.G=a[6]|0,this.H=a[7]|0}get(){let{A:e,B:t,C:n,D:r,E:i,F:a,G:o,H:s}=this;return[e,t,n,r,i,a,o,s]}set(e,t,n,r,i,a,o,s){this.A=e|0,this.B=t|0,this.C=n|0,this.D=r|0,this.E=i|0,this.F=a|0,this.G=o|0,this.H=s|0}process(t,a){for(let e=0;e<16;e++,a+=4)o[e]=t.getUint32(a,!1);for(let t=16;t<64;t++){let n=o[t-15],r=o[t-2],i=e.rotr(n,7)^e.rotr(n,18)^n>>>3;o[t]=(e.rotr(r,17)^e.rotr(r,19)^r>>>10)+o[t-7]+i+o[t-16]|0}let{A:s,B:c,C:l,D:u,E:d,F:f,G:p,H:m}=this;for(let t=0;t<64;t++){let a=e.rotr(d,6)^e.rotr(d,11)^e.rotr(d,25),h=m+a+n(d,f,p)+i[t]+o[t]|0,g=(e.rotr(s,2)^e.rotr(s,13)^e.rotr(s,22))+r(s,c,l)|0;m=p,p=f,f=d,d=u+h|0,u=l,l=c,c=s,s=h+g|0}s=s+this.A|0,c=c+this.B|0,l=l+this.C|0,u=u+this.D|0,d=d+this.E|0,f=f+this.F|0,p=p+this.G|0,m=m+this.H|0,this.set(s,c,l,u,d,f,p,m)}roundClean(){o.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}},c=e.wrapConstructor(()=>new s);exports.sha256=c;