@feelyourprotocol/evm 8141.0.0

package/dist/cjs/precompiles/types.d.ts

@@ -0,0 +1,13 @@
+import type { Common } from '@feelyourprotocol/common';
+import type { EVMInterface, ExecResult } from '../types.ts';
+export interface PrecompileFunc {
+    (input: PrecompileInput): Promise<ExecResult> | ExecResult;
+}
+export interface PrecompileInput {
+    data: Uint8Array;
+    gasLimit: bigint;
+    common: Common;
+    _EVM: EVMInterface;
+    _debug?: debug.Debugger;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/cjs/precompiles/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/precompiles/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAA;AAEhD,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE3D,MAAM,WAAW,cAAc;IAC7B,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,UAAU,CAAA;CAC3D;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,UAAU,CAAA;IAChB,QAAQ,EAAE,MAAM,CAAA;IAChB,MAAM,EAAE,MAAM,CAAA;IACd,IAAI,EAAE,YAAY,CAAA;IAClB,MAAM,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAA;CACxB"}

package/dist/cjs/precompiles/types.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/cjs/precompiles/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/precompiles/types.ts"],"names":[],"mappings":""}

package/dist/cjs/precompiles/util.d.ts

@@ -0,0 +1,30 @@
+import type { PrecompileInput } from './index.ts';
+/**
+ * Checks that the gas used remain under the gas limit.
+ *
+ * @param opts - Precompile input wrapper
+ * @param gasUsed - Amount of gas consumed by the precompile
+ * @param pName - Human readable precompile name for logging
+ * @returns `true` if the gas usage is within the provided limit
+ */
+export declare const gasLimitCheck: (opts: PrecompileInput, gasUsed: bigint, pName: string) => boolean;
+/**
+ * Checks that the length of the provided data is equal to `length`.
+ *
+ * @param opts - Precompile input wrapper
+ * @param length - Required data length in bytes
+ * @param pName - Human readable precompile name for logging
+ * @returns `true` if the provided data matches the required length
+ */
+export declare const equalityLengthCheck: (opts: PrecompileInput, length: number, pName: string) => boolean;
+/**
+ * Checks that the total length of the provided data input can be subdivided into k equal parts
+ * with `length` (without leaving some remainder bytes).
+ *
+ * @param opts - Precompile input wrapper
+ * @param length - Required chunk size
+ * @param pName - Human readable precompile name for logging
+ * @returns `true` if the length is divisible by the chunk size
+ */
+export declare const moduloLengthCheck: (opts: PrecompileInput, length: number, pName: string) => boolean;
+//# sourceMappingURL=util.d.ts.map

package/dist/cjs/precompiles/util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../../src/precompiles/util.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AAEjD;;;;;;;GAOG;AACH,eAAO,MAAM,aAAa,GAAI,MAAM,eAAe,EAAE,SAAS,MAAM,EAAE,OAAO,MAAM,YAgBlF,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,mBAAmB,GAAI,MAAM,eAAe,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,YAUvF,CAAA;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,eAAe,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,YAUrF,CAAA"}

package/dist/cjs/precompiles/util.js

@@ -0,0 +1,63 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moduloLengthCheck = exports.equalityLengthCheck = exports.gasLimitCheck = void 0;
+const util_1 = require("@feelyourprotocol/util");
+/**
+ * Checks that the gas used remain under the gas limit.
+ *
+ * @param opts - Precompile input wrapper
+ * @param gasUsed - Amount of gas consumed by the precompile
+ * @param pName - Human readable precompile name for logging
+ * @returns `true` if the gas usage is within the provided limit
+ */
+const gasLimitCheck = (opts, gasUsed, pName) => {
+    if (opts._debug !== undefined) {
+        opts._debug(`Run ${pName} precompile data=${(0, util_1.short)(opts.data)} length=${opts.data.length} gasLimit=${opts.gasLimit} gasUsed=${gasUsed}`);
+    }
+    if (opts.gasLimit < gasUsed) {
+        if (opts._debug !== undefined) {
+            opts._debug(`${pName} failed: OOG`);
+        }
+        return false;
+    }
+    return true;
+};
+exports.gasLimitCheck = gasLimitCheck;
+/**
+ * Checks that the length of the provided data is equal to `length`.
+ *
+ * @param opts - Precompile input wrapper
+ * @param length - Required data length in bytes
+ * @param pName - Human readable precompile name for logging
+ * @returns `true` if the provided data matches the required length
+ */
+const equalityLengthCheck = (opts, length, pName) => {
+    if (opts.data.length !== length) {
+        if (opts._debug !== undefined) {
+            opts._debug(`${pName} failed: Invalid input length length=${opts.data.length} (expected: ${length})`);
+        }
+        return false;
+    }
+    return true;
+};
+exports.equalityLengthCheck = equalityLengthCheck;
+/**
+ * Checks that the total length of the provided data input can be subdivided into k equal parts
+ * with `length` (without leaving some remainder bytes).
+ *
+ * @param opts - Precompile input wrapper
+ * @param length - Required chunk size
+ * @param pName - Human readable precompile name for logging
+ * @returns `true` if the length is divisible by the chunk size
+ */
+const moduloLengthCheck = (opts, length, pName) => {
+    if (opts.data.length % length !== 0) {
+        if (opts._debug !== undefined) {
+            opts._debug(`${pName} failed: Invalid input length length=${opts.data.length} (expected: ${length}*k bytes)`);
+        }
+        return false;
+    }
+    return true;
+};
+exports.moduloLengthCheck = moduloLengthCheck;
+//# sourceMappingURL=util.js.map

package/dist/cjs/precompiles/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../src/precompiles/util.ts"],"names":[],"mappings":";;;AAAA,2CAAwC;AAIxC;;;;;;;GAOG;AACI,MAAM,aAAa,GAAG,CAAC,IAAqB,EAAE,OAAe,EAAE,KAAa,EAAE,EAAE;IACrF,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CACT,OAAO,KAAK,oBAAoB,IAAA,YAAK,EAAC,IAAI,CAAC,IAAI,CAAC,WAC9C,IAAI,CAAC,IAAI,CAAC,MACZ,aAAa,IAAI,CAAC,QAAQ,YAAY,OAAO,EAAE,CAChD,CAAA;IACH,CAAC;IAED,IAAI,IAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,cAAc,CAAC,CAAA;QACrC,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAhBY,QAAA,aAAa,iBAgBzB;AAED;;;;;;;GAOG;AACI,MAAM,mBAAmB,GAAG,CAAC,IAAqB,EAAE,MAAc,EAAE,KAAa,EAAE,EAAE;IAC1F,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CACT,GAAG,KAAK,wCAAwC,IAAI,CAAC,IAAI,CAAC,MAAM,eAAe,MAAM,GAAG,CACzF,CAAA;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAVY,QAAA,mBAAmB,uBAU/B;AAED;;;;;;;;GAQG;AACI,MAAM,iBAAiB,GAAG,CAAC,IAAqB,EAAE,MAAc,EAAE,KAAa,EAAE,EAAE;IACxF,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CACT,GAAG,KAAK,wCAAwC,IAAI,CAAC,IAAI,CAAC,MAAM,eAAe,MAAM,WAAW,CACjG,CAAA;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAVY,QAAA,iBAAiB,qBAU7B"}

package/dist/cjs/stack.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Implementation of the stack used in evm.
+ */
+export declare class Stack {
+    private _store;
+    private _maxHeight;
+    private _len;
+    constructor(maxHeight?: number);
+    get length(): number;
+    /**
+     * Pushes a new bigint onto the stack.
+     * @param value - Value to push (must fit within the configured max height)
+     */
+    push(value: bigint): void;
+    /**
+     * Pops the top value from the stack.
+     * @returns The value removed from the stack
+     */
+    pop(): bigint;
+    /**
+     * Pops multiple items from the stack with the top-most item returned first.
+     * @param num - Number of items to pop (defaults to 1)
+     * @returns Array containing the popped values
+     */
+    popN(num?: number): bigint[];
+    /**
+     * Returns items from the stack without removing them.
+     * @param num - Number of items to return (defaults to 1)
+     * @returns Array of items, with index 0 representing the top of the stack
+     * @throws {@link EVMError} with code STACK_UNDERFLOW if there are not enough items on the stack
+     */
+    peek(num?: number): bigint[];
+    /**
+     * Swaps the top of the stack with another item.
+     * @param position - Zero-based index from the top of the stack (0 swaps with the top itself)
+     */
+    swap(position: number): void;
+    /**
+     * Pushes a copy of an item deeper in the stack.
+     * @param position - One-based index of the item to duplicate
+     */
+    dup(position: number): void;
+    /**
+     * Swaps two arbitrary entries relative to the top of the stack.
+     * @param swap1 - Distance from the top (0 = top element) for the first entry
+     * @param swap2 - Distance from the top for the second entry
+     */
+    exchange(swap1: number, swap2: number): void;
+    /**
+     * Returns a copy of the current stack. This represents the actual state of the stack
+     * (not the internal state of the stack, which might have unreachable elements in it)
+     */
+    getStack(): bigint[];
+}
+//# sourceMappingURL=stack.d.ts.map

package/dist/cjs/stack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.d.ts","sourceRoot":"","sources":["../../src/stack.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,qBAAa,KAAK;IAEhB,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,UAAU,CAAQ;IAE1B,OAAO,CAAC,IAAI,CAAY;gBAEZ,SAAS,CAAC,EAAE,MAAM;IAO9B,IAAI,MAAM,WAET;IAED;;;OAGG;IACH,IAAI,CAAC,KAAK,EAAE,MAAM;IASlB;;;OAGG;IACH,GAAG,IAAI,MAAM;IAYb;;;;OAIG;IACH,IAAI,CAAC,GAAG,GAAE,MAAU,GAAG,MAAM,EAAE;IAoB/B;;;;;OAKG;IACH,IAAI,CAAC,GAAG,GAAE,MAAU,GAAG,MAAM,EAAE;IAc/B;;;OAGG;IACH,IAAI,CAAC,QAAQ,EAAE,MAAM;IAkBrB;;;OAGG;IACH,GAAG,CAAC,QAAQ,EAAE,MAAM;IAepB;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAerC;;;OAGG;IACH,QAAQ;CAGT"}

package/dist/cjs/stack.js

@@ -0,0 +1,143 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Stack = void 0;
+const errors_ts_1 = require("./errors.js");
+/**
+ * Implementation of the stack used in evm.
+ */
+class Stack {
+    constructor(maxHeight) {
+        this._len = 0;
+        // It is possible to initialize the array with `maxHeight` items. However,
+        // this makes the constructor 10x slower and there do not seem to be any observable performance gains
+        this._store = [];
+        this._maxHeight = maxHeight ?? 1024;
+    }
+    get length() {
+        return this._len;
+    }
+    /**
+     * Pushes a new bigint onto the stack.
+     * @param value - Value to push (must fit within the configured max height)
+     */
+    push(value) {
+        if (this._len >= this._maxHeight) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_OVERFLOW);
+        }
+        // Read current length, set `_store` to value, and then increase the length
+        this._store[this._len++] = value;
+    }
+    /**
+     * Pops the top value from the stack.
+     * @returns The value removed from the stack
+     */
+    pop() {
+        if (this._len < 1) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_UNDERFLOW);
+        }
+        // Length is checked above, so pop shouldn't return undefined
+        // First decrease current length, then read the item and return it
+        // Note: this does thus not delete the item from the internal array
+        // However, the length is decreased, so it is not accessible to external observers
+        return this._store[--this._len];
+    }
+    /**
+     * Pops multiple items from the stack with the top-most item returned first.
+     * @param num - Number of items to pop (defaults to 1)
+     * @returns Array containing the popped values
+     */
+    popN(num = 1) {
+        if (this._len < num) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_UNDERFLOW);
+        }
+        if (num === 0) {
+            return [];
+        }
+        const arr = Array(num);
+        const cache = this._store;
+        for (let pop = 0; pop < num; pop++) {
+            // Note: this thus also (correctly) reduces the length of the internal array (without deleting items)
+            arr[pop] = cache[--this._len];
+        }
+        return arr;
+    }
+    /**
+     * Returns items from the stack without removing them.
+     * @param num - Number of items to return (defaults to 1)
+     * @returns Array of items, with index 0 representing the top of the stack
+     * @throws {@link EVMError} with code STACK_UNDERFLOW if there are not enough items on the stack
+     */
+    peek(num = 1) {
+        const peekArray = Array(num);
+        let start = this._len;
+        for (let peek = 0; peek < num; peek++) {
+            const index = --start;
+            if (index < 0) {
+                throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_UNDERFLOW);
+            }
+            peekArray[peek] = this._store[index];
+        }
+        return peekArray;
+    }
+    /**
+     * Swaps the top of the stack with another item.
+     * @param position - Zero-based index from the top of the stack (0 swaps with the top itself)
+     */
+    swap(position) {
+        if (this._len <= position) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_UNDERFLOW);
+        }
+        const head = this._len - 1;
+        const i = head - position;
+        const storageCached = this._store;
+        const tmp = storageCached[head];
+        storageCached[head] = storageCached[i];
+        storageCached[i] = tmp;
+    }
+    // I would say that we do not need this method any more
+    // since you can't copy a primitive data type
+    // Nevertheless not sure if we "loose" something here?
+    // Will keep commented out for now
+    /**
+     * Pushes a copy of an item deeper in the stack.
+     * @param position - One-based index of the item to duplicate
+     */
+    dup(position) {
+        const len = this._len;
+        if (len < position) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_UNDERFLOW);
+        }
+        // Note: this code is borrowed from `push()` (avoids a call)
+        if (len >= this._maxHeight) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_OVERFLOW);
+        }
+        const i = len - position;
+        this._store[this._len++] = this._store[i];
+    }
+    /**
+     * Swaps two arbitrary entries relative to the top of the stack.
+     * @param swap1 - Distance from the top (0 = top element) for the first entry
+     * @param swap2 - Distance from the top for the second entry
+     */
+    exchange(swap1, swap2) {
+        const headIndex = this._len - 1;
+        const exchangeIndex1 = headIndex - swap1;
+        const exchangeIndex2 = headIndex - swap2;
+        // Stack underflow is not possible in EOF
+        if (exchangeIndex1 < 0 || exchangeIndex2 < 0) {
+            throw new errors_ts_1.EVMError(errors_ts_1.EVMError.errorMessages.STACK_UNDERFLOW);
+        }
+        const cache = this._store[exchangeIndex2];
+        this._store[exchangeIndex2] = this._store[exchangeIndex1];
+        this._store[exchangeIndex1] = cache;
+    }
+    /**
+     * Returns a copy of the current stack. This represents the actual state of the stack
+     * (not the internal state of the stack, which might have unreachable elements in it)
+     */
+    getStack() {
+        return this._store.slice(0, this._len);
+    }
+}
+exports.Stack = Stack;
+//# sourceMappingURL=stack.js.map

