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

package/dest/store/block_store.js

@@ -6,20 +6,21 @@ import { createLogger } from '@aztec/foundation/log';
 import { BufferReader } from '@aztec/foundation/serialize';
 import { bufferToHex } from '@aztec/foundation/string';
 import { isDefined } from '@aztec/foundation/types';
-import { Body, CheckpointedL2Block, CommitteeAttestation, L2Block, deserializeValidateCheckpointResult, serializeValidateCheckpointResult } from '@aztec/stdlib/block';
-import { L1PublishedData } from '@aztec/stdlib/checkpoint';
+import { BlockHash, Body, CheckpointedL2Block, CommitteeAttestation, L2Block, deserializeValidateCheckpointResult, serializeValidateCheckpointResult } from '@aztec/stdlib/block';
+import { Checkpoint, L1PublishedData } from '@aztec/stdlib/checkpoint';
 import { getEpochAtSlot } from '@aztec/stdlib/epoch-helpers';
 import { CheckpointHeader } from '@aztec/stdlib/rollup';
 import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
 import { BlockHeader, TxHash, TxReceipt, TxStatus, deserializeIndexedTxEffect, serializeIndexedTxEffect } from '@aztec/stdlib/tx';
-import { BlockAlreadyCheckpointedError, BlockArchiveNotConsistentError, BlockIndexNotSequentialError, BlockNotFoundError, BlockNumberNotSequentialError, CannotOverwriteCheckpointedBlockError, CheckpointNotFoundError, CheckpointNumberNotSequentialError, InitialCheckpointNumberNotSequentialError } from '../errors.js';
+import { BlockAlreadyCheckpointedError, BlockArchiveNotConsistentError, BlockCheckpointNumberNotSequentialError, BlockIndexNotSequentialError, BlockNotFoundError, BlockNumberNotSequentialError, CannotOverwriteCheckpointedBlockError, CheckpointNotFoundError, CheckpointNumberNotSequentialError, InitialCheckpointNumberNotSequentialError, NoProposedCheckpointToPromoteError, ProposedCheckpointArchiveRootMismatchError, ProposedCheckpointNotSequentialError, ProposedCheckpointPromotionNotSequentialError } from '../errors.js';
 export { TxReceipt } from '@aztec/stdlib/tx';
 /**
  * LMDB-based block storage for the archiver.
  */ export class BlockStore {
     db;
     /** Map block number to block data */ #blocks;
-    /** Map checkpoint number to checkpoint data */ #checkpoints;
+    /** Map keyed by checkpoint number holding proposed (locally-validated, not yet L1-confirmed) checkpoints. */ #proposedCheckpoints;
+    /** Map checkpoint number to checkpoint data for mined checkpoints only */ #checkpoints;
     /** Map slot number to checkpoint number, for looking up checkpoints by slot range. */ #slotToCheckpoint;
     /** Map block hash to list of tx hashes */ #blockTxs;
     /** Tx hash to serialized IndexedTxEffect */ #txEffects;
@@ -46,6 +47,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
         this.#pendingChainValidationStatus = db.openSingleton('archiver_pending_chain_validation_status');
         this.#checkpoints = db.openMap('archiver_checkpoints');
         this.#slotToCheckpoint = db.openMap('archiver_slot_to_checkpoint');
+        this.#proposedCheckpoints = db.openMap('archiver_proposed_checkpoints');
     }
     /**
    * Returns the finalized L2 block number. An L2 block is finalized when it was proven
@@ -75,8 +77,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
             const blockIndex = block.indexWithinCheckpoint;
             const blockLastArchive = block.header.lastArchive.root;
             // Extract the latest block and checkpoint numbers
-            const previousBlockNumber = await this.getLatestBlockNumber();
-            const previousCheckpointNumber = await this.getLatestCheckpointNumber();
+            const previousBlockNumber = await this.getLatestL2BlockNumber();
+            const latestCheckpointNumber = await this.getLatestCheckpointNumber();
             // Verify we're not overwriting checkpointed blocks
             const lastCheckpointedBlockNumber = await this.getCheckpointedL2BlockNumber();
             if (!opts.force && blockNumber <= lastCheckpointedBlockNumber) {
@@ -91,9 +93,17 @@ export { TxReceipt } from '@aztec/stdlib/tx';
             if (!opts.force && previousBlockNumber !== blockNumber - 1) {
                 throw new BlockNumberNotSequentialError(blockNumber, previousBlockNumber);
             }
-            // The same check as above but for checkpoints
-            if (!opts.force && previousCheckpointNumber !== blockCheckpointNumber - 1) {
-                throw new CheckpointNumberNotSequentialError(blockCheckpointNumber, previousCheckpointNumber);
+            // Accept the block if either the confirmed checkpoint or a pending checkpoint matches
+            // the expected predecessor. We look for a pending entry at exactly blockCheckpointNumber - 1.
+            const expectedCheckpointNumber = blockCheckpointNumber - 1;
+            const hasPendingAtExpected = await this.#proposedCheckpoints.hasAsync(expectedCheckpointNumber);
+            if (!opts.force && latestCheckpointNumber !== expectedCheckpointNumber && !hasPendingAtExpected) {
+                const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({
+                    reverse: true,
+                    limit: 1
+                }));
+                const previous = CheckpointNumber(Math.max(latestCheckpointNumber, latestPendingKey ?? 0));
+                throw new BlockCheckpointNumberNotSequentialError(blockNumber, blockCheckpointNumber, previous);
             }
             // Extract the previous block if there is one and see if it is for the same checkpoint or not
             const previousBlockResult = await this.getBlock(previousBlockNumber);
@@ -118,7 +128,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
         });
     }
     /**
-   * Append new cheskpoints to the store's list.
+   * Append new checkpoints to the store's list.
    * @param checkpoints - The L2 checkpoints to be added to the store.
    * @returns True if the operation is successful.
    */ async addCheckpoints(checkpoints, opts = {}) {
@@ -126,32 +136,26 @@ export { TxReceipt } from '@aztec/stdlib/tx';
             return true;
         }
         return await this.db.transactionAsync(async ()=>{
-            // Check that the checkpoint immediately before the first block to be added is present in the store.
             const firstCheckpointNumber = checkpoints[0].checkpoint.number;
             const previousCheckpointNumber = await this.getLatestCheckpointNumber();
-            if (previousCheckpointNumber !== firstCheckpointNumber - 1 && !opts.force) {
-                throw new InitialCheckpointNumberNotSequentialError(firstCheckpointNumber, previousCheckpointNumber);
-            }
-            // Extract the previous checkpoint if there is one
-            let previousCheckpointData = undefined;
-            if (previousCheckpointNumber !== INITIAL_CHECKPOINT_NUMBER - 1) {
-                // There should be a previous checkpoint
-                previousCheckpointData = await this.getCheckpointData(previousCheckpointNumber);
-                if (previousCheckpointData === undefined) {
-                    throw new CheckpointNotFoundError(previousCheckpointNumber);
+            // Handle already-stored checkpoints at the start of the batch.
+            // This can happen after an L1 reorg re-includes a checkpoint in a different L1 block.
+            // We accept them if archives match (same content) and update their L1 metadata.
+            if (!opts.force && firstCheckpointNumber <= previousCheckpointNumber) {
+                checkpoints = await this.skipOrUpdateAlreadyStoredCheckpoints(checkpoints, previousCheckpointNumber);
+                if (checkpoints.length === 0) {
+                    return true;
                 }
-            }
-            let previousBlockNumber = undefined;
-            let previousBlock = undefined;
-            // If we have a previous checkpoint then we need to get the previous block number
-            if (previousCheckpointData !== undefined) {
-                previousBlockNumber = BlockNumber(previousCheckpointData.startBlock + previousCheckpointData.blockCount - 1);
-                previousBlock = await this.getBlock(previousBlockNumber);
-                if (previousBlock === undefined) {
-                    // We should be able to get the required previous block
-                    throw new BlockNotFoundError(previousBlockNumber);
+                // Re-check sequentiality after skipping
+                const newFirstNumber = checkpoints[0].checkpoint.number;
+                if (previousCheckpointNumber !== newFirstNumber - 1) {
+                    throw new InitialCheckpointNumberNotSequentialError(newFirstNumber, previousCheckpointNumber);
                 }
+            } else if (previousCheckpointNumber !== firstCheckpointNumber - 1 && !opts.force) {
+                throw new InitialCheckpointNumberNotSequentialError(firstCheckpointNumber, previousCheckpointNumber);
             }
+            // Get the last block of the previous checkpoint for archive chaining
+            let previousBlock = await this.getPreviousCheckpointBlock(checkpoints[0].checkpoint.number);
             // Iterate over checkpoints array and insert them, checking that the block numbers are sequential.
             let previousCheckpoint = undefined;
             for (const checkpoint of checkpoints){
@@ -159,33 +163,13 @@ export { TxReceipt } from '@aztec/stdlib/tx';
                     throw new CheckpointNumberNotSequentialError(checkpoint.checkpoint.number, previousCheckpoint.checkpoint.number);
                 }
                 previousCheckpoint = checkpoint;
-                // Store every block in the database. the block may already exist, but this has come from chain and is assumed to be correct.
+                // Validate block sequencing, indexes, and archive chaining
+                this.validateCheckpointBlocks(checkpoint.checkpoint.blocks, previousBlock);
+                // Store every block in the database (may already exist, but L1 data is authoritative)
                 for(let i = 0; i < checkpoint.checkpoint.blocks.length; i++){
-                    const block = checkpoint.checkpoint.blocks[i];
-                    if (previousBlock) {
-                        // The blocks should have a sequential block number
-                        if (previousBlock.number !== block.number - 1) {
-                            throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
-                        }
-                        // If the blocks are for the same checkpoint then they should have sequential indexes
-                        if (previousBlock.checkpointNumber === block.checkpointNumber && previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
-                            throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
-                        }
-                        if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
-                            throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
-                        }
-                    } else {
-                        // No previous block, must be block 1 at checkpoint index 0
-                        if (block.indexWithinCheckpoint !== 0) {
-                            throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
-                        }
-                        if (block.number !== INITIAL_L2_BLOCK_NUM) {
-                            throw new BlockNumberNotSequentialError(block.number, undefined);
-                        }
-                    }
-                    previousBlock = block;
-                    await this.addBlockToDatabase(block, checkpoint.checkpoint.number, i);
+                    await this.addBlockToDatabase(checkpoint.checkpoint.blocks[i], checkpoint.checkpoint.number, i);
                 }
+                previousBlock = checkpoint.checkpoint.blocks.at(-1);
                 // Store the checkpoint in the database
                 await this.#checkpoints.set(checkpoint.checkpoint.number, {
                     header: checkpoint.checkpoint.header.toBuffer(),
@@ -195,15 +179,102 @@ export { TxReceipt } from '@aztec/stdlib/tx';
                     attestations: checkpoint.attestations.map((attestation)=>attestation.toBuffer()),
                     checkpointNumber: checkpoint.checkpoint.number,
                     startBlock: checkpoint.checkpoint.blocks[0].number,
-                    blockCount: checkpoint.checkpoint.blocks.length
+                    blockCount: checkpoint.checkpoint.blocks.length,
+                    feeAssetPriceModifier: checkpoint.checkpoint.feeAssetPriceModifier.toString()
                 });
                 // Update slot-to-checkpoint index
                 await this.#slotToCheckpoint.set(checkpoint.checkpoint.header.slotNumber, checkpoint.checkpoint.number);
+                // Remove proposed checkpoint if it exists, since L1 is authoritative
+                await this.#proposedCheckpoints.delete(checkpoint.checkpoint.number);
             }
             await this.#lastSynchedL1Block.set(checkpoints[checkpoints.length - 1].l1.blockNumber);
             return true;
         });
     }
