@prosopo/account 1.0.1 → 1.0.2

package/dist/cjs/util/dist/at.cjs

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function at(items, index, options) {
+  if (items.length === 0) {
+    throw new Error("Array is empty");
+  }
+  if (!options?.noWrap) {
+    if (index > 0) {
+      index = index % items.length;
+    } else {
+      index = Math.ceil(Math.abs(index) / items.length) * items.length + index;
+    }
+  }
+  if (index >= items.length) {
+    throw new Error(`Index ${index} larger than array length ${items.length}`);
+  }
+  if (index < 0) {
+    throw new Error(`Index ${index} smaller than 0`);
+  }
+  return items[index];
+}
+exports.at = at;

package/dist/cjs/util/dist/canvas.cjs

@@ -1,59 +1,59 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 require("./index.cjs");
-const util = require("./util.cjs");
+const at = require("./at.cjs");
 function x64Add(m, n) {
-  m = [util.at(m, 0) >>> 16, util.at(m, 0) & 65535, util.at(m, 1) >>> 16, util.at(m, 1) & 65535];
-  n = [util.at(n, 0) >>> 16, util.at(n, 0) & 65535, util.at(n, 1) >>> 16, util.at(n, 1) & 65535];
+  m = [at.at(m, 0) >>> 16, at.at(m, 0) & 65535, at.at(m, 1) >>> 16, at.at(m, 1) & 65535];
+  n = [at.at(n, 0) >>> 16, at.at(n, 0) & 65535, at.at(n, 1) >>> 16, at.at(n, 1) & 65535];
   const o = [0, 0, 0, 0];
-  o[3] += util.at(m, 3) + util.at(n, 3);
-  o[2] += util.at(o, 3) >>> 16;
+  o[3] += at.at(m, 3) + at.at(n, 3);
+  o[2] += at.at(o, 3) >>> 16;
   o[3] &= 65535;
-  o[2] += util.at(m, 2) + util.at(n, 2);
-  o[1] += util.at(o, 2) >>> 16;
+  o[2] += at.at(m, 2) + at.at(n, 2);
+  o[1] += at.at(o, 2) >>> 16;
   o[2] &= 65535;
-  o[1] += util.at(m, 1) + util.at(n, 1);
-  o[0] += util.at(o, 1) >>> 16;
+  o[1] += at.at(m, 1) + at.at(n, 1);
+  o[0] += at.at(o, 1) >>> 16;
   o[1] &= 65535;
-  o[0] += util.at(m, 0) + util.at(n, 0);
+  o[0] += at.at(m, 0) + at.at(n, 0);
   o[0] &= 65535;
-  return [util.at(o, 0) << 16 | util.at(o, 1), util.at(o, 2) << 16 | util.at(o, 3)];
+  return [at.at(o, 0) << 16 | at.at(o, 1), at.at(o, 2) << 16 | at.at(o, 3)];
 }
 function x64Multiply(m, n) {
-  m = [util.at(m, 0) >>> 16, util.at(m, 0) & 65535, util.at(m, 1) >>> 16, util.at(m, 1) & 65535];
-  n = [util.at(n, 0) >>> 16, util.at(n, 0) & 65535, util.at(n, 1) >>> 16, util.at(n, 1) & 65535];
+  m = [at.at(m, 0) >>> 16, at.at(m, 0) & 65535, at.at(m, 1) >>> 16, at.at(m, 1) & 65535];
+  n = [at.at(n, 0) >>> 16, at.at(n, 0) & 65535, at.at(n, 1) >>> 16, at.at(n, 1) & 65535];
   const o = [0, 0, 0, 0];
-  o[3] += util.at(m, 3) * util.at(n, 3);
-  o[2] += util.at(o, 3) >>> 16;
+  o[3] += at.at(m, 3) * at.at(n, 3);
+  o[2] += at.at(o, 3) >>> 16;
   o[3] &= 65535;
-  o[2] += util.at(m, 2) * util.at(n, 3);
-  o[1] += util.at(o, 2) >>> 16;
+  o[2] += at.at(m, 2) * at.at(n, 3);
+  o[1] += at.at(o, 2) >>> 16;
   o[2] &= 65535;
-  o[2] += util.at(m, 3) * util.at(n, 2);
-  o[1] += util.at(o, 2) >>> 16;
+  o[2] += at.at(m, 3) * at.at(n, 2);
+  o[1] += at.at(o, 2) >>> 16;
   o[2] &= 65535;
-  o[1] += util.at(m, 1) * util.at(n, 3);
-  o[0] += util.at(o, 1) >>> 16;
+  o[1] += at.at(m, 1) * at.at(n, 3);
+  o[0] += at.at(o, 1) >>> 16;
   o[1] &= 65535;
-  o[1] += util.at(m, 2) * util.at(n, 2);
-  o[0] += util.at(o, 1) >>> 16;
+  o[1] += at.at(m, 2) * at.at(n, 2);
+  o[0] += at.at(o, 1) >>> 16;
   o[1] &= 65535;
-  o[1] += util.at(m, 3) * util.at(n, 1);
-  o[0] += util.at(o, 1) >>> 16;
+  o[1] += at.at(m, 3) * at.at(n, 1);
+  o[0] += at.at(o, 1) >>> 16;
   o[1] &= 65535;
-  o[0] += util.at(m, 0) * util.at(n, 3) + util.at(m, 1) * util.at(n, 2) + util.at(m, 2) * util.at(n, 1) + util.at(m, 3) * util.at(n, 0);
+  o[0] += at.at(m, 0) * at.at(n, 3) + at.at(m, 1) * at.at(n, 2) + at.at(m, 2) * at.at(n, 1) + at.at(m, 3) * at.at(n, 0);
   o[0] &= 65535;
-  return [util.at(o, 0) << 16 | util.at(o, 1), util.at(o, 2) << 16 | util.at(o, 3)];
+  return [at.at(o, 0) << 16 | at.at(o, 1), at.at(o, 2) << 16 | at.at(o, 3)];
 }
 function x64Rotl(m, n) {
   n %= 64;
   if (n === 32) {
-    return [util.at(m, 1), util.at(m, 0)];
+    return [at.at(m, 1), at.at(m, 0)];
   } else if (n < 32) {
-    return [util.at(m, 0) << n | util.at(m, 1) >>> 32 - n, util.at(m, 1) << n | util.at(m, 0) >>> 32 - n];
+    return [at.at(m, 0) << n | at.at(m, 1) >>> 32 - n, at.at(m, 1) << n | at.at(m, 0) >>> 32 - n];
   } else {
     n -= 32;
-    return [util.at(m, 1) << n | util.at(m, 0) >>> 32 - n, util.at(m, 0) << n | util.at(m, 1) >>> 32 - n];
+    return [at.at(m, 1) << n | at.at(m, 0) >>> 32 - n, at.at(m, 0) << n | at.at(m, 1) >>> 32 - n];
   }
 }
 function x64LeftShift(m, n) {
@@ -61,20 +61,20 @@ function x64LeftShift(m, n) {
   if (n === 0) {
     return m;
   } else if (n < 32) {
-    return [util.at(m, 0) << n | util.at(m, 1) >>> 32 - n, util.at(m, 1) << n];
+    return [at.at(m, 0) << n | at.at(m, 1) >>> 32 - n, at.at(m, 1) << n];
   } else {
-    return [util.at(m, 1) << n - 32, 0];
+    return [at.at(m, 1) << n - 32, 0];
   }
 }
 function x64Xor(m, n) {
-  return [util.at(m, 0) ^ util.at(n, 0), util.at(m, 1) ^ util.at(n, 1)];
+  return [at.at(m, 0) ^ at.at(n, 0), at.at(m, 1) ^ at.at(n, 1)];
 }
 function x64Fmix(h) {
-  h = x64Xor(h, [0, util.at(h, 0) >>> 1]);
+  h = x64Xor(h, [0, at.at(h, 0) >>> 1]);
   h = x64Multiply(h, [4283543511, 3981806797]);
-  h = x64Xor(h, [0, util.at(h, 0) >>> 1]);
+  h = x64Xor(h, [0, at.at(h, 0) >>> 1]);
   h = x64Multiply(h, [3301882366, 444984403]);
-  h = x64Xor(h, [0, util.at(h, 0) >>> 1]);
+  h = x64Xor(h, [0, at.at(h, 0) >>> 1]);
   return h;
 }
 function x64hash128(key, seed) {
@@ -177,7 +177,7 @@ function x64hash128(key, seed) {
   h2 = x64Fmix(h2);
   h1 = x64Add(h1, h2);
   h2 = x64Add(h2, h1);
-  return ("00000000" + (util.at(h1, 0) >>> 0).toString(16)).slice(-8) + ("00000000" + (util.at(h1, 1) >>> 0).toString(16)).slice(-8) + ("00000000" + (util.at(h2, 0) >>> 0).toString(16)).slice(-8) + ("00000000" + (util.at(h2, 1) >>> 0).toString(16)).slice(-8);
+  return ("00000000" + (at.at(h1, 0) >>> 0).toString(16)).slice(-8) + ("00000000" + (at.at(h1, 1) >>> 0).toString(16)).slice(-8) + ("00000000" + (at.at(h2, 0) >>> 0).toString(16)).slice(-8) + ("00000000" + (at.at(h2, 1) >>> 0).toString(16)).slice(-8);
 }
 function picassoCanvas(roundNumber, seed, params) {
   const { area, offsetParameter, multiplier, fontSizeFactor, maxShadowBlur } = params;
@@ -202,8 +202,8 @@ function picassoCanvas(roundNumber, seed, params) {
   }
   function addRandomCanvasGradient(prng, context, area2) {
     const canvasGradient = context.createRadialGradient(adaptRandomNumberToContext(prng.getNext(), area2.width, void 0), adaptRandomNumberToContext(prng.getNext(), area2.height, void 0), adaptRandomNumberToContext(prng.getNext(), area2.width, void 0), adaptRandomNumberToContext(prng.getNext(), area2.width, void 0), adaptRandomNumberToContext(prng.getNext(), area2.height, void 0), adaptRandomNumberToContext(prng.getNext(), area2.width, void 0));
-    canvasGradient.addColorStop(0, util.at(colors, adaptRandomNumberToContext(prng.getNext(), colors.length, void 0)));
-    canvasGradient.addColorStop(1, util.at(colors, adaptRandomNumberToContext(prng.getNext(), colors.length, void 0)));
+    canvasGradient.addColorStop(0, at.at(colors, adaptRandomNumberToContext(prng.getNext(), colors.length, void 0)));
+    canvasGradient.addColorStop(1, at.at(colors, adaptRandomNumberToContext(prng.getNext(), colors.length, void 0)));
     context.fillStyle = canvasGradient;
   }
   function generateRandomWord(prng, wordLength) {
@@ -312,8 +312,8 @@ function picassoCanvas(roundNumber, seed, params) {
       for (let i = 0; i < roundNumber; i++) {
         addRandomCanvasGradient(prng, context, area);
         context.shadowBlur = adaptRandomNumberToContext(prng.getNext(), maxShadowBlur, void 0);
-        context.shadowColor = util.at(colors, adaptRandomNumberToContext(prng.getNext(), colors.length, void 0));
-        const randomPrimitive = util.at(primitives, adaptRandomNumberToContext(prng.getNext(), primitives.length, void 0));
+        context.shadowColor = at.at(colors, adaptRandomNumberToContext(prng.getNext(), colors.length, void 0));
+        const randomPrimitive = at.at(primitives, adaptRandomNumberToContext(prng.getNext(), primitives.length, void 0));
         randomPrimitive(prng, context, area);
         context.fill();
       }

package/dist/cjs/util/dist/checks.cjs

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const isArray = (value) => {
+  return Array.isArray(value) && value !== null;
+};
+const isObject = (value) => {
+  return value instanceof Object && !isArray(value);
+};
+exports.isArray = isArray;
+exports.isObject = isObject;

package/dist/cjs/util/dist/choice.cjs

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function choice(items, n, random, options) {
+  if (n > items.length) {
+    throw new Error(`Cannot choose ${n} items from array of length ${items.length}`);
+  }
+  const result = [];
+  const indices = [];
+  for (let i = 0; i < n; i++) {
+    let index;
+    do {
+      index = Math.floor(Math.abs(random()) * items.length) % items.length;
+    } while (options?.withReplacement === false && indices.includes(index));
+    indices.push(index);
+    result.push(items[index]);
+  }
+  return result;
+}
+exports.choice = choice;

package/dist/cjs/util/dist/get.cjs

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function get(obj, key, required = true) {
+  const value = obj[key];
+  if (required && value === void 0) {
+    throw new Error(`Object has no property '${String(key)}': ${JSON.stringify(obj, null, 2)}`);
+  }
+  return value;
+}
+exports.get = get;

package/dist/cjs/util/dist/hex.cjs

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const checks = require("./checks.cjs");
+const util = require("@polkadot/util");
+const hashToHex = (hash) => {
+  if (checks.isArray(hash)) {
+    return util.u8aToHex(new Uint8Array(hash));
+  }
+  return hash.toString();
+};
+exports.hashToHex = hashToHex;

package/dist/cjs/util/dist/index.cjs

@@ -8,17 +8,17 @@ const canvas = require("./canvas.cjs");
 const solverService = require("./solverService.cjs");
 const table = require("./table.cjs");
 const url = require("./url.cjs");
+const at = require("./at.cjs");
+const get = require("./get.cjs");
+const merge = require("./merge.cjs");
+const choice = require("./choice.cjs");
+const permutations = require("./permutations.cjs");
 const version = require("./version.cjs");
-exports.at = util.at;
-exports.flattenObj = util.flattenObj;
-exports.get = util.get;
+const hex = require("./hex.cjs");
+const checks = require("./checks.cjs");
+exports.flatten = util.flatten;
 exports.getCurrentFileDirectory = util.getCurrentFileDirectory;
-exports.hashToHex = util.hashToHex;
-exports.isArray = util.isArray;
-exports.isObject = util.isObject;
 exports.kebabCase = util.kebabCase;
-exports.merge = util.merge;
-exports.permutations = util.permutations;
 exports.sleep = util.sleep;
 exports.ofLen = ofLen.ofLen;
 exports.lodash = lodash.lodash;
@@ -30,4 +30,12 @@ exports.picassoCanvas = canvas.picassoCanvas;
 exports.solvePoW = solverService.solvePoW;
 exports.consoleTableWithWrapping = table.consoleTableWithWrapping;
 exports.getURLProtocol = url.getURLProtocol;
+exports.at = at.at;
+exports.get = get.get;
+exports.merge = merge.merge;
+exports.choice = choice.choice;
+exports.permutations = permutations.permutations;
 exports.version = version.version;
+exports.hashToHex = hex.hashToHex;
+exports.isArray = checks.isArray;
+exports.isObject = checks.isObject;

package/dist/cjs/util/dist/merge.cjs

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const checks = require("./checks.cjs");
+function merge(dest, src, options) {
+  const atomicArrays = options?.atomicArrays;
+  const queue = [
+    {
+      src,
+      dest
+    }
+  ];
+  while (queue.length > 0) {
+    const task = queue.pop();
+    if (task === void 0) {
+      throw new Error("queue is empty");
+    }
+    if (checks.isArray(task.dest)) {
+      const src2 = task.src;
+      const dest2 = task.dest;
+      if (atomicArrays) {
+        while (dest2.length > src2.length) {
+          dest2.pop();
+        }
+        for (let i = 0; i < src2.length; i++) {
+          dest2[i] = src2[i];
+        }
+      } else {
+        for (let i = 0; i < src2.length; i++) {
+          if (checks.isArray(dest2[i]) && checks.isArray(src2[i]) || checks.isObject(dest2[i]) && checks.isObject(src2[i])) {
+            queue.push({
+              src: src2[i],
+              dest: dest2[i]
+            });
+          } else {
+            dest2[i] = src2[i];
+          }
+        }
+      }
+    } else if (checks.isObject(task.dest)) {
+      const src2 = task.src;
+      const destAny = task.dest;
+      for (const [key, value] of Object.entries(src2)) {
+        if (checks.isArray(value) && checks.isArray(destAny[key]) || checks.isObject(value) && checks.isObject(destAny[key])) {
+          queue.push({
+            src: value,
+            dest: destAny[key]
+          });
+        } else {
+          destAny[key] = value;
+        }
+      }
+    } else {
+      throw new Error(`cannot handle type in queue: ${typeof task.dest}`);
+    }
+  }
+  return dest;
+}
+exports.merge = merge;

package/dist/cjs/util/dist/permutations.cjs

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function* permutations(bins, options) {
+  if (options?.includeEmpty) {
+    yield [];
+  }
+  if (bins.length === 0) {
+    return;
+  }
+  const arr = Array.from({ length: bins.length }, () => 0);
+  let i = arr.length - 1;
+  while (true) {
+    yield [...arr];
+    arr[i]++;
+    while (arr[i] === bins[i]) {
+      arr[i] = 0;
+      i--;
+      if (i < 0) {
+        return;
+      }
+      arr[i]++;
+    }
+    i = arr.length - 1;
+  }
+}
+exports.permutations = permutations;

package/dist/cjs/util/dist/util.cjs

@@ -1,161 +1,22 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const util = require("@polkadot/util");
 const sleep = (ms) => new Promise((resolve) => setTimeout(resolve, ms));
-function* permutations(bins, options) {
-  if (options?.includeEmpty) {
-    yield [];
-  }
-  if (bins.length === 0) {
-    return;
-  }
-  const arr = Array.from({ length: bins.length }, () => 0);
-  let i = arr.length - 1;
-  while (true) {
-    yield [...arr];
-    arr[i]++;
-    while (arr[i] === bins[i]) {
-      arr[i] = 0;
-      i--;
-      if (i < 0) {
-        return;
-      }
-      arr[i]++;
-    }
-    i = arr.length - 1;
-  }
-}
-function get(obj, key, required = true) {
-  const value = obj[key];
-  if (required && value === void 0) {
-    throw new Error(`Object has no property '${String(key)}': ${JSON.stringify(obj, null, 2)}`);
-  }
-  return value;
-}
-function at(items, index, options) {
-  if (items.length === 0) {
-    throw new Error("Array is empty");
-  }
-  if (!options?.noWrap) {
-    if (index > 0) {
-      index = index % items.length;
-    } else {
-      index = Math.ceil(Math.abs(index) / items.length) * items.length + index;
-    }
-  }
-  if (index >= items.length) {
-    throw new Error(`Index ${index} larger than array length ${items.length}`);
-  }
-  if (index < 0) {
-    throw new Error(`Index ${index} smaller than 0`);
-  }
-  return items[index];
-}
-function choice(items, n, random, options) {
-  if (n > items.length) {
-    throw new Error(`Cannot choose ${n} items from array of length ${items.length}`);
-  }
-  const result = [];
-  const indices = [];
-  for (let i = 0; i < n; i++) {
-    let index;
-    do {
-      index = Math.floor(Math.abs(random()) * items.length) % items.length;
-    } while (options?.withReplacement === false && indices.includes(index));
-    indices.push(index);
-    result.push(items[index]);
-  }
-  return result;
-}
 function getCurrentFileDirectory(url) {
   return new URL(url).pathname.split("/").slice(0, -1).join("/");
 }
-const flattenObj = (obj, prefix = "") => {
+const flatten = (obj, prefix = "") => {
   const flattenedObj = {};
   for (const [key, value] of Object.entries(obj)) {
     if (value instanceof Object) {
-      Object.assign(flattenedObj, flattenObj(value, prefix + "." + key));
+      Object.assign(flattenedObj, flatten(value, prefix + key + "."));
     } else {
-      flattenedObj[prefix + "." + key] = value;
+      flattenedObj[prefix + key] = value;
     }
   }
   return flattenedObj;
 };
 const kebabCase = (str) => str.replace(/[A-Z]+(?![a-z])|[A-Z]/g, ($, ofs) => (ofs ? "-" : "") + $.toLowerCase());
-function merge(dest, src, options) {
-  const atomicArrays = options?.atomicArrays;
-  const queue = [
-    {
-      src,
-      dest
-    }
-  ];
-  while (queue.length > 0) {
-    const task = queue.pop();
-    if (task === void 0) {
-      throw new Error("queue is empty");
-    }
-    if (isArray(task.dest)) {
-      const src2 = task.src;
-      const dest2 = task.dest;
-      if (atomicArrays) {
-        while (dest2.length > src2.length) {
-          dest2.pop();
-        }
-        for (let i = 0; i < src2.length; i++) {
-          dest2[i] = src2[i];
-        }
-      } else {
-        for (let i = 0; i < src2.length; i++) {
-          if (isArray(dest2[i]) && isArray(src2[i]) || isObject(dest2[i]) && isObject(src2[i])) {
-            queue.push({
-              src: src2[i],
-              dest: dest2[i]
-            });
-          } else {
-            dest2[i] = src2[i];
-          }
-        }
-      }
-    } else if (isObject(task.dest)) {
-      const src2 = task.src;
-      const destAny = task.dest;
-      for (const [key, value] of Object.entries(src2)) {
-        if (isArray(value) && isArray(destAny[key]) || isObject(value) && isObject(destAny[key])) {
-          queue.push({
-            src: value,
-            dest: destAny[key]
-          });
-        } else {
-          destAny[key] = value;
-        }
-      }
-    } else {
-      throw new Error(`cannot handle type in queue: ${typeof task.dest}`);
-    }
-  }
-  return dest;
-}
-const isArray = (value) => {
-  return Array.isArray(value);
-};
-const isObject = (value) => {
-  return value instanceof Object && !isArray(value);
-};
-const hashToHex = (hash) => {
-  if (isArray(hash)) {
-    return util.u8aToHex(new Uint8Array(hash));
-  }
-  return hash.toString();
-};
-exports.at = at;
-exports.flattenObj = flattenObj;
-exports.get = get;
+exports.flatten = flatten;
 exports.getCurrentFileDirectory = getCurrentFileDirectory;
-exports.hashToHex = hashToHex;
-exports.isArray = isArray;
-exports.isObject = isObject;
 exports.kebabCase = kebabCase;
-exports.merge = merge;
-exports.permutations = permutations;
 exports.sleep = sleep;

package/package.json

@@ -1,11 +1,11 @@
 {
     "name": "@prosopo/account",
-    "version": "1.0.1",
+    "version": "1.0.2",
     "description": "Services and Utils for Prosopo account gen and management",
     "main": "dist/index.js",
     "type": "module",
     "engines": {
-        "node": ">=18",
+        "node": ">=20",
         "npm": ">=9"
     },
     "exports": {
@@ -19,9 +19,9 @@
         "clean": "tsc --build --clean",
         "build": "tsc --build --verbose tsconfig.json",
         "build:cjs": "npx vite --config vite.cjs.config.ts build",
-        "eslint": "npx eslint . --no-error-on-unmatched-pattern --ignore-path ../../.eslintignore --quiet",
+        "eslint": "npx eslint . --cache --cache-location ../../node_modules/.cache/eslint/.eslintcache --no-error-on-unmatched-pattern --ignore-path ../../.eslintignore --quiet",
         "eslint:fix": "npm run eslint -- --fix",
-        "prettier": "npx prettier . --check --no-error-on-unmatched-pattern --ignore-path ../../.eslintignore",
+        "prettier": "npx prettier . --cache --cache-location ../../node_modules/.cache/prettier/.prettiercache --check --no-error-on-unmatched-pattern --ignore-path ../../.eslintignore",
         "prettier:fix": "npm run prettier -- --write",
         "lint": "npm run eslint && npm run prettier",
         "lint:fix": "npm run eslint:fix && npm run prettier:fix"
@@ -47,12 +47,12 @@
         "@polkadot/rpc-provider": "10.13.1",
         "@polkadot/util": "12.6.2",
         "@polkadot/util-crypto": "12.6.2",
-        "@prosopo/common": "1.0.1",
-        "@prosopo/types": "1.0.1",
-        "@prosopo/util": "1.0.1"
+        "@prosopo/common": "1.0.2",
+        "@prosopo/types": "1.0.2",
+        "@prosopo/util": "1.0.2"
     },
     "devDependencies": {
-        "@prosopo/config": "1.0.1",
+        "@prosopo/config": "1.0.2",
         "tslib": "2.6.2",
         "typescript": "5.1.6"
     },