@aztec-labs/foundation 6.0.0-nightly.20260829

package/README.md

@@ -0,0 +1 @@
+# Foundation

package/dest/array/array.d.ts

@@ -0,0 +1,68 @@
+import type { Tuple } from '../serialize/index.js';
+export type { FieldsOf } from '../types/index.js';
+/**
+ * Create an array over an integer range.
+ * @param n - The number of integers.
+ * @param offset - The starting number.
+ * @returns The array of numbers.
+ */
+export declare function range(n: number, offset?: number): number[];
+/**
+ * Create an array over an integer range, filled with a function 'fn'.
+ * This is used over e.g. lodash because it resolved to a tuple type, needed for our fixed array type safety.
+ * @param n - The number of integers.
+ * @param fn - The generator function.
+ * @returns The array of numbers.
+ */
+export declare function makeTuple<T, N extends number>(length: N, fn: (i: number) => T, offset?: number): Tuple<T, N>;
+/**
+ * Create an array over an integer range, filled with a function 'fn'.
+ * This is used over e.g. lodash because it resolved to a tuple type, needed for our fixed array type safety.
+ * @param n - The number of integers.
+ * @param fn - The generator function.
+ * @returns The array of numbers.
+ */
+export declare function makeTupleAsync<T, N extends number>(length: N, fn: (i: number) => Promise<T>, offset?: number): Promise<Tuple<T, N>>;
+/**
+ * Assert a member of an object is a certain length.
+ * @param obj - An object.
+ * @param member - A member string.
+ * @param length - The length.
+ */
+export declare function assertMemberLength<F extends string, T extends {
+    [f in F]: {
+        /**
+         * A property which the tested member of the object T has to have.
+         */
+        length: number;
+    };
+}>(obj: T, member: F, length: number): void;
+/**
+ * Assert all subarrays in a member of an object are a certain length.
+ * @param obj - An object.
+ * @param member - A member string.
+ * @param length - The expected length for each subarray.
+ */
+export declare function assertItemsLength<F extends string, T extends {
+    [f in F]: {
+        /**
+         * A property which the tested member of the object T has to have.
+         */
+        length: number;
+    }[];
+}>(obj: T, member: F, length: number): void;
+/**
+ * Checks that the permutation is valid. Throws an error if it is not.
+ * @param original - The original array.
+ * @param permutation - The array which is allegedly a permutation of the original.
+ * @param indexes - The indices of the original array which the permutation should map to.
+ * @param isEqual - A function to compare the elements of the original and permutation arrays.
+ */
+export declare function assertPermutation<T>(original: T[], permutation: T[], indexes: number[], isEqual: (a: T, b: T) => boolean): void;
+export declare function assertRightPadded<T>(arr: T[], isEmpty: (item: T) => boolean): void;
+/**
+ * Shuffles an array in-place using the Fisher-Yates algorith,
+ * @param arr - The array to shuffle
+ */
+export declare function shuffle<T>(arr: T[]): void;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXJyYXkuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9hcnJheS9hcnJheS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxLQUFLLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQUVuRCxZQUFZLEVBQUUsUUFBUSxFQUFFLE1BQU0sbUJBQW1CLENBQUM7QUFFbEQ7Ozs7O0dBS0c7QUFDSCx3QkFBZ0IsS0FBSyxDQUFDLENBQUMsRUFBRSxNQUFNLEVBQUUsTUFBTSxTQUFJLFlBTTFDO0FBRUQ7Ozs7OztHQU1HO0FBQ0gsd0JBQWdCLFNBQVMsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxTQUFTLE1BQU0sRUFBRSxNQUFNLEVBQUUsQ0FBQyxFQUFFLEVBQUUsRUFBRSxDQUFDLENBQUMsRUFBRSxNQUFNLEtBQUssQ0FBQyxFQUFFLE1BQU0sU0FBSSxlQUV6RjtBQUVEOzs7Ozs7R0FNRztBQUNILHdCQUFzQixjQUFjLENBQUMsQ0FBQyxFQUFFLENBQUMsU0FBUyxNQUFNLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxFQUFFLEVBQUUsQ0FBQyxDQUFDLEVBQUUsTUFBTSxLQUFLLE9BQU8sQ0FBQyxDQUFDLENBQUMsRUFBRSxNQUFNLFNBQUksd0JBTTdHO0FBRUQ7Ozs7O0dBS0c7QUFDSCx3QkFBZ0Isa0JBQWtCLENBQ2hDLENBQUMsU0FBUyxNQUFNLEVBQ2hCLENBQUMsU0FBUztLQUNQLENBQUMsSUFBSSxDQUFDLEdBQUc7UUFDUjs7V0FFRztRQUNILE1BQU0sRUFBRSxNQUFNLENBQUM7S0FDaEI7Q0FDRixFQUNELEdBQUcsRUFBRSxDQUFDLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxNQUFNLEVBQUUsTUFBTSxRQUlsQztBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLGlCQUFpQixDQUMvQixDQUFDLFNBQVMsTUFBTSxFQUNoQixDQUFDLFNBQVM7S0FDUCxDQUFDLElBQUksQ0FBQyxHQUFHO1FBQ1I7O1dBRUc7UUFDSCxNQUFNLEVBQUUsTUFBTSxDQUFDO0tBQ2hCLEVBQUU7Q0FDSixFQUNELEdBQUcsRUFBRSxDQUFDLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxNQUFNLEVBQUUsTUFBTSxRQU9sQztBQUVEOzs7Ozs7R0FNRztBQUNILHdCQUFnQixpQkFBaUIsQ0FBQyxDQUFDLEVBQ2pDLFFBQVEsRUFBRSxDQUFDLEVBQUUsRUFDYixXQUFXLEVBQUUsQ0FBQyxFQUFFLEVBQ2hCLE9BQU8sRUFBRSxNQUFNLEVBQUUsRUFDakIsT0FBTyxFQUFFLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxLQUFLLE9BQU8sR0FDL0IsSUFBSSxDQW1CTjtBQUVELHdCQUFnQixpQkFBaUIsQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLE9BQU8sRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssT0FBTyxRQVMzRTtBQUVEOzs7R0FHRztBQUNILHdCQUFnQixPQUFPLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsR0FBRyxJQUFJLENBT3pDIn0=