+    /**
+   * Handles checkpoints at the start of a batch that are already stored (e.g. due to L1 reorg).
+   * Verifies the archive root matches, updates L1 metadata, and returns only the new checkpoints.
+   */ async skipOrUpdateAlreadyStoredCheckpoints(checkpoints, latestStored) {
+        let i = 0;
+        for(; i < checkpoints.length && checkpoints[i].checkpoint.number <= latestStored; i++){
+            const incoming = checkpoints[i];
+            const stored = await this.getCheckpointData(incoming.checkpoint.number);
+            if (!stored) {
+                break;
+            }
+            // Verify the checkpoint content matches (archive root)
+            if (!stored.archive.root.equals(incoming.checkpoint.archive.root)) {
+                throw new Error(`Checkpoint ${incoming.checkpoint.number} already exists in store but with a different archive root. ` + `Stored: ${stored.archive.root}, incoming: ${incoming.checkpoint.archive.root}`);
+            }
+            // Update L1 metadata and attestations for the already-stored checkpoint
+            this.#log.warn(`Checkpoint ${incoming.checkpoint.number} already stored, updating L1 info ` + `(L1 block ${stored.l1.blockNumber} -> ${incoming.l1.blockNumber})`);
+            await this.#checkpoints.set(incoming.checkpoint.number, {
+                header: incoming.checkpoint.header.toBuffer(),
+                archive: incoming.checkpoint.archive.toBuffer(),
+                checkpointOutHash: incoming.checkpoint.getCheckpointOutHash().toBuffer(),
+                l1: incoming.l1.toBuffer(),
+                attestations: incoming.attestations.map((a)=>a.toBuffer()),
+                checkpointNumber: incoming.checkpoint.number,
+                startBlock: incoming.checkpoint.blocks[0].number,
+                blockCount: incoming.checkpoint.blocks.length,
+                feeAssetPriceModifier: incoming.checkpoint.feeAssetPriceModifier.toString()
+            });
+            // Update the sync point to reflect the new L1 block
+            await this.#lastSynchedL1Block.set(incoming.l1.blockNumber);
+        }
+        return checkpoints.slice(i);
+    }
+    /**
+   * Gets the last block of the checkpoint before the given one.
+   * Returns undefined if there is no previous checkpoint (i.e. genesis).
+   */ async getPreviousCheckpointBlock(checkpointNumber) {
+        const previousCheckpointNumber = CheckpointNumber(checkpointNumber - 1);
+        if (previousCheckpointNumber === INITIAL_CHECKPOINT_NUMBER - 1) {
+            return undefined;
+        }
+        // Check across both proposed and mined checkpoints
+        const predecessor = await this.getProposedCheckpointByNumber(previousCheckpointNumber) ?? await this.getCheckpointData(previousCheckpointNumber);
+        if (!predecessor) {
+            throw new CheckpointNotFoundError(previousCheckpointNumber);
+        }
+        const previousBlockNumber = BlockNumber(predecessor.startBlock + predecessor.blockCount - 1);
+        const previousBlock = await this.getBlock(previousBlockNumber);
+        if (previousBlock === undefined) {
+            throw new BlockNotFoundError(previousBlockNumber);
+        }
+        return previousBlock;
+    }
+    /**
+   * Validates that blocks are sequential, have correct indexes, and chain via archive roots.
+   * This is the same validation used for both confirmed checkpoints (addCheckpoints) and
+   * proposed checkpoints (addProposedCheckpoint).
+   */ validateCheckpointBlocks(blocks, previousBlock) {
+        for (const block of blocks){
+            if (previousBlock) {
+                if (previousBlock.number !== block.number - 1) {
+                    throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
+                }
+                if (previousBlock.checkpointNumber === block.checkpointNumber) {
+                    if (previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
+                        throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
+                    }
+                } else if (block.indexWithinCheckpoint !== 0) {
+                    throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
+                }
+                if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
+                    throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
+                }
+            } else {
+                if (block.indexWithinCheckpoint !== 0) {
+                    throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
+                }
+                if (block.number !== INITIAL_L2_BLOCK_NUM) {
+                    throw new BlockNumberNotSequentialError(block.number, undefined);
+                }
+            }
+            previousBlock = block;
+        }
+    }
     async addBlockToDatabase(block, checkpointNumber, indexWithinCheckpoint) {
         const blockHash = await block.hash();
         await this.#blocks.set(block.number, {
@@ -281,6 +352,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
                 await this.#checkpoints.delete(c);
                 this.#log.debug(`Removed checkpoint ${c}`);
             }
