zkjson 0.8.4 → 0.8.6

package/.babelrc-cjs

@@ -0,0 +1,5 @@
+{
+  "presets": [
+    ["@babel/preset-env", { "modules": "commonjs" }]
+  ]
+}

package/.babelrc-esm

@@ -0,0 +1,5 @@
+{
+  "presets": [
+    ["@babel/preset-env", { "modules": false }]
+  ]
+}

package/README.md

@@ -0,0 +1,32 @@
+# WeaveDB SDK
+
+## Install
+
+```bash
+yarn add wdb-sdk
+```
+## Usage
+
+```js
+import { DB } from "wdb-sdk"
+
+const hostname = "http://34.18.53.73"
+//const id = "Npiag-iJQJEv2fiZhrSgMJJ1FujBL_6ElmNdIE3pd6Y"
+const port = `${hostname}:6363`
+const hb = `${hostname}:10001`
+
+const db = new DB({ port, hb, jwk, id })
+
+const pid = await db.spawn()
+
+await db.mkdir({
+  name: "users",
+  schema: { type: "object", required: ["name", "age"] },
+  auth: [["set:user,add:user,update:user,upsert:user,del:user", [["allow()"]]]],
+})
+
+await db.set("set:user", { name: "Bob", age: 20 }, "users", "bob")
+await db.set("set:user", { name: "Alice", age: 30 }, "users", "alice")
+
+const users = await db.get("users")
+```

package/make.js

@@ -0,0 +1,17 @@
+import { writeFileSync, readFileSync } from "fs"
+import { resolve } from "path"
+
+const packageJson = resolve(import.meta.dirname, "package.json")
+const packageJsonDist = resolve(import.meta.dirname, "dist/package.json")
+const packageJsonDist2 = resolve(import.meta.dirname, "dist/esm/package.json")
+const json = JSON.parse(readFileSync(packageJson, "utf8"))
+delete json.type
+delete json.scripts
+json.main = "cjs/index.js"
+json.module = "esm/index.js"
+
+writeFileSync(packageJsonDist, JSON.stringify(json, undefined, 2))
+
+const json2 = { type: "module" }
+
+writeFileSync(packageJsonDist2, JSON.stringify(json2, undefined, 2))

package/package.json

@@ -1,7 +1,12 @@
 {
   "name": "zkjson",
-  "version": "0.8.4",
+  "version": "0.8.6",
   "description": "Zero Knowledge Provable JSON",
+  "type": "module",
+  "scripts": {
+    "build:cjs": "babel src --out-dir dist/cjs --config-file ./.babelrc-cjs",
+    "build": "rm -rf dist && npm run build:cjs && cp src -rf dist/esm && node make.js && cp .npmignore dist/"
+  },
   "exports": {
     ".": {
       "require": "./cjs/index.js",
@@ -29,7 +34,5 @@
     "@babel/core": "^7.25.2",
     "@babel/plugin-transform-modules-commonjs": "^7.24.8",
     "@babel/preset-env": "^7.25.3"
-  },
-  "main": "cjs/index.js",
-  "module": "esm/index.js"
-}
+  }
+}

package/cjs/circomlibjs/SMT.js

