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

package/dist/index107.js

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

package/dist/index108.cjs

@@ -1,2 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=`Ethereum Signed Message:
-`;exports.presignMessagePrefix=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index116.cjs"),e={bytes:new Uint8Array,dataView:new DataView(new ArrayBuffer(0)),position:0,positionReadCount:new Map,recursiveReadCount:0,recursiveReadLimit:Number.POSITIVE_INFINITY,assertReadLimit(){if(this.recursiveReadCount>=this.recursiveReadLimit)throw new o.RecursiveReadLimitExceededError({count:this.recursiveReadCount+1,limit:this.recursiveReadLimit})},assertPosition(t){if(t<0||t>this.bytes.length-1)throw new o.PositionOutOfBoundsError({length:this.bytes.length,position:t})},decrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position-t;this.assertPosition(i),this.position=i},getReadCount(t){return this.positionReadCount.get(t||this.position)||0},incrementPosition(t){if(t<0)throw new o.NegativeOffsetError({offset:t});const i=this.position+t;this.assertPosition(i),this.position=i},inspectByte(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectBytes(t,i){const s=i??this.position;return this.assertPosition(s+t-1),this.bytes.subarray(s,s+t)},inspectUint8(t){const i=t??this.position;return this.assertPosition(i),this.bytes[i]},inspectUint16(t){const i=t??this.position;return this.assertPosition(i+1),this.dataView.getUint16(i)},inspectUint24(t){const i=t??this.position;return this.assertPosition(i+2),(this.dataView.getUint16(i)<<8)+this.dataView.getUint8(i+2)},inspectUint32(t){const i=t??this.position;return this.assertPosition(i+3),this.dataView.getUint32(i)},pushByte(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushBytes(t){this.assertPosition(this.position+t.length-1),this.bytes.set(t,this.position),this.position+=t.length},pushUint8(t){this.assertPosition(this.position),this.bytes[this.position]=t,this.position++},pushUint16(t){this.assertPosition(this.position+1),this.dataView.setUint16(this.position,t),this.position+=2},pushUint24(t){this.assertPosition(this.position+2),this.dataView.setUint16(this.position,t>>8),this.dataView.setUint8(this.position+2,t&255),this.position+=3},pushUint32(t){this.assertPosition(this.position+3),this.dataView.setUint32(this.position,t),this.position+=4},readByte(){this.assertReadLimit(),this._touch();const t=this.inspectByte();return this.position++,t},readBytes(t,i){this.assertReadLimit(),this._touch();const s=this.inspectBytes(t);return this.position+=i??t,s},readUint8(){this.assertReadLimit(),this._touch();const t=this.inspectUint8();return this.position+=1,t},readUint16(){this.assertReadLimit(),this._touch();const t=this.inspectUint16();return this.position+=2,t},readUint24(){this.assertReadLimit(),this._touch();const t=this.inspectUint24();return this.position+=3,t},readUint32(){this.assertReadLimit(),this._touch();const t=this.inspectUint32();return this.position+=4,t},get remaining(){return this.bytes.length-this.position},setPosition(t){const i=this.position;return this.assertPosition(t),this.position=t,()=>this.position=i},_touch(){if(this.recursiveReadLimit===Number.POSITIVE_INFINITY)return;const t=this.getReadCount();this.positionReadCount.set(this.position,t+1),t>0&&this.recursiveReadCount++}};function n(t,{recursiveReadLimit:i=8192}={}){const s=Object.create(e);return s.bytes=t,s.dataView=new DataView(t.buffer,t.byteOffset,t.byteLength),s.positionReadCount=new Map,s.recursiveReadLimit=i,s}exports.createCursor=n;

package/dist/index108.js