package/dest/array/array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/array/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAEnD,YAAY,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAElD;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,SAAI,YAM1C;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM,SAAI,eAEzF;AAED;;;;;;GAMG;AACH,wBAAsB,cAAc,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,SAAI,wBAM7G;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,CAAC,SAAS,MAAM,EAChB,CAAC,SAAS;KACP,CAAC,IAAI,CAAC,GAAG;QACR;;WAEG;QACH,MAAM,EAAE,MAAM,CAAC;KAChB;CACF,EACD,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,QAIlC;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,SAAS,MAAM,EAChB,CAAC,SAAS;KACP,CAAC,IAAI,CAAC,GAAG;QACR;;WAEG;QACH,MAAM,EAAE,MAAM,CAAC;KAChB,EAAE;CACJ,EACD,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,QAOlC;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EACjC,QAAQ,EAAE,CAAC,EAAE,EACb,WAAW,EAAE,CAAC,EAAE,EAChB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAC/B,IAAI,CAmBN;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,QAS3E;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,IAAI,CAOzC"}

package/dest/array/array.js

@@ -0,0 +1,100 @@
+/**
+ * Create an array over an integer range.
+ * @param n - The number of integers.
+ * @param offset - The starting number.
+ * @returns The array of numbers.
+ */ export function range(n, offset = 0) {
+    const ret = [];
+    for(let i = 0; i < n; i++){
+        ret.push(offset + i);
+    }
+    return ret;
+}
+/**
+ * Create an array over an integer range, filled with a function 'fn'.
+ * This is used over e.g. lodash because it resolved to a tuple type, needed for our fixed array type safety.
+ * @param n - The number of integers.
+ * @param fn - The generator function.
+ * @returns The array of numbers.
+ */ export function makeTuple(length, fn, offset = 0) {
+    return Array.from({
+        length
+    }, (_, i)=>fn(i + offset));
+}
+/**
+ * Create an array over an integer range, filled with a function 'fn'.
+ * This is used over e.g. lodash because it resolved to a tuple type, needed for our fixed array type safety.
+ * @param n - The number of integers.
+ * @param fn - The generator function.
+ * @returns The array of numbers.
+ */ export async function makeTupleAsync(length, fn, offset = 0) {
+    return await Promise.all(Array(length).fill(0).map(async (_, i)=>await fn(i + offset)));
+}
+/**
+ * Assert a member of an object is a certain length.
+ * @param obj - An object.
+ * @param member - A member string.
+ * @param length - The length.
+ */ export function assertMemberLength(obj, member, length) {
+    if (obj[member].length !== length) {
+        throw new Error(`Expected ${member} to have length ${length} but was ${obj[member].length}`);
+    }
+}
+/**
+ * Assert all subarrays in a member of an object are a certain length.
+ * @param obj - An object.
+ * @param member - A member string.
+ * @param length - The expected length for each subarray.
+ */ export function assertItemsLength(obj, member, length) {
+    const arrays = obj[member];
+    for(let i = 0; i < arrays.length; i++){
+        if (arrays[i].length !== length) {
+            throw new Error(`Expected ${member}[${i}] to have length ${length} but was ${arrays[i].length}`);
+        }
+    }
+}
+/**
+ * Checks that the permutation is valid. Throws an error if it is not.
+ * @param original - The original array.
+ * @param permutation - The array which is allegedly a permutation of the original.
+ * @param indexes - The indices of the original array which the permutation should map to.
+ * @param isEqual - A function to compare the elements of the original and permutation arrays.
+ */ export function assertPermutation(original, permutation, indexes, isEqual) {
+    if (original.length !== permutation.length || original.length !== indexes.length) {
+        throw new Error(`Invalid lengths: ${original.length}, ${permutation.length}, ${indexes.length}`);
+    }
+    const seenValue = new Set();
+    for(let i = 0; i < indexes.length; i++){
+        const index = indexes[i];
+        const permutedValue = permutation[i];
+        const originalValueAtIndex = original[index];
+        if (!isEqual(permutedValue, originalValueAtIndex)) {
+            throw new Error(`Invalid permutation at index ${index}: ${permutedValue} !== ${originalValueAtIndex}`);
+        }
+        if (seenValue.has(index)) {
+            throw new Error(`Duplicate index in permutation: ${index}`);
+        }
+        seenValue.add(index);
+    }
+}
+export function assertRightPadded(arr, isEmpty) {
+    let seenEmpty = false;
+    for(let i = 0; i < arr.length; i++){
+        if (isEmpty(arr[i])) {
+            seenEmpty = true;
+        } else if (seenEmpty) {
+            throw new Error(`Non-empty element at index [${i}] after empty element`);
+        }
+    }
+}
+/**
+ * Shuffles an array in-place using the Fisher-Yates algorith,
+ * @param arr - The array to shuffle
+ */ export function shuffle(arr) {
+    for(let i = arr.length - 1; i > 0; i--){
+        const j = Math.random() * (i + 1) | 0;
+        const temp = arr[i];
+        arr[i] = arr[j];
+        arr[j] = temp;
+    }
+}

