@typeberry/lib 0.1.3-af70ed0 → 0.1.3-c2321fb

package/index.js

@@ -329,6 +329,19 @@ const Result$1 = {
     },
 };
 
+// about 2GB, the maximum ArrayBuffer length on Chrome confirmed by several sources:
+// - https://issues.chromium.org/issues/40055619
+// - https://stackoverflow.com/a/72124984
+// - https://onnxruntime.ai/docs/tutorials/web/large-models.html#maximum-size-of-arraybuffer
+const MAX_LENGTH$2 = 2145386496;
+function safeAllocUint8Array(length) {
+    if (length > MAX_LENGTH$2) {
+        // biome-ignore lint/suspicious/noConsole: can't have a dependency on logger here
+        console.warn(`Trying to allocate ${length} bytes, which is greater than the maximum of ${MAX_LENGTH$2}.`);
+    }
+    return new Uint8Array(Math.min(MAX_LENGTH$2, length));
+}
+
 /**
  * Utilities for tests.
  */
@@ -569,6 +582,7 @@ var index$u = /*#__PURE__*/Object.freeze({
   DEFAULT_VERSION: DEFAULT_VERSION,
   ErrorsCollector: ErrorsCollector,
   get GpVersion () { return GpVersion; },
+  MAX_LENGTH: MAX_LENGTH$2,
   OK: OK,
   Result: Result$1,
   TEST_COMPARE_USING: TEST_COMPARE_USING,
@@ -583,6 +597,7 @@ var index$u = /*#__PURE__*/Object.freeze({
   isBrowser: isBrowser,
   measure: measure,
   resultToString: resultToString,
+  safeAllocUint8Array: safeAllocUint8Array,
   seeThrough: seeThrough,
   workspacePathFix: workspacePathFix
 });
@@ -606,7 +621,7 @@ class BitVec {
      * Create new [`BitVec`] with all values set to `false`.
      */
     static empty(bitLength) {
-        const data = new Uint8Array(Math.ceil(bitLength / 8));
+        const data = safeAllocUint8Array(Math.ceil(bitLength / 8));
         return new BitVec(data, bitLength);
     }
     byteLength;
@@ -807,7 +822,7 @@ class BytesBlob {
     static blobFromParts(v, ...rest) {
         const vArr = v instanceof Uint8Array ? [v] : v;
         const totalLength = vArr.reduce((a, v) => a + v.length, 0) + rest.reduce((a, v) => a + v.length, 0);
-        const buffer = new Uint8Array(totalLength);
+        const buffer = safeAllocUint8Array(totalLength);
         let offset = 0;
         for (const r of vArr) {
             buffer.set(r, offset);
@@ -880,7 +895,7 @@ class Bytes extends BytesBlob {
     }
     /** Create an empty [`Bytes<X>`] of given length. */
     static zero(len) {
-        return new Bytes(new Uint8Array(len), len);
+        return new Bytes(safeAllocUint8Array(len), len);
     }
     // TODO [ToDr] `fill` should have the argments swapped to align with the rest.
     /** Create a [`Bytes<X>`] with all bytes filled with given input number. */
@@ -3589,7 +3604,7 @@ async function verify(input) {
         return Promise.resolve([]);
     }
     const dataLength = input.reduce((acc, { message, key, signature }) => acc + key.length + signature.length + message.length + 1, 0);
-    const data = new Uint8Array(dataLength);
+    const data = safeAllocUint8Array(dataLength);
     let offset = 0;
     for (const { key, message, signature } of input) {
         data.set(key.raw, offset);
@@ -3636,823 +3651,75 @@ var ed25519 = /*#__PURE__*/Object.freeze({
   verifyBatch: verifyBatch
 });
 
+const SEED_SIZE = 32;
+const ED25519_SECRET_KEY = Bytes.blobFromString("jam_val_key_ed25519");
+const BANDERSNATCH_SECRET_KEY = Bytes.blobFromString("jam_val_key_bandersnatch");
 /**
- * Size of the output of the hash functions.
- *
- * https://graypaper.fluffylabs.dev/#/579bd12/073101073c01
+ * JIP-5: Secret key derivation
  *
- */
-const HASH_SIZE = 32;
-/** A hash without last byte (useful for trie representation). */
-const TRUNCATED_HASH_SIZE = 31;
-const ZERO_HASH = Bytes.zero(HASH_SIZE);
+ * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md */
 /**
- * Container for some object with a hash that is related to this object.
- *
- * After calculating the hash these two should be passed together to avoid
- * unnecessary re-hashing of the data.
+ * Deriving a 32-byte seed from a 32-bit unsigned integer
+ * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md#trivial-seeds
  */
-class WithHash extends WithDebug {
-    hash;
-    data;
-    constructor(hash, data) {
-        super();
-        this.hash = hash;
-        this.data = data;
-    }
+function trivialSeed(s) {
+    const s_le = u32AsLeBytes(s);
+    return Bytes.fromBlob(BytesBlob.blobFromParts([s_le, s_le, s_le, s_le, s_le, s_le, s_le, s_le]).raw, SEED_SIZE).asOpaque();
 }
 /**
- * Extension of [`WithHash`] additionally containing an encoded version of the object.
+ * Derives a Ed25519 secret key from a seed.
+ * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md#derivation-method
  */
-class WithHashAndBytes extends WithHash {
-    encoded;
-    constructor(hash, data, encoded) {
-        super(hash, data);
-        this.encoded = encoded;
-    }
-}
-
-/** The simplest allocator returning just a fresh copy of bytes each time. */
-class SimpleAllocator {
-    emptyHash() {
-        return Bytes.zero(HASH_SIZE);
-    }
-}
-/** An allocator that works by allocating larger (continuous) pages of memory. */
-class PageAllocator {
-    hashesPerPage;
-    page = new Uint8Array(0);
-    currentHash = 0;
-    // TODO [ToDr] Benchmark the performance!
-    constructor(hashesPerPage) {
-        this.hashesPerPage = hashesPerPage;
-        check `${hashesPerPage > 0 && hashesPerPage >>> 0 === hashesPerPage} Expected a non-zero integer.`;
-        this.resetPage();
-    }
-    resetPage() {
-        const pageSizeBytes = this.hashesPerPage * HASH_SIZE;
-        this.currentHash = 0;
-        this.page = new Uint8Array(pageSizeBytes);
-    }
-    emptyHash() {
-        const startIdx = this.currentHash * HASH_SIZE;
-        const endIdx = startIdx + HASH_SIZE;
-        this.currentHash += 1;
-        if (this.currentHash >= this.hashesPerPage) {
-            this.resetPage();
-        }
-        return Bytes.fromBlob(this.page.subarray(startIdx, endIdx), HASH_SIZE);
-    }
-}
-const defaultAllocator = new SimpleAllocator();
-
-function getDefaultExportFromCjs (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
-var blake2b$3 = {exports: {}};
-
-var nanoassert;
-var hasRequiredNanoassert;
-
-function requireNanoassert () {
-	if (hasRequiredNanoassert) return nanoassert;
-	hasRequiredNanoassert = 1;
-	nanoassert = assert;
-
-	class AssertionError extends Error {}
-	AssertionError.prototype.name = 'AssertionError';
-
-	/**
-	 * Minimal assert function
-	 * @param  {any} t Value to check if falsy
-	 * @param  {string=} m Optional assertion error message
-	 * @throws {AssertionError}
-	 */
-	function assert (t, m) {
-	  if (!t) {
-	    var err = new AssertionError(m);
-	    if (Error.captureStackTrace) Error.captureStackTrace(err, assert);
-	    throw err
-	  }
-	}
-	return nanoassert;
+function deriveEd25519SecretKey(seed, blake2b) {
+    return blake2b.hashBytes(BytesBlob.blobFromParts([ED25519_SECRET_KEY.raw, seed.raw])).asOpaque();
 }
-
-var blake2bWasm = {exports: {}};
-
-var b4a;
-var hasRequiredB4a;
-
-function requireB4a () {
-	if (hasRequiredB4a) return b4a;
-	hasRequiredB4a = 1;
-	function isBuffer (value) {
-	  return Buffer.isBuffer(value) || value instanceof Uint8Array
-	}
-
-	function isEncoding (encoding) {
-	  return Buffer.isEncoding(encoding)
-	}
-
-	function alloc (size, fill, encoding) {
-	  return Buffer.alloc(size, fill, encoding)
-	}
-
-	function allocUnsafe (size) {
-	  return Buffer.allocUnsafe(size)
-	}
-
-	function allocUnsafeSlow (size) {
-	  return Buffer.allocUnsafeSlow(size)
-	}
-
-	function byteLength (string, encoding) {
-	  return Buffer.byteLength(string, encoding)
-	}
-
-	function compare (a, b) {
-	  return Buffer.compare(a, b)
-	}
-
-	function concat (buffers, totalLength) {
-	  return Buffer.concat(buffers, totalLength)
-	}
-
-	function copy (source, target, targetStart, start, end) {
-	  return toBuffer(source).copy(target, targetStart, start, end)
-	}
-
-	function equals (a, b) {
-	  return toBuffer(a).equals(b)
-	}
-
-	function fill (buffer, value, offset, end, encoding) {
-	  return toBuffer(buffer).fill(value, offset, end, encoding)
-	}
-
-	function from (value, encodingOrOffset, length) {
-	  return Buffer.from(value, encodingOrOffset, length)
-	}
-
-	function includes (buffer, value, byteOffset, encoding) {
-	  return toBuffer(buffer).includes(value, byteOffset, encoding)
-	}
-
-	function indexOf (buffer, value, byfeOffset, encoding) {
-	  return toBuffer(buffer).indexOf(value, byfeOffset, encoding)
-	}
-
-	function lastIndexOf (buffer, value, byteOffset, encoding) {
-	  return toBuffer(buffer).lastIndexOf(value, byteOffset, encoding)
-	}
-
-	function swap16 (buffer) {
-	  return toBuffer(buffer).swap16()
-	}
-
-	function swap32 (buffer) {
-	  return toBuffer(buffer).swap32()
-	}
-
-	function swap64 (buffer) {
-	  return toBuffer(buffer).swap64()
-	}
-
-	function toBuffer (buffer) {
-	  if (Buffer.isBuffer(buffer)) return buffer
-	  return Buffer.from(buffer.buffer, buffer.byteOffset, buffer.byteLength)
-	}
-
-	function toString (buffer, encoding, start, end) {
-	  return toBuffer(buffer).toString(encoding, start, end)
-	}
-
-	function write (buffer, string, offset, length, encoding) {
-	  return toBuffer(buffer).write(string, offset, length, encoding)
-	}
-
-	function writeDoubleLE (buffer, value, offset) {
-	  return toBuffer(buffer).writeDoubleLE(value, offset)
-	}
-
-	function writeFloatLE (buffer, value, offset) {
-	  return toBuffer(buffer).writeFloatLE(value, offset)
-	}
-
-	function writeUInt32LE (buffer, value, offset) {
-	  return toBuffer(buffer).writeUInt32LE(value, offset)
-	}
-
-	function writeInt32LE (buffer, value, offset) {
-	  return toBuffer(buffer).writeInt32LE(value, offset)
-	}
-
-	function readDoubleLE (buffer, offset) {
-	  return toBuffer(buffer).readDoubleLE(offset)
-	}
-
-	function readFloatLE (buffer, offset) {
-	  return toBuffer(buffer).readFloatLE(offset)
-	}
-
-	function readUInt32LE (buffer, offset) {
-	  return toBuffer(buffer).readUInt32LE(offset)
-	}
-
-	function readInt32LE (buffer, offset) {
-	  return toBuffer(buffer).readInt32LE(offset)
-	}
-
-	b4a = {
-	  isBuffer,
-	  isEncoding,
-	  alloc,
-	  allocUnsafe,
-	  allocUnsafeSlow,
-	  byteLength,
-	  compare,
-	  concat,
-	  copy,
-	  equals,
-	  fill,
-	  from,
-	  includes,
-	  indexOf,
-	  lastIndexOf,
-	  swap16,
-	  swap32,
-	  swap64,
-	  toBuffer,
-	  toString,
-	  write,
-	  writeDoubleLE,
-	  writeFloatLE,
-	  writeUInt32LE,
-	  writeInt32LE,
-	  readDoubleLE,
-	  readFloatLE,
-	  readUInt32LE,
-	  readInt32LE
-	};
-	return b4a;
-}
-
-var blake2b$2;
-var hasRequiredBlake2b$1;
-
-function requireBlake2b$1 () {
-	if (hasRequiredBlake2b$1) return blake2b$2;
-	hasRequiredBlake2b$1 = 1;
-	var __commonJS = (cb, mod) => function __require() {
-	  return mod || (0, cb[Object.keys(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;
-	};
-	var __toBinary = /* @__PURE__ */ (() => {
-	  var table = new Uint8Array(128);
-	  for (var i = 0; i < 64; i++)
-	    table[i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i * 4 - 205] = i;
-	  return (base64) => {
-	    var n = base64.length, bytes2 = new Uint8Array((n - (base64[n - 1] == "=") - (base64[n - 2] == "=")) * 3 / 4 | 0);
-	    for (var i2 = 0, j = 0; i2 < n; ) {
-	      var c0 = table[base64.charCodeAt(i2++)], c1 = table[base64.charCodeAt(i2++)];
-	      var c2 = table[base64.charCodeAt(i2++)], c3 = table[base64.charCodeAt(i2++)];
-	      bytes2[j++] = c0 << 2 | c1 >> 4;
-	      bytes2[j++] = c1 << 4 | c2 >> 2;
-	      bytes2[j++] = c2 << 6 | c3;
-	    }
-	    return bytes2;
-	  };
-	})();
-
-	// wasm-binary:./blake2b.wat
-	var require_blake2b = __commonJS({
-	  "wasm-binary:./blake2b.wat"(exports2, module2) {
-	    module2.exports = __toBinary("AGFzbQEAAAABEANgAn9/AGADf39/AGABfwADBQQAAQICBQUBAQroBwdNBQZtZW1vcnkCAAxibGFrZTJiX2luaXQAAA5ibGFrZTJiX3VwZGF0ZQABDWJsYWtlMmJfZmluYWwAAhBibGFrZTJiX2NvbXByZXNzAAMKvz8EwAIAIABCADcDACAAQgA3AwggAEIANwMQIABCADcDGCAAQgA3AyAgAEIANwMoIABCADcDMCAAQgA3AzggAEIANwNAIABCADcDSCAAQgA3A1AgAEIANwNYIABCADcDYCAAQgA3A2ggAEIANwNwIABCADcDeCAAQoiS853/zPmE6gBBACkDAIU3A4ABIABCu86qptjQ67O7f0EIKQMAhTcDiAEgAEKr8NP0r+68tzxBECkDAIU3A5ABIABC8e30+KWn/aelf0EYKQMAhTcDmAEgAELRhZrv+s+Uh9EAQSApAwCFNwOgASAAQp/Y+dnCkdqCm39BKCkDAIU3A6gBIABC6/qG2r+19sEfQTApAwCFNwOwASAAQvnC+JuRo7Pw2wBBOCkDAIU3A7gBIABCADcDwAEgAEIANwPIASAAQgA3A9ABC20BA38gAEHAAWohAyAAQcgBaiEEIAQpAwCnIQUCQANAIAEgAkYNASAFQYABRgRAIAMgAykDACAFrXw3AwBBACEFIAAQAwsgACAFaiABLQAAOgAAIAVBAWohBSABQQFqIQEMAAsLIAQgBa03AwALYQEDfyAAQcABaiEBIABByAFqIQIgASABKQMAIAIpAwB8NwMAIABCfzcD0AEgAikDAKchAwJAA0AgA0GAAUYNASAAIANqQQA6AAAgA0EBaiEDDAALCyACIAOtNwMAIAAQAwuqOwIgfgl/IABBgAFqISEgAEGIAWohIiAAQZABaiEjIABBmAFqISQgAEGgAWohJSAAQagBaiEmIABBsAFqIScgAEG4AWohKCAhKQMAIQEgIikDACECICMpAwAhAyAkKQMAIQQgJSkDACEFICYpAwAhBiAnKQMAIQcgKCkDACEIQoiS853/zPmE6gAhCUK7zqqm2NDrs7t/IQpCq/DT9K/uvLc8IQtC8e30+KWn/aelfyEMQtGFmu/6z5SH0QAhDUKf2PnZwpHagpt/IQ5C6/qG2r+19sEfIQ9C+cL4m5Gjs/DbACEQIAApAwAhESAAKQMIIRIgACkDECETIAApAxghFCAAKQMgIRUgACkDKCEWIAApAzAhFyAAKQM4IRggACkDQCEZIAApA0ghGiAAKQNQIRsgACkDWCEcIAApA2AhHSAAKQNoIR4gACkDcCEfIAApA3ghICANIAApA8ABhSENIA8gACkD0AGFIQ8gASAFIBF8fCEBIA0gAYVCIIohDSAJIA18IQkgBSAJhUIYiiEFIAEgBSASfHwhASANIAGFQhCKIQ0gCSANfCEJIAUgCYVCP4ohBSACIAYgE3x8IQIgDiAChUIgiiEOIAogDnwhCiAGIAqFQhiKIQYgAiAGIBR8fCECIA4gAoVCEIohDiAKIA58IQogBiAKhUI/iiEGIAMgByAVfHwhAyAPIAOFQiCKIQ8gCyAPfCELIAcgC4VCGIohByADIAcgFnx8IQMgDyADhUIQiiEPIAsgD3whCyAHIAuFQj+KIQcgBCAIIBd8fCEEIBAgBIVCIIohECAMIBB8IQwgCCAMhUIYiiEIIAQgCCAYfHwhBCAQIASFQhCKIRAgDCAQfCEMIAggDIVCP4ohCCABIAYgGXx8IQEgECABhUIgiiEQIAsgEHwhCyAGIAuFQhiKIQYgASAGIBp8fCEBIBAgAYVCEIohECALIBB8IQsgBiALhUI/iiEGIAIgByAbfHwhAiANIAKFQiCKIQ0gDCANfCEMIAcgDIVCGIohByACIAcgHHx8IQIgDSAChUIQiiENIAwgDXwhDCAHIAyFQj+KIQcgAyAIIB18fCEDIA4gA4VCIIohDiAJIA58IQkgCCAJhUIYiiEIIAMgCCAefHwhAyAOIAOFQhCKIQ4gCSAOfCEJIAggCYVCP4ohCCAEIAUgH3x8IQQgDyAEhUIgiiEPIAogD3whCiAFIAqFQhiKIQUgBCAFICB8fCEEIA8gBIVCEIohDyAKIA98IQogBSAKhUI/iiEFIAEgBSAffHwhASANIAGFQiCKIQ0gCSANfCEJIAUgCYVCGIohBSABIAUgG3x8IQEgDSABhUIQiiENIAkgDXwhCSAFIAmFQj+KIQUgAiAGIBV8fCECIA4gAoVCIIohDiAKIA58IQogBiAKhUIYiiEGIAIgBiAZfHwhAiAOIAKFQhCKIQ4gCiAOfCEKIAYgCoVCP4ohBiADIAcgGnx8IQMgDyADhUIgiiEPIAsgD3whCyAHIAuFQhiKIQcgAyAHICB8fCEDIA8gA4VCEIohDyALIA98IQsgByALhUI/iiEHIAQgCCAefHwhBCAQIASFQiCKIRAgDCAQfCEMIAggDIVCGIohCCAEIAggF3x8IQQgECAEhUIQiiEQIAwgEHwhDCAIIAyFQj+KIQggASAGIBJ8fCEBIBAgAYVCIIohECALIBB8IQsgBiALhUIYiiEGIAEgBiAdfHwhASAQIAGFQhCKIRAgCyAQfCELIAYgC4VCP4ohBiACIAcgEXx8IQIgDSAChUIgiiENIAwgDXwhDCAHIAyFQhiKIQcgAiAHIBN8fCECIA0gAoVCEIohDSAMIA18IQwgByAMhUI/iiEHIAMgCCAcfHwhAyAOIAOFQiCKIQ4gCSAOfCEJIAggCYVCGIohCCADIAggGHx8IQMgDiADhUIQiiEOIAkgDnwhCSAIIAmFQj+KIQggBCAFIBZ8fCEEIA8gBIVCIIohDyAKIA98IQogBSAKhUIYiiEFIAQgBSAUfHwhBCAPIASFQhCKIQ8gCiAPfCEKIAUgCoVCP4ohBSABIAUgHHx8IQEgDSABhUIgiiENIAkgDXwhCSAFIAmFQhiKIQUgASAFIBl8fCEBIA0gAYVCEIohDSAJIA18IQkgBSAJhUI/iiEFIAIgBiAdfHwhAiAOIAKFQiCKIQ4gCiAOfCEKIAYgCoVCGIohBiACIAYgEXx8IQIgDiAChUIQiiEOIAogDnwhCiAGIAqFQj+KIQYgAyAHIBZ8fCEDIA8gA4VCIIohDyALIA98IQsgByALhUIYiiEHIAMgByATfHwhAyAPIAOFQhCKIQ8gCyAPfCELIAcgC4VCP4ohByAEIAggIHx8IQQgECAEhUIgiiEQIAwgEHwhDCAIIAyFQhiKIQggBCAIIB58fCEEIBAgBIVCEIohECAMIBB8IQwgCCAMhUI/iiEIIAEgBiAbfHwhASAQIAGFQiCKIRAgCyAQfCELIAYgC4VCGIohBiABIAYgH3x8IQEgECABhUIQiiEQIAsgEHwhCyAGIAuFQj+KIQYgAiAHIBR8fCECIA0gAoVCIIohDSAMIA18IQwgByAMhUIYiiEHIAIgByAXfHwhAiANIAKFQhCKIQ0gDCANfCEMIAcgDIVCP4ohByADIAggGHx8IQMgDiADhUIgiiEOIAkgDnwhCSAIIAmFQhiKIQggAyAIIBJ8fCEDIA4gA4VCEIohDiAJIA58IQkgCCAJhUI/iiEIIAQgBSAafHwhBCAPIASFQiCKIQ8gCiAPfCEKIAUgCoVCGIohBSAEIAUgFXx8IQQgDyAEhUIQiiEPIAogD3whCiAFIAqFQj+KIQUgASAFIBh8fCEBIA0gAYVCIIohDSAJIA18IQkgBSAJhUIYiiEFIAEgBSAafHwhASANIAGFQhCKIQ0gCSANfCEJIAUgCYVCP4ohBSACIAYgFHx8IQIgDiAChUIgiiEOIAogDnwhCiAGIAqFQhiKIQYgAiAGIBJ8fCECIA4gAoVCEIohDiAKIA58IQogBiAKhUI/iiEGIAMgByAefHwhAyAPIAOFQiCKIQ8gCyAPfCELIAcgC4VCGIohByADIAcgHXx8IQMgDyADhUIQiiEPIAsgD3whCyAHIAuFQj+KIQcgBCAIIBx8fCEEIBAgBIVCIIohECAMIBB8IQwgCCAMhUIYiiEIIAQgCCAffHwhBCAQIASFQhCKIRAgDCAQfCEMIAggDIVCP4ohCCABIAYgE3x8IQEgECABhUIgiiEQIAsgEHwhCyAGIAuFQhiKIQYgASAGIBd8fCEBIBAgAYVCEIohECALIBB8IQsgBiALhUI/iiEGIAIgByAWfHwhAiANIAKFQiCKIQ0gDCANfCEMIAcgDIVCGIohByACIAcgG3x8IQIgDSAChUIQiiENIAwgDXwhDCAHIAyFQj+KIQcgAyAIIBV8fCEDIA4gA4VCIIohDiAJIA58IQkgCCAJhUIYiiEIIAMgCCARfHwhAyAOIAOFQhCKIQ4gCSAOfCEJIAggCYVCP4ohCCAEIAUgIHx8IQQgDyAEhUIgiiEPIAogD3whCiAFIAqFQhiKIQUgBCAFIBl8fCEEIA8gBIVCEIohDyAKIA98IQogBSAKhUI/iiEFIAEgBSAafHwhASANIAGFQiCKIQ0gCSANfCEJIAUgCYVCGIohBSABIAUgEXx8IQEgDSABhUIQiiENIAkgDXwhCSAFIAmFQj+KIQUgAiAGIBZ8fCECIA4gAoVCIIohDiAKIA58IQogBiAKhUIYiiEGIAIgBiAYfHwhAiAOIAKFQhCKIQ4gCiAOfCEKIAYgCoVCP4ohBiADIAcgE3x8IQMgDyADhUIgiiEPIAsgD3whCyAHIAuFQhiKIQcgAyAHIBV8fCEDIA8gA4VCEIohDyALIA98IQsgByALhUI/iiEHIAQgCCAbfHwhBCAQIASFQiCKIRAgDCAQfCEMIAggDIVCGIohCCAEIAggIHx8IQQgECAEhUIQiiEQIAwgEHwhDCAIIAyFQj+KIQggASAGIB98fCEBIBAgAYVCIIohECALIBB8IQsgBiALhUIYiiEGIAEgBiASfHwhASAQIAGFQhCKIRAgCyAQfCELIAYgC4VCP4ohBiACIAcgHHx8IQIgDSAChUIgiiENIAwgDXwhDCAHIAyFQhiKIQcgAiAHIB18fCECIA0gAoVCEIohDSAMIA18IQwgByAMhUI/iiEHIAMgCCAXfHwhAyAOIAOFQiCKIQ4gCSAOfCEJIAggCYVCGIohCCADIAggGXx8IQMgDiADhUIQiiEOIAkgDnwhCSAIIAmFQj+KIQggBCAFIBR8fCEEIA8gBIVCIIohDyAKIA98IQogBSAKhUIYiiEFIAQgBSAefHwhBCAPIASFQhCKIQ8gCiAPfCEKIAUgCoVCP4ohBSABIAUgE3x8IQEgDSABhUIgiiENIAkgDXwhCSAFIAmFQhiKIQUgASAFIB18fCEBIA0gAYVCEIohDSAJIA18IQkgBSAJhUI/iiEFIAIgBiAXfHwhAiAOIAKFQiCKIQ4gCiAOfCEKIAYgCoVCGIohBiACIAYgG3x8IQIgDiAChUIQiiEOIAogDnwhCiAGIAqFQj+KIQYgAyAHIBF8fCEDIA8gA4VCIIohDyALIA98IQsgByALhUIYiiEHIAMgByAcfHwhAyAPIAOFQhCKIQ8gCyAPfCELIAcgC4VCP4ohByAEIAggGXx8IQQgECAEhUIgiiEQIAwgEHwhDCAIIAyFQhiKIQggBCAIIBR8fCEEIBAgBIVCEIohECAMIBB8IQwgCCAMhUI/iiEIIAEgBiAVfHwhASAQIAGFQiCKIRAgCyAQfCELIAYgC4VCGIohBiABIAYgHnx8IQEgECABhUIQiiEQIAsgEHwhCyAGIAuFQj+KIQYgAiAHIBh8fCECIA0gAoVCIIohDSAMIA18IQwgByAMhUIYiiEHIAIgByAWfHwhAiANIAKFQhCKIQ0gDCANfCEMIAcgDIVCP4ohByADIAggIHx8IQMgDiADhUIgiiEOIAkgDnwhCSAIIAmFQhiKIQggAyAIIB98fCEDIA4gA4VCEIohDiAJIA58IQkgCCAJhUI/iiEIIAQgBSASfHwhBCAPIASFQiCKIQ8gCiAPfCEKIAUgCoVCGIohBSAEIAUgGnx8IQQgDyAEhUIQiiEPIAogD3whCiAFIAqFQj+KIQUgASAFIB18fCEBIA0gAYVCIIohDSAJIA18IQkgBSAJhUIYiiEFIAEgBSAWfHwhASANIAGFQhCKIQ0gCSANfCEJIAUgCYVCP4ohBSACIAYgEnx8IQIgDiAChUIgiiEOIAogDnwhCiAGIAqFQhiKIQYgAiAGICB8fCECIA4gAoVCEIohDiAKIA58IQogBiAKhUI/iiEGIAMgByAffHwhAyAPIAOFQiCKIQ8gCyAPfCELIAcgC4VCGIohByADIAcgHnx8IQMgDyADhUIQiiEPIAsgD3whCyAHIAuFQj+KIQcgBCAIIBV8fCEEIBAgBIVCIIohECAMIBB8IQwgCCAMhUIYiiEIIAQgCCAbfHwhBCAQIASFQhCKIRAgDCAQfCEMIAggDIVCP4ohCCABIAYgEXx8IQEgECABhUIgiiEQIAsgEHwhCyAGIAuFQhiKIQYgASAGIBh8fCEBIBAgAYVCEIohECALIBB8IQsgBiALhUI/iiEGIAIgByAXfHwhAiANIAKFQiCKIQ0gDCANfCEMIAcgDIVCGIohByACIAcgFHx8IQIgDSAChUIQiiENIAwgDXwhDCAHIAyFQj+KIQcgAyAIIBp8fCEDIA4gA4VCIIohDiAJIA58IQkgCCAJhUIYiiEIIAMgCCATfHwhAyAOIAOFQhCKIQ4gCSAOfCEJIAggCYVCP4ohCCAEIAUgGXx8IQQgDyAEhUIgiiEPIAogD3whCiAFIAqFQhiKIQUgBCAFIBx8fCEEIA8gBIVCEIohDyAKIA98IQogBSAKhUI/iiEFIAEgBSAefHwhASANIAGFQiCKIQ0gCSANfCEJIAUgCYVCGIohBSABIAUgHHx8IQEgDSABhUIQiiENIAkgDXwhCSAFIAmFQj+KIQUgAiAGIBh8fCECIA4gAoVCIIohDiAKIA58IQogBiAKhUIYiiEGIAIgBiAffHwhAiAOIAKFQhCKIQ4gCiAOfCEKIAYgCoVCP4ohBiADIAcgHXx8IQMgDyADhUIgiiEPIAsgD3whCyAHIAuFQhiKIQcgAyAHIBJ8fCEDIA8gA4VCEIohDyALIA98IQsgByALhUI/iiEHIAQgCCAUfHwhBCAQIASFQiCKIRAgDCAQfCEMIAggDIVCGIohCCAEIAggGnx8IQQgECAEhUIQiiEQIAwgEHwhDCAIIAyFQj+KIQggASAGIBZ8fCEBIBAgAYVCIIohECALIBB8IQsgBiALhUIYiiEGIAEgBiARfHwhASAQIAGFQhCKIRAgCyAQfCELIAYgC4VCP4ohBiACIAcgIHx8IQIgDSAChUIgiiENIAwgDXwhDCAHIAyFQhiKIQcgAiAHIBV8fCECIA0gAoVCEIohDSAMIA18IQwgByAMhUI/iiEHIAMgCCAZfHwhAyAOIAOFQiCKIQ4gCSAOfCEJIAggCYVCGIohCCADIAggF3x8IQMgDiADhUIQiiEOIAkgDnwhCSAIIAmFQj+KIQggBCAFIBN8fCEEIA8gBIVCIIohDyAKIA98IQogBSAKhUIYiiEFIAQgBSAbfHwhBCAPIASFQhCKIQ8gCiAPfCEKIAUgCoVCP4ohBSABIAUgF3x8IQEgDSABhUIgiiENIAkgDXwhCSAFIAmFQhiKIQUgASAFICB8fCEBIA0gAYVCEIohDSAJIA18IQkgBSAJhUI/iiEFIAIgBiAffHwhAiAOIAKFQiCKIQ4gCiAOfCEKIAYgCoVCGIohBiACIAYgGnx8IQIgDiAChUIQiiEOIAogDnwhCiAGIAqFQj+KIQYgAyAHIBx8fCEDIA8gA4VCIIohDyALIA98IQsgByALhUIYiiEHIAMgByAUfHwhAyAPIAOFQhCKIQ8gCyAPfCELIAcgC4VCP4ohByAEIAggEXx8IQQgECAEhUIgiiEQIAwgEHwhDCAIIAyFQhiKIQggBCAIIBl8fCEEIBAgBIVCEIohECAMIBB8IQwgCCAMhUI/iiEIIAEgBiAdfHwhASAQIAGFQiCKIRAgCyAQfCELIAYgC4VCGIohBiABIAYgE3x8IQEgECABhUIQiiEQIAsgEHwhCyAGIAuFQj+KIQYgAiAHIB58fCECIA0gAoVCIIohDSAMIA18IQwgByAMhUIYiiEHIAIgByAYfHwhAiANIAKFQhCKIQ0gDCANfCEMIAcgDIVCP4ohByADIAggEnx8IQMgDiADhUIgiiEOIAkgDnwhCSAIIAmFQhiKIQggAyAIIBV8fCEDIA4gA4VCEIohDiAJIA58IQkgCCAJhUI/iiEIIAQgBSAbfHwhBCAPIASFQiCKIQ8gCiAPfCEKIAUgCoVCGIohBSAEIAUgFnx8IQQgDyAEhUIQiiEPIAogD3whCiAFIAqFQj+KIQUgASAFIBt8fCEBIA0gAYVCIIohDSAJIA18IQkgBSAJhUIYiiEFIAEgBSATfHwhASANIAGFQhCKIQ0gCSANfCEJIAUgCYVCP4ohBSACIAYgGXx8IQIgDiAChUIgiiEOIAogDnwhCiAGIAqFQhiKIQYgAiAGIBV8fCECIA4gAoVCEIohDiAKIA58IQogBiAKhUI/iiEGIAMgByAYfHwhAyAPIAOFQiCKIQ8gCyAPfCELIAcgC4VCGIohByADIAcgF3x8IQMgDyADhUIQiiEPIAsgD3whCyAHIAuFQj+KIQcgBCAIIBJ8fCEEIBAgBIVCIIohECAMIBB8IQwgCCAMhUIYiiEIIAQgCCAWfHwhBCAQIASFQhCKIRAgDCAQfCEMIAggDIVCP4ohCCABIAYgIHx8IQEgECABhUIgiiEQIAsgEHwhCyAGIAuFQhiKIQYgASAGIBx8fCEBIBAgAYVCEIohECALIBB8IQsgBiALhUI/iiEGIAIgByAafHwhAiANIAKFQiCKIQ0gDCANfCEMIAcgDIVCGIohByACIAcgH3x8IQIgDSAChUIQiiENIAwgDXwhDCAHIAyFQj+KIQcgAyAIIBR8fCEDIA4gA4VCIIohDiAJIA58IQkgCCAJhUIYiiEIIAMgCCAdfHwhAyAOIAOFQhCKIQ4gCSAOfCEJIAggCYVCP4ohCCAEIAUgHnx8IQQgDyAEhUIgiiEPIAogD3whCiAFIAqFQhiKIQUgBCAFIBF8fCEEIA8gBIVCEIohDyAKIA98IQogBSAKhUI/iiEFIAEgBSARfHwhASANIAGFQiCKIQ0gCSANfCEJIAUgCYVCGIohBSABIAUgEnx8IQEgDSABhUIQiiENIAkgDXwhCSAFIAmFQj+KIQUgAiAGIBN8fCECIA4gAoVCIIohDiAKIA58IQogBiAKhUIYiiEGIAIgBiAUfHwhAiAOIAKFQhCKIQ4gCiAOfCEKIAYgCoVCP4ohBiADIAcgFXx8IQMgDyADhUIgiiEPIAsgD3whCyAHIAuFQhiKIQcgAyAHIBZ8fCEDIA8gA4VCEIohDyALIA98IQsgByALhUI/iiEHIAQgCCAXfHwhBCAQIASFQiCKIRAgDCAQfCEMIAggDIVCGIohCCAEIAggGHx8IQQgECAEhUIQiiEQIAwgEHwhDCAIIAyFQj+KIQggASAGIBl8fCEBIBAgAYVCIIohECALIBB8IQsgBiALhUIYiiEGIAEgBiAafHwhASAQIAGFQhCKIRAgCyAQfCELIAYgC4VCP4ohBiACIAcgG3x8IQIgDSAChUIgiiENIAwgDXwhDCAHIAyFQhiKIQcgAiAHIBx8fCECIA0gAoVCEIohDSAMIA18IQwgByAMhUI/iiEHIAMgCCAdfHwhAyAOIAOFQiCKIQ4gCSAOfCEJIAggCYVCGIohCCADIAggHnx8IQMgDiADhUIQiiEOIAkgDnwhCSAIIAmFQj+KIQggBCAFIB98fCEEIA8gBIVCIIohDyAKIA98IQogBSAKhUIYiiEFIAQgBSAgfHwhBCAPIASFQhCKIQ8gCiAPfCEKIAUgCoVCP4ohBSABIAUgH3x8IQEgDSABhUIgiiENIAkgDXwhCSAFIAmFQhiKIQUgASAFIBt8fCEBIA0gAYVCEIohDSAJIA18IQkgBSAJhUI/iiEFIAIgBiAVfHwhAiAOIAKFQiCKIQ4gCiAOfCEKIAYgCoVCGIohBiACIAYgGXx8IQIgDiAChUIQiiEOIAogDnwhCiAGIAqFQj+KIQYgAyAHIBp8fCEDIA8gA4VCIIohDyALIA98IQsgByALhUIYiiEHIAMgByAgfHwhAyAPIAOFQhCKIQ8gCyAPfCELIAcgC4VCP4ohByAEIAggHnx8IQQgECAEhUIgiiEQIAwgEHwhDCAIIAyFQhiKIQggBCAIIBd8fCEEIBAgBIVCEIohECAMIBB8IQwgCCAMhUI/iiEIIAEgBiASfHwhASAQIAGFQiCKIRAgCyAQfCELIAYgC4VCGIohBiABIAYgHXx8IQEgECABhUIQiiEQIAsgEHwhCyAGIAuFQj+KIQYgAiAHIBF8fCECIA0gAoVCIIohDSAMIA18IQwgByAMhUIYiiEHIAIgByATfHwhAiANIAKFQhCKIQ0gDCANfCEMIAcgDIVCP4ohByADIAggHHx8IQMgDiADhUIgiiEOIAkgDnwhCSAIIAmFQhiKIQggAyAIIBh8fCEDIA4gA4VCEIohDiAJIA58IQkgCCAJhUI/iiEIIAQgBSAWfHwhBCAPIASFQiCKIQ8gCiAPfCEKIAUgCoVCGIohBSAEIAUgFHx8IQQgDyAEhUIQiiEPIAogD3whCiAFIAqFQj+KIQUgISAhKQMAIAEgCYWFNwMAICIgIikDACACIAqFhTcDACAjICMpAwAgAyALhYU3AwAgJCAkKQMAIAQgDIWFNwMAICUgJSkDACAFIA2FhTcDACAmICYpAwAgBiAOhYU3AwAgJyAnKQMAIAcgD4WFNwMAICggKCkDACAIIBCFhTcDAAs=");
-	  }
-	});
-
-	// wasm-module:./blake2b.wat
-	var bytes = require_blake2b();
-	var compiled = WebAssembly.compile(bytes);
-	blake2b$2 = async (imports) => {
-	  const instance = await WebAssembly.instantiate(await compiled, imports);
-	  return instance.exports;
-	};
-	return blake2b$2;
-}
-
-var hasRequiredBlake2bWasm;
-
-function requireBlake2bWasm () {
-	if (hasRequiredBlake2bWasm) return blake2bWasm.exports;
-	hasRequiredBlake2bWasm = 1;
-	var assert = /*@__PURE__*/ requireNanoassert();
-	var b4a = /*@__PURE__*/ requireB4a();
-
-	var wasm = null;
-	var wasmPromise = typeof WebAssembly !== "undefined" && /*@__PURE__*/ requireBlake2b$1()().then(mod => {
-	  wasm = mod;
-	});
-
-	var head = 64;
-	var freeList = [];
-
-	blake2bWasm.exports = Blake2b;
-	var BYTES_MIN = blake2bWasm.exports.BYTES_MIN = 16;
-	var BYTES_MAX = blake2bWasm.exports.BYTES_MAX = 64;
-	blake2bWasm.exports.BYTES = 32;
-	var KEYBYTES_MIN = blake2bWasm.exports.KEYBYTES_MIN = 16;
-	var KEYBYTES_MAX = blake2bWasm.exports.KEYBYTES_MAX = 64;
-	blake2bWasm.exports.KEYBYTES = 32;
-	var SALTBYTES = blake2bWasm.exports.SALTBYTES = 16;
-	var PERSONALBYTES = blake2bWasm.exports.PERSONALBYTES = 16;
-
-	function Blake2b (digestLength, key, salt, personal, noAssert) {
-	  if (!(this instanceof Blake2b)) return new Blake2b(digestLength, key, salt, personal, noAssert)
-	  if (!wasm) throw new Error('WASM not loaded. Wait for Blake2b.ready(cb)')
-	  if (!digestLength) digestLength = 32;
-
-	  if (noAssert !== true) {
-	    assert(digestLength >= BYTES_MIN, 'digestLength must be at least ' + BYTES_MIN + ', was given ' + digestLength);
-	    assert(digestLength <= BYTES_MAX, 'digestLength must be at most ' + BYTES_MAX + ', was given ' + digestLength);
-	    if (key != null) {
-	      assert(key instanceof Uint8Array, 'key must be Uint8Array or Buffer');
-	      assert(key.length >= KEYBYTES_MIN, 'key must be at least ' + KEYBYTES_MIN + ', was given ' + key.length);
-	      assert(key.length <= KEYBYTES_MAX, 'key must be at least ' + KEYBYTES_MAX + ', was given ' + key.length);
-	    }
-	    if (salt != null) {
-	      assert(salt instanceof Uint8Array, 'salt must be Uint8Array or Buffer');
-	      assert(salt.length === SALTBYTES, 'salt must be exactly ' + SALTBYTES + ', was given ' + salt.length);
-	    }
-	    if (personal != null) {
-	      assert(personal instanceof Uint8Array, 'personal must be Uint8Array or Buffer');
-	      assert(personal.length === PERSONALBYTES, 'personal must be exactly ' + PERSONALBYTES + ', was given ' + personal.length);
-	    }
-	  }
-
-	  if (!freeList.length) {
-	    freeList.push(head);
-	    head += 216;
-	  }
-
-	  this.digestLength = digestLength;
-	  this.finalized = false;
-	  this.pointer = freeList.pop();
-	  this._memory = new Uint8Array(wasm.memory.buffer);
-
-	  this._memory.fill(0, 0, 64);
-	  this._memory[0] = this.digestLength;
-	  this._memory[1] = key ? key.length : 0;
-	  this._memory[2] = 1; // fanout
-	  this._memory[3] = 1; // depth
-
-	  if (salt) this._memory.set(salt, 32);
-	  if (personal) this._memory.set(personal, 48);
-
-	  if (this.pointer + 216 > this._memory.length) this._realloc(this.pointer + 216); // we need 216 bytes for the state
-	  wasm.blake2b_init(this.pointer, this.digestLength);
-
-	  if (key) {
-	    this.update(key);
-	    this._memory.fill(0, head, head + key.length); // whiteout key
-	    this._memory[this.pointer + 200] = 128;
-	  }
-	}
-
-	Blake2b.prototype._realloc = function (size) {
-	  wasm.memory.grow(Math.max(0, Math.ceil(Math.abs(size - this._memory.length) / 65536)));
-	  this._memory = new Uint8Array(wasm.memory.buffer);
-	};
-
-	Blake2b.prototype.update = function (input) {
-	  assert(this.finalized === false, 'Hash instance finalized');
-	  assert(input instanceof Uint8Array, 'input must be Uint8Array or Buffer');
-
-	  if (head + input.length > this._memory.length) this._realloc(head + input.length);
-	  this._memory.set(input, head);
-	  wasm.blake2b_update(this.pointer, head, head + input.length);
-	  return this
-	};
-
-	Blake2b.prototype.digest = function (enc) {
-	  assert(this.finalized === false, 'Hash instance finalized');
-	  this.finalized = true;
-
-	  freeList.push(this.pointer);
-	  wasm.blake2b_final(this.pointer);
-
-	  if (!enc || enc === 'binary') {
-	    return this._memory.slice(this.pointer + 128, this.pointer + 128 + this.digestLength)
-	  }
-
-	  if (typeof enc === 'string') {
-	    return b4a.toString(this._memory, enc, this.pointer + 128, this.pointer + 128 + this.digestLength)
-	  }
-
-	  assert(enc instanceof Uint8Array && enc.length >= this.digestLength, 'input must be Uint8Array or Buffer');
-	  for (var i = 0; i < this.digestLength; i++) {
-	    enc[i] = this._memory[this.pointer + 128 + i];
-	  }
-
-	  return enc
-	};
-
-	// libsodium compat
-	Blake2b.prototype.final = Blake2b.prototype.digest;
-
-	Blake2b.WASM = wasm;
-	Blake2b.SUPPORTED = typeof WebAssembly !== 'undefined';
-
-	Blake2b.ready = function (cb) {
-	  if (!cb) cb = noop;
-	  if (!wasmPromise) return cb(new Error('WebAssembly not supported'))
-	  return wasmPromise.then(() => cb(), cb)
-	};
-
-	Blake2b.prototype.ready = Blake2b.ready;
-
-	Blake2b.prototype.getPartialHash = function () {
-	  return this._memory.slice(this.pointer, this.pointer + 216);
-	};
-
-	Blake2b.prototype.setPartialHash = function (ph) {
-	  this._memory.set(ph, this.pointer);
-	};
-
-	function noop () {}
-	return blake2bWasm.exports;
-}
-
-var hasRequiredBlake2b;
-
-function requireBlake2b () {
-	if (hasRequiredBlake2b) return blake2b$3.exports;
-	hasRequiredBlake2b = 1;
-	var assert = /*@__PURE__*/ requireNanoassert();
-	var b2wasm = /*@__PURE__*/ requireBlake2bWasm();
-
-	// 64-bit unsigned addition
-	// Sets v[a,a+1] += v[b,b+1]
-	// v should be a Uint32Array
-	function ADD64AA (v, a, b) {
-	  var o0 = v[a] + v[b];
-	  var o1 = v[a + 1] + v[b + 1];
-	  if (o0 >= 0x100000000) {
-	    o1++;
-	  }
-	  v[a] = o0;
-	  v[a + 1] = o1;
-	}
-
-	// 64-bit unsigned addition
-	// Sets v[a,a+1] += b
-	// b0 is the low 32 bits of b, b1 represents the high 32 bits
-	function ADD64AC (v, a, b0, b1) {
-	  var o0 = v[a] + b0;
-	  if (b0 < 0) {
-	    o0 += 0x100000000;
-	  }
-	  var o1 = v[a + 1] + b1;
-	  if (o0 >= 0x100000000) {
-	    o1++;
-	  }
-	  v[a] = o0;
-	  v[a + 1] = o1;
-	}
-
-	// Little-endian byte access
-	function B2B_GET32 (arr, i) {
-	  return (arr[i] ^
-	  (arr[i + 1] << 8) ^
-	  (arr[i + 2] << 16) ^
-	  (arr[i + 3] << 24))
-	}
-
-	// G Mixing function
-	// The ROTRs are inlined for speed
-	function B2B_G (a, b, c, d, ix, iy) {
-	  var x0 = m[ix];
-	  var x1 = m[ix + 1];
-	  var y0 = m[iy];
-	  var y1 = m[iy + 1];
-
-	  ADD64AA(v, a, b); // v[a,a+1] += v[b,b+1] ... in JS we must store a uint64 as two uint32s
-	  ADD64AC(v, a, x0, x1); // v[a, a+1] += x ... x0 is the low 32 bits of x, x1 is the high 32 bits
-
-	  // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits
-	  var xor0 = v[d] ^ v[a];
-	  var xor1 = v[d + 1] ^ v[a + 1];
-	  v[d] = xor1;
-	  v[d + 1] = xor0;
-
-	  ADD64AA(v, c, d);
-
-	  // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits
-	  xor0 = v[b] ^ v[c];
-	  xor1 = v[b + 1] ^ v[c + 1];
-	  v[b] = (xor0 >>> 24) ^ (xor1 << 8);
-	  v[b + 1] = (xor1 >>> 24) ^ (xor0 << 8);
-
-	  ADD64AA(v, a, b);
-	  ADD64AC(v, a, y0, y1);
-
-	  // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits
-	  xor0 = v[d] ^ v[a];
-	  xor1 = v[d + 1] ^ v[a + 1];
-	  v[d] = (xor0 >>> 16) ^ (xor1 << 16);
-	  v[d + 1] = (xor1 >>> 16) ^ (xor0 << 16);
-
-	  ADD64AA(v, c, d);
-
-	  // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits
-	  xor0 = v[b] ^ v[c];
-	  xor1 = v[b + 1] ^ v[c + 1];
-	  v[b] = (xor1 >>> 31) ^ (xor0 << 1);
-	  v[b + 1] = (xor0 >>> 31) ^ (xor1 << 1);
-	}
-
-	// Initialization Vector
-	var BLAKE2B_IV32 = new Uint32Array([
-	  0xF3BCC908, 0x6A09E667, 0x84CAA73B, 0xBB67AE85,
-	  0xFE94F82B, 0x3C6EF372, 0x5F1D36F1, 0xA54FF53A,
-	  0xADE682D1, 0x510E527F, 0x2B3E6C1F, 0x9B05688C,
-	  0xFB41BD6B, 0x1F83D9AB, 0x137E2179, 0x5BE0CD19
-	]);
-
-	var SIGMA8 = [
-	  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
-	];
-
-	// These are offsets into a uint64 buffer.
-	// Multiply them all by 2 to make them offsets into a uint32 buffer,
-	// because this is Javascript and we don't have uint64s
-	var SIGMA82 = new Uint8Array(SIGMA8.map(function (x) { return x * 2 }));
-
-	// Compression function. 'last' flag indicates last block.
-	// Note we're representing 16 uint64s as 32 uint32s
-	var v = new Uint32Array(32);
-	var m = new Uint32Array(32);
-	function blake2bCompress (ctx, last) {
-	  var i = 0;
-
-	  // init work variables
-	  for (i = 0; i < 16; i++) {
-	    v[i] = ctx.h[i];
-	    v[i + 16] = BLAKE2B_IV32[i];
-	  }
-
-	  // low 64 bits of offset
-	  v[24] = v[24] ^ ctx.t;
-	  v[25] = v[25] ^ (ctx.t / 0x100000000);
-	  // high 64 bits not supported, offset may not be higher than 2**53-1
-
-	  // last block flag set ?
-	  if (last) {
-	    v[28] = ~v[28];
-	    v[29] = ~v[29];
-	  }
-
-	  // get little-endian words
-	  for (i = 0; i < 32; i++) {
-	    m[i] = B2B_GET32(ctx.b, 4 * i);
-	  }
-
-	  // twelve rounds of mixing
-	  for (i = 0; i < 12; i++) {
-	    B2B_G(0, 8, 16, 24, SIGMA82[i * 16 + 0], SIGMA82[i * 16 + 1]);
-	    B2B_G(2, 10, 18, 26, SIGMA82[i * 16 + 2], SIGMA82[i * 16 + 3]);
-	    B2B_G(4, 12, 20, 28, SIGMA82[i * 16 + 4], SIGMA82[i * 16 + 5]);
-	    B2B_G(6, 14, 22, 30, SIGMA82[i * 16 + 6], SIGMA82[i * 16 + 7]);
-	    B2B_G(0, 10, 20, 30, SIGMA82[i * 16 + 8], SIGMA82[i * 16 + 9]);
-	    B2B_G(2, 12, 22, 24, SIGMA82[i * 16 + 10], SIGMA82[i * 16 + 11]);
-	    B2B_G(4, 14, 16, 26, SIGMA82[i * 16 + 12], SIGMA82[i * 16 + 13]);
-	    B2B_G(6, 8, 18, 28, SIGMA82[i * 16 + 14], SIGMA82[i * 16 + 15]);
-	  }
-
-	  for (i = 0; i < 16; i++) {
-	    ctx.h[i] = ctx.h[i] ^ v[i] ^ v[i + 16];
-	  }
-	}
-
-	// reusable parameter_block
-	var parameter_block = new Uint8Array([
-	  0, 0, 0, 0,      //  0: outlen, keylen, fanout, depth
-	  0, 0, 0, 0,      //  4: leaf length, sequential mode
-	  0, 0, 0, 0,      //  8: node offset
-	  0, 0, 0, 0,      // 12: node offset
-	  0, 0, 0, 0,      // 16: node depth, inner length, rfu
-	  0, 0, 0, 0,      // 20: rfu
-	  0, 0, 0, 0,      // 24: rfu
-	  0, 0, 0, 0,      // 28: rfu
-	  0, 0, 0, 0,      // 32: salt
-	  0, 0, 0, 0,      // 36: salt
-	  0, 0, 0, 0,      // 40: salt
-	  0, 0, 0, 0,      // 44: salt
-	  0, 0, 0, 0,      // 48: personal
-	  0, 0, 0, 0,      // 52: personal
-	  0, 0, 0, 0,      // 56: personal
-	  0, 0, 0, 0       // 60: personal
-	]);
-
-	// Creates a BLAKE2b hashing context
-	// Requires an output length between 1 and 64 bytes
-	// Takes an optional Uint8Array key
-	function Blake2b (outlen, key, salt, personal) {
-	  // zero out parameter_block before usage
-	  parameter_block.fill(0);
-	  // state, 'param block'
-
-	  this.b = new Uint8Array(128);
-	  this.h = new Uint32Array(16);
-	  this.t = 0; // input count
-	  this.c = 0; // pointer within buffer
-	  this.outlen = outlen; // output length in bytes
-
-	  parameter_block[0] = outlen;
-	  if (key) parameter_block[1] = key.length;
-	  parameter_block[2] = 1; // fanout
-	  parameter_block[3] = 1; // depth
-
-	  if (salt) parameter_block.set(salt, 32);
-	  if (personal) parameter_block.set(personal, 48);
-
-	  // initialize hash state
-	  for (var i = 0; i < 16; i++) {
-	    this.h[i] = BLAKE2B_IV32[i] ^ B2B_GET32(parameter_block, i * 4);
-	  }
-
-	  // key the hash, if applicable
-	  if (key) {
-	    blake2bUpdate(this, key);
-	    // at the end
-	    this.c = 128;
-	  }
-	}
-
-	Blake2b.prototype.update = function (input) {
-	  assert(input instanceof Uint8Array, 'input must be Uint8Array or Buffer');
-	  blake2bUpdate(this, input);
-	  return this
-	};
-
-	Blake2b.prototype.digest = function (out) {
-	  var buf = (!out || out === 'binary' || out === 'hex') ? new Uint8Array(this.outlen) : out;
-	  assert(buf instanceof Uint8Array, 'out must be "binary", "hex", Uint8Array, or Buffer');
-	  assert(buf.length >= this.outlen, 'out must have at least outlen bytes of space');
-	  blake2bFinal(this, buf);
-	  if (out === 'hex') return hexSlice(buf)
-	  return buf
-	};
-
-	Blake2b.prototype.final = Blake2b.prototype.digest;
-
-	Blake2b.ready = function (cb) {
-	  b2wasm.ready(function () {
-	    cb(); // ignore the error
-	  });
-	};
-
-	// Updates a BLAKE2b streaming hash
-	// Requires hash context and Uint8Array (byte array)
-	function blake2bUpdate (ctx, input) {
-	  for (var i = 0; i < input.length; i++) {
-	    if (ctx.c === 128) { // buffer full ?
-	      ctx.t += ctx.c; // add counters
-	      blake2bCompress(ctx, false); // compress (not last)
-	      ctx.c = 0; // counter to zero
-	    }
-	    ctx.b[ctx.c++] = input[i];
-	  }
-	}
-
-	// Completes a BLAKE2b streaming hash
-	// Returns a Uint8Array containing the message digest
-	function blake2bFinal (ctx, out) {
-	  ctx.t += ctx.c; // mark last block offset
-
-	  while (ctx.c < 128) { // fill up with zeros
-	    ctx.b[ctx.c++] = 0;
-	  }
-	  blake2bCompress(ctx, true); // final block flag = 1
-
-	  for (var i = 0; i < ctx.outlen; i++) {
-	    out[i] = ctx.h[i >> 2] >> (8 * (i & 3));
-	  }
-	  return out
-	}
-
-	function hexSlice (buf) {
-	  var str = '';
-	  for (var i = 0; i < buf.length; i++) str += toHex(buf[i]);
-	  return str
-	}
-
-	function toHex (n) {
-	  if (n < 16) return '0' + n.toString(16)
-	  return n.toString(16)
-	}
-
-	var Proto = Blake2b;
-
-	blake2b$3.exports = function createHash (outlen, key, salt, personal, noAssert) {
-	  if (noAssert !== true) {
-	    assert(outlen >= BYTES_MIN, 'outlen must be at least ' + BYTES_MIN + ', was given ' + outlen);
-	    assert(outlen <= BYTES_MAX, 'outlen must be at most ' + BYTES_MAX + ', was given ' + outlen);
-	    if (key != null) {
-	      assert(key instanceof Uint8Array, 'key must be Uint8Array or Buffer');
-	      assert(key.length >= KEYBYTES_MIN, 'key must be at least ' + KEYBYTES_MIN + ', was given ' + key.length);
-	      assert(key.length <= KEYBYTES_MAX, 'key must be at most ' + KEYBYTES_MAX + ', was given ' + key.length);
-	    }
-	    if (salt != null) {
-	      assert(salt instanceof Uint8Array, 'salt must be Uint8Array or Buffer');
-	      assert(salt.length === SALTBYTES, 'salt must be exactly ' + SALTBYTES + ', was given ' + salt.length);
-	    }
-	    if (personal != null) {
-	      assert(personal instanceof Uint8Array, 'personal must be Uint8Array or Buffer');
-	      assert(personal.length === PERSONALBYTES, 'personal must be exactly ' + PERSONALBYTES + ', was given ' + personal.length);
-	    }
-	  }
-
-	  return new Proto(outlen, key, salt, personal)
-	};
-
-	blake2b$3.exports.ready = function (cb) {
-	  b2wasm.ready(function () { // ignore errors
-	    cb();
-	  });
-	};
-
-	blake2b$3.exports.WASM_SUPPORTED = b2wasm.SUPPORTED;
-	blake2b$3.exports.WASM_LOADED = false;
-
-	var BYTES_MIN = blake2b$3.exports.BYTES_MIN = 16;
-	var BYTES_MAX = blake2b$3.exports.BYTES_MAX = 64;
-	blake2b$3.exports.BYTES = 32;
-	var KEYBYTES_MIN = blake2b$3.exports.KEYBYTES_MIN = 16;
-	var KEYBYTES_MAX = blake2b$3.exports.KEYBYTES_MAX = 64;
-	blake2b$3.exports.KEYBYTES = 32;
-	var SALTBYTES = blake2b$3.exports.SALTBYTES = 16;
-	var PERSONALBYTES = blake2b$3.exports.PERSONALBYTES = 16;
-
-	b2wasm.ready(function (err) {
-	  if (!err) {
-	    blake2b$3.exports.WASM_LOADED = true;
-	    blake2b$3.exports = b2wasm;
-	  }
-	});
-	return blake2b$3.exports;
-}
-
-var blake2bExports = /*@__PURE__*/ requireBlake2b();
-var blake2b$1 = /*@__PURE__*/getDefaultExportFromCjs(blake2bExports);
-
 /**
- * Hash given collection of blobs.
- *
- * If empty array is given a zero-hash is returned.
+ * Derives a Bandersnatch secret key from a seed.
+ * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md#derivation-method
  */
-function hashBlobs$1(r, allocator = defaultAllocator) {
-    const out = allocator.emptyHash();
-    if (r.length === 0) {
-        return out.asOpaque();
-    }
-    const hasher = blake2b$1(HASH_SIZE);
-    for (const v of r) {
-        hasher?.update(v instanceof BytesBlob ? v.raw : v);
-    }
-    hasher?.digest(out.raw);
-    return out.asOpaque();
+function deriveBandersnatchSecretKey(seed, blake2b) {
+    return blake2b.hashBytes(BytesBlob.blobFromParts([BANDERSNATCH_SECRET_KEY.raw, seed.raw])).asOpaque();
 }
-/** Hash given blob of bytes. */
-function hashBytes(blob, allocator = defaultAllocator) {
-    const hasher = blake2b$1(HASH_SIZE);
-    const bytes = blob instanceof BytesBlob ? blob.raw : blob;
-    hasher?.update(bytes);
-    const out = allocator.emptyHash();
-    hasher?.digest(out.raw);
-    return out;
+/**
+ * Derive Ed25519 public key from secret seed
+ */
+async function deriveEd25519PublicKey(seed) {
+    return (await privateKey(seed)).pubKey;
 }
-/** Convert given string into bytes and hash it. */
-function hashString(str, allocator = defaultAllocator) {
-    return hashBytes(BytesBlob.blobFromString(str), allocator);
+/**
+ * Derive Bandersnatch public key from secret seed
+ */
+function deriveBandersnatchPublicKey(seed) {
+    return publicKey(seed.raw);
 }
 
-var blake2b = /*#__PURE__*/Object.freeze({
+var keyDerivation = /*#__PURE__*/Object.freeze({
+  __proto__: null,
+  SEED_SIZE: SEED_SIZE,
+  deriveBandersnatchPublicKey: deriveBandersnatchPublicKey,
+  deriveBandersnatchSecretKey: deriveBandersnatchSecretKey,
+  deriveEd25519PublicKey: deriveEd25519PublicKey,
+  deriveEd25519SecretKey: deriveEd25519SecretKey,
+  trivialSeed: trivialSeed
+});
+
+var index$p = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  hashBlobs: hashBlobs$1,
-  hashBytes: hashBytes,
-  hashString: hashString
+  BANDERSNATCH_KEY_BYTES: BANDERSNATCH_KEY_BYTES,
+  BANDERSNATCH_PROOF_BYTES: BANDERSNATCH_PROOF_BYTES,
+  BANDERSNATCH_RING_ROOT_BYTES: BANDERSNATCH_RING_ROOT_BYTES,
+  BANDERSNATCH_VRF_SIGNATURE_BYTES: BANDERSNATCH_VRF_SIGNATURE_BYTES,
+  BLS_KEY_BYTES: BLS_KEY_BYTES,
+  ED25519_KEY_BYTES: ED25519_KEY_BYTES,
+  ED25519_PRIV_KEY_BYTES: ED25519_PRIV_KEY_BYTES,
+  ED25519_SIGNATURE_BYTES: ED25519_SIGNATURE_BYTES,
+  Ed25519Pair: Ed25519Pair,
+  SEED_SIZE: SEED_SIZE,
+  bandersnatch: bandersnatch,
+  bandersnatchWasm: bandersnatch_exports,
+  ed25519: ed25519,
+  initWasm: initAll,
+  keyDerivation: keyDerivation
 });
 
 /*!
@@ -4813,7 +4080,78 @@ function WASMInterface(binary, hashLength) {
 
 new Mutex();
 
+var name$j = "blake2b";
+var data$j = "AGFzbQEAAAABEQRgAAF/YAJ/fwBgAX8AYAAAAwoJAAECAwECAgABBQQBAQICBg4CfwFBsIsFC38AQYAICwdwCAZtZW1vcnkCAA5IYXNoX0dldEJ1ZmZlcgAACkhhc2hfRmluYWwAAwlIYXNoX0luaXQABQtIYXNoX1VwZGF0ZQAGDUhhc2hfR2V0U3RhdGUABw5IYXNoX0NhbGN1bGF0ZQAIClNUQVRFX1NJWkUDAQrTOAkFAEGACQvrAgIFfwF+AkAgAUEBSA0AAkACQAJAIAFBgAFBACgC4IoBIgJrIgNKDQAgASEEDAELQQBBADYC4IoBAkAgAkH/AEoNACACQeCJAWohBSAAIQRBACEGA0AgBSAELQAAOgAAIARBAWohBCAFQQFqIQUgAyAGQQFqIgZB/wFxSg0ACwtBAEEAKQPAiQEiB0KAAXw3A8CJAUEAQQApA8iJASAHQv9+Vq18NwPIiQFB4IkBEAIgACADaiEAAkAgASADayIEQYEBSA0AIAIgAWohBQNAQQBBACkDwIkBIgdCgAF8NwPAiQFBAEEAKQPIiQEgB0L/flatfDcDyIkBIAAQAiAAQYABaiEAIAVBgH9qIgVBgAJLDQALIAVBgH9qIQQMAQsgBEEATA0BC0EAIQUDQCAFQQAoAuCKAWpB4IkBaiAAIAVqLQAAOgAAIAQgBUEBaiIFQf8BcUoNAAsLQQBBACgC4IoBIARqNgLgigELC78uASR+QQBBACkD0IkBQQApA7CJASIBQQApA5CJAXwgACkDICICfCIDhULr+obav7X2wR+FQiCJIgRCq/DT9K/uvLc8fCIFIAGFQiiJIgYgA3wgACkDKCIBfCIHIASFQjCJIgggBXwiCSAGhUIBiSIKQQApA8iJAUEAKQOoiQEiBEEAKQOIiQF8IAApAxAiA3wiBYVCn9j52cKR2oKbf4VCIIkiC0K7zqqm2NDrs7t/fCIMIASFQiiJIg0gBXwgACkDGCIEfCIOfCAAKQNQIgV8Ig9BACkDwIkBQQApA6CJASIQQQApA4CJASIRfCAAKQMAIgZ8IhKFQtGFmu/6z5SH0QCFQiCJIhNCiJLznf/M+YTqAHwiFCAQhUIoiSIVIBJ8IAApAwgiEHwiFiAThUIwiSIXhUIgiSIYQQApA9iJAUEAKQO4iQEiE0EAKQOYiQF8IAApAzAiEnwiGYVC+cL4m5Gjs/DbAIVCIIkiGkLx7fT4paf9p6V/fCIbIBOFQiiJIhwgGXwgACkDOCITfCIZIBqFQjCJIhogG3wiG3wiHSAKhUIoiSIeIA98IAApA1giCnwiDyAYhUIwiSIYIB18Ih0gDiALhUIwiSIOIAx8Ih8gDYVCAYkiDCAWfCAAKQNAIgt8Ig0gGoVCIIkiFiAJfCIaIAyFQiiJIiAgDXwgACkDSCIJfCIhIBaFQjCJIhYgGyAchUIBiSIMIAd8IAApA2AiB3wiDSAOhUIgiSIOIBcgFHwiFHwiFyAMhUIoiSIbIA18IAApA2giDHwiHCAOhUIwiSIOIBd8IhcgG4VCAYkiGyAZIBQgFYVCAYkiFHwgACkDcCINfCIVIAiFQiCJIhkgH3wiHyAUhUIoiSIUIBV8IAApA3giCHwiFXwgDHwiIoVCIIkiI3wiJCAbhUIoiSIbICJ8IBJ8IiIgFyAYIBUgGYVCMIkiFSAffCIZIBSFQgGJIhQgIXwgDXwiH4VCIIkiGHwiFyAUhUIoiSIUIB98IAV8Ih8gGIVCMIkiGCAXfCIXIBSFQgGJIhR8IAF8IiEgFiAafCIWIBUgHSAehUIBiSIaIBx8IAl8IhyFQiCJIhV8Ih0gGoVCKIkiGiAcfCAIfCIcIBWFQjCJIhWFQiCJIh4gGSAOIBYgIIVCAYkiFiAPfCACfCIPhUIgiSIOfCIZIBaFQiiJIhYgD3wgC3wiDyAOhUIwiSIOIBl8Ihl8IiAgFIVCKIkiFCAhfCAEfCIhIB6FQjCJIh4gIHwiICAiICOFQjCJIiIgJHwiIyAbhUIBiSIbIBx8IAp8IhwgDoVCIIkiDiAXfCIXIBuFQiiJIhsgHHwgE3wiHCAOhUIwiSIOIBkgFoVCAYkiFiAffCAQfCIZICKFQiCJIh8gFSAdfCIVfCIdIBaFQiiJIhYgGXwgB3wiGSAfhUIwiSIfIB18Ih0gFoVCAYkiFiAVIBqFQgGJIhUgD3wgBnwiDyAYhUIgiSIYICN8IhogFYVCKIkiFSAPfCADfCIPfCAHfCIihUIgiSIjfCIkIBaFQiiJIhYgInwgBnwiIiAjhUIwiSIjICR8IiQgFoVCAYkiFiAOIBd8Ig4gDyAYhUIwiSIPICAgFIVCAYkiFCAZfCAKfCIXhUIgiSIYfCIZIBSFQiiJIhQgF3wgC3wiF3wgBXwiICAPIBp8Ig8gHyAOIBuFQgGJIg4gIXwgCHwiGoVCIIkiG3wiHyAOhUIoiSIOIBp8IAx8IhogG4VCMIkiG4VCIIkiISAdIB4gDyAVhUIBiSIPIBx8IAF8IhWFQiCJIhx8Ih0gD4VCKIkiDyAVfCADfCIVIByFQjCJIhwgHXwiHXwiHiAWhUIoiSIWICB8IA18IiAgIYVCMIkiISAefCIeIBogFyAYhUIwiSIXIBl8IhggFIVCAYkiFHwgCXwiGSAchUIgiSIaICR8IhwgFIVCKIkiFCAZfCACfCIZIBqFQjCJIhogHSAPhUIBiSIPICJ8IAR8Ih0gF4VCIIkiFyAbIB98Iht8Ih8gD4VCKIkiDyAdfCASfCIdIBeFQjCJIhcgH3wiHyAPhUIBiSIPIBsgDoVCAYkiDiAVfCATfCIVICOFQiCJIhsgGHwiGCAOhUIoiSIOIBV8IBB8IhV8IAx8IiKFQiCJIiN8IiQgD4VCKIkiDyAifCAHfCIiICOFQjCJIiMgJHwiJCAPhUIBiSIPIBogHHwiGiAVIBuFQjCJIhUgHiAWhUIBiSIWIB18IAR8IhuFQiCJIhx8Ih0gFoVCKIkiFiAbfCAQfCIbfCABfCIeIBUgGHwiFSAXIBogFIVCAYkiFCAgfCATfCIYhUIgiSIXfCIaIBSFQiiJIhQgGHwgCXwiGCAXhUIwiSIXhUIgiSIgIB8gISAVIA6FQgGJIg4gGXwgCnwiFYVCIIkiGXwiHyAOhUIoiSIOIBV8IA18IhUgGYVCMIkiGSAffCIffCIhIA+FQiiJIg8gHnwgBXwiHiAghUIwiSIgICF8IiEgGyAchUIwiSIbIB18IhwgFoVCAYkiFiAYfCADfCIYIBmFQiCJIhkgJHwiHSAWhUIoiSIWIBh8IBJ8IhggGYVCMIkiGSAfIA6FQgGJIg4gInwgAnwiHyAbhUIgiSIbIBcgGnwiF3wiGiAOhUIoiSIOIB98IAZ8Ih8gG4VCMIkiGyAafCIaIA6FQgGJIg4gFSAXIBSFQgGJIhR8IAh8IhUgI4VCIIkiFyAcfCIcIBSFQiiJIhQgFXwgC3wiFXwgBXwiIoVCIIkiI3wiJCAOhUIoiSIOICJ8IAh8IiIgGiAgIBUgF4VCMIkiFSAcfCIXIBSFQgGJIhQgGHwgCXwiGIVCIIkiHHwiGiAUhUIoiSIUIBh8IAZ8IhggHIVCMIkiHCAafCIaIBSFQgGJIhR8IAR8IiAgGSAdfCIZIBUgISAPhUIBiSIPIB98IAN8Ih2FQiCJIhV8Ih8gD4VCKIkiDyAdfCACfCIdIBWFQjCJIhWFQiCJIiEgFyAbIBkgFoVCAYkiFiAefCABfCIZhUIgiSIbfCIXIBaFQiiJIhYgGXwgE3wiGSAbhUIwiSIbIBd8Ihd8Ih4gFIVCKIkiFCAgfCAMfCIgICGFQjCJIiEgHnwiHiAiICOFQjCJIiIgJHwiIyAOhUIBiSIOIB18IBJ8Ih0gG4VCIIkiGyAafCIaIA6FQiiJIg4gHXwgC3wiHSAbhUIwiSIbIBcgFoVCAYkiFiAYfCANfCIXICKFQiCJIhggFSAffCIVfCIfIBaFQiiJIhYgF3wgEHwiFyAYhUIwiSIYIB98Ih8gFoVCAYkiFiAVIA+FQgGJIg8gGXwgCnwiFSAchUIgiSIZICN8IhwgD4VCKIkiDyAVfCAHfCIVfCASfCIihUIgiSIjfCIkIBaFQiiJIhYgInwgBXwiIiAjhUIwiSIjICR8IiQgFoVCAYkiFiAbIBp8IhogFSAZhUIwiSIVIB4gFIVCAYkiFCAXfCADfCIXhUIgiSIZfCIbIBSFQiiJIhQgF3wgB3wiF3wgAnwiHiAVIBx8IhUgGCAaIA6FQgGJIg4gIHwgC3wiGoVCIIkiGHwiHCAOhUIoiSIOIBp8IAR8IhogGIVCMIkiGIVCIIkiICAfICEgFSAPhUIBiSIPIB18IAZ8IhWFQiCJIh18Ih8gD4VCKIkiDyAVfCAKfCIVIB2FQjCJIh0gH3wiH3wiISAWhUIoiSIWIB58IAx8Ih4gIIVCMIkiICAhfCIhIBogFyAZhUIwiSIXIBt8IhkgFIVCAYkiFHwgEHwiGiAdhUIgiSIbICR8Ih0gFIVCKIkiFCAafCAJfCIaIBuFQjCJIhsgHyAPhUIBiSIPICJ8IBN8Ih8gF4VCIIkiFyAYIBx8Ihh8IhwgD4VCKIkiDyAffCABfCIfIBeFQjCJIhcgHHwiHCAPhUIBiSIPIBggDoVCAYkiDiAVfCAIfCIVICOFQiCJIhggGXwiGSAOhUIoiSIOIBV8IA18IhV8IA18IiKFQiCJIiN8IiQgD4VCKIkiDyAifCAMfCIiICOFQjCJIiMgJHwiJCAPhUIBiSIPIBsgHXwiGyAVIBiFQjCJIhUgISAWhUIBiSIWIB98IBB8IhiFQiCJIh18Ih8gFoVCKIkiFiAYfCAIfCIYfCASfCIhIBUgGXwiFSAXIBsgFIVCAYkiFCAefCAHfCIZhUIgiSIXfCIbIBSFQiiJIhQgGXwgAXwiGSAXhUIwiSIXhUIgiSIeIBwgICAVIA6FQgGJIg4gGnwgAnwiFYVCIIkiGnwiHCAOhUIoiSIOIBV8IAV8IhUgGoVCMIkiGiAcfCIcfCIgIA+FQiiJIg8gIXwgBHwiISAehUIwiSIeICB8IiAgGCAdhUIwiSIYIB98Ih0gFoVCAYkiFiAZfCAGfCIZIBqFQiCJIhogJHwiHyAWhUIoiSIWIBl8IBN8IhkgGoVCMIkiGiAcIA6FQgGJIg4gInwgCXwiHCAYhUIgiSIYIBcgG3wiF3wiGyAOhUIoiSIOIBx8IAN8IhwgGIVCMIkiGCAbfCIbIA6FQgGJIg4gFSAXIBSFQgGJIhR8IAt8IhUgI4VCIIkiFyAdfCIdIBSFQiiJIhQgFXwgCnwiFXwgBHwiIoVCIIkiI3wiJCAOhUIoiSIOICJ8IAl8IiIgGyAeIBUgF4VCMIkiFSAdfCIXIBSFQgGJIhQgGXwgDHwiGYVCIIkiHXwiGyAUhUIoiSIUIBl8IAp8IhkgHYVCMIkiHSAbfCIbIBSFQgGJIhR8IAN8Ih4gGiAffCIaIBUgICAPhUIBiSIPIBx8IAd8IhyFQiCJIhV8Ih8gD4VCKIkiDyAcfCAQfCIcIBWFQjCJIhWFQiCJIiAgFyAYIBogFoVCAYkiFiAhfCATfCIahUIgiSIYfCIXIBaFQiiJIhYgGnwgDXwiGiAYhUIwiSIYIBd8Ihd8IiEgFIVCKIkiFCAefCAFfCIeICCFQjCJIiAgIXwiISAiICOFQjCJIiIgJHwiIyAOhUIBiSIOIBx8IAt8IhwgGIVCIIkiGCAbfCIbIA6FQiiJIg4gHHwgEnwiHCAYhUIwiSIYIBcgFoVCAYkiFiAZfCABfCIXICKFQiCJIhkgFSAffCIVfCIfIBaFQiiJIhYgF3wgBnwiFyAZhUIwiSIZIB98Ih8gFoVCAYkiFiAVIA+FQgGJIg8gGnwgCHwiFSAdhUIgiSIaICN8Ih0gD4VCKIkiDyAVfCACfCIVfCANfCIihUIgiSIjfCIkIBaFQiiJIhYgInwgCXwiIiAjhUIwiSIjICR8IiQgFoVCAYkiFiAYIBt8IhggFSAahUIwiSIVICEgFIVCAYkiFCAXfCASfCIXhUIgiSIafCIbIBSFQiiJIhQgF3wgCHwiF3wgB3wiISAVIB18IhUgGSAYIA6FQgGJIg4gHnwgBnwiGIVCIIkiGXwiHSAOhUIoiSIOIBh8IAt8IhggGYVCMIkiGYVCIIkiHiAfICAgFSAPhUIBiSIPIBx8IAp8IhWFQiCJIhx8Ih8gD4VCKIkiDyAVfCAEfCIVIByFQjCJIhwgH3wiH3wiICAWhUIoiSIWICF8IAN8IiEgHoVCMIkiHiAgfCIgIBggFyAahUIwiSIXIBt8IhogFIVCAYkiFHwgBXwiGCAchUIgiSIbICR8IhwgFIVCKIkiFCAYfCABfCIYIBuFQjCJIhsgHyAPhUIBiSIPICJ8IAx8Ih8gF4VCIIkiFyAZIB18Ihl8Ih0gD4VCKIkiDyAffCATfCIfIBeFQjCJIhcgHXwiHSAPhUIBiSIPIBkgDoVCAYkiDiAVfCAQfCIVICOFQiCJIhkgGnwiGiAOhUIoiSIOIBV8IAJ8IhV8IBN8IiKFQiCJIiN8IiQgD4VCKIkiDyAifCASfCIiICOFQjCJIiMgJHwiJCAPhUIBiSIPIBsgHHwiGyAVIBmFQjCJIhUgICAWhUIBiSIWIB98IAt8IhmFQiCJIhx8Ih8gFoVCKIkiFiAZfCACfCIZfCAJfCIgIBUgGnwiFSAXIBsgFIVCAYkiFCAhfCAFfCIahUIgiSIXfCIbIBSFQiiJIhQgGnwgA3wiGiAXhUIwiSIXhUIgiSIhIB0gHiAVIA6FQgGJIg4gGHwgEHwiFYVCIIkiGHwiHSAOhUIoiSIOIBV8IAF8IhUgGIVCMIkiGCAdfCIdfCIeIA+FQiiJIg8gIHwgDXwiICAhhUIwiSIhIB58Ih4gGSAchUIwiSIZIB98IhwgFoVCAYkiFiAafCAIfCIaIBiFQiCJIhggJHwiHyAWhUIoiSIWIBp8IAp8IhogGIVCMIkiGCAdIA6FQgGJIg4gInwgBHwiHSAZhUIgiSIZIBcgG3wiF3wiGyAOhUIoiSIOIB18IAd8Ih0gGYVCMIkiGSAbfCIbIA6FQgGJIg4gFSAXIBSFQgGJIhR8IAx8IhUgI4VCIIkiFyAcfCIcIBSFQiiJIhQgFXwgBnwiFXwgEnwiIoVCIIkiI3wiJCAOhUIoiSIOICJ8IBN8IiIgGyAhIBUgF4VCMIkiFSAcfCIXIBSFQgGJIhQgGnwgBnwiGoVCIIkiHHwiGyAUhUIoiSIUIBp8IBB8IhogHIVCMIkiHCAbfCIbIBSFQgGJIhR8IA18IiEgGCAffCIYIBUgHiAPhUIBiSIPIB18IAJ8Ih2FQiCJIhV8Ih4gD4VCKIkiDyAdfCABfCIdIBWFQjCJIhWFQiCJIh8gFyAZIBggFoVCAYkiFiAgfCADfCIYhUIgiSIZfCIXIBaFQiiJIhYgGHwgBHwiGCAZhUIwiSIZIBd8Ihd8IiAgFIVCKIkiFCAhfCAIfCIhIB+FQjCJIh8gIHwiICAiICOFQjCJIiIgJHwiIyAOhUIBiSIOIB18IAd8Ih0gGYVCIIkiGSAbfCIbIA6FQiiJIg4gHXwgDHwiHSAZhUIwiSIZIBcgFoVCAYkiFiAafCALfCIXICKFQiCJIhogFSAefCIVfCIeIBaFQiiJIhYgF3wgCXwiFyAahUIwiSIaIB58Ih4gFoVCAYkiFiAVIA+FQgGJIg8gGHwgBXwiFSAchUIgiSIYICN8IhwgD4VCKIkiDyAVfCAKfCIVfCACfCIChUIgiSIifCIjIBaFQiiJIhYgAnwgC3wiAiAihUIwiSILICN8IiIgFoVCAYkiFiAZIBt8IhkgFSAYhUIwiSIVICAgFIVCAYkiFCAXfCANfCINhUIgiSIXfCIYIBSFQiiJIhQgDXwgBXwiBXwgEHwiECAVIBx8Ig0gGiAZIA6FQgGJIg4gIXwgDHwiDIVCIIkiFXwiGSAOhUIoiSIOIAx8IBJ8IhIgFYVCMIkiDIVCIIkiFSAeIB8gDSAPhUIBiSINIB18IAl8IgmFQiCJIg98IhogDYVCKIkiDSAJfCAIfCIJIA+FQjCJIgggGnwiD3wiGiAWhUIoiSIWIBB8IAd8IhAgEYUgDCAZfCIHIA6FQgGJIgwgCXwgCnwiCiALhUIgiSILIAUgF4VCMIkiBSAYfCIJfCIOIAyFQiiJIgwgCnwgE3wiEyALhUIwiSIKIA58IguFNwOAiQFBACADIAYgDyANhUIBiSINIAJ8fCICIAWFQiCJIgUgB3wiBiANhUIoiSIHIAJ8fCICQQApA4iJAYUgBCABIBIgCSAUhUIBiSIDfHwiASAIhUIgiSISICJ8IgkgA4VCKIkiAyABfHwiASAShUIwiSIEIAl8IhKFNwOIiQFBACATQQApA5CJAYUgECAVhUIwiSIQIBp8IhOFNwOQiQFBACABQQApA5iJAYUgAiAFhUIwiSICIAZ8IgGFNwOYiQFBACASIAOFQgGJQQApA6CJAYUgAoU3A6CJAUEAIBMgFoVCAYlBACkDqIkBhSAKhTcDqIkBQQAgASAHhUIBiUEAKQOwiQGFIASFNwOwiQFBACALIAyFQgGJQQApA7iJAYUgEIU3A7iJAQvdAgUBfwF+AX8BfgJ/IwBBwABrIgAkAAJAQQApA9CJAUIAUg0AQQBBACkDwIkBIgFBACgC4IoBIgKsfCIDNwPAiQFBAEEAKQPIiQEgAyABVK18NwPIiQECQEEALQDoigFFDQBBAEJ/NwPYiQELQQBCfzcD0IkBAkAgAkH/AEoNAEEAIQQDQCACIARqQeCJAWpBADoAACAEQQFqIgRBgAFBACgC4IoBIgJrSA0ACwtB4IkBEAIgAEEAKQOAiQE3AwAgAEEAKQOIiQE3AwggAEEAKQOQiQE3AxAgAEEAKQOYiQE3AxggAEEAKQOgiQE3AyAgAEEAKQOoiQE3AyggAEEAKQOwiQE3AzAgAEEAKQO4iQE3AzhBACgC5IoBIgVBAUgNAEEAIQRBACECA0AgBEGACWogACAEai0AADoAACAEQQFqIQQgBSACQQFqIgJB/wFxSg0ACwsgAEHAAGokAAv9AwMBfwF+AX8jAEGAAWsiAiQAQQBBgQI7AfKKAUEAIAE6APGKAUEAIAA6APCKAUGQfiEAA0AgAEGAiwFqQgA3AAAgAEH4igFqQgA3AAAgAEHwigFqQgA3AAAgAEEYaiIADQALQQAhAEEAQQApA/CKASIDQoiS853/zPmE6gCFNwOAiQFBAEEAKQP4igFCu86qptjQ67O7f4U3A4iJAUEAQQApA4CLAUKr8NP0r+68tzyFNwOQiQFBAEEAKQOIiwFC8e30+KWn/aelf4U3A5iJAUEAQQApA5CLAULRhZrv+s+Uh9EAhTcDoIkBQQBBACkDmIsBQp/Y+dnCkdqCm3+FNwOoiQFBAEEAKQOgiwFC6/qG2r+19sEfhTcDsIkBQQBBACkDqIsBQvnC+JuRo7Pw2wCFNwO4iQFBACADp0H/AXE2AuSKAQJAIAFBAUgNACACQgA3A3ggAkIANwNwIAJCADcDaCACQgA3A2AgAkIANwNYIAJCADcDUCACQgA3A0ggAkIANwNAIAJCADcDOCACQgA3AzAgAkIANwMoIAJCADcDICACQgA3AxggAkIANwMQIAJCADcDCCACQgA3AwBBACEEA0AgAiAAaiAAQYAJai0AADoAACAAQQFqIQAgBEEBaiIEQf8BcSABSA0ACyACQYABEAELIAJBgAFqJAALEgAgAEEDdkH/P3EgAEEQdhAECwkAQYAJIAAQAQsGAEGAiQELGwAgAUEDdkH/P3EgAUEQdhAEQYAJIAAQARADCwsLAQBBgAgLBPAAAAA=";
+var hash$j = "c6f286e6";
+var wasmJson$j = {
+	name: name$j,
+	data: data$j,
+	hash: hash$j
+};
+
 new Mutex();
+function validateBits$4(bits) {
+    if (!Number.isInteger(bits) || bits < 8 || bits > 512 || bits % 8 !== 0) {
+        return new Error("Invalid variant! Valid values: 8, 16, ..., 512");
+    }
+    return null;
+}
+function getInitParam$1(outputBits, keyBits) {
+    return outputBits | (keyBits << 16);
+}
+/**
+ * Creates a new BLAKE2b hash instance
+ * @param bits Number of output bits, which has to be a number
+ *             divisible by 8, between 8 and 512. Defaults to 512.
+ * @param key Optional key (string, Buffer or TypedArray). Maximum length is 64 bytes.
+ */
+function createBLAKE2b(bits = 512, key = null) {
+    if (validateBits$4(bits)) {
+        return Promise.reject(validateBits$4(bits));
+    }
+    let keyBuffer = null;
+    let initParam = bits;
+    if (key !== null) {
+        keyBuffer = getUInt8Buffer(key);
+        if (keyBuffer.length > 64) {
+            return Promise.reject(new Error("Max key length is 64 bytes"));
+        }
+        initParam = getInitParam$1(bits, keyBuffer.length);
+    }
+    const outputSize = bits / 8;
+    return WASMInterface(wasmJson$j, outputSize).then((wasm) => {
+        if (initParam > 512) {
+            wasm.writeMemory(keyBuffer);
+        }
+        wasm.init(initParam);
+        const obj = {
+            init: initParam > 512
+                ? () => {
+                    wasm.writeMemory(keyBuffer);
+                    wasm.init(initParam);
+                    return obj;
+                }
+                : () => {
+                    wasm.init(initParam);
+                    return obj;
+                },
+            update: (data) => {
+                wasm.update(data);
+                return obj;
+            },
+            // biome-ignore lint/suspicious/noExplicitAny: Conflict with IHasher type
+            digest: (outputType) => wasm.digest(outputType),
+            save: () => wasm.save(),
+            load: (data) => {
+                wasm.load(data);
+                return obj;
+            },
+            blockSize: 128,
+            digestSize: outputSize,
+        };
+        return obj;
+    });
+}
 
 new Mutex();
 
@@ -4903,6 +4241,79 @@ new Mutex();
 
 new Mutex();
 
+/**
+ * Size of the output of the hash functions.
+ *
+ * https://graypaper.fluffylabs.dev/#/579bd12/073101073c01
+ *
+ */
+const HASH_SIZE = 32;
+/** A hash without last byte (useful for trie representation). */
+const TRUNCATED_HASH_SIZE = 31;
+const ZERO_HASH = Bytes.zero(HASH_SIZE);
+/**
+ * Container for some object with a hash that is related to this object.
+ *
+ * After calculating the hash these two should be passed together to avoid
+ * unnecessary re-hashing of the data.
+ */
+class WithHash extends WithDebug {
+    hash;
+    data;
+    constructor(hash, data) {
+        super();
+        this.hash = hash;
+        this.data = data;
+    }
+}
+/**
+ * Extension of [`WithHash`] additionally containing an encoded version of the object.
+ */
+class WithHashAndBytes extends WithHash {
+    encoded;
+    constructor(hash, data, encoded) {
+        super(hash, data);
+        this.encoded = encoded;
+    }
+}
+
+const zero$1 = Bytes.zero(HASH_SIZE);
+class Blake2b {
+    hasher;
+    static async createHasher() {
+        return new Blake2b(await createBLAKE2b(HASH_SIZE * 8));
+    }
+    constructor(hasher) {
+        this.hasher = hasher;
+    }
+    /**
+     * Hash given collection of blobs.
+     *
+     * If empty array is given a zero-hash is returned.
+     */
+    hashBlobs(r) {
+        if (r.length === 0) {
+            return zero$1.asOpaque();
+        }
+        const hasher = this.hasher.init();
+        for (const v of r) {
+            hasher.update(v instanceof BytesBlob ? v.raw : v);
+        }
+        return Bytes.fromBlob(hasher.digest("binary"), HASH_SIZE).asOpaque();
+    }
+    /** Hash given blob of bytes. */
+    hashBytes(blob) {
+        const hasher = this.hasher.init();
+        const bytes = blob instanceof BytesBlob ? blob.raw : blob;
+        hasher.update(bytes);
+        return Bytes.fromBlob(hasher.digest("binary"), HASH_SIZE).asOpaque();
+    }
+    /** Convert given string into bytes and hash it. */
+    hashString(str) {
+        return this.hashBytes(BytesBlob.blobFromString(str));
+    }
+}
+
 class KeccakHasher {
     hasher;
     static async create() {
@@ -4927,91 +4338,20 @@ var keccak = /*#__PURE__*/Object.freeze({
   hashBlobs: hashBlobs
 });
 
-var index$p = /*#__PURE__*/Object.freeze({
+// TODO [ToDr] (#213) this should most likely be moved to a separate
+// package to avoid pulling in unnecessary deps.
+
+var index$o = /*#__PURE__*/Object.freeze({
   __proto__: null,
+  Blake2b: Blake2b,
   HASH_SIZE: HASH_SIZE,
-  PageAllocator: PageAllocator,
-  SimpleAllocator: SimpleAllocator,
   TRUNCATED_HASH_SIZE: TRUNCATED_HASH_SIZE,
   WithHash: WithHash,
   WithHashAndBytes: WithHashAndBytes,
   ZERO_HASH: ZERO_HASH,
-  blake2b: blake2b,
-  defaultAllocator: defaultAllocator,
   keccak: keccak
 });
 
-const SEED_SIZE = 32;
-const ED25519_SECRET_KEY = Bytes.blobFromString("jam_val_key_ed25519");
-const BANDERSNATCH_SECRET_KEY = Bytes.blobFromString("jam_val_key_bandersnatch");
-/**
- * JIP-5: Secret key derivation
- *
- * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md */
-/**
- * Deriving a 32-byte seed from a 32-bit unsigned integer
- * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md#trivial-seeds
- */
-function trivialSeed(s) {
-    const s_le = u32AsLeBytes(s);
-    return Bytes.fromBlob(BytesBlob.blobFromParts([s_le, s_le, s_le, s_le, s_le, s_le, s_le, s_le]).raw, SEED_SIZE).asOpaque();
-}
-/**
- * Derives a Ed25519 secret key from a seed.
- * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md#derivation-method
- */
-function deriveEd25519SecretKey(seed, allocator = new SimpleAllocator()) {
-    return hashBytes(BytesBlob.blobFromParts([ED25519_SECRET_KEY.raw, seed.raw]), allocator).asOpaque();
-}
-/**
- * Derives a Bandersnatch secret key from a seed.
- * https://github.com/polkadot-fellows/JIPs/blob/7048f79edf4f4eb8bfe6fb42e6bbf61900f44c65/JIP-5.md#derivation-method
- */
-function deriveBandersnatchSecretKey(seed, allocator = new SimpleAllocator()) {
-    return hashBytes(BytesBlob.blobFromParts([BANDERSNATCH_SECRET_KEY.raw, seed.raw]), allocator).asOpaque();
-}
-/**
- * Derive Ed25519 public key from secret seed
- */
-async function deriveEd25519PublicKey(seed) {
-    return (await privateKey(seed)).pubKey;
-}
-/**
- * Derive Bandersnatch public key from secret seed
- */
-function deriveBandersnatchPublicKey(seed) {
-    return publicKey(seed.raw);
-}
-
-var keyDerivation = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  SEED_SIZE: SEED_SIZE,
-  deriveBandersnatchPublicKey: deriveBandersnatchPublicKey,
-  deriveBandersnatchSecretKey: deriveBandersnatchSecretKey,
-  deriveEd25519PublicKey: deriveEd25519PublicKey,
-  deriveEd25519SecretKey: deriveEd25519SecretKey,
-  trivialSeed: trivialSeed
-});
-
-var index$o = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  BANDERSNATCH_KEY_BYTES: BANDERSNATCH_KEY_BYTES,
-  BANDERSNATCH_PROOF_BYTES: BANDERSNATCH_PROOF_BYTES,
-  BANDERSNATCH_RING_ROOT_BYTES: BANDERSNATCH_RING_ROOT_BYTES,
-  BANDERSNATCH_VRF_SIGNATURE_BYTES: BANDERSNATCH_VRF_SIGNATURE_BYTES,
-  BLS_KEY_BYTES: BLS_KEY_BYTES,
-  ED25519_KEY_BYTES: ED25519_KEY_BYTES,
-  ED25519_PRIV_KEY_BYTES: ED25519_PRIV_KEY_BYTES,
-  ED25519_SIGNATURE_BYTES: ED25519_SIGNATURE_BYTES,
-  Ed25519Pair: Ed25519Pair,
-  SEED_SIZE: SEED_SIZE,
-  bandersnatch: bandersnatch,
-  bandersnatchWasm: bandersnatch_exports,
-  ed25519: ed25519,
-  initWasm: initAll,
-  keyDerivation: keyDerivation
-});
-
 /** A map which uses hashes as keys. */
 class HashDictionary {
     // TODO [ToDr] [crit] We can't use `TrieHash` directly in the map,
@@ -8560,43 +7900,43 @@ var stateKeys;
     }
     stateKeys.serviceInfo = serviceInfo;
     /** https://graypaper.fluffylabs.dev/#/1c979cb/3bba033bba03?v=0.7.1 */
-    function serviceStorage(serviceId, key) {
+    function serviceStorage(blake2b, serviceId, key) {
         if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
             const out = Bytes.zero(HASH_SIZE);
             out.raw.set(u32AsLeBytes(tryAsU32(2 ** 32 - 1)), 0);
             out.raw.set(key.raw.subarray(0, HASH_SIZE - U32_BYTES), U32_BYTES);
             return legacyServiceNested(serviceId, out);
         }
-        return serviceNested(serviceId, tryAsU32(2 ** 32 - 1), key);
+        return serviceNested(blake2b, serviceId, tryAsU32(2 ** 32 - 1), key);
     }
     stateKeys.serviceStorage = serviceStorage;
     /** https://graypaper.fluffylabs.dev/#/1c979cb/3bd7033bd703?v=0.7.1 */
-    function servicePreimage(serviceId, hash) {
+    function servicePreimage(blake2b, serviceId, hash) {
         if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
             const out = Bytes.zero(HASH_SIZE);
             out.raw.set(u32AsLeBytes(tryAsU32(2 ** 32 - 2)), 0);
             out.raw.set(hash.raw.subarray(1, HASH_SIZE - U32_BYTES + 1), U32_BYTES);
             return legacyServiceNested(serviceId, out);
         }
-        return serviceNested(serviceId, tryAsU32(2 ** 32 - 2), hash);
+        return serviceNested(blake2b, serviceId, tryAsU32(2 ** 32 - 2), hash);
     }
     stateKeys.servicePreimage = servicePreimage;
     /** https://graypaper.fluffylabs.dev/#/1c979cb/3b0a043b0a04?v=0.7.1 */
-    function serviceLookupHistory(serviceId, hash, preimageLength) {
+    function serviceLookupHistory(blake2b, serviceId, hash, preimageLength) {
         if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
-            const doubleHash = hashBytes(hash);
+            const doubleHash = blake2b.hashBytes(hash);
             const out = Bytes.zero(HASH_SIZE);
             out.raw.set(u32AsLeBytes(preimageLength), 0);
             out.raw.set(doubleHash.raw.subarray(2, HASH_SIZE - U32_BYTES + 2), U32_BYTES);
             return legacyServiceNested(serviceId, out);
         }
-        return serviceNested(serviceId, preimageLength, hash);
+        return serviceNested(blake2b, serviceId, preimageLength, hash);
     }
     stateKeys.serviceLookupHistory = serviceLookupHistory;
     /** https://graypaper.fluffylabs.dev/#/1c979cb/3b88003b8800?v=0.7.1 */
-    function serviceNested(serviceId, numberPrefix, hash) {
+    function serviceNested(blake2b, serviceId, numberPrefix, hash) {
         const inputToHash = BytesBlob.blobFromParts(u32AsLeBytes(numberPrefix), hash.raw);
-        const newHash = hashBytes(inputToHash).raw.subarray(0, 28);
+        const newHash = blake2b.hashBytes(inputToHash).raw.subarray(0, 28);
         const key = Bytes.zero(HASH_SIZE);
         let i = 0;
         for (const byte of u32AsLeBytes(serviceId)) {
@@ -8657,12 +7997,6 @@ function accumulationOutputComparator(a, b) {
     return Ordering.Equal;
 }
 
-const codecWithHash = (val) => Descriptor.withView(val.name, val.sizeHint, (e, elem) => val.encode(e, elem.data), (d) => {
-    const decoder2 = d.clone();
-    const encoded = val.skipEncoded(decoder2);
-    const hash = hashBytes(encoded);
-    return new WithHash(hash.asOpaque(), val.decode(d));
-}, val.skip, val.View);
 /**
  * Assignment of particular work report to a core.
  *
@@ -8675,7 +8009,7 @@ class AvailabilityAssignment extends WithDebug {
     workReport;
     timeout;
     static Codec = codec$1.Class(AvailabilityAssignment, {
-        workReport: codecWithHash(WorkReport.Codec),
+        workReport: WorkReport.Codec,
         timeout: codec$1.u32.asOpaque(),
     });
     static create({ workReport, timeout }) {
@@ -10295,18 +9629,18 @@ var serialize;
         Codec: ServiceAccountInfo.Codec,
     });
     /** https://graypaper.fluffylabs.dev/#/85129da/384803384803?v=0.6.3 */
-    serialize.serviceStorage = (serviceId, key) => ({
-        key: stateKeys.serviceStorage(serviceId, key),
+    serialize.serviceStorage = (blake2b, serviceId, key) => ({
+        key: stateKeys.serviceStorage(blake2b, serviceId, key),
         Codec: dumpCodec,
     });
     /** https://graypaper.fluffylabs.dev/#/85129da/385b03385b03?v=0.6.3 */
-    serialize.servicePreimages = (serviceId, hash) => ({
-        key: stateKeys.servicePreimage(serviceId, hash),
+    serialize.servicePreimages = (blake2b, serviceId, hash) => ({
+        key: stateKeys.servicePreimage(blake2b, serviceId, hash),
         Codec: dumpCodec,
     });
     /** https://graypaper.fluffylabs.dev/#/85129da/387603387603?v=0.6.3 */
-    serialize.serviceLookupHistory = (serviceId, hash, len) => ({
-        key: stateKeys.serviceLookupHistory(serviceId, hash, len),
+    serialize.serviceLookupHistory = (blake2b, serviceId, hash, len) => ({
+        key: stateKeys.serviceLookupHistory(blake2b, serviceId, hash, len),
         Codec: readonlyArray(codec$1.sequenceVarLen(codec$1.u32)),
     });
 })(serialize || (serialize = {}));
@@ -10329,20 +9663,22 @@ const dumpCodec = Descriptor.new("Dump", { bytes: 64, isExact: false }, (e, v) =
  */
 class SerializedState {
     spec;
+    blake2b;
     backend;
     _recentServiceIds;
     /** Create a state-like object from collection of serialized entries. */
-    static fromStateEntries(spec, state, recentServices = []) {
-        return new SerializedState(spec, state, recentServices);
+    static fromStateEntries(spec, blake2b, state, recentServices = []) {
+        return new SerializedState(spec, blake2b, state, recentServices);
     }
     /** Create a state-like object backed by some DB. */
-    static new(spec, db, recentServices = []) {
-        return new SerializedState(spec, db, recentServices);
+    static new(spec, blake2b, db, recentServices = []) {
+        return new SerializedState(spec, blake2b, db, recentServices);
     }
-    constructor(spec, backend, 
+    constructor(spec, blake2b, backend, 
     /** Best-effort list of recently active services. */
     _recentServiceIds) {
         this.spec = spec;
+        this.blake2b = blake2b;
         this.backend = backend;
         this._recentServiceIds = _recentServiceIds;
     }
@@ -10366,7 +9702,7 @@ class SerializedState {
         if (!this._recentServiceIds.includes(id)) {
             this._recentServiceIds.push(id);
         }
-        return new SerializedService(id, serviceData, (key) => this.retrieveOptional(key));
+        return new SerializedService(this.blake2b, id, serviceData, (key) => this.retrieveOptional(key));
     }
     retrieve({ key, Codec }, description) {
         const bytes = this.backend.get(key);
@@ -10442,12 +9778,14 @@ class SerializedState {
 }
 /** Service data representation on a serialized state. */
 class SerializedService {
+    blake2b;
     serviceId;
     accountInfo;
     retrieveOptional;
-    constructor(
+    constructor(blake2b, 
     /** Service id */
     serviceId, accountInfo, retrieveOptional) {
+        this.blake2b = blake2b;
         this.serviceId = serviceId;
         this.accountInfo = accountInfo;
         this.retrieveOptional = retrieveOptional;
@@ -10460,13 +9798,13 @@ class SerializedService {
     getStorage(rawKey) {
         if (Compatibility.isLessThan(GpVersion.V0_6_7)) {
             const SERVICE_ID_BYTES = 4;
-            const serviceIdAndKey = new Uint8Array(SERVICE_ID_BYTES + rawKey.length);
+            const serviceIdAndKey = safeAllocUint8Array(SERVICE_ID_BYTES + rawKey.length);
             serviceIdAndKey.set(u32AsLeBytes(this.serviceId));
             serviceIdAndKey.set(rawKey.raw, SERVICE_ID_BYTES);
-            const key = asOpaqueType(BytesBlob.blobFrom(hashBytes(serviceIdAndKey).raw));
-            return this.retrieveOptional(serialize.serviceStorage(this.serviceId, key)) ?? null;
+            const key = asOpaqueType(BytesBlob.blobFrom(this.blake2b.hashBytes(serviceIdAndKey).raw));
+            return this.retrieveOptional(serialize.serviceStorage(this.blake2b, this.serviceId, key)) ?? null;
         }
-        return this.retrieveOptional(serialize.serviceStorage(this.serviceId, rawKey)) ?? null;
+        return this.retrieveOptional(serialize.serviceStorage(this.blake2b, this.serviceId, rawKey)) ?? null;
     }
     /**
      * Check if preimage is present in the DB.
@@ -10475,15 +9813,15 @@ class SerializedService {
      */
     hasPreimage(hash) {
         // TODO [ToDr] consider optimizing to avoid fetching the whole data.
-        return this.retrieveOptional(serialize.servicePreimages(this.serviceId, hash)) !== undefined;
+        return this.retrieveOptional(serialize.servicePreimages(this.blake2b, this.serviceId, hash)) !== undefined;
     }
     /** Retrieve preimage from the DB. */
     getPreimage(hash) {
-        return this.retrieveOptional(serialize.servicePreimages(this.serviceId, hash)) ?? null;
+        return this.retrieveOptional(serialize.servicePreimages(this.blake2b, this.serviceId, hash)) ?? null;
     }
     /** Retrieve preimage lookup history. */
     getLookupHistory(hash, len) {
-        const rawSlots = this.retrieveOptional(serialize.serviceLookupHistory(this.serviceId, hash, len));
+        const rawSlots = this.retrieveOptional(serialize.serviceLookupHistory(this.blake2b, this.serviceId, hash, len));
         if (rawSlots === undefined) {
             return null;
         }
@@ -10545,7 +9883,7 @@ class TrieNode {
     raw;
     constructor(
     /** Exactly 512 bits / 64 bytes */
-    raw = new Uint8Array(TRIE_NODE_BYTES)) {
+    raw = safeAllocUint8Array(TRIE_NODE_BYTES)) {
         this.raw = raw;
     }
     /** Returns the type of the node */
@@ -11120,11 +10458,13 @@ var index$f = /*#__PURE__*/Object.freeze({
   parseInputKey: parseInputKey
 });
 
-const blake2bTrieHasher = {
-    hashConcat(n, rest = []) {
-        return hashBlobs$1([n, ...rest]);
-    },
-};
+function getBlake2bTrieHasher(hasher) {
+    return {
+        hashConcat(n, rest = []) {
+            return hasher.hashBlobs([n, ...rest]);
+        },
+    };
+}
 
 /** What should be done with that key? */
 var StateEntryUpdateAction;
@@ -11136,14 +10476,14 @@ var StateEntryUpdateAction;
 })(StateEntryUpdateAction || (StateEntryUpdateAction = {}));
 const EMPTY_BLOB = BytesBlob.empty();
 /** Serialize given state update into a series of key-value pairs. */
-function* serializeStateUpdate(spec, update) {
+function* serializeStateUpdate(spec, blake2b, update) {
     // first let's serialize all of the simple entries (if present!)
     yield* serializeBasicKeys(spec, update);
     const encode = (codec, val) => Encoder.encodeObject(codec, val, spec);
     // then let's proceed with service updates
-    yield* serializeServiceUpdates(update.servicesUpdates, encode);
-    yield* serializePreimages(update.preimages, encode);
-    yield* serializeStorage(update.storage);
+    yield* serializeServiceUpdates(update.servicesUpdates, encode, blake2b);
+    yield* serializePreimages(update.preimages, encode, blake2b);
+    yield* serializeStorage(update.storage, blake2b);
     yield* serializeRemovedServices(update.servicesRemoved);
 }
 function* serializeRemovedServices(servicesRemoved) {
@@ -11153,18 +10493,18 @@ function* serializeRemovedServices(servicesRemoved) {
         yield [StateEntryUpdateAction.Remove, codec.key, EMPTY_BLOB];
     }
 }
-function* serializeStorage(storage) {
+function* serializeStorage(storage, blake2b) {
     for (const { action, serviceId } of storage ?? []) {
         switch (action.kind) {
             case UpdateStorageKind.Set: {
                 const key = action.storage.key;
-                const codec = serialize.serviceStorage(serviceId, key);
+                const codec = serialize.serviceStorage(blake2b, serviceId, key);
                 yield [StateEntryUpdateAction.Insert, codec.key, action.storage.value];
                 break;
             }
             case UpdateStorageKind.Remove: {
                 const key = action.key;
-                const codec = serialize.serviceStorage(serviceId, key);
+                const codec = serialize.serviceStorage(blake2b, serviceId, key);
                 yield [StateEntryUpdateAction.Remove, codec.key, EMPTY_BLOB];
                 break;
             }
@@ -11173,15 +10513,15 @@ function* serializeStorage(storage) {
         }
     }
 }
-function* serializePreimages(preimages, encode) {
+function* serializePreimages(preimages, encode, blake2b) {
     for (const { action, serviceId } of preimages ?? []) {
         switch (action.kind) {
             case UpdatePreimageKind.Provide: {
                 const { hash, blob } = action.preimage;
-                const codec = serialize.servicePreimages(serviceId, hash);
+                const codec = serialize.servicePreimages(blake2b, serviceId, hash);
                 yield [StateEntryUpdateAction.Insert, codec.key, blob];
                 if (action.slot !== null) {
-                    const codec2 = serialize.serviceLookupHistory(serviceId, hash, tryAsU32(blob.length));
+                    const codec2 = serialize.serviceLookupHistory(blake2b, serviceId, hash, tryAsU32(blob.length));
                     yield [
                         StateEntryUpdateAction.Insert,
                         codec2.key,
@@ -11192,15 +10532,15 @@ function* serializePreimages(preimages, encode) {
             }
             case UpdatePreimageKind.UpdateOrAdd: {
                 const { hash, length, slots } = action.item;
-                const codec = serialize.serviceLookupHistory(serviceId, hash, length);
+                const codec = serialize.serviceLookupHistory(blake2b, serviceId, hash, length);
                 yield [StateEntryUpdateAction.Insert, codec.key, encode(codec.Codec, slots)];
                 break;
             }
             case UpdatePreimageKind.Remove: {
                 const { hash, length } = action;
-                const codec = serialize.servicePreimages(serviceId, hash);
+                const codec = serialize.servicePreimages(blake2b, serviceId, hash);
                 yield [StateEntryUpdateAction.Remove, codec.key, EMPTY_BLOB];
-                const codec2 = serialize.serviceLookupHistory(serviceId, hash, length);
+                const codec2 = serialize.serviceLookupHistory(blake2b, serviceId, hash, length);
                 yield [StateEntryUpdateAction.Remove, codec2.key, EMPTY_BLOB];
                 break;
             }
@@ -11209,7 +10549,7 @@ function* serializePreimages(preimages, encode) {
         }
     }
 }
-function* serializeServiceUpdates(servicesUpdates, encode) {
+function* serializeServiceUpdates(servicesUpdates, encode, blake2b) {
     for (const { action, serviceId } of servicesUpdates ?? []) {
         // new service being created or updated
         const codec = serialize.serviceData(serviceId);
@@ -11217,7 +10557,7 @@ function* serializeServiceUpdates(servicesUpdates, encode) {
         // additional lookup history update
         if (action.kind === UpdateServiceKind.Create && action.lookupHistory !== null) {
             const { lookupHistory } = action;
-            const codec2 = serialize.serviceLookupHistory(serviceId, lookupHistory.hash, lookupHistory.length);
+            const codec2 = serialize.serviceLookupHistory(blake2b, serviceId, lookupHistory.hash, lookupHistory.length);
             yield [StateEntryUpdateAction.Insert, codec2.key, encode(codec2.Codec, lookupHistory.slots)];
         }
     }
@@ -11312,8 +10652,8 @@ class StateEntries {
         },
     }, (e, v) => stateEntriesSequenceCodec.encode(e, Array.from(v.entries)), (d) => StateEntries.fromEntriesUnsafe(stateEntriesSequenceCodec.decode(d)), (s) => stateEntriesSequenceCodec.skip(s));
     /** Turn in-memory state into it's serialized form. */
-    static serializeInMemory(spec, state) {
-        return new StateEntries(convertInMemoryStateToDictionary(spec, state));
+    static serializeInMemory(spec, blake2b, state) {
+        return new StateEntries(convertInMemoryStateToDictionary(spec, blake2b, state));
     }
     /**
      * Wrap a collection of truncated state entries and treat it as state.
@@ -11362,7 +10702,8 @@ class StateEntries {
         }
     }
     /** https://graypaper.fluffylabs.dev/#/68eaa1f/391600391600?v=0.6.4 */
-    getRootHash() {
+    getRootHash(blake2b) {
+        const blake2bTrieHasher = getBlake2bTrieHasher(blake2b);
         const leaves = SortedSet.fromArray(leafComparator);
         for (const [key, value] of this) {
             leaves.insert(InMemoryTrie.constructLeaf(blake2bTrieHasher, key.asOpaque(), value));
@@ -11371,7 +10712,7 @@ class StateEntries {
     }
 }
 /** https://graypaper.fluffylabs.dev/#/68eaa1f/38a50038a500?v=0.6.4 */
-function convertInMemoryStateToDictionary(spec, state) {
+function convertInMemoryStateToDictionary(spec, blake2b, state) {
     const serialized = TruncatedHashDictionary.fromEntries([]);
     function doSerialize(codec) {
         serialized.set(codec.key, Encoder.encodeObject(codec.Codec, codec.extract(state), spec));
@@ -11399,18 +10740,18 @@ function convertInMemoryStateToDictionary(spec, state) {
         serialized.set(key, Encoder.encodeObject(Codec, service.getInfo()));
         // preimages
         for (const preimage of service.data.preimages.values()) {
-            const { key, Codec } = serialize.servicePreimages(serviceId, preimage.hash);
+            const { key, Codec } = serialize.servicePreimages(blake2b, serviceId, preimage.hash);
             serialized.set(key, Encoder.encodeObject(Codec, preimage.blob));
         }
         // storage
         for (const storage of service.data.storage.values()) {
-            const { key, Codec } = serialize.serviceStorage(serviceId, storage.key);
+            const { key, Codec } = serialize.serviceStorage(blake2b, serviceId, storage.key);
             serialized.set(key, Encoder.encodeObject(Codec, storage.value));
         }
         // lookup history
         for (const lookupHistoryList of service.data.lookupHistory.values()) {
             for (const lookupHistory of lookupHistoryList) {
-                const { key, Codec } = serialize.serviceLookupHistory(serviceId, lookupHistory.hash, lookupHistory.length);
+                const { key, Codec } = serialize.serviceLookupHistory(blake2b, serviceId, lookupHistory.hash, lookupHistory.length);
                 serialized.set(key, Encoder.encodeObject(Codec, lookupHistory.slots.slice()));
             }
         }
@@ -11418,9 +10759,9 @@ function convertInMemoryStateToDictionary(spec, state) {
     return serialized;
 }
 
-function loadState(spec, entries) {
+function loadState(spec, blake2b, entries) {
     const stateEntries = StateEntries.fromEntriesUnsafe(entries);
-    return SerializedState.fromStateEntries(spec, stateEntries);
+    return SerializedState.fromStateEntries(spec, blake2b, stateEntries);
 }
 
 /**
@@ -11528,7 +10869,8 @@ class LeafDb {
         }
         assertNever(val);
     }
-    getStateRoot() {
+    getStateRoot(blake2b) {
+        const blake2bTrieHasher = getBlake2bTrieHasher(blake2b);
         return InMemoryTrie.computeStateRoot(blake2bTrieHasher, this.leaves).asOpaque();
     }
     intoStateEntries() {
@@ -11718,7 +11060,8 @@ class InMemoryStates {
         }
     }
     async getStateRoot(state) {
-        return StateEntries.serializeInMemory(this.spec, state).getRootHash();
+        const blake2b = await Blake2b.createHasher();
+        return StateEntries.serializeInMemory(this.spec, blake2b, state).getRootHash(blake2b);
     }
     /** Insert a full state into the database. */
     async insertState(headerHash, state) {
@@ -11796,7 +11139,7 @@ function padAndEncodeData(input) {
     const paddedLength = Math.ceil(input.length / PIECE_SIZE) * PIECE_SIZE;
     let padded = input;
     if (input.length !== paddedLength) {
-        padded = BytesBlob.blobFrom(new Uint8Array(paddedLength));
+        padded = BytesBlob.blobFrom(safeAllocUint8Array(paddedLength));
         padded.raw.set(input.raw, 0);
     }
     return chunkingFunction(padded);
@@ -11842,7 +11185,7 @@ function decodeData(input) {
  */
 function encodePoints(input) {
     const result = [];
-    const data = new Uint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
+    const data = safeAllocUint8Array(POINT_ALIGNMENT * N_CHUNKS_REQUIRED);
     // add original shards to the result
     for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
         const pointStart = POINT_LENGTH * i;
@@ -11858,7 +11201,7 @@ function encodePoints(input) {
     const encodedData = encodedResult.take_data();
     for (let i = 0; i < N_CHUNKS_REDUNDANCY; i++) {
         const pointIndex = i * POINT_ALIGNMENT;
-        const redundancyPoint = new Uint8Array(POINT_LENGTH);
+        const redundancyPoint = safeAllocUint8Array(POINT_LENGTH);
         for (let j = 0; j < POINT_LENGTH; j++) {
             redundancyPoint[j] = encodedData[pointIndex + j * HALF_POINT_SIZE];
         }
@@ -11873,7 +11216,7 @@ function encodePoints(input) {
  */
 function decodePiece(input) {
     const result = Bytes.zero(PIECE_SIZE);
-    const data = new Uint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
+    const data = safeAllocUint8Array(N_CHUNKS_REQUIRED * POINT_ALIGNMENT);
     const indices = new Uint16Array(input.length);
     for (let i = 0; i < N_CHUNKS_REQUIRED; i++) {
         const [index, points] = input[i];
@@ -11989,7 +11332,7 @@ function lace(input) {
         return BytesBlob.empty();
     }
     const n = input[0].length;
-    const result = BytesBlob.blobFrom(new Uint8Array(k * n));
+    const result = BytesBlob.blobFrom(safeAllocUint8Array(k * n));
     for (let i = 0; i < k; i++) {
         const entry = input[i].raw;
         for (let j = 0; j < n; j++) {
@@ -13268,7 +12611,7 @@ class Registers {
     bytes;
     asSigned;
     asUnsigned;
-    constructor(bytes = new Uint8Array(NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT)) {
+    constructor(bytes = safeAllocUint8Array(NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT)) {
         this.bytes = bytes;
         check `${bytes.length === NO_OF_REGISTERS$1 << REGISTER_SIZE_SHIFT} Invalid size of registers array.`;
         this.asSigned = new BigInt64Array(bytes.buffer, bytes.byteOffset);
@@ -13340,10 +12683,16 @@ function signExtend32To64(value) {
 
 /** Attempt to convert a number into `HostCallIndex`. */
 const tryAsHostCallIndex = (v) => asOpaqueType(tryAsU32(v));
+/**
+ * Host-call exit reason.
+ *
+ * https://graypaper.fluffylabs.dev/#/ab2cdbd/24a30124a501?v=0.7.2
+ */
 var PvmExecution;
 (function (PvmExecution) {
     PvmExecution[PvmExecution["Halt"] = 0] = "Halt";
     PvmExecution[PvmExecution["Panic"] = 1] = "Panic";
+    PvmExecution[PvmExecution["OOG"] = 2] = "OOG";
 })(PvmExecution || (PvmExecution = {}));
 /** A utility function to easily trace a bunch of registers. */
 function traceRegisters(...regs) {
@@ -13415,7 +12764,7 @@ class Mask {
         return Math.min(this.lookupTableForward[index] ?? 0, MAX_INSTRUCTION_DISTANCE);
     }
     buildLookupTableForward(mask) {
-        const table = new Uint8Array(mask.bitLength);
+        const table = safeAllocUint8Array(mask.bitLength);
         let lastInstructionOffset = 0;
         for (let i = mask.bitLength - 1; i >= 0; i--) {
             if (mask.isSet(i)) {
@@ -16950,7 +16299,7 @@ class HostCalls {
             const regs = pvmInstance.getRegisters();
             const maybeAddress = regs.getLowerU32(7);
             const maybeLength = regs.getLowerU32(8);
-            const result = new Uint8Array(maybeLength);
+            const result = safeAllocUint8Array(maybeLength);
             const startAddress = tryAsMemoryIndex(maybeAddress);
             const loadResult = memory.loadInto(result, startAddress);
             if (loadResult.isError) {
@@ -16978,8 +16327,9 @@ class HostCalls {
             const index = tryAsHostCallIndex(hostCallIndex);
             const hostCall = this.hostCalls.get(index);
             const gasBefore = gas.get();
-            const gasCost = typeof hostCall.gasCost === "number" ? hostCall.gasCost : hostCall.gasCost(regs);
-            const underflow = gas.sub(gasCost);
+            // NOTE: `basicGasCost(regs)` function is for compatibility reasons: pre GP 0.7.2
+            const basicGasCost = typeof hostCall.basicGasCost === "number" ? hostCall.basicGasCost : hostCall.basicGasCost(regs);
+            const underflow = gas.sub(basicGasCost);
             const pcLog = `[PC: ${pvmInstance.getPC()}]`;
             if (underflow) {
                 this.hostCalls.traceHostCall(`${pcLog} OOG`, index, hostCall, regs, gas.get());
@@ -16996,6 +16346,10 @@ class HostCalls {
                 status = Status.PANIC;
                 return this.getReturnValue(status, pvmInstance);
             }
+            if (result === PvmExecution.OOG) {
+                status = Status.OOG;
+                return this.getReturnValue(status, pvmInstance);
+            }
             if (result === undefined) {
                 pvmInstance.runProgram();
                 status = pvmInstance.getStatus();
@@ -17294,14 +16648,14 @@ class DebuggerAdapter {
         const page = this.pvm.getMemoryPage(pageNumber);
         if (page === null) {
             // page wasn't allocated so we return an empty page
-            return new Uint8Array(PAGE_SIZE$1);
+            return safeAllocUint8Array(PAGE_SIZE$1);
         }
         if (page.length === PAGE_SIZE$1) {
             // page was allocated and has a proper size so we can simply return it
             return page;
         }
         // page was allocated but it is shorter than PAGE_SIZE so we have to extend it
-        const fullPage = new Uint8Array(PAGE_SIZE$1);
+        const fullPage = safeAllocUint8Array(PAGE_SIZE$1);
         fullPage.set(page);
         return fullPage;
     }
@@ -17405,7 +16759,7 @@ var index$3 = /*#__PURE__*/Object.freeze({
   extractCodeAndMetadata: extractCodeAndMetadata,
   getServiceId: getServiceId,
   getServiceIdOrCurrent: getServiceIdOrCurrent,
-  hash: index$p,
+  hash: index$o,
   inspect: inspect,
   instructionArgumentTypeMap: instructionArgumentTypeMap,
   interpreter: index$7,
@@ -17427,10 +16781,10 @@ const ENTROPY_BYTES = 32;
  *
  * https://graypaper.fluffylabs.dev/#/579bd12/3b9a013b9a01
  */
-function fisherYatesShuffle(arr, entropy) {
+function fisherYatesShuffle(blake2b, arr, entropy) {
     check `${entropy.length === ENTROPY_BYTES} Expected entropy of length ${ENTROPY_BYTES}, got ${entropy.length}`;
     const n = arr.length;
-    const randomNumbers = hashToNumberSequence(entropy, arr.length);
+    const randomNumbers = hashToNumberSequence(blake2b, entropy, arr.length);
     const result = new Array(n);
     let itemsLeft = n;
     for (let i = 0; i < n; i++) {
@@ -17443,13 +16797,13 @@ function fisherYatesShuffle(arr, entropy) {
     }
     return result;
 }
-function hashToNumberSequence(entropy, length) {
+function hashToNumberSequence(blake2b, entropy, length) {
     const result = new Array(length);
-    const randomBytes = new Uint8Array(ENTROPY_BYTES + 4);
+    const randomBytes = safeAllocUint8Array(ENTROPY_BYTES + 4);
     randomBytes.set(entropy.raw);
     for (let i = 0; i < length; i++) {
         randomBytes.set(u32AsLeBytes(tryAsU32(Math.floor(i / 8))), ENTROPY_BYTES);
-        const newHash = hashBytes(randomBytes);
+        const newHash = blake2b.hashBytes(randomBytes);
         const numberStartIndex = (4 * i) % 32;
         const numberEndIndex = numberStartIndex + 4;
         const number = leBytesAsU32(newHash.raw.subarray(numberStartIndex, numberEndIndex)) >>> 0;
@@ -17563,8 +16917,7 @@ const availabilityAssignmentFromJson = json.object({
     report: workReportFromJson,
     timeout: "number",
 }, ({ report, timeout }) => {
-    const workReportHash = hashBytes(Encoder.encodeObject(WorkReport.Codec, report)).asOpaque();
-    return AvailabilityAssignment.create({ workReport: new WithHash(workReportHash, report), timeout });
+    return AvailabilityAssignment.create({ workReport: report, timeout });
 });
 
 const disputesRecordsFromJson = json.object({
@@ -17870,11 +17223,11 @@ var index$1 = /*#__PURE__*/Object.freeze({
 class TransitionHasher {
     context;
     keccakHasher;
-    allocator;
-    constructor(context, keccakHasher, allocator) {
+    blake2b;
+    constructor(context, keccakHasher, blake2b) {
         this.context = context;
         this.keccakHasher = keccakHasher;
-        this.allocator = allocator;
+        this.blake2b = blake2b;
     }
     /** Concatenates two hashes and hash this concatenation */
     hashConcat(a, b) {
@@ -17885,7 +17238,7 @@ class TransitionHasher {
     }
     /** Creates hash from the block header view */
     header(header) {
-        return new WithHash(hashBytes(header.encoded(), this.allocator).asOpaque(), header);
+        return new WithHash(this.blake2b.hashBytes(header.encoded()).asOpaque(), header);
     }
     /**
      * Merkle commitment of the extrinsic data
@@ -17898,7 +17251,7 @@ class TransitionHasher {
             .view()
             .map((g) => g.view())
             .map((guarantee) => {
-            const reportHash = hashBytes(guarantee.report.encoded(), this.allocator).asOpaque();
+            const reportHash = this.blake2b.hashBytes(guarantee.report.encoded()).asOpaque();
             return BytesBlob.blobFromParts([
                 reportHash.raw,
                 guarantee.slot.encoded().raw,
@@ -17906,13 +17259,13 @@ class TransitionHasher {
             ]);
         });
         const guaranteeBlob = Encoder.encodeObject(codec$1.sequenceVarLen(dumpCodec), guarantees, this.context);
-        const et = hashBytes(extrinsicView.tickets.encoded(), this.allocator).asOpaque();
-        const ep = hashBytes(extrinsicView.preimages.encoded(), this.allocator).asOpaque();
-        const eg = hashBytes(guaranteeBlob, this.allocator).asOpaque();
-        const ea = hashBytes(extrinsicView.assurances.encoded(), this.allocator).asOpaque();
-        const ed = hashBytes(extrinsicView.disputes.encoded(), this.allocator).asOpaque();
+        const et = this.blake2b.hashBytes(extrinsicView.tickets.encoded()).asOpaque();
+        const ep = this.blake2b.hashBytes(extrinsicView.preimages.encoded()).asOpaque();
+        const eg = this.blake2b.hashBytes(guaranteeBlob).asOpaque();
+        const ea = this.blake2b.hashBytes(extrinsicView.assurances.encoded()).asOpaque();
+        const ed = this.blake2b.hashBytes(extrinsicView.disputes.encoded()).asOpaque();
         const encoded = BytesBlob.blobFromParts([et.raw, ep.raw, eg.raw, ea.raw, ed.raw]);
-        return new WithHashAndBytes(hashBytes(encoded, this.allocator).asOpaque(), extrinsicView, encoded);
+        return new WithHashAndBytes(this.blake2b.hashBytes(encoded).asOpaque(), extrinsicView, encoded);
     }
     /** Creates hash for given WorkPackage */
     workPackage(workPackage) {
@@ -17921,7 +17274,7 @@ class TransitionHasher {
     encode(codec, data) {
         // TODO [ToDr] Use already allocated encoding destination and hash bytes from some arena.
         const encoded = Encoder.encodeObject(codec, data, this.context);
-        return new WithHashAndBytes(hashBytes(encoded, this.allocator).asOpaque(), data, encoded);
+        return new WithHashAndBytes(this.blake2b.hashBytes(encoded).asOpaque(), data, encoded);
     }
 }
 
@@ -17934,8 +17287,10 @@ var PreimagesErrorCode;
 // TODO [SeKo] consider whether this module is the right place to remove expired preimages
 class Preimages {
     state;
-    constructor(state) {
+    blake2b;
+    constructor(state, blake2b) {
         this.state = state;
+        this.blake2b = blake2b;
     }
     integrate(input) {
         // make sure lookup extrinsics are sorted and unique
@@ -17958,7 +17313,7 @@ class Preimages {
         // select preimages for integration
         for (const preimage of preimages) {
             const { requester, blob } = preimage;
-            const hash = hashBytes(blob).asOpaque();
+            const hash = this.blake2b.hashBytes(blob).asOpaque();
             const service = this.state.getService(requester);
             if (service === null) {
                 return Result$1.error(PreimagesErrorCode.AccountNotFound);
@@ -17983,146 +17338,11 @@ class Preimages {
     }
 }
 
-class Missing {
-    index = tryAsHostCallIndex(2 ** 32 - 1);
-    gasCost = tryAsSmallGas(10);
-    currentServiceId = CURRENT_SERVICE_ID;
-    tracedRegisters = traceRegisters(7);
-    execute(_gas, regs, _memory) {
-        regs.set(7, HostCallResult.WHAT);
-        return Promise.resolve(undefined);
-    }
-}
-
-var ServiceExecutorError;
-(function (ServiceExecutorError) {
-    ServiceExecutorError[ServiceExecutorError["NoLookup"] = 0] = "NoLookup";
-    ServiceExecutorError[ServiceExecutorError["NoState"] = 1] = "NoState";
-    ServiceExecutorError[ServiceExecutorError["NoServiceCode"] = 2] = "NoServiceCode";
-    ServiceExecutorError[ServiceExecutorError["ServiceCodeMismatch"] = 3] = "ServiceCodeMismatch";
-})(ServiceExecutorError || (ServiceExecutorError = {}));
-class WorkPackageExecutor {
-    blocks;
-    state;
-    hasher;
-    constructor(blocks, state, hasher) {
-        this.blocks = blocks;
-        this.state = state;
-        this.hasher = hasher;
-    }
-    // TODO [ToDr] this while thing should be triple-checked with the GP.
-    // I'm currently implementing some dirty version for the demo.
-    async executeWorkPackage(pack) {
-        const headerHash = pack.context.lookupAnchor;
-        // execute authorisation first or is it already executed and we just need to check it?
-        const authExec = this.getServiceExecutor(
-        // TODO [ToDr] should this be anchor or lookupAnchor?
-        headerHash, pack.authCodeHost, pack.authCodeHash);
-        if (authExec.isError) {
-            // TODO [ToDr] most likely shouldn't be throw.
-            throw new Error(`Could not get authorization executor: ${authExec.error}`);
-        }
-        const pvm = authExec.ok;
-        const authGas = tryAsGas(15000n);
-        const result = await pvm.run(pack.parametrization, authGas);
-        if (!result.isEqualTo(pack.authorization)) {
-            throw new Error("Authorization is invalid.");
-        }
-        const results = [];
-        for (const item of pack.items) {
-            const exec = this.getServiceExecutor(headerHash, item.service, item.codeHash);
-            if (exec.isError) {
-                throw new Error(`Could not get item executor: ${exec.error}`);
-            }
-            const pvm = exec.ok;
-            const gasRatio = tryAsServiceGas(3000n);
-            const ret = await pvm.run(item.payload, tryAsGas(item.refineGasLimit)); // or accumulateGasLimit?
-            results.push(WorkResult.create({
-                serviceId: item.service,
-                codeHash: item.codeHash,
-                payloadHash: hashBytes(item.payload),
-                gas: gasRatio,
-                result: new WorkExecResult(WorkExecResultKind.ok, ret),
-                load: WorkRefineLoad.create({
-                    gasUsed: tryAsServiceGas(5),
-                    importedSegments: tryAsU32(0),
-                    exportedSegments: tryAsU32(0),
-                    extrinsicSize: tryAsU32(0),
-                    extrinsicCount: tryAsU32(0),
-                }),
-            }));
-        }
-        const workPackage = this.hasher.workPackage(pack);
-        const workPackageSpec = WorkPackageSpec.create({
-            hash: workPackage.hash,
-            length: tryAsU32(workPackage.encoded.length),
-            erasureRoot: Bytes.zero(HASH_SIZE),
-            exportsRoot: Bytes.zero(HASH_SIZE).asOpaque(),
-            exportsCount: tryAsU16(0),
-        });
-        const coreIndex = tryAsCoreIndex(0);
-        const authorizerHash = Bytes.fill(HASH_SIZE, 5).asOpaque();
-        const workResults = FixedSizeArray.new(results, tryAsWorkItemsCount(results.length));
-        return Promise.resolve(WorkReport.create({
-            workPackageSpec,
-            context: pack.context,
-            coreIndex,
-            authorizerHash,
-            authorizationOutput: pack.authorization,
-            segmentRootLookup: [],
-            results: workResults,
-            authorizationGasUsed: tryAsServiceGas(0),
-        }));
-    }
-    getServiceExecutor(lookupAnchor, serviceId, expectedCodeHash) {
-        const header = this.blocks.getHeader(lookupAnchor);
-        if (header === null) {
-            return Result$1.error(ServiceExecutorError.NoLookup);
-        }
-        const state = this.state.getState(lookupAnchor);
-        if (state === null) {
-            return Result$1.error(ServiceExecutorError.NoState);
-        }
-        const service = state.getService(serviceId);
-        const serviceCodeHash = service?.getInfo().codeHash ?? null;
-        if (serviceCodeHash === null) {
-            return Result$1.error(ServiceExecutorError.NoServiceCode);
-        }
-        if (!serviceCodeHash.isEqualTo(expectedCodeHash)) {
-            return Result$1.error(ServiceExecutorError.ServiceCodeMismatch);
-        }
-        const serviceCode = service?.getPreimage(serviceCodeHash.asOpaque()) ?? null;
-        if (serviceCode === null) {
-            return Result$1.error(ServiceExecutorError.NoServiceCode);
-        }
-        return Result$1.ok(new PvmExecutor(serviceCode));
-    }
-}
-class PvmExecutor {
-    serviceCode;
-    pvm;
-    hostCalls = new HostCallsManager({ missing: new Missing() });
-    pvmInstanceManager = new InterpreterInstanceManager(4);
-    constructor(serviceCode) {
-        this.serviceCode = serviceCode;
-        this.pvm = new HostCalls(this.pvmInstanceManager, this.hostCalls);
-    }
-    async run(args, gas) {
-        const program = Program.fromSpi(this.serviceCode.raw, args.raw, true);
-        const result = await this.pvm.runProgram(program.code, 5, gas, program.registers, program.memory);
-        if (result.hasMemorySlice()) {
-            return BytesBlob.blobFrom(result.memorySlice);
-        }
-        return BytesBlob.empty();
-    }
-}
-
 var index = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Preimages: Preimages,
   get PreimagesErrorCode () { return PreimagesErrorCode; },
-  TransitionHasher: TransitionHasher,
-  WorkPackageExecutor: WorkPackageExecutor
+  TransitionHasher: TransitionHasher
 });
 
-export { index$l as block, index$j as block_json, index$s as bytes, index$q as codec, index$n as collections, index$m as config, index$h as config_node, index$o as crypto, index$d as database, index$c as erasure_coding, index$a as fuzz_proto, index$p as hash, index$9 as jam_host_calls, index$k as json_parser, index$i as logger, index$8 as mmr, index$r as numbers, index$t as ordering, index$3 as pvm, index$6 as pvm_host_calls, index$7 as pvm_interpreter, index$4 as pvm_program, index$5 as pvm_spi_decoder, index$2 as shuffling, index$g as state, index$1 as state_json, index$e as state_merkleization, index as transition, index$f as trie, index$u as utils };
+export { index$l as block, index$j as block_json, index$s as bytes, index$q as codec, index$n as collections, index$m as config, index$h as config_node, index$p as crypto, index$d as database, index$c as erasure_coding, index$a as fuzz_proto, index$o as hash, index$9 as jam_host_calls, index$k as json_parser, index$i as logger, index$8 as mmr, index$r as numbers, index$t as ordering, index$3 as pvm, index$6 as pvm_host_calls, index$7 as pvm_interpreter, index$4 as pvm_program, index$5 as pvm_spi_decoder, index$2 as shuffling, index$g as state, index$1 as state_json, index$e as state_merkleization, index as transition, index$f as trie, index$u as utils };