@gardenfi/utils 2.0.5 → 2.0.6-alpha.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (234) hide show
  1. package/dist/index.cjs +1 -1
  2. package/dist/index.js +22 -20
  3. package/dist/index10.cjs +1 -1
  4. package/dist/index10.js +37 -19
  5. package/dist/index100.cjs +1 -1
  6. package/dist/index100.js +40 -6
  7. package/dist/index101.cjs +1 -2
  8. package/dist/index101.js +644 -3
  9. package/dist/index102.cjs +1 -1
  10. package/dist/index102.js +227 -108
  11. package/dist/index103.cjs +1 -1
  12. package/dist/index103.js +167 -73
  13. package/dist/index104.cjs +1 -1
  14. package/dist/index104.js +13 -2
  15. package/dist/index105.cjs +1 -1
  16. package/dist/index105.js +126 -16
  17. package/dist/index106.cjs +2 -1
  18. package/dist/index106.js +3 -19
  19. package/dist/index107.cjs +1 -1
  20. package/dist/index107.js +17 -15
  21. package/dist/index108.cjs +1 -1
  22. package/dist/index108.js +36 -221
  23. package/dist/index109.cjs +1 -1
  24. package/dist/index109.js +2 -35
  25. package/dist/index11.cjs +1 -1
  26. package/dist/index11.js +19 -134
  27. package/dist/index110.cjs +1 -1
  28. package/dist/index110.js +2 -19
  29. package/dist/index111.cjs +1 -1
  30. package/dist/index111.js +32 -64
  31. package/dist/index112.cjs +1 -1
  32. package/dist/index112.js +10 -66
  33. package/dist/index113.cjs +1 -1
  34. package/dist/index113.js +20 -2
  35. package/dist/index114.cjs +1 -1
  36. package/dist/index114.js +5 -41
  37. package/dist/index115.cjs +1 -1
  38. package/dist/index115.js +10 -643
  39. package/dist/index116.cjs +1 -1
  40. package/dist/index116.js +16 -227
  41. package/dist/index117.cjs +1 -1
  42. package/dist/index117.js +6 -172
  43. package/dist/index118.cjs +1 -0
  44. package/dist/index118.js +7 -0
  45. package/dist/index12.cjs +1 -1
  46. package/dist/index12.js +136 -10
  47. package/dist/index13.cjs +1 -1
  48. package/dist/index13.js +15 -2
  49. package/dist/index14.cjs +1 -1
  50. package/dist/index14.js +2 -34
  51. package/dist/index15.cjs +1 -1
  52. package/dist/index15.js +32 -17
  53. package/dist/index16.cjs +1 -1
  54. package/dist/index16.js +14 -183
  55. package/dist/index17.cjs +1 -1
  56. package/dist/index17.js +187 -92
  57. package/dist/index18.cjs +1 -1
  58. package/dist/index18.js +92 -34
  59. package/dist/index19.cjs +1 -1
  60. package/dist/index19.js +36 -32
  61. package/dist/index20.cjs +1 -16
  62. package/dist/index20.js +30 -112
  63. package/dist/index21.cjs +16 -1
  64. package/dist/index21.js +113 -30
  65. package/dist/index22.cjs +1 -1
  66. package/dist/index22.js +31 -18
  67. package/dist/index23.cjs +1 -1
  68. package/dist/index23.js +41 -7
  69. package/dist/index24.cjs +1 -1
  70. package/dist/index24.js +3 -3
  71. package/dist/index25.cjs +1 -1
  72. package/dist/index25.js +23 -19
  73. package/dist/index26.cjs +1 -1
  74. package/dist/index26.js +6 -8
  75. package/dist/index27.cjs +1 -1
  76. package/dist/index27.js +12 -30
  77. package/dist/index28.cjs +1 -1
  78. package/dist/index28.js +15 -26
  79. package/dist/index29.cjs +1 -2
  80. package/dist/index29.js +5 -65
  81. package/dist/index30.cjs +1 -1
  82. package/dist/index30.js +13 -51
  83. package/dist/index31.cjs +1 -1
  84. package/dist/index31.js +10 -12
  85. package/dist/index32.cjs +1 -1
  86. package/dist/index32.js +12 -24
  87. package/dist/index33.cjs +1 -1
  88. package/dist/index33.js +11 -75
  89. package/dist/index34.cjs +1 -1
  90. package/dist/index34.js +13 -23
  91. package/dist/index35.cjs +1 -1
  92. package/dist/index35.js +23 -7
  93. package/dist/index36.cjs +1 -1
  94. package/dist/index36.js +55 -32
  95. package/dist/index37.cjs +1 -1
  96. package/dist/index37.js +16 -15
  97. package/dist/index38.cjs +1 -1
  98. package/dist/index38.js +6 -2
  99. package/dist/index39.cjs +1 -1
  100. package/dist/index39.js +8 -8
  101. package/dist/index4.cjs +1 -1
  102. package/dist/index4.js +2 -2
  103. package/dist/index40.cjs +1 -1
  104. package/dist/index40.js +171 -20
  105. package/dist/index41.cjs +1 -1
  106. package/dist/index41.js +100 -9
  107. package/dist/index42.cjs +1 -1
  108. package/dist/index42.js +20 -33
  109. package/dist/index43.cjs +1 -2
  110. package/dist/index43.js +17 -59
  111. package/dist/index44.cjs +1 -1
  112. package/dist/index44.js +8 -2
  113. package/dist/index45.cjs +1 -1
  114. package/dist/index45.js +21 -6
  115. package/dist/index46.cjs +1 -1
  116. package/dist/index46.js +8 -6
  117. package/dist/index47.cjs +1 -1
  118. package/dist/index47.js +31 -4
  119. package/dist/index48.cjs +1 -1
  120. package/dist/index48.js +26 -11
  121. package/dist/index49.cjs +2 -5
  122. package/dist/index49.js +53 -44
  123. package/dist/index50.cjs +1 -1
  124. package/dist/index50.js +51 -3
  125. package/dist/index51.cjs +1 -2
  126. package/dist/index51.js +12 -34
  127. package/dist/index52.cjs +1 -1
  128. package/dist/index52.js +24 -5
  129. package/dist/index53.cjs +1 -1
  130. package/dist/index53.js +75 -21
  131. package/dist/index54.cjs +1 -1
  132. package/dist/index54.js +7 -12
  133. package/dist/index55.cjs +1 -1
  134. package/dist/index55.js +32 -55
  135. package/dist/index56.cjs +1 -1
  136. package/dist/index56.js +15 -8
  137. package/dist/index57.cjs +1 -1
  138. package/dist/index57.js +2 -22
  139. package/dist/index58.cjs +1 -1
  140. package/dist/index58.js +8 -11
  141. package/dist/index59.cjs +1 -1
  142. package/dist/index59.js +20 -8
  143. package/dist/index6.cjs +1 -1
  144. package/dist/index6.js +40 -22
  145. package/dist/index60.cjs +1 -1
  146. package/dist/index60.js +112 -10
  147. package/dist/index61.cjs +1 -1
  148. package/dist/index61.js +16 -11
  149. package/dist/index62.cjs +1 -1
  150. package/dist/index62.js +223 -6
  151. package/dist/index63.cjs +1 -1
  152. package/dist/index63.js +12 -13
  153. package/dist/index64.cjs +1 -1
  154. package/dist/index64.js +32 -30
  155. package/dist/index65.cjs +2 -1
  156. package/dist/index65.js +59 -14
  157. package/dist/index66.cjs +1 -1
  158. package/dist/index66.js +19 -62
  159. package/dist/index67.cjs +1 -1
  160. package/dist/index67.js +4 -27
  161. package/dist/index68.cjs +1 -1
  162. package/dist/index68.js +4 -3
  163. package/dist/index69.cjs +1 -1
  164. package/dist/index69.js +18 -5
  165. package/dist/index7.cjs +1 -1
  166. package/dist/index7.js +24 -2
  167. package/dist/index70.cjs +1 -1
  168. package/dist/index70.js +42 -8
  169. package/dist/index71.cjs +1 -1
  170. package/dist/index71.js +8 -3
  171. package/dist/index72.cjs +1 -1
  172. package/dist/index72.js +104 -13
  173. package/dist/index73.cjs +1 -1
  174. package/dist/index73.js +8 -41
  175. package/dist/index74.cjs +1 -1
  176. package/dist/index74.js +9 -102
  177. package/dist/index75.cjs +1 -1
  178. package/dist/index75.js +10 -190
  179. package/dist/index76.cjs +1 -1
  180. package/dist/index76.js +13 -18
  181. package/dist/index77.cjs +1 -1
  182. package/dist/index77.js +6 -11
  183. package/dist/index78.cjs +1 -1
  184. package/dist/index78.js +17 -19
  185. package/dist/index79.cjs +1 -1
  186. package/dist/index79.js +77 -24
  187. package/dist/index8.cjs +1 -1
  188. package/dist/index8.js +2 -100
  189. package/dist/index80.cjs +1 -1
  190. package/dist/index80.js +14 -6
  191. package/dist/index81.cjs +1 -1
  192. package/dist/index81.js +18 -13
  193. package/dist/index82.cjs +1 -1
  194. package/dist/index82.js +190 -14
  195. package/dist/index83.cjs +1 -1
  196. package/dist/index83.js +64 -5
  197. package/dist/index84.cjs +1 -1
  198. package/dist/index84.js +2 -14
  199. package/dist/index85.cjs +1 -1
  200. package/dist/index85.js +6 -10
  201. package/dist/index86.cjs +1 -1
  202. package/dist/index86.js +11 -16
  203. package/dist/index87.cjs +5 -1
  204. package/dist/index87.js +50 -165
  205. package/dist/index88.cjs +2 -1
  206. package/dist/index88.js +34 -8
  207. package/dist/index89.cjs +1 -1
  208. package/dist/index89.js +5 -12
  209. package/dist/index9.cjs +1 -1
  210. package/dist/index9.js +90 -34
  211. package/dist/index90.cjs +1 -1
  212. package/dist/index90.js +3 -104
  213. package/dist/index91.cjs +1 -1
  214. package/dist/index91.js +6 -38
  215. package/dist/index92.cjs +1 -1
  216. package/dist/index92.js +33 -2
  217. package/dist/index93.cjs +1 -1
  218. package/dist/index93.js +28 -5
  219. package/dist/index94.cjs +1 -1
  220. package/dist/index94.js +3 -11
  221. package/dist/index95.cjs +1 -1
  222. package/dist/index95.js +6 -40
  223. package/dist/index96.cjs +1 -1
  224. package/dist/index96.js +64 -17
  225. package/dist/index97.cjs +1 -1
  226. package/dist/index97.js +70 -5
  227. package/dist/index98.cjs +1 -1
  228. package/dist/index98.js +2 -38
  229. package/dist/index99.cjs +1 -1
  230. package/dist/index99.js +34 -127
  231. package/dist/src/index.d.ts +1 -0
  232. package/dist/src/lib/auth/siwe/siwe.d.ts +2 -1
  233. package/dist/src/lib/digestKey/digestKey.d.ts +12 -0
  234. package/package.json +2 -1