package/dest/array/index.d.ts

@@ -0,0 +1,3 @@
+export * from './array.js';
+export * from './sorted_array.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9hcnJheS9pbmRleC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxjQUFjLFlBQVksQ0FBQztBQUMzQixjQUFjLG1CQUFtQixDQUFDIn0=

package/dest/array/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/array/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,mBAAmB,CAAC"}

package/dest/array/index.js

@@ -0,0 +1,2 @@
+export * from './array.js';
+export * from './sorted_array.js';

package/dest/array/sorted_array.d.ts

@@ -0,0 +1,15 @@
+type Cmp<T> = (a: T, b: T) => -1 | 0 | 1;
+export declare function dedupeSortedArray<T>(arr: T[], cmp: Cmp<T>): void;
+export declare function insertIntoSortedArray<T>(arr: T[], item: T, cmp: Cmp<T>, allowDuplicates?: boolean): boolean;
+/**
+ * Finds the index where needle would be inserted to maintain sorted order.
+ * Returns the count of elements less than or equal to needle.
+ */
+export declare function findInsertionIndexInSortedArray<T, N>(values: T[], needle: N, cmp: (a: T, b: N) => number): number;
+export declare function findIndexInSortedArray<T, N>(values: T[], needle: N, cmp: (a: T, b: N) => number): number;
+export declare function findInSortedArray<T, N>(values: T[], needle: N, cmp: (a: T, b: N) => number): T | undefined;
+export declare function removeAnyOf<T, N>(arr: T[], vals: N[], cmp: (a: T, b: N) => -1 | 0 | 1): void;
+export declare function removeFromSortedArray<T, N>(arr: T[], val: N, cmp: (a: T, b: N) => -1 | 0 | 1): void;
+export declare function merge<T>(arr: T[], toInsert: T[], cmp: (a: T, b: T) => -1 | 0 | 1): void;
+export {};
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoic29ydGVkX2FycmF5LmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvYXJyYXkvc29ydGVkX2FycmF5LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLEtBQUssR0FBRyxDQUFDLENBQUMsSUFBSSxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUMsS0FBSyxDQUFDLENBQUMsR0FBRyxDQUFDLEdBQUcsQ0FBQyxDQUFDO0FBRXpDLHdCQUFnQixpQkFBaUIsQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLEdBQUcsRUFBRSxHQUFHLENBQUMsQ0FBQyxDQUFDLEdBQUcsSUFBSSxDQWtCaEU7QUFFRCx3QkFBZ0IscUJBQXFCLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsRUFBRSxJQUFJLEVBQUUsQ0FBQyxFQUFFLEdBQUcsRUFBRSxHQUFHLENBQUMsQ0FBQyxDQUFDLEVBQUUsZUFBZSxVQUFPLEdBQUcsT0FBTyxDQVl4RztBQUVEOzs7R0FHRztBQUNILHdCQUFnQiwrQkFBK0IsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxFQUFFLE1BQU0sRUFBRSxDQUFDLEVBQUUsRUFBRSxNQUFNLEVBQUUsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUMsS0FBSyxNQUFNLEdBQUcsTUFBTSxDQWdCakg7QUFFRCx3QkFBZ0Isc0JBQXNCLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxNQUFNLEVBQUUsQ0FBQyxFQUFFLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEtBQUssTUFBTSxHQUFHLE1BQU0sQ0FvQnhHO0FBRUQsd0JBQWdCLGlCQUFpQixDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxFQUFFLE1BQU0sRUFBRSxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxLQUFLLE1BQU0sR0FBRyxDQUFDLEdBQUcsU0FBUyxDQUcxRztBQUVELHdCQUFnQixXQUFXLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQUUsSUFBSSxFQUFFLENBQUMsRUFBRSxFQUFFLEdBQUcsRUFBRSxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUMsS0FBSyxDQUFDLENBQUMsR0FBRyxDQUFDLEdBQUcsQ0FBQyxHQUFHLElBQUksQ0FzQjVGO0FBRUQsd0JBQWdCLHFCQUFxQixDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxLQUFLLENBQUMsQ0FBQyxHQUFHLENBQUMsR0FBRyxDQUFDLFFBSzVGO0FBRUQsd0JBQWdCLEtBQUssQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLFFBQVEsRUFBRSxDQUFDLEVBQUUsRUFBRSxHQUFHLEVBQUUsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEtBQUssQ0FBQyxDQUFDLEdBQUcsQ0FBQyxHQUFHLENBQUMsR0FBRyxJQUFJLENBcUJ2RiJ9

