@warptoad/skinny-fat-imt-js 0.0.2

package/dist/Trees.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Trees.d.ts","sourceRoot":"","sources":["../src/Trees.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,KAAK,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AAErE,OAAO,EAAsB,KAAK,GAAG,EAAE,KAAK,QAAQ,EAAE,KAAK,OAAO,EAAE,KAAK,qBAAqB,EAAE,KAAK,GAAG,EAAY,KAAK,YAAY,EAAqB,MAAM,MAAM,CAAC;AAIvK,OAAO,EAA0E,KAAK,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAQvI,OAAO,EACH,gBAAgB,EAChB,cAAc,EACd,aAAa,EACb,WAAW,EACX,aAAa,EAKhB,MAAM,WAAW,CAAC;AAGnB,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AAEvF,MAAM,MAAM,WAAW,GAAG;IACtB,OAAO,EAAE,OAAO,CAAA;IAChB,GAAG,EAAE,GAAG,CAAA;IACR,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;CACzD,CAAA;AAED,KAAK,kBAAkB,GAAG,SAAS;IAC/B,GAAG,OAAO,gBAAgB;IAC1B,GAAG,OAAO,aAAa;CAC1B,CAAC;AAEF,KAAK,gBAAgB,GAAG,SAAS;IAC7B,GAAG,OAAO,cAAc;IACxB,GAAG,OAAO,WAAW;IACrB,GAAG,OAAO,aAAa;CAC1B,CAAA;AAED,KAAK,WAAW,GAAG,SAAS,CAAC,GAAG,kBAAkB,EAAE,GAAG,gBAAgB,CAAC,CAAA;AAExE;;;;GAIG;AACH,KAAK,aAAa,CAAC,KAAK,SAAS,MAAM,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,CAAC,CAAC;AAGpG,eAAO,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAGD,CAAC;AAE/B,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAID,CAAC;AAE7B,MAAM,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;AAChF,MAAM,MAAM,uBAAuB,GAAG,qBAAqB,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;AAC9F,MAAM,MAAM,qBAAqB,GAAG,qBAAqB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;AAE1F,MAAM,MAAM,2BAA2B,GAAG,qBAAqB,CAAC,OAAO,cAAc,EAAE,YAAY,CAAC,CAAC;AACrG,MAAM,MAAM,6BAA6B,GAAG,qBAAqB,CAAC,OAAO,gBAAgB,EAAE,YAAY,CAAC,CAAC;AACzG,MAAM,MAAM,wBAAwB,GAAG,qBAAqB,CAAC,OAAO,WAAW,EAAE,YAAY,CAAC,CAAC;AAC/F,MAAM,MAAM,0BAA0B,GAAG,qBAAqB,CAAC,OAAO,aAAa,EAAE,YAAY,CAAC,CAAC;AAEnG,eAAO,MAAM,UAAU;;;;;CAKiB,CAAC;AAYzC,aAAK,SAAS;IACV,OAAO,IAAA;IACP,WAAW,IAAA;IACX,SAAS,IAAA;IACT,cAAc,IAAA;IACd,YAAY,IAAA;IACZ,YAAY,IAAA;CACf;AAED,eAAO,MAAM,wBAAwB,EAAE,mBAAqE,CAAA;AAE5G,MAAM,MAAM,UAAU,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,OAAO,CAAA;CAAE,CAAA;AAEjH;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,mBAAmB,GAAG,OAAO,CAAC,MAAM,CAAC,CAM9F;AAED,qBAAa,KAAK;IACd,OAAO,CAAC,KAAK,CAAoC;IACjD,+FAA+F;IAC/F,OAAO,CAAC,KAAK,CAA+D;IAErE,eAAe,EAAE,OAAO,CAAC;IACzB,QAAQ,EAAG,gBAAgB,CAAC;IAC5B,QAAQ,EAAE,mBAAmB,CAAC;IACrC,OAAO,CAAC,YAAY,CAAe;gBAEvB,eAAe,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,sBAA2B;IAMzF,IAAI,CAAC,OAAO,GAAE,MAAM,EAAE,GAAG,SAAqB,EAAE,EAAE,YAAmB,EAAE,oBAA2B,EAAE,UAAU,EAAE,cAAsB,EAAE,gBAAwB,EAAE,cAAc,EAAE,aAAa,EAAE,gBAAuB,EAAE,WAAW,EAAE,GAAE;QAAE,YAAY,CAAC,EAAE,OAAO,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,oBAAoB,CAAC,EAAE,OAAO,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,cAAc,CAAC,EAAE,MAAM,CAAC;QAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;QAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAAC,cAAc,CAAC,EAAE,OAAO,CAAC;QAAC,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;KAAO;;;IA+Bxe;;;;;;;;OAQG;IACG,gBAAgB,CAClB,OAAO,GAAE,MAAM,EAAE,GAAG,SAAqB,EACzC,EAAE,SAAiB,EAAE,oBAA2B,EAAE,WAAW,EAAE,GAAE;QAAE,oBAAoB,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAO,GACnJ,OAAO,CAAC;QAAE,CAAC,MAAM,EAAE,GAAG,GAAG,UAAU,CAAA;KAAE,CAAC;IAoGzC;;;;;OAKG;YACW,iBAAiB;IAWzB,cAAc,CAAC,OAAO,GAAE,MAAM,EAAE,GAAG,SAAqB,EAAE,EAAC,WAAW,EAAE,oBAA2B,EAAE,UAAU,EAAE,SAAiB,EAAE,cAAc,EAAE,aAAa,EAAE,gBAAuB,EAAE,GAAE;QAAC,WAAW,CAAC,EAAC,MAAM,CAAC;QAAC,oBAAoB,CAAC,EAAE,OAAO,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;QAAC,cAAc,CAAC,EAAE,OAAO,CAAC;QAAC,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;KAAO;;;IAoK7X,WAAW,IAAI,OAAO,CAAC,gBAAgB,CAAC;IAqB9C,mBAAmB,CAAC,OAAO,EAAE,GAAG,EAAE,GAAG,GAAG;IAgBxC,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE;IAK9B,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM;IAIxC,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAwBxG,kBAAkB,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAwBpE,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAehE,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM;CAY9C;AAED,wBAAsB,YAAY,CAC9B,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,WAAW,sBAwCxB;AAED,KAAK,SAAS,GAAG;IACb,eAAe,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/C,SAAS,EAAE;QAAE,CAAC,MAAM,EAAE,GAAG,GAAG,UAAU,CAAA;KAAE,CAAC;IACzC,SAAS,EAAE;QAAE,CAAC,MAAM,EAAE,GAAG,GAAG;YAAE,YAAY,EAAE,MAAM,CAAC;YAAC,IAAI,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YAAC,MAAM,EAAE,MAAM,EAAE,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAA;CAC1J,CAAA;AAED,KAAK,cAAc,GAAG,oBAAoB,CAAC,aAAa,CAAC,SAAS,GAAG,SAAS,GAAG,aAAa,GAAG,eAAe,CAAC,CAAC,CAAA;AAClH,wBAAgB,cAAc,CAC1B,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EACxC,EAAE,YAAY,EAAE,UAAU,EAAE,oBAAoB,EAAE,QAAmC,EAAE,GAAE;IAAE,QAAQ,CAAC,EAAE,mBAAmB,CAAC;IAAC,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAAC,YAAY,CAAC,EAAE,OAAO,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,kBAmGhN"}

