@taquito/timelock 24.3.0-beta.0 → 24.3.0-beta.2

package/dist/taquito-timelock.umd.js

@@ -1,326 +1,780 @@
 (function (global, factory) {
-  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@stablelib/nacl'), require('big-integer'), require('@stablelib/blake2b')) :
-  typeof define === 'function' && define.amd ? define(['exports', '@stablelib/nacl', 'big-integer', '@stablelib/blake2b'], factory) :
-  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.taquitoTimelock = {}, global.nacl, global.bigInt, global.blake2b));
-})(this, (function (exports, nacl, bigInt, blake2b) { 'use strict';
+    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@stablelib/nacl'), require('big-integer')) :
+    typeof define === 'function' && define.amd ? define(['exports', '@stablelib/nacl', 'big-integer'], factory) :
+    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.taquitoTimelock = {}, global.nacl, global.bigInt));
+})(this, (function (exports, nacl, bigInt) { 'use strict';
 
-  // globalThis.crypto is available in browsers and Node.js 20+
-  const defaultRNG$1 = globalThis.crypto;
-  const RSA_MODULUS = bigInt('25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357');
-  function rand(rng = defaultRNG$1) {
-      const bytes = new Uint8Array(4);
-      rng.getRandomValues(bytes);
-      const x = ((bytes[0] << 24) | (bytes[1] << 16) | (bytes[2] << 8) | bytes[3]) >>> 0;
-      return x / Math.pow(2, 32);
-  }
-  function randomInteger(rng, bits) {
-      const bytes = new Uint8Array(bits / 8);
-      rng.getRandomValues(bytes);
-      return bigInt.fromArray(Array.from(bytes), 256);
-  }
-  function nextPrime(n) {
-      if (n.compare(2) < 0) {
-          return bigInt(2);
-      }
-      const limit = n.multiply(2);
-      for (let p = n.next(); p.compare(limit) < 0; p = p.next()) {
-          // use 25 bases like in GMP mpz_nextprime and thus in Tezos
-          if (p.isProbablePrime(25, rand)) {
-              return p;
-          }
-      }
-      throw new Error('!!!nextPrime!!!'); // shouldn't happen
-  }
-  function generate(rng, mod) {
-      const m = mod.subtract(bigInt(2));
-      return randomInteger(rng, mod.bitLength().toJSNumber()).mod(m).add(bigInt(2));
-  }
-  function toLE(x) {
-      return x.toArray(256).value.reverse();
-  }
-  function fromLE(x) {
-      return bigInt.fromArray(x.reverse(), 256);
-  }
-  const HASH_SEPARATOR = [0xff, 0x00, 0xff, 0x00, 0xff, 0x00, 0xff, 0x00];
-  function hashToPrime(time, value, key, mod) {
-      const b = [
-          ...new TextEncoder().encode(String(time)),
-          ...HASH_SEPARATOR,
-          ...toLE(mod),
-          ...HASH_SEPARATOR,
-          ...toLE(value),
-          ...HASH_SEPARATOR,
-          ...toLE(key),
-      ];
-      const sum = blake2b.hash(new Uint8Array(b), 32, { key: new Uint8Array([32]) });
-      const val = fromLE(Array.from(sum));
-      return nextPrime(val);
-  }
-  function proveWesolowski(time, locked, unlocked, mod) {
-      const l = hashToPrime(time, locked, unlocked, mod);
-      let pi = bigInt(1);
-      let r = bigInt(1);
-      for (; time > 0; time -= 1) {
-          const rr = r.multiply(2);
-          r = rr.mod(l);
-          const pi2 = pi.multiply(pi).mod(mod);
-          if (rr.compare(l) >= 0) {
-              pi = pi2.multiply(locked);
-          }
-          else {
-              pi = pi2;
-          }
-      }
-      return pi.mod(mod);
-  }
-  function prove(time, locked, unlocked, mod = RSA_MODULUS) {
-      return new TimelockProof({
-          vdfTuple: new Timelock({
-              lockedValue: locked,
-              unlockedValue: unlocked,
-              vdfProof: proveWesolowski(time, locked, unlocked, mod),
-              modulus: mod,
-          }),
-          nonce: bigInt(1),
-      });
-  }
-  function unlockTimelock(time, locked, mod) {
-      if (locked.compare(bigInt(1)) <= 0) {
-          return locked;
-      }
-      let x = locked;
-      for (; time > 0; time -= 1) {
-          x = x.multiply(x).mod(mod);
-      }
-      return x;
-  }
-  function unlockAndProve(time, locked, mod = RSA_MODULUS) {
-      const unlocked = unlockTimelock(time, locked, mod);
-      return prove(time, locked, unlocked, mod);
-  }
-  function verifyWesolowski(vdfTuple, time) {
-      const l = hashToPrime(time, vdfTuple.lockedValue, vdfTuple.unlockedValue, vdfTuple.modulus);
-      const ll = vdfTuple.vdfProof.modPow(l, vdfTuple.modulus);
-      const r = bigInt(2).modPow(time, l);
-      const rr = vdfTuple.lockedValue.modPow(r, vdfTuple.modulus);
-      const unlocked = ll.multiply(rr).mod(vdfTuple.modulus);
-      return unlocked.compare(vdfTuple.unlockedValue) === 0;
-  }
-  function verify(locked, proof, time) {
-      const randomizedChallenge = proof.vdfTuple.lockedValue.modPow(proof.nonce, proof.vdfTuple.modulus);
-      return randomizedChallenge.compare(locked) === 0 && verifyWesolowski(proof.vdfTuple, time);
-  }
-  class Timelock {
-      constructor({ lockedValue, unlockedValue, vdfProof, modulus }) {
-          this.lockedValue = lockedValue;
-          this.unlockedValue = unlockedValue;
-          this.vdfProof = vdfProof;
-          this.modulus = modulus ?? RSA_MODULUS;
-      }
-      static precompute(time, mod = RSA_MODULUS, rng = defaultRNG$1) {
-          const locked = generate(rng, mod);
-          const unlocked = unlockTimelock(time, locked, mod);
-          return new Timelock({
-              lockedValue: locked,
-              unlockedValue: unlocked,
-              vdfProof: proveWesolowski(time, locked, unlocked, mod),
-              modulus: mod,
-          });
-      }
-      getProof(time, rng = defaultRNG$1) {
-          if (this.lockedValue.compare(bigInt(1)) < 1 ||
-              this.unlockedValue.compare(bigInt(0)) < 1 ||
-              this.vdfProof.compare(bigInt(0)) < 1 ||
-              this.lockedValue.compare(this.modulus) > 0 ||
-              this.unlockedValue.compare(this.modulus) > 0 ||
-              this.vdfProof.compare(this.modulus) >= 0) {
-              throw new Error('Invalid argument');
-          }
-          if (!verifyWesolowski(this, time)) {
-              throw new Error('Verification error');
-          }
-          const nonce = randomInteger(rng, 16 * 8);
-          const lockedValue = this.lockedValue.modPow(nonce, this.modulus);
-          return {
-              lockedValue,
-              proof: new TimelockProof({
-                  vdfTuple: this,
-                  nonce,
-              }),
-          };
-      }
-      encode() {
-          return new Uint8Array([
-              ...encodeBigInt(this.lockedValue),
-              ...encodeBigInt(this.unlockedValue),
-              ...encodeBigInt(this.vdfProof),
-          ]);
-      }
-      static fromArray(buf, mod = RSA_MODULUS) {
-          let i = 0;
-          const [lockedValue, n1] = decodeBigInt(buf);
-          i += n1;
-          const [unlockedValue, n2] = decodeBigInt(buf.slice(i));
-          i += n2;
-          const [vdfProof, n3] = decodeBigInt(buf.slice(i));
-          i += n3;
-          return [
-              new Timelock({
-                  lockedValue,
-                  unlockedValue,
-                  vdfProof,
-                  modulus: mod,
-              }),
-              i,
-          ];
-      }
-  }
-  const KDF_KEY = new TextEncoder().encode('Tezoskdftimelockv1');
-  class TimelockProof {
-      constructor({ vdfTuple, nonce }) {
-          this.vdfTuple = vdfTuple;
-          this.nonce = nonce;
-      }
-      symmetricKey() {
-          const updated = this.vdfTuple.unlockedValue.modPow(this.nonce, this.vdfTuple.modulus);
-          return blake2b.hash(new TextEncoder().encode(String(updated)), 32, { key: KDF_KEY });
-      }
-      encode() {
-          return new Uint8Array([...this.vdfTuple.encode(), ...encodeBigInt(this.nonce)]);
-      }
-      static fromArray(buf, mod = RSA_MODULUS) {
-          let i = 0;
-          const [vdfTuple, n1] = Timelock.fromArray(buf, mod);
-          i += n1;
-          const [nonce, n2] = decodeBigInt(buf.slice(i));
-          i += n2;
-          return [new TimelockProof({ vdfTuple, nonce }), i];
-      }
-  }
-  function encodeBigInt(v) {
-      if (v.isNegative()) {
-          throw new Error('Negative value');
-      }
-      const res = [];
-      for (let i = 0;; i++) {
-          const x = v.and(bigInt(0x7f)).toJSNumber();
-          v = v.shiftRight(7);
-          if (!v.isZero()) {
-              res.push(x | 0x80);
-          }
-          else {
-              res.push(x);
-              break;
-          }
-      }
-      return res;
-  }
-  function decodeBigInt(buf) {
-      let shift = 0;
-      let i = 0;
-      let res = bigInt(0);
-      while (i < buf.length) {
-          const x = buf[i];
-          res = res.add(bigInt(x & 0x7f).shiftLeft(shift));
-          shift += 7;
-          i++;
-          if ((x & 0x80) === 0)
-              break;
-      }
-      return [res, i];
-  }
+    /**
+     * Utilities for hex, bytes, CSPRNG.
+     * @module
+     */
+    /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+    /** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */
+    function isBytes(a) {
+        return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');
+    }
+    /** Asserts something is positive integer. */
+    function anumber(n, title = '') {
+        if (!Number.isSafeInteger(n) || n < 0) {
+            const prefix = title && `"${title}" `;
+            throw new Error(`${prefix}expected integer >= 0, got ${n}`);
+        }
+    }
+    /** Asserts something is Uint8Array. */
+    function abytes(value, length, title = '') {
+        const bytes = isBytes(value);
+        const len = value?.length;
+        const needsLen = length !== undefined;
+        if (!bytes || (needsLen && len !== length)) {
+            const prefix = title && `"${title}" `;
+            const ofLen = needsLen ? ` of length ${length}` : '';
+            const got = bytes ? `length=${len}` : `type=${typeof value}`;
+            throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);
+        }
+        return value;
+    }
+    /** Asserts a hash instance has not been destroyed / finished */
+    function aexists(instance, checkFinished = true) {
+        if (instance.destroyed)
+            throw new Error('Hash instance has been destroyed');
+        if (checkFinished && instance.finished)
+            throw new Error('Hash#digest() has already been called');
+    }
+    /** Asserts output is properly-sized byte array */
+    function aoutput(out, instance) {
+        abytes(out, undefined, 'digestInto() output');
+        const min = instance.outputLen;
+        if (out.length < min) {
+            throw new Error('"digestInto() output" expected to be of length >=' + min);
+        }
+    }
+    /** Cast u8 / u16 / u32 to u32. */
+    function u32(arr) {
+        return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));
+    }
+    /** Zeroize a byte array. Warning: JS provides no guarantees. */
+    function clean(...arrays) {
+        for (let i = 0; i < arrays.length; i++) {
+            arrays[i].fill(0);
+        }
+    }
+    /** Is current platform little-endian? Most are. Big-Endian platform: IBM */
+    const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();
+    /** The byte swap operation for uint32 */
+    function byteSwap(word) {
+        return (((word << 24) & 0xff000000) |
+            ((word << 8) & 0xff0000) |
+            ((word >>> 8) & 0xff00) |
+            ((word >>> 24) & 0xff));
+    }
+    /** Conditionally byte swap if on a big-endian platform */
+    const swap8IfBE = isLE
+        ? (n) => n
+        : (n) => byteSwap(n);
+    /** In place byte swap for Uint32Array */
+    function byteSwap32(arr) {
+        for (let i = 0; i < arr.length; i++) {
+            arr[i] = byteSwap(arr[i]);
+        }
+        return arr;
+    }
+    const swap32IfBE = isLE
+        ? (u) => u
+        : byteSwap32;
+    /** Creates function with outputLen, blockLen, create properties from a class constructor. */
+    function createHasher(hashCons, info = {}) {
+        const hashC = (msg, opts) => hashCons(opts).update(msg).digest();
+        const tmp = hashCons(undefined);
+        hashC.outputLen = tmp.outputLen;
+        hashC.blockLen = tmp.blockLen;
+        hashC.create = (opts) => hashCons(opts);
+        Object.assign(hashC, info);
+        return Object.freeze(hashC);
+    }
 