package/dist/cjs/stack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.js","sourceRoot":"","sources":["../../src/stack.ts"],"names":[],"mappings":";;;AAAA,2CAAsC;AAEtC;;GAEG;AACH,MAAa,KAAK;IAOhB,YAAY,SAAkB;QAFtB,SAAI,GAAW,CAAC,CAAA;QAGtB,0EAA0E;QAC1E,qGAAqG;QACrG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAA;QAChB,IAAI,CAAC,UAAU,GAAG,SAAS,IAAI,IAAI,CAAA;IACrC,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,KAAa;QAChB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,cAAc,CAAC,CAAA;QAC3D,CAAC;QAED,2EAA2E;QAC3E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAA;IAClC,CAAC;IAED;;;OAGG;IACH,GAAG;QACD,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;QAC5D,CAAC;QAED,6DAA6D;QAC7D,kEAAkE;QAClE,mEAAmE;QACnE,kFAAkF;QAClF,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,MAAc,CAAC;QAClB,IAAI,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;YACpB,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;QAC5D,CAAC;QAED,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,OAAO,EAAE,CAAA;QACX,CAAC;QAED,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAA;QAEzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YACnC,qGAAqG;YACrG,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,MAAc,CAAC;QAClB,MAAM,SAAS,GAAa,KAAK,CAAC,GAAG,CAAC,CAAA;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAA;QAErB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,EAAE,KAAK,CAAA;YACrB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;YAC5D,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QACtC,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,QAAgB;QACnB,IAAI,IAAI,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;QAC5D,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QAC1B,MAAM,CAAC,GAAG,IAAI,GAAG,QAAQ,CAAA;QACzB,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAA;QAEjC,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;QAC/B,aAAa,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;QACtC,aAAa,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;IACxB,CAAC;IAED,uDAAuD;IACvD,6CAA6C;IAC7C,sDAAsD;IACtD,kCAAkC;IAClC;;;OAGG;IACH,GAAG,CAAC,QAAgB;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,GAAG,GAAG,QAAQ,EAAE,CAAC;YACnB,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;QAC5D,CAAC;QAED,4DAA4D;QAC5D,IAAI,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3B,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,cAAc,CAAC,CAAA;QAC3D,CAAC;QAED,MAAM,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,KAAa,EAAE,KAAa;QACnC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QAC/B,MAAM,cAAc,GAAG,SAAS,GAAG,KAAK,CAAA;QACxC,MAAM,cAAc,GAAG,SAAS,GAAG,KAAK,CAAA;QAExC,yCAAyC;QACzC,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YAC7C,MAAM,IAAI,oBAAQ,CAAC,oBAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,CAAA;QAC5D,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAA;QACzC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAA;QACzD,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,KAAK,CAAA;IACrC,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IACxC,CAAC;CACF;AAhKD,sBAgKC"}

