@gardenfi/utils 2.0.6-beta.1 → 2.0.6-beta.3

package/dist/index11.js

@@ -1,28 +1,143 @@
-import { Err as r, Ok as e } from "./index17.js";
-import { AuthHeaderEnum as s } from "./index8.js";
-import { parseJwt as i } from "./index3.js";
-class c {
-  constructor(t) {
-    this.token = t;
+import { Ok as l, Err as e, Fetcher as c } from "./index16.js";
+import { startRegistration as d, startAuthentication as u } from "@simplewebauthn/browser";
+class f {
+  constructor(t, r) {
+    if (this.storeKey = "passkey-auth", !window)
+      throw new Error("Passkey is only supported in the browser environment.");
+    this.url = t.endpoint("passkey"), this.store = r;
   }
-  async getToken() {
-    return this.token ? this.verifyToken(this.token).ok ? e(this.token) : r("Token is invalid") : r("Token is not set");
+  getPasskeyFromStore() {
+    if (this.token && this.userName)
+      return l({ token: this.token, gardenUserName: this.userName });
+    const t = this.store.getItem(this.storeKey);
+    if (t) {
+      const r = JSON.parse(t);
+      return l(r);
+    }
+    return e("Passkey is not set");
+  }
+  /**
+   * Validates the username according to predefined rules.
+   * @param username The username to validate.
+   * @returns Result<string, string> - Ok if valid, Err with message if invalid.
+   */
+  validateUsername(t) {
+    return !t || t.length === 0 ? e("Username cannot be empty") : t.length < 3 || t.length > 32 ? e("Username must be between 3 and 32 characters") : t.includes(" ") ? e("Username cannot contain spaces") : l(t.trim().toLowerCase());
   }
-  verifyToken(t) {
+  /**
+   * Handles user registration using WebAuthn passkeys.
+   * @param username The username to register.
+   * @returns AsyncResult<PasskeyToken, string> - Ok if successful, Err if failed.
+   */
+  async register(t) {
+    var i;
+    const r = this.validateUsername(t);
+    if (r.error) return e(r.error);
     try {
-      const o = i(t);
-      if (!o) return e(!1);
-      const n = Math.floor(Date.now() / 1e3) + 120;
-      return e(o.exp > n);
-    } catch {
-      return e(!1);
+      const n = await c.post(this.url.endpoint("register/begin"), {
+        body: JSON.stringify({ username: r }),
+        headers: { credentials: "include", "Content-Type": "application/json" }
+      });
+      if (n.error)
+        return e("Failed to start registration", n.error);
+      const s = (i = n.result) == null ? void 0 : i.challenge;
+      if (!s) return e("No challenge found");
+      if (!s.publicKey.authenticatorSelection)
+        return e("No authenticator selection found");
+      s.publicKey.authenticatorSelection.requireResidentKey = !0, s.publicKey.authenticatorSelection.residentKey = "required";
+      const a = await d({
+        optionsJSON: s.publicKey
+      }), o = await c.post(
+        this.url.endpoint("register/finish"),
+        {
+          body: JSON.stringify({
+            username: r,
+            credential: a
+          }),
+          headers: {
+            credentials: "include",
+            "Content-Type": "application/json"
+          }
+        }
+      );
+      return o.error ? e("Failed to verify registration: " + o.error) : o.result ? (this.token = o.result.token, this.userName = r.val, l(o.result)) : e("No verification result found");
+    } catch (n) {
+      return e("Registration error", n);
     }
   }
-  async getAuthHeaders() {
-    const t = await this.getToken();
-    return t.ok ? e({ [s.Authorization]: t.val }) : r(t.error ?? "Failed to get auth token");
+  /**
+   * Handles user login using WebAuthn passkeys.
+   * @param username The username to log in.
+   * @returns AsyncResult<PasskeyToken, string> - Ok if successful, Err if failed.
+   */
+  async login(t) {
+    var i;
+    const r = this.validateUsername(t);
+    if (r.error) return e(r.error);
+    try {
+      const n = await c.post(this.url.endpoint("login/begin"), {
+        body: JSON.stringify({ username: r }),
+        headers: { credentials: "include", "Content-Type": "application/json" }
+      });
+      if (n.error)
+        return e("Failed to start login", n.error);
+      const s = (i = n.result) == null ? void 0 : i.challenge;
+      if (!s) return e("No challenge found");
+      const a = await u({
+        optionsJSON: s.publicKey
+      }), o = await c.post(
+        this.url.endpoint("login/finish"),
+        {
+          body: JSON.stringify({
+            username: r,
+            credential: a
+          }),
+          headers: {
+            credentials: "include",
+            "Content-Type": "application/json"
+          }
+        }
+      );
+      return o.error ? e("Failed to verify login", o.error) : o.result ? (this.token = o.result.token, this.userName = r.val, l(o.result)) : e("No verification result found");
+    } catch (n) {
+      return e("Login error", n);
+    }
+  }
+  /**
+   * Handles conditional login (without username) for existing users.
+   * @returns AsyncResult<PasskeyToken, string> - Ok if successful, Err if failed.
+   */
+  async conditionalLogin() {
+    var t, r;
+    try {
+      const i = await c.get(this.url.endpoint("conditional-login/begin"), {
+        headers: { credentials: "include" }
+      });
+      if (i.error)
+        return e("Failed to start login", i.error);
+      const n = (t = i.result) == null ? void 0 : t.challenge;
+      if (!n) return e("No challenge found");
+      const s = await u({
+        optionsJSON: n.publicKey
+      }), a = await c.post(
+        this.url.endpoint("conditional-login/finish"),
+        {
+          body: JSON.stringify({
+            login_id: (r = i.result) == null ? void 0 : r.login_id,
+            credential: s
+          }),
+          headers: {
+            credentials: "include",
+            "Content-Type": "application/json"
+          }
+        }
+      );
+      return a.error ? e("Failed to verify login", a.error) : a.result ? (this.token = a.result.token, this.userName = a.result.gardenUserName, l(a.result)) : e("No verification result found");
+    } catch (i) {
+      return e("Conditional login error", i);
+    }
   }
 }
 export {
-  c as Passkey
+  f as PasskeyLogin
 };

package/dist/index110.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index113.cjs"),c=require("./index111.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 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;

package/dist/index110.js

@@ -1,70 +1,21 @@
-import { aexists as g, aoutput as d } from "./index113.js";
-import { Hash as b, createView as p, toBytes as a } from "./index111.js";
-function w(o, t, s, i) {
-  if (typeof o.setBigUint64 == "function")
-    return o.setBigUint64(t, s, i);
-  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
-  o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
+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 };
 }
-function B(o, t, s) {
-  return o & t ^ ~o & s;
-}
-function L(o, t, s) {
-  return o & t ^ o & s ^ t & s;
-}
-class U extends b {
-  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 = p(this.buffer);
-  }
-  update(t) {
-    g(this);
-    const { view: s, buffer: i, blockLen: n } = this;
-    t = a(t);
-    const h = t.length;
-    for (let e = 0; e < h; ) {
-      const r = Math.min(n - this.pos, h - e);
-      if (r === n) {
-        const u = p(t);
-        for (; n <= h - e; e += n)
-          this.process(u, e);
-        continue;
-      }
-      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
-    }
-    return this.length += t.length, this.roundClean(), this;
-  }
-  digestInto(t) {
-    g(this), d(t, this), this.finished = !0;
-    const { buffer: s, view: i, blockLen: n, isLE: h } = 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;
-    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
-    const r = p(t), u = this.outputLen;
-    if (u % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const c = u / 4, l = this.get();
-    if (c > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let f = 0; f < c; f++)
-      r.setUint32(4 * f, l[f], h);
-  }
-  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: h, destroyed: e, pos: r } = this;
-    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
+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];
 }
+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 {
-  B as Chi,
-  U as HashMD,
-  L as Maj,
-  w as setBigUint64
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
 };

package/dist/index111.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index112.cjs"),f=require("./index113.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 o=require("./index113.cjs"),f=require("./index109.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;

package/dist/index111.js

@@ -1,5 +1,5 @@
-import { crypto as o } from "./index112.js";
-import { abytes as i } from "./index113.js";
+import { crypto as o } from "./index113.js";
+import { abytes as i } from "./index109.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));

package/dist/index112.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index109.cjs"),c=require("./index111.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;

package/dist/index112.js

@@ -1,4 +1,70 @@
-const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+import { aexists as g, aoutput as d } from "./index109.js";
+import { Hash as b, createView as p, toBytes as a } from "./index111.js";
+function w(o, t, s, i) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, i);
+  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), u = i ? 4 : 0, c = i ? 0 : 4;
+  o.setUint32(t + u, e, i), o.setUint32(t + c, r, i);
+}
+function B(o, t, s) {
+  return o & t ^ ~o & s;
+}
+function L(o, t, s) {
+  return o & t ^ o & s ^ t & s;
+}
+class U extends b {
+  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 = p(this.buffer);
+  }
+  update(t) {
+    g(this);
+    const { view: s, buffer: i, blockLen: n } = this;
+    t = a(t);
+    const h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(n - this.pos, h - e);
+      if (r === n) {
+        const u = p(t);
+        for (; n <= h - e; e += n)
+          this.process(u, e);
+        continue;
+      }
+      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    g(this), d(t, this), this.finished = !0;
+    const { buffer: s, view: i, blockLen: n, isLE: h } = 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;
+    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
+    const r = p(t), u = this.outputLen;
+    if (u % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const c = u / 4, l = this.get();
+    if (c > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < c; f++)
+      r.setUint32(4 * f, l[f], h);
+  }
+  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: h, destroyed: e, pos: r } = this;
+    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
+  }
+}
 export {
-  o as crypto
+  B as Chi,
+  U as HashMD,
+  L as Maj,
+  w as setBigUint64
 };