package/dest/array/sorted_array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sorted_array.d.ts","sourceRoot":"","sources":["../../src/array/sorted_array.ts"],"names":[],"mappings":"AAAA,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAEzC,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAkBhE;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,eAAe,UAAO,GAAG,OAAO,CAYxG;AAED;;;GAGG;AACH,wBAAgB,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAgBjH;AAED,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAoBxG;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,SAAS,CAG1G;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAsB5F;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,QAK5F;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAqBvF"}

package/dest/array/sorted_array.js

@@ -0,0 +1,109 @@
+export function dedupeSortedArray(arr, cmp) {
+    for(let i = 0; i < arr.length; i++){
+        let j = i + 1;
+        for(; j < arr.length; j++){
+            const res = cmp(arr[i], arr[j]);
+            if (res === 0) {
+                continue;
+            } else if (res < 0) {
+                break;
+            } else {
+                throw new Error('Array not sorted');
+            }
+        }
+        if (j - i > 1) {
+            arr.splice(i + 1, j - i - 1);
+        }
+    }
+}
+export function insertIntoSortedArray(arr, item, cmp, allowDuplicates = true) {
+    const index = findInsertionIndexInSortedArray(arr, item, cmp);
+    if (!allowDuplicates) {
+        // Check element before insertion point (upper bound returns index after equal elements)
+        if (index > 0 && cmp(arr[index - 1], item) === 0) {
+            return false;
+        }
+    }
+    arr.splice(index, 0, item);
+    return true;
+}
+/**
+ * Finds the index where needle would be inserted to maintain sorted order.
+ * Returns the count of elements less than or equal to needle.
+ */ export function findInsertionIndexInSortedArray(values, needle, cmp) {
+    let start = 0;
+    let end = values.length;
+    while(start < end){
+        const mid = start + ((end - start) / 2 | 0);
+        const comparison = cmp(values[mid], needle);
+        if (comparison <= 0) {
+            start = mid + 1;
+        } else {
+            end = mid;
+        }
+    }
+    return start;
+}
+export function findIndexInSortedArray(values, needle, cmp) {
+    let start = 0;
+    let end = values.length - 1;
+    while(start <= end){
+        const mid = start + ((end - start) / 2 | 0);
+        const comparison = cmp(values[mid], needle);
+        if (comparison === 0) {
+            return mid;
+        }
+        if (comparison > 0) {
+            end = mid - 1;
+        } else {
+            start = mid + 1;
+        }
+    }
+    return -1;
+}
+export function findInSortedArray(values, needle, cmp) {
+    const idx = findIndexInSortedArray(values, needle, cmp);
+    return idx > -1 ? values[idx] : undefined;
+}
+export function removeAnyOf(arr, vals, cmp) {
+    let writeIdx = 0;
+    let readIdx = 0;
+    let valIdx = 0;
+    while(readIdx < arr.length && valIdx < vals.length){
+        const comparison = cmp(arr[readIdx], vals[valIdx]);
+        if (comparison < 0) {
+            arr[writeIdx++] = arr[readIdx++];
+        } else if (comparison > 0) {
+            valIdx++;
+        } else {
+            readIdx++;
+        }
+    }
+    while(readIdx < arr.length){
+        arr[writeIdx++] = arr[readIdx++];
+    }
+    arr.length = writeIdx;
+}
+export function removeFromSortedArray(arr, val, cmp) {
+    const idx = findIndexInSortedArray(arr, val, cmp);
+    if (idx > -1) {
+        arr.splice(idx, 1);
+    }
+}
+export function merge(arr, toInsert, cmp) {
+    const result = new Array(arr.length + toInsert.length);
+    let i = 0, j = 0, k = 0;
+    while(i < arr.length && j < toInsert.length){
+        result[k++] = cmp(arr[i], toInsert[j]) <= 0 ? arr[i++] : toInsert[j++];
+    }
+    while(i < arr.length){
+        result[k++] = arr[i++];
+    }
+    while(j < toInsert.length){
+        result[k++] = toInsert[j++];
+    }
+    for(i = 0; i < result.length; i++){
+        arr[i] = result[i];
+    }
+    arr.length = result.length;
+}