package/dist/cjs/stemCache.d.ts

@@ -0,0 +1,20 @@
+import type { PrefixedHexString } from '@feelyourprotocol/util';
+import type { BinaryStemAccessEvent, BinaryStemMeta } from './binaryTreeAccessWitness.ts';
+export declare class StemCache {
+    cache: Map<PrefixedHexString, BinaryStemAccessEvent & BinaryStemMeta>;
+    constructor();
+    set(stemKey: PrefixedHexString, accessedStem: BinaryStemAccessEvent & BinaryStemMeta): void;
+    get(stemHex: PrefixedHexString): (BinaryStemAccessEvent & BinaryStemMeta) | undefined;
+    del(stemHex: PrefixedHexString): void;
+    commit(): [PrefixedHexString, BinaryStemAccessEvent & BinaryStemMeta][];
+    /**
+     * Clear cache
+     */
+    clear(): void;
+    /**
+     * Returns the size of the cache
+     * @returns Number of cached stems currently stored
+     */
+    size(): number;
+}
+//# sourceMappingURL=stemCache.d.ts.map

package/dist/cjs/stemCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stemCache.d.ts","sourceRoot":"","sources":["../../src/stemCache.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAA;AACzD,OAAO,KAAK,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAA;AAEzF,qBAAa,SAAS;IACpB,KAAK,EAAE,GAAG,CAAC,iBAAiB,EAAE,qBAAqB,GAAG,cAAc,CAAC,CAAA;;IAMrE,GAAG,CAAC,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,qBAAqB,GAAG,cAAc;IAIpF,GAAG,CAAC,OAAO,EAAE,iBAAiB,GAAG,CAAC,qBAAqB,GAAG,cAAc,CAAC,GAAG,SAAS;IAIrF,GAAG,CAAC,OAAO,EAAE,iBAAiB,GAAG,IAAI;IAIrC,MAAM,IAAI,CAAC,iBAAiB,EAAE,qBAAqB,GAAG,cAAc,CAAC,EAAE;IAQvE;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;;OAGG;IACH,IAAI;CAGL"}