@@ -1,5 +1,130 @@
-const e = `Ethereum Signed Message:
-`;
+import { RecursiveReadLimitExceededError as e, PositionOutOfBoundsError as n, NegativeOffsetError as o } from "./index116.js";
+const h = {
+  bytes: new Uint8Array(),
+  dataView: new DataView(new ArrayBuffer(0)),
+  position: 0,
+  positionReadCount: /* @__PURE__ */ new Map(),
+  recursiveReadCount: 0,
+  recursiveReadLimit: Number.POSITIVE_INFINITY,
+  assertReadLimit() {
+    if (this.recursiveReadCount >= this.recursiveReadLimit)
+      throw new e({
+        count: this.recursiveReadCount + 1,
+        limit: this.recursiveReadLimit
+      });
+  },
+  assertPosition(t) {
+    if (t < 0 || t > this.bytes.length - 1)
+      throw new n({
+        length: this.bytes.length,
+        position: t
+      });
+  },
+  decrementPosition(t) {
+    if (t < 0)
+      throw new o({ offset: t });
+    const i = this.position - t;
+    this.assertPosition(i), this.position = i;
+  },
+  getReadCount(t) {
+    return this.positionReadCount.get(t || this.position) || 0;
+  },
+  incrementPosition(t) {
+    if (t < 0)
+      throw new o({ offset: t });
+    const i = this.position + t;
+    this.assertPosition(i), this.position = i;
+  },
+  inspectByte(t) {
+    const i = t ?? this.position;
+    return this.assertPosition(i), this.bytes[i];
+  },
+  inspectBytes(t, i) {
+    const s = i ?? this.position;
+    return this.assertPosition(s + t - 1), this.bytes.subarray(s, s + t);
+  },
+  inspectUint8(t) {
+    const i = t ?? this.position;
+    return this.assertPosition(i), this.bytes[i];
+  },
+  inspectUint16(t) {
+    const i = t ?? this.position;
+    return this.assertPosition(i + 1), this.dataView.getUint16(i);
+  },
+  inspectUint24(t) {
+    const i = t ?? this.position;
+    return this.assertPosition(i + 2), (this.dataView.getUint16(i) << 8) + this.dataView.getUint8(i + 2);
+  },
+  inspectUint32(t) {
+    const i = t ?? this.position;
+    return this.assertPosition(i + 3), this.dataView.getUint32(i);
+  },
+  pushByte(t) {
+    this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
+  },
+  pushBytes(t) {
+    this.assertPosition(this.position + t.length - 1), this.bytes.set(t, this.position), this.position += t.length;
+  },
+  pushUint8(t) {
+    this.assertPosition(this.position), this.bytes[this.position] = t, this.position++;
+  },
+  pushUint16(t) {
+    this.assertPosition(this.position + 1), this.dataView.setUint16(this.position, t), this.position += 2;
+  },
+  pushUint24(t) {
+    this.assertPosition(this.position + 2), this.dataView.setUint16(this.position, t >> 8), this.dataView.setUint8(this.position + 2, t & 255), this.position += 3;
+  },
+  pushUint32(t) {
+    this.assertPosition(this.position + 3), this.dataView.setUint32(this.position, t), this.position += 4;
+  },
+  readByte() {
+    this.assertReadLimit(), this._touch();
+    const t = this.inspectByte();
+    return this.position++, t;
+  },
+  readBytes(t, i) {
+    this.assertReadLimit(), this._touch();
+    const s = this.inspectBytes(t);
+    return this.position += i ?? t, s;
+  },
+  readUint8() {
+    this.assertReadLimit(), this._touch();
+    const t = this.inspectUint8();
+    return this.position += 1, t;
+  },
+  readUint16() {
+    this.assertReadLimit(), this._touch();
+    const t = this.inspectUint16();
+    return this.position += 2, t;
+  },
+  readUint24() {
+    this.assertReadLimit(), this._touch();
+    const t = this.inspectUint24();
+    return this.position += 3, t;
+  },
+  readUint32() {
+    this.assertReadLimit(), this._touch();
+    const t = this.inspectUint32();
+    return this.position += 4, t;
+  },
+  get remaining() {
+    return this.bytes.length - this.position;
+  },
+  setPosition(t) {
+    const i = this.position;
+    return this.assertPosition(t), this.position = t, () => this.position = i;
+  },
+  _touch() {
+    if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)
+      return;
+    const t = this.getReadCount();
+    this.positionReadCount.set(this.position, t + 1), t > 0 && this.recursiveReadCount++;
+  }
+};
+function a(t, { recursiveReadLimit: i = 8192 } = {}) {
+  const s = Object.create(h);
+  return s.bytes = t, s.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength), s.positionReadCount = /* @__PURE__ */ new Map(), s.recursiveReadLimit = i, s;
+}
 export {
-  e as presignMessagePrefix
+  a as createCursor
 };

package/dist/index109.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 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/index109.js

@@ -1,37 +1,21 @@
-function n(e) {
-  if (!Number.isSafeInteger(e) || e < 0)
-    throw new Error("positive integer expected, got " + e);
+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 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);
+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 {
-  i as abytes,
-  s as aexists,
-  f as ahash,
-  n as anumber,
-  u as aoutput
+  f as fromBig,
+  A as rotlBH,
+  B as rotlBL,
+  g as rotlSH,
+  m as rotlSL,
+  h as split
 };

package/dist/index11.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index16.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"});const t=require("./index17.cjs"),o=require("./index8.cjs"),s=require("./index3.cjs");class i{constructor(e){this.token=e}async getToken(){return this.token?this.verifyToken(this.token).ok?t.Ok(this.token):t.Err("Token is invalid"):t.Err("Token is not set")}verifyToken(e){try{const r=s.parseJwt(e);if(!r)return t.Ok(!1);const n=Math.floor(Date.now()/1e3)+120;return t.Ok(r.exp>n)}catch{return t.Ok(!1)}}async getAuthHeaders(){const e=await this.getToken();return e.ok?t.Ok({[o.AuthHeaderEnum.Authorization]:e.val}):t.Err(e.error??"Failed to get auth token")}}exports.Passkey=i;

package/dist/index11.js

@@ -1,143 +1,28 @@
-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;
+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;
   }
-  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());
+  async getToken() {
+    return this.token ? this.verifyToken(this.token).ok ? e(this.token) : r("Token is invalid") : r("Token is not set");
   }
-  /**
-   * 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);
+  verifyToken(t) {
     try {
-      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);
+      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);
     }
   }
-  /**
-   * 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);
-    }
+  async getAuthHeaders() {
+    const t = await this.getToken();
+    return t.ok ? e({ [s.Authorization]: t.val }) : r(t.error ?? "Failed to get auth token");
   }
 }
 export {
-  f as PasskeyLogin
+  c as Passkey
 };

package/dist/index110.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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=1;exports.versionedHashVersionKzg=e;

package/dist/index110.js

@@ -1,21 +1,4 @@
-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 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;
+const e = 1;
 export {
-  f as fromBig,
-  A as rotlBH,
-  B as rotlBL,
-  g as rotlSH,
-  m as rotlSL,
-  h as split
+  e as versionedHashVersionKzg
 };

package/dist/index111.cjs

@@ -1 +1 @@
-"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;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=2n**256n-1n;exports.maxUint256=t;