@aztec/archiver 0.0.1-commit.5daedc8 → 0.0.1-commit.6201a7b05

package/dest/modules/l1_synchronizer.js

@@ -0,0 +1,1265 @@
+function applyDecs2203RFactory() {
+    function createAddInitializerMethod(initializers, decoratorFinishedRef) {
+        return function addInitializer(initializer) {
+            assertNotFinished(decoratorFinishedRef, "addInitializer");
+            assertCallable(initializer, "An initializer");
+            initializers.push(initializer);
+        };
+    }
+    function memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, metadata, value) {
+        var kindStr;
+        switch(kind){
+            case 1:
+                kindStr = "accessor";
+                break;
+            case 2:
+                kindStr = "method";
+                break;
+            case 3:
+                kindStr = "getter";
+                break;
+            case 4:
+                kindStr = "setter";
+                break;
+            default:
+                kindStr = "field";
+        }
+        var ctx = {
+            kind: kindStr,
+            name: isPrivate ? "#" + name : name,
+            static: isStatic,
+            private: isPrivate,
+            metadata: metadata
+        };
+        var decoratorFinishedRef = {
+            v: false
+        };
+        ctx.addInitializer = createAddInitializerMethod(initializers, decoratorFinishedRef);
+        var get, set;
+        if (kind === 0) {
+            if (isPrivate) {
+                get = desc.get;
+                set = desc.set;
+            } else {
+                get = function() {
+                    return this[name];
+                };
+                set = function(v) {
+                    this[name] = v;
+                };
+            }
+        } else if (kind === 2) {
+            get = function() {
+                return desc.value;
+            };
+        } else {
+            if (kind === 1 || kind === 3) {
+                get = function() {
+                    return desc.get.call(this);
+                };
+            }
+            if (kind === 1 || kind === 4) {
+                set = function(v) {
+                    desc.set.call(this, v);
+                };
+            }
+        }
+        ctx.access = get && set ? {
+            get: get,
+            set: set
+        } : get ? {
+            get: get
+        } : {
+            set: set
+        };
+        try {
+            return dec(value, ctx);
+        } finally{
+            decoratorFinishedRef.v = true;
+        }
+    }
+    function assertNotFinished(decoratorFinishedRef, fnName) {
+        if (decoratorFinishedRef.v) {
+            throw new Error("attempted to call " + fnName + " after decoration was finished");
+        }
+    }
+    function assertCallable(fn, hint) {
+        if (typeof fn !== "function") {
+            throw new TypeError(hint + " must be a function");
+        }
+    }
+    function assertValidReturnValue(kind, value) {
+        var type = typeof value;
+        if (kind === 1) {
+            if (type !== "object" || value === null) {
+                throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+            }
+            if (value.get !== undefined) {
+                assertCallable(value.get, "accessor.get");
+            }
+            if (value.set !== undefined) {
+                assertCallable(value.set, "accessor.set");
+            }
+            if (value.init !== undefined) {
+                assertCallable(value.init, "accessor.init");
+            }
+        } else if (type !== "function") {
+            var hint;
+            if (kind === 0) {
+                hint = "field";
+            } else if (kind === 10) {
+                hint = "class";
+            } else {
+                hint = "method";
+            }
+            throw new TypeError(hint + " decorators must return a function or void 0");
+        }
+    }
+    function applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers, metadata) {
+        var decs = decInfo[0];
+        var desc, init, value;
+        if (isPrivate) {
+            if (kind === 0 || kind === 1) {
+                desc = {
+                    get: decInfo[3],
+                    set: decInfo[4]
+                };
+            } else if (kind === 3) {
+                desc = {
+                    get: decInfo[3]
+                };
+            } else if (kind === 4) {
+                desc = {
+                    set: decInfo[3]
+                };
+            } else {
+                desc = {
+                    value: decInfo[3]
+                };
+            }
+        } else if (kind !== 0) {
+            desc = Object.getOwnPropertyDescriptor(base, name);
+        }
+        if (kind === 1) {
+            value = {
+                get: desc.get,
+                set: desc.set
+            };
+        } else if (kind === 2) {
+            value = desc.value;
+        } else if (kind === 3) {
+            value = desc.get;
+        } else if (kind === 4) {
+            value = desc.set;
+        }
+        var newValue, get, set;
+        if (typeof decs === "function") {
+            newValue = memberDec(decs, name, desc, initializers, kind, isStatic, isPrivate, metadata, value);
+            if (newValue !== void 0) {
+                assertValidReturnValue(kind, newValue);
+                if (kind === 0) {
+                    init = newValue;
+                } else if (kind === 1) {
+                    init = newValue.init;
+                    get = newValue.get || value.get;
+                    set = newValue.set || value.set;
+                    value = {
+                        get: get,
+                        set: set
+                    };
+                } else {
+                    value = newValue;
+                }
+            }
+        } else {
+            for(var i = decs.length - 1; i >= 0; i--){
+                var dec = decs[i];
+                newValue = memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, metadata, value);
+                if (newValue !== void 0) {
+                    assertValidReturnValue(kind, newValue);
+                    var newInit;
+                    if (kind === 0) {
+                        newInit = newValue;
+                    } else if (kind === 1) {
+                        newInit = newValue.init;
+                        get = newValue.get || value.get;
+                        set = newValue.set || value.set;
+                        value = {
+                            get: get,
+                            set: set
+                        };
+                    } else {
+                        value = newValue;
+                    }
+                    if (newInit !== void 0) {
+                        if (init === void 0) {
+                            init = newInit;
+                        } else if (typeof init === "function") {
+                            init = [
+                                init,
+                                newInit
+                            ];
+                        } else {
+                            init.push(newInit);
+                        }
+                    }
+                }
+            }
+        }
+        if (kind === 0 || kind === 1) {
+            if (init === void 0) {
+                init = function(instance, init) {
+                    return init;
+                };
+            } else if (typeof init !== "function") {
+                var ownInitializers = init;
+                init = function(instance, init) {
+                    var value = init;
+                    for(var i = 0; i < ownInitializers.length; i++){
+                        value = ownInitializers[i].call(instance, value);
+                    }
+                    return value;
+                };
+            } else {
+                var originalInitializer = init;
+                init = function(instance, init) {
+                    return originalInitializer.call(instance, init);
+                };
+            }
+            ret.push(init);
+        }
+        if (kind !== 0) {
+            if (kind === 1) {
+                desc.get = value.get;
+                desc.set = value.set;
+            } else if (kind === 2) {
+                desc.value = value;
+            } else if (kind === 3) {
+                desc.get = value;
+            } else if (kind === 4) {
+                desc.set = value;
+            }
+            if (isPrivate) {
+                if (kind === 1) {
+                    ret.push(function(instance, args) {
+                        return value.get.call(instance, args);
+                    });
+                    ret.push(function(instance, args) {
+                        return value.set.call(instance, args);
+                    });
+                } else if (kind === 2) {
+                    ret.push(value);
+                } else {
+                    ret.push(function(instance, args) {
+                        return value.call(instance, args);
+                    });
+                }
+            } else {
+                Object.defineProperty(base, name, desc);
+            }
+        }
+    }
+    function applyMemberDecs(Class, decInfos, metadata) {
+        var ret = [];
+        var protoInitializers;
+        var staticInitializers;
+        var existingProtoNonFields = new Map();
+        var existingStaticNonFields = new Map();
+        for(var i = 0; i < decInfos.length; i++){
+            var decInfo = decInfos[i];
+            if (!Array.isArray(decInfo)) continue;
+            var kind = decInfo[1];
+            var name = decInfo[2];
+            var isPrivate = decInfo.length > 3;
+            var isStatic = kind >= 5;
+            var base;
+            var initializers;
+            if (isStatic) {
+                base = Class;
+                kind = kind - 5;
+                staticInitializers = staticInitializers || [];
+                initializers = staticInitializers;
+            } else {
+                base = Class.prototype;
+                protoInitializers = protoInitializers || [];
+                initializers = protoInitializers;
+            }
+            if (kind !== 0 && !isPrivate) {
+                var existingNonFields = isStatic ? existingStaticNonFields : existingProtoNonFields;
+                var existingKind = existingNonFields.get(name) || 0;
+                if (existingKind === true || existingKind === 3 && kind !== 4 || existingKind === 4 && kind !== 3) {
+                    throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + name);
+                } else if (!existingKind && kind > 2) {
+                    existingNonFields.set(name, kind);
+                } else {
+                    existingNonFields.set(name, true);
+                }
+            }
+            applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers, metadata);
+        }
+        pushInitializers(ret, protoInitializers);
+        pushInitializers(ret, staticInitializers);
+        return ret;
+    }
+    function pushInitializers(ret, initializers) {
+        if (initializers) {
+            ret.push(function(instance) {
+                for(var i = 0; i < initializers.length; i++){
+                    initializers[i].call(instance);
+                }
+                return instance;
+            });
+        }
+    }
+    function applyClassDecs(targetClass, classDecs, metadata) {
+        if (classDecs.length > 0) {
+            var initializers = [];
+            var newClass = targetClass;
+            var name = targetClass.name;
+            for(var i = classDecs.length - 1; i >= 0; i--){
+                var decoratorFinishedRef = {
+                    v: false
+                };
+                try {
+                    var nextNewClass = classDecs[i](newClass, {
+                        kind: "class",
+                        name: name,
+                        addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef),
+                        metadata
+                    });
+                } finally{
+                    decoratorFinishedRef.v = true;
+                }
+                if (nextNewClass !== undefined) {
+                    assertValidReturnValue(10, nextNewClass);
+                    newClass = nextNewClass;
+                }
+            }
+            return [
+                defineMetadata(newClass, metadata),
+                function() {
+                    for(var i = 0; i < initializers.length; i++){
+                        initializers[i].call(newClass);
+                    }
+                }
+            ];
+        }
+    }
+    function defineMetadata(Class, metadata) {
+        return Object.defineProperty(Class, Symbol.metadata || Symbol.for("Symbol.metadata"), {
+            configurable: true,
+            enumerable: true,
+            value: metadata
+        });
+    }
+    return function applyDecs2203R(targetClass, memberDecs, classDecs, parentClass) {
+        if (parentClass !== void 0) {
+            var parentMetadata = parentClass[Symbol.metadata || Symbol.for("Symbol.metadata")];
+        }
+        var metadata = Object.create(parentMetadata === void 0 ? null : parentMetadata);
+        var e = applyMemberDecs(targetClass, memberDecs, metadata);
+        if (!classDecs.length) defineMetadata(targetClass, metadata);
+        return {
+            e: e,
+            get c () {
+                return applyClassDecs(targetClass, classDecs, metadata);
+            }
+        };
+    };
+}
+function _apply_decs_2203_r(targetClass, memberDecs, classDecs, parentClass) {
+    return (_apply_decs_2203_r = applyDecs2203RFactory())(targetClass, memberDecs, classDecs, parentClass);
+}
+var _dec, _dec1, _dec2, _dec3, _initProto;
+import { getFinalizedL1Block } from '@aztec/ethereum/queries';
+import { asyncPool } from '@aztec/foundation/async-pool';
+import { maxBigint } from '@aztec/foundation/bigint';
+import { BlockNumber, CheckpointNumber } from '@aztec/foundation/branded-types';
+import { Buffer16, Buffer32 } from '@aztec/foundation/buffer';
+import { partition, pick } from '@aztec/foundation/collection';
+import { EthAddress } from '@aztec/foundation/eth-address';
+import { createLogger } from '@aztec/foundation/log';
+import { retryTimes } from '@aztec/foundation/retry';
+import { count } from '@aztec/foundation/string';
+import { Timer, elapsed } from '@aztec/foundation/timer';
+import { isDefined, isErrorClass } from '@aztec/foundation/types';
+import { L2BlockSourceEvents } from '@aztec/stdlib/block';
+import { Checkpoint, PublishedCheckpoint } from '@aztec/stdlib/checkpoint';
+import { getEpochAtSlot, getSlotAtNextL1Block } from '@aztec/stdlib/epoch-helpers';
+import { computeInHashFromL1ToL2Messages } from '@aztec/stdlib/messaging';
+import { execInSpan, trackSpan } from '@aztec/telemetry-client';
+import { InitialCheckpointNumberNotSequentialError } from '../errors.js';
+import { getCheckpointBlobDataFromBlobs, retrieveCheckpointCalldataFromRollup, retrieveL1ToL2Message, retrieveL1ToL2Messages, retrievedToPublishedCheckpoint } from '../l1/data_retrieval.js';
+import { MessageStoreError } from '../store/message_store.js';
+import { ArchiverDataStoreUpdater } from './data_store_updater.js';
+import { validateCheckpointAttestations } from './validation.js';
+_dec = trackSpan('Archiver.syncFromL1'), _dec1 = trackSpan('Archiver.handleEpochPrune'), _dec2 = trackSpan('Archiver.handleL1ToL2Messages'), _dec3 = trackSpan('Archiver.handleCheckpoints');
+/**
+ * Handles L1 synchronization for the archiver.
+ * Responsible for fetching checkpoints, L1→L2 messages, and handling L1 reorgs.
+ */ export class ArchiverL1Synchronizer {
+    publicClient;
+    debugClient;
+    rollup;
+    inbox;
+    store;
+    config;
+    blobClient;
+    epochCache;
+    dateProvider;
+    instrumentation;
+    l1Constants;
+    events;
+    log;
+    static{
+        ({ e: [_initProto] } = _apply_decs_2203_r(this, [
+            [
+                _dec,
+                2,
+                "syncFromL1"
+            ],
+            [
+                _dec1,
+                2,
+                "handleEpochPrune"
+            ],
+            [
+                _dec2,
+                2,
+                "handleL1ToL2Messages"
+            ],
+            [
+                _dec3,
+                2,
+                "handleCheckpoints"
+            ]
+        ], []));
+    }
+    l1BlockNumber;
+    l1BlockHash;
+    l1Timestamp;
+    updater;
+    tracer;
+    constructor(publicClient, debugClient, rollup, inbox, store, config, blobClient, epochCache, dateProvider, instrumentation, l1Constants, events, tracer, l2TipsCache, log = createLogger('archiver:l1-sync')){
+        this.publicClient = publicClient;
+        this.debugClient = debugClient;
+        this.rollup = rollup;
+        this.inbox = inbox;
+        this.store = store;
+        this.config = config;
+        this.blobClient = blobClient;
+        this.epochCache = epochCache;
+        this.dateProvider = dateProvider;
+        this.instrumentation = instrumentation;
+        this.l1Constants = l1Constants;
+        this.events = events;
+        this.log = log;
+        _initProto(this);
+        this.updater = new ArchiverDataStoreUpdater(this.store, l2TipsCache, {
+            rollupManaLimit: l1Constants.rollupManaLimit
+        });
+        this.tracer = tracer;
+    }
+    /** Sets new config */ setConfig(newConfig) {
+        this.config = newConfig;
+    }
+    /** Returns the last L1 block number that was synced. */ getL1BlockNumber() {
+        return this.l1BlockNumber;
+    }
+    /** Returns the last L1 timestamp that was synced. */ getL1Timestamp() {
+        return this.l1Timestamp;
+    }
+    getSignatureContext() {
+        return {
+            chainId: this.publicClient.chain.id,
+            rollupAddress: EthAddress.fromString(this.rollup.address)
+        };
+    }
+    /** Checks that the ethereum node we are connected to has a latest timestamp no more than the allowed drift. Throw if not. */ async testEthereumNodeSynced() {
+        const maxAllowedDelay = this.config.maxAllowedEthClientDriftSeconds;
+        if (maxAllowedDelay === 0) {
+            return;
+        }
+        const { number, timestamp: l1Timestamp } = await this.publicClient.getBlock({
+            includeTransactions: false
+        });
+        const currentTime = BigInt(this.dateProvider.nowInSeconds());
+        if (currentTime - l1Timestamp > BigInt(maxAllowedDelay)) {
+            throw new Error(`Ethereum node is out of sync (last block synced ${number} at ${l1Timestamp} vs current time ${currentTime})`);
+        }
+    }
+    async syncFromL1(initialSyncComplete) {
+        // In between the various calls to L1, the block number can move meaning some of the following
+        // calls will return data for blocks that were not present during earlier calls. To combat this
+        // we ensure that all data retrieval methods only retrieve data up to the currentBlockNumber
+        // captured at the top of this function.
+        const currentL1Block = await this.publicClient.getBlock({
+            includeTransactions: false
+        });
+        const currentL1BlockNumber = currentL1Block.number;
+        const currentL1BlockHash = Buffer32.fromString(currentL1Block.hash);
+        const currentL1Timestamp = currentL1Block.timestamp;
+        const currentL1BlockData = {
+            l1BlockNumber: currentL1BlockNumber,
+            l1BlockHash: currentL1BlockHash
+        };
+        if (this.l1BlockHash && currentL1BlockHash.equals(this.l1BlockHash)) {
+            this.log.trace(`No new L1 blocks since last sync at L1 block ${this.l1BlockNumber}`);
+            return;
+        }
+        // Warn if the latest L1 block timestamp is too old
+        const maxAllowedDelay = this.config.maxAllowedEthClientDriftSeconds;
+        const now = this.dateProvider.nowInSeconds();
+        if (maxAllowedDelay > 0 && Number(currentL1Timestamp) <= now - maxAllowedDelay) {
+            this.log.warn(`Latest L1 block ${currentL1BlockNumber} timestamp ${currentL1Timestamp} is too old. Make sure your Ethereum node is synced.`, {
+                currentL1BlockNumber,
+                currentL1Timestamp,
+                now,
+                maxAllowedDelay
+            });
+        }
+        // Load sync point for blocks defaulting to start block
+        const { blocksSynchedTo = this.l1Constants.l1StartBlock } = await this.store.getSynchPoint();
+        this.log.debug(`Starting new archiver sync iteration`, {
+            blocksSynchedTo,
+            currentL1BlockData
+        });
+        // Sync L1 to L2 messages. We retry this a few times since there are error conditions that reset the sync point, requiring a new iteration.
+        // Note that we cannot just wait for the l1 synchronizer to loop again, since the synchronizer would report as synced up to the current L1
+        // block, when that wouldn't be the case, since L1 to L2 messages would need another iteration.
+        await retryTimes(()=>this.handleL1ToL2Messages(currentL1BlockData), 'Handling L1 to L2 messages', 3, 0.1);
+        if (currentL1BlockNumber > blocksSynchedTo) {
+            // First we retrieve new checkpoints and L2 blocks and store them in the DB. This will also update the
+            // pending chain validation status, proven checkpoint number, and synched L1 block number.
+            const rollupStatus = await this.handleCheckpoints(blocksSynchedTo, currentL1BlockNumber, initialSyncComplete);
+            // Then we try pruning uncheckpointed blocks if a new slot was mined without checkpoints
+            await this.pruneUncheckpointedBlocks(currentL1Timestamp);
+            // Then we prune the current epoch if it'd reorg on next submission.
+            // Note that we don't do this before retrieving checkpoints because we may need to retrieve
+            // checkpoints from more than 2 epochs ago, so we want to make sure we have the latest view of
+            // the chain locally before we start unwinding stuff. This can be optimized by figuring out
+            // up to which point we're pruning, and then requesting checkpoints up to that point only.
+            const { rollupCanPrune } = await this.handleEpochPrune(rollupStatus.provenCheckpointNumber, currentL1BlockNumber, currentL1Timestamp);
+            // If the last checkpoint we processed had an invalid attestation, we manually advance the L1 syncpoint
+            // past it, since otherwise we'll keep downloading it and reprocessing it on every iteration until
+            // we get a valid checkpoint to advance the syncpoint.
+            if (!rollupStatus.validationResult?.valid && rollupStatus.lastL1BlockWithCheckpoint !== undefined) {
+                await this.store.setCheckpointSynchedL1BlockNumber(rollupStatus.lastL1BlockWithCheckpoint);
+            }
+            // And lastly we check if we are missing any checkpoints behind us due to a possible L1 reorg.
+            // We only do this if rollup cant prune on the next submission. Otherwise we will end up
+            // re-syncing the checkpoints we have just unwound above. We also dont do this if the last checkpoint is invalid,
+            // since the archiver will rightfully refuse to sync up to it.
+            if (!rollupCanPrune && rollupStatus.validationResult?.valid) {
+                await this.checkForNewCheckpointsBeforeL1SyncPoint(rollupStatus, blocksSynchedTo, currentL1BlockNumber);
+            }
+            this.instrumentation.updateL1BlockHeight(currentL1BlockNumber);
+        }
+        // Update the finalized L2 checkpoint based on L1 finality.
+        await this.updateFinalizedCheckpoint();
+        // After syncing has completed, update the current l1 block number and timestamp,
+        // otherwise we risk announcing to the world that we've synced to a given point,
+        // but the corresponding blocks have not been processed (see #12631).
+        this.l1Timestamp = currentL1Timestamp;
+        this.l1BlockNumber = currentL1BlockNumber;
+        this.l1BlockHash = currentL1BlockHash;
+        const l1BlockNumberAtEnd = await this.publicClient.getBlockNumber();
+        this.log.debug(`Archiver sync iteration complete`, {
+            l1BlockNumberAtStart: currentL1BlockNumber,
+            l1TimestampAtStart: currentL1Timestamp,
+            l1BlockNumberAtEnd
+        });
+    }
+    /** Query L1 for its finalized block and update the finalized checkpoint accordingly. */ async updateFinalizedCheckpoint() {
+        try {
+            const finalizedL1Block = await getFinalizedL1Block(this.publicClient);
+            if (!finalizedL1Block) {
+                this.log.trace(`Skipping finalized checkpoint update: L1 has no finalized block yet.`);
+                return;
+            }
+            const finalizedL1BlockNumber = finalizedL1Block.number;
+            const finalizedCheckpointNumber = await this.rollup.getProvenCheckpointNumber({
+                blockNumber: finalizedL1BlockNumber
+            });
+            const localFinalizedCheckpointNumber = await this.store.getFinalizedCheckpointNumber();
+            if (localFinalizedCheckpointNumber !== finalizedCheckpointNumber) {
+                await this.updater.setFinalizedCheckpointNumber(finalizedCheckpointNumber);
+                this.log.info(`Updated finalized chain to checkpoint ${finalizedCheckpointNumber}`, {
+                    finalizedCheckpointNumber,
+                    finalizedL1BlockNumber
+                });
+            }
+        } catch (err) {
+            // The rollup contract may not exist at the finalized L1 block right after deployment.
+            if (!err?.message?.includes('returned no data')) {
+                this.log.warn(`Failed to update finalized checkpoint: ${err}`);
+            }
+        }
+    }
+    /** Prune all proposed local blocks that should have been checkpointed by now. */ async pruneUncheckpointedBlocks(currentL1Timestamp) {
+        const [lastCheckpointedBlockNumber, lastProposedBlockNumber] = await Promise.all([
+            this.store.getCheckpointedL2BlockNumber(),
+            this.store.getLatestBlockNumber()
+        ]);
+        // If there are no uncheckpointed blocks, we got nothing to do
+        if (lastProposedBlockNumber === lastCheckpointedBlockNumber) {
+            this.log.trace(`No uncheckpointed blocks to prune.`);
+            return;
+        }
+        // What's the slot at the next L1 block? All blocks for slots strictly before this one should've been checkpointed by now.
+        const slotAtNextL1Block = getSlotAtNextL1Block(currentL1Timestamp, this.l1Constants);
+        const firstUncheckpointedBlockNumber = BlockNumber(lastCheckpointedBlockNumber + 1);
+        // What's the slot of the first uncheckpointed block?
+        const [firstUncheckpointedBlockHeader] = await this.store.getBlockHeaders(firstUncheckpointedBlockNumber, 1);
+        const firstUncheckpointedBlockSlot = firstUncheckpointedBlockHeader?.getSlot();
+        if (firstUncheckpointedBlockSlot === undefined || firstUncheckpointedBlockSlot >= slotAtNextL1Block) {
+            return;
+        }
+        // Prune provisional blocks from slots that have ended without being checkpointed.
+        // This also clears any proposed checkpoint whose blocks are being pruned.
+        this.log.warn(`Pruning blocks after block ${lastCheckpointedBlockNumber} due to slot ${firstUncheckpointedBlockSlot} not being checkpointed`, {
+            firstUncheckpointedBlockHeader: firstUncheckpointedBlockHeader.toInspect(),
+            slotAtNextL1Block
+        });
+        const prunedBlocks = await this.updater.removeUncheckpointedBlocksAfter(lastCheckpointedBlockNumber);
+        if (prunedBlocks.length > 0) {
+            this.events.emit(L2BlockSourceEvents.L2PruneUncheckpointed, {
+                type: L2BlockSourceEvents.L2PruneUncheckpointed,
+                slotNumber: firstUncheckpointedBlockSlot,
+                blocks: prunedBlocks
+            });
+        }
+    }
+    /** Queries the rollup contract on whether a prune can be executed on the immediate next L1 block. */ async canPrune(currentL1BlockNumber, currentL1Timestamp) {
+        const time = (currentL1Timestamp ?? 0n) + BigInt(this.l1Constants.ethereumSlotDuration);
+        const result = await this.rollup.canPruneAtTime(time, {
+            blockNumber: currentL1BlockNumber
+        });
+        if (result) {
+            this.log.debug(`Rollup contract allows pruning at L1 block ${currentL1BlockNumber} time ${time}`, {
+                currentL1Timestamp,
+                pruneTime: time,
+                currentL1BlockNumber
+            });
+        }
+        return result;
+    }
+    /** Checks if there'd be a reorg for the next checkpoint submission and start pruning now. */ async handleEpochPrune(provenCheckpointNumber, currentL1BlockNumber, currentL1Timestamp) {
+        const rollupCanPrune = await this.canPrune(currentL1BlockNumber, currentL1Timestamp);
+        const localPendingCheckpointNumber = await this.store.getSynchedCheckpointNumber();
+        const canPrune = localPendingCheckpointNumber > provenCheckpointNumber && rollupCanPrune;
+        if (canPrune) {
+            const timer = new Timer();
+            const pruneFrom = CheckpointNumber(provenCheckpointNumber + 1);
+            const header = await this.getCheckpointHeader(pruneFrom);
+            if (header === undefined) {
+                throw new Error(`Missing checkpoint header ${pruneFrom}`);
+            }
+            const pruneFromSlotNumber = header.slotNumber;
+            const pruneFromEpochNumber = getEpochAtSlot(pruneFromSlotNumber, this.l1Constants);
+            const checkpointsToUnwind = localPendingCheckpointNumber - provenCheckpointNumber;
+            // Fetch checkpoints and blocks in bounded batches to avoid unbounded concurrent
+            // promises when the gap between local pending and proven checkpoint numbers is large.
+            const BATCH_SIZE = 10;
+            const indices = Array.from({
+                length: checkpointsToUnwind
+            }, (_, i)=>CheckpointNumber(i + pruneFrom));
+            const checkpoints = (await asyncPool(BATCH_SIZE, indices, (idx)=>this.store.getCheckpointData(idx))).filter(isDefined);
+            const newBlocks = (await asyncPool(BATCH_SIZE, checkpoints, (cp)=>this.store.getBlocksForCheckpoint(CheckpointNumber(cp.checkpointNumber)))).filter(isDefined).flat();
+            // Emit an event for listening services to react to the chain prune
+            this.events.emit(L2BlockSourceEvents.L2PruneUnproven, {
+                type: L2BlockSourceEvents.L2PruneUnproven,
+                epochNumber: pruneFromEpochNumber,
+                blocks: newBlocks
+            });
+            this.log.debug(`L2 prune from ${provenCheckpointNumber + 1} to ${localPendingCheckpointNumber} will occur on next checkpoint submission.`);
+            await this.updater.removeCheckpointsAfter(provenCheckpointNumber);
+            this.log.warn(`Removed ${count(checkpointsToUnwind, 'checkpoint')} after checkpoint ${provenCheckpointNumber} ` + `due to predicted reorg at L1 block ${currentL1BlockNumber}. ` + `Updated latest checkpoint is ${await this.store.getSynchedCheckpointNumber()}.`);
+            this.instrumentation.processPrune(timer.ms());
+        // TODO(palla/reorg): Do we need to set the block synched L1 block number here?
+        // Seems like the next iteration should handle this.
+        // await this.store.setCheckpointSynchedL1BlockNumber(currentL1BlockNumber);
+        }
+        return {
+            rollupCanPrune
+        };
+    }
+    nextRange(end, limit) {
+        const batchSize = this.config.batchSize * this.l1Constants.slotDuration / this.l1Constants.ethereumSlotDuration;
+        const nextStart = end + 1n;
+        const nextEnd = nextStart + BigInt(batchSize);
+        if (nextEnd > limit) {
+            return [
+                nextStart,
+                limit
+            ];
+        }
+        return [
+            nextStart,
+            nextEnd
+        ];
+    }
+    async handleL1ToL2Messages(currentL1Block) {
+        // Load the syncpoint, which may have been updated in a previous iteration
+        const { messagesSynchedTo = {
+            l1BlockNumber: this.l1Constants.l1StartBlock,
+            l1BlockHash: this.l1Constants.l1StartBlockHash
+        } } = await this.store.getSynchPoint();
+        // Nothing to do if L1 block number has not moved forward
+        const currentL1BlockNumber = currentL1Block.l1BlockNumber;
+        if (currentL1BlockNumber <= messagesSynchedTo.l1BlockNumber) {
+            return true;
+        }
+        // Compare local message store state with the remote. If they match, we just advance the match pointer.
+        const remoteMessagesState = await this.inbox.getState({
+            blockNumber: currentL1BlockNumber
+        });
+        const localLastMessage = await this.store.getLastL1ToL2Message();
+        if (await this.localStateMatches(localLastMessage, remoteMessagesState)) {
+            this.log.trace(`Local L1 to L2 messages are already in sync with remote at L1 block ${currentL1BlockNumber}`);
+            await this.store.setMessageSyncState(currentL1Block, remoteMessagesState.treeInProgress);
+            return true;
+        }
+        // If not, then we are out of sync. Most likely there are new messages on the inbox, so we try retrieving them.
+        // However, it could also be the case that there was an L1 reorg and our syncpoint is no longer valid.
+        // If that's the case, we'd get an exception out of the message store since the rolling hash of the first message
+        // we try to insert would not match the one in the db, in which case we rollback to the last common message with L1.
+        try {
+            await this.retrieveAndStoreMessages(messagesSynchedTo.l1BlockNumber, currentL1BlockNumber);
+        } catch (error) {
+            if (isErrorClass(error, MessageStoreError)) {
+                this.log.warn(`Failed to store L1 to L2 messages retrieved from L1: ${error.message}. Rolling back syncpoint to retry.`, {
+                    inboxMessage: error.inboxMessage
+                });
+                await this.rollbackL1ToL2Messages(remoteMessagesState);
+                return false;
+            }
+            throw error;
+        }
+        // Note that, if there are no new messages to insert, but there was an L1 reorg that pruned out last messages,
+        // we'd notice by comparing our local state with the remote one again, and seeing they don't match even after
+        // our sync attempt. In this case, we also rollback our syncpoint, and trigger a retry.
+        const localLastMessageAfterSync = await this.store.getLastL1ToL2Message();
+        if (!await this.localStateMatches(localLastMessageAfterSync, remoteMessagesState)) {
+            this.log.warn(`Local L1 to L2 messages state does not match remote after sync attempt. Rolling back syncpoint to retry.`, {
+                localLastMessageAfterSync,
+                remoteMessagesState
+            });
+            await this.rollbackL1ToL2Messages(remoteMessagesState);
+            return false;
+        }
+        // Advance the syncpoint after a successful sync
+        await this.store.setMessageSyncState(currentL1Block, remoteMessagesState.treeInProgress);
+        return true;
+    }
+    /** Checks if the local rolling hash and message count matches the remote state */ async localStateMatches(localLastMessage, remoteState) {
+        const localMessageCount = await this.store.getTotalL1ToL2MessageCount();
+        this.log.trace(`Comparing local and remote inbox state`, {
+            localMessageCount,
+            localLastMessage,
+            remoteState
+        });
+        return remoteState.totalMessagesInserted === localMessageCount && remoteState.messagesRollingHash.equals(localLastMessage?.rollingHash ?? Buffer16.ZERO);
+    }
+    /** Retrieves L1 to L2 messages from L1 in batches and stores them. */ async retrieveAndStoreMessages(fromL1Block, toL1Block) {
+        let searchStartBlock = 0n;
+        let searchEndBlock = fromL1Block;
+        let lastMessage;
+        let messageCount = 0;
+        do {
+            [searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, toL1Block);
+            this.log.trace(`Retrieving L1 to L2 messages in L1 blocks ${searchStartBlock}-${searchEndBlock}`);
+            const messages = await retrieveL1ToL2Messages(this.inbox, searchStartBlock, searchEndBlock);
+            const timer = new Timer();
+            await this.store.addL1ToL2Messages(messages);
+            const perMsg = timer.ms() / messages.length;
+            this.instrumentation.processNewMessages(messages.length, perMsg);
+            for (const msg of messages){
+                this.log.debug(`Downloaded L1 to L2 message`, {
+                    ...msg,
+                    leaf: msg.leaf.toString()
+                });
+                lastMessage = msg;
+                messageCount++;
+            }
+        }while (searchEndBlock < toL1Block)
+        if (messageCount > 0) {
+            this.log.info(`Retrieved ${messageCount} new L1 to L2 messages up to message with index ${lastMessage?.index} for checkpoint ${lastMessage?.checkpointNumber}`, {
+                lastMessage,
+                messageCount
+            });
+        }
+    }
+    /**
+   * Rolls back local L1 to L2 messages to the last common message with L1, and updates the syncpoint to the L1 block of that message.
+   * If no common message is found, rolls back all messages and sets the syncpoint to the start block.
+   */ async rollbackL1ToL2Messages(remoteMessagesState) {
+        const { treeInProgress: remoteTreeInProgress, messagesRollingHash: remoteRollingHash } = remoteMessagesState;
+        // Slowly go back through our messages until we find the last common message. We could query the logs in
+        // batch as an optimization, but the depth of the reorg should not be deep, and this is a very rare case,
+        // so it's fine to query one log at a time.
+        let commonMsg;
+        let messagesToDelete = 0;
+        this.log.verbose(`Searching most recent common L1 to L2 message`);
+        for await (const localMsg of this.store.iterateL1ToL2Messages({
+            reverse: true
+        })){
+            const logCtx = {
+                remoteMsg: undefined,
+                localMsg,
+                remoteMessagesState
+            };
+            // First check if the local message rolling hash matches the current rolling hash of the inbox contract,
+            // which means we just need to rollback some local messages and we should be back in sync. This means there
+            // was an L1 reorg that removed some of the messages we had, but no new messages were added compared.
+            if (localMsg.rollingHash.equals(remoteRollingHash)) {
+                this.log.info(`Found common L1 to L2 message at index ${localMsg.index} on L1 block ${localMsg.l1BlockNumber} matching current remote state`, logCtx);
+                commonMsg = localMsg;
+                break;
+            }
+            // If there's no match with the current remote state, check if the message exists on the inbox contract at all
+            // by looking at the inbox events. If the L1 reorg *added* new messages in addition to deleting existing ones,
+            // then the current remote state's rolling hash will not match anything we have locally, so we need to check existence
+            // of individual messages via logs. Note we use logs and not historical queries so we don't have to depend on
+            // an archival rpc node, since the message could be from a long time ago if we're catching up with syncing.
+            const remoteMsg = await retrieveL1ToL2Message(this.inbox, localMsg);
+            logCtx.remoteMsg = remoteMsg;
+            if (remoteMsg && remoteMsg.rollingHash.equals(localMsg.rollingHash)) {
+                this.log.info(`Found most recent common L1 to L2 message at index ${localMsg.index} on L1 block ${localMsg.l1BlockNumber}`, logCtx);
+                commonMsg = remoteMsg;
+                break;
+            } else if (remoteMsg) {
+                this.log.debug(`Local L1 to L2 message with index ${localMsg.index} has different rolling hash`, logCtx);
+                messagesToDelete++;
+            } else {
+                this.log.debug(`Local L1 to L2 message with index ${localMsg.index} not found on L1`, logCtx);
+                messagesToDelete++;
+            }
+        }
+        // Delete everything after the common message we found, if anything needs to be deleted.
+        // Do not exit early if there are no messages to delete, we still want to update the syncpoint.
+        if (messagesToDelete > 0) {
+            const lastGoodIndex = commonMsg?.index;
+            this.log.warn(`Rolling back all local L1 to L2 messages after index ${lastGoodIndex ?? 'initial'}`);
+            await this.store.removeL1ToL2Messages(lastGoodIndex !== undefined ? lastGoodIndex + 1n : 0n);
+        }
+        // Update the syncpoint so the loop below reprocesses the changed messages. We go to the block before
+        // the last common one, so we force reprocessing it, in case new messages were added on that same L1 block
+        // after the last common message.
+        const syncPointL1BlockNumber = commonMsg ? commonMsg.l1BlockNumber - 1n : this.l1Constants.l1StartBlock;
+        const syncPointL1BlockHash = await this.getL1BlockHash(syncPointL1BlockNumber);
+        const messagesSyncPoint = {
+            l1BlockNumber: syncPointL1BlockNumber,
+            l1BlockHash: syncPointL1BlockHash
+        };
+        await this.store.setMessageSyncState(messagesSyncPoint, remoteTreeInProgress);
+        this.log.verbose(`Updated messages syncpoint to L1 block ${syncPointL1BlockNumber}`, {
+            ...messagesSyncPoint,
+            remoteTreeInProgress
+        });
+        return messagesSyncPoint;
+    }
+    async getL1BlockHash(l1BlockNumber) {
+        const block = await this.publicClient.getBlock({
+            blockNumber: l1BlockNumber,
+            includeTransactions: false
+        });
+        if (!block) {
+            throw new Error(`Missing L1 block ${l1BlockNumber}`);
+        }
+        return Buffer32.fromString(block.hash);
+    }
+    async handleCheckpoints(blocksSynchedTo, currentL1BlockNumber, initialSyncComplete) {
+        const localPendingCheckpointNumber = await this.store.getSynchedCheckpointNumber();
+        const initialValidationResult = await this.store.getPendingChainValidationStatus();
+        const { provenCheckpointNumber, provenArchive, pendingCheckpointNumber, pendingArchive, archiveOfMyCheckpoint: archiveForLocalPendingCheckpointNumber } = await execInSpan(this.tracer, 'Archiver.getRollupStatus', ()=>this.rollup.status(localPendingCheckpointNumber, {
+                blockNumber: currentL1BlockNumber
+            }));
+        const rollupStatus = {
+            provenCheckpointNumber,
+            provenArchive: provenArchive.toString(),
+            pendingCheckpointNumber,
+            pendingArchive: pendingArchive.toString(),
+            validationResult: initialValidationResult
+        };
+        this.log.trace(`Retrieved rollup status at current L1 block ${currentL1BlockNumber}.`, {
+            localPendingCheckpointNumber,
+            blocksSynchedTo,
+            currentL1BlockNumber,
+            archiveForLocalPendingCheckpointNumber,
+            ...rollupStatus
+        });
+        const updateProvenCheckpoint = async ()=>{
+            // Annoying edge case: if proven checkpoint is moved back to 0 due to a reorg at the beginning of the chain,
+            // we need to set it to zero. This is an edge case because we dont have a checkpoint zero (initial checkpoint is one),
+            // so localCheckpointForDestinationProvenCheckpointNumber would not be found below.
+            if (provenCheckpointNumber === 0) {
+                const localProvenCheckpointNumber = await this.store.getProvenCheckpointNumber();
+                if (localProvenCheckpointNumber !== provenCheckpointNumber) {
+                    await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
+                    this.log.info(`Rolled back proven chain to checkpoint ${provenCheckpointNumber}`, {
+                        provenCheckpointNumber
+                    });
+                }
+            }
+            const localCheckpointForDestinationProvenCheckpointNumber = await this.store.getCheckpointData(provenCheckpointNumber);
+            // Sanity check. I've hit what seems to be a state where the proven checkpoint is set to a value greater than the latest
+            // synched checkpoint when requesting L2Tips from the archiver. This is the only place where the proven checkpoint is set.
+            const synched = await this.store.getSynchedCheckpointNumber();
+            if (localCheckpointForDestinationProvenCheckpointNumber && synched < localCheckpointForDestinationProvenCheckpointNumber.checkpointNumber) {
+                this.log.error(`Hit local checkpoint greater than last synched checkpoint: ${localCheckpointForDestinationProvenCheckpointNumber.checkpointNumber} > ${synched}`);
+            }
+            this.log.trace(`Local checkpoint for remote proven checkpoint ${provenCheckpointNumber} is ${localCheckpointForDestinationProvenCheckpointNumber?.archive.root.toString() ?? 'undefined'}`);
+            if (localCheckpointForDestinationProvenCheckpointNumber && provenArchive.equals(localCheckpointForDestinationProvenCheckpointNumber.archive.root)) {
+                const localProvenCheckpointNumber = await this.store.getProvenCheckpointNumber();
+                if (localProvenCheckpointNumber !== provenCheckpointNumber) {
+                    await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
+                    this.log.info(`Updated proven chain to checkpoint ${provenCheckpointNumber}`, {
+                        provenCheckpointNumber
+                    });
+                    const provenSlotNumber = localCheckpointForDestinationProvenCheckpointNumber.header.slotNumber;
+                    const provenEpochNumber = getEpochAtSlot(provenSlotNumber, this.l1Constants);
+                    const lastBlockNumberInCheckpoint = localCheckpointForDestinationProvenCheckpointNumber.startBlock + localCheckpointForDestinationProvenCheckpointNumber.blockCount - 1;
+                    this.events.emit(L2BlockSourceEvents.L2BlockProven, {
+                        type: L2BlockSourceEvents.L2BlockProven,
+                        blockNumber: BlockNumber(lastBlockNumberInCheckpoint),
+                        slotNumber: provenSlotNumber,
+                        epochNumber: provenEpochNumber
+                    });
+                    this.instrumentation.updateLastProvenCheckpoint(localCheckpointForDestinationProvenCheckpointNumber);
+                } else {
+                    this.log.trace(`Proven checkpoint ${provenCheckpointNumber} already stored.`);
+                }
+            }
+        };
+        // This is an edge case that we only hit if there are no proposed checkpoints.
+        // If we have 0 checkpoints locally and there are no checkpoints onchain there is nothing to do.
+        const noCheckpoints = localPendingCheckpointNumber === 0 && pendingCheckpointNumber === 0;
+        if (noCheckpoints) {
+            await this.store.setCheckpointSynchedL1BlockNumber(currentL1BlockNumber);
+            this.log.debug(`No checkpoints to retrieve from ${blocksSynchedTo + 1n} to ${currentL1BlockNumber}, no checkpoints on chain`);
+            return rollupStatus;
+        }
+        await updateProvenCheckpoint();
+        // Related to the L2 reorgs of the pending chain. We are only interested in actually addressing a reorg if there
+        // are any state that could be impacted by it. If we have no checkpoints, there is no impact.
+        if (localPendingCheckpointNumber > 0) {
+            const localPendingCheckpoint = await this.store.getCheckpointData(localPendingCheckpointNumber);
+            if (localPendingCheckpoint === undefined) {
+                throw new Error(`Missing checkpoint ${localPendingCheckpointNumber}`);
+            }
+            const localPendingArchiveRoot = localPendingCheckpoint.archive.root.toString();
+            const noCheckpointSinceLast = localPendingCheckpoint && pendingArchive.toString() === localPendingArchiveRoot;
+            if (noCheckpointSinceLast) {
+                // We believe the following line causes a problem when we encounter L1 re-orgs.
+                // Basically, by setting the synched L1 block number here, we are saying that we have
+                // processed all checkpoints up to the current L1 block number and we will not attempt to retrieve logs from
+                // this block again (or any blocks before).
+                // However, in the re-org scenario, our L1 node is temporarily lying to us and we end up potentially missing checkpoints.
+                // We must only set this block number based on actually retrieved logs.
+                // TODO(#8621): Tackle this properly when we handle L1 Re-orgs.
+                // await this.store.setCheckpointSynchedL1BlockNumber(currentL1BlockNumber);
+                this.log.debug(`No checkpoints to retrieve from ${blocksSynchedTo + 1n} to ${currentL1BlockNumber}`);
+                return rollupStatus;
+            }
+            const localPendingCheckpointInChain = archiveForLocalPendingCheckpointNumber.equals(localPendingCheckpoint.archive.root);
+            if (!localPendingCheckpointInChain) {
+                // If our local pending checkpoint tip is not in the chain on L1 a "prune" must have happened
+                // or the L1 have reorged.
+                // In any case, we have to figure out how far into the past the action will take us.
+                // For simplicity here, we will simply rewind until we end in a checkpoint that is also on the chain on L1.
+                this.log.debug(`L2 prune has been detected due to local pending checkpoint ${localPendingCheckpointNumber} not in chain`, {
+                    localPendingCheckpointNumber,
+                    localPendingArchiveRoot,
+                    archiveForLocalPendingCheckpointNumber
+                });
+                let tipAfterUnwind = localPendingCheckpointNumber;
+                while(true){
+                    const candidateCheckpoint = await this.store.getCheckpointData(tipAfterUnwind);
+                    if (candidateCheckpoint === undefined) {
+                        break;
+                    }
+                    const archiveAtContract = await this.rollup.archiveAt(candidateCheckpoint.checkpointNumber);
+                    this.log.trace(`Checking local checkpoint ${candidateCheckpoint.checkpointNumber} with archive ${candidateCheckpoint.archive.root}`, {
+                        archiveAtContract,
+                        archiveLocal: candidateCheckpoint.archive.root.toString()
+                    });
+                    if (archiveAtContract.equals(candidateCheckpoint.archive.root)) {
+                        break;
+                    }
+                    tipAfterUnwind--;
+                }
+                const checkpointsToRemove = localPendingCheckpointNumber - tipAfterUnwind;
+                await this.updater.removeCheckpointsAfter(CheckpointNumber(tipAfterUnwind));
+                this.log.warn(`Removed ${count(checkpointsToRemove, 'checkpoint')} after checkpoint ${tipAfterUnwind} ` + `due to mismatched checkpoint hashes at L1 block ${currentL1BlockNumber}. ` + `Updated L2 latest checkpoint is ${await this.store.getSynchedCheckpointNumber()}.`);
+            }
+        }
+        // Retrieve checkpoints in batches. Each batch is estimated to accommodate up to 'blockBatchSize' L1 blocks,
+        // computed using the L2 block time vs the L1 block time.
+        let searchStartBlock = blocksSynchedTo;
+        let searchEndBlock = blocksSynchedTo;
+        let lastRetrievedCheckpoint;
+        let lastL1BlockWithCheckpoint = undefined;
+        do {
+            [searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, currentL1BlockNumber);
+            this.log.trace(`Retrieving checkpoints from L1 block ${searchStartBlock} to ${searchEndBlock}`);
+            // First fetch calldata only, no blobs yet, since we may be able to just get that data out of the proposed chain
+            const calldataCheckpoints = await execInSpan(this.tracer, 'Archiver.retrieveCheckpointCalldataFromRollup', ()=>retrieveCheckpointCalldataFromRollup(this.rollup, this.publicClient, this.debugClient, searchStartBlock, searchEndBlock, this.instrumentation, this.log));
+            if (calldataCheckpoints.length === 0) {
+                // We are not calling `setBlockSynchedL1BlockNumber` because it may cause sync issues if based off infura.
+                // See further details in earlier comments.
+                this.log.trace(`Retrieved no new checkpoints from L1 block ${searchStartBlock} to ${searchEndBlock}`);
+                continue;
+            }
+            this.log.debug(`Retrieved ${calldataCheckpoints.length} new checkpoint calldata between L1 blocks ${searchStartBlock} and ${searchEndBlock}`, {
+                lastProcessedCheckpoint: calldataCheckpoints[calldataCheckpoints.length - 1].l1,
+                searchStartBlock,
+                searchEndBlock
+            });
+            // Check if the last checkpoint matches a local pending entry (so we can skip blob fetch).
+            // We only check the last one; if it matches, the blob fetch is skipped for that entry.
+            // TODO(palla/pipelining): We may have more than a single checkpoint to promote
+            const lastCalldataCheckpoint = calldataCheckpoints[calldataCheckpoints.length - 1];
+            const promoteResult = await this.tryBuildPublishedCheckpointFromProposed(lastCalldataCheckpoint);
+            const checkpointToPromote = promoteResult && !('diverged' in promoteResult) ? promoteResult : undefined;
+            const evictProposedFrom = promoteResult && 'diverged' in promoteResult ? promoteResult.fromCheckpointNumber : undefined;
+            // Then fetch blobs in parallel and build the full published checkpoints
+            const toFetchBlobs = checkpointToPromote ? calldataCheckpoints.slice(0, -1) : calldataCheckpoints;
+            const blobFetched = await asyncPool(10, toFetchBlobs, async (checkpoint)=>retrievedToPublishedCheckpoint({
+                    ...checkpoint,
+                    checkpointBlobData: await getCheckpointBlobDataFromBlobs(this.blobClient, checkpoint.l1.blockHash, checkpoint.blobHashes, checkpoint.checkpointNumber, this.log, !initialSyncComplete, checkpoint.parentBeaconBlockRoot, checkpoint.l1.timestamp)
+                }));
+            // And add the promoted checkpoint to the list of all checkpoints
+            const publishedCheckpoints = checkpointToPromote ? [
+                ...blobFetched,
+                checkpointToPromote
+            ] : blobFetched;
+            const validCheckpoints = [];
+            // Now loop through all checkpoints and validate their attestations
+            for (const published of publishedCheckpoints){
+                const validationResult = this.config.skipValidateCheckpointAttestations ? {
+                    valid: true
+                } : await validateCheckpointAttestations(published, this.epochCache, this.l1Constants, this.getSignatureContext(), this.log);
+                // Only update the validation result if it has changed, so we can keep track of the first invalid checkpoint
+                // in case there is a sequence of more than one invalid checkpoint, as we need to invalidate the first one.
+                // There is an exception though: if a checkpoint is invalidated and replaced with another invalid checkpoint,
+                // we need to update the validation result, since we need to be able to invalidate the new one.
+                // See test 'chain progresses if an invalid checkpoint is invalidated with an invalid one' for more info.
+                if (rollupStatus.validationResult?.valid !== validationResult.valid || !rollupStatus.validationResult.valid && !validationResult.valid && rollupStatus.validationResult.checkpoint.checkpointNumber === validationResult.checkpoint.checkpointNumber) {
+                    rollupStatus.validationResult = validationResult;
+                }
+                if (!validationResult.valid) {
+                    this.log.warn(`Skipping checkpoint ${published.checkpoint.number} due to invalid attestations`, {
+                        checkpointHash: published.checkpoint.hash(),
+                        l1BlockNumber: published.l1.blockNumber,
+                        ...pick(validationResult, 'reason')
+                    });
+                    // Emit event for invalid checkpoint detection
+                    this.events.emit(L2BlockSourceEvents.InvalidAttestationsCheckpointDetected, {
+                        type: L2BlockSourceEvents.InvalidAttestationsCheckpointDetected,
+                        validationResult
+                    });
+                    continue;
+                }
+                // Check the inHash of the checkpoint against the l1->l2 messages.
+                // The messages should've been synced up to the currentL1BlockNumber and must be available for the published
+                // checkpoints we just retrieved.
+                const l1ToL2Messages = await this.store.getL1ToL2Messages(published.checkpoint.number);
+                const computedInHash = computeInHashFromL1ToL2Messages(l1ToL2Messages);
+                const publishedInHash = published.checkpoint.header.inHash;
+                if (!computedInHash.equals(publishedInHash)) {
+                    this.log.fatal(`Mismatch inHash for checkpoint ${published.checkpoint.number}`, {
+                        checkpointHash: published.checkpoint.hash(),
+                        l1BlockNumber: published.l1.blockNumber,
+                        computedInHash,
+                        publishedInHash
+                    });
+                    // Throwing an error since this is most likely caused by a bug.
+                    throw new Error(`Mismatch inHash for checkpoint ${published.checkpoint.number}. Expected ${computedInHash} but got ${publishedInHash}`);
+                }
+                validCheckpoints.push(published);
+                this.log.debug(`Ingesting new checkpoint ${published.checkpoint.number} with ${published.checkpoint.blocks.length} blocks`, {
+                    checkpointHash: published.checkpoint.hash(),
+                    l1BlockNumber: published.l1.blockNumber,
+                    ...published.checkpoint.header.toInspect(),
+                    blocks: published.checkpoint.blocks.map((b)=>b.getStats())
+                });
+            }
+            for (const published of validCheckpoints){
+                this.instrumentation.processCheckpointL1Timing({
+                    slotNumber: published.checkpoint.header.slotNumber,
+                    l1Timestamp: published.l1.timestamp,
+                    l1Constants: this.l1Constants
+                });
+            }
+            try {
+                const updatedValidationResult = rollupStatus.validationResult === initialValidationResult ? undefined : rollupStatus.validationResult;
+                // Split valid checkpoints: the promoted one (if any) is persisted via the proposed-promotion path,
+                // the rest via addCheckpoints. Both paths run within the same store transaction for atomicity.
+                const [[maybeValidCheckpointToPromote], checkpointsToAdd] = partition(validCheckpoints, (c)=>c.checkpoint.number === checkpointToPromote?.checkpoint.number);
+                const [processDuration, result] = await elapsed(()=>execInSpan(this.tracer, 'Archiver.addCheckpoints', ()=>this.updater.addCheckpoints(checkpointsToAdd, updatedValidationResult, maybeValidCheckpointToPromote && {
+                            l1: lastCalldataCheckpoint.l1,
+                            attestations: lastCalldataCheckpoint.attestations,
+                            checkpoint: maybeValidCheckpointToPromote
+                        }, evictProposedFrom)));
+                if (checkpointsToAdd.length > 0) {
+                    this.instrumentation.processNewCheckpointedBlocks(processDuration / checkpointsToAdd.length, checkpointsToAdd.flatMap((c)=>c.checkpoint.blocks));
+                }
+                // If blocks were pruned due to conflict with L1 checkpoints, emit event
+                if (result.prunedBlocks && result.prunedBlocks.length > 0) {
+                    const prunedCheckpointNumber = result.prunedBlocks[0].checkpointNumber;
+                    const prunedSlotNumber = result.prunedBlocks[0].header.globalVariables.slotNumber;
+                    this.log.info(`Pruned ${result.prunedBlocks.length} mismatching blocks for checkpoint ${prunedCheckpointNumber}`, {
+                        prunedBlocks: result.prunedBlocks.map((b)=>b.toBlockInfo()),
+                        prunedSlotNumber,
+                        prunedCheckpointNumber
+                    });
+                    // Emit event for listening services to react to the prune.
+                    // Note: slotNumber comes from the first pruned block. If pruned blocks theoretically spanned multiple slots,
+                    // only one slot number would be reported (though in practice all blocks in a checkpoint span a single slot).
+                    this.events.emit(L2BlockSourceEvents.L2PruneUncheckpointed, {
+                        type: L2BlockSourceEvents.L2PruneUncheckpointed,
+                        slotNumber: prunedSlotNumber,
+                        blocks: result.prunedBlocks
+                    });
+                }
+            } catch (err) {
+                if (err instanceof InitialCheckpointNumberNotSequentialError) {
+                    const { previousCheckpointNumber, newCheckpointNumber } = err;
+                    const previousCheckpoint = previousCheckpointNumber ? await this.store.getCheckpointData(CheckpointNumber(previousCheckpointNumber)) : undefined;
+                    const updatedL1SyncPoint = previousCheckpoint?.l1.blockNumber ?? this.l1Constants.l1StartBlock;
+                    await this.store.setCheckpointSynchedL1BlockNumber(updatedL1SyncPoint);
+                    this.log.warn(`Attempting to insert checkpoint ${newCheckpointNumber} with previous block ${previousCheckpointNumber}. Rolling back L1 sync point to ${updatedL1SyncPoint} to try and fetch the missing blocks.`, {
+                        previousCheckpointNumber,
+                        newCheckpointNumber,
+                        updatedL1SyncPoint
+                    });
+                }
+                throw err;
+            }
+            for (const checkpoint of validCheckpoints){
+                this.log.info(`Downloaded checkpoint ${checkpoint.checkpoint.number}`, {
+                    checkpointHash: checkpoint.checkpoint.hash(),
+                    checkpointNumber: checkpoint.checkpoint.number,
+                    blockCount: checkpoint.checkpoint.blocks.length,
+                    txCount: checkpoint.checkpoint.blocks.reduce((acc, b)=>acc + b.body.txEffects.length, 0),
+                    header: checkpoint.checkpoint.header.toInspect(),
+                    archiveRoot: checkpoint.checkpoint.archive.root.toString(),
+                    archiveNextLeafIndex: checkpoint.checkpoint.archive.nextAvailableLeafIndex
+                });
+            }
+            lastRetrievedCheckpoint = validCheckpoints.at(-1) ?? lastRetrievedCheckpoint;
+            lastL1BlockWithCheckpoint = calldataCheckpoints.at(-1)?.l1.blockNumber ?? lastL1BlockWithCheckpoint;
+        }while (searchEndBlock < currentL1BlockNumber)
+        // Important that we update AFTER inserting the blocks.
+        await updateProvenCheckpoint();
+        return {
+            ...rollupStatus,
+            lastRetrievedCheckpoint,
+            lastL1BlockWithCheckpoint
+        };
+    }
+    /**
+   * Checks if a specific checkpoint matches a local pending entry, and if so, loads local data to build
+   * a synthetic published checkpoint (skipping blob fetch).
+   *
+   * Returns { diverged: true, fromCheckpointNumber } when the L1 checkpoint does NOT match local pending
+   * data for that number, so the caller can evict the entire pending suffix >= fromCheckpointNumber
+   * (those entries chain off the now-invalid local state) within the same addCheckpoints transaction.
+   */ async tryBuildPublishedCheckpointFromProposed(calldataCheckpoint) {
+        if (this.config.skipPromoteProposedCheckpointDuringL1Sync || !calldataCheckpoint) {
+            return undefined;
+        }
+        // Look up the specific pending entry for the checkpoint being mined, not just the tip
+        const proposed = await this.store.getProposedCheckpointByNumber(calldataCheckpoint.checkpointNumber);
+        if (!proposed) {
+            return undefined;
+        }
+        if (!proposed.header.equals(calldataCheckpoint.header) || !proposed.archive.root.equals(calldataCheckpoint.archiveRoot)) {
+            this.log.warn(`Local proposed checkpoint ${proposed.checkpointNumber} does not match checkpoint retrieved from L1, overriding with L1 data`, {
+                proposedCheckpointNumber: proposed.checkpointNumber,
+                proposedHeader: proposed.header.toInspect(),
+                proposedArchiveRoot: proposed.archive.root.toString(),
+                calldataCheckpointNumber: calldataCheckpoint.checkpointNumber,
+                calldataHeader: calldataCheckpoint.header.toInspect(),
+                calldataArchiveRoot: calldataCheckpoint.archiveRoot.toString()
+            });
+            // Return a divergence signal so the caller can evict pending >= this number
+            return {
+                diverged: true,
+                fromCheckpointNumber: proposed.checkpointNumber
+            };
+        }
+        this.log.debug(`Building published checkpoint from proposed ${calldataCheckpoint.checkpointNumber} (skipping blob fetch)`, {
+            proposedHeader: proposed.header.toInspect(),
+            proposedArchiveRoot: proposed.archive.root.toString()
+        });
+        const blocks = await this.store.getBlocks(BlockNumber(proposed.startBlock), proposed.blockCount);
+        if (blocks.length !== proposed.blockCount) {
+            this.log.warn(`Local proposed checkpoint ${proposed.checkpointNumber} has wrong block count (expected ${proposed.blockCount} blocks starting at ${proposed.startBlock} but got ${blocks.length})`, {
+                proposedCheckpointNumber: proposed.checkpointNumber,
+                proposedStartBlock: proposed.startBlock,
+                proposedBlockCount: proposed.blockCount,
+                retrievedBlocks: blocks.map((b)=>b.number)
+            });
+            return undefined;
+        }
+        const checkpoint = Checkpoint.from({
+            archive: proposed.archive,
+            header: proposed.header,
+            blocks,
+            number: proposed.checkpointNumber,
+            feeAssetPriceModifier: proposed.feeAssetPriceModifier
+        });
+        const promotedCheckpoint = PublishedCheckpoint.from({
+            checkpoint,
+            l1: calldataCheckpoint.l1,
+            attestations: calldataCheckpoint.attestations
+        });
+        this.instrumentation.processCheckpointPromoted();
+        return promotedCheckpoint;
+    }
+    async checkForNewCheckpointsBeforeL1SyncPoint(status, blocksSynchedTo, currentL1BlockNumber) {
+        const { lastRetrievedCheckpoint, pendingCheckpointNumber } = status;
+        // Compare the last checkpoint we have (either retrieved in this round or loaded from store) with what the
+        // rollup contract told us was the latest one (pinned at the currentL1BlockNumber).
+        const latestLocalCheckpointNumber = lastRetrievedCheckpoint?.checkpoint.number ?? await this.store.getSynchedCheckpointNumber();
+        if (latestLocalCheckpointNumber < pendingCheckpointNumber) {
+            // Here we have consumed all logs until the `currentL1Block` we pinned at the beginning of the archiver loop,
+            // but still haven't reached the pending checkpoint according to the call to the rollup contract.
+            // We suspect an L1 reorg that added checkpoints *behind* us. If that is the case, it must have happened between
+            // the last checkpoint we saw and the current one, so we reset the last synched L1 block number. In the edge case
+            // we don't have one, we go back 2 L1 epochs, which is the deepest possible reorg (assuming Casper is working).
+            let latestLocalCheckpointArchive = undefined;
+            let targetL1BlockNumber = maxBigint(currentL1BlockNumber - 64n, 0n);
+            if (lastRetrievedCheckpoint) {
+                latestLocalCheckpointArchive = lastRetrievedCheckpoint.checkpoint.archive.root.toString();
+                targetL1BlockNumber = lastRetrievedCheckpoint.l1.blockNumber;
+            } else if (latestLocalCheckpointNumber > 0) {
+                const checkpoint = await this.store.getRangeOfCheckpoints(latestLocalCheckpointNumber, 1).then(([c])=>c);
+                latestLocalCheckpointArchive = checkpoint.archive.root.toString();
+                targetL1BlockNumber = checkpoint.l1.blockNumber;
+            }
+            this.log.warn(`Failed to reach checkpoint ${pendingCheckpointNumber} at ${currentL1BlockNumber} (latest is ${latestLocalCheckpointNumber}). ` + `Rolling back last synched L1 block number to ${targetL1BlockNumber}.`, {
+                latestLocalCheckpointNumber,
+                latestLocalCheckpointArchive,
+                blocksSynchedTo,
+                currentL1BlockNumber,
+                ...status
+            });
+            await this.store.setCheckpointSynchedL1BlockNumber(targetL1BlockNumber);
+        } else {
+            this.log.trace(`No new checkpoints behind L1 sync point to retrieve.`, {
+                latestLocalCheckpointNumber,
+                pendingCheckpointNumber
+            });
+        }
+    }
+    async getCheckpointHeader(number) {
+        const checkpoint = await this.store.getCheckpointData(number);
+        if (!checkpoint) {
+            return undefined;
+        }
+        return checkpoint.header;
+    }
+}