package/dist/cjs/stemCache.js

@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.StemCache = void 0;
+class StemCache {
+    constructor() {
+        this.cache = new Map();
+    }
+    set(stemKey, accessedStem) {
+        this.cache.set(stemKey, accessedStem);
+    }
+    get(stemHex) {
+        return this.cache.get(stemHex);
+    }
+    del(stemHex) {
+        this.cache.delete(stemHex);
+    }
+    commit() {
+        const items = Array.from(this.cache.entries());
+        this.clear();
+        return items;
+    }
+    /**
+     * Clear cache
+     */
+    clear() {
+        this.cache.clear();
+    }
+    /**
+     * Returns the size of the cache
+     * @returns Number of cached stems currently stored
+     */
+    size() {
+        return this.cache.size;
+    }
+}
+exports.StemCache = StemCache;
+//# sourceMappingURL=stemCache.js.map

package/dist/cjs/stemCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stemCache.js","sourceRoot":"","sources":["../../src/stemCache.ts"],"names":[],"mappings":";;;AAGA,MAAa,SAAS;IAGpB;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAA6D,CAAA;IACnF,CAAC;IAED,GAAG,CAAC,OAA0B,EAAE,YAAoD;QAClF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IACvC,CAAC;IAED,GAAG,CAAC,OAA0B;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IAChC,CAAC;IAED,GAAG,CAAC,OAA0B;QAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAC5B,CAAC;IAED,MAAM;QACJ,MAAM,KAAK,GAAkE,KAAK,CAAC,IAAI,CACrF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CACrB,CAAA;QACD,IAAI,CAAC,KAAK,EAAE,CAAA;QACZ,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IACpB,CAAC;IAED;;;OAGG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;IACxB,CAAC;CACF;AAzCD,8BAyCC"}