+            // Evict all pending checkpoints > checkpointNumber (their base chain no longer exists)
+            await this.evictProposedCheckpointsFrom(CheckpointNumber(checkpointNumber + 1));
             return {
                 blocksRemoved
             };
@@ -325,6 +398,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
             checkpointNumber: CheckpointNumber(checkpointStorage.checkpointNumber),
             startBlock: BlockNumber(checkpointStorage.startBlock),
             blockCount: checkpointStorage.blockCount,
+            feeAssetPriceModifier: BigInt(checkpointStorage.feeAssetPriceModifier),
             l1: L1PublishedData.fromBuffer(checkpointStorage.l1),
             attestations: checkpointStorage.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf))
         };
@@ -373,7 +447,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
         return await this.db.transactionAsync(async ()=>{
             const removedBlocks = [];
             // Get the latest block number to determine the range
-            const latestBlockNumber = await this.getLatestBlockNumber();
+            const latestBlockNumber = await this.getLatestL2BlockNumber();
             // Iterate from blockNumber + 1 to latestBlockNumber
             for(let bn = blockNumber + 1; bn <= latestBlockNumber; bn++){
                 const block = await this.getBlock(BlockNumber(bn));
@@ -400,13 +474,6 @@ export { TxReceipt } from '@aztec/stdlib/tx';
             return BlockNumber(checkpointStorage.startBlock + checkpointStorage.blockCount - 1);
         }
     }
-    async getLatestBlockNumber() {
-        const [latestBlocknumber] = await toArray(this.#blocks.keysAsync({
-            reverse: true,
-            limit: 1
-        }));
-        return typeof latestBlocknumber === 'number' ? BlockNumber(latestBlocknumber) : BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
-    }
     async getLatestCheckpointNumber() {
         const [latestCheckpointNumber] = await toArray(this.#checkpoints.keysAsync({
             reverse: true,
@@ -417,6 +484,142 @@ export { TxReceipt } from '@aztec/stdlib/tx';
         }
         return CheckpointNumber(latestCheckpointNumber);
     }