package/dest/async-map/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Maps an array of elements by applying an asynchronous function to each element in sequence,
+ * and returns a new array with the results. The function receives each element of the array
+ * and its index as arguments, and should return a Promise that resolves to the desired value.
+ *
+ * @typeParam T - The original array element type.
+ * @typeParam U - The resulting array element type.
+ * @param arr - The array to map.
+ * @param fn - The async function to apply on each element of the array.
+ * @returns A Promise that resolves to a new array containing the mapped values.
+ */
+export declare function asyncMap<T, U>(arr: T[], fn: (e: T, i: number) => Promise<U>): Promise<U[]>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9hc3luYy1tYXAvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUE7Ozs7Ozs7Ozs7R0FVRztBQUNILHdCQUFzQixRQUFRLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQUUsRUFBRSxFQUFFLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQUUsTUFBTSxLQUFLLE9BQU8sQ0FBQyxDQUFDLENBQUMsR0FBRyxPQUFPLENBQUMsQ0FBQyxFQUFFLENBQUMsQ0FNaEcifQ==

package/dest/async-map/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/async-map/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAsB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAMhG"}

package/dest/async-map/index.js

@@ -0,0 +1,17 @@
+/**
+ * Maps an array of elements by applying an asynchronous function to each element in sequence,
+ * and returns a new array with the results. The function receives each element of the array
+ * and its index as arguments, and should return a Promise that resolves to the desired value.
+ *
+ * @typeParam T - The original array element type.
+ * @typeParam U - The resulting array element type.
+ * @param arr - The array to map.
+ * @param fn - The async function to apply on each element of the array.
+ * @returns A Promise that resolves to a new array containing the mapped values.
+ */ export async function asyncMap(arr, fn) {
+    const results = [];
+    for(let i = 0; i < arr.length; ++i){
+        results.push(await fn(arr[i], i));
+    }
+    return results;
+}

package/dest/async-pool/index.d.ts

@@ -0,0 +1,3 @@
+/** Executes the given async function over the iterable, up to a determined number of promises in parallel. */
+export declare function asyncPool<T, R>(poolLimit: number, iterable: T[], iteratorFn: (item: T, iterable: T[]) => Promise<R>): Promise<Awaited<R>[]>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9hc3luYy1wb29sL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQTJCQSw4R0FBOEc7QUFDOUcsd0JBQWdCLFNBQVMsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxFQUFFLFNBQVMsRUFBRSxNQUFNLEVBQUUsUUFBUSxFQUFFLENBQUMsRUFBRSxFQUFFLFVBQVUsRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEVBQUUsUUFBUSxFQUFFLENBQUMsRUFBRSxLQUFLLE9BQU8sQ0FBQyxDQUFDLENBQUMseUJBc0JuSCJ9

package/dest/async-pool/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/async-pool/index.ts"],"names":[],"mappings":"AA2BA,8GAA8G;AAC9G,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,yBAsBnH"}

package/dest/async-pool/index.js

@@ -0,0 +1,48 @@
+/*
+ * Adapted from https://github.com/rxaviers/async-pool/blob/1.x/lib/es6.js
+ *
+ * Copyright (c) 2017 Rafael Xavier de Souza http://rafael.xavier.blog.br
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use,
+ * copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following
+ * conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+ * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+ * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ */ /** Executes the given async function over the iterable, up to a determined number of promises in parallel. */ export function asyncPool(poolLimit, iterable, iteratorFn) {
+    let i = 0;
+    const ret = [];
+    // eslint-disable-next-line aztec-custom/no-non-primitive-in-collections
+    const executing = new Set();
+    const enqueue = ()=>{
+        if (i === iterable.length) {
+            return Promise.resolve();
+        }
+        const item = iterable[i++];
+        const p = Promise.resolve().then(()=>iteratorFn(item, iterable));
+        ret.push(p);
+        executing.add(p);
+        const clean = ()=>executing.delete(p);
+        p.then(clean).catch(clean);
+        let r = Promise.resolve();
+        if (executing.size >= poolLimit) {
+            r = Promise.race(executing);
+        }
+        return r.then(()=>enqueue());
+    };
+    return enqueue().then(()=>Promise.all(ret));
+}