package/dist/cjs/transientStorage.d.ts

@@ -0,0 +1,54 @@
+import type { Address } from '@feelyourprotocol/util';
+import type { TransientStorageInterface } from './types.ts';
+export declare class TransientStorage implements TransientStorageInterface {
+    /**
+     * The current values of the transient storage, keyed by contract address and then slot
+     */
+    private _storage;
+    /**
+     * Each change to storage is recorded in the journal. This is never cleared.
+     */
+    private _changeJournal;
+    /**
+     * The length of the journal at the beginning of each call in the call stack.
+     */
+    private _indices;
+    /**
+     * Get the value for the given address and key
+     * @param addr the address for which transient storage is accessed
+     * @param key the key of the address to get
+     */
+    get(addr: Address, key: Uint8Array): Uint8Array;
+    /**
+     * Put the given value for the address and key
+     * @param addr the address of the contract for which the key is being set
+     * @param key the slot to set for the address
+     * @param value the new value of the transient storage slot to set
+     */
+    put(addr: Address, key: Uint8Array, value: Uint8Array): void;
+    /**
+     * Commit all the changes since the last checkpoint
+     */
+    commit(): void;
+    /**
+     * To be called whenever entering a new context. If revert is called after checkpoint, all changes after the latest checkpoint are reverted.
+     */
+    checkpoint(): void;
+    /**
+     * Revert transient storage to the last checkpoint
+     */
+    revert(): void;
+    /**
+     * Create a JSON representation of the current transient storage state
+     */
+    toJSON(): {
+        [address: string]: {
+            [key: string]: string;
+        };
+    };
+    /**
+     * Clear transient storage state.
+     */
+    clear(): void;
+}
+//# sourceMappingURL=transientStorage.d.ts.map

