this.me 3.0.27 → 3.0.29

package/dist/me.es.js

@@ -1,8 +1,8 @@
-var ae = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function ie(v) {
-  return v && v.__esModule && Object.prototype.hasOwnProperty.call(v, "default") ? v.default : v;
+var ce = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function ae(E) {
+  return E && E.__esModule && Object.prototype.hasOwnProperty.call(E, "default") ? E.default : E;
 }
-var Pt = { exports: {} };
+var Ut = { exports: {} };
 /**
  * [js-sha3]{@link https://github.com/emn178/js-sha3}
  *
@@ -12,14 +12,14 @@ var Pt = { exports: {} };
  * @license MIT
  */
 var Qt;
-function ue() {
-  return Qt || (Qt = 1, (function(v) {
+function he() {
+  return Qt || (Qt = 1, (function(E) {
     (function() {
-      var y = "input is invalid type", R = "finalize already called", M = typeof window == "object", b = M ? window : {};
-      b.JS_SHA3_NO_WINDOW && (M = !1);
-      var F = !M && typeof self == "object", k = !b.JS_SHA3_NO_NODE_JS && typeof process == "object" && process.versions && process.versions.node;
-      k ? b = ae : F && (b = self);
-      for (var g = !b.JS_SHA3_NO_COMMON_JS && !0 && v.exports, w = !b.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer < "u", h = "0123456789abcdef".split(""), Dt = [31, 7936, 2031616, 520093696], N = [4, 1024, 262144, 67108864], x = [1, 256, 65536, 16777216], st = [6, 1536, 393216, 100663296], d = [0, 8, 16, 24], Tt = [
+      var i = "input is invalid type", o = "finalize already called", l = typeof window == "object", a = l ? window : {};
+      a.JS_SHA3_NO_WINDOW && (l = !1);
+      var y = !l && typeof self == "object", b = !a.JS_SHA3_NO_NODE_JS && typeof process == "object" && process.versions && process.versions.node;
+      b ? a = ce : y && (a = self);
+      for (var P = !a.JS_SHA3_NO_COMMON_JS && !0 && E.exports, p = !a.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer < "u", d = "0123456789abcdef".split(""), B = [31, 7936, 2031616, 520093696], k = [4, 1024, 262144, 67108864], F = [1, 256, 65536, 16777216], w = [6, 1536, 393216, 100663296], v = [0, 8, 16, 24], _ = [
         1,
         0,
         32898,
@@ -68,145 +68,145 @@ function ue() {
         0,
         2147516424,
         2147483648
-      ], mt = [224, 256, 384, 512], Ht = [128, 256], Ut = ["hex", "buffer", "arrayBuffer", "array", "digest"], Wt = {
+      ], j = [224, 256, 384, 512], C = [128, 256], A = ["hex", "buffer", "arrayBuffer", "array", "digest"], K = {
         128: 168,
         256: 136
-      }, te = b.JS_SHA3_NO_NODE_JS || !Array.isArray ? function(t) {
+      }, ee = a.JS_SHA3_NO_NODE_JS || !Array.isArray ? function(t) {
         return Object.prototype.toString.call(t) === "[object Array]";
-      } : Array.isArray, ee = w && (b.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView) ? function(t) {
+      } : Array.isArray, re = p && (a.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView) ? function(t) {
         return typeof t == "object" && t.buffer && t.buffer.constructor === ArrayBuffer;
-      } : ArrayBuffer.isView, Kt = function(t) {
+      } : ArrayBuffer.isView, Vt = function(t) {
         var e = typeof t;
         if (e === "string")
           return [t, !0];
         if (e !== "object" || t === null)
-          throw new Error(y);
-        if (w && t.constructor === ArrayBuffer)
+          throw new Error(i);
+        if (p && t.constructor === ArrayBuffer)
           return [new Uint8Array(t), !1];
-        if (!te(t) && !ee(t))
-          throw new Error(y);
+        if (!ee(t) && !re(t))
+          throw new Error(i);
         return [t, !1];
-      }, Gt = function(t) {
-        return Kt(t)[0].length === 0;
-      }, zt = function(t) {
+      }, mt = function(t) {
+        return Vt(t)[0].length === 0;
+      }, Jt = function(t) {
         for (var e = [], r = 0; r < t.length; ++r)
           e[r] = t[r];
         return e;
-      }, Yt = function(t, e, r) {
+      }, Gt = function(t, e, r) {
         return function(n) {
-          return new l(t, e, t).update(n)[r]();
+          return new g(t, e, t).update(n)[r]();
         };
-      }, Vt = function(t, e, r) {
-        return function(n, o) {
-          return new l(t, e, o).update(n)[r]();
+      }, Yt = function(t, e, r) {
+        return function(n, c) {
+          return new g(t, e, c).update(n)[r]();
         };
       }, qt = function(t, e, r) {
-        return function(n, o, a, u) {
-          return _["cshake" + t].update(n, o, a, u)[r]();
+        return function(n, c, h, u) {
+          return T["cshake" + t].update(n, c, h, u)[r]();
         };
-      }, Lt = function(t, e, r) {
-        return function(n, o, a, u) {
-          return _["kmac" + t].update(n, o, a, u)[r]();
+      }, $t = function(t, e, r) {
+        return function(n, c, h, u) {
+          return T["kmac" + t].update(n, c, h, u)[r]();
         };
       }, I = function(t, e, r, n) {
-        for (var o = 0; o < Ut.length; ++o) {
-          var a = Ut[o];
-          t[a] = e(r, n, a);
+        for (var c = 0; c < A.length; ++c) {
+          var h = A[c];
+          t[h] = e(r, n, h);
         }
         return t;
-      }, Xt = function(t, e) {
-        var r = Yt(t, e, "hex");
+      }, Lt = function(t, e) {
+        var r = Gt(t, e, "hex");
         return r.create = function() {
-          return new l(t, e, t);
+          return new g(t, e, t);
         }, r.update = function(n) {
           return r.create().update(n);
-        }, I(r, Yt, t, e);
-      }, re = function(t, e) {
-        var r = Vt(t, e, "hex");
-        return r.create = function(n) {
-          return new l(t, e, n);
-        }, r.update = function(n, o) {
-          return r.create(o).update(n);
-        }, I(r, Vt, t, e);
+        }, I(r, Gt, t, e);
       }, ne = function(t, e) {
-        var r = Wt[t], n = qt(t, e, "hex");
-        return n.create = function(o, a, u) {
-          return Gt(a) && Gt(u) ? _["shake" + t].create(o) : new l(t, e, o).bytepad([a, u], r);
-        }, n.update = function(o, a, u, i) {
-          return n.create(a, u, i).update(o);
-        }, I(n, qt, t, e);
+        var r = Yt(t, e, "hex");
+        return r.create = function(n) {
+          return new g(t, e, n);
+        }, r.update = function(n, c) {
+          return r.create(c).update(n);
+        }, I(r, Yt, t, e);
       }, oe = function(t, e) {
-        var r = Wt[t], n = Lt(t, e, "hex");
-        return n.create = function(o, a, u) {
-          return new jt(t, e, a).bytepad(["KMAC", u], r).bytepad([o], r);
-        }, n.update = function(o, a, u, i) {
-          return n.create(o, u, i).update(a);
-        }, I(n, Lt, t, e);
-      }, Zt = [
-        { name: "keccak", padding: x, bits: mt, createMethod: Xt },
-        { name: "sha3", padding: st, bits: mt, createMethod: Xt },
-        { name: "shake", padding: Dt, bits: Ht, createMethod: re },
-        { name: "cshake", padding: N, bits: Ht, createMethod: ne },
-        { name: "kmac", padding: N, bits: Ht, createMethod: oe }
-      ], _ = {}, B = [], A = 0; A < Zt.length; ++A)
-        for (var S = Zt[A], D = S.bits, C = 0; C < D.length; ++C) {
-          var Jt = S.name + "_" + D[C];
-          if (B.push(Jt), _[Jt] = S.createMethod(D[C], S.padding), S.name !== "sha3") {
-            var $t = S.name + D[C];
-            B.push($t), _[$t] = _[Jt];
+        var r = K[t], n = qt(t, e, "hex");
+        return n.create = function(c, h, u) {
+          return mt(h) && mt(u) ? T["shake" + t].create(c) : new g(t, e, c).bytepad([h, u], r);
+        }, n.update = function(c, h, u, f) {
+          return n.create(h, u, f).update(c);
+        }, I(n, qt, t, e);
+      }, ie = function(t, e) {
+        var r = K[t], n = $t(t, e, "hex");
+        return n.create = function(c, h, u) {
+          return new Wt(t, e, h).bytepad(["KMAC", u], r).bytepad([c], r);
+        }, n.update = function(c, h, u, f) {
+          return n.create(c, u, f).update(h);
+        }, I(n, $t, t, e);
+      }, Xt = [
+        { name: "keccak", padding: F, bits: j, createMethod: Lt },
+        { name: "sha3", padding: w, bits: j, createMethod: Lt },
+        { name: "shake", padding: B, bits: C, createMethod: ne },
+        { name: "cshake", padding: k, bits: C, createMethod: oe },
+        { name: "kmac", padding: k, bits: C, createMethod: ie }
+      ], T = {}, M = [], R = 0; R < Xt.length; ++R)
+        for (var N = Xt[R], V = N.bits, D = 0; D < V.length; ++D) {
+          var zt = N.name + "_" + V[D];
+          if (M.push(zt), T[zt] = N.createMethod(V[D], N.padding), N.name !== "sha3") {
+            var Zt = N.name + V[D];
+            M.push(Zt), T[Zt] = T[zt];
           }
         }
-      function l(t, e, r) {
+      function g(t, e, r) {
         this.blocks = [], this.s = [], this.padding = e, this.outputBits = r, this.reset = !0, this.finalized = !1, this.block = 0, this.start = 0, this.blockCount = 1600 - (t << 1) >> 5, this.byteCount = this.blockCount << 2, this.outputBlocks = r >> 5, this.extraBytes = (r & 31) >> 3;
         for (var n = 0; n < 50; ++n)
           this.s[n] = 0;
       }
-      l.prototype.update = function(t) {
+      g.prototype.update = function(t) {
         if (this.finalized)
-          throw new Error(R);
-        var e = Kt(t);
+          throw new Error(o);
+        var e = Vt(t);
         t = e[0];
-        for (var r = e[1], n = this.blocks, o = this.byteCount, a = t.length, u = this.blockCount, i = 0, p = this.s, f, c; i < a; ) {
+        for (var r = e[1], n = this.blocks, c = this.byteCount, h = t.length, u = this.blockCount, f = 0, S = this.s, s, x; f < h; ) {
           if (this.reset)
-            for (this.reset = !1, n[0] = this.block, f = 1; f < u + 1; ++f)
-              n[f] = 0;
+            for (this.reset = !1, n[0] = this.block, s = 1; s < u + 1; ++s)
+              n[s] = 0;
           if (r)
-            for (f = this.start; i < a && f < o; ++i)
-              c = t.charCodeAt(i), c < 128 ? n[f >> 2] |= c << d[f++ & 3] : c < 2048 ? (n[f >> 2] |= (192 | c >> 6) << d[f++ & 3], n[f >> 2] |= (128 | c & 63) << d[f++ & 3]) : c < 55296 || c >= 57344 ? (n[f >> 2] |= (224 | c >> 12) << d[f++ & 3], n[f >> 2] |= (128 | c >> 6 & 63) << d[f++ & 3], n[f >> 2] |= (128 | c & 63) << d[f++ & 3]) : (c = 65536 + ((c & 1023) << 10 | t.charCodeAt(++i) & 1023), n[f >> 2] |= (240 | c >> 18) << d[f++ & 3], n[f >> 2] |= (128 | c >> 12 & 63) << d[f++ & 3], n[f >> 2] |= (128 | c >> 6 & 63) << d[f++ & 3], n[f >> 2] |= (128 | c & 63) << d[f++ & 3]);
+            for (s = this.start; f < h && s < c; ++f)
+              x = t.charCodeAt(f), x < 128 ? n[s >> 2] |= x << v[s++ & 3] : x < 2048 ? (n[s >> 2] |= (192 | x >> 6) << v[s++ & 3], n[s >> 2] |= (128 | x & 63) << v[s++ & 3]) : x < 55296 || x >= 57344 ? (n[s >> 2] |= (224 | x >> 12) << v[s++ & 3], n[s >> 2] |= (128 | x >> 6 & 63) << v[s++ & 3], n[s >> 2] |= (128 | x & 63) << v[s++ & 3]) : (x = 65536 + ((x & 1023) << 10 | t.charCodeAt(++f) & 1023), n[s >> 2] |= (240 | x >> 18) << v[s++ & 3], n[s >> 2] |= (128 | x >> 12 & 63) << v[s++ & 3], n[s >> 2] |= (128 | x >> 6 & 63) << v[s++ & 3], n[s >> 2] |= (128 | x & 63) << v[s++ & 3]);
           else
-            for (f = this.start; i < a && f < o; ++i)
-              n[f >> 2] |= t[i] << d[f++ & 3];
-          if (this.lastByteIndex = f, f >= o) {
-            for (this.start = f - o, this.block = n[u], f = 0; f < u; ++f)
-              p[f] ^= n[f];
-            O(p), this.reset = !0;
+            for (s = this.start; f < h && s < c; ++f)
+              n[s >> 2] |= t[f] << v[s++ & 3];
+          if (this.lastByteIndex = s, s >= c) {
+            for (this.start = s - c, this.block = n[u], s = 0; s < u; ++s)
+              S[s] ^= n[s];
+            H(S), this.reset = !0;
           } else
-            this.start = f;
+            this.start = s;
         }
         return this;
-      }, l.prototype.encode = function(t, e) {
-        var r = t & 255, n = 1, o = [r];
+      }, g.prototype.encode = function(t, e) {
+        var r = t & 255, n = 1, c = [r];
         for (t = t >> 8, r = t & 255; r > 0; )
-          o.unshift(r), t = t >> 8, r = t & 255, ++n;
-        return e ? o.push(n) : o.unshift(n), this.update(o), o.length;
-      }, l.prototype.encodeString = function(t) {
-        var e = Kt(t);
+          c.unshift(r), t = t >> 8, r = t & 255, ++n;
+        return e ? c.push(n) : c.unshift(n), this.update(c), c.length;
+      }, g.prototype.encodeString = function(t) {
+        var e = Vt(t);
         t = e[0];
-        var r = e[1], n = 0, o = t.length;
+        var r = e[1], n = 0, c = t.length;
         if (r)
-          for (var a = 0; a < t.length; ++a) {
-            var u = t.charCodeAt(a);
-            u < 128 ? n += 1 : u < 2048 ? n += 2 : u < 55296 || u >= 57344 ? n += 3 : (u = 65536 + ((u & 1023) << 10 | t.charCodeAt(++a) & 1023), n += 4);
+          for (var h = 0; h < t.length; ++h) {
+            var u = t.charCodeAt(h);
+            u < 128 ? n += 1 : u < 2048 ? n += 2 : u < 55296 || u >= 57344 ? n += 3 : (u = 65536 + ((u & 1023) << 10 | t.charCodeAt(++h) & 1023), n += 4);
           }
         else
-          n = o;
+          n = c;
         return n += this.encode(n * 8), this.update(t), n;
-      }, l.prototype.bytepad = function(t, e) {
+      }, g.prototype.bytepad = function(t, e) {
         for (var r = this.encode(e), n = 0; n < t.length; ++n)
           r += this.encodeString(t[n]);
-        var o = (e - r % e) % e, a = [];
-        return a.length = o, this.update(a), this;
-      }, l.prototype.finalize = function() {
+        var c = (e - r % e) % e, h = [];
+        return h.length = c, this.update(h), this;
+      }, g.prototype.finalize = function() {
         if (!this.finalized) {
           this.finalized = !0;
           var t = this.blocks, e = this.lastByteIndex, r = this.blockCount, n = this.s;
@@ -215,98 +215,343 @@ function ue() {
               t[e] = 0;
           for (t[r - 1] |= 2147483648, e = 0; e < r; ++e)
             n[e] ^= t[e];
-          O(n);
+          H(n);
         }
-      }, l.prototype.toString = l.prototype.hex = function() {
+      }, g.prototype.toString = g.prototype.hex = function() {
         this.finalize();
-        for (var t = this.blockCount, e = this.s, r = this.outputBlocks, n = this.extraBytes, o = 0, a = 0, u = "", i; a < r; ) {
-          for (o = 0; o < t && a < r; ++o, ++a)
-            i = e[o], u += h[i >> 4 & 15] + h[i & 15] + h[i >> 12 & 15] + h[i >> 8 & 15] + h[i >> 20 & 15] + h[i >> 16 & 15] + h[i >> 28 & 15] + h[i >> 24 & 15];
-          a % t === 0 && (e = zt(e), O(e), o = 0);
+        for (var t = this.blockCount, e = this.s, r = this.outputBlocks, n = this.extraBytes, c = 0, h = 0, u = "", f; h < r; ) {
+          for (c = 0; c < t && h < r; ++c, ++h)
+            f = e[c], u += d[f >> 4 & 15] + d[f & 15] + d[f >> 12 & 15] + d[f >> 8 & 15] + d[f >> 20 & 15] + d[f >> 16 & 15] + d[f >> 28 & 15] + d[f >> 24 & 15];
+          h % t === 0 && (e = Jt(e), H(e), c = 0);
         }
-        return n && (i = e[o], u += h[i >> 4 & 15] + h[i & 15], n > 1 && (u += h[i >> 12 & 15] + h[i >> 8 & 15]), n > 2 && (u += h[i >> 20 & 15] + h[i >> 16 & 15])), u;
-      }, l.prototype.arrayBuffer = function() {
+        return n && (f = e[c], u += d[f >> 4 & 15] + d[f & 15], n > 1 && (u += d[f >> 12 & 15] + d[f >> 8 & 15]), n > 2 && (u += d[f >> 20 & 15] + d[f >> 16 & 15])), u;
+      }, g.prototype.arrayBuffer = function() {
         this.finalize();
-        var t = this.blockCount, e = this.s, r = this.outputBlocks, n = this.extraBytes, o = 0, a = 0, u = this.outputBits >> 3, i;
-        n ? i = new ArrayBuffer(r + 1 << 2) : i = new ArrayBuffer(u);
-        for (var p = new Uint32Array(i); a < r; ) {
-          for (o = 0; o < t && a < r; ++o, ++a)
-            p[a] = e[o];
-          a % t === 0 && (e = zt(e), O(e));
+        var t = this.blockCount, e = this.s, r = this.outputBlocks, n = this.extraBytes, c = 0, h = 0, u = this.outputBits >> 3, f;
+        n ? f = new ArrayBuffer(r + 1 << 2) : f = new ArrayBuffer(u);
+        for (var S = new Uint32Array(f); h < r; ) {
+          for (c = 0; c < t && h < r; ++c, ++h)
+            S[h] = e[c];
+          h % t === 0 && (e = Jt(e), H(e));
         }
-        return n && (p[a] = e[o], i = i.slice(0, u)), i;
-      }, l.prototype.buffer = l.prototype.arrayBuffer, l.prototype.digest = l.prototype.array = function() {
+        return n && (S[h] = e[c], f = f.slice(0, u)), f;
+      }, g.prototype.buffer = g.prototype.arrayBuffer, g.prototype.digest = g.prototype.array = function() {
         this.finalize();
-        for (var t = this.blockCount, e = this.s, r = this.outputBlocks, n = this.extraBytes, o = 0, a = 0, u = [], i, p; a < r; ) {
-          for (o = 0; o < t && a < r; ++o, ++a)
-            i = a << 2, p = e[o], u[i] = p & 255, u[i + 1] = p >> 8 & 255, u[i + 2] = p >> 16 & 255, u[i + 3] = p >> 24 & 255;
-          a % t === 0 && (e = zt(e), O(e));
+        for (var t = this.blockCount, e = this.s, r = this.outputBlocks, n = this.extraBytes, c = 0, h = 0, u = [], f, S; h < r; ) {
+          for (c = 0; c < t && h < r; ++c, ++h)
+            f = h << 2, S = e[c], u[f] = S & 255, u[f + 1] = S >> 8 & 255, u[f + 2] = S >> 16 & 255, u[f + 3] = S >> 24 & 255;
+          h % t === 0 && (e = Jt(e), H(e));
         }
-        return n && (i = a << 2, p = e[o], u[i] = p & 255, n > 1 && (u[i + 1] = p >> 8 & 255), n > 2 && (u[i + 2] = p >> 16 & 255)), u;
+        return n && (f = h << 2, S = e[c], u[f] = S & 255, n > 1 && (u[f + 1] = S >> 8 & 255), n > 2 && (u[f + 2] = S >> 16 & 255)), u;
       };
-      function jt(t, e, r) {
-        l.call(this, t, e, r);
+      function Wt(t, e, r) {
+        g.call(this, t, e, r);
       }
-      jt.prototype = new l(), jt.prototype.finalize = function() {
-        return this.encode(this.outputBits, !0), l.prototype.finalize.call(this);
+      Wt.prototype = new g(), Wt.prototype.finalize = function() {
+        return this.encode(this.outputBits, !0), g.prototype.finalize.call(this);
       };
-      var O = function(t) {
-        var e, r, n, o, a, u, i, p, f, c, H, K, z, J, j, P, T, m, U, W, G, Y, V, q, L, X, Z, $, Q, s, tt, et, rt, nt, ot, at, it, ut, ft, ct, ht, lt, pt, bt, dt, yt, vt, xt, _t, At, kt, St, Ft, wt, Bt, Ct, Ot, Et, Rt, Mt, gt, Nt, It;
+      var H = function(t) {
+        var e, r, n, c, h, u, f, S, s, x, J, z, W, U, m, G, Y, q, $, L, X, Z, Q, tt, et, rt, nt, ot, it, ct, at, ht, ft, lt, ut, st, yt, dt, bt, pt, vt, xt, gt, St, Bt, Pt, kt, At, Ft, wt, _t, jt, Ct, Ot, Et, Tt, Rt, Kt, Nt, Mt, Dt, Ht, It;
         for (n = 0; n < 48; n += 2)
-          o = t[0] ^ t[10] ^ t[20] ^ t[30] ^ t[40], a = t[1] ^ t[11] ^ t[21] ^ t[31] ^ t[41], u = t[2] ^ t[12] ^ t[22] ^ t[32] ^ t[42], i = t[3] ^ t[13] ^ t[23] ^ t[33] ^ t[43], p = t[4] ^ t[14] ^ t[24] ^ t[34] ^ t[44], f = t[5] ^ t[15] ^ t[25] ^ t[35] ^ t[45], c = t[6] ^ t[16] ^ t[26] ^ t[36] ^ t[46], H = t[7] ^ t[17] ^ t[27] ^ t[37] ^ t[47], K = t[8] ^ t[18] ^ t[28] ^ t[38] ^ t[48], z = t[9] ^ t[19] ^ t[29] ^ t[39] ^ t[49], e = K ^ (u << 1 | i >>> 31), r = z ^ (i << 1 | u >>> 31), t[0] ^= e, t[1] ^= r, t[10] ^= e, t[11] ^= r, t[20] ^= e, t[21] ^= r, t[30] ^= e, t[31] ^= r, t[40] ^= e, t[41] ^= r, e = o ^ (p << 1 | f >>> 31), r = a ^ (f << 1 | p >>> 31), t[2] ^= e, t[3] ^= r, t[12] ^= e, t[13] ^= r, t[22] ^= e, t[23] ^= r, t[32] ^= e, t[33] ^= r, t[42] ^= e, t[43] ^= r, e = u ^ (c << 1 | H >>> 31), r = i ^ (H << 1 | c >>> 31), t[4] ^= e, t[5] ^= r, t[14] ^= e, t[15] ^= r, t[24] ^= e, t[25] ^= r, t[34] ^= e, t[35] ^= r, t[44] ^= e, t[45] ^= r, e = p ^ (K << 1 | z >>> 31), r = f ^ (z << 1 | K >>> 31), t[6] ^= e, t[7] ^= r, t[16] ^= e, t[17] ^= r, t[26] ^= e, t[27] ^= r, t[36] ^= e, t[37] ^= r, t[46] ^= e, t[47] ^= r, e = c ^ (o << 1 | a >>> 31), r = H ^ (a << 1 | o >>> 31), t[8] ^= e, t[9] ^= r, t[18] ^= e, t[19] ^= r, t[28] ^= e, t[29] ^= r, t[38] ^= e, t[39] ^= r, t[48] ^= e, t[49] ^= r, J = t[0], j = t[1], yt = t[11] << 4 | t[10] >>> 28, vt = t[10] << 4 | t[11] >>> 28, $ = t[20] << 3 | t[21] >>> 29, Q = t[21] << 3 | t[20] >>> 29, Mt = t[31] << 9 | t[30] >>> 23, gt = t[30] << 9 | t[31] >>> 23, lt = t[40] << 18 | t[41] >>> 14, pt = t[41] << 18 | t[40] >>> 14, nt = t[2] << 1 | t[3] >>> 31, ot = t[3] << 1 | t[2] >>> 31, P = t[13] << 12 | t[12] >>> 20, T = t[12] << 12 | t[13] >>> 20, xt = t[22] << 10 | t[23] >>> 22, _t = t[23] << 10 | t[22] >>> 22, s = t[33] << 13 | t[32] >>> 19, tt = t[32] << 13 | t[33] >>> 19, Nt = t[42] << 2 | t[43] >>> 30, It = t[43] << 2 | t[42] >>> 30, wt = t[5] << 30 | t[4] >>> 2, Bt = t[4] << 30 | t[5] >>> 2, at = t[14] << 6 | t[15] >>> 26, it = t[15] << 6 | t[14] >>> 26, m = t[25] << 11 | t[24] >>> 21, U = t[24] << 11 | t[25] >>> 21, At = t[34] << 15 | t[35] >>> 17, kt = t[35] << 15 | t[34] >>> 17, et = t[45] << 29 | t[44] >>> 3, rt = t[44] << 29 | t[45] >>> 3, q = t[6] << 28 | t[7] >>> 4, L = t[7] << 28 | t[6] >>> 4, Ct = t[17] << 23 | t[16] >>> 9, Ot = t[16] << 23 | t[17] >>> 9, ut = t[26] << 25 | t[27] >>> 7, ft = t[27] << 25 | t[26] >>> 7, W = t[36] << 21 | t[37] >>> 11, G = t[37] << 21 | t[36] >>> 11, St = t[47] << 24 | t[46] >>> 8, Ft = t[46] << 24 | t[47] >>> 8, bt = t[8] << 27 | t[9] >>> 5, dt = t[9] << 27 | t[8] >>> 5, X = t[18] << 20 | t[19] >>> 12, Z = t[19] << 20 | t[18] >>> 12, Et = t[29] << 7 | t[28] >>> 25, Rt = t[28] << 7 | t[29] >>> 25, ct = t[38] << 8 | t[39] >>> 24, ht = t[39] << 8 | t[38] >>> 24, Y = t[48] << 14 | t[49] >>> 18, V = t[49] << 14 | t[48] >>> 18, t[0] = J ^ ~P & m, t[1] = j ^ ~T & U, t[10] = q ^ ~X & $, t[11] = L ^ ~Z & Q, t[20] = nt ^ ~at & ut, t[21] = ot ^ ~it & ft, t[30] = bt ^ ~yt & xt, t[31] = dt ^ ~vt & _t, t[40] = wt ^ ~Ct & Et, t[41] = Bt ^ ~Ot & Rt, t[2] = P ^ ~m & W, t[3] = T ^ ~U & G, t[12] = X ^ ~$ & s, t[13] = Z ^ ~Q & tt, t[22] = at ^ ~ut & ct, t[23] = it ^ ~ft & ht, t[32] = yt ^ ~xt & At, t[33] = vt ^ ~_t & kt, t[42] = Ct ^ ~Et & Mt, t[43] = Ot ^ ~Rt & gt, t[4] = m ^ ~W & Y, t[5] = U ^ ~G & V, t[14] = $ ^ ~s & et, t[15] = Q ^ ~tt & rt, t[24] = ut ^ ~ct & lt, t[25] = ft ^ ~ht & pt, t[34] = xt ^ ~At & St, t[35] = _t ^ ~kt & Ft, t[44] = Et ^ ~Mt & Nt, t[45] = Rt ^ ~gt & It, t[6] = W ^ ~Y & J, t[7] = G ^ ~V & j, t[16] = s ^ ~et & q, t[17] = tt ^ ~rt & L, t[26] = ct ^ ~lt & nt, t[27] = ht ^ ~pt & ot, t[36] = At ^ ~St & bt, t[37] = kt ^ ~Ft & dt, t[46] = Mt ^ ~Nt & wt, t[47] = gt ^ ~It & Bt, t[8] = Y ^ ~J & P, t[9] = V ^ ~j & T, t[18] = et ^ ~q & X, t[19] = rt ^ ~L & Z, t[28] = lt ^ ~nt & at, t[29] = pt ^ ~ot & it, t[38] = St ^ ~bt & yt, t[39] = Ft ^ ~dt & vt, t[48] = Nt ^ ~wt & Ct, t[49] = It ^ ~Bt & Ot, t[0] ^= Tt[n], t[1] ^= Tt[n + 1];
+          c = t[0] ^ t[10] ^ t[20] ^ t[30] ^ t[40], h = t[1] ^ t[11] ^ t[21] ^ t[31] ^ t[41], u = t[2] ^ t[12] ^ t[22] ^ t[32] ^ t[42], f = t[3] ^ t[13] ^ t[23] ^ t[33] ^ t[43], S = t[4] ^ t[14] ^ t[24] ^ t[34] ^ t[44], s = t[5] ^ t[15] ^ t[25] ^ t[35] ^ t[45], x = t[6] ^ t[16] ^ t[26] ^ t[36] ^ t[46], J = t[7] ^ t[17] ^ t[27] ^ t[37] ^ t[47], z = t[8] ^ t[18] ^ t[28] ^ t[38] ^ t[48], W = t[9] ^ t[19] ^ t[29] ^ t[39] ^ t[49], e = z ^ (u << 1 | f >>> 31), r = W ^ (f << 1 | u >>> 31), t[0] ^= e, t[1] ^= r, t[10] ^= e, t[11] ^= r, t[20] ^= e, t[21] ^= r, t[30] ^= e, t[31] ^= r, t[40] ^= e, t[41] ^= r, e = c ^ (S << 1 | s >>> 31), r = h ^ (s << 1 | S >>> 31), t[2] ^= e, t[3] ^= r, t[12] ^= e, t[13] ^= r, t[22] ^= e, t[23] ^= r, t[32] ^= e, t[33] ^= r, t[42] ^= e, t[43] ^= r, e = u ^ (x << 1 | J >>> 31), r = f ^ (J << 1 | x >>> 31), t[4] ^= e, t[5] ^= r, t[14] ^= e, t[15] ^= r, t[24] ^= e, t[25] ^= r, t[34] ^= e, t[35] ^= r, t[44] ^= e, t[45] ^= r, e = S ^ (z << 1 | W >>> 31), r = s ^ (W << 1 | z >>> 31), t[6] ^= e, t[7] ^= r, t[16] ^= e, t[17] ^= r, t[26] ^= e, t[27] ^= r, t[36] ^= e, t[37] ^= r, t[46] ^= e, t[47] ^= r, e = x ^ (c << 1 | h >>> 31), r = J ^ (h << 1 | c >>> 31), t[8] ^= e, t[9] ^= r, t[18] ^= e, t[19] ^= r, t[28] ^= e, t[29] ^= r, t[38] ^= e, t[39] ^= r, t[48] ^= e, t[49] ^= r, U = t[0], m = t[1], Pt = t[11] << 4 | t[10] >>> 28, kt = t[10] << 4 | t[11] >>> 28, ot = t[20] << 3 | t[21] >>> 29, it = t[21] << 3 | t[20] >>> 29, Mt = t[31] << 9 | t[30] >>> 23, Dt = t[30] << 9 | t[31] >>> 23, xt = t[40] << 18 | t[41] >>> 14, gt = t[41] << 18 | t[40] >>> 14, lt = t[2] << 1 | t[3] >>> 31, ut = t[3] << 1 | t[2] >>> 31, G = t[13] << 12 | t[12] >>> 20, Y = t[12] << 12 | t[13] >>> 20, At = t[22] << 10 | t[23] >>> 22, Ft = t[23] << 10 | t[22] >>> 22, ct = t[33] << 13 | t[32] >>> 19, at = t[32] << 13 | t[33] >>> 19, Ht = t[42] << 2 | t[43] >>> 30, It = t[43] << 2 | t[42] >>> 30, Ot = t[5] << 30 | t[4] >>> 2, Et = t[4] << 30 | t[5] >>> 2, st = t[14] << 6 | t[15] >>> 26, yt = t[15] << 6 | t[14] >>> 26, q = t[25] << 11 | t[24] >>> 21, $ = t[24] << 11 | t[25] >>> 21, wt = t[34] << 15 | t[35] >>> 17, _t = t[35] << 15 | t[34] >>> 17, ht = t[45] << 29 | t[44] >>> 3, ft = t[44] << 29 | t[45] >>> 3, tt = t[6] << 28 | t[7] >>> 4, et = t[7] << 28 | t[6] >>> 4, Tt = t[17] << 23 | t[16] >>> 9, Rt = t[16] << 23 | t[17] >>> 9, dt = t[26] << 25 | t[27] >>> 7, bt = t[27] << 25 | t[26] >>> 7, L = t[36] << 21 | t[37] >>> 11, X = t[37] << 21 | t[36] >>> 11, jt = t[47] << 24 | t[46] >>> 8, Ct = t[46] << 24 | t[47] >>> 8, St = t[8] << 27 | t[9] >>> 5, Bt = t[9] << 27 | t[8] >>> 5, rt = t[18] << 20 | t[19] >>> 12, nt = t[19] << 20 | t[18] >>> 12, Kt = t[29] << 7 | t[28] >>> 25, Nt = t[28] << 7 | t[29] >>> 25, pt = t[38] << 8 | t[39] >>> 24, vt = t[39] << 8 | t[38] >>> 24, Z = t[48] << 14 | t[49] >>> 18, Q = t[49] << 14 | t[48] >>> 18, t[0] = U ^ ~G & q, t[1] = m ^ ~Y & $, t[10] = tt ^ ~rt & ot, t[11] = et ^ ~nt & it, t[20] = lt ^ ~st & dt, t[21] = ut ^ ~yt & bt, t[30] = St ^ ~Pt & At, t[31] = Bt ^ ~kt & Ft, t[40] = Ot ^ ~Tt & Kt, t[41] = Et ^ ~Rt & Nt, t[2] = G ^ ~q & L, t[3] = Y ^ ~$ & X, t[12] = rt ^ ~ot & ct, t[13] = nt ^ ~it & at, t[22] = st ^ ~dt & pt, t[23] = yt ^ ~bt & vt, t[32] = Pt ^ ~At & wt, t[33] = kt ^ ~Ft & _t, t[42] = Tt ^ ~Kt & Mt, t[43] = Rt ^ ~Nt & Dt, t[4] = q ^ ~L & Z, t[5] = $ ^ ~X & Q, t[14] = ot ^ ~ct & ht, t[15] = it ^ ~at & ft, t[24] = dt ^ ~pt & xt, t[25] = bt ^ ~vt & gt, t[34] = At ^ ~wt & jt, t[35] = Ft ^ ~_t & Ct, t[44] = Kt ^ ~Mt & Ht, t[45] = Nt ^ ~Dt & It, t[6] = L ^ ~Z & U, t[7] = X ^ ~Q & m, t[16] = ct ^ ~ht & tt, t[17] = at ^ ~ft & et, t[26] = pt ^ ~xt & lt, t[27] = vt ^ ~gt & ut, t[36] = wt ^ ~jt & St, t[37] = _t ^ ~Ct & Bt, t[46] = Mt ^ ~Ht & Ot, t[47] = Dt ^ ~It & Et, t[8] = Z ^ ~U & G, t[9] = Q ^ ~m & Y, t[18] = ht ^ ~tt & rt, t[19] = ft ^ ~et & nt, t[28] = xt ^ ~lt & st, t[29] = gt ^ ~ut & yt, t[38] = jt ^ ~St & Pt, t[39] = Ct ^ ~Bt & kt, t[48] = Ht ^ ~Ot & Tt, t[49] = It ^ ~Et & Rt, t[0] ^= _[n], t[1] ^= _[n + 1];
       };
-      if (g)
-        v.exports = _;
+      if (P)
+        E.exports = T;
       else
-        for (A = 0; A < B.length; ++A)
-          b[B[A]] = _[B[A]];
+        for (R = 0; R < M.length; ++R)
+          a[M[R]] = T[M[R]];
     })();
-  })(Pt)), Pt.exports;
+  })(Ut)), Ut.exports;
 }
-var fe = ue();
-const ce = /* @__PURE__ */ ie(fe), { keccak256: E } = ce;
-class he {
-  constructor(y, R) {
-    return this.declarations = [], this.secret = y, this.namespace = R, this.identityRoot = "0x" + E(y), this.publicKey = "0x" + E("public:" + y), this.identityHash = "0x" + E(this.publicKey + R), new Proxy(this, {
-      get: (b, F) => F in b ? b[F] : (...k) => {
-        const g = String(F), w = (x) => x && typeof x == "object" && "__pointer" in x ? x.__pointer : x;
-        let h;
-        k.length === 0 ? h = void 0 : k.length === 1 ? h = w(k[0]) : h = k.map((x) => w(x));
-        const Dt = "0x" + E(
-          b.secret + g + JSON.stringify(h) + b.namespace
-        ), N = {
-          key: g,
-          value: h,
-          signature: Dt,
-          timestamp: Date.now()
-        };
-        return b.declarations.push(N), b;
+var fe = he();
+const le = /* @__PURE__ */ ae(fe), { keccak256: O } = le;
+class te {
+  constructor(i, o) {
+    this.payload = {}, this.declarations = [], this.secrets = {}, this.branchVersions = {}, this.username = i, this.secret = o, this.identityRoot = "0x" + O(o), this.publicKey = "0x" + O("public:" + o), this.identityHash = "0x" + O(this.publicKey + this.username), this.secrets[""] = o;
+    const l = this.createProxy([]);
+    return Object.setPrototypeOf(l, te.prototype), Object.assign(l, this), l;
+  }
+  /**
+   * Create a proxy bound to a specific path, e.g. ["wallet", "income"]
+   * The proxy itself is callable (function) and also expandable via property access.
+   */
+  createProxy(i) {
+    const o = this, l = (...a) => o.handleCall(i, a);
+    return new Proxy(l, {
+      get(a, y) {
+        if (typeof y == "symbol") return a[y];
+        if (y === "secret") return o.createProxy([...i, String(y)]);
+        if (y in o) return o[y];
+        const b = [...i, String(y)];
+        return o.createProxy(b);
+      },
+      apply(a, y, b) {
+        return o.handleCall(i, b);
       }
     });
   }
   /**
-   * Firma genérica de mensajes si se necesita fuera de las declaraciones.
+   * Handle a call at a given path.
+   * Examples:
+   *   me.wallet.income(200)       → set encrypted payload at wallet.income
+   *   me.wallet.secret("abc123")  → set secret for path "wallet"
+   *   me.wallet.ptr()             → return pointer object { __ptr: "wallet" }
    */
-  sign(y) {
-    return "0x" + E(this.secret + y);
+  handleCall(i, o) {
+    if (i.length === 0) {
+      if (o.length === 1 && typeof o[0] == "string") {
+        const p = o[0].split(".").filter(Boolean);
+        return this.exportBranch(p.join("."));
+      }
+      return this.createProxy([]);
+    }
+    const l = i[i.length - 1];
+    if (l === "secret") {
+      const p = i.slice(0, -1), d = p.join("."), B = String(o[0] ?? "");
+      if (!B) return this.createProxy(p);
+      this.secrets[d] = B;
+      const k = "0x" + O(this.secret + d + "::secret-set");
+      return this.declarations.push({
+        key: d + ".secret",
+        value: "<secret-set>",
+        signature: k,
+        timestamp: Date.now()
+      }), this.createProxy(p);
+    }
+    if (l === "ptr")
+      return { __ptr: i.slice(0, -1).join(".") };
+    const a = i.join(".");
+    let y;
+    o.length === 0 ? y = void 0 : o.length === 1 ? y = o[0] : y = o, this.ensurePath(i, y);
+    const b = this.resolveSecret(i), P = "0x" + O(
+      b + a + JSON.stringify(y)
+    );
+    return this.declarations.push({
+      key: a,
+      value: y,
+      signature: P,
+      timestamp: Date.now()
+    }), this.createProxy(i);
+  }
+  /**
+   * Secret scope resolution with path:
+   * - Find the most specific path that has a secret.
+   * - Return both the secret and the path at which it was defined.
+   * - If none, fall back to root secret with empty path.
+   */
+  resolveSecretWithPath(i) {
+    for (let o = i.length; o >= 0; o--) {
+      const l = i.slice(0, o).join(".");
+      if (this.secrets[l])
+        return { secret: this.secrets[l], secretPath: i.slice(0, o) };
+    }
+    return { secret: this.secret, secretPath: [] };
+  }
+  /**
+   * Backwards-compatible helper: only return the secret string.
+   */
+  resolveSecret(i) {
+    return this.resolveSecretWithPath(i).secret;
   }
   /**
-   * Exportar el snapshot de ME para mandarlo a Cleaker (ledger, graph, etc.).
+   * Encrypt and store the value at the given path inside `payload`.
+   *
+   * If there is a non-root secret defined for some ancestor path P of `path`,
+   * we treat that ancestor path P as the "branch root" and store the ENTIRE
+   * subtree under P as ONE encrypted blob at that location.
+   *
+   * This means that to re-enter that channel you need both:
+   *   - the full expression for P, and
+   *   - the secret used at P.
+   */
+  ensurePath(i, o) {
+    const { secret: l, secretPath: a } = this.resolveSecretWithPath(i), y = a.join("."), b = O(l);
+    if (a.length > 0) {
+      let k = {};
+      const F = this.branchVersions[y]?.[b], w = this.getSubPayload(a);
+      if (F) {
+        const A = this.decryptForPath(a, F);
+        A && typeof A == "object" && (k = A);
+      } else if (typeof w == "string") {
+        const A = this.decryptForPath(a, w);
+        A && typeof A == "object" && (k = A);
+      } else w && typeof w == "object" && (k = w);
+      const v = i.slice(a.length);
+      let _ = k;
+      for (let A = 0; A < v.length - 1; A++) {
+        const K = v[A];
+        (!_[K] || typeof _[K] != "object") && (_[K] = {}), _ = _[K];
+      }
+      const j = v[v.length - 1];
+      _[j] = o;
+      const C = this.encryptForPath(a, k);
+      this.branchVersions[y] || (this.branchVersions[y] = {}), this.branchVersions[y][b] = C, this.writeBranchBlob(a, C);
+      return;
+    }
+    const p = this.encryptForPath(i, o);
+    let d = this.payload;
+    for (let k = 0; k < i.length - 1; k++) {
+      const F = i[k];
+      (!d[F] || typeof d[F] != "object") && (d[F] = {}), d = d[F];
+    }
+    const B = i[i.length - 1];
+    d[B] = p;
+  }
+  /**
+   * Set a value at a nested path inside `payload`.
+   */
+  setSubPayload(i, o) {
+    if (i.length === 0) {
+      this.payload = o;
+      return;
+    }
+    let l = this.payload;
+    for (let y = 0; y < i.length - 1; y++) {
+      const b = i[y];
+      (!l[b] || typeof l[b] != "object") && (l[b] = {}), l = l[b];
+    }
+    const a = i[i.length - 1];
+    l[a] = o;
+  }
+  /**
+   * Find the nearest ancestor path that represents an encrypted branch blob.
+   */
+  findNearestBranchAncestor(i) {
+    for (let o = i.length - 1; o >= 1; o--) {
+      const l = i.slice(0, o), a = l.join(".");
+      if (this.branchVersions[a])
+        return { path: l, secret: this.resolveSecret(l) };
+    }
+    return null;
+  }
+  /**
+   * Write an encrypted branch blob while preserving any encrypted ancestor branches.
+   */
+  writeBranchBlob(i, o) {
+    let l = i, a = o;
+    for (; ; ) {
+      const y = this.findNearestBranchAncestor(l);
+      if (!y) {
+        this.setSubPayload(l, a);
+        return;
+      }
+      const { path: b, secret: P } = y, p = b.join("."), d = O(P), B = this.getSubPayload(b), k = this.branchVersions[p]?.[d] ?? (typeof B == "string" ? B : void 0);
+      let F = {};
+      if (k) {
+        const j = this.decryptForPath(b, k);
+        j && typeof j == "object" && (F = j);
+      }
+      const w = l.slice(b.length);
+      let v = F;
+      for (let j = 0; j < w.length - 1; j++) {
+        const C = w[j];
+        (!v[C] || typeof v[C] != "object") && (v[C] = {}), v = v[C];
+      }
+      v[w[w.length - 1]] = a;
+      const _ = this.encryptForPath(b, F);
+      this.branchVersions[p] || (this.branchVersions[p] = {}), this.branchVersions[p][d] = _, l = b, a = _;
+    }
+  }
+  getSubPayload(i) {
+    let o = this.payload;
+    for (const l of i) {
+      if (!o || typeof o != "object") return;
+      o = o[l];
+    }
+    return o;
+  }
+  /**
+   * Recursively decrypt a node of the encrypted payload tree.
+   */
+  decryptTree(i, o) {
+    if (o == null) return o;
+    if (typeof o == "string") {
+      if (!this.isHexString(o)) return o;
+      const a = this.decryptForPath(i, o);
+      return a === null ? o : a;
+    }
+    if (typeof o != "object")
+      return o;
+    const l = Array.isArray(o) ? [] : {};
+    for (const a of Object.keys(o)) {
+      const y = [...i, a];
+      l[a] = this.decryptTree(y, o[a]);
+    }
+    return l;
+  }
+  /**
+   * Encrypt a value (object or primitive) using the secret resolved for the given path.
+   * Produces a hex string compatible with decryptForPath().
+   */
+  encryptForPath(i, o) {
+    const l = this.resolveSecret(i), a = JSON.stringify(o), y = new TextEncoder().encode(a), b = O(l + ":" + i.join(".")), P = this.asciiToBytes(b), p = new Uint8Array(y.length);
+    for (let B = 0; B < y.length; B++)
+      p[B] = y[B] ^ P[B % P.length];
+    let d = "";
+    for (let B = 0; B < p.length; B++)
+      d += p[B].toString(16).padStart(2, "0");
+    return d;
+  }
+  /**
+   * Decrypt a single encrypted blob using the secret resolved for the given path.
+   */
+  decryptForPath(i, o) {
+    const l = this.resolveSecret(i);
+    try {
+      const a = this.hexToBytes(o), y = O(l + ":" + i.join(".")), b = this.asciiToBytes(y), P = new Uint8Array(a.length);
+      for (let d = 0; d < a.length; d++)
+        P[d] = a[d] ^ b[d % b.length];
+      const p = new TextDecoder().decode(P);
+      return JSON.parse(p);
+    } catch {
+      return null;
+    }
+  }
+  asciiToBytes(i) {
+    return new TextEncoder().encode(i);
+  }
+  hexToBytes(i) {
+    const o = i.startsWith("0x") ? i.slice(2) : i, l = new Uint8Array(o.length / 2);
+    for (let a = 0; a < l.length; a++)
+      l[a] = parseInt(o.substr(a * 2, 2), 16);
+    return l;
+  }
+  isHexString(i) {
+    const o = i.startsWith("0x") ? i.slice(2) : i;
+    return o.length > 0 && o.length % 2 === 0 && /^[0-9a-fA-F]+$/.test(o);
+  }
+  /**
+   * Export the encrypted payload and declaration metadata.
    */
   export() {
     return {
       identityRoot: this.identityRoot,
       publicKey: this.publicKey,
-      namespace: this.namespace,
       identityHash: this.identityHash,
-      declarations: this.declarations
+      declarations: this.declarations,
+      payload: this.payload
     };
   }
-  ptr(y) {
-    return { __pointer: y.signature };
+  /**
+   * Export and decrypt a specific branch using the currently active secret
+   * resolved for that path.
+   */
+  exportBranch(i) {
+    const o = i ? i.split(".").filter(Boolean) : [], l = o.join("."), a = this.resolveSecret(o), y = O(a), b = this.branchVersions[l]?.[y];
+    if (b) {
+      const p = this.decryptForPath(o, b);
+      return this.decryptTree(o, p);
+    }
+    const P = this.getSubPayload(o);
+    if (P !== void 0) {
+      if (typeof P == "string") {
+        const p = this.decryptForPath(o, P);
+        return this.decryptTree(o, p);
+      }
+      return this.decryptTree(o, P);
+    }
   }
 }
 export {
-  he as ME,
-  he as default
+  te as ME
 };