+    async hasProposedCheckpoint() {
+        const [key] = await toArray(this.#proposedCheckpoints.keysAsync({
+            limit: 1
+        }));
+        return key !== undefined;
+    }
+    /** Deletes all pending proposed checkpoints from storage. */ async deleteProposedCheckpoints() {
+        for await (const key of this.#proposedCheckpoints.keysAsync()){
+            await this.#proposedCheckpoints.delete(key);
+        }
+    }
+    /**
+   * Promotes a specific pending checkpoint to a confirmed checkpoint entry.
+   * This persists the checkpoint to the store, removes only that pending entry, and updates the L1 sync point.
+   * Remaining pending entries (e.g. N+1, N+2) are left intact — they chain off the just-promoted one.
+   * @param checkpointNumber - The checkpoint number to promote.
+   * @param l1 - L1 published data for the checkpoint.
+   * @param attestations - Committee attestations.
+   * @param expectedArchiveRoot - Archive root guard against races.
+   */ async promoteProposedToCheckpointed(checkpointNumber, l1, attestations, expectedArchiveRoot) {
+        return await this.db.transactionAsync(async ()=>{
+            const proposed = await this.getProposedCheckpointByNumber(checkpointNumber);
+            if (!proposed) {
+                throw new NoProposedCheckpointToPromoteError();
+            }
+            if (!proposed.archive.root.equals(expectedArchiveRoot)) {
+                throw new ProposedCheckpointArchiveRootMismatchError(expectedArchiveRoot, proposed.archive.root);
+            }
+            // Verify sequentiality: promoted checkpoint must follow the latest confirmed one
+            const latestCheckpointNumber = await this.getLatestCheckpointNumber();
+            if (latestCheckpointNumber !== proposed.checkpointNumber - 1) {
+                throw new ProposedCheckpointPromotionNotSequentialError(proposed.checkpointNumber, latestCheckpointNumber);
+            }
+            // Write the checkpoint entry
+            await this.#checkpoints.set(proposed.checkpointNumber, {
+                header: proposed.header.toBuffer(),
+                archive: proposed.archive.toBuffer(),
+                checkpointOutHash: proposed.checkpointOutHash.toBuffer(),
+                l1: l1.toBuffer(),
+                attestations: attestations.map((attestation)=>attestation.toBuffer()),
+                checkpointNumber: proposed.checkpointNumber,
+                startBlock: proposed.startBlock,
+                blockCount: proposed.blockCount,
+                feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString()
+            });
+            // Update the slot-to-checkpoint index
+            await this.#slotToCheckpoint.set(proposed.header.slotNumber, proposed.checkpointNumber);
+            // Remove only this pending entry — remaining entries N+1, N+2, ... stay valid
+            await this.#proposedCheckpoints.delete(proposed.checkpointNumber);
+            // Update the last synced L1 block
+            await this.#lastSynchedL1Block.set(l1.blockNumber);
+        });
+    }
+    /**
+   * Returns the latest pending checkpoint (highest-numbered entry), or undefined if none.
+   * No fallback to confirmed.
+   */ async getLastProposedCheckpoint() {
+        const [key] = await toArray(this.#proposedCheckpoints.keysAsync({
+            reverse: true,
+            limit: 1
+        }));
+        if (key === undefined) {
+            return undefined;
+        }
+        const stored = await this.#proposedCheckpoints.getAsync(key);
+        return stored ? this.convertToProposedCheckpointData(stored) : undefined;
+    }
+    /** Returns the pending checkpoint for a specific checkpoint number, or undefined if not found. */ async getProposedCheckpointByNumber(n) {
+        const stored = await this.#proposedCheckpoints.getAsync(n);
+        return stored ? this.convertToProposedCheckpointData(stored) : undefined;
+    }
+    /** Returns all pending checkpoints in ascending checkpoint-number order. */ async getProposedCheckpoints() {
+        const results = [];
+        for await (const [, stored] of this.#proposedCheckpoints.entriesAsync()){
+            results.push(this.convertToProposedCheckpointData(stored));
+        }
+        return results;
+    }
+    /**
+   * Evicts all pending checkpoints with checkpoint number >= fromNumber.
+   * Used for divergent-mined-checkpoint cleanup: when L1 mines checkpoint N with a different archive,
+   * all pending >= N must be evicted since they chain off the now-invalid pending N.
+   */ async evictProposedCheckpointsFrom(fromNumber) {
+        const keysToDelete = [];
+        for await (const key of this.#proposedCheckpoints.keysAsync()){
+            if (key >= fromNumber) {
+                keysToDelete.push(key);
+            }
+        }
+        for (const key of keysToDelete){
+            await this.#proposedCheckpoints.delete(key);
+        }
+    }
+    /**
+   * Gets the checkpoint at the proposed tip:
+   * - latest pending checkpoint if any exist
+   * - fallsback to latest confirmed checkpoint otherwise
+   */ async getLastCheckpoint() {
+        const latest = await this.getLastProposedCheckpoint();
+        if (!latest) {
+            return this.getCheckpointData(await this.getLatestCheckpointNumber());
+        }
+        return latest;
+    }
+    convertToProposedCheckpointData(stored) {
+        return {
+            checkpointNumber: CheckpointNumber(stored.checkpointNumber),
+            header: CheckpointHeader.fromBuffer(stored.header),
+            archive: AppendOnlyTreeSnapshot.fromBuffer(stored.archive),
+            checkpointOutHash: Fr.fromBuffer(stored.checkpointOutHash),
+            startBlock: BlockNumber(stored.startBlock),
+            blockCount: stored.blockCount,
+            totalManaUsed: BigInt(stored.totalManaUsed),
+            feeAssetPriceModifier: BigInt(stored.feeAssetPriceModifier)
+        };
+    }
+    /**
+   * Attempts to get the proposedCheckpoint's number, if there is not one, then fallback to the latest confirmed checkpoint number.
+   * @returns CheckpointNumber
+   */ async getProposedCheckpointNumber() {
+        const proposed = await this.getLastCheckpoint();
+        if (!proposed) {
+            return await this.getLatestCheckpointNumber();
+        }
+        return CheckpointNumber(proposed.checkpointNumber);
+    }
+    /**
+   * Attempts to get the proposedCheckpoint's block number, if there is not one, then fallback to the checkpointed block number
+   * @returns BlockNumber
+   */ async getProposedCheckpointL2BlockNumber() {
+        const proposed = await this.getLastCheckpoint();
+        if (!proposed) {
+            return await this.getCheckpointedL2BlockNumber();
+        }
+        return BlockNumber(proposed.startBlock + proposed.blockCount - 1);
+    }
     async getCheckpointedBlock(number) {
         const blockStorage = await this.#blocks.getAsync(number);
         if (!blockStorage) {
@@ -490,6 +693,37 @@ export { TxReceipt } from '@aztec/stdlib/tx';
         return this.getBlockDataFromBlockStorage(blockStorage);
     }
     /**
+   * Gets block metadata plus checkpoint-derived context (L1 publish info, attestations) without
+   * deserializing tx bodies. When the block's containing checkpoint has not yet been L1-confirmed,
+   * `checkpoint` and `l1` are `undefined` and `attestations` is empty.
+   */ async getBlockDataWithCheckpointContext(blockNumber) {
+        const blockStorage = await this.#blocks.getAsync(blockNumber);
+        if (!blockStorage || !blockStorage.header) {
+            return undefined;
+        }
+        const data = this.getBlockDataFromBlockStorage(blockStorage);
+        const checkpointStorage = await this.#checkpoints.getAsync(blockStorage.checkpointNumber);
+        if (!checkpointStorage) {
+            return {
+                data,
+                checkpoint: undefined,
+                l1: undefined,
+                attestations: []
+            };
+        }
+        const checkpoint = this.checkpointDataFromCheckpointStorage(checkpointStorage);
+        return {
+            data,
+            checkpoint,
+            l1: checkpoint.l1,
+            attestations: checkpoint.attestations
+        };
+    }
+    /** Returns the checkpoint number that contains the given slot (or undefined if not found). */ async getCheckpointNumberBySlot(slot) {
+        const checkpointNumber = await this.#slotToCheckpoint.getAsync(slot);
+        return checkpointNumber === undefined ? undefined : CheckpointNumber(checkpointNumber);
+    }
+    /**
    * Gets block metadata (without tx data) by archive root.
    * @param archive - The archive root of the block to return.
    * @returns The requested block data.
@@ -594,7 +828,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
         return {
             header: BlockHeader.fromBuffer(blockStorage.header),
             archive: AppendOnlyTreeSnapshot.fromBuffer(blockStorage.archive),
-            blockHash: Fr.fromBuffer(blockStorage.blockHash),
+            blockHash: BlockHash.fromBuffer(blockStorage.blockHash),
             checkpointNumber: CheckpointNumber(blockStorage.checkpointNumber),
             indexWithinCheckpoint: IndexWithinCheckpoint(blockStorage.indexWithinCheckpoint)
         };
@@ -716,6 +950,47 @@ export { TxReceipt } from '@aztec/stdlib/tx';
     setSynchedL1BlockNumber(l1BlockNumber) {
         return this.#lastSynchedL1Block.set(l1BlockNumber);
     }
+    /**
+   * Adds a proposed checkpoint to the pending queue.
+   * Accepts proposed.checkpointNumber === latestTip + 1, where latestTip is the highest of
+   * confirmed and the highest pending checkpoint number.
+   * Computes archive and checkpointOutHash from the stored blocks.
+   */ async addProposedCheckpoint(proposed) {
+        return await this.db.transactionAsync(async ()=>{
+            const confirmed = await this.getLatestCheckpointNumber();
+            const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({
+                reverse: true,
+                limit: 1
+            }));
+            const latestTip = CheckpointNumber(latestPendingKey !== undefined ? Math.max(latestPendingKey, confirmed) : confirmed);
+            if (proposed.checkpointNumber !== latestTip + 1) {
+                throw new ProposedCheckpointNotSequentialError(proposed.checkpointNumber, latestTip);
+            }
+            // Ensure the predecessor block (from pending or confirmed chain) exists
+            const previousBlock = await this.getPreviousCheckpointBlock(proposed.checkpointNumber);
+            const blocks = [];
+            for(let i = 0; i < proposed.blockCount; i++){
+                const block = await this.getBlock(BlockNumber(proposed.startBlock + i));
+                if (!block) {
+                    throw new BlockNotFoundError(proposed.startBlock + i);
+                }
+                blocks.push(block);
+            }
+            this.validateCheckpointBlocks(blocks, previousBlock);
+            const archive = blocks[blocks.length - 1].archive;
+            const checkpointOutHash = Checkpoint.getCheckpointOutHash(blocks);
+            await this.#proposedCheckpoints.set(proposed.checkpointNumber, {
+                header: proposed.header.toBuffer(),
+                archive: archive.toBuffer(),
+                checkpointOutHash: checkpointOutHash.toBuffer(),
+                checkpointNumber: proposed.checkpointNumber,
+                startBlock: proposed.startBlock,
+                blockCount: proposed.blockCount,
+                totalManaUsed: proposed.totalManaUsed.toString(),
+                feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString()
+            });
+        });
+    }
     async getProvenCheckpointNumber() {
         const [latestCheckpointNumber, provenCheckpointNumber] = await Promise.all([
             this.getLatestCheckpointNumber(),

package/dest/store/contract_class_store.d.ts

@@ -1,6 +1,6 @@
 import { Fr } from '@aztec/foundation/curves/bn254';
 import type { AztecAsyncKVStore } from '@aztec/kv-store';
-import type { ContractClassPublic, ExecutablePrivateFunctionWithMembershipProof, UtilityFunctionWithMembershipProof } from '@aztec/stdlib/contract';
+import type { ContractClassPublic } from '@aztec/stdlib/contract';
 /**
  * LMDB-based contract class storage for the archiver.
  */
@@ -13,6 +13,5 @@ export declare class ContractClassStore {
     getContractClass(id: Fr): Promise<ContractClassPublic | undefined>;
     getBytecodeCommitment(id: Fr): Promise<Fr | undefined>;
     getContractClassIds(): Promise<Fr[]>;
-    addFunctions(contractClassId: Fr, newPrivateFunctions: ExecutablePrivateFunctionWithMembershipProof[], newUtilityFunctions: UtilityFunctionWithMembershipProof[]): Promise<boolean>;
 }
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY29udHJhY3RfY2xhc3Nfc3RvcmUuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9zdG9yZS9jb250cmFjdF9jbGFzc19zdG9yZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFHcEQsT0FBTyxLQUFLLEVBQUUsaUJBQWlCLEVBQWlCLE1BQU0saUJBQWlCLENBQUM7QUFFeEUsT0FBTyxLQUFLLEVBQ1YsbUJBQW1CLEVBRW5CLDRDQUE0QyxFQUM1QyxrQ0FBa0MsRUFDbkMsTUFBTSx3QkFBd0IsQ0FBQztBQUdoQzs7R0FFRztBQUNILHFCQUFhLGtCQUFrQjs7SUFJakIsT0FBTyxDQUFDLEVBQUU7SUFBdEIsWUFBb0IsRUFBRSxFQUFFLGlCQUFpQixFQUd4QztJQUVLLGdCQUFnQixDQUNwQixhQUFhLEVBQUUsbUJBQW1CLEVBQ2xDLGtCQUFrQixFQUFFLEVBQUUsRUFDdEIsV0FBVyxFQUFFLE1BQU0sR0FDbEIsT0FBTyxDQUFDLElBQUksQ0FBQyxDQVFmO0lBRUsscUJBQXFCLENBQUMsYUFBYSxFQUFFLG1CQUFtQixFQUFFLFdBQVcsRUFBRSxNQUFNLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQVFsRztJQUVLLGdCQUFnQixDQUFDLEVBQUUsRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLG1CQUFtQixHQUFHLFNBQVMsQ0FBQyxDQUd2RTtJQUVLLHFCQUFxQixDQUFDLEVBQUUsRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLEVBQUUsR0FBRyxTQUFTLENBQUMsQ0FHM0Q7SUFFSyxtQkFBbUIsSUFBSSxPQUFPLENBQUMsRUFBRSxFQUFFLENBQUMsQ0FFekM7SUFFSyxZQUFZLENBQ2hCLGVBQWUsRUFBRSxFQUFFLEVBQ25CLG1CQUFtQixFQUFFLDRDQUE0QyxFQUFFLEVBQ25FLG1CQUFtQixFQUFFLGtDQUFrQyxFQUFFLEdBQ3hELE9BQU8sQ0FBQyxPQUFPLENBQUMsQ0F5QmxCO0NBQ0YifQ==
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY29udHJhY3RfY2xhc3Nfc3RvcmUuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9zdG9yZS9jb250cmFjdF9jbGFzc19zdG9yZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFHcEQsT0FBTyxLQUFLLEVBQUUsaUJBQWlCLEVBQWlCLE1BQU0saUJBQWlCLENBQUM7QUFDeEUsT0FBTyxLQUFLLEVBQUUsbUJBQW1CLEVBQXNDLE1BQU0sd0JBQXdCLENBQUM7QUFFdEc7O0dBRUc7QUFDSCxxQkFBYSxrQkFBa0I7O0lBSWpCLE9BQU8sQ0FBQyxFQUFFO0lBQXRCLFlBQW9CLEVBQUUsRUFBRSxpQkFBaUIsRUFHeEM7SUFFSyxnQkFBZ0IsQ0FDcEIsYUFBYSxFQUFFLG1CQUFtQixFQUNsQyxrQkFBa0IsRUFBRSxFQUFFLEVBQ3RCLFdBQVcsRUFBRSxNQUFNLEdBQ2xCLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FZZjtJQUVLLHFCQUFxQixDQUFDLGFBQWEsRUFBRSxtQkFBbUIsRUFBRSxXQUFXLEVBQUUsTUFBTSxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FRbEc7SUFFSyxnQkFBZ0IsQ0FBQyxFQUFFLEVBQUUsRUFBRSxHQUFHLE9BQU8sQ0FBQyxtQkFBbUIsR0FBRyxTQUFTLENBQUMsQ0FHdkU7SUFFSyxxQkFBcUIsQ0FBQyxFQUFFLEVBQUUsRUFBRSxHQUFHLE9BQU8sQ0FBQyxFQUFFLEdBQUcsU0FBUyxDQUFDLENBRzNEO0lBRUssbUJBQW1CLElBQUksT0FBTyxDQUFDLEVBQUUsRUFBRSxDQUFDLENBRXpDO0NBQ0YifQ==

package/dest/store/contract_class_store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"contract_class_store.d.ts","sourceRoot":"","sources":["../../src/store/contract_class_store.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAGpD,OAAO,KAAK,EAAE,iBAAiB,EAAiB,MAAM,iBAAiB,CAAC;AAExE,OAAO,KAAK,EACV,mBAAmB,EAEnB,4CAA4C,EAC5C,kCAAkC,EACnC,MAAM,wBAAwB,CAAC;AAGhC;;GAEG;AACH,qBAAa,kBAAkB;;IAIjB,OAAO,CAAC,EAAE;IAAtB,YAAoB,EAAE,EAAE,iBAAiB,EAGxC;IAEK,gBAAgB,CACpB,aAAa,EAAE,mBAAmB,EAClC,kBAAkB,EAAE,EAAE,EACtB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,IAAI,CAAC,CAQf;IAEK,qBAAqB,CAAC,aAAa,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAQlG;IAEK,gBAAgB,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC,CAGvE;IAEK,qBAAqB,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG,SAAS,CAAC,CAG3D;IAEK,mBAAmB,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC,CAEzC;IAEK,YAAY,CAChB,eAAe,EAAE,EAAE,EACnB,mBAAmB,EAAE,4CAA4C,EAAE,EACnE,mBAAmB,EAAE,kCAAkC,EAAE,GACxD,OAAO,CAAC,OAAO,CAAC,CAyBlB;CACF"}
+{"version":3,"file":"contract_class_store.d.ts","sourceRoot":"","sources":["../../src/store/contract_class_store.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAGpD,OAAO,KAAK,EAAE,iBAAiB,EAAiB,MAAM,iBAAiB,CAAC;AACxE,OAAO,KAAK,EAAE,mBAAmB,EAAsC,MAAM,wBAAwB,CAAC;AAEtG;;GAEG;AACH,qBAAa,kBAAkB;;IAIjB,OAAO,CAAC,EAAE;IAAtB,YAAoB,EAAE,EAAE,iBAAiB,EAGxC;IAEK,gBAAgB,CACpB,aAAa,EAAE,mBAAmB,EAClC,kBAAkB,EAAE,EAAE,EACtB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,IAAI,CAAC,CAYf;IAEK,qBAAqB,CAAC,aAAa,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAQlG;IAEK,gBAAgB,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC,CAGvE;IAEK,qBAAqB,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG,SAAS,CAAC,CAG3D;IAEK,mBAAmB,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC,CAEzC;CACF"}