package/dist/cjs/transientStorage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"transientStorage.d.ts","sourceRoot":"","sources":["../../src/transientStorage.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAA;AAC/C,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,YAAY,CAAA;AAY3D,qBAAa,gBAAiB,YAAW,yBAAyB;IAChE;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAqC;IACrD;;OAEG;IACH,OAAO,CAAC,cAAc,CAA8B;IACpD;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAgB;IAEhC;;;;OAIG;IACI,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,UAAU,GAAG,UAAU;IAYtD;;;;;OAKG;IACI,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU;IA2B5D;;OAEG;IACI,MAAM,IAAI,IAAI;IAMrB;;OAEG;IACI,UAAU,IAAI,IAAI;IAIzB;;OAEG;IACI,MAAM;IAWb;;OAEG;IACI,MAAM,IAAI;QAAE,CAAC,OAAO,EAAE,MAAM,GAAG;YAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;SAAE,CAAA;KAAE;IAWjE;;OAEG;IACI,KAAK,IAAI,IAAI;CAIrB"}

package/dist/cjs/transientStorage.js

@@ -0,0 +1,113 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TransientStorage = void 0;
+const util_1 = require("@feelyourprotocol/util");
+class TransientStorage {
+    constructor() {
+        /**
+         * The current values of the transient storage, keyed by contract address and then slot
+         */
+        this._storage = new Map();
+        /**
+         * Each change to storage is recorded in the journal. This is never cleared.
+         */
+        this._changeJournal = [];
+        /**
+         * The length of the journal at the beginning of each call in the call stack.
+         */
+        this._indices = [0];
+    }
+    /**
+     * Get the value for the given address and key
+     * @param addr the address for which transient storage is accessed
+     * @param key the key of the address to get
+     */
+    get(addr, key) {
+        const map = this._storage.get(addr.toString());
+        if (!map) {
+            return new Uint8Array(32);
+        }
+        const value = map.get((0, util_1.bytesToHex)(key));
+        if (!value) {
+            return new Uint8Array(32);
+        }
+        return value;
+    }
+    /**
+     * Put the given value for the address and key
+     * @param addr the address of the contract for which the key is being set
+     * @param key the slot to set for the address
+     * @param value the new value of the transient storage slot to set
+     */
+    put(addr, key, value) {
+        if (key.length !== 32) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Transient storage key must be 32 bytes long');
+        }
+        if (value.length > 32) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Transient storage value cannot be longer than 32 bytes');
+        }
+        const addrString = addr.toString();
+        if (!this._storage.has(addrString)) {
+            this._storage.set(addrString, new Map());
+        }
+        const map = this._storage.get(addrString);
+        const keyStr = (0, util_1.bytesToHex)(key);
+        const prevValue = map.get(keyStr) ?? new Uint8Array(32);
+        this._changeJournal.push({
+            addr: addrString,
+            key: keyStr,
+            prevValue,
+        });
+        map.set(keyStr, value);
+    }
+    /**
+     * Commit all the changes since the last checkpoint
+     */
+    commit() {
+        if (this._indices.length === 0)
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Nothing to commit');
+        // by discarding the length of the array from the last time checkpoint was called, all changes are included in the last stack
+        this._indices.pop();
+    }
+    /**
+     * To be called whenever entering a new context. If revert is called after checkpoint, all changes after the latest checkpoint are reverted.
+     */
+    checkpoint() {
+        this._indices.push(this._changeJournal.length);
+    }
+    /**
+     * Revert transient storage to the last checkpoint
+     */
+    revert() {
+        const lastCheckpoint = this._indices.pop();
+        if (typeof lastCheckpoint === 'undefined')
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Nothing to revert');
+        for (let i = this._changeJournal.length - 1; i >= lastCheckpoint; i--) {
+            const { key, prevValue, addr } = this._changeJournal[i];
+            this._storage.get(addr).set(key, prevValue);
+        }
+        this._changeJournal.splice(lastCheckpoint, this._changeJournal.length - lastCheckpoint);
+    }
+    /**
+     * Create a JSON representation of the current transient storage state
+     */
+    toJSON() {
+        const result = {};
+        for (const [address, map] of this._storage.entries()) {
+            result[address] = {};
+            for (const [key, value] of map.entries()) {
+                result[address][key] = (0, util_1.bytesToHex)(value);
+            }
+        }
+        return result;
+    }
+    /**
+     * Clear transient storage state.
+     */
+    clear() {
+        this._storage = new Map();
+        this._changeJournal = [];
+    }
+}
+exports.TransientStorage = TransientStorage;
+//# sourceMappingURL=transientStorage.js.map