-  // globalThis.crypto is available in browsers and Node.js 20+
-  const defaultRNG = globalThis.crypto;
-  class ChestKey extends TimelockProof {
-  }
-  function encrypt(key, text, rng = defaultRNG) {
-      const nonce = new Uint8Array(24);
-      rng.getRandomValues(nonce);
-      const payload = nacl.secretBox(key, nonce, text);
-      return {
-          payload,
-          nonce,
-      };
-  }
-  function decrypt(key, c) {
-      return nacl.openSecretBox(key, c.nonce, c.payload);
-  }
-  class Chest {
-      constructor({ lockedValue, cipherText }) {
-          this.lockedValue = lockedValue;
-          this.cipherText = cipherText;
-      }
-      static newChestAndKey(payload, time, mod, rng) {
-          if (time <= 0) {
-              throw new Error('Invalid argument');
-          }
-          const vdfTuple = Timelock.precompute(time, mod, rng);
-          return Chest.fromTimelock(payload, time, vdfTuple, rng);
-      }
-      static fromTimelock(payload, time, timelock, rng) {
-          if (time <= 0) {
-              throw new Error('Invalid argument');
-          }
-          const { lockedValue, proof } = timelock.getProof(time, rng);
-          const symKey = proof.symmetricKey();
-          const cipherText = encrypt(symKey, payload, rng);
-          return { chest: new Chest({ lockedValue, cipherText }), key: proof };
-      }
-      newKey(time, mod) {
-          if (time <= 0) {
-              throw new Error('Invalid argument');
-          }
-          return unlockAndProve(time, this.lockedValue, mod);
-      }
-      open(key, time) {
-          if (time <= 0) {
-              throw new Error('Invalid argument');
-          }
-          if (!verify(this.lockedValue, key, time)) {
-              return null;
-          }
-          const symKey = key.symmetricKey();
-          return decrypt(symKey, this.cipherText);
-      }
-      encode() {
-          const locked = encodeBigInt(this.lockedValue);
-          const res = new Uint8Array(locked.length + 24 + 4 + this.cipherText.payload.length);
-          res.set(locked);
-          let off = locked.length;
-          res.set(this.cipherText.nonce, off);
-          off += 24;
-          new DataView(res.buffer, res.byteOffset, res.byteLength).setUint32(off, this.cipherText.payload.length);
-          off += 4;
-          res.set(this.cipherText.payload, off);
-          return res;
-      }
-      static fromArray(buf) {
-          let i = 0;
-          const [lockedValue, n] = decodeBigInt(buf);
-          i += n;
-          if (buf.length - i < 24 + 4) {
-              throw new Error('Buffer is too short');
-          }
-          const nonce = new Uint8Array(buf.slice(i, i + 24));
-          i += 24;
-          const len = new DataView(buf.buffer, buf.byteOffset, buf.byteLength).getUint32(i);
-          i += 4;
-          if (buf.length - i < len) {
-              throw new Error('Buffer is too short');
-          }
-          const payload = new Uint8Array(buf.slice(i, i + len));
-          i += len;
-          return [new Chest({ lockedValue, cipherText: { nonce, payload } }), i];
-      }
-  }
+    /**
+     * Internal helpers for blake hash.
+     * @module
+     */
+    /**
+     * Internal blake variable.
+     * For BLAKE2b, the two extra permutations for rounds 10 and 11 are SIGMA[10..11] = SIGMA[0..1].
+     */
+    // prettier-ignore
+    const BSIGMA = /* @__PURE__ */ Uint8Array.from([
+        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
+        14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,
+        11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,
+        7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,
+        9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,
+        2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,
+        12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,
+        13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,
+        6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,
+        10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,
+        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
+        14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,
+        // Blake1, unused in others
+        11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,
+        7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,
+        9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,
+        2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,
+    ]);
 