package/dest/bigint/index.d.ts

@@ -0,0 +1,7 @@
+/** Returns minimum value across a list of bigints. */
+export declare function minBigint(...values: bigint[]): bigint;
+/** Returns maximim value across a list of bigints. */
+export declare function maxBigint(...values: bigint[]): bigint;
+/** Sums an array of bigints */
+export declare function sumBigint(values: bigint[]): bigint;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9iaWdpbnQvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsc0RBQXNEO0FBQ3RELHdCQUFnQixTQUFTLENBQUMsR0FBRyxNQUFNLEVBQUUsTUFBTSxFQUFFLEdBQUcsTUFBTSxDQUtyRDtBQUVELHNEQUFzRDtBQUN0RCx3QkFBZ0IsU0FBUyxDQUFDLEdBQUcsTUFBTSxFQUFFLE1BQU0sRUFBRSxHQUFHLE1BQU0sQ0FLckQ7QUFFRCwrQkFBK0I7QUFDL0Isd0JBQWdCLFNBQVMsQ0FBQyxNQUFNLEVBQUUsTUFBTSxFQUFFLEdBQUcsTUFBTSxDQUVsRCJ9

package/dest/bigint/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/bigint/index.ts"],"names":[],"mappings":"AAAA,sDAAsD;AACtD,wBAAgB,SAAS,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAKrD;AAED,sDAAsD;AACtD,wBAAgB,SAAS,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAKrD;AAED,+BAA+B;AAC/B,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAElD"}

package/dest/bigint/index.js

@@ -0,0 +1,15 @@
+/** Returns minimum value across a list of bigints. */ export function minBigint(...values) {
+    if (values.length === 0) {
+        throw new Error('Cannot get min of empty array');
+    }
+    return values.reduce((min, value)=>value < min ? value : min, values[0]);
+}
+/** Returns maximim value across a list of bigints. */ export function maxBigint(...values) {
+    if (values.length === 0) {
+        throw new Error('Cannot get max of empty array');
+    }
+    return values.reduce((max, value)=>value > max ? value : max, values[0]);
+}
+/** Sums an array of bigints */ export function sumBigint(values) {
+    return values.reduce((sum, value)=>sum + value, 0n);
+}

package/dest/bigint-buffer/index.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Convert a little-endian buffer into a BigInt.
+ * @param buf - The little-endian buffer to convert.
+ * @returns A BigInt with the little-endian representation of buf.
+ */
+export declare function toBigIntLE(buf: Buffer): bigint;
+/**
+ * Convert a big-endian buffer into a BigInt.
+ * @param buf - The big-endian buffer to convert.
+ * @returns A BigInt with the big-endian representation of buf.
+ */
+export declare function toBigIntBE(buf: Buffer): bigint;
+/**
+ * Convert a BigInt to a little-endian buffer.
+ * @param num - The BigInt to convert.
+ * @param width - The number of bytes that the resulting buffer should be.
+ * @returns A little-endian buffer representation of num.
+ */
+export declare function toBufferLE(num: bigint, width: number): Buffer;
+/**
+ * Convert a BigInt to a big-endian buffer.
+ * @param num - The BigInt to convert.
+ * @param width - The number of bytes that the resulting buffer should be.
+ * @returns A big-endian buffer representation of num.
+ */
+export declare function toBufferBE(num: bigint, width: number): Buffer;
+/**
+ * Converts a BigInt to its hex representation.
+ * @param num - The BigInt to convert.
+ * @param padTo32 - Whether to pad the resulting string to 32 bytes.
+ * @returns An even-length 0x-prefixed string.
+ */
+export declare function toHex(num: bigint, padTo32?: boolean): `0x${string}`;
+/**
+ * Converts a hex string to a buffer. Throws if input is not a valid hex string.
+ * @param value - The hex string to convert. May be 0x prefixed or not.
+ * @returns A buffer.
+ */
+export declare function fromHex(value: string): Buffer;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9iaWdpbnQtYnVmZmVyL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBOzs7O0dBSUc7QUFDSCx3QkFBZ0IsVUFBVSxDQUFDLEdBQUcsRUFBRSxNQUFNLEdBQUcsTUFBTSxDQVE5QztBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsVUFBVSxDQUFDLEdBQUcsRUFBRSxNQUFNLEdBQUcsTUFBTSxDQU05QztBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLFVBQVUsQ0FBQyxHQUFHLEVBQUUsTUFBTSxFQUFFLEtBQUssRUFBRSxNQUFNLEdBQUcsTUFBTSxDQVE3RDtBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLFVBQVUsQ0FBQyxHQUFHLEVBQUUsTUFBTSxFQUFFLEtBQUssRUFBRSxNQUFNLEdBQUcsTUFBTSxDQWU3RDtBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLEtBQUssQ0FBQyxHQUFHLEVBQUUsTUFBTSxFQUFFLE9BQU8sVUFBUSxHQUFHLEtBQUssTUFBTSxFQUFFLENBS2pFO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixPQUFPLENBQUMsS0FBSyxFQUFFLE1BQU0sR0FBRyxNQUFNLENBTTdDIn0=

