@typeberry/lib 0.4.0-fcdfbb1 → 0.4.1-0a3acb2

package/index.js

@@ -16,7 +16,11 @@ var TestSuite;
 })(TestSuite || (TestSuite = {}));
 const ALL_VERSIONS_IN_ORDER = [GpVersion.V0_6_7, GpVersion.V0_7_0, GpVersion.V0_7_1, GpVersion.V0_7_2];
 const DEFAULT_SUITE = TestSuite.W3F_DAVXY;
-const DEFAULT_VERSION = GpVersion.V0_7_2;
+/**
+ * Current version is set to track the jam-conformance testing.
+ * Since we are currently at 0.7.1 not 0.7.2, we set our default version accordingly.
+ */
+const DEFAULT_VERSION = GpVersion.V0_7_1;
 const env$1 = typeof process === "undefined" ? {} : process.env;
 let CURRENT_VERSION = parseCurrentVersion(env$1.GP_VERSION) ?? DEFAULT_VERSION;
 let CURRENT_SUITE = parseCurrentSuite(env$1.TEST_SUITE) ?? DEFAULT_SUITE;
@@ -75,8 +79,8 @@ class Compatibility {
     /**
      * Allows selecting different values for different Gray Paper versions from one record.
      *
-     * @param fallback The default value to return if no value is found for the current.
-     * @param record A record mapping versions to values, checking if the version is greater or equal to the current version.
+     * fallback The default value to return if no value is found for the current.
+     * versions A record mapping versions to values, checking if the version is greater or equal to the current version.
      * @returns The value for the current version, or the default value.
      */
     static selectIfGreaterOrEqual({ fallback, versions, }) {
@@ -236,7 +240,7 @@ const workspacePathFix = env.NODE_ENV === "development"
     : () => (p) => p;
 
 /**
- * @fileoverview `Opaque<Type, Token>` constructs a unique type which is a subset of Type with a
+ * `Opaque<Type, Token>` constructs a unique type which is a subset of Type with a
  * specified unique token Token. It means that base type cannot be assigned to unique type by accident.
  * Good examples of opaque types include:
  * - JWTs or other tokens - these are special kinds of string used for authorization purposes.
@@ -579,7 +583,7 @@ function isResult(x) {
  * as an afterthought.
  */
 
-var index$v = /*#__PURE__*/Object.freeze({
+var index$u = /*#__PURE__*/Object.freeze({
   __proto__: null,
   get CURRENT_SUITE () { return CURRENT_SUITE; },
   get CURRENT_VERSION () { return CURRENT_VERSION; },
@@ -736,7 +740,7 @@ class Ordering {
     }
 }
 
-var index$u = /*#__PURE__*/Object.freeze({
+var index$t = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Ordering: Ordering
 });
@@ -988,7 +992,7 @@ function u8ArraySameLengthEqual(self, other) {
 }
 const bytesBlobComparator = (a, b) => a.compare(b);
 
-var index$t = /*#__PURE__*/Object.freeze({
+var index$s = /*#__PURE__*/Object.freeze({
   __proto__: null,
   BitVec: BitVec,
   Bytes: Bytes,
@@ -1090,7 +1094,7 @@ const minU64 = (a, ...values) => values.reduce((min, value) => (value > min ? mi
 /** Get the biggest value between U64 a and values given as input parameters. */
 const maxU64 = (a, ...values) => values.reduce((max, value) => (value < max ? max : value), a);
 
-var index$s = /*#__PURE__*/Object.freeze({
+var index$r = /*#__PURE__*/Object.freeze({
   __proto__: null,
   isU16: isU16,
   isU32: isU32,
@@ -2529,7 +2533,7 @@ function sequenceViewFixLen(type, { fixedLength }) {
     }, skipper);
 }
 
-var index$r = /*#__PURE__*/Object.freeze({
+var index$q = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Decoder: Decoder,
   Descriptor: Descriptor,
@@ -3730,7 +3734,7 @@ var keyDerivation = /*#__PURE__*/Object.freeze({
   trivialSeed: trivialSeed
 });
 
-var index$q = /*#__PURE__*/Object.freeze({
+var index$p = /*#__PURE__*/Object.freeze({
   __proto__: null,
   BANDERSNATCH_KEY_BYTES: BANDERSNATCH_KEY_BYTES,
   BANDERSNATCH_PROOF_BYTES: BANDERSNATCH_PROOF_BYTES,
@@ -4368,7 +4372,7 @@ var keccak = /*#__PURE__*/Object.freeze({
 // TODO [ToDr] (#213) this should most likely be moved to a separate
 // package to avoid pulling in unnecessary deps.
 
-var index$p = /*#__PURE__*/Object.freeze({
+var index$o = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Blake2b: Blake2b,
   HASH_SIZE: HASH_SIZE,
@@ -4420,8 +4424,434 @@ class ArrayView {
     }
 }
 
-/** A map which uses hashes as keys. */
-class HashDictionary {
+/** A map which uses byte blobs as keys */
+class BlobDictionary extends WithDebug {
+    mapNodeThreshold;
+    /**
+     * The root node of the dictionary.
+     *
+     * This is the main internal data structure that organizes entries
+     * in a tree-like fashion (array-based nodes up to `mapNodeThreshold`,
+     * map-based nodes beyond it). All insertions, updates, and deletions
+     * operate through this structure.
+     */
+    root = Node.withList();
+    /**
+     * Auxiliary map that stores references to the original keys and their values.
+     *
+     * - Overriding a value in the main structure does not replace the original key reference.
+     * - Used for efficient iteration over `keys()`, `values()`, `entries()`, and computing `size`.
+     */
+    keyvals = new Map();
+    /**
+     * Protected constructor used internally by `BlobDictionary.new`
+     * and `BlobDictionary.fromEntries`.
+     *
+     * This enforces controlled instantiation — users should create instances
+     * through the provided static factory methods instead of calling the
+     * constructor directly.
+     *
+     * @param mapNodeThreshold - The threshold that determines when the dictionary
+     * switches from using an array-based (`ListChildren`) node to a map-based (`MapChildren`) node for storing entries.
+     */
+    constructor(mapNodeThreshold) {
+        super();
+        this.mapNodeThreshold = mapNodeThreshold;
+    }
+    /**
+     * Returns the number of entries in the dictionary.
+     *
+     * The count is derived from the auxiliary `keyvals` map, which stores
+     * all original key references and their associated values. This ensures
+     * that the `size` reflects the actual number of entries, independent of
+     * internal overrides in the main `root` structure.
+     *
+     * @returns The total number of entries in the dictionary.
+     */
+    get size() {
+        return this.keyvals.size;
+    }
+    [TEST_COMPARE_USING]() {
+        const vals = Array.from(this);
+        vals.sort((a, b) => a[0].compare(b[0]).value);
+        return vals;
+    }
+    /**
+     * Creates an empty `BlobDictionary`.
+     *
+     * @param mapNodeThreshold - The threshold that determines when the dictionary
+     * switches from using an array-based (`ListChildren`) node to a map-based (`MapChildren`) node for storing entries.
+     * Defaults to `0`.
+     *
+     * @returns A new, empty `BlobDictionary` instance.
+     */
+    static new(mapNodeThreshold = 0) {
+        return new BlobDictionary(mapNodeThreshold);
+    }
+    /**
+     * Creates a new `BlobDictionary` initialized with the given entries.
+     *
+     * @param entries - An array of `[key, value]` pairs used to populate the dictionary.
+     * @param mapNodeThreshold - The threshold that determines when the dictionary
+     * switches from using an array-based (`ListChildren`) node to a map-based (`MapChildren`) node for storing entries.
+     * Defaults to `0`.
+     *
+     * @returns A new `BlobDictionary` containing the provided entries.
+     */
+    static fromEntries(entries, mapNodeThreshold) {
+        const dict = BlobDictionary.new(mapNodeThreshold);
+        for (const [key, value] of entries) {
+            dict.set(key, value);
+        }
+        return dict;
+    }
+    /**
+     * Internal helper that inserts, updates or deletes an entry in the dictionary.
+     *
+     * Behaviour details:
+     * - Passing `undefined` as `value` indicates a deletion. (E.g. `delete` uses `internalSet(key, undefined)`.)
+     * - When an add (new entry) or a delete actually changes the structure, the method returns the affected leaf node.
+     * - When the call only overrides an existing value (no structural add/delete), the method returns `null`.
+     *
+     * This method is intended for internal use by the dictionary implementation and allows `undefined` as a
+     * sentinel value to signal removals.
+     *
+     * @param key - The key to insert, update or remove.
+     * @param value - The value to associate with the key, or `undefined` to remove the key.
+     * @returns The leaf node created or removed on add/delete, or `null` if the operation only overwrote an existing value.
+     */
+    internalSet(key, value) {
+        let node = this.root;
+        const keyChunkGenerator = key.chunks(CHUNK_SIZE);
+        let depth = 0;
+        for (;;) {
+            const maybeKeyChunk = keyChunkGenerator.next().value;
+            if (maybeKeyChunk === undefined) {
+                if (value === undefined) {
+                    return node.remove(key);
+                }
+                return node.set(key, value);
+            }
+            const keyChunk = asOpaqueType(maybeKeyChunk);
+            if (node.children instanceof ListChildren) {
+                const subkey = BytesBlob.blobFrom(key.raw.subarray(CHUNK_SIZE * depth));
+                const leaf = value !== undefined ? node.children.insert(subkey, { key, value }) : node.children.remove(subkey);
+                if (subkey.length > CHUNK_SIZE && node.children.children.length > this.mapNodeThreshold) {
+                    node.convertListChildrenToMap();
+                }
+                return leaf;
+            }
+            depth += 1;
+            const children = node.children;
+            if (children instanceof ListChildren) {
+                throw new Error("We handle list node earlier. If we fall through, we know it's for the `Map` case.");
+            }
+            if (children instanceof MapChildren) {
+                const maybeNode = children.getChild(keyChunk);
+                if (maybeNode !== undefined) {
+                    // simply go one level deeper
+                    node = maybeNode;
+                }
+                else {
+                    // we are trying to remove an item, but it does not exist
+                    if (value === undefined) {
+                        return null;
+                    }
+                    // no more child nodes, we insert a new one.
+                    const newNode = Node.withList();
+                    children.setChild(keyChunk, newNode);
+                    node = newNode;
+                }
+                continue;
+            }
+            assertNever(children);
+        }
+    }
+    /**
+     * Adds a new entry to the dictionary or updates the value of an existing key.
+     *
+     * If an entry with the given key already exists, its value is replaced
+     * with the new one.
+     *
+     * @param key - The key to add or update in the dictionary.
+     * @param value - The value to associate with the specified key.
+     * @returns Nothing (`void`).
+     */
+    set(key, value) {
+        const leaf = this.internalSet(key, value);
+        if (leaf !== null) {
+            this.keyvals.set(leaf.key, leaf);
+        }
+    }
+    /**
+     * Retrieves the value associated with the given key from the dictionary.
+     *
+     * If the key does not exist, this method returns `undefined`.
+     *
+     * @param key - The key whose associated value should be retrieved.
+     * @returns The value associated with the specified key, or `undefined` if the key is not present.
+     */
+    get(key) {
+        let node = this.root;
+        const pathChunksGenerator = key.chunks(CHUNK_SIZE);
+        let depth = 0;
+        while (node !== undefined) {
+            const maybePathChunk = pathChunksGenerator.next().value;
+            if (node.children instanceof ListChildren) {
+                const subkey = BytesBlob.blobFrom(key.raw.subarray(depth * CHUNK_SIZE));
+                const child = node.children.find(subkey);
+                if (child !== null) {
+                    return child.value;
+                }
+            }
+            if (maybePathChunk === undefined) {
+                return node.getLeaf()?.value;
+            }
+            if (node.children instanceof MapChildren) {
+                const pathChunk = asOpaqueType(maybePathChunk);
+                node = node.children.getChild(pathChunk);
+                depth += 1;
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Checks whether the dictionary contains an entry for the given key.
+     *
+     * ⚠️ **Note:** Avoid using `has(...)` together with `get(...)` in a pattern like this:
+     *
+     * ```ts
+     * if (dict.has(key)) {
+     *   const value = dict.get(key);
+     *   ...
+     * }
+     * ```
+     *
+     * This approach performs two lookups for the same key.
+     *
+     * Instead, prefer the following pattern, which retrieves the value once:
+     *
+     * ```ts
+     * const value = dict.get(key);
+     * if (value !== undefined) {
+     *   ...
+     * }
+     * ```
+     *
+     * @param key - The key to check for.
+     * @returns `true` if the dictionary contains an entry for the given key, otherwise `false`.
+     */
+    has(key) {
+        return this.get(key) !== undefined;
+    }
+    /**
+     * Removes an entry with the specified key from the dictionary.
+     *
+     * Internally, this calls {@link internalSet} with `undefined` to mark the entry as deleted.
+     *
+     * @param key - The key of the entry to remove.
+     * @returns `true` if an entry was removed (i.e. the key existed), otherwise `false`.
+     */
+    delete(key) {
+        const leaf = this.internalSet(key, undefined);
+        if (leaf !== null) {
+            this.keyvals.delete(leaf.key);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Returns an iterator over the keys in the dictionary.
+     *
+     * The iterator yields each key in insertion order.
+     *
+     * @returns An iterator over all keys in the dictionary.
+     */
+    keys() {
+        return this.keyvals.keys();
+    }
+    /**
+     * Returns an iterator over the values in the dictionary.
+     *
+     * The iterator yields each value in insertion order.
+     *
+     * @returns An iterator over all values in the dictionary.
+     */
+    *values() {
+        for (const leaf of this.keyvals.values()) {
+            yield leaf.value;
+        }
+    }
+    /**
+     * Returns an iterator over the `[key, value]` pairs in the dictionary.
+     *
+     * The iterator yields entries in insertion order.
+     *
+     * @returns An iterator over `[key, value]` tuples for each entry in the dictionary.
+     */
+    *entries() {
+        for (const leaf of this.keyvals.values()) {
+            yield [leaf.key, leaf.value];
+        }
+    }
+    /**
+     * Default iterator for the dictionary.
+     *
+     * Equivalent to calling {@link entries}.
+     * Enables iteration with `for...of`:
+     *
+     * ```ts
+     * for (const [key, value] of dict) {
+     *   ...
+     * }
+     * ```
+     *
+     * @returns An iterator over `[key, value]` pairs.
+     */
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+    /**
+     * Creates a new sorted array of values, ordered by their corresponding keys.
+     *
+     * Iterates over all entries in the dictionary and sorts them according
+     * to the provided comparator function applied to the keys.
+     *
+     * @param comparator - A comparator function that can compare two keys.
+     *
+     * @returns A new array containing all values from the dictionary,
+     * sorted according to their keys.
+     */
+    toSortedArray(comparator) {
+        const vals = Array.from(this);
+        vals.sort((a, b) => comparator(a[0], b[0]).value);
+        return vals.map((x) => x[1]);
+    }
+}
+const CHUNK_SIZE = 6;
+/**
+ * A function to transform a bytes chunk (up to 6 bytes into U48 number)
+ *
+ * Note that it uses 3 additional bits to store length(`value * 8 + len;`),
+ * It is needed to distinguish shorter chunks that have 0s at the end, for example: [1, 2] and [1, 2, 0]
+ * */
+function bytesAsU48(bytes) {
+    const len = bytes.length;
+    check `${len <= CHUNK_SIZE} Length has to be <= ${CHUNK_SIZE}, got: ${len}`;
+    let value = bytes[3] | (bytes[2] << 8) | (bytes[1] << 16) | (bytes[0] << 24);
+    for (let i = 4; i < bytes.length; i++) {
+        value = value * 256 + bytes[i];
+    }
+    return value * 8 + len;
+}
+class Node {
+    leaf;
+    children;
+    convertListChildrenToMap() {
+        if (!(this.children instanceof ListChildren)) {
+            return;
+        }
+        this.children = MapChildren.fromListNode(this.children);
+    }
+    static withList() {
+        return new Node(undefined, ListChildren.new());
+    }
+    static withMap() {
+        return new Node(undefined, MapChildren.new());
+    }
+    constructor(leaf, children) {
+        this.leaf = leaf;
+        this.children = children;
+    }
+    getLeaf() {
+        return this.leaf;
+    }
+    remove(_key) {
+        if (this.leaf === undefined) {
+            return null;
+        }
+        const removedLeaf = this.leaf;
+        this.leaf = undefined;
+        return removedLeaf;
+    }
+    set(key, value) {
+        if (this.leaf === undefined) {
+            this.leaf = { key, value };
+            return this.leaf;
+        }
+        this.leaf.value = value;
+        return null;
+    }
+}
+class ListChildren {
+    children = [];
+    constructor() { }
+    find(key) {
+        const result = this.children.find((item) => item[0].isEqualTo(key));
+        if (result !== undefined) {
+            return result[1];
+        }
+        return null;
+    }
+    remove(key) {
+        const existingIndex = this.children.findIndex((item) => item[0].isEqualTo(key));
+        if (existingIndex >= 0) {
+            const ret = this.children.splice(existingIndex, 1);
+            return ret[0][1];
+        }
+        return null;
+    }
+    insert(key, leaf) {
+        const existingIndex = this.children.findIndex((item) => item[0].isEqualTo(key));
+        if (existingIndex >= 0) {
+            const existing = this.children[existingIndex];
+            existing[1].value = leaf.value;
+            return null;
+        }
+        this.children.push([key, leaf]);
+        return leaf;
+    }
+    static new() {
+        return new ListChildren();
+    }
+}
+class MapChildren {
+    children = new Map();
+    constructor() { }
+    static new() {
+        return new MapChildren();
+    }
+    static fromListNode(node) {
+        const mapNode = new MapChildren();
+        for (const [key, leaf] of node.children) {
+            const currentKeyChunk = asOpaqueType(BytesBlob.blobFrom(key.raw.subarray(0, CHUNK_SIZE)));
+            const subKey = BytesBlob.blobFrom(key.raw.subarray(CHUNK_SIZE));
+            let child = mapNode.getChild(currentKeyChunk);
+            if (child === undefined) {
+                child = Node.withList();
+                mapNode.setChild(currentKeyChunk, child);
+            }
+            const children = child.children;
+            children.insert(subKey, leaf);
+        }
+        return mapNode;
+    }
+    getChild(keyChunk) {
+        const chunkAsNumber = bytesAsU48(keyChunk.raw);
+        return this.children.get(chunkAsNumber);
+    }
+    setChild(keyChunk, node) {
+        const chunkAsNumber = bytesAsU48(keyChunk.raw);
+        this.children.set(chunkAsNumber, node);
+    }
+}
+
+/**
+ * A map which uses hashes as keys.
+ *
+ * @deprecated
+ * */
+class StringHashDictionary {
     // TODO [ToDr] [crit] We can't use `TrieHash` directly in the map,
     // because of the way it's being compared. Hence having `string` here.
     // This has to be benchmarked and re-written to a custom map most likely.
@@ -4486,6 +4916,16 @@ class HashDictionary {
         return this.map.delete(key.toString());
     }
 }
+/**
+ * A value that indicates when `BlobDictionary` transforms Array nodes into Map nodes.
+ * In practice, it doesn't matter much because, in real life, arrays in this structure usually have a length close to 1.
+ */
+const BLOB_DICTIONARY_THRESHOLD$1 = 5;
+class HashDictionary extends BlobDictionary {
+    constructor() {
+        super(BLOB_DICTIONARY_THRESHOLD$1);
+    }
+}
 
 /** A set specialized for storing hashes. */
 class HashSet {
@@ -4935,6 +5375,18 @@ class SortedSet extends SortedArray {
     }
 }
 
+function getTruncatedKey(key) {
+    // Always return exactly TRUNCATED_HASH_SIZE bytes.
+    if (key.length === TRUNCATED_HASH_SIZE) {
+        return key;
+    }
+    return Bytes.fromBlob(key.raw.subarray(0, TRUNCATED_HASH_SIZE), TRUNCATED_HASH_SIZE);
+}
+/**
+ * A value that indicates when `BlobDictionary` transforms Array nodes into Map nodes.
+ * In practice, it doesn't matter much because, in real life, arrays in this structure usually have a length close to 1.
+ */
+const BLOB_DICTIONARY_THRESHOLD = 5;
 /**
  * A collection of hash-based keys (likely `StateKey`s) which ignores
  * differences on the last byte.
@@ -4947,48 +5399,37 @@ class TruncatedHashDictionary {
      * Each key will be copied and have the last byte replace with a 0.
      */
     static fromEntries(entries) {
-        /** Copy key bytes of an entry and replace the last one with 0. */
-        const mapped = Array.from(entries).map(([key, value]) => {
-            const newKey = Bytes.zero(HASH_SIZE).asOpaque();
-            newKey.raw.set(key.raw.subarray(0, TRUNCATED_HASH_SIZE));
-            return [newKey, value];
-        });
-        return new TruncatedHashDictionary(HashDictionary.fromEntries(mapped));
+        return new TruncatedHashDictionary(BlobDictionary.fromEntries(Array.from(entries).map(([key, value]) => [getTruncatedKey(key), value]), BLOB_DICTIONARY_THRESHOLD));
     }
-    /** A truncated key which we re-use to query the dictionary. */
-    truncatedKey = Bytes.zero(HASH_SIZE).asOpaque();
     constructor(dict) {
         this.dict = dict;
     }
     [TEST_COMPARE_USING]() {
-        return this.dict;
+        return Array.from(this.dict);
     }
     /** Return number of items in the dictionary. */
     get size() {
         return this.dict.size;
     }
     /** Retrieve a value that matches the key on `TRUNCATED_HASH_SIZE`. */
-    get(fullKey) {
-        this.truncatedKey.raw.set(fullKey.raw.subarray(0, TRUNCATED_HASH_SIZE));
-        return this.dict.get(this.truncatedKey);
+    get(key) {
+        const truncatedKey = getTruncatedKey(key);
+        return this.dict.get(truncatedKey);
     }
     /** Return true if the key is present in the dictionary */
-    has(fullKey) {
-        this.truncatedKey.raw.set(fullKey.raw.subarray(0, TRUNCATED_HASH_SIZE));
-        return this.dict.has(this.truncatedKey);
+    has(key) {
+        const truncatedKey = getTruncatedKey(key);
+        return this.dict.has(truncatedKey);
     }
     /** Set or update a value that matches the key on `TRUNCATED_HASH_SIZE`. */
-    set(fullKey, value) {
-        // NOTE we can't use the the shared key here, since the collection will
-        // store the key for us, hence the copy.
-        const key = Bytes.zero(HASH_SIZE);
-        key.raw.set(fullKey.raw.subarray(0, TRUNCATED_HASH_SIZE));
-        this.dict.set(key.asOpaque(), value);
+    set(key, value) {
+        const truncatedKey = getTruncatedKey(key);
+        this.dict.set(truncatedKey, value);
     }
     /** Remove a value that matches the key on `TRUNCATED_HASH_SIZE`. */
-    delete(fullKey) {
-        this.truncatedKey.raw.set(fullKey.raw.subarray(0, TRUNCATED_HASH_SIZE));
-        this.dict.delete(this.truncatedKey);
+    delete(key) {
+        const truncatedKey = getTruncatedKey(key);
+        this.dict.delete(truncatedKey);
     }
     /** Iterator over values of the dictionary. */
     values() {
@@ -4996,26 +5437,28 @@ class TruncatedHashDictionary {
     }
     /** Iterator over entries of the dictionary (with truncated keys) */
     *entries() {
-        for (const [key, value] of this.dict.entries()) {
-            yield [Bytes.fromBlob(key.raw.subarray(0, TRUNCATED_HASH_SIZE), TRUNCATED_HASH_SIZE).asOpaque(), value];
-        }
+        yield* this.dict.entries();
     }
     [Symbol.iterator]() {
         return this.entries();
     }
 }
 
-var index$o = /*#__PURE__*/Object.freeze({
+var index$n = /*#__PURE__*/Object.freeze({
   __proto__: null,
   ArrayView: ArrayView,
+  BlobDictionary: BlobDictionary,
   FixedSizeArray: FixedSizeArray,
   HashDictionary: HashDictionary,
   HashSet: HashSet,
+  ListChildren: ListChildren,
   MultiMap: MultiMap,
   SortedArray: SortedArray,
   SortedSet: SortedSet,
+  StringHashDictionary: StringHashDictionary,
   TruncatedHashDictionary: TruncatedHashDictionary,
-  asKnownSize: asKnownSize
+  asKnownSize: asKnownSize,
+  bytesAsU48: bytesAsU48
 });
 
 /**
@@ -5192,7 +5635,7 @@ var PvmBackend;
     PvmBackend[PvmBackend["Ananas"] = 1] = "Ananas";
 })(PvmBackend || (PvmBackend = {}));
 
-var index$n = /*#__PURE__*/Object.freeze({
+var index$m = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Bootnode: Bootnode,
   ChainSpec: ChainSpec,
@@ -6699,7 +7142,7 @@ function reencodeAsView(codec, object, chainSpec) {
     return Decoder.decodeObject(codec.View, encoded, chainSpec);
 }
 
-var index$m = /*#__PURE__*/Object.freeze({
+var index$l = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Block: Block,
   EpochMarker: EpochMarker,
@@ -6709,6 +7152,8 @@ var index$m = /*#__PURE__*/Object.freeze({
   SEGMENT_BYTES: SEGMENT_BYTES,
   TicketsMarker: TicketsMarker,
   ValidatorKeys: ValidatorKeys,
+  W_E: W_E,
+  W_S: W_S,
   assurances: assurances,
   codecPerEpochBlock: codecPerEpochBlock,
   codecPerValidator: codecPerValidator,
@@ -6969,7 +7414,7 @@ var json;
     json.object = object;
 })(json || (json = {}));
 
-var index$l = /*#__PURE__*/Object.freeze({
+var index$k = /*#__PURE__*/Object.freeze({
   __proto__: null,
   get json () { return json; },
   parseFromJson: parseFromJson
@@ -7239,7 +7684,7 @@ const blockFromJson = (spec) => json.object({
     extrinsic: getExtrinsicFromJson(spec),
 }, ({ header, extrinsic }) => Block.create({ header, extrinsic }));
 
-var index$k = /*#__PURE__*/Object.freeze({
+var index$j = /*#__PURE__*/Object.freeze({
   __proto__: null,
   blockFromJson: blockFromJson,
   disputesExtrinsicFromJson: disputesExtrinsicFromJson,
@@ -7733,7 +8178,7 @@ class Logger {
     }
 }
 
-var index$j = /*#__PURE__*/Object.freeze({
+var index$i = /*#__PURE__*/Object.freeze({
   __proto__: null,
   get Level () { return Level; },
   Logger: Logger,
@@ -7948,7 +8393,7 @@ function isJsonObject(value) {
     return typeof value === "object" && value !== null && !Array.isArray(value);
 }
 
-var index$i = /*#__PURE__*/Object.freeze({
+var index$h = /*#__PURE__*/Object.freeze({
   __proto__: null,
   DEFAULT_CONFIG: DEFAULT_CONFIG,
   DEV_CONFIG: DEV_CONFIG,
@@ -9157,11 +9602,32 @@ const ENTROPY_ENTRIES = 4;
 
 var UpdatePreimageKind;
 (function (UpdatePreimageKind) {
-    /** Insert new preimage and optionally update it's lookup history. */
+    /**
+     * Insert new preimage and optionally update it's lookup history.
+     *
+     * Used in: `provide`
+     *
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/383904383904?v=0.7.2
+     */
     UpdatePreimageKind[UpdatePreimageKind["Provide"] = 0] = "Provide";
-    /** Remove a preimage and it's lookup history. */
+    /**
+     * Remove a preimage and it's lookup history.
+     *
+     * Used in: `forget` and `eject`
+     *
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/38c701380202?v=0.7.2
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/379102379302?v=0.7.2
+     */
     UpdatePreimageKind[UpdatePreimageKind["Remove"] = 1] = "Remove";
-    /** update or add lookup history for preimage hash/len to given value. */
+    /**
+     * Update or add lookup history for preimage hash/len to given value.
+     *
+     * Used in: `solicit` and `forget`
+     *
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/382802382802?v=0.7.2
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/384002384b02?v=0.7.2
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/38c60038ea00?v=0.7.2
+     */
     UpdatePreimageKind[UpdatePreimageKind["UpdateOrAdd"] = 2] = "UpdateOrAdd";
 })(UpdatePreimageKind || (UpdatePreimageKind = {}));
 /**
@@ -9169,7 +9635,7 @@ var UpdatePreimageKind;
  *
  * Can be one of the following cases:
  * 1. Provide a new preimage blob and set the lookup history to available at `slot`.
- * 2. Remove (expunge) a preimage and it's lookup history.
+ * 2. Remove (forget) a preimage and it's lookup history.
  * 3. Update `LookupHistory` with given value.
  */
 class UpdatePreimage {
@@ -9742,7 +10208,7 @@ const serviceDataCodec = codec$1.dictionary(codec$1.u32.asOpaque(), serviceEntri
     sortKeys: (a, b) => a - b,
 });
 
-var index$h = /*#__PURE__*/Object.freeze({
+var index$g = /*#__PURE__*/Object.freeze({
   __proto__: null,
   AUTHORIZATION_QUEUE_SIZE: AUTHORIZATION_QUEUE_SIZE,
   AccumulationOutput: AccumulationOutput,
@@ -10373,7 +10839,6 @@ class LeafNode {
     /**
      * Get the byte length of embedded value.
      *
-     * @remark
      * Note in case this node only contains hash this is going to be 0.
      */
     getValueLength() {
@@ -10384,7 +10849,6 @@ class LeafNode {
     /**
      * Returns the embedded value.
      *
-     * @remark
      * Note that this is going to be empty for a regular leaf node (i.e. containing a hash).
      */
     getValue() {
@@ -10394,7 +10858,6 @@ class LeafNode {
     /**
      * Returns contained value hash.
      *
-     * @remark
      * Note that for embedded value this is going to be full 0-padded 32 bytes.
      */
     getValueHash() {
@@ -10816,7 +11279,7 @@ const bitLookup = [
     [0b00000000, 8],
 ];
 
-var index$g = /*#__PURE__*/Object.freeze({
+var index$f = /*#__PURE__*/Object.freeze({
   __proto__: null,
   BranchNode: BranchNode,
   InMemoryTrie: InMemoryTrie,
@@ -11183,7 +11646,7 @@ function loadState(spec, blake2b, entries) {
  *        hashmap of `key -> value` entries.
  */
 
-var index$f = /*#__PURE__*/Object.freeze({
+var index$e = /*#__PURE__*/Object.freeze({
   __proto__: null,
   SerializedService: SerializedService,
   SerializedState: SerializedState,
@@ -11432,7 +11895,7 @@ class InMemoryStates {
     async close() { }
 }
 
-var index$e = /*#__PURE__*/Object.freeze({
+var index$d = /*#__PURE__*/Object.freeze({
   __proto__: null,
   InMemoryBlocks: InMemoryBlocks,
   InMemorySerializedStates: InMemorySerializedStates,
@@ -11796,7 +12259,7 @@ const initEc = async () => {
     await init.reedSolomon();
 };
 
-var index$d = /*#__PURE__*/Object.freeze({
+var index$c = /*#__PURE__*/Object.freeze({
   __proto__: null,
   N_CHUNKS_REDUNDANCY: N_CHUNKS_REDUNDANCY,
   N_CHUNKS_REQUIRED: N_CHUNKS_REQUIRED,
@@ -12230,7 +12693,7 @@ class FuzzTarget {
     }
 }
 
-var index$c = /*#__PURE__*/Object.freeze({
+var index$b = /*#__PURE__*/Object.freeze({
   __proto__: null,
   AncestryItem: AncestryItem,
   ErrorMessage: ErrorMessage,
@@ -12248,9 +12711,9 @@ var index$c = /*#__PURE__*/Object.freeze({
   stateRootCodec: stateRootCodec
 });
 
-var index$b = /*#__PURE__*/Object.freeze({
+var index$a = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  v1: index$c
+  v1: index$b
 });
 
 /** Size of the transfer memo. */
@@ -12679,7 +13142,11 @@ class PartiallyUpdatedState {
         const service = this.state.getService(serviceId);
         return service?.getPreimage(hash) ?? null;
     }
-    /** Get status of a preimage of current service taking into account any updates. */
+    /**
+     * Get status of a preimage of current service taking into account any updates.
+     *
+     * https://graypaper.fluffylabs.dev/#/ab2cdbd/110201110201?v=0.7.2
+     */
     getLookupHistory(currentTimeslot, serviceId, hash, length) {
         const updatedService = this.stateUpdate.services.updated.get(serviceId);
         /** Return lookup history item for newly created service */
@@ -12716,12 +13183,7 @@ class PartiallyUpdatedState {
                 return new LookupHistoryItem(hash, updatedPreimage.length, tryAsLookupHistorySlots([currentTimeslot]));
             }
             case UpdatePreimageKind.Remove: {
-                const state = stateFallback();
-                // kinda impossible, since we know it's there because it's removed.
-                if (state === null) {
-                    return null;
-                }
-                return new LookupHistoryItem(hash, state.length, tryAsLookupHistorySlots([...state.slots, currentTimeslot]));
+                return null;
             }
             case UpdatePreimageKind.UpdateOrAdd: {
                 return action.item;
@@ -13113,42 +13575,6 @@ class HostCallsManager {
     }
 }
 
-/** Create a new gas counter instance depending on the gas value. */
-function gasCounter(gas) {
-    return new GasCounterU64(tryAsU64(gas));
-}
-class GasCounterU64 {
-    gas;
-    initialGas;
-    constructor(gas) {
-        this.gas = gas;
-        this.initialGas = tryAsGas(gas);
-    }
-    set(g) {
-        this.gas = tryAsU64(g);
-    }
-    get() {
-        return tryAsGas(this.gas);
-    }
-    sub(g) {
-        const result = this.gas - tryAsU64(g);
-        if (result >= 0n) {
-            this.gas = tryAsU64(result);
-            return false;
-        }
-        this.gas = tryAsU64(0n);
-        return true;
-    }
-    used() {
-        const gasConsumed = tryAsU64(this.initialGas) - this.gas;
-        // In we have less than zero left we assume that all gas has been consumed.
-        if (gasConsumed < 0) {
-            return this.initialGas;
-        }
-        return tryAsGas(gasConsumed);
-    }
-}
-
 const tryAsMemoryIndex = (index) => {
     check `${index >= 0 && index <= MAX_MEMORY_INDEX} Incorrect memory index: ${index}!`;
     return asOpaqueType(index);
@@ -13871,7 +14297,7 @@ function getRegisters(argsLength) {
     return regs;
 }
 
-var index$a = /*#__PURE__*/Object.freeze({
+var index$9 = /*#__PURE__*/Object.freeze({
   __proto__: null,
   MemorySegment: MemorySegment,
   SpiMemory: SpiMemory,
@@ -13930,7 +14356,7 @@ function extractCodeAndMetadata(blobWithMetadata) {
     return { metadata, code };
 }
 
-var index$9 = /*#__PURE__*/Object.freeze({
+var index$8 = /*#__PURE__*/Object.freeze({
   __proto__: null,
   Program: Program,
   extractCodeAndMetadata: extractCodeAndMetadata
@@ -14894,6 +15320,42 @@ class BasicBlocks {
     }
 }
 
+/** Create a new gas counter instance depending on the gas value. */
+function gasCounter(gas) {
+    return new GasCounterU64(tryAsU64(gas));
+}
+class GasCounterU64 {
+    gas;
+    initialGas;
+    constructor(gas) {
+        this.gas = gas;
+        this.initialGas = tryAsGas(gas);
+    }
+    set(g) {
+        this.gas = tryAsU64(g);
+    }
+    get() {
+        return tryAsGas(this.gas);
+    }
+    sub(g) {
+        const result = this.gas - tryAsU64(g);
+        if (result >= 0n) {
+            this.gas = tryAsU64(result);
+            return false;
+        }
+        this.gas = tryAsU64(0n);
+        return true;
+    }
+    used() {
+        const gasConsumed = tryAsU64(this.initialGas) - this.gas;
+        // In we have less than zero left we assume that all gas has been consumed.
+        if (gasConsumed < 0) {
+            return this.initialGas;
+        }
+        return tryAsGas(gasConsumed);
+    }
+}
+
 const instructionGasMap = (() => {
     const instructionGasMap = new Array(HIGHEST_INSTRUCTION_NUMBER + 1);
     for (let i = 0; i < HIGHEST_INSTRUCTION_NUMBER + 1; i++) {
@@ -16802,8 +17264,77 @@ class Interpreter {
     }
 }
 
-var index$8 = /*#__PURE__*/Object.freeze({
+class DebuggerAdapter {
+    pvm;
+    constructor(useSbrkGas = false) {
+        this.pvm = new Interpreter({ useSbrkGas });
+    }
+    resetGeneric(rawProgram, flatRegisters, initialGas) {
+        this.pvm.resetGeneric(rawProgram, 0, tryAsGas(initialGas), new Registers(flatRegisters));
+    }
+    reset(rawProgram, pc, gas, maybeRegisters, maybeMemory) {
+        this.pvm.resetGeneric(rawProgram, pc, tryAsGas(gas), maybeRegisters, maybeMemory);
+    }
+    getPageDump(pageNumber) {
+        const page = this.pvm.getMemoryPage(pageNumber);
+        if (page === null) {
+            // page wasn't allocated so we return an empty page
+            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 = safeAllocUint8Array(PAGE_SIZE$1);
+        fullPage.set(page);
+        return fullPage;
+    }
+    setMemory(address, value) {
+        this.pvm.memory.storeFrom(tryAsMemoryIndex(address), value);
+    }
+    getExitArg() {
+        return this.pvm.getExitParam() ?? 0;
+    }
+    getStatus() {
+        return this.pvm.getStatus();
+    }
+    nextStep() {
+        return this.pvm.nextStep() === Status.OK;
+    }
+    nSteps(steps) {
+        check `${steps >>> 0 > 0} Expected a positive integer got ${steps}`;
+        for (let i = 0; i < steps; i++) {
+            const isOk = this.nextStep();
+            if (!isOk) {
+                return false;
+            }
+        }
+        return true;
+    }
+    getRegisters() {
+        return this.pvm.registers.getAllU64();
+    }
+    setRegisters(registers) {
+        this.pvm.registers.copyFrom(new Registers(registers));
+    }
+    getProgramCounter() {
+        return this.pvm.getPC();
+    }
+    setNextProgramCounter(nextPc) {
+        this.pvm.setNextPC(nextPc);
+    }
+    getGasLeft() {
+        return BigInt(this.pvm.gas.get());
+    }
+    setGasLeft(gas) {
+        this.pvm.gas.set(tryAsGas(gas));
+    }
+}
+
+var index$7 = /*#__PURE__*/Object.freeze({
   __proto__: null,
+  DebuggerAdapter: DebuggerAdapter,
   Interpreter: Interpreter,
   Memory: Memory,
   MemoryBuilder: MemoryBuilder,
@@ -17393,7 +17924,7 @@ class InterpreterInstanceManager {
     }
 }
 
-var index$7 = /*#__PURE__*/Object.freeze({
+var index$6 = /*#__PURE__*/Object.freeze({
   __proto__: null,
   HostCallMemory: HostCallMemory,
   HostCallRegisters: HostCallRegisters,
@@ -17486,7 +18017,7 @@ const codecServiceAccountInfoWithThresholdBalance = codec$1.object({
     parentService: codec$1.u32.convert((x) => x, tryAsServiceId),
 }, "ServiceAccountInfoWithThresholdBalance");
 
-var index$6 = /*#__PURE__*/Object.freeze({
+var index$5 = /*#__PURE__*/Object.freeze({
   __proto__: null,
   AccumulationStateUpdate: AccumulationStateUpdate,
   CURRENT_SERVICE_ID: CURRENT_SERVICE_ID,
@@ -17641,154 +18172,9 @@ class Mountain {
     }
 }
 
-var index$5 = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  MerkleMountainRange: MerkleMountainRange
-});
-
-class DebuggerAdapter {
-    pvm;
-    constructor(useSbrkGas = false) {
-        this.pvm = new Interpreter({ useSbrkGas });
-    }
-    resetGeneric(rawProgram, flatRegisters, initialGas) {
-        this.pvm.resetGeneric(rawProgram, 0, tryAsGas(initialGas), new Registers(flatRegisters));
-    }
-    reset(rawProgram, pc, gas, maybeRegisters, maybeMemory) {
-        this.pvm.resetGeneric(rawProgram, pc, tryAsGas(gas), maybeRegisters, maybeMemory);
-    }
-    getPageDump(pageNumber) {
-        const page = this.pvm.getMemoryPage(pageNumber);
-        if (page === null) {
-            // page wasn't allocated so we return an empty page
-            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 = safeAllocUint8Array(PAGE_SIZE$1);
-        fullPage.set(page);
-        return fullPage;
-    }
-    setMemory(address, value) {
-        this.pvm.memory.storeFrom(tryAsMemoryIndex(address), value);
-    }
-    getExitArg() {
-        return this.pvm.getExitParam() ?? 0;
-    }
-    getStatus() {
-        return this.pvm.getStatus();
-    }
-    nextStep() {
-        return this.pvm.nextStep() === Status.OK;
-    }
-    nSteps(steps) {
-        check `${steps >>> 0 > 0} Expected a positive integer got ${steps}`;
-        for (let i = 0; i < steps; i++) {
-            const isOk = this.nextStep();
-            if (!isOk) {
-                return false;
-            }
-        }
-        return true;
-    }
-    getRegisters() {
-        return this.pvm.registers.getAllU64();
-    }
-    setRegisters(registers) {
-        this.pvm.registers.copyFrom(new Registers(registers));
-    }
-    getProgramCounter() {
-        return this.pvm.getPC();
-    }
-    setNextProgramCounter(nextPc) {
-        this.pvm.setNextPC(nextPc);
-    }
-    getGasLeft() {
-        return BigInt(this.pvm.gas.get());
-    }
-    setGasLeft(gas) {
-        this.pvm.gas.set(tryAsGas(gas));
-    }
-}
-
 var index$4 = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  AccumulationStateUpdate: AccumulationStateUpdate,
-  ArgsDecoder: ArgsDecoder,
-  get ArgumentType () { return ArgumentType; },
-  BasicBlocks: BasicBlocks,
-  CURRENT_SERVICE_ID: CURRENT_SERVICE_ID,
-  get EjectError () { return EjectError; },
-  ExtendedWitdthImmediateDecoder: ExtendedWitdthImmediateDecoder,
-  get ForgetPreimageError () { return ForgetPreimageError; },
-  HostCallMemory: HostCallMemory,
-  HostCallRegisters: HostCallRegisters,
-  HostCallResult: HostCallResult,
-  ImmediateDecoder: ImmediateDecoder,
-  InsufficientFundsError: InsufficientFundsError,
-  MachineInstance: MachineInstance,
-  Mask: Mask,
-  get MemoryOperation () { return MemoryOperation; },
-  MemorySegment: MemorySegment,
-  NO_OF_REGISTERS: NO_OF_REGISTERS$1,
-  get NewServiceError () { return NewServiceError; },
-  NibblesDecoder: NibblesDecoder,
-  NoMachineError: NoMachineError,
-  OK: OK,
-  get PagesError () { return PagesError; },
-  PartiallyUpdatedState: PartiallyUpdatedState,
-  get PeekPokeError () { return PeekPokeError; },
-  PendingTransfer: PendingTransfer,
-  get PreimageStatusKind () { return PreimageStatusKind; },
-  Program: Program,
-  ProgramDecoder: ProgramDecoder,
-  get ProvidePreimageError () { return ProvidePreimageError; },
-  Pvm: DebuggerAdapter,
-  Registers: Registers,
-  get RequestPreimageError () { return RequestPreimageError; },
-  Result: Result$1,
-  SERVICE_ID_BYTES: SERVICE_ID_BYTES,
-  SegmentExportError: SegmentExportError,
-  SpiMemory: SpiMemory,
-  SpiProgram: SpiProgram,
-  TRANSFER_MEMO_BYTES: TRANSFER_MEMO_BYTES,
-  get TransferError () { return TransferError; },
-  UnprivilegedError: UnprivilegedError,
-  get UpdatePrivilegesError () { return UpdatePrivilegesError; },
-  WithDebug: WithDebug,
-  get ZeroVoidError () { return ZeroVoidError; },
-  asOpaqueType: asOpaqueType,
-  assertEmpty: assertEmpty,
-  assertNever: assertNever,
-  block: index$m,
-  bytes: index$t,
-  check: check,
-  clampU64ToU32: clampU64ToU32,
-  createResults: createResults,
-  decodeStandardProgram: decodeStandardProgram,
-  emptyRegistersBuffer: emptyRegistersBuffer,
-  extractCodeAndMetadata: extractCodeAndMetadata,
-  getServiceId: getServiceId,
-  getServiceIdOrCurrent: getServiceIdOrCurrent,
-  hash: index$p,
-  hostCallInfoAccount: codecServiceAccountInfoWithThresholdBalance,
-  inspect: inspect,
-  instructionArgumentTypeMap: instructionArgumentTypeMap,
-  interpreter: index$8,
-  isBrowser: isBrowser,
-  lazyInspect: lazyInspect,
-  measure: measure,
-  numbers: index$s,
-  resultToString: resultToString,
-  seeThrough: seeThrough,
-  slotsToPreimageStatus: slotsToPreimageStatus,
-  toMemoryOperation: toMemoryOperation,
-  tryAsMachineId: tryAsMachineId,
-  tryAsProgramCounter: tryAsProgramCounter,
-  writeServiceIdAsLeBytes: writeServiceIdAsLeBytes
+  MerkleMountainRange: MerkleMountainRange
 });
 
 const ENTROPY_BYTES = 32;
@@ -18430,4 +18816,4 @@ var index = /*#__PURE__*/Object.freeze({
   TransitionHasher: TransitionHasher
 });
 
-export { index$m as block, index$k as block_json, index$t as bytes, index$r as codec, index$o as collections, index$n as config, index$i as config_node, index$q as crypto, index$e as database, index$d as erasure_coding, index$b as fuzz_proto, index$p as hash, index$6 as jam_host_calls, index$l as json_parser, index$j as logger, index$5 as mmr, index$s as numbers, index$u as ordering, index$4 as pvm, index$7 as pvm_host_calls, index$8 as pvm_interpreter, index$9 as pvm_program, index$a as pvm_spi_decoder, index$3 as shuffling, index$h as state, index$2 as state_json, index$f as state_merkleization, index$1 as state_vectors, index as transition, index$g as trie, index$v 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$5 as jam_host_calls, index$k as json_parser, index$i as logger, index$4 as mmr, index$r as numbers, index$t as ordering, index$7 as pvm, index$6 as pvm_host_calls, index$8 as pvm_program, index$9 as pvm_spi_decoder, index$3 as shuffling, index$g as state, index$2 as state_json, index$e as state_merkleization, index$1 as state_vectors, index as transition, index$f as trie, index$u as utils };