-  exports.Chest = Chest;
-  exports.ChestKey = ChestKey;
-  exports.Timelock = Timelock;
-  exports.TimelockProof = TimelockProof;
-  exports.decrypt = decrypt;
-  exports.encrypt = encrypt;
+    /**
+     * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.
+     * @todo re-check https://issues.chromium.org/issues/42212588
+     * @module
+     */
+    const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);
+    const _32n = /* @__PURE__ */ BigInt(32);
+    function fromBig(n, le = false) {
+        if (le)
+            return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };
+        return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };
+    }
+    // Right rotate for Shift in [1, 32)
+    const rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));
+    const rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);
+    // Right rotate for Shift in (32, 64), NOTE: 32 is special case.
+    const rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));
+    const rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));
+    // Right rotate for shift===32 (just swaps l&h)
+    const rotr32H = (_h, l) => l;
+    const rotr32L = (h, _l) => h;
+    // JS uses 32-bit signed integers for bitwise operations which means we cannot
+    // simple take carry out of low bit sum by shift, we need to use division.
+    function add(Ah, Al, Bh, Bl) {
+        const l = (Al >>> 0) + (Bl >>> 0);
+        return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };
+    }
+    // Addition with more than 2 elements
+    const add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);
+    const add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;
+
+    /**
+     * blake2b (64-bit) & blake2s (8 to 32-bit) hash functions.
+     * b could have been faster, but there is no fast u64 in js, so s is 1.5x faster.
+     * @module
+     */
+    // Same as SHA512_IV, but swapped endianness: LE instead of BE. iv[1] is iv[0], etc.
+    const B2B_IV = /* @__PURE__ */ Uint32Array.from([
+        0xf3bcc908, 0x6a09e667, 0x84caa73b, 0xbb67ae85, 0xfe94f82b, 0x3c6ef372, 0x5f1d36f1, 0xa54ff53a,
+        0xade682d1, 0x510e527f, 0x2b3e6c1f, 0x9b05688c, 0xfb41bd6b, 0x1f83d9ab, 0x137e2179, 0x5be0cd19,
+    ]);
+    // Temporary buffer
+    const BBUF = /* @__PURE__ */ new Uint32Array(32);
+    // Mixing function G splitted in two halfs
+    function G1b(a, b, c, d, msg, x) {
+        // NOTE: V is LE here
+        const Xl = msg[x], Xh = msg[x + 1]; // prettier-ignore
+        let Al = BBUF[2 * a], Ah = BBUF[2 * a + 1]; // prettier-ignore
+        let Bl = BBUF[2 * b], Bh = BBUF[2 * b + 1]; // prettier-ignore
+        let Cl = BBUF[2 * c], Ch = BBUF[2 * c + 1]; // prettier-ignore
+        let Dl = BBUF[2 * d], Dh = BBUF[2 * d + 1]; // prettier-ignore
+        // v[a] = (v[a] + v[b] + x) | 0;
+        let ll = add3L(Al, Bl, Xl);
+        Ah = add3H(ll, Ah, Bh, Xh);
+        Al = ll | 0;
+        // v[d] = rotr(v[d] ^ v[a], 32)
+        ({ Dh, Dl } = { Dh: Dh ^ Ah, Dl: Dl ^ Al });
+        ({ Dh, Dl } = { Dh: rotr32H(Dh, Dl), Dl: rotr32L(Dh) });
+        // v[c] = (v[c] + v[d]) | 0;
+        ({ h: Ch, l: Cl } = add(Ch, Cl, Dh, Dl));
+        // v[b] = rotr(v[b] ^ v[c], 24)
+        ({ Bh, Bl } = { Bh: Bh ^ Ch, Bl: Bl ^ Cl });
+        ({ Bh, Bl } = { Bh: rotrSH(Bh, Bl, 24), Bl: rotrSL(Bh, Bl, 24) });
+        ((BBUF[2 * a] = Al), (BBUF[2 * a + 1] = Ah));
+        ((BBUF[2 * b] = Bl), (BBUF[2 * b + 1] = Bh));
+        ((BBUF[2 * c] = Cl), (BBUF[2 * c + 1] = Ch));
+        ((BBUF[2 * d] = Dl), (BBUF[2 * d + 1] = Dh));
+    }
+    function G2b(a, b, c, d, msg, x) {
+        // NOTE: V is LE here
+        const Xl = msg[x], Xh = msg[x + 1]; // prettier-ignore
+        let Al = BBUF[2 * a], Ah = BBUF[2 * a + 1]; // prettier-ignore
+        let Bl = BBUF[2 * b], Bh = BBUF[2 * b + 1]; // prettier-ignore
+        let Cl = BBUF[2 * c], Ch = BBUF[2 * c + 1]; // prettier-ignore
+        let Dl = BBUF[2 * d], Dh = BBUF[2 * d + 1]; // prettier-ignore
+        // v[a] = (v[a] + v[b] + x) | 0;
+        let ll = add3L(Al, Bl, Xl);
+        Ah = add3H(ll, Ah, Bh, Xh);
+        Al = ll | 0;
+        // v[d] = rotr(v[d] ^ v[a], 16)
+        ({ Dh, Dl } = { Dh: Dh ^ Ah, Dl: Dl ^ Al });
+        ({ Dh, Dl } = { Dh: rotrSH(Dh, Dl, 16), Dl: rotrSL(Dh, Dl, 16) });
+        // v[c] = (v[c] + v[d]) | 0;
+        ({ h: Ch, l: Cl } = add(Ch, Cl, Dh, Dl));
+        // v[b] = rotr(v[b] ^ v[c], 63)
+        ({ Bh, Bl } = { Bh: Bh ^ Ch, Bl: Bl ^ Cl });
+        ({ Bh, Bl } = { Bh: rotrBH(Bh, Bl, 63), Bl: rotrBL(Bh, Bl, 63) });
+        ((BBUF[2 * a] = Al), (BBUF[2 * a + 1] = Ah));
+        ((BBUF[2 * b] = Bl), (BBUF[2 * b + 1] = Bh));
+        ((BBUF[2 * c] = Cl), (BBUF[2 * c + 1] = Ch));
+        ((BBUF[2 * d] = Dl), (BBUF[2 * d + 1] = Dh));
+    }
+    function checkBlake2Opts(outputLen, opts = {}, keyLen, saltLen, persLen) {
+        anumber(keyLen);
+        if (outputLen < 0 || outputLen > keyLen)
+            throw new Error('outputLen bigger than keyLen');
+        const { key, salt, personalization } = opts;
+        if (key !== undefined && (key.length < 1 || key.length > keyLen))
+            throw new Error('"key" expected to be undefined or of length=1..' + keyLen);
+        if (salt !== undefined)
+            abytes(salt, saltLen, 'salt');
+        if (personalization !== undefined)
+            abytes(personalization, persLen, 'personalization');
+    }
+    /** Internal base class for BLAKE2. */
+    class _BLAKE2 {
+        buffer;
+        buffer32;
+        finished = false;
+        destroyed = false;
+        length = 0;
+        pos = 0;
+        blockLen;
+        outputLen;
+        constructor(blockLen, outputLen) {
+            anumber(blockLen);
+            anumber(outputLen);
+            this.blockLen = blockLen;
+            this.outputLen = outputLen;
+            this.buffer = new Uint8Array(blockLen);
+            this.buffer32 = u32(this.buffer);
+        }
+        update(data) {
+            aexists(this);
+            abytes(data);
+            // Main difference with other hashes: there is flag for last block,
+            // so we cannot process current block before we know that there
+            // is the next one. This significantly complicates logic and reduces ability
+            // to do zero-copy processing
+            const { blockLen, buffer, buffer32 } = this;
+            const len = data.length;
+            const offset = data.byteOffset;
+            const buf = data.buffer;
+            for (let pos = 0; pos < len;) {
+                // If buffer is full and we still have input (don't process last block, same as blake2s)
+                if (this.pos === blockLen) {
+                    swap32IfBE(buffer32);
+                    this.compress(buffer32, 0, false);
+                    swap32IfBE(buffer32);
+                    this.pos = 0;
+                }
+                const take = Math.min(blockLen - this.pos, len - pos);
+                const dataOffset = offset + pos;
+                // full block && aligned to 4 bytes && not last in input
+                if (take === blockLen && !(dataOffset % 4) && pos + take < len) {
+                    const data32 = new Uint32Array(buf, dataOffset, Math.floor((len - pos) / 4));
+                    swap32IfBE(data32);
+                    for (let pos32 = 0; pos + blockLen < len; pos32 += buffer32.length, pos += blockLen) {
+                        this.length += blockLen;
+                        this.compress(data32, pos32, false);
+                    }
+                    swap32IfBE(data32);
+                    continue;
+                }
+                buffer.set(data.subarray(pos, pos + take), this.pos);
+                this.pos += take;
+                this.length += take;
+                pos += take;
+            }
+            return this;
+        }
+        digestInto(out) {
+            aexists(this);
+            aoutput(out, this);
+            const { pos, buffer32 } = this;
+            this.finished = true;
+            // Padding
+            clean(this.buffer.subarray(pos));
+            swap32IfBE(buffer32);
+            this.compress(buffer32, 0, true);
+            swap32IfBE(buffer32);
+            const out32 = u32(out);
+            this.get().forEach((v, i) => (out32[i] = swap8IfBE(v)));
+        }
+        digest() {
+            const { buffer, outputLen } = this;
+            this.digestInto(buffer);
+            const res = buffer.slice(0, outputLen);
+            this.destroy();
+            return res;
+        }
+        _cloneInto(to) {
+            const { buffer, length, finished, destroyed, outputLen, pos } = this;
+            to ||= new this.constructor({ dkLen: outputLen });
+            to.set(...this.get());
+            to.buffer.set(buffer);
+            to.destroyed = destroyed;
+            to.finished = finished;
+            to.length = length;
+            to.pos = pos;
+            // @ts-ignore
+            to.outputLen = outputLen;
+            return to;
+        }
+        clone() {
+            return this._cloneInto();
+        }
+    }
+    /** Internal blake2b hash class. */
+    class _BLAKE2b extends _BLAKE2 {
+        // Same as SHA-512, but LE
+        v0l = B2B_IV[0] | 0;
+        v0h = B2B_IV[1] | 0;
+        v1l = B2B_IV[2] | 0;
+        v1h = B2B_IV[3] | 0;
+        v2l = B2B_IV[4] | 0;
+        v2h = B2B_IV[5] | 0;
+        v3l = B2B_IV[6] | 0;
+        v3h = B2B_IV[7] | 0;
+        v4l = B2B_IV[8] | 0;
+        v4h = B2B_IV[9] | 0;
+        v5l = B2B_IV[10] | 0;
+        v5h = B2B_IV[11] | 0;
+        v6l = B2B_IV[12] | 0;
+        v6h = B2B_IV[13] | 0;
+        v7l = B2B_IV[14] | 0;
+        v7h = B2B_IV[15] | 0;
+        constructor(opts = {}) {
+            const olen = opts.dkLen === undefined ? 64 : opts.dkLen;
+            super(128, olen);
+            checkBlake2Opts(olen, opts, 64, 16, 16);
+            let { key, personalization, salt } = opts;
+            let keyLength = 0;
+            if (key !== undefined) {
+                abytes(key, undefined, 'key');
+                keyLength = key.length;
+            }
+            this.v0l ^= this.outputLen | (keyLength << 8) | (0x01 << 16) | (0x01 << 24);
+            if (salt !== undefined) {
+                abytes(salt, undefined, 'salt');
+                const slt = u32(salt);
+                this.v4l ^= swap8IfBE(slt[0]);
+                this.v4h ^= swap8IfBE(slt[1]);
+                this.v5l ^= swap8IfBE(slt[2]);
+                this.v5h ^= swap8IfBE(slt[3]);
+            }
+            if (personalization !== undefined) {
+                abytes(personalization, undefined, 'personalization');
+                const pers = u32(personalization);
+                this.v6l ^= swap8IfBE(pers[0]);
+                this.v6h ^= swap8IfBE(pers[1]);
+                this.v7l ^= swap8IfBE(pers[2]);
+                this.v7h ^= swap8IfBE(pers[3]);
+            }
+            if (key !== undefined) {
+                // Pad to blockLen and update
+                const tmp = new Uint8Array(this.blockLen);
+                tmp.set(key);
+                this.update(tmp);
+            }
+        }
+        // prettier-ignore
+        get() {
+            let { v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h } = this;
+            return [v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h];
+        }
+        // prettier-ignore
+        set(v0l, v0h, v1l, v1h, v2l, v2h, v3l, v3h, v4l, v4h, v5l, v5h, v6l, v6h, v7l, v7h) {
+            this.v0l = v0l | 0;
+            this.v0h = v0h | 0;
+            this.v1l = v1l | 0;
+            this.v1h = v1h | 0;
+            this.v2l = v2l | 0;
+            this.v2h = v2h | 0;
+            this.v3l = v3l | 0;
+            this.v3h = v3h | 0;
+            this.v4l = v4l | 0;
+            this.v4h = v4h | 0;
+            this.v5l = v5l | 0;
+            this.v5h = v5h | 0;
+            this.v6l = v6l | 0;
+            this.v6h = v6h | 0;
+            this.v7l = v7l | 0;
+            this.v7h = v7h | 0;
+        }
+        compress(msg, offset, isLast) {
+            this.get().forEach((v, i) => (BBUF[i] = v)); // First half from state.
+            BBUF.set(B2B_IV, 16); // Second half from IV.
+            let { h, l } = fromBig(BigInt(this.length));
+            BBUF[24] = B2B_IV[8] ^ l; // Low word of the offset.
+            BBUF[25] = B2B_IV[9] ^ h; // High word.
+            // Invert all bits for last block
+            if (isLast) {
+                BBUF[28] = ~BBUF[28];
+                BBUF[29] = ~BBUF[29];
+            }
+            let j = 0;
+            const s = BSIGMA;
+            for (let i = 0; i < 12; i++) {
+                G1b(0, 4, 8, 12, msg, offset + 2 * s[j++]);
+                G2b(0, 4, 8, 12, msg, offset + 2 * s[j++]);
+                G1b(1, 5, 9, 13, msg, offset + 2 * s[j++]);
+                G2b(1, 5, 9, 13, msg, offset + 2 * s[j++]);
+                G1b(2, 6, 10, 14, msg, offset + 2 * s[j++]);
+                G2b(2, 6, 10, 14, msg, offset + 2 * s[j++]);
+                G1b(3, 7, 11, 15, msg, offset + 2 * s[j++]);
+                G2b(3, 7, 11, 15, msg, offset + 2 * s[j++]);
+                G1b(0, 5, 10, 15, msg, offset + 2 * s[j++]);
+                G2b(0, 5, 10, 15, msg, offset + 2 * s[j++]);
+                G1b(1, 6, 11, 12, msg, offset + 2 * s[j++]);
+                G2b(1, 6, 11, 12, msg, offset + 2 * s[j++]);
+                G1b(2, 7, 8, 13, msg, offset + 2 * s[j++]);
+                G2b(2, 7, 8, 13, msg, offset + 2 * s[j++]);
+                G1b(3, 4, 9, 14, msg, offset + 2 * s[j++]);
+                G2b(3, 4, 9, 14, msg, offset + 2 * s[j++]);
+            }
+            this.v0l ^= BBUF[0] ^ BBUF[16];
+            this.v0h ^= BBUF[1] ^ BBUF[17];
+            this.v1l ^= BBUF[2] ^ BBUF[18];
+            this.v1h ^= BBUF[3] ^ BBUF[19];
+            this.v2l ^= BBUF[4] ^ BBUF[20];
+            this.v2h ^= BBUF[5] ^ BBUF[21];
+            this.v3l ^= BBUF[6] ^ BBUF[22];
+            this.v3h ^= BBUF[7] ^ BBUF[23];
+            this.v4l ^= BBUF[8] ^ BBUF[24];
+            this.v4h ^= BBUF[9] ^ BBUF[25];
+            this.v5l ^= BBUF[10] ^ BBUF[26];
+            this.v5h ^= BBUF[11] ^ BBUF[27];
+            this.v6l ^= BBUF[12] ^ BBUF[28];
+            this.v6h ^= BBUF[13] ^ BBUF[29];
+            this.v7l ^= BBUF[14] ^ BBUF[30];
+            this.v7h ^= BBUF[15] ^ BBUF[31];
+            clean(BBUF);
+        }
+        destroy() {
+            this.destroyed = true;
+            clean(this.buffer32);
+            this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+        }
+    }
+    /**
+     * Blake2b hash function. 64-bit. 1.5x slower than blake2s in JS.
+     * @param msg - message that would be hashed
+     * @param opts - dkLen output length, key for MAC mode, salt, personalization
+     */
+    const blake2b = /* @__PURE__ */ createHasher((opts) => new _BLAKE2b(opts));
+
+    // globalThis.crypto is available in browsers and Node.js 20+
+    const defaultRNG$1 = globalThis.crypto;
+    const RSA_MODULUS = bigInt('25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357');
+    function rand(rng = defaultRNG$1) {
+        const bytes = new Uint8Array(4);
+        rng.getRandomValues(bytes);
+        const x = ((bytes[0] << 24) | (bytes[1] << 16) | (bytes[2] << 8) | bytes[3]) >>> 0;
+        return x / Math.pow(2, 32);
+    }
+    function randomInteger(rng, bits) {
+        const bytes = new Uint8Array(bits / 8);
+        rng.getRandomValues(bytes);
+        return bigInt.fromArray(Array.from(bytes), 256);
+    }
+    function nextPrime(n) {
+        if (n.compare(2) < 0) {
+            return bigInt(2);
+        }
+        const limit = n.multiply(2);
+        for (let p = n.next(); p.compare(limit) < 0; p = p.next()) {
+            // use 25 bases like in GMP mpz_nextprime and thus in Tezos
+            if (p.isProbablePrime(25, rand)) {
+                return p;
+            }
+        }
+        throw new Error('!!!nextPrime!!!'); // shouldn't happen
+    }
+    function generate(rng, mod) {
+        const m = mod.subtract(bigInt(2));
+        return randomInteger(rng, mod.bitLength().toJSNumber()).mod(m).add(bigInt(2));
+    }
+    function toLE(x) {
+        return x.toArray(256).value.reverse();
+    }
+    function fromLE(x) {
+        return bigInt.fromArray(x.reverse(), 256);
+    }
+    const HASH_SEPARATOR = [0xff, 0x00, 0xff, 0x00, 0xff, 0x00, 0xff, 0x00];
+    function hashToPrime(time, value, key, mod) {
+        const b = [
+            ...new TextEncoder().encode(String(time)),
+            ...HASH_SEPARATOR,
+            ...toLE(mod),
+            ...HASH_SEPARATOR,
+            ...toLE(value),
+            ...HASH_SEPARATOR,
+            ...toLE(key),
+        ];
+        const sum = blake2b(new Uint8Array(b), { dkLen: 32, key: new Uint8Array([32]) });
+        const val = fromLE(Array.from(sum));
+        return nextPrime(val);
+    }
+    function proveWesolowski(time, locked, unlocked, mod) {
+        const l = hashToPrime(time, locked, unlocked, mod);
+        let pi = bigInt(1);
+        let r = bigInt(1);
+        for (; time > 0; time -= 1) {
+            const rr = r.multiply(2);
+            r = rr.mod(l);
+            const pi2 = pi.multiply(pi).mod(mod);
+            if (rr.compare(l) >= 0) {
+                pi = pi2.multiply(locked);
+            }
+            else {
+                pi = pi2;
+            }
+        }
+        return pi.mod(mod);
+    }
+    function prove(time, locked, unlocked, mod = RSA_MODULUS) {
+        return new TimelockProof({
+            vdfTuple: new Timelock({
+                lockedValue: locked,
+                unlockedValue: unlocked,
+                vdfProof: proveWesolowski(time, locked, unlocked, mod),
+                modulus: mod,
+            }),
+            nonce: bigInt(1),
+        });
+    }
+    function unlockTimelock(time, locked, mod) {
+        if (locked.compare(bigInt(1)) <= 0) {
+            return locked;
+        }
+        let x = locked;
+        for (; time > 0; time -= 1) {
+            x = x.multiply(x).mod(mod);
+        }
+        return x;
+    }
+    function unlockAndProve(time, locked, mod = RSA_MODULUS) {
+        const unlocked = unlockTimelock(time, locked, mod);
+        return prove(time, locked, unlocked, mod);
+    }
+    function verifyWesolowski(vdfTuple, time) {
+        const l = hashToPrime(time, vdfTuple.lockedValue, vdfTuple.unlockedValue, vdfTuple.modulus);
+        const ll = vdfTuple.vdfProof.modPow(l, vdfTuple.modulus);
+        const r = bigInt(2).modPow(time, l);
+        const rr = vdfTuple.lockedValue.modPow(r, vdfTuple.modulus);
+        const unlocked = ll.multiply(rr).mod(vdfTuple.modulus);
+        return unlocked.compare(vdfTuple.unlockedValue) === 0;
+    }
+    function verify(locked, proof, time) {
+        const randomizedChallenge = proof.vdfTuple.lockedValue.modPow(proof.nonce, proof.vdfTuple.modulus);
+        return randomizedChallenge.compare(locked) === 0 && verifyWesolowski(proof.vdfTuple, time);
+    }
+    class Timelock {
+        constructor({ lockedValue, unlockedValue, vdfProof, modulus }) {
+            this.lockedValue = lockedValue;
+            this.unlockedValue = unlockedValue;
+            this.vdfProof = vdfProof;
+            this.modulus = modulus ?? RSA_MODULUS;
+        }
+        static precompute(time, mod = RSA_MODULUS, rng = defaultRNG$1) {
+            const locked = generate(rng, mod);
+            const unlocked = unlockTimelock(time, locked, mod);
+            return new Timelock({
+                lockedValue: locked,
+                unlockedValue: unlocked,
+                vdfProof: proveWesolowski(time, locked, unlocked, mod),
+                modulus: mod,
+            });
+        }
+        getProof(time, rng = defaultRNG$1) {
+            if (this.lockedValue.compare(bigInt(1)) < 1 ||
+                this.unlockedValue.compare(bigInt(0)) < 1 ||
+                this.vdfProof.compare(bigInt(0)) < 1 ||
+                this.lockedValue.compare(this.modulus) > 0 ||
+                this.unlockedValue.compare(this.modulus) > 0 ||
+                this.vdfProof.compare(this.modulus) >= 0) {
+                throw new Error('Invalid argument');
+            }
+            if (!verifyWesolowski(this, time)) {
+                throw new Error('Verification error');
+            }
+            const nonce = randomInteger(rng, 16 * 8);
+            const lockedValue = this.lockedValue.modPow(nonce, this.modulus);
+            return {
+                lockedValue,
+                proof: new TimelockProof({
+                    vdfTuple: this,
+                    nonce,
+                }),
+            };
+        }
+        encode() {
+            return new Uint8Array([
+                ...encodeBigInt(this.lockedValue),
+                ...encodeBigInt(this.unlockedValue),
+                ...encodeBigInt(this.vdfProof),
+            ]);
+        }
+        static fromArray(buf, mod = RSA_MODULUS) {
+            let i = 0;
+            const [lockedValue, n1] = decodeBigInt(buf);
+            i += n1;
+            const [unlockedValue, n2] = decodeBigInt(buf.slice(i));
+            i += n2;
+            const [vdfProof, n3] = decodeBigInt(buf.slice(i));
+            i += n3;
+            return [
+                new Timelock({
+                    lockedValue,
+                    unlockedValue,
+                    vdfProof,
+                    modulus: mod,
+                }),
+                i,
+            ];
+        }
+    }
+    const KDF_KEY = new TextEncoder().encode('Tezoskdftimelockv1');
+    class TimelockProof {
+        constructor({ vdfTuple, nonce }) {
+            this.vdfTuple = vdfTuple;
+            this.nonce = nonce;
+        }
+        symmetricKey() {
+            const updated = this.vdfTuple.unlockedValue.modPow(this.nonce, this.vdfTuple.modulus);
+            return blake2b(new TextEncoder().encode(String(updated)), { dkLen: 32, key: KDF_KEY });
+        }
+        encode() {
+            return new Uint8Array([...this.vdfTuple.encode(), ...encodeBigInt(this.nonce)]);
+        }
+        static fromArray(buf, mod = RSA_MODULUS) {
+            let i = 0;
+            const [vdfTuple, n1] = Timelock.fromArray(buf, mod);
+            i += n1;
+            const [nonce, n2] = decodeBigInt(buf.slice(i));
+            i += n2;
+            return [new TimelockProof({ vdfTuple, nonce }), i];
+        }
+    }
+    function encodeBigInt(v) {
+        if (v.isNegative()) {
+            throw new Error('Negative value');
+        }
+        const res = [];
+        for (let i = 0;; i++) {
+            const x = v.and(bigInt(0x7f)).toJSNumber();
+            v = v.shiftRight(7);
+            if (!v.isZero()) {
+                res.push(x | 0x80);
+            }
+            else {
+                res.push(x);
+                break;
+            }
+        }
+        return res;
+    }
+    function decodeBigInt(buf) {
+        let shift = 0;
+        let i = 0;
+        let res = bigInt(0);
+        while (i < buf.length) {
+            const x = buf[i];
+            res = res.add(bigInt(x & 0x7f).shiftLeft(shift));
+            shift += 7;
+            i++;
+            if ((x & 0x80) === 0)
+                break;
+        }
+        return [res, i];
+    }
+
+    // globalThis.crypto is available in browsers and Node.js 20+
+    const defaultRNG = globalThis.crypto;
+    class ChestKey extends TimelockProof {
+    }
+    function encrypt(key, text, rng = defaultRNG) {
+        const nonce = new Uint8Array(24);
+        rng.getRandomValues(nonce);
+        const payload = nacl.secretBox(key, nonce, text);
+        return {
+            payload,
+            nonce,
+        };
+    }
+    function decrypt(key, c) {
+        return nacl.openSecretBox(key, c.nonce, c.payload);
+    }
+    class Chest {
+        constructor({ lockedValue, cipherText }) {
+            this.lockedValue = lockedValue;
+            this.cipherText = cipherText;
+        }
+        static newChestAndKey(payload, time, mod, rng) {
+            if (time <= 0) {
+                throw new Error('Invalid argument');
+            }
+            const vdfTuple = Timelock.precompute(time, mod, rng);
+            return Chest.fromTimelock(payload, time, vdfTuple, rng);
+        }
+        static fromTimelock(payload, time, timelock, rng) {
+            if (time <= 0) {
+                throw new Error('Invalid argument');
+            }
+            const { lockedValue, proof } = timelock.getProof(time, rng);
+            const symKey = proof.symmetricKey();
+            const cipherText = encrypt(symKey, payload, rng);
+            return { chest: new Chest({ lockedValue, cipherText }), key: proof };
+        }
+        newKey(time, mod) {
+            if (time <= 0) {
+                throw new Error('Invalid argument');
+            }
+            return unlockAndProve(time, this.lockedValue, mod);
+        }
+        open(key, time) {
+            if (time <= 0) {
+                throw new Error('Invalid argument');
+            }
+            if (!verify(this.lockedValue, key, time)) {
+                return null;
+            }
+            const symKey = key.symmetricKey();
+            return decrypt(symKey, this.cipherText);
+        }
+        encode() {
+            const locked = encodeBigInt(this.lockedValue);
+            const res = new Uint8Array(locked.length + 24 + 4 + this.cipherText.payload.length);
+            res.set(locked);
+            let off = locked.length;
+            res.set(this.cipherText.nonce, off);
+            off += 24;
+            new DataView(res.buffer, res.byteOffset, res.byteLength).setUint32(off, this.cipherText.payload.length);
+            off += 4;
+            res.set(this.cipherText.payload, off);
+            return res;
+        }
+        static fromArray(buf) {
+            let i = 0;
+            const [lockedValue, n] = decodeBigInt(buf);
+            i += n;
+            if (buf.length - i < 24 + 4) {
+                throw new Error('Buffer is too short');
+            }
+            const nonce = new Uint8Array(buf.slice(i, i + 24));
+            i += 24;
+            const len = new DataView(buf.buffer, buf.byteOffset, buf.byteLength).getUint32(i);
+            i += 4;
+            if (buf.length - i < len) {
+                throw new Error('Buffer is too short');
+            }
+            const payload = new Uint8Array(buf.slice(i, i + len));
+            i += len;
+            return [new Chest({ lockedValue, cipherText: { nonce, payload } }), i];
+        }
+    }
+
+    exports.Chest = Chest;
+    exports.ChestKey = ChestKey;
+    exports.Timelock = Timelock;
+    exports.TimelockProof = TimelockProof;
+    exports.decrypt = decrypt;
+    exports.encrypt = encrypt;
 
 }));
 //# sourceMappingURL=taquito-timelock.umd.js.map