package/dist/cjs/transientStorage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transientStorage.js","sourceRoot":"","sources":["../../src/transientStorage.ts"],"names":[],"mappings":";;;AAAA,2CAAyE;AAezE,MAAa,gBAAgB;IAA7B;QACE;;WAEG;QACK,aAAQ,GAA4B,IAAI,GAAG,EAAE,CAAA;QACrD;;WAEG;QACK,mBAAc,GAA4B,EAAE,CAAA;QACpD;;WAEG;QACK,aAAQ,GAAa,CAAC,CAAC,CAAC,CAAA;IAuGlC,CAAC;IArGC;;;;OAIG;IACI,GAAG,CAAC,IAAa,EAAE,GAAe;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;QAC9C,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;QACD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAA,iBAAU,EAAC,GAAG,CAAC,CAAC,CAAA;QACtC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,IAAa,EAAE,GAAe,EAAE,KAAiB;QAC1D,IAAI,GAAG,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;YACtB,MAAM,IAAA,iCAA0B,EAAC,6CAA6C,CAAC,CAAA;QACjF,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACtB,MAAM,IAAA,iCAA0B,EAAC,wDAAwD,CAAC,CAAA;QAC5F,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAA;QAClC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;QAC1C,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAE,CAAA;QAE1C,MAAM,MAAM,GAAG,IAAA,iBAAU,EAAC,GAAG,CAAC,CAAA;QAC9B,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,EAAE,CAAC,CAAA;QAEvD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;YACvB,IAAI,EAAE,UAAU;YAChB,GAAG,EAAE,MAAM;YACX,SAAS;SACV,CAAC,CAAA;QAEF,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACxB,CAAC;IAED;;OAEG;IACI,MAAM;QACX,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAA,iCAA0B,EAAC,mBAAmB,CAAC,CAAA;QACrF,6HAA6H;QAC7H,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAA;IACrB,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;IAChD,CAAC;IAED;;OAEG;IACI,MAAM;QACX,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAA;QAC1C,IAAI,OAAO,cAAc,KAAK,WAAW;YAAE,MAAM,IAAA,iCAA0B,EAAC,mBAAmB,CAAC,CAAA;QAEhG,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;YACtE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;YACvD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;QAC9C,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,cAAc,CAAC,CAAA;IACzF,CAAC;IAED;;OAEG;IACI,MAAM;QACX,MAAM,MAAM,GAAqD,EAAE,CAAA;QACnE,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,CAAA;YACpB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,iBAAU,EAAC,KAAK,CAAC,CAAA;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAA;QACzB,IAAI,CAAC,cAAc,GAAG,EAAE,CAAA;IAC1B,CAAC;CACF;AAnHD,4CAmHC"}