package/dest/bigint-buffer/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/bigint-buffer/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAQ9C;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAM9C;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAQ7D;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAe7D;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,UAAQ,GAAG,KAAK,MAAM,EAAE,CAKjE;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAM7C"}

package/dest/bigint-buffer/index.js

@@ -0,0 +1,81 @@
+/**
+ * Convert a little-endian buffer into a BigInt.
+ * @param buf - The little-endian buffer to convert.
+ * @returns A BigInt with the little-endian representation of buf.
+ */ export function toBigIntLE(buf) {
+    const reversed = Buffer.from(buf);
+    reversed.reverse();
+    const hex = reversed.toString('hex');
+    if (hex.length === 0) {
+        return BigInt(0);
+    }
+    return BigInt(`0x${hex}`);
+}
+/**
+ * Convert a big-endian buffer into a BigInt.
+ * @param buf - The big-endian buffer to convert.
+ * @returns A BigInt with the big-endian representation of buf.
+ */ export function toBigIntBE(buf) {
+    const hex = buf.toString('hex');
+    if (hex.length === 0) {
+        return BigInt(0);
+    }
+    return BigInt(`0x${hex}`);
+}
+/**
+ * Convert a BigInt to a little-endian buffer.
+ * @param num - The BigInt to convert.
+ * @param width - The number of bytes that the resulting buffer should be.
+ * @returns A little-endian buffer representation of num.
+ */ export function toBufferLE(num, width) {
+    if (num < BigInt(0)) {
+        throw new Error(`Cannot convert negative bigint ${num.toString()} to buffer with toBufferLE.`);
+    }
+    const hex = num.toString(16);
+    const buffer = Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');
+    buffer.reverse();
+    return buffer;
+}
+/**
+ * Convert a BigInt to a big-endian buffer.
+ * @param num - The BigInt to convert.
+ * @param width - The number of bytes that the resulting buffer should be.
+ * @returns A big-endian buffer representation of num.
+ */ export function toBufferBE(num, width) {
+    if (num < 0n) {
+        throw new Error(`Cannot convert negative bigint ${num.toString()} to buffer with toBufferBE.`);
+    }
+    // The values serialized in the hot paths are overwhelmingly zero (field elements are mostly
+    // zero-padding in protocol structs), and the hex round-trip is wasteful for them.
+    if (num === 0n) {
+        return Buffer.alloc(width);
+    }
+    const hex = num.toString(16);
+    const buffer = Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');
+    if (buffer.length > width) {
+        throw new Error(`Number ${num.toString(16)} does not fit in ${width}`);
+    }
+    return buffer;
+}
+/**
+ * Converts a BigInt to its hex representation.
+ * @param num - The BigInt to convert.
+ * @param padTo32 - Whether to pad the resulting string to 32 bytes.
+ * @returns An even-length 0x-prefixed string.
+ */ export function toHex(num, padTo32 = false) {
+    const str = num.toString(16);
+    const targetLen = str.length % 2 === 0 ? str.length : str.length + 1;
+    const paddedStr = str.padStart(padTo32 ? 64 : targetLen, '0');
+    return `0x${paddedStr}`;
+}
+/**
+ * Converts a hex string to a buffer. Throws if input is not a valid hex string.
+ * @param value - The hex string to convert. May be 0x prefixed or not.
+ * @returns A buffer.
+ */ export function fromHex(value) {
+    const hexRegex = /^(0x)?[0-9a-fA-F]*$/;
+    if (!hexRegex.test(value) || value.length % 2 !== 0) {
+        throw new Error(`Invalid hex string: ${value}`);
+    }
+    return Buffer.from(value.replace(/^0x/i, ''), 'hex');
+}

package/dest/branded-types/block_number.d.ts