package/dist/Trees.js

@@ -0,0 +1,611 @@
+import { LeanIMT } from "@zk-kit/lean-imt";
+import { poseidon2Hash } from "@zkpassport/poseidon2";
+import { getContract, toHex } from "viem";
+import { getInterfaceId, detectSupportedInterfaces, supportsInterface } from "./interfaceId.js";
+import { minBigInt, queryEventInChunks, queryMultiEventsInChunks } from "./eventScanning.js";
+// ABIs baked out of the hardhat artifacts by `scripts/genAbis.mjs` — `as const` tuples, so viem
+// infers exactly what the generated `*$Type["abi"]` used to give us, without the published
+// typings depending on hardhat. Regenerate with `pnpm compile`.
+//
+// The four `i*` ones are the read *interfaces*, used only to derive their ERC-165 ids (below)
+// directly from each interface — no need to diff the full contract ABIs.
+import { skinnyStorageAbi, skinnyEventAbi, fatStorageAbi, fatEventAbi, iimtEventsAbi, iSkinnyEventAbi, iSkinnyStorageAbi, iFatEventAbi, iFatStorageAbi, } from "./abis.js";
+import { DEPLOY_BLOCK, getDeploymentBlock } from "./config.js";
+export { skinnyStorageAbi, skinnyEventAbi, fatStorageAbi, fatEventAbi, iimtEventsAbi };
+export const readableStorageAbi = [
+    ...skinnyStorageAbi,
+    ...fatStorageAbi,
+];
+export const readableEventAbi = [
+    ...skinnyEventAbi,
+    ...fatEventAbi,
+    ...iimtEventsAbi,
+];
+export const ERC165_IDS = {
+    skinnyEvent: getInterfaceId(iSkinnyEventAbi),
+    skinnyStorage: getInterfaceId(iSkinnyStorageAbi, [iSkinnyEventAbi]),
+    fatEvent: getInterfaceId(iFatEventAbi),
+    fatStorage: getInterfaceId(iFatStorageAbi, [iFatEventAbi]),
+};
+var TREE_TYPE;
+(function (TREE_TYPE) {
+    TREE_TYPE[TREE_TYPE["UNKNOWN"] = 0] = "UNKNOWN";
+    TREE_TYPE[TREE_TYPE["FAT_STORAGE"] = 1] = "FAT_STORAGE";
+    TREE_TYPE[TREE_TYPE["FAT_EVENT"] = 2] = "FAT_EVENT";
+    TREE_TYPE[TREE_TYPE["SKINNY_STORAGE"] = 3] = "SKINNY_STORAGE";
+    TREE_TYPE[TREE_TYPE["SKINNY_EVENT"] = 4] = "SKINNY_EVENT";
+    TREE_TYPE[TREE_TYPE["NO_INTERFACE"] = 5] = "NO_INTERFACE";
+})(TREE_TYPE || (TREE_TYPE = {}));
+export const LeanIMTHashFuncPoseidon2 = (a, b) => poseidon2Hash([a, b]);
+/**
+ * A detached LeanIMT holding the same leaves *and* internal nodes as `tree`, so it can be grown
+ * without touching the original. Copies the nodes rather than replaying the leaves on purpose:
+ * `new LeanIMT(hash, tree.leaves)` would rehash the whole tree, which is the exact cost a caller
+ * growing a cached tree is trying to avoid. This is array copies only, no hashing.
+ */
+export function copyTree(tree, hashFunc) {
+    // `_nodes[level][index]` holds every computed node, it isn't in the public typings
+    const nodes = tree._nodes;
+    const copy = new LeanIMT(hashFunc);
+    copy._nodes = nodes.map((level) => level.slice());
+    return copy;
+}
+export class Trees {
+    trees = {};
+    /** last known size per tree, with the block it was read at. See {@link getTreeSizeStorage}. */
+    sizes = {};
+    contractAddress;
+    contract;
+    hashFunc;
+    publicClient;
+    constructor(contractAddress, client, hashFunc = LeanIMTHashFuncPoseidon2) {
+        this.contractAddress = contractAddress;
+        this.publicClient = client;
+        this.hashFunc = hashFunc;
+    }
+    async sync(treeIds = undefined, { fullNodeMode = true, attemptFastSizeMatch = true, syncToRoot, eventChunkSize = 2000n, storageChunkSize = 2000n, insertOnlyTree, autoDiscovery, hasRepeatedLeafs = true, blockNumber } = {}) {
+        let syncedTrees;
+        // fullNode mode syncs all cached trees, non fullNode mode will auto discover them, so left empty
+        const treeIdsNotSet = treeIds === undefined || treeIds.length === 0;
+        treeIds = treeIdsNotSet ? fullNodeMode ? Object.keys(this.trees).map((v) => BigInt(v)) : [] : treeIds;
+        if (autoDiscovery && fullNodeMode) {
+            throw new Error(`auto treeId discovery not supported in fullNodeMode, please provide treeIds to sync. Or turn off fullNodeMode: \`Trees.sync([],{fullNodeMode:false})\``);
+        }
+        if (fullNodeMode) {
+            syncedTrees = await this.syncTreesStorage(treeIds, { chunkSize: storageChunkSize, attemptFastSizeMatch, blockNumber });
+            // syncing to a specific root is not possible with pure storage, so we sync with storage first
+            // then syncTreesEvent will look for the root and try to trim off the leaves that happened after the root we want
+            // in tree with only inserts this will work and will allows us to get any tree that is up to 1 year old
+            // if there are updates or resets, currently syncTreesEvent will have to go down till it found all leaves
+            if (syncToRoot !== undefined) {
+                syncedTrees = await this.syncTreesEvent(treeIds, { blockNumber, attemptFastSizeMatch, syncToRoot, chunkSize: eventChunkSize, insertOnlyTree, autoDiscovery, hasRepeatedLeafs });
+            }
+        }
+        else {
+            syncedTrees = await this.syncTreesEvent(treeIds, { blockNumber, attemptFastSizeMatch, syncToRoot, chunkSize: eventChunkSize, insertOnlyTree, autoDiscovery, hasRepeatedLeafs });
+        }
+        return syncedTrees;
+    }
+    /**
+     * Reads trees straight from contract storage, at `blockNumber` (defaults to the safe block).
+     *
+     * `attemptFastSizeMatch` (default true) bets that the cached tree is still the right *prefix* of the
+     * onchain one, so only the difference in size has to be dealt with: read the leaves past the
+     * cache's end, or drop the ones past the onchain size. It is a hope, not a promise, so it always
+     * ends in a root check — a tree that had an update(), or was reset and regrown with different
+     * leaves, fails that check and is re-read in full. Turning it off re-reads every leaf up front.
+     */
+    async syncTreesStorage(treeIds = undefined, { chunkSize = 2000n, attemptFastSizeMatch = true, blockNumber } = {}) {
+        // default syncs all previously synced trees
+        treeIds ??= Object.keys(this.trees).map((v) => BigInt(v));
+        if (treeIds.length === 0) {
+            throw new Error(`Nothing to sync. No treeIds in cache and no treeIds provided. Please specify which treeIds to sync. SyncTreesStorage cant automatically find them. If you don't know the treeIds, use syncTreesEvent or maybe the contract using the skinny/fat-imt library if it can provide the treeId.`);
+        }
+        if (chunkSize <= 0n) {
+            throw new Error(`chunkSize has to be at least 1, got: ${chunkSize}`);
+        }
+        const treeIdsHex = treeIds.map((id) => toHex(id));
+        const chainId = await this.publicClient.getChainId();
+        const cachedTrees = treeIdsHex.filter((id) => this.trees[id] !== undefined && this.trees[id].tree.size > 0);
+        if (attemptFastSizeMatch === false && cachedTrees.length > 0) {
+            console.warn(`treeIds:${cachedTrees} where found in cache from a previous sync. But attemptFastSizeMatch=false so this cache is not tried and every leaf is read again. The attempt is checked against the onchain root, so it can't cache a wrong tree, it only costs a re-read when it doesn't hold.`);
+        }
+        const identifiedTreesEnt = await Promise.all(treeIdsHex.map(async (id) => [id, await this.getTreeType(id, chainId)]));
+        const unsupportedTypes = [TREE_TYPE.NO_INTERFACE, TREE_TYPE.UNKNOWN, TREE_TYPE.SKINNY_EVENT];
+        const unsupportedTrees = identifiedTreesEnt.filter(([id, type]) => unsupportedTypes.includes(type));
+        if (unsupportedTrees.length > 0) {
+            throw new Error(`Some or more unsupported types found. Types not supported are: ${unsupportedTypes.map((t) => TREE_TYPE[t])}, unsupported treeIds found: ${unsupportedTrees.map(([id, type]) => `id:${id},type:${TREE_TYPE[type]}`)}`);
+        }
+        // prevent re-orgs, get a state at a safe block that requires 2/3 of the stake to re-org
+        // a blockNumber from the caller is taken as is: older than head needs an archive node, and
+        // newer than safe leaves the re-org risk to whoever asked for that block. Like syncToRoot in
+        // syncTreesEvent it can also move a cached tree *backwards*, which the trim below handles.
+        blockNumber ??= (await this.publicClient.getBlock({ blockTag: "safe" })).number;
+        const syncedTrees = {};
+        for (const treeId of treeIdsHex) {
+            const targetSize = await this.getTreeSizeStorage(treeId, chainId, blockNumber);
+            const onchainRoot = await this.getRootStorage(treeId, chainId, blockNumber);
+            const cached = this.trees[treeId];
+            const cacheSize = BigInt(cached ? cached.tree.size : 0);
+            let tree = undefined;
+            // leaves the attempt below already read from the contract, covering [readFrom, targetSize).
+            // They came from this block, not from the cache, so a failed attempt doesn't invalidate them
+            // and the fallback read only has to cover [0, readFrom).
+            let newInsertedLeaves = [];
+            let readFrom = targetSize;
+            if (attemptFastSizeMatch && cacheSize > 0n) {
+                const startTime = performance.now();
+                let attempt;
+                if (cacheSize > targetSize) {
+                    // the cache is ahead of the onchain tree: either it was synced to a newer block
+                    // than this one, or a reset() happened. Either way the hope is that the leaves it
+                    // keeps are the same ones, so only the indexes past targetSize have to go.
+                    // @TODO trimming rehashes the whole prefix, LeanIMT can't drop leaves and keep
+                    // its internal nodes. Same trade-off syncTreesEvent's trim makes.
+                    attempt = new LeanIMT(this.hashFunc, cached.tree.leaves.slice(0, Number(targetSize)));
+                }
+                else {
+                    // the hope is that the tree only grew, so only the indexes the cache is missing
+                    // are read. An update() below cacheSize is invisible here, the root check catches it.
+                    // @notice grows a copy, never cached.tree itself: a throw does not undo a mutation,
+                    // so growing it in place would leave leaves from this block under the block the
+                    // cache was last synced at, if anything below here fails.
+                    newInsertedLeaves = await this.readLeavesStorage(treeId, chainId, blockNumber, chunkSize, cacheSize, targetSize);
+                    readFrom = cacheSize;
+                    attempt = copyTree(cached.tree, this.hashFunc);
+                    if (newInsertedLeaves.length > 0) {
+                        attempt.insertMany(newInsertedLeaves);
+                    }
+                }
+                // check root match. (attempt.root ?? 0n) <= to also be fine if tree is empty since attempt.root will be undefined
+                if ((attempt.root ?? 0n) === onchainRoot) {
+                    tree = attempt;
+                }
+                else {
+                    // the leaves the cache held were not the onchain ones, so an update(), updateMany()
+                    // or a reset() rewrote them. Only the tree build is wasted, the leaves read above
+                    // are kept, so the fallback re-reads the cached ones and nothing more.
+                    console.warn(`failed fast size match on treeId:${treeId}, wasted ${performance.now() - startTime}ms on a tree build. Falling back to reading the ${readFrom} leaves the cache claimed, reusing the ${newInsertedLeaves.length} already read from the contract.`);
+                }
+            }
+            // attempt failed or was not tried, so read every leaf the attempt didn't already get
+            if (tree === undefined) {
+                const readLeaves = await this.readLeavesStorage(treeId, chainId, blockNumber, chunkSize, 0n, readFrom);
+                tree = new LeanIMT(this.hashFunc, [...readLeaves, ...newInsertedLeaves]);
+                if ((tree.root ?? 0n) !== onchainRoot) {
+                    // every leaf came straight from the contract at this block, so this is not a stale
+                    // cache. Drop what's cached for this tree, the attempt above may have grown it.
+                    delete this.trees[treeId];
+                    throw new Error(`Synced treeId:${treeId} to root:${tree.root ?? 0n} at block:${blockNumber}, but the contract reports root:${onchainRoot} for it. Its leaves and its root disagree, so one of the two reads is not what this lib expects.`);
+                }
+            }
+            this.trees[treeId] = {
+                tree: tree,
+                type: this.trees[treeId].type, // getTreeType() above put every treeId in the cache
+                lastSynced: blockNumber,
+                // attemptFastSizeMatch is a guess this sync made, not something it learned about the tree,
+                // so whatever is known about updates stays as it was
+                insertOnlyTree: this.trees[treeId].insertOnlyTree
+            };
+            syncedTrees[treeId] = this.trees[treeId];
+        }
+        return syncedTrees;
+    }
+    /**
+     * The leaves of `[startIndex, endIndex)`, read in chunks of `chunkSize`. Same range as
+     * {@link Trees#getLeavesStorage}, which does it in a single call, but split up so a big range
+     * doesn't have to fit in one eth_call. What the caller does with them (build a tree, grow one)
+     * is up to it.
+     */
+    async readLeavesStorage(treeId, chainId, blockNumber, chunkSize, startIndex, endIndex) {
+        const leaves = [];
+        for (let firstIndex = startIndex; firstIndex < endIndex; firstIndex += chunkSize) {
+            const lastIndex = minBigInt(firstIndex + chunkSize, endIndex); // lastIndex is exclusive
+            leaves.push(...await this.getLeavesStorage(treeId, chainId, firstIndex, lastIndex, blockNumber));
+        }
+        return leaves;
+    }
+    async syncTreesEvent(treeIds = undefined, { blockNumber, attemptFastSizeMatch = true, syncToRoot, chunkSize = 2000n, insertOnlyTree, autoDiscovery, hasRepeatedLeafs = true } = {}) {
+        treeIds ??= [];
+        if (treeIds.length !== 0 && autoDiscovery === true) {
+            throw new Error(`TreeIds where provided while autoDiscovery=true. Either turn off autoDiscovery to only sync those specific ids or set treeIds=undefined to automatically discover and sync all treeId.`);
+        }
+        if (treeIds.length === 0 && autoDiscovery === false) {
+            throw new Error(`Please specify which treeIds to sync. Or set autoDiscovery=true`);
+        }
+        const chainId = await this.publicClient.getChainId();
+        const defaultToAutoDiscover = treeIds.length === 0 && autoDiscovery === undefined && syncToRoot === undefined;
+        const discoverAllIds = treeIds.length === 0 && autoDiscovery === undefined && syncToRoot === undefined || autoDiscovery === true;
+        if (autoDiscovery && syncToRoot !== undefined) {
+            console.warn(`autoDiscovery was set to true, but a root was provided to syncToRoot. This causes the function to run all the way till block: ${getDeploymentBlock(chainId)}, to discover all treeIds. Even if a tree is already found with that root and synced, it will keep going to find another tree with that root. If you intent on only syncing one tree (or known list of ids), please provide them and set autoDiscovery=false.`);
+        }
+        if (defaultToAutoDiscover) {
+            console.warn(`No treeIds provided for event sync, defaulting to autoDiscovery of all treeIds. This will run all the way till block: ${getDeploymentBlock(chainId)}, to discover all treeIds. If this intended you can safely ignore this warning or silence it by setting autoDiscovery=true. If you intent on only syncing one or a set of treeIds, please provide them to speed up syncing.`);
+        }
+        // sync backwards, sync every NewLeaf, UpdatedLeaf, RepeatedLeafs, event
+        const newestBlock = blockNumber ?? (await this.publicClient.getBlock({ blockTag: 'safe' })).number;
+        // in discovery we go all the way down, if treeIds are provided, we go down till all them are synced
+        // if all of them are synced before, we don't sync all leaves, just those who happened after the most out of date tree was synced at
+        // when looking for a specific root we need to also go down to the lowest block since the root might be older then the last sync
+        const oldestBlock = discoverAllIds || syncToRoot !== undefined ? BigInt(getDeploymentBlock(chainId)) : this.getOldestSyncBlock(treeIds);
+        const syncState = { treeCache: this.trees, treeState: {}, lastBlockSynced: newestBlock, unsyncedIds: new Set(treeIds.map((id) => toHex(id))) };
+        const insertEvents = hasRepeatedLeafs ? ["NewLeaf", "RepeatedLeafs"] : ["NewLeaf"];
+        const leafEvents = insertOnlyTree ? insertEvents : ["UpdatedLeaf", ...insertEvents];
+        do {
+            const foundAllRoots = syncState.unsyncedIds.size === 0 && syncToRoot === undefined && discoverAllIds == false;
+            await queryMultiEventsInChunks({
+                publicClient: this.publicClient,
+                contract: await this.getContract(),
+                eventNames: foundAllRoots ? leafEvents : ["NewRoot", ...leafEvents],
+                // only our treeIds. treeId is the 1st indexed param of NewRoot, an array means "any of these"
+                sharedEventFilterArgs: discoverAllIds ? undefined : { treeId: [...syncState.unsyncedIds].map((id) => BigInt(id)) },
+                firstBlock: oldestBlock,
+                lastBlock: syncState.lastBlockSynced,
+                reverseOrder: true,
+                maxEvents: Infinity,
+                chunkSize: chunkSize,
+                // if we need all treeIds?
+                postQueryFilter: getEventFilter(oldestBlock, syncState, { hashFunc: this.hashFunc, attemptFastSizeMatch: attemptFastSizeMatch, autoDiscover: discoverAllIds, syncToRoot: syncToRoot })
+            });
+        } while (syncState.unsyncedIds.size > 0 && syncState.lastBlockSynced > oldestBlock);
+        // cache the tree, or update the new/updated leafs of an existing cache tree.
+        const syncedTrees = {};
+        const allTreeIds = new Set([...treeIds.map((id) => toHex(id)), ...Object.keys(syncState.treeState)]);
+        for (const treeId of allTreeIds) {
+            const newSyncState = syncState.treeState[treeId];
+            const cacheTree = this.trees[treeId];
+            const isNotOld = cacheTree === undefined
+                || (newSyncState !== undefined && newSyncState.lastSynced >= cacheTree.lastSynced);
+            // no-op, no new state and no rollback (syncToRoot on old root can be used to go back to a older root)
+            if (isNotOld === false && syncToRoot === undefined) {
+                syncedTrees[treeId] = cacheTree;
+                continue;
+            }
+            const canMerge = newSyncState !== undefined && cacheTree !== undefined && isNotOld
+                && BigInt(cacheTree.tree.size) <= newSyncState.targetSize;
+            if (newSyncState !== undefined && newSyncState.tree === undefined) {
+                const targetSize = Number(newSyncState.targetSize);
+                const missing = [];
+                for (let index = canMerge ? cacheTree.tree.size : 0; index < targetSize; index++) {
+                    if (newSyncState.leaves[index] === undefined) {
+                        missing.push(index);
+                        break;
+                    }
+                }
+                if (missing.length > 0) {
+                    throw new Error(`Incomplete sync of treeId:${treeId}. Root ${toHex(newSyncState.expectedRoot)} has ${targetSize} leaves, ` +
+                        `but no event was found indexes ${missing}. Possible causes: hasRepeatedLeafs:false, ` +
+                        `insertOnlyTree:true, a scan that did not reach far enough back (it started at block ${oldestBlock}), ` +
+                        `or a contract that does not emit an event for every leaf it stores.`);
+                }
+            }
+            let synced;
+            if (newSyncState?.tree !== undefined) {
+                // attemptFastSizeMatch was success full by trimming of leaves of the pre-existing cache tree.
+                // that caused a tree to already be built and checked so we can just use that rn.
+                // it's also almost always a rollback so we should not store in cache
+                // (almost always rollback, it could be that a reset happened, and just happens to have the same leaves as the previous tree but smaller size)
+                synced = {
+                    tree: newSyncState.tree,
+                    type: cacheTree.type,
+                    lastSynced: newSyncState.lastSynced,
+                    insertOnlyTree: cacheTree.insertOnlyTree
+                };
+            }
+            else if (canMerge) {
+                // @notice mutates the cached tree in place, so `synced` *is* the cache entry and the
+                // isNotOld check below can no longer keep it out. See canMerge above.
+                const updatedIndexes = [];
+                const updatedLeaves = [];
+                const newLeafs = [];
+                newSyncState.leaves.forEach((leaf, index) => {
+                    if (index < cacheTree.tree.size) {
+                        updatedLeaves.push(leaf);
+                        updatedIndexes.push(index);
+                    }
+                    else {
+                        newLeafs.push(leaf);
+                    }
+                });
+                cacheTree.tree.updateMany(updatedIndexes, updatedLeaves);
+                if (newLeafs.length > 0) {
+                    cacheTree.tree.insertMany(newLeafs);
+                }
+                cacheTree.lastSynced = newSyncState.lastSynced;
+                synced = cacheTree;
+            }
+            else {
+                // cached tree does not exist or synced tree is smaller and newSyncState.leaves is complete
+                synced = {
+                    tree: new LeanIMT(this.hashFunc, newSyncState ? newSyncState.leaves : []),
+                    type: cacheTree ? cacheTree.type : await identifyTree(BigInt(treeId), this.contract),
+                    lastSynced: newSyncState?.lastSynced ? newSyncState.lastSynced : 0n,
+                    // what the caller claims about this sync, falling back to whatever was known before
+                    insertOnlyTree: insertOnlyTree ?? cacheTree?.insertOnlyTree
+                };
+            }
+            if (newSyncState !== undefined && (synced.tree.root ?? 0n) !== newSyncState.expectedRoot) {
+                throw new Error(`syncing failed, expected root:${toHex(newSyncState.expectedRoot)} but got ${toHex(synced.tree.root ?? 0n)}`);
+            }
+            // a sync may only ever move the cache forward. A syncToRoot rollback is handed to the
+            // caller, but the cache keeps the newer tree it already had.
+            if (isNotOld) {
+                this.trees[treeId] = synced;
+            }
+            syncedTrees[treeId] = synced;
+        }
+        if (syncToRoot !== undefined) {
+            const allTreeIds = Object.keys(syncedTrees);
+            const treeIdsWithNoRoot = allTreeIds.filter((id) => syncedTrees[id].tree.root !== syncToRoot);
+            // not one tree came back with this root. Also covers "no tree came back at all", which is
+            // what a syncToRoot with no treeIds does: it never auto discovers, so it filters on an
+            // empty set of ids and matches nothing.
+            if (allTreeIds.length === treeIdsWithNoRoot.length) {
+                throw new Error(`Root: ${syncToRoot} was never found for ${allTreeIds.length === 0
+                    ? `any tree, none were synced at all. syncToRoot does not auto discover treeIds, so pass them in or set autoDiscovery=true`
+                    : `any of the treeIds: ${allTreeIds}`}`);
+            }
+            if (treeIdsWithNoRoot.length > 0) {
+                const foundTreeIds = allTreeIds.filter((id) => false === treeIdsWithNoRoot.includes(id));
+                console.warn(`Root: ${syncToRoot} was never found for some treeIds: ${treeIdsWithNoRoot}. But was found for ${foundTreeIds})`);
+                treeIdsWithNoRoot.forEach((id) => delete syncedTrees[id]);
+            }
+        }
+        return syncedTrees;
+    }
+    async getContract() {
+        if (this.contract) {
+            return this.contract;
+        }
+        else {
+            //[skinnyStorage, skinnyEvent, fatStorage, fatEvent]
+            const interfaceSupports = await Promise.all([
+                ERC165_IDS.skinnyStorage, ERC165_IDS.skinnyEvent, ERC165_IDS.fatStorage, ERC165_IDS.fatEvent
+            ].map((id) => supportsInterface(this.publicClient, this.contractAddress, id)));
+            const abis = [skinnyStorageAbi, skinnyEventAbi, fatStorageAbi, fatEventAbi];
+            const unionAbi = abis.filter((abi, i) => interfaceSupports[i]).flat();
+            this.contract = getContract({
+                address: this.contractAddress,
+                client: this.publicClient,
+                abi: [...unionAbi, ...iimtEventsAbi],
+                // yeah no amount of type juggling will be able to deal with these crazy union types.
+            });
+            return this.contract;
+        }
+    }
+    getOldestSyncTreeId(treeIds) {
+        let oldest = treeIds[0];
+        let oldestBlock = 2n ** 256n; // Infinity replacement
+        for (const id of treeIds) {
+            const tree = this.trees[id];
+            if (tree === undefined) {
+                return id;
+            }
+            if (tree.lastSynced < oldestBlock) {
+                oldestBlock = tree.lastSynced;
+                oldest = id;
+            }
+        }
+        return oldest;
+    }
+    getOldestSyncBlock(treeIds) {
+        const oldestTree = this.trees[this.getOldestSyncTreeId(treeIds.map((id) => toHex(id)))];
+        return oldestTree ? oldestTree.lastSynced : 0n;
+    }
+    async getTreeType(treeId, chainId) {
+        return (await this.initTree(treeId, chainId)).type;
+    }
+    async getLeavesStorage(treeId, chainId, startIndex, endIndex, blockNumber) {
+        const size = await this.getTreeSizeStorage(treeId, chainId, blockNumber);
+        if (startIndex > endIndex || endIndex > size) {
+            throw new Error(`Leaf range [${startIndex}, ${endIndex}) is out of range for treeId:${treeId}, which holds ${size} leaves at block:${blockNumber}.`);
+        }
+        const treeType = (await this.initTree(treeId, chainId)).type;
+        const contract = await this.getContract();
+        switch (treeType) {
+            case TREE_TYPE.SKINNY_STORAGE:
+                // TODO debug_storageRange at for these 2 but not FAT_EVENT
+                return await contract.read.getSkinnyLeaves([BigInt(treeId), startIndex, endIndex], { blockNumber: blockNumber });
+                break;
+            case TREE_TYPE.FAT_STORAGE:
+                return await contract.read.getFatLeaves([BigInt(treeId), startIndex, endIndex], { blockNumber: blockNumber });
+                break;
+            case TREE_TYPE.FAT_EVENT:
+                return await contract.read.getFatLeaves([BigInt(treeId), startIndex, endIndex], { blockNumber: blockNumber });
+                break;
+            default:
+                throw new Error(`treeId ${treeId} has type: ${TREE_TYPE[treeType]} which is not supported`);
+                break;
+        }
+    }
+    async getTreeSizeStorage(treeId, chainId, blockNumber) {
+        const cachedSize = this.sizes[treeId];
+        if (cachedSize !== undefined && cachedSize.blockNumber === blockNumber) {
+            return cachedSize.size;
+        }
+        const treeType = (await this.initTree(treeId, chainId)).type;
+        const contract = await this.getContract();
+        let size;
+        switch (treeType) {
+            case TREE_TYPE.SKINNY_STORAGE:
+            case TREE_TYPE.SKINNY_EVENT:
+                size = await contract.read.getSkinnySize([BigInt(treeId)], { blockNumber: blockNumber });
+                break;
+            case TREE_TYPE.FAT_STORAGE:
+            case TREE_TYPE.FAT_EVENT:
+                size = await contract.read.getFatSize([BigInt(treeId)], { blockNumber: blockNumber });
+                break;
+            default:
+                throw new Error(`treeId ${treeId} has type: ${TREE_TYPE[treeType]} which is not supported`);
+        }
+        this.sizes[treeId] = { blockNumber: blockNumber, size: size };
+        return size;
+    }
+    async getRootStorage(treeId, chainId, blockNumber) {
+        const treeType = (await this.initTree(treeId, chainId)).type;
+        const contract = await this.getContract();
+        switch (treeType) {
+            case TREE_TYPE.SKINNY_STORAGE:
+            case TREE_TYPE.SKINNY_EVENT:
+                return await contract.read.getSkinnyRoot([BigInt(treeId)], { blockNumber: blockNumber });
+            case TREE_TYPE.FAT_STORAGE:
+            case TREE_TYPE.FAT_EVENT:
+                return await contract.read.getFatRoot([BigInt(treeId)], { blockNumber: blockNumber });
+            default:
+                throw new Error(`treeId ${treeId} has type: ${TREE_TYPE[treeType]} which is not supported`);
+        }
+    }
+    async initTree(treeId, chainId) {
+        if (this.trees[treeId]) {
+            return this.trees[treeId];
+        }
+        const treeType = await identifyTree(BigInt(treeId), await this.getContract());
+        this.trees[treeId] = {
+            tree: new LeanIMT(this.hashFunc),
+            type: treeType,
+            lastSynced: BigInt(getDeploymentBlock(chainId))
+        };
+        return this.trees[treeId];
+    }
+}
+export async function identifyTree(treeId, contract) {
+    // TODO we can dish out these calls concurrently. but storage always > event, remember storage inherits event!!
+    let skinnyStorageProm, skinnyEventProm, fatStorageProm, fatEventProm;
+    const differentiatingFunctions = ["getSkinnyLeavesBaseSlot", "getSkinnySize", "getFatLeavesBaseSlot", "getFatSize"];
+    const contractFunctions = contract.abi.filter((abi) => abi.type === "function" && "name" in abi && differentiatingFunctions.includes(abi.name)).map((abi) => abi.name);
+    if (contractFunctions.length === 0) {
+        // is okay we can still look for events! SkinnyEvent interface is not even use full while syncing, since we 
+        // need events to get the leaves anyway. 
+        // TODO we cant deal with NO_INTERFACE case rn because storage emits both repeatedLeaves and newLeaf which is double
+        // prob not really a problem?
+        return TREE_TYPE.NO_INTERFACE;
+    }
+    if (contractFunctions.includes("getSkinnyLeavesBaseSlot")) {
+        skinnyStorageProm = contract.read.getSkinnyLeavesBaseSlot([treeId]);
+    }
+    if (contractFunctions.includes("getSkinnySize")) {
+        skinnyEventProm = contract.read.getSkinnySize([treeId]);
+    }
+    if (contractFunctions.includes("getFatLeavesBaseSlot")) {
+        fatStorageProm = contract.read.getFatLeavesBaseSlot([treeId]);
+    }
+    if (contractFunctions.includes("getFatSize")) {
+        fatEventProm = contract.read.getFatSize([treeId]);
+    }
+    // @notice storage needs to come first in the arr, since both storage and event resolve if a tree type == STORAGE
+    const proms = [skinnyStorageProm, skinnyEventProm, fatStorageProm, fatEventProm];
+    const settled = await Promise.allSettled(proms);
+    const types = [TREE_TYPE.SKINNY_STORAGE, TREE_TYPE.SKINNY_EVENT, TREE_TYPE.FAT_STORAGE, TREE_TYPE.FAT_EVENT];
+    for (let index = 0; index < settled.length; index++) {
+        // proms[index] guard: undefined entries (interface absent) become fulfilled in allSettled
+        if (proms[index] !== undefined && settled[index].status == "fulfilled") {
+            return types[index];
+        }
+    }
+    // usually un-initialized or does not exist
+    return TREE_TYPE.UNKNOWN;
+}
+export function getEventFilter(firstBlock, syncState, { autoDiscover, syncToRoot, attemptFastSizeMatch, hashFunc = LeanIMTHashFuncPoseidon2 } = {}) {
+    const quitEarly = (allEvents, chunkEvents, chunkStart, chunkEnd) => {
+        let quit = false;
+        for (const event of chunkEvents.toReversed()) {
+            const treeId = toHex(event.args.treeId);
+            // have we found our NewRoot event yet?
+            if (syncState.treeState[treeId] === undefined) {
+                if (event.eventName === "NewRoot") {
+                    if (syncToRoot === undefined || syncToRoot === event.args.root) {
+                        //TODO in case that syncToRoot is provided, check the tree in cache, if size >= as root says we need.
+                        // trim of excess leaves and check if root is already correct.
+                        // this allows us to quit very early on insert only trees or ones with update if we are lucky no update happened
+                        const simpleTrim = attemptFastSizeMatch && syncState.treeCache[treeId]?.tree.size > event.args.size;
+                        if (simpleTrim) {
+                            const trimmed = syncState.treeCache[treeId]?.tree.leaves.slice(0, Number(event.args.size));
+                            const startTime = performance.now();
+                            const trimmedTree = new LeanIMT(hashFunc, trimmed);
+                            const endTime = performance.now();
+                            if (event.args.root === trimmedTree.root) {
+                                console.log(`success full trim on treeId: ${treeId}`);
+                                syncState.treeState[treeId] = {
+                                    leaves: [],
+                                    count: 0n,
+                                    targetSize: event.args.size,
+                                    lastSynced: event.blockNumber - 1n, // 2 roots can be in one block, so -1 to be safe
+                                    tree: trimmedTree,
+                                    expectedRoot: event.args.root
+                                };
+                                syncState.unsyncedIds.delete(treeId);
+                                quit = true;
+                                continue;
+                            }
+                            else {
+                                console.warn(`failed trim, wasted ${endTime - startTime}ms on tree build`);
+                                // console.warn(`Rolling back to root: ${toHex(event.args.root)} failed. Likely because a tree reset or update happened. If that is true, you can safely ignore this warning. TODO optimize this`)
+                                //TODO: the entire tree was rebuilt here, just to fail. For a future re-write of a more scalable LeanIMTjs, make it so it can trim leaves, while re-using the internal nodes so rehashing is not needed for all.`)
+                            }
+                        }
+                        syncState.treeState[treeId] = {
+                            leaves: [],
+                            count: 0n,
+                            targetSize: event.args.size,
+                            lastSynced: event.blockNumber - 1n, // 2 roots can be in one block, so -1 to be safe
+                            tree: undefined,
+                            expectedRoot: event.args.root
+                        };
+                    }
+                }
+                // we have found a NewRoot, or our specific new root if syncToRoot was set
+                // so syncState[treeId] contains something now
+            }
+            else {
+                const tree = syncState.treeState[treeId];
+                if (tree.count === tree.targetSize || syncState.treeState[treeId].tree) {
+                    syncState.unsyncedIds.delete(treeId);
+                    quit = true;
+                    continue;
+                }
+                if (event.eventName === "RepeatedLeafs") {
+                    const start = Number(event.args.startIndex); // startIndex == inclusive, index = start is correct
+                    const end = Number(event.args.nextIndex); // nextIndex == exclusive, so index < end is correct here
+                    for (let index = start; index < end; index++) {
+                        if (tree.leaves[index] === undefined) {
+                            tree.leaves[index] = event.args.leaf;
+                            tree.count++;
+                        }
+                    }
+                }
+                else if (event.eventName !== "NewRoot") {
+                    const leafIndex = Number(event.args.index);
+                    if (tree.leaves[leafIndex] === undefined) {
+                        if (event.eventName === "NewLeaf") {
+                            // @TODO this is not super scalable, but realistically on L1 you wont really hit numbers high
+                            // enough, besides LeanIMT-js uses normal js arrays indexed by numbers so that is the first one to fail
+                            // also due to ram usage
+                            tree.leaves[leafIndex] = event.args.leaf;
+                            tree.count++;
+                        }
+                        else {
+                            // if (event.eventName === "UpdatedLeaf")
+                            tree.leaves[leafIndex] = event.args.newLeaf;
+                            tree.count++;
+                        }
+                    }
+                }
+            }
+        }
+        // we process all events on every chunk right away, we don't need allEvents, so just discard all events to save memory
+        // [allEvents, quit]
+        // `startBlock === firstBlock` <= detects, "is last chunk", assumes scanning backwards
+        if (quit || chunkStart === firstBlock) {
+            syncState.lastBlockSynced = chunkStart;
+        }
+        return [[], quit];
+    };
+    if (autoDiscover) {
+        const quitAtEnd = (allEvents, chunkEvents, chunkStart, chunkEnd) => { quitEarly(allEvents, chunkEvents, chunkStart, chunkEnd); return [[], false]; };
+        return quitAtEnd;
+    }
+    else {
+        return quitEarly;
+    }
+}
+//# sourceMappingURL=Trees.js.map