package/dist/index113.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"});const o=typeof globalThis=="object"&&"crypto"in globalThis?globalThis.crypto:void 0;exports.crypto=o;

package/dist/index113.js

@@ -1,37 +1,4 @@
-function n(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
-}
-function o(e) {
-  return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
-}
-function i(e, ...t) {
-  if (!o(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 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);
-}
+const o = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 export {
-  i as abytes,
-  s as aexists,
-  f as ahash,
-  n as anumber,
-  u as aoutput
+  o as crypto
 };

package/dist/index114.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index113.cjs"),c=require("./index111.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.ahash(t);const h=c.toBytes(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 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.aexists(this),this.iHash.update(t),this}digestInto(t){o.aexists(this),o.abytes(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 d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index109.cjs"),c=require("./index111.cjs");class r extends c.Hash{constructor(t,i){super(),this.finished=!1,this.destroyed=!1,o.ahash(t);const h=c.toBytes(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 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.aexists(this),this.iHash.update(t),this}digestInto(t){o.aexists(this),o.abytes(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 d=(n,t,i)=>new r(n,t).update(i).digest();d.create=(n,t)=>new r(n,t);exports.HMAC=r;exports.hmac=d;

package/dist/index114.js

@@ -1,4 +1,4 @@
-import { ahash as c, aexists as a, abytes as u } from "./index113.js";
+import { ahash as c, aexists as a, abytes as u } from "./index109.js";
 import { Hash as H, toBytes as p } from "./index111.js";
 class r extends H {
   constructor(t, i) {

package/dist/index115.cjs

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

package/dist/index115.js

@@ -1,5 +1,5 @@
 import { wNAF as gt, validateBasic as mt, pippenger as Et } from "./index117.js";
-import { Field as bt, mod as wt, getMinHashLength as vt, mapHashToField as Bt, invert as xt } from "./index89.js";
+import { Field as bt, mod as wt, getMinHashLength as vt, mapHashToField as Bt, invert as xt } from "./index107.js";
 import * as St from "./index116.js";
 import { abool as tt, bytesToNumberBE as nt, inRange as yt, bitMask as Rt, concatBytes as st, validateObject as pt, ensureBytes as Y, aInRange as Q, hexToBytes as lt, createHmacDrbg as Ot, isBytes as ct, numberToHexUnpadded as et, abytes as At, bytesToHex as at, numberToBytesBE as ut, memoized as dt } from "./index116.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */

package/dist/index117.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index89.cjs"),y=require("./index116.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const I=BigInt(0),p=BigInt(1);function m(e,r){const t=r.negate();return e?t:r}function E(e,r){if(!Number.isSafeInteger(e)||e<=0||e>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+e)}function b(e,r){E(e,r);const t=Math.ceil(r/e)+1,n=2**(e-1);return{windows:t,windowSize:n}}function O(e,r){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof r))throw new Error("invalid point at index "+n)})}function x(e,r){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!r.isValid(t))throw new Error("invalid scalar at index "+n)})}const B=new WeakMap,N=new WeakMap;function S(e){return N.get(e)||1}function L(e,r){return{constTimeNegate:m,hasPrecomputes(t){return S(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>I;)n&p&&(o=o.add(i)),i=i.double(),n>>=p;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,r),a=[];let c=t,d=c;for(let g=0;g<o;g++){d=c,a.push(d);for(let l=1;l<i;l++)d=d.add(c),a.push(d);c=d.double()}return a},wNAF(t,n,o){const{windows:i,windowSize:a}=b(t,r);let c=e.ZERO,d=e.BASE;const g=BigInt(2**t-1),l=2**t,w=BigInt(t);for(let u=0;u<i;u++){const s=u*a;let f=Number(o&g);o>>=w,f>a&&(f-=l,o+=p);const h=s,M=s+Math.abs(f)-1,F=u%2!==0,z=f<0;f===0?d=d.add(m(F,n[h])):c=c.add(m(z,n[M]))}return{p:c,f:d}},wNAFUnsafe(t,n,o,i=e.ZERO){const{windows:a,windowSize:c}=b(t,r),d=BigInt(2**t-1),g=2**t,l=BigInt(t);for(let w=0;w<a;w++){const u=w*c;if(o===I)break;let s=Number(o&d);if(o>>=l,s>c&&(s-=g,o+=p),s===0)continue;let f=n[u+Math.abs(s)-1];s<0&&(f=f.negate()),i=i.add(f)}return i},getPrecomputes(t,n,o){let i=B.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&B.set(n,o(i))),i},wNAFCached(t,n,o){const i=S(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const a=S(t);return a===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(a,this.getPrecomputes(a,t,o),n,i)},setWindowSize(t,n){E(n,r),N.set(t,n),B.delete(t)}}}function j(e,r,t,n){if(O(t,e),x(n,r),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=y.bitLen(BigInt(t.length)),a=i>12?i-3:i>4?i-2:i?2:1,c=(1<<a)-1,d=new Array(c+1).fill(o),g=Math.floor((r.BITS-1)/a)*a;let l=o;for(let w=g;w>=0;w-=a){d.fill(o);for(let s=0;s<n.length;s++){const f=n[s],h=Number(f>>BigInt(w)&BigInt(c));d[h]=d[h].add(t[s])}let u=o;for(let s=d.length-1,f=o;s>0;s--)f=f.add(d[s]),u=u.add(f);if(l=l.add(u),w!==0)for(let s=0;s<a;s++)l=l.double()}return l}function k(e){return A.validateField(e.Fp),y.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=j;exports.validateBasic=k;exports.wNAF=L;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index107.cjs"),y=require("./index116.cjs");/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const I=BigInt(0),p=BigInt(1);function m(e,r){const t=r.negate();return e?t:r}function E(e,r){if(!Number.isSafeInteger(e)||e<=0||e>r)throw new Error("invalid window size, expected [1.."+r+"], got W="+e)}function b(e,r){E(e,r);const t=Math.ceil(r/e)+1,n=2**(e-1);return{windows:t,windowSize:n}}function O(e,r){if(!Array.isArray(e))throw new Error("array expected");e.forEach((t,n)=>{if(!(t instanceof r))throw new Error("invalid point at index "+n)})}function x(e,r){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach((t,n)=>{if(!r.isValid(t))throw new Error("invalid scalar at index "+n)})}const B=new WeakMap,N=new WeakMap;function S(e){return N.get(e)||1}function L(e,r){return{constTimeNegate:m,hasPrecomputes(t){return S(t)!==1},unsafeLadder(t,n,o=e.ZERO){let i=t;for(;n>I;)n&p&&(o=o.add(i)),i=i.double(),n>>=p;return o},precomputeWindow(t,n){const{windows:o,windowSize:i}=b(n,r),a=[];let c=t,d=c;for(let g=0;g<o;g++){d=c,a.push(d);for(let l=1;l<i;l++)d=d.add(c),a.push(d);c=d.double()}return a},wNAF(t,n,o){const{windows:i,windowSize:a}=b(t,r);let c=e.ZERO,d=e.BASE;const g=BigInt(2**t-1),l=2**t,w=BigInt(t);for(let u=0;u<i;u++){const s=u*a;let f=Number(o&g);o>>=w,f>a&&(f-=l,o+=p);const h=s,M=s+Math.abs(f)-1,F=u%2!==0,z=f<0;f===0?d=d.add(m(F,n[h])):c=c.add(m(z,n[M]))}return{p:c,f:d}},wNAFUnsafe(t,n,o,i=e.ZERO){const{windows:a,windowSize:c}=b(t,r),d=BigInt(2**t-1),g=2**t,l=BigInt(t);for(let w=0;w<a;w++){const u=w*c;if(o===I)break;let s=Number(o&d);if(o>>=l,s>c&&(s-=g,o+=p),s===0)continue;let f=n[u+Math.abs(s)-1];s<0&&(f=f.negate()),i=i.add(f)}return i},getPrecomputes(t,n,o){let i=B.get(n);return i||(i=this.precomputeWindow(n,t),t!==1&&B.set(n,o(i))),i},wNAFCached(t,n,o){const i=S(t);return this.wNAF(i,this.getPrecomputes(i,t,o),n)},wNAFCachedUnsafe(t,n,o,i){const a=S(t);return a===1?this.unsafeLadder(t,n,i):this.wNAFUnsafe(a,this.getPrecomputes(a,t,o),n,i)},setWindowSize(t,n){E(n,r),N.set(t,n),B.delete(t)}}}function j(e,r,t,n){if(O(t,e),x(n,r),t.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const o=e.ZERO,i=y.bitLen(BigInt(t.length)),a=i>12?i-3:i>4?i-2:i?2:1,c=(1<<a)-1,d=new Array(c+1).fill(o),g=Math.floor((r.BITS-1)/a)*a;let l=o;for(let w=g;w>=0;w-=a){d.fill(o);for(let s=0;s<n.length;s++){const f=n[s],h=Number(f>>BigInt(w)&BigInt(c));d[h]=d[h].add(t[s])}let u=o;for(let s=d.length-1,f=o;s>0;s--)f=f.add(d[s]),u=u.add(f);if(l=l.add(u),w!==0)for(let s=0;s<a;s++)l=l.double()}return l}function k(e){return A.validateField(e.Fp),y.validateObject(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...A.nLength(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}exports.pippenger=j;exports.validateBasic=k;exports.wNAF=L;

package/dist/index117.js

@@ -1,4 +1,4 @@
-import { validateField as z, nLength as F } from "./index89.js";
+import { validateField as z, nLength as F } from "./index107.js";
 import { validateObject as x, bitLen as O } from "./index116.js";
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
 const I = BigInt(0), p = BigInt(1);

package/dist/index12.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index17.cjs"),l=require("@simplewebauthn/browser");class c{constructor(r,t){if(this.storeKey="passkey-auth",!window)throw new Error("Passkey is only supported in the browser environment.");this.url=r.endpoint("passkey"),this.store=t}getPasskeyFromStore(){if(this.token&&this.userName)return e.Ok({token:this.token,gardenUserName:this.userName});const r=this.store.getItem(this.storeKey);if(r){const t=JSON.parse(r);return e.Ok(t)}return e.Err("Passkey is not set")}validateUsername(r){return!r||r.length===0?e.Err("Username cannot be empty"):r.length<3||r.length>32?e.Err("Username must be between 3 and 32 characters"):r.includes(" ")?e.Err("Username cannot contain spaces"):e.Ok(r.trim().toLowerCase())}async register(r){var i;const t=this.validateUsername(r);if(t.error)return e.Err(t.error);try{const n=await e.Fetcher.post(this.url.endpoint("register/begin"),{body:JSON.stringify({username:t}),headers:{credentials:"include","Content-Type":"application/json"}});if(n.error)return e.Err("Failed to start registration",n.error);const s=(i=n.result)==null?void 0:i.challenge;if(!s)return e.Err("No challenge found");if(!s.publicKey.authenticatorSelection)return e.Err("No authenticator selection found");s.publicKey.authenticatorSelection.requireResidentKey=!0,s.publicKey.authenticatorSelection.residentKey="required";const a=await l.startRegistration({optionsJSON:s.publicKey}),o=await e.Fetcher.post(this.url.endpoint("register/finish"),{body:JSON.stringify({username:t,credential:a}),headers:{credentials:"include","Content-Type":"application/json"}});return o.error?e.Err("Failed to verify registration: "+o.error):o.result?(this.token=o.result.token,this.userName=t.val,e.Ok(o.result)):e.Err("No verification result found")}catch(n){return e.Err("Registration error",n)}}async login(r){var i;const t=this.validateUsername(r);if(t.error)return e.Err(t.error);try{const n=await e.Fetcher.post(this.url.endpoint("login/begin"),{body:JSON.stringify({username:t}),headers:{credentials:"include","Content-Type":"application/json"}});if(n.error)return e.Err("Failed to start login",n.error);const s=(i=n.result)==null?void 0:i.challenge;if(!s)return e.Err("No challenge found");const a=await l.startAuthentication({optionsJSON:s.publicKey}),o=await e.Fetcher.post(this.url.endpoint("login/finish"),{body:JSON.stringify({username:t,credential:a}),headers:{credentials:"include","Content-Type":"application/json"}});return o.error?e.Err("Failed to verify login",o.error):o.result?(this.token=o.result.token,this.userName=t.val,e.Ok(o.result)):e.Err("No verification result found")}catch(n){return e.Err("Login error",n)}}async conditionalLogin(){var r,t;try{const i=await e.Fetcher.get(this.url.endpoint("conditional-login/begin"),{headers:{credentials:"include"}});if(i.error)return e.Err("Failed to start login",i.error);const n=(r=i.result)==null?void 0:r.challenge;if(!n)return e.Err("No challenge found");const s=await l.startAuthentication({optionsJSON:n.publicKey}),a=await e.Fetcher.post(this.url.endpoint("conditional-login/finish"),{body:JSON.stringify({login_id:(t=i.result)==null?void 0:t.login_id,credential:s}),headers:{credentials:"include","Content-Type":"application/json"}});return a.error?e.Err("Failed to verify login",a.error):a.result?(this.token=a.result.token,this.userName=a.result.gardenUserName,e.Ok(a.result)):e.Err("No verification result found")}catch(i){return e.Err("Conditional login error",i)}}}exports.PasskeyLogin=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});class r{constructor(){this.memory=new Map}getItem(e){return this.memory.has(e)?this.memory.get(e):null}setItem(e,t){this.memory.set(e,t)}removeItem(e){this.memory.has(e)&&this.memory.delete(e)}}exports.MemoryStorage=r;