@@ -0,0 +1,56 @@
+import { z } from 'zod';
+import type { CheckpointNumber } from './checkpoint_number.js';
+import type { Branded } from './types.js';
+/**
+ * A branded type representing an Aztec (L2) block number.
+ * Block numbers are sequential identifiers for blocks in the Aztec rollup chain.
+ *
+ * This is a nominal type backed by a number, but TypeScript will treat it as
+ * incompatible with plain numbers and other branded numeric types (like EpochNumber, SlotNumber, etc.).
+ *
+ * Note: This type should ONLY be used for Aztec L2 block numbers, NOT for Ethereum L1 block numbers.
+ *
+ * @example
+ * ```ts
+ * const blockNumber = BlockNumber(100);
+ * const plainNumber: number = blockNumber; // OK - BlockNumber is assignable to number
+ * const blockFromNumber: BlockNumber = 100;  // ERROR - number is not assignable to BlockNumber
+ * ```
+ */
+export type BlockNumber = Branded<number, 'BlockNumber'>;
+/**
+ * Creates a BlockNumber from a number.
+ * @param value - The block number (must be a non-negative integer)
+ * @returns The branded BlockNumber value
+ * @throws If the value is negative or not an integer
+ */
+export declare function BlockNumber(value: number): BlockNumber;
+export declare namespace BlockNumber {
+    var fromBigInt: (value: bigint) => BlockNumber;
+}
+export declare namespace BlockNumber {
+    var fromString: (value: string) => BlockNumber;
+}
+export declare namespace BlockNumber {
+    var fromCheckpointNumber: (value: CheckpointNumber) => BlockNumber;
+}
+export declare namespace BlockNumber {
+    var isValid: (value: unknown) => value is BlockNumber;
+}
+export declare namespace BlockNumber {
+    var add: (bn: BlockNumber, increment: number) => BlockNumber;
+}
+export declare namespace BlockNumber {
+    var ZERO: BlockNumber;
+}
+/**
+ * Zod schema for parsing and validating BlockNumber values.
+ * Accepts numbers, bigints, or strings and coerces them to BlockNumber.
+ */
+export declare const BlockNumberSchema: z.ZodPipe<z.ZodUnion<readonly [z.ZodNumber, z.ZodPipe<z.ZodBigInt, z.ZodTransform<number, bigint>>, z.ZodPipe<z.ZodString, z.ZodTransform<number, string>>]>, z.ZodTransform<BlockNumber, number>>;
+/**
+ * Zod schema for parsing and validating BlockNumber values that are strictly positive.
+ * Accepts numbers, bigints, or strings and coerces them to BlockNumber.
+ */
+export declare const BlockNumberPositiveSchema: z.ZodPipe<z.ZodUnion<readonly [z.ZodNumber, z.ZodPipe<z.ZodBigInt, z.ZodTransform<number, bigint>>, z.ZodPipe<z.ZodString, z.ZodTransform<number, string>>]>, z.ZodTransform<BlockNumber, number>>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYmxvY2tfbnVtYmVyLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvYnJhbmRlZC10eXBlcy9ibG9ja19udW1iZXIudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLENBQUMsRUFBRSxNQUFNLEtBQUssQ0FBQztBQUV4QixPQUFPLEtBQUssRUFBRSxnQkFBZ0IsRUFBRSxNQUFNLHdCQUF3QixDQUFDO0FBQy9ELE9BQU8sS0FBSyxFQUFFLE9BQU8sRUFBRSxNQUFNLFlBQVksQ0FBQztBQUUxQzs7Ozs7Ozs7Ozs7Ozs7O0dBZUc7QUFDSCxNQUFNLE1BQU0sV0FBVyxHQUFHLE9BQU8sQ0FBQyxNQUFNLEVBQUUsYUFBYSxDQUFDLENBQUM7QUFFekQ7Ozs7O0dBS0c7QUFDSCx3QkFBZ0IsV0FBVyxDQUFDLEtBQUssRUFBRSxNQUFNLEdBQUcsV0FBVyxDQVF0RDs7Ozs7Ozs7Ozs7Ozs7Ozs7OztBQXVGRDs7O0dBR0c7QUFDSCxlQUFPLE1BQU0saUJBQWlCLG9NQUEyQixDQUFDO0FBRTFEOzs7R0FHRztBQUNILGVBQU8sTUFBTSx5QkFBeUIsb01BQTJCLENBQUMifQ==

package/dest/branded-types/block_number.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"block_number.d.ts","sourceRoot":"","sources":["../../src/branded-types/block_number.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;AAEzD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,CAQtD;;;;;;;;;;;;;;;;;;;AAuFD;;;GAGG;AACH,eAAO,MAAM,iBAAiB,oMAA2B,CAAC;AAE1D;;;GAGG;AACH,eAAO,MAAM,yBAAyB,oMAA2B,CAAC"}