package/dist/index116.js CHANGED
@@ -1,234 +1,23 @@
1
- /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
2
- const d = /* @__PURE__ */ BigInt(0), y = /* @__PURE__ */ BigInt(1), I = /* @__PURE__ */ BigInt(2);
3
- function h(t) {
4
- return t instanceof Uint8Array || ArrayBuffer.isView(t) && t.constructor.name === "Uint8Array";
5
- }
6
- function b(t) {
7
- if (!h(t))
8
- throw new Error("Uint8Array expected");
9
- }
10
- function O(t, n) {
11
- if (typeof n != "boolean")
12
- throw new Error(t + " boolean expected, got " + n);
13
- }
14
- const T = /* @__PURE__ */ Array.from({ length: 256 }, (t, n) => n.toString(16).padStart(2, "0"));
15
- function B(t) {
16
- b(t);
17
- let n = "";
18
- for (let r = 0; r < t.length; r++)
19
- n += T[t[r]];
20
- return n;
21
- }
22
- function S(t) {
23
- const n = t.toString(16);
24
- return n.length & 1 ? "0" + n : n;
25
- }
26
- function U(t) {
27
- if (typeof t != "string")
28
- throw new Error("hex string expected, got " + typeof t);
29
- return t === "" ? d : BigInt("0x" + t);
30
- }
31
- const s = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };
32
- function E(t) {
33
- if (t >= s._0 && t <= s._9)
34
- return t - s._0;
35
- if (t >= s.A && t <= s.F)
36
- return t - (s.A - 10);
37
- if (t >= s.a && t <= s.f)
38
- return t - (s.a - 10);
39
- }
40
- function m(t) {
41
- if (typeof t != "string")
42
- throw new Error("hex string expected, got " + typeof t);
43
- const n = t.length, r = n / 2;
44
- if (n % 2)
45
- throw new Error("hex string expected, got unpadded hex of length " + n);
46
- const e = new Uint8Array(r);
47
- for (let o = 0, i = 0; o < r; o++, i += 2) {
48
- const a = E(t.charCodeAt(i)), f = E(t.charCodeAt(i + 1));
49
- if (a === void 0 || f === void 0) {
50
- const c = t[i] + t[i + 1];
51
- throw new Error('hex string expected, got non-hex character "' + c + '" at index ' + i);
52
- }
53
- e[o] = a * 16 + f;
1
+ import { BaseError as o } from "./index65.js";
2
+ class i extends o {
3
+ constructor({ offset: e }) {
4
+ super(`Offset \`${e}\` cannot be negative.`, {
5
+ name: "NegativeOffsetError"
6
+ });
54
7
  }
55
- return e;
56
- }
57
- function V(t) {
58
- return U(B(t));
59
- }
60
- function H(t) {
61
- return b(t), U(B(Uint8Array.from(t).reverse()));
62
- }
63
- function v(t, n) {
64
- return m(t.toString(16).padStart(n * 2, "0"));
65
- }
66
- function C(t, n) {
67
- return v(t, n).reverse();
68
- }
69
- function M(t) {
70
- return m(S(t));
71
- }
72
- function R(t, n, r) {
73
- let e;
74
- if (typeof n == "string")
75
- try {
76
- e = m(n);
77
- } catch (i) {
78
- throw new Error(t + " must be hex string or Uint8Array, cause: " + i);
79
- }
80
- else if (h(n))
81
- e = Uint8Array.from(n);
82
- else
83
- throw new Error(t + " must be hex string or Uint8Array");
84
- const o = e.length;
85
- if (typeof r == "number" && o !== r)
86
- throw new Error(t + " of length " + r + " expected, got " + o);
87
- return e;
88
8
  }
89
- function _(...t) {
90
- let n = 0;
91
- for (let e = 0; e < t.length; e++) {
92
- const o = t[e];
93
- b(o), n += o.length;
9
+ class n extends o {
10
+ constructor({ length: e, position: r }) {
11
+ super(`Position \`${r}\` is out of bounds (\`0 < position < ${e}\`).`, { name: "PositionOutOfBoundsError" });
94
12
  }
95
- const r = new Uint8Array(n);
96
- for (let e = 0, o = 0; e < t.length; e++) {
97
- const i = t[e];
98
- r.set(i, o), o += i.length;
99
- }
100
- return r;
101
- }
102
- function j(t, n) {
103
- if (t.length !== n.length)
104
- return !1;
105
- let r = 0;
106
- for (let e = 0; e < t.length; e++)
107
- r |= t[e] ^ n[e];
108
- return r === 0;
109
- }
110
- function z(t) {
111
- if (typeof t != "string")
112
- throw new Error("string expected");
113
- return new Uint8Array(new TextEncoder().encode(t));
114
- }
115
- const w = (t) => typeof t == "bigint" && d <= t;
116
- function N(t, n, r) {
117
- return w(t) && w(n) && w(r) && n <= t && t < r;
118
- }
119
- function D(t, n, r, e) {
120
- if (!N(n, r, e))
121
- throw new Error("expected valid " + t + ": " + r + " <= n < " + e + ", got " + n);
122
- }
123
- function G(t) {
124
- let n;
125
- for (n = 0; t > d; t >>= y, n += 1)
126
- ;
127
- return n;
128
- }
129
- function P(t, n) {
130
- return t >> BigInt(n) & y;
131
13
  }
132
- function W(t, n, r) {
133
- return t | (r ? y : d) << BigInt(n);
134
- }
135
- const q = (t) => (I << BigInt(t - 1)) - y, p = (t) => new Uint8Array(t), A = (t) => Uint8Array.from(t);
136
- function J(t, n, r) {
137
- if (typeof t != "number" || t < 2)
138
- throw new Error("hashLen must be a number");
139
- if (typeof n != "number" || n < 2)
140
- throw new Error("qByteLen must be a number");
141
- if (typeof r != "function")
142
- throw new Error("hmacFn must be a function");
143
- let e = p(t), o = p(t), i = 0;
144
- const a = () => {
145
- e.fill(1), o.fill(0), i = 0;
146
- }, f = (...u) => r(o, e, ...u), c = (u = p()) => {
147
- o = f(A([0]), u), e = f(), u.length !== 0 && (o = f(A([1]), u), e = f());
148
- }, x = () => {
149
- if (i++ >= 1e3)
150
- throw new Error("drbg: tried 1000 values");
151
- let u = 0;
152
- const l = [];
153
- for (; u < n; ) {
154
- e = f();
155
- const g = e.slice();
156
- l.push(g), u += e.length;
157
- }
158
- return _(...l);
159
- };
160
- return (u, l) => {
161
- a(), c(u);
162
- let g;
163
- for (; !(g = l(x())); )
164
- c();
165
- return a(), g;
166
- };
167
- }
168
- const k = {
169
- bigint: (t) => typeof t == "bigint",
170
- function: (t) => typeof t == "function",
171
- boolean: (t) => typeof t == "boolean",
172
- string: (t) => typeof t == "string",
173
- stringOrUint8Array: (t) => typeof t == "string" || h(t),
174
- isSafeInteger: (t) => Number.isSafeInteger(t),
175
- array: (t) => Array.isArray(t),
176
- field: (t, n) => n.Fp.isValid(t),
177
- hash: (t) => typeof t == "function" && Number.isSafeInteger(t.outputLen)
178
- };
179
- function K(t, n, r = {}) {
180
- const e = (o, i, a) => {
181
- const f = k[i];
182
- if (typeof f != "function")
183
- throw new Error("invalid validator function");
184
- const c = t[o];
185
- if (!(a && c === void 0) && !f(c, t))
186
- throw new Error("param " + String(o) + " is invalid. Expected " + i + ", got " + c);
187
- };
188
- for (const [o, i] of Object.entries(n))
189
- e(o, i, !1);
190
- for (const [o, i] of Object.entries(r))
191
- e(o, i, !0);
192
- return t;
193
- }
194
- const Q = () => {
195
- throw new Error("not implemented");
196
- };
197
- function X(t) {
198
- const n = /* @__PURE__ */ new WeakMap();
199
- return (r, ...e) => {
200
- const o = n.get(r);
201
- if (o !== void 0)
202
- return o;
203
- const i = t(r, ...e);
204
- return n.set(r, i), i;
205
- };
14
+ class c extends o {
15
+ constructor({ count: e, limit: r }) {
16
+ super(`Recursive read limit of \`${r}\` exceeded (recursive read count: \`${e}\`).`, { name: "RecursiveReadLimitExceededError" });
17
+ }
206
18
  }
207
19
  export {
208
- D as aInRange,
209
- O as abool,
210
- b as abytes,
211
- P as bitGet,
212
- G as bitLen,
213
- q as bitMask,
214
- W as bitSet,
215
- B as bytesToHex,
216
- V as bytesToNumberBE,
217
- H as bytesToNumberLE,
218
- _ as concatBytes,
219
- J as createHmacDrbg,
220
- R as ensureBytes,
221
- j as equalBytes,
222
- m as hexToBytes,
223
- U as hexToNumber,
224
- N as inRange,
225
- h as isBytes,
226
- X as memoized,
227
- Q as notImplemented,
228
- v as numberToBytesBE,
229
- C as numberToBytesLE,
230
- S as numberToHexUnpadded,
231
- M as numberToVarBytesBE,
232
- z as utf8ToBytes,
233
- K as validateObject
20
+ i as NegativeOffsetError,
21
+ n as PositionOutOfBoundsError,
22
+ c as RecursiveReadLimitExceededError
234
23
  };
package/dist/index117.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const A=require("./index108.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;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index60.cjs"),s=require("./index68.cjs"),r=require("./index36.cjs");function o(t,i){return e.sha256(s.isHex(t,{strict:!1})?r.toBytes(t):t)}exports.sha256=o;
package/dist/index117.js CHANGED
@@ -1,175 +1,9 @@
1
- import { validateField as z, nLength as F } from "./index108.js";
2
- import { validateObject as x, bitLen as O } from "./index116.js";
3
- /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
4
- const I = BigInt(0), p = BigInt(1);
5
- function m(e, r) {
6
- const t = r.negate();
7
- return e ? t : r;
8
- }
9
- function A(e, r) {
10
- if (!Number.isSafeInteger(e) || e <= 0 || e > r)
11
- throw new Error("invalid window size, expected [1.." + r + "], got W=" + e);
12
- }
13
- function b(e, r) {
14
- A(e, r);
15
- const t = Math.ceil(r / e) + 1, n = 2 ** (e - 1);
16
- return { windows: t, windowSize: n };
17
- }
18
- function L(e, r) {
19
- if (!Array.isArray(e))
20
- throw new Error("array expected");
21
- e.forEach((t, n) => {
22
- if (!(t instanceof r))
23
- throw new Error("invalid point at index " + n);
24
- });
25
- }
26
- function k(e, r) {
27
- if (!Array.isArray(e))
28
- throw new Error("array of scalars expected");
29
- e.forEach((t, n) => {
30
- if (!r.isValid(t))
31
- throw new Error("invalid scalar at index " + n);
32
- });
33
- }
34
- const B = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap();
35
- function S(e) {
36
- return E.get(e) || 1;
37
- }
38
- function v(e, r) {
39
- return {
40
- constTimeNegate: m,
41
- hasPrecomputes(t) {
42
- return S(t) !== 1;
43
- },
44
- // non-const time multiplication ladder
45
- unsafeLadder(t, n, i = e.ZERO) {
46
- let o = t;
47
- for (; n > I; )
48
- n & p && (i = i.add(o)), o = o.double(), n >>= p;
49
- return i;
50
- },
51
- /**
52
- * Creates a wNAF precomputation window. Used for caching.
53
- * Default window size is set by `utils.precompute()` and is equal to 8.
54
- * Number of precomputed points depends on the curve size:
55
- * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:
56
- * - 𝑊 is the window size
57
- * - 𝑛 is the bitlength of the curve order.
58
- * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.
59
- * @param elm Point instance
60
- * @param W window size
61
- * @returns precomputed point tables flattened to a single array
62
- */
63
- precomputeWindow(t, n) {
64
- const { windows: i, windowSize: o } = b(n, r), a = [];
65
- let c = t, d = c;
66
- for (let h = 0; h < i; h++) {
67
- d = c, a.push(d);
68
- for (let w = 1; w < o; w++)
69
- d = d.add(c), a.push(d);
70
- c = d.double();
71
- }
72
- return a;
73
- },
74
- /**
75
- * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.
76
- * @param W window size
77
- * @param precomputes precomputed tables
78
- * @param n scalar (we don't check here, but should be less than curve order)
79
- * @returns real and fake (for const-time) points
80
- */
81
- wNAF(t, n, i) {
82
- const { windows: o, windowSize: a } = b(t, r);
83
- let c = e.ZERO, d = e.BASE;
84
- const h = BigInt(2 ** t - 1), w = 2 ** t, l = BigInt(t);
85
- for (let u = 0; u < o; u++) {
86
- const s = u * a;
87
- let f = Number(i & h);
88
- i >>= l, f > a && (f -= w, i += p);
89
- const g = s, N = s + Math.abs(f) - 1, y = u % 2 !== 0, M = f < 0;
90
- f === 0 ? d = d.add(m(y, n[g])) : c = c.add(m(M, n[N]));
91
- }
92
- return { p: c, f: d };
93
- },
94
- /**
95
- * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.
96
- * @param W window size
97
- * @param precomputes precomputed tables
98
- * @param n scalar (we don't check here, but should be less than curve order)
99
- * @param acc accumulator point to add result of multiplication
100
- * @returns point
101
- */
102
- wNAFUnsafe(t, n, i, o = e.ZERO) {
103
- const { windows: a, windowSize: c } = b(t, r), d = BigInt(2 ** t - 1), h = 2 ** t, w = BigInt(t);
104
- for (let l = 0; l < a; l++) {
105
- const u = l * c;
106
- if (i === I)
107
- break;
108
- let s = Number(i & d);
109
- if (i >>= w, s > c && (s -= h, i += p), s === 0)
110
- continue;
111
- let f = n[u + Math.abs(s) - 1];
112
- s < 0 && (f = f.negate()), o = o.add(f);
113
- }
114
- return o;
115
- },
116
- getPrecomputes(t, n, i) {
117
- let o = B.get(n);
118
- return o || (o = this.precomputeWindow(n, t), t !== 1 && B.set(n, i(o))), o;
119
- },
120
- wNAFCached(t, n, i) {
121
- const o = S(t);
122
- return this.wNAF(o, this.getPrecomputes(o, t, i), n);
123
- },
124
- wNAFCachedUnsafe(t, n, i, o) {
125
- const a = S(t);
126
- return a === 1 ? this.unsafeLadder(t, n, o) : this.wNAFUnsafe(a, this.getPrecomputes(a, t, i), n, o);
127
- },
128
- // We calculate precomputes for elliptic curve point multiplication
129
- // using windowed method. This specifies window size and
130
- // stores precomputed values. Usually only base point would be precomputed.
131
- setWindowSize(t, n) {
132
- A(n, r), E.set(t, n), B.delete(t);
133
- }
134
- };
135
- }
136
- function Z(e, r, t, n) {
137
- if (L(t, e), k(n, r), t.length !== n.length)
138
- throw new Error("arrays of points and scalars must have equal length");
139
- const i = e.ZERO, o = O(BigInt(t.length)), a = o > 12 ? o - 3 : o > 4 ? o - 2 : o ? 2 : 1, c = (1 << a) - 1, d = new Array(c + 1).fill(i), h = Math.floor((r.BITS - 1) / a) * a;
140
- let w = i;
141
- for (let l = h; l >= 0; l -= a) {
142
- d.fill(i);
143
- for (let s = 0; s < n.length; s++) {
144
- const f = n[s], g = Number(f >> BigInt(l) & BigInt(c));
145
- d[g] = d[g].add(t[s]);
146
- }
147
- let u = i;
148
- for (let s = d.length - 1, f = i; s > 0; s--)
149
- f = f.add(d[s]), u = u.add(f);
150
- if (w = w.add(u), l !== 0)
151
- for (let s = 0; s < a; s++)
152
- w = w.double();
153
- }
154
- return w;
155
- }
156
- function U(e) {
157
- return z(e.Fp), x(e, {
158
- n: "bigint",
159
- h: "bigint",
160
- Gx: "field",
161
- Gy: "field"
162
- }, {
163
- nBitLength: "isSafeInteger",
164
- nByteLength: "isSafeInteger"
165
- }), Object.freeze({
166
- ...F(e.n, e.nBitLength),
167
- ...e,
168
- p: e.Fp.ORDER
169
- });
1
+ import { sha256 as o } from "./index60.js";
2
+ import { isHex as s } from "./index68.js";
3
+ import { toBytes as r } from "./index36.js";
4
+ function p(t, i) {
5
+ return o(s(t, { strict: !1 }) ? r(t) : t);
170
6
  }
171
7
  export {
172
- Z as pippenger,
173
- U as validateBasic,
174
- v as wNAF
8
+ p as sha256
175
9
  };
@@ -0,0 +1 @@
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=6,s=32,e=4096,n=s*e,o=n*t-1-1*e*t;exports.bytesPerBlob=n;exports.bytesPerFieldElement=s;exports.fieldElementsPerBlob=e;exports.maxBytesPerTransaction=o;
@@ -0,0 +1,7 @@
1
+ const e = 32, s = 4096, t = 131072, l = 761855;
2
+ export {
3
+ t as bytesPerBlob,
4
+ e as bytesPerFieldElement,
5
+ s as fieldElementsPerBlob,
6
+ l as maxBytesPerTransaction
7
+ };
package/dist/index12.cjs CHANGED
@@ -1 +1 @@
1
- "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;
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;
package/dist/index12.js CHANGED
@@ -1,17 +1,143 @@
1
- class m {
2
- constructor() {
3
- this.memory = /* @__PURE__ */ new Map();
1
+ import { Ok as l, Err as e, Fetcher as c } from "./index17.js";
2
+ import { startRegistration as d, startAuthentication as u } from "@simplewebauthn/browser";
3
+ class f {
4
+ constructor(t, r) {
5
+ if (this.storeKey = "passkey-auth", !window)
6
+ throw new Error("Passkey is only supported in the browser environment.");
7
+ this.url = t.endpoint("passkey"), this.store = r;
4
8
  }
5
- getItem(e) {
6
- return this.memory.has(e) ? this.memory.get(e) : null;
9
+ getPasskeyFromStore() {
10
+ if (this.token && this.userName)
11
+ return l({ token: this.token, gardenUserName: this.userName });
12
+ const t = this.store.getItem(this.storeKey);
13
+ if (t) {
14
+ const r = JSON.parse(t);
15
+ return l(r);
16
+ }
17
+ return e("Passkey is not set");
7
18
  }
8
- setItem(e, t) {
9
- this.memory.set(e, t);
19
+ /**
20
+ * Validates the username according to predefined rules.
21
+ * @param username The username to validate.
22
+ * @returns Result<string, string> - Ok if valid, Err with message if invalid.
23
+ */
24
+ validateUsername(t) {
25
+ 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());
10
26
  }
11
- removeItem(e) {
12
- this.memory.has(e) && this.memory.delete(e);
27
+ /**
28
+ * Handles user registration using WebAuthn passkeys.
29
+ * @param username The username to register.
30
+ * @returns AsyncResult<PasskeyToken, string> - Ok if successful, Err if failed.
31
+ */
32
+ async register(t) {
33
+ var i;
34
+ const r = this.validateUsername(t);
35
+ if (r.error) return e(r.error);
36
+ try {
37
+ const n = await c.post(this.url.endpoint("register/begin"), {
38
+ body: JSON.stringify({ username: r }),
39
+ headers: { credentials: "include", "Content-Type": "application/json" }
40
+ });
41
+ if (n.error)
42
+ return e("Failed to start registration", n.error);
43
+ const s = (i = n.result) == null ? void 0 : i.challenge;
44
+ if (!s) return e("No challenge found");
45
+ if (!s.publicKey.authenticatorSelection)
46
+ return e("No authenticator selection found");
47
+ s.publicKey.authenticatorSelection.requireResidentKey = !0, s.publicKey.authenticatorSelection.residentKey = "required";
48
+ const a = await d({
49
+ optionsJSON: s.publicKey
50
+ }), o = await c.post(
51
+ this.url.endpoint("register/finish"),
52
+ {
53
+ body: JSON.stringify({
54
+ username: r,
55
+ credential: a
56
+ }),
57
+ headers: {
58
+ credentials: "include",
59
+ "Content-Type": "application/json"
60
+ }
61
+ }
62
+ );
63
+ 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");
64
+ } catch (n) {
65
+ return e("Registration error", n);
66
+ }
67
+ }
68
+ /**
69
+ * Handles user login using WebAuthn passkeys.
70
+ * @param username The username to log in.
71
+ * @returns AsyncResult<PasskeyToken, string> - Ok if successful, Err if failed.
72
+ */
73
+ async login(t) {
74
+ var i;
75
+ const r = this.validateUsername(t);
76
+ if (r.error) return e(r.error);
77
+ try {
78
+ const n = await c.post(this.url.endpoint("login/begin"), {
79
+ body: JSON.stringify({ username: r }),
80
+ headers: { credentials: "include", "Content-Type": "application/json" }
81
+ });
82
+ if (n.error)
83
+ return e("Failed to start login", n.error);
84
+ const s = (i = n.result) == null ? void 0 : i.challenge;
85
+ if (!s) return e("No challenge found");
86
+ const a = await u({
87
+ optionsJSON: s.publicKey
88
+ }), o = await c.post(
89
+ this.url.endpoint("login/finish"),
90
+ {
91
+ body: JSON.stringify({
92
+ username: r,
93
+ credential: a
94
+ }),
95
+ headers: {
96
+ credentials: "include",
97
+ "Content-Type": "application/json"
98
+ }
99
+ }
100
+ );
101
+ 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");
102
+ } catch (n) {
103
+ return e("Login error", n);
104
+ }
105
+ }
106
+ /**
107
+ * Handles conditional login (without username) for existing users.
108
+ * @returns AsyncResult<PasskeyToken, string> - Ok if successful, Err if failed.
109
+ */
110
+ async conditionalLogin() {
111
+ var t, r;
112
+ try {
113
+ const i = await c.get(this.url.endpoint("conditional-login/begin"), {
114
+ headers: { credentials: "include" }
115
+ });
116
+ if (i.error)
117
+ return e("Failed to start login", i.error);
118
+ const n = (t = i.result) == null ? void 0 : t.challenge;
119
+ if (!n) return e("No challenge found");
120
+ const s = await u({
121
+ optionsJSON: n.publicKey
122
+ }), a = await c.post(
123
+ this.url.endpoint("conditional-login/finish"),
124
+ {
125
+ body: JSON.stringify({
126
+ login_id: (r = i.result) == null ? void 0 : r.login_id,
127
+ credential: s
128
+ }),
129
+ headers: {
130
+ credentials: "include",
131
+ "Content-Type": "application/json"
132
+ }
133
+ }
134
+ );
135
+ 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");
136
+ } catch (i) {
137
+ return e("Conditional login error", i);
138
+ }
13
139
  }
14
140
  }
15
141
  export {
16
- m as MemoryStorage
142
+ f as PasskeyLogin
17
143
  };
package/dist/index13.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t=(e=>(e.AUTH_TOKEN="auth_token",e))(t||{});exports.StoreKeys=t;
1
+ "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;
package/dist/index13.js CHANGED
@@ -1,4 +1,17 @@
1
- var t = /* @__PURE__ */ ((r) => (r.AUTH_TOKEN = "auth_token", r))(t || {});
1
+ class m {
2
+ constructor() {
3
+ this.memory = /* @__PURE__ */ new Map();
4
+ }
5
+ getItem(e) {
6
+ return this.memory.has(e) ? this.memory.get(e) : null;
7
+ }
8
+ setItem(e, t) {
9
+ this.memory.set(e, t);
10
+ }
11
+ removeItem(e) {
12
+ this.memory.has(e) && this.memory.delete(e);
13
+ }
14
+ }
2
15
  export {
3
- t as StoreKeys
16
+ m as MemoryStorage
4
17
  };
package/dist/index14.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index16.cjs"),n=require("viem"),s=require("./index19.cjs"),l=require("./index21.cjs"),o={42161:s.mainnet,421614:l.sepolia},b=async e=>{const{chain:t}=e;if(!t)return r.Err("No chain found");const a=(u=>u in o)(t.id)?o[t.id]:t;return await i(a)},i=async e=>{const t=n.createPublicClient({chain:e,transport:n.http()});try{const c=await t.getBlockNumber();return r.Ok(Number(c))}catch(c){return r.Err("Failed to fetch evm block number",c)}},m=async e=>{try{const t=await e.getLatestTip();return r.Ok(t)}catch(t){return r.Err("Failed to fetch bitcoin block number",t)}};exports._fetchEVMBlockNumber=i;exports.fetchBitcoinBlockNumber=m;exports.fetchEVMBlockNumber=b;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t=(e=>(e.AUTH_TOKEN="auth_token",e))(t||{});exports.StoreKeys=t;