@@ -1,481 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports["default"] = void 0;
-var ffjavascript = _interopRequireWildcard(require("ffjavascript"));
-var _buildPoseidon = _interopRequireDefault(require("./buildPoseidon.js"));
-var _ramda = require("ramda");
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
-function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function _interopRequireWildcard(e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, "default": e }; if (null === e || "object" != _typeof(e) && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (var _t in e) "default" !== _t && {}.hasOwnProperty.call(e, _t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, _t)) && (i.get || i.set) ? o(f, _t, i) : f[_t] = e[_t]); return f; })(e, t); }
-function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
-function _regenerator() { /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */ var e, t, r = "function" == typeof Symbol ? Symbol : {}, n = r.iterator || "@@iterator", o = r.toStringTag || "@@toStringTag"; function i(r, n, o, i) { var c = n && n.prototype instanceof Generator ? n : Generator, u = Object.create(c.prototype); return _regeneratorDefine2(u, "_invoke", function (r, n, o) { var i, c, u, f = 0, p = o || [], y = !1, G = { p: 0, n: 0, v: e, a: d, f: d.bind(e, 4), d: function d(t, r) { return i = t, c = 0, u = e, G.n = r, a; } }; function d(r, n) { for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) { var o, i = p[t], d = G.p, l = i[2]; r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0)); } if (o || r > 1) return a; throw y = !0, n; } return function (o, p, l) { if (f > 1) throw TypeError("Generator is already running"); for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) { i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u); try { if (f = 2, i) { if (c || (o = "next"), t = i[o]) { if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object"); if (!t.done) return t; u = t.value, c < 2 && (c = 0); } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1); i = e; } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break; } catch (t) { i = e, c = 1, u = t; } finally { f = 1; } } return { value: t, done: y }; }; }(r, o, i), !0), u; } var a = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} t = Object.getPrototypeOf; var c = [][n] ? t(t([][n]())) : (_regeneratorDefine2(t = {}, n, function () { return this; }), t), u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c); function f(e) { return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine2(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e; } return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine2(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine2(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine2(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine2(u), _regeneratorDefine2(u, o, "Generator"), _regeneratorDefine2(u, n, function () { return this; }), _regeneratorDefine2(u, "toString", function () { return "[object Generator]"; }), (_regenerator = function _regenerator() { return { w: i, m: f }; })(); }
-function _regeneratorDefine2(e, r, n, t) { var i = Object.defineProperty; try { i({}, "", {}); } catch (e) { i = 0; } _regeneratorDefine2 = function _regeneratorDefine(e, r, n, t) { if (r) i ? i(e, r, { value: n, enumerable: !t, configurable: !t, writable: !t }) : e[r] = n;else { var o = function o(r, n) { _regeneratorDefine2(e, r, function (e) { return this._invoke(r, n, e); }); }; o("next", 0), o("throw", 1), o("return", 2); } }, _regeneratorDefine2(e, r, n, t); }
-function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
-function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
-function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
-function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
-function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
-function _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function"); }
-function _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }
-function _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", { writable: !1 }), e; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : i + ""; }
-function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-var SMT = exports["default"] = /*#__PURE__*/function () {
-  function SMT(db, root, hash0, hash1, F) {
-    _classCallCheck(this, SMT);
-    this.db = db;
-    this.root = root;
-    this.hash0 = hash0;
-    this.hash1 = hash1;
-    this.F = F;
-  }
-  return _createClass(SMT, [{
-    key: "_splitBits",
-    value: function _splitBits(_key) {
-      var F = this.F;
-      var res = ffjavascript.Scalar.bits(F.toObject(_key));
-      while (res.length < 256) res.push(false);
-      return res;
-    }
-  }, {
-    key: "update",
-    value: function () {
-      var _update = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee(_key, _newValue) {
-        var _this$poseidon, _this$zero;
-        var _hash_value, _iterator, _step, v, value, newValue, F, key, resFind, res, ins, dels, rtOld, rtNew, keyBits, level, oldNode, newNode, sibling;
-        return _regenerator().w(function (_context) {
-          while (1) switch (_context.n) {
-            case 0:
-              if (!((_this$poseidon = this.poseidon) !== null && _this$poseidon !== void 0)) {
-                _context.n = 1;
-                break;
-              }
-              _this$poseidon;
-              _context.n = 3;
-              break;
-            case 1:
-              _context.n = 2;
-              return (0, _buildPoseidon["default"])();
-            case 2:
-              this.poseidon = _context.v;
-            case 3:
-              (_this$zero = this.zero) !== null && _this$zero !== void 0 ? _this$zero : this.zero = this.poseidon(["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"]);
-              _hash_value = _newValue;
-              if (_newValue.length === 256) {
-                _hash_value = [];
-                _iterator = _createForOfIteratorHelper((0, _ramda.splitEvery)(16, _newValue));
-                try {
-                  for (_iterator.s(); !(_step = _iterator.n()).done;) {
-                    v = _step.value;
-                    value = v.join("") === "0000000000000000" ? this.zero : this.poseidon(v);
-                    _hash_value.push(value);
-                  }
-                } catch (err) {
-                  _iterator.e(err);
-                } finally {
-                  _iterator.f();
-                }
-              }
-              newValue = this.poseidon(_hash_value);
-              F = this.F;
-              key = F.e(_key);
-              _context.n = 4;
-              return this.find(key);
-            case 4:
-              resFind = _context.v;
-              res = {};
-              res.oldRoot = this.root;
-              res.oldKey = key;
-              res.oldValue = resFind.foundValue;
-              res.newKey = key;
-              res.newValue = newValue;
-              res.siblings = resFind.siblings;
-              ins = [];
-              dels = [];
-              rtOld = this.hash1(key, resFind.foundValue);
-              rtNew = this.hash1(key, newValue);
-              ins.push([rtNew, [1, key, newValue]]);
-              dels.push(rtOld);
-              keyBits = this._splitBits(key);
-              for (level = resFind.siblings.length - 1; level >= 0; level--) {
-                oldNode = void 0, newNode = void 0;
-                sibling = resFind.siblings[level];
-                if (keyBits[level]) {
-                  oldNode = [sibling, rtOld];
-                  newNode = [sibling, rtNew];
-                } else {
-                  oldNode = [rtOld, sibling];
-                  newNode = [rtNew, sibling];
-                }
-                rtOld = this.hash0(oldNode[0], oldNode[1]);
-                rtNew = this.hash0(newNode[0], newNode[1]);
-                dels.push(rtOld);
-                ins.push([rtNew, newNode]);
-              }
-              res.newRoot = rtNew;
-              _context.n = 5;
-              return this.db.multiDel(dels);
-            case 5:
-              _context.n = 6;
-              return this.db.multiIns(ins);
-            case 6:
-              _context.n = 7;
-              return this.db.setRoot(rtNew);
-            case 7:
-              this.root = rtNew;
-              return _context.a(2, res);
-          }
-        }, _callee, this);
-      }));
-      function update(_x, _x2) {
-        return _update.apply(this, arguments);
-      }
-      return update;
-    }()
-  }, {
-    key: "delete",
-    value: function () {
-      var _delete2 = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee2(_key) {
-        var F, key, resFind, res, dels, ins, rtOld, rtNew, mixed, record, keyBits, level, newSibling, oldSibling, newNode;
-        return _regenerator().w(function (_context2) {
-          while (1) switch (_context2.n) {
-            case 0:
-              F = this.F;
-              key = F.e(_key);
-              _context2.n = 1;
-              return this.find(key);
-            case 1:
-              resFind = _context2.v;
-              if (resFind.found) {
-                _context2.n = 2;
-                break;
-              }
-              throw new Error("Key does not exists");
-            case 2:
-              res = {
-                siblings: [],
-                delKey: key,
-                delValue: resFind.foundValue
-              };
-              dels = [];
-              ins = [];
-              rtOld = this.hash1(key, resFind.foundValue);
-              dels.push(rtOld);
-              if (!(resFind.siblings.length > 0)) {
-                _context2.n = 7;
-                break;
-              }
-              _context2.n = 3;
-              return this.db.get(resFind.siblings[resFind.siblings.length - 1]);
-            case 3:
-              record = _context2.v;
-              if (!(record.length == 3 && F.eq(record[0], F.one))) {
-                _context2.n = 4;
-                break;
-              }
-              mixed = false;
-              res.oldKey = record[1];
-              res.oldValue = record[2];
-              res.isOld0 = false;
-              rtNew = resFind.siblings[resFind.siblings.length - 1];
-              _context2.n = 6;
-              break;
-            case 4:
-              if (!(record.length == 2)) {
-                _context2.n = 5;
-                break;
-              }
-              mixed = true;
-              res.oldKey = key;
-              res.oldValue = F.zero;
-              res.isOld0 = true;
-              rtNew = F.zero;
-              _context2.n = 6;
-              break;
-            case 5:
-              throw new Error("Invalid node. Database corrupted");
-            case 6:
-              _context2.n = 8;
-              break;
-            case 7:
-              rtNew = F.zero;
-              res.oldKey = key;
-              res.oldValue = F.zero;
-              res.isOld0 = true;
-            case 8:
-              keyBits = this._splitBits(key);
-              for (level = resFind.siblings.length - 1; level >= 0; level--) {
-                newSibling = resFind.siblings[level];
-                if (level == resFind.siblings.length - 1 && !res.isOld0) {
-                  newSibling = F.zero;
-                }
-                oldSibling = resFind.siblings[level];
-                if (keyBits[level]) {
-                  rtOld = this.hash0(oldSibling, rtOld);
-                } else {
-                  rtOld = this.hash0(rtOld, oldSibling);
-                }
-                dels.push(rtOld);
-                if (!F.isZero(newSibling)) {
-                  mixed = true;
-                }
-                if (mixed) {
-                  res.siblings.unshift(resFind.siblings[level]);
-                  newNode = void 0;
-                  if (keyBits[level]) {
-                    newNode = [newSibling, rtNew];
-                  } else {
-                    newNode = [rtNew, newSibling];
-                  }
-                  rtNew = this.hash0(newNode[0], newNode[1]);
-                  ins.push([rtNew, newNode]);
-                }
-              }
-              _context2.n = 9;
-              return this.db.multiIns(ins);
-            case 9:
-              _context2.n = 10;
-              return this.db.setRoot(rtNew);
-            case 10:
-              this.root = rtNew;
-              _context2.n = 11;
-              return this.db.multiDel(dels);
-            case 11:
-              res.newRoot = rtNew;
-              res.oldRoot = rtOld;
-              return _context2.a(2, res);
-          }
-        }, _callee2, this);
-      }));
-      function _delete(_x3) {
-        return _delete2.apply(this, arguments);
-      }
-      return _delete;
-    }()
-  }, {
-    key: "insert",
-    value: function () {
-      var _insert = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee3(_key, _value) {
-        var _this$poseidon2, _this$zero2;
-        var _hash_value, _iterator2, _step2, v, _value2, value, F, key, addedOne, res, newKeyBits, rtOld, resFind, mixed, oldKeyits, i, inserts, dels, rt, _i, oldSibling, newRt;
-        return _regenerator().w(function (_context3) {
-          while (1) switch (_context3.n) {
-            case 0:
-              if (!((_this$poseidon2 = this.poseidon) !== null && _this$poseidon2 !== void 0)) {
-                _context3.n = 1;
-                break;
-              }
-              _this$poseidon2;
-              _context3.n = 3;
-              break;
-            case 1:
-              _context3.n = 2;
-              return (0, _buildPoseidon["default"])();
-            case 2:
-              this.poseidon = _context3.v;
-            case 3:
-              (_this$zero2 = this.zero) !== null && _this$zero2 !== void 0 ? _this$zero2 : this.zero = this.poseidon(["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"]);
-              _hash_value = _value;
-              if (_value.length === 256) {
-                _hash_value = [];
-                _iterator2 = _createForOfIteratorHelper((0, _ramda.splitEvery)(16, _value));
-                try {
-                  for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-                    v = _step2.value;
-                    _value2 = v.join("") === "0000000000000000" ? this.zero : this.poseidon(v);
-                    _hash_value.push(_value2);
-                  }
-                } catch (err) {
-                  _iterator2.e(err);
-                } finally {
-                  _iterator2.f();
-                }
-              }
-              value = this.poseidon(_hash_value);
-              F = this.F;
-              key = F.e(_key);
-              addedOne = false;
-              res = {};
-              res.oldRoot = this.root;
-              newKeyBits = this._splitBits(key);
-              _context3.n = 4;
-              return this.find(key);
-            case 4:
-              resFind = _context3.v;
-              if (!resFind.found) {
-                _context3.n = 5;
-                break;
-              }
-              throw new Error("Key already exists");
-            case 5:
-              res.siblings = resFind.siblings;
-              if (!resFind.isOld0) {
-                oldKeyits = this._splitBits(resFind.notFoundKey);
-                for (i = res.siblings.length; oldKeyits[i] == newKeyBits[i]; i++) {
-                  res.siblings.push(F.zero);
-                }
-                rtOld = this.hash1(resFind.notFoundKey, resFind.notFoundValue);
-                res.siblings.push(rtOld);
-                addedOne = true;
-                mixed = false;
-              } else if (res.siblings.length > 0) {
-                mixed = true;
-                rtOld = F.zero;
-              }
-              inserts = [];
-              dels = [];
-              rt = this.hash1(key, value);
-              inserts.push([rt, [1, key, value]]);
-              for (_i = res.siblings.length - 1; _i >= 0; _i--) {
-                if (_i < res.siblings.length - 1 && !F.isZero(res.siblings[_i])) {
-                  mixed = true;
-                }
-                if (mixed) {
-                  oldSibling = resFind.siblings[_i];
-                  if (newKeyBits[_i]) {
-                    rtOld = this.hash0(oldSibling, rtOld);
-                  } else {
-                    rtOld = this.hash0(rtOld, oldSibling);
-                  }
-                  dels.push(rtOld);
-                }
-                newRt = void 0;
-                if (newKeyBits[_i]) {
-                  newRt = this.hash0(res.siblings[_i], rt);
-                  inserts.push([newRt, [res.siblings[_i], rt]]);
-                } else {
-                  newRt = this.hash0(rt, res.siblings[_i]);
-                  inserts.push([newRt, [rt, res.siblings[_i]]]);
-                }
-                rt = newRt;
-              }
-              if (addedOne) res.siblings.pop();
-              while (res.siblings.length > 0 && F.isZero(res.siblings[res.siblings.length - 1])) {
-                res.siblings.pop();
-              }
-              res.oldKey = resFind.notFoundKey;
-              res.oldValue = resFind.notFoundValue;
-              res.newRoot = rt;
-              res.isOld0 = resFind.isOld0;
-              _context3.n = 6;
-              return this.db.multiIns(inserts);
-            case 6:
-              _context3.n = 7;
-              return this.db.setRoot(rt);
-            case 7:
-              this.root = rt;
-              _context3.n = 8;
-              return this.db.multiDel(dels);
-            case 8:
-              return _context3.a(2, res);
-          }
-        }, _callee3, this);
-      }));
-      function insert(_x4, _x5) {
-        return _insert.apply(this, arguments);
-      }
-      return insert;
-    }()
-  }, {
-    key: "find",
-    value: function () {
-      var _find2 = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee4(_key) {
-        var key, keyBits;
-        return _regenerator().w(function (_context4) {
-          while (1) switch (_context4.n) {
-            case 0:
-              key = this.F.e(_key);
-              keyBits = this._splitBits(key);
-              _context4.n = 1;
-              return this._find(key, keyBits, this.root, 0);
-            case 1:
-              return _context4.a(2, _context4.v);
-          }
-        }, _callee4, this);
-      }));
-      function find(_x6) {
-        return _find2.apply(this, arguments);
-      }
-      return find;
-    }()
-  }, {
-    key: "_find",
-    value: function () {
-      var _find3 = _asyncToGenerator(/*#__PURE__*/_regenerator().m(function _callee5(key, keyBits, root, level) {
-        var F, res, record;
-        return _regenerator().w(function (_context5) {
-          while (1) switch (_context5.n) {
-            case 0:
-              F = this.F;
-              if (typeof root === "undefined") root = this.root;
-              if (!F.isZero(root)) {
-                _context5.n = 1;
-                break;
-              }
-              res = {
-                found: false,
-                siblings: [],
-                notFoundKey: key,
-                notFoundValue: F.zero,
-                isOld0: true
-              };
-              return _context5.a(2, res);
-            case 1:
-              _context5.n = 2;
-              return this.db.get(root);
-            case 2:
-              record = _context5.v;
-              if (!(record.length == 3 && F.eq(record[0], F.one))) {
-                _context5.n = 3;
-                break;
-              }
-              if (F.eq(record[1], key)) {
-                res = {
-                  found: true,
-                  siblings: [],
-                  foundValue: record[2],
-                  isOld0: false
-                };
-              } else {
-                res = {
-                  found: false,
-                  siblings: [],
-                  notFoundKey: record[1],
-                  notFoundValue: record[2],
-                  isOld0: false
-                };
-              }
-              _context5.n = 7;
-              break;
-            case 3:
-              if (!(keyBits[level] == 0)) {
-                _context5.n = 5;
-                break;
-              }
-              _context5.n = 4;
-              return this._find(key, keyBits, record[0], level + 1);
-            case 4:
-              res = _context5.v;
-              res.siblings.unshift(record[1]);
-              _context5.n = 7;
-              break;
-            case 5:
-              _context5.n = 6;
-              return this._find(key, keyBits, record[1], level + 1);
-            case 6:
-              res = _context5.v;
-              res.siblings.unshift(record[0]);
-            case 7:
-              return _context5.a(2, res);
-          }
-        }, _callee5, this);
-      }));
-      function _find(_x7, _x8, _x9, _x0) {
-        return _find3.apply(this, arguments);
-      }
-      return _find;
-    }()
-  }]);
-}();