@aztec/sequencer-client 0.0.1-commit.2f68f620 → 0.0.1-commit.3100065

package/src/test/index.ts

@@ -1,16 +1,16 @@
 import type { L1TxUtils } from '@aztec/ethereum/l1-tx-utils';
 import type { PublisherManager } from '@aztec/ethereum/publisher-manager';
 import type { PublicProcessorFactory } from '@aztec/simulator/server';
+import type { ProposerTimetable } from '@aztec/stdlib/timetable';
 import type { FullNodeCheckpointsBuilder, ValidatorClient } from '@aztec/validator-client';
 
 import { SequencerClient } from '../client/sequencer-client.js';
 import type { SequencerPublisherFactory } from '../publisher/sequencer-publisher-factory.js';
 import { Sequencer } from '../sequencer/sequencer.js';
-import type { SequencerTimetable } from '../sequencer/timetable.js';
 
 class TestSequencer_ extends Sequencer {
   declare public publicProcessorFactory: PublicProcessorFactory;
-  declare public timetable: SequencerTimetable;
+  declare public timetable: ProposerTimetable;
   declare public publisherFactory: SequencerPublisherFactory;
   declare public validatorClient: ValidatorClient;
   declare public checkpointsBuilder: FullNodeCheckpointsBuilder;

package/src/test/utils.ts

@@ -8,6 +8,8 @@ import { Signature } from '@aztec/foundation/eth-signature';
 import type { P2P } from '@aztec/p2p';
 import { PublicDataWrite } from '@aztec/stdlib/avm';
 import { CommitteeAttestation, L2Block } from '@aztec/stdlib/block';
+import { DEFAULT_BLOCK_DURATION_MS } from '@aztec/stdlib/config';
+import type { L1RollupConstants } from '@aztec/stdlib/epoch-helpers';
 import { BlockProposal, CheckpointAttestation, CheckpointProposal, ConsensusPayload } from '@aztec/stdlib/p2p';
 import { CheckpointHeader } from '@aztec/stdlib/rollup';
 import {
@@ -15,6 +17,13 @@ import {
   makeAppendOnlyTreeSnapshot,
   mockTxForRollup,
 } from '@aztec/stdlib/testing';
+import {
+  DEFAULT_CHECKPOINT_PROPOSAL_INIT_TIME,
+  DEFAULT_CHECKPOINT_PROPOSAL_PREPARE_TIME,
+  DEFAULT_MIN_BLOCK_DURATION,
+  DEFAULT_P2P_PROPAGATION_TIME,
+  ProposerTimetable,
+} from '@aztec/stdlib/timetable';
 import { BlockHeader, GlobalVariables, type Tx, makeProcessedTxFromPrivateOnlyTx } from '@aztec/stdlib/tx';
 
 import type { MockProxy } from 'jest-mock-extended';
@@ -22,6 +31,28 @@ import type { MockProxy } from 'jest-mock-extended';
 // Re-export mock classes from their dedicated file
 export { MockCheckpointBuilder, MockCheckpointsBuilder } from './mock_checkpoint_builder.js';
 
+/**
+ * Builds a {@link ProposerTimetable} for tests from a millisecond block duration and optional budgets,
+ * filling unset budgets with the shared `DEFAULT_*` values the sequencer config layer applies. Mirrors how
+ * the sequencer constructs its timetable so tests exercise the same budget resolution.
+ */
+export function makeProposerTimetable(opts: {
+  l1Constants: Pick<L1RollupConstants, 'l1GenesisTime' | 'slotDuration' | 'ethereumSlotDuration'>;
+  blockDurationMs?: number;
+  minBlockDuration?: number;
+  p2pPropagationTime?: number;
+  checkpointProposalPrepareTime?: number;
+}): ProposerTimetable {
+  return new ProposerTimetable({
+    l1Constants: opts.l1Constants,
+    blockDuration: (opts.blockDurationMs ?? DEFAULT_BLOCK_DURATION_MS) / 1000,
+    minBlockDuration: opts.minBlockDuration ?? DEFAULT_MIN_BLOCK_DURATION,
+    p2pPropagationTime: opts.p2pPropagationTime ?? DEFAULT_P2P_PROPAGATION_TIME,
+    checkpointProposalPrepareTime: opts.checkpointProposalPrepareTime ?? DEFAULT_CHECKPOINT_PROPOSAL_PREPARE_TIME,
+    checkpointProposalInitTime: DEFAULT_CHECKPOINT_PROPOSAL_INIT_TIME,
+  });
+}
+
 /**
  * Creates a mock transaction with a specific seed for deterministic testing
  */
@@ -59,6 +90,7 @@ export async function makeBlock(txs: Tx[], globalVariables: GlobalVariables): Pr
  */
 export function mockPendingTxs(p2p: MockProxy<P2P>, txs: Tx[]): void {
   p2p.getPendingTxCount.mockResolvedValue(txs.length);
+  p2p.hasEligiblePendingTxs.mockImplementation(minCount => Promise.resolve(txs.length >= minCount));
   p2p.iteratePendingTxs.mockImplementation(() => mockTxIterator(Promise.resolve(txs)));
   p2p.iterateEligiblePendingTxs.mockImplementation(() => mockTxIterator(Promise.resolve(txs)));
 }
@@ -98,6 +130,7 @@ function createCheckpointHeaderFromBlock(block: L2Block): CheckpointHeader {
     gv.feeRecipient,
     gv.gasFees,
     block.header.totalManaUsed,
+    block.header.totalFees,
   );
 }
 

package/dest/sequencer/chain_state_overrides.d.ts

@@ -1,61 +0,0 @@
-import { RollupContract, type SimulationOverridesPlan } from '@aztec/ethereum/contracts';
-import { CheckpointNumber } from '@aztec/foundation/branded-types';
-import type { Logger } from '@aztec/foundation/log';
-import { type ProposedCheckpointData } from '@aztec/stdlib/checkpoint';
-import type { CoordinationSignatureContext } from '@aztec/stdlib/p2p';
-type CheckpointSimulationOverridesPlanInput = {
-    /** Target rollup contract. */
-    rollup: RollupContract;
-    /** Checkpoint number to be proposed. */
-    checkpointNumber: CheckpointNumber;
-    /** Logger instance. */
-    log: Logger;
-    /**
-     * The proposed parent checkpoint when pipelining. Its `checkpointNumber` must equal
-     * `checkpointNumber - 1`; the helper enforces this. Mutually exclusive with
-     * `invalidateToPendingCheckpointNumber`.
-     */
-    proposedCheckpointData?: ProposedCheckpointData;
-    /**
-     * The pending checkpoint number we'll end up at after invalidation lands. Mutually exclusive
-     * with `proposedCheckpointData`.
-     */
-    invalidateToPendingCheckpointNumber?: CheckpointNumber;
-    /**
-     * The real on-chain pending checkpoint number (typically `syncedTo.checkpointedCheckpointNumber`).
-     * Used as the snapshot we pin both `pending` and `proven` to avoid prunes in simulation.
-     */
-    checkpointedCheckpointNumber: CheckpointNumber;
-    /**
-     * Chain-level consensus signature context. Used to recompute the parent's `payloadDigest` for the
-     * pipelined simulation override so it matches what `propose` will write into `tempCheckpointLogs[parent]`
-     * once the parent lands.
-     */
-    signatureContext: CoordinationSignatureContext;
-};
-/**
- * Builds the SimulationOverridesPlan describing the simulated L1 rollup state for a checkpoint's
- * enqueue-time simulations: `canProposeAt` (in Sequencer.doWork) and the propose-related sims
- * (validateBlockHeader, simulateProposeTx). The plan reflects "as if our pipelined parent
- * checkpoint has landed and any required invalidation has executed" — the gap that needs to be
- * bridged at enqueue time.
- *
- * Pipelining (`proposedCheckpointData`) and invalidation (`invalidateToPendingCheckpointNumber`)
- * are mutually exclusive; passing both throws.
- */
-export declare function buildCheckpointSimulationOverridesPlan(input: CheckpointSimulationOverridesPlanInput): Promise<SimulationOverridesPlan | undefined>;
-type PipelinedParentFeeHeaderInput = {
-    checkpointNumber: CheckpointNumber;
-    proposedCheckpointData: ProposedCheckpointData;
-    rollup: RollupContract;
-    log: Logger;
-};
-/**
- * Derives the pending parent fee header used during pipelined proposal simulation. Returns
- * `undefined` only when no grandparent exists (i.e. the proposed parent is the genesis
- * checkpoint); all other failure modes (missing grandparent state, missing fee header, RPC
- * errors) throw so callers don't silently desync the fee-header override.
- */
-export declare function computePipelinedParentFeeHeader(input: PipelinedParentFeeHeaderInput): Promise<import("@aztec/ethereum/contracts").FeeHeader | undefined>;
-export {};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY2hhaW5fc3RhdGVfb3ZlcnJpZGVzLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvc2VxdWVuY2VyL2NoYWluX3N0YXRlX292ZXJyaWRlcy50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsY0FBYyxFQUE4QixLQUFLLHVCQUF1QixFQUFFLE1BQU0sMkJBQTJCLENBQUM7QUFDckgsT0FBTyxFQUFFLGdCQUFnQixFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFDbkUsT0FBTyxLQUFLLEVBQUUsTUFBTSxFQUFFLE1BQU0sdUJBQXVCLENBQUM7QUFDcEQsT0FBTyxFQUFFLEtBQUssc0JBQXNCLEVBQWtDLE1BQU0sMEJBQTBCLENBQUM7QUFDdkcsT0FBTyxLQUFLLEVBQUUsNEJBQTRCLEVBQUUsTUFBTSxtQkFBbUIsQ0FBQztBQUV0RSxLQUFLLHNDQUFzQyxHQUFHO0lBQzVDLDhCQUE4QjtJQUM5QixNQUFNLEVBQUUsY0FBYyxDQUFDO0lBQ3ZCLHdDQUF3QztJQUN4QyxnQkFBZ0IsRUFBRSxnQkFBZ0IsQ0FBQztJQUNuQyx1QkFBdUI7SUFDdkIsR0FBRyxFQUFFLE1BQU0sQ0FBQztJQUNaOzs7O09BSUc7SUFDSCxzQkFBc0IsQ0FBQyxFQUFFLHNCQUFzQixDQUFDO0lBQ2hEOzs7T0FHRztJQUNILG1DQUFtQyxDQUFDLEVBQUUsZ0JBQWdCLENBQUM7SUFDdkQ7OztPQUdHO0lBQ0gsNEJBQTRCLEVBQUUsZ0JBQWdCLENBQUM7SUFDL0M7Ozs7T0FJRztJQUNILGdCQUFnQixFQUFFLDRCQUE0QixDQUFDO0NBQ2hELENBQUM7QUFFRjs7Ozs7Ozs7O0dBU0c7QUFDSCx3QkFBc0Isc0NBQXNDLENBQzFELEtBQUssRUFBRSxzQ0FBc0MsR0FDNUMsT0FBTyxDQUFDLHVCQUF1QixHQUFHLFNBQVMsQ0FBQyxDQXNEOUM7QUFxQkQsS0FBSyw2QkFBNkIsR0FBRztJQUNuQyxnQkFBZ0IsRUFBRSxnQkFBZ0IsQ0FBQztJQUNuQyxzQkFBc0IsRUFBRSxzQkFBc0IsQ0FBQztJQUMvQyxNQUFNLEVBQUUsY0FBYyxDQUFDO0lBQ3ZCLEdBQUcsRUFBRSxNQUFNLENBQUM7Q0FDYixDQUFDO0FBRUY7Ozs7O0dBS0c7QUFDSCx3QkFBc0IsK0JBQStCLENBQUMsS0FBSyxFQUFFLDZCQUE2QixzRUF3QnpGIn0=

package/dest/sequencer/chain_state_overrides.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chain_state_overrides.d.ts","sourceRoot":"","sources":["../../src/sequencer/chain_state_overrides.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAA8B,KAAK,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACrH,OAAO,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AACnE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,KAAK,sBAAsB,EAAkC,MAAM,0BAA0B,CAAC;AACvG,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,mBAAmB,CAAC;AAEtE,KAAK,sCAAsC,GAAG;IAC5C,8BAA8B;IAC9B,MAAM,EAAE,cAAc,CAAC;IACvB,wCAAwC;IACxC,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,uBAAuB;IACvB,GAAG,EAAE,MAAM,CAAC;IACZ;;;;OAIG;IACH,sBAAsB,CAAC,EAAE,sBAAsB,CAAC;IAChD;;;OAGG;IACH,mCAAmC,CAAC,EAAE,gBAAgB,CAAC;IACvD;;;OAGG;IACH,4BAA4B,EAAE,gBAAgB,CAAC;IAC/C;;;;OAIG;IACH,gBAAgB,EAAE,4BAA4B,CAAC;CAChD,CAAC;AAEF;;;;;;;;;GASG;AACH,wBAAsB,sCAAsC,CAC1D,KAAK,EAAE,sCAAsC,GAC5C,OAAO,CAAC,uBAAuB,GAAG,SAAS,CAAC,CAsD9C;AAqBD,KAAK,6BAA6B,GAAG;IACnC,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,sBAAsB,EAAE,sBAAsB,CAAC;IAC/C,MAAM,EAAE,cAAc,CAAC;IACvB,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF;;;;;GAKG;AACH,wBAAsB,+BAA+B,CAAC,KAAK,EAAE,6BAA6B,sEAwBzF"}

package/dest/sequencer/chain_state_overrides.js

@@ -1,98 +0,0 @@
-import { RollupContract, SimulationOverridesBuilder } from '@aztec/ethereum/contracts';
-import { CheckpointNumber } from '@aztec/foundation/branded-types';
-import { computeCheckpointPayloadDigest } from '@aztec/stdlib/checkpoint';
-/**
- * Builds the SimulationOverridesPlan describing the simulated L1 rollup state for a checkpoint's
- * enqueue-time simulations: `canProposeAt` (in Sequencer.doWork) and the propose-related sims
- * (validateBlockHeader, simulateProposeTx). The plan reflects "as if our pipelined parent
- * checkpoint has landed and any required invalidation has executed" — the gap that needs to be
- * bridged at enqueue time.
- *
- * Pipelining (`proposedCheckpointData`) and invalidation (`invalidateToPendingCheckpointNumber`)
- * are mutually exclusive; passing both throws.
- */ export async function buildCheckpointSimulationOverridesPlan(input) {
-    if (input.proposedCheckpointData && input.invalidateToPendingCheckpointNumber !== undefined) {
-        throw new Error('Error in buildCheckpointSimulationOverridesPlan: proposedCheckpointData and invalidateToPendingCheckpointNumber are mutually exclusive');
-    }
-    const builder = new SimulationOverridesBuilder();
-    const pendingCheckpointNumber = derivePendingCheckpointNumber(input);
-    // Override the latest checkpoint number when invalidating or pipelining, so our checkpoint
-    // follows from it. We also override the proven chain tip so we dont need to worry about
-    // prunes kicking in that would break out simulation if there's a prune pending. We always
-    // assume that a proof will land in time. If we don't have a pending checkpoint number to force,
-    // we still set both tips to the current checkpoint number to avoid the prune trigger.
-    const overridenChainTip = pendingCheckpointNumber ?? input.checkpointedCheckpointNumber;
-    builder.withChainTips({
-        pending: overridenChainTip,
-        proven: overridenChainTip
-    });
-    if (input.proposedCheckpointData) {
-        const { header, archive, checkpointOutHash, feeAssetPriceModifier } = input.proposedCheckpointData;
-        builder.withPendingArchive(archive.root);
-        // Override every locally-derivable `tempCheckpointLogs[parent]` field that L1 will eventually
-        // write. `slotNumber` is load-bearing for `STFLib.canPruneAtTime`: without it the cell reads
-        // slotNumber 0, the contract treats the pending tip as belonging to an expired epoch, and
-        // `getEffectivePendingCheckpointNumber` silently collapses pending back to proven — producing
-        // a spurious `Rollup__InvalidArchive` against the on-chain genesis archive. The other fields
-        // (headerHash, outHash, payloadDigest) are not strictly load-bearing for `canProposeAt` /
-        // `validateBlockHeader`, but mirroring the full cell keeps the simulation byte-faithful with
-        // what the actual `propose()` send will observe, which is a defense against future reads
-        // taking dependencies on them.
-        builder.withPendingTempCheckpointLogFields({
-            headerHash: header.hash(),
-            outHash: checkpointOutHash,
-            slotNumber: header.slotNumber,
-            payloadDigest: computeCheckpointPayloadDigest({
-                header,
-                archiveRoot: archive.root,
-                feeAssetPriceModifier,
-                signatureContext: input.signatureContext
-            })
-        });
-        const feeHeader = await computePipelinedParentFeeHeader({
-            checkpointNumber: input.checkpointNumber,
-            proposedCheckpointData: input.proposedCheckpointData,
-            rollup: input.rollup,
-            log: input.log
-        });
-        if (feeHeader) {
-            builder.withPendingFeeHeader(feeHeader);
-        }
-    }
-    return builder.build();
-}
-function derivePendingCheckpointNumber(input) {
-    if (input.invalidateToPendingCheckpointNumber !== undefined) {
-        return input.invalidateToPendingCheckpointNumber;
-    }
-    if (!input.proposedCheckpointData) {
-        return undefined;
-    }
-    if (input.checkpointNumber < 1) {
-        throw new Error(`Cannot build simulation override for checkpoint ${input.checkpointNumber}: no parent exists`);
-    }
-    const expectedParent = CheckpointNumber(input.checkpointNumber - 1);
-    if (input.proposedCheckpointData.checkpointNumber !== expectedParent) {
-        throw new Error(`Cannot build simulation override for checkpoint ${input.checkpointNumber}: proposedCheckpointData.checkpointNumber (${input.proposedCheckpointData.checkpointNumber}) does not match expected parent ${expectedParent}`);
-    }
-    return expectedParent;
-}
-/**
- * Derives the pending parent fee header used during pipelined proposal simulation. Returns
- * `undefined` only when no grandparent exists (i.e. the proposed parent is the genesis
- * checkpoint); all other failure modes (missing grandparent state, missing fee header, RPC
- * errors) throw so callers don't silently desync the fee-header override.
- */ export async function computePipelinedParentFeeHeader(input) {
-    if (input.checkpointNumber < 2) {
-        return undefined;
-    }
-    const grandparentCheckpointNumber = CheckpointNumber(input.checkpointNumber - 2);
-    const [grandparentCheckpoint, manaTarget] = await Promise.all([
-        input.rollup.getCheckpoint(grandparentCheckpointNumber),
-        input.rollup.getManaTarget()
-    ]);
-    if (!grandparentCheckpoint?.feeHeader) {
-        throw new Error(`Grandparent checkpoint or feeHeader missing for checkpoint ${grandparentCheckpointNumber.toString()}`);
-    }
-    return RollupContract.computeChildFeeHeader(grandparentCheckpoint.feeHeader, input.proposedCheckpointData.totalManaUsed, input.proposedCheckpointData.feeAssetPriceModifier, manaTarget);
-}

package/dest/sequencer/timetable.d.ts

@@ -1,98 +0,0 @@
-import type { Logger } from '@aztec/foundation/log';
-import type { SequencerMetrics } from './metrics.js';
-import { SequencerState } from './utils.js';
-export declare class SequencerTimetable {
-    private readonly metrics?;
-    private readonly log?;
-    private readonly checkpointTiming;
-    /**
-     * How late into the slot can we be to start working. Computed as the total time needed for assembling and publishing a block,
-     * assuming an execution time equal to `minExecutionTime`, subtracted from the slot duration. This means that, if the proposer
-     * starts building at this time, and all times hold, it will have at least `minExecutionTime` to execute txs for the block.
-     */
-    readonly initializeDeadline: number;
-    /**
-     * Fixed time offset (in seconds) when the first sub-slot starts, used as baseline for all block deadlines.
-     * This is an estimate of how long initialization (sync + proposer check) typically takes.
-     * If actual initialization takes longer/shorter, blocks just get less/more time accordingly.
-     */
-    readonly initializationOffset: number;
-    /**
-     * Total time needed to finalize and publish a checkpoint, including:
-     * - Assembling the checkpoint
-     * - Round-trip p2p propagation for the checkpoint proposal and its corresponding attestations
-     * - Publishing to L1
-     */
-    readonly checkpointFinalizationTime: number;
-    /**
-     * How long it takes to get a published block into L1. L1 builders typically accept txs up to 4 seconds into their slot,
-     * but we'll timeout sooner to give it more time to propagate (remember we also have blobs!). Still, when working in anvil,
-     * we can just post in the very last second of the L1 slot and still expect the tx to be accepted.
-     */
-    readonly l1PublishingTime: number;
-    /**
-     * What's the minimum time we want to leave available for execution and reexecution (used to derive init deadline)
-     * Defaults to half of the block duration if set, otherwise a constant.
-     */
-    readonly minExecutionTime: number;
-    /** How long it takes to get ready to start building */
-    readonly checkpointInitializationTime: number;
-    /** How long it takes to for proposals and attestations to travel across the p2p layer (one-way) */
-    readonly p2pPropagationTime: number;
-    /** How much time we spend assembling a checkpoint after building the last block */
-    readonly checkpointAssembleTime: number;
-    /** Ethereum slot duration in seconds */
-    readonly ethereumSlotDuration: number;
-    /** Aztec slot duration in seconds (must be multiple of ethereum slot duration) */
-    readonly aztecSlotDuration: number;
-    /** Whether assertTimeLeft will throw if not enough time. */
-    readonly enforce: boolean;
-    /** Duration per block when building multiple blocks per slot (undefined = single block per slot) */
-    readonly blockDuration: number | undefined;
-    /** Maximum number of blocks that can be built in this slot configuration */
-    readonly maxNumberOfBlocks: number;
-    /**
-     * How far into the target slot assembly and attestation collection can start when pipelining.
-     * Production-like timing keeps this at zero; fast local publishing profiles can use the attestation window.
-     */
-    readonly pipeliningAttestationGracePeriod: number;
-    constructor(opts: {
-        ethereumSlotDuration: number;
-        aztecSlotDuration: number;
-        l1PublishingTime: number;
-        p2pPropagationTime?: number;
-        blockDurationMs?: number;
-        enforce: boolean;
-    }, metrics?: SequencerMetrics | undefined, log?: Logger | undefined);
-    getCheckpointAssemblyDeadline(): number;
-    getCheckpointAttestationDeadline(): number;
-    getCheckpointAttestationStartDeadline(): number;
-    getCheckpointPublishingDeadline(): number;
-    getMaxAllowedTime(state: Extract<SequencerState, SequencerState.STOPPED | SequencerState.IDLE | SequencerState.SYNCHRONIZING>): undefined;
-    getMaxAllowedTime(state: Exclude<SequencerState, SequencerState.STOPPED | SequencerState.IDLE | SequencerState.SYNCHRONIZING>): number;
-    getMaxAllowedTime(state: SequencerState): number | undefined;
-    assertTimeLeft(newState: SequencerState, secondsIntoSlot: number): void;
-    /**
-     * Determines if we can start building the next block and returns its deadline.
-     *
-     * The timetable divides the slot into fixed sub-slots. This method finds the next
-     * available sub-slot that has enough time remaining to build a block.
-     *
-     * @param secondsIntoSlot - Current time (seconds into the slot)
-     * @returns Object with canStart flag, deadline, and whether this is the last block
-     */
-    canStartNextBlock(secondsIntoSlot: number): {
-        canStart: true;
-        deadline: undefined;
-        isLastBlock: true;
-    } | {
-        canStart: false;
-        deadline: undefined;
-        isLastBlock: false;
-    } | {
-        canStart: boolean;
-        deadline: number;
-        isLastBlock: boolean;
-    };
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidGltZXRhYmxlLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvc2VxdWVuY2VyL3RpbWV0YWJsZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxNQUFNLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQVdwRCxPQUFPLEtBQUssRUFBRSxnQkFBZ0IsRUFBRSxNQUFNLGNBQWMsQ0FBQztBQUNyRCxPQUFPLEVBQUUsY0FBYyxFQUFFLE1BQU0sWUFBWSxDQUFDO0FBRTVDLHFCQUFhLGtCQUFrQjtJQTZFM0IsT0FBTyxDQUFDLFFBQVEsQ0FBQyxPQUFPLENBQUM7SUFDekIsT0FBTyxDQUFDLFFBQVEsQ0FBQyxHQUFHLENBQUM7SUE3RXZCLE9BQU8sQ0FBQyxRQUFRLENBQUMsZ0JBQWdCLENBQW1CO0lBRXBEOzs7O09BSUc7SUFDSCxTQUFnQixrQkFBa0IsRUFBRSxNQUFNLENBQUM7SUFFM0M7Ozs7T0FJRztJQUNILFNBQWdCLG9CQUFvQixFQUFFLE1BQU0sQ0FBQztJQUU3Qzs7Ozs7T0FLRztJQUNILFNBQWdCLDBCQUEwQixFQUFFLE1BQU0sQ0FBQztJQUVuRDs7OztPQUlHO0lBQ0gsU0FBZ0IsZ0JBQWdCLEVBQUUsTUFBTSxDQUFDO0lBRXpDOzs7T0FHRztJQUNILFNBQWdCLGdCQUFnQixFQUFFLE1BQU0sQ0FBc0I7SUFFOUQsdURBQXVEO0lBQ3ZELFNBQWdCLDRCQUE0QixFQUFFLE1BQU0sQ0FBa0M7SUFFdEYsbUdBQW1HO0lBQ25HLFNBQWdCLGtCQUFrQixFQUFFLE1BQU0sQ0FBQztJQUUzQyxtRkFBbUY7SUFDbkYsU0FBZ0Isc0JBQXNCLEVBQUUsTUFBTSxDQUE0QjtJQUUxRSx3Q0FBd0M7SUFDeEMsU0FBZ0Isb0JBQW9CLEVBQUUsTUFBTSxDQUFDO0lBRTdDLGtGQUFrRjtJQUNsRixTQUFnQixpQkFBaUIsRUFBRSxNQUFNLENBQUM7SUFFMUMsNERBQTREO0lBQzVELFNBQWdCLE9BQU8sRUFBRSxPQUFPLENBQUM7SUFFakMsb0dBQW9HO0lBQ3BHLFNBQWdCLGFBQWEsRUFBRSxNQUFNLEdBQUcsU0FBUyxDQUFDO0lBRWxELDRFQUE0RTtJQUM1RSxTQUFnQixpQkFBaUIsRUFBRSxNQUFNLENBQUM7SUFFMUM7OztPQUdHO0lBQ0gsU0FBZ0IsZ0NBQWdDLEVBQUUsTUFBTSxDQUFDO0lBRXpELFlBQ0UsSUFBSSxFQUFFO1FBQ0osb0JBQW9CLEVBQUUsTUFBTSxDQUFDO1FBQzdCLGlCQUFpQixFQUFFLE1BQU0sQ0FBQztRQUMxQixnQkFBZ0IsRUFBRSxNQUFNLENBQUM7UUFDekIsa0JBQWtCLENBQUMsRUFBRSxNQUFNLENBQUM7UUFDNUIsZUFBZSxDQUFDLEVBQUUsTUFBTSxDQUFDO1FBQ3pCLE9BQU8sRUFBRSxPQUFPLENBQUM7S0FDbEIsRUFDZ0IsT0FBTyxDQUFDLDhCQUFrQixFQUMxQixHQUFHLENBQUMsb0JBQVEsRUFxRDlCO0lBRU0sNkJBQTZCLElBQUksTUFBTSxDQUU3QztJQUVNLGdDQUFnQyxJQUFJLE1BQU0sQ0FFaEQ7SUFFTSxxQ0FBcUMsSUFBSSxNQUFNLENBRXJEO0lBRU0sK0JBQStCLElBQUksTUFBTSxDQUUvQztJQUVNLGlCQUFpQixDQUN0QixLQUFLLEVBQUUsT0FBTyxDQUFDLGNBQWMsRUFBRSxjQUFjLENBQUMsT0FBTyxHQUFHLGNBQWMsQ0FBQyxJQUFJLEdBQUcsY0FBYyxDQUFDLGFBQWEsQ0FBQyxHQUMxRyxTQUFTLENBQUM7SUFDTixpQkFBaUIsQ0FDdEIsS0FBSyxFQUFFLE9BQU8sQ0FBQyxjQUFjLEVBQUUsY0FBYyxDQUFDLE9BQU8sR0FBRyxjQUFjLENBQUMsSUFBSSxHQUFHLGNBQWMsQ0FBQyxhQUFhLENBQUMsR0FDMUcsTUFBTSxDQUFDO0lBQ0gsaUJBQWlCLENBQUMsS0FBSyxFQUFFLGNBQWMsR0FBRyxNQUFNLEdBQUcsU0FBUyxDQUFDO0lBNEI3RCxjQUFjLENBQUMsUUFBUSxFQUFFLGNBQWMsRUFBRSxlQUFlLEVBQUUsTUFBTSxRQWlCdEU7SUFFRDs7Ozs7Ozs7T0FRRztJQUNJLGlCQUFpQixDQUN0QixlQUFlLEVBQUUsTUFBTSxHQUVyQjtRQUFFLFFBQVEsRUFBRSxJQUFJLENBQUM7UUFBQyxRQUFRLEVBQUUsU0FBUyxDQUFDO1FBQUMsV0FBVyxFQUFFLElBQUksQ0FBQTtLQUFFLEdBQzFEO1FBQUUsUUFBUSxFQUFFLEtBQUssQ0FBQztRQUFDLFFBQVEsRUFBRSxTQUFTLENBQUM7UUFBQyxXQUFXLEVBQUUsS0FBSyxDQUFBO0tBQUUsR0FDNUQ7UUFBRSxRQUFRLEVBQUUsT0FBTyxDQUFDO1FBQUMsUUFBUSxFQUFFLE1BQU0sQ0FBQztRQUFDLFdBQVcsRUFBRSxPQUFPLENBQUE7S0FBRSxDQXdEaEU7Q0FDRiJ9

package/dest/sequencer/timetable.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"timetable.d.ts","sourceRoot":"","sources":["../../src/sequencer/timetable.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAWpD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C,qBAAa,kBAAkB;IA6E3B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;IACzB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;IA7EvB,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAmB;IAEpD;;;;OAIG;IACH,SAAgB,kBAAkB,EAAE,MAAM,CAAC;IAE3C;;;;OAIG;IACH,SAAgB,oBAAoB,EAAE,MAAM,CAAC;IAE7C;;;;;OAKG;IACH,SAAgB,0BAA0B,EAAE,MAAM,CAAC;IAEnD;;;;OAIG;IACH,SAAgB,gBAAgB,EAAE,MAAM,CAAC;IAEzC;;;OAGG;IACH,SAAgB,gBAAgB,EAAE,MAAM,CAAsB;IAE9D,uDAAuD;IACvD,SAAgB,4BAA4B,EAAE,MAAM,CAAkC;IAEtF,mGAAmG;IACnG,SAAgB,kBAAkB,EAAE,MAAM,CAAC;IAE3C,mFAAmF;IACnF,SAAgB,sBAAsB,EAAE,MAAM,CAA4B;IAE1E,wCAAwC;IACxC,SAAgB,oBAAoB,EAAE,MAAM,CAAC;IAE7C,kFAAkF;IAClF,SAAgB,iBAAiB,EAAE,MAAM,CAAC;IAE1C,4DAA4D;IAC5D,SAAgB,OAAO,EAAE,OAAO,CAAC;IAEjC,oGAAoG;IACpG,SAAgB,aAAa,EAAE,MAAM,GAAG,SAAS,CAAC;IAElD,4EAA4E;IAC5E,SAAgB,iBAAiB,EAAE,MAAM,CAAC;IAE1C;;;OAGG;IACH,SAAgB,gCAAgC,EAAE,MAAM,CAAC;IAEzD,YACE,IAAI,EAAE;QACJ,oBAAoB,EAAE,MAAM,CAAC;QAC7B,iBAAiB,EAAE,MAAM,CAAC;QAC1B,gBAAgB,EAAE,MAAM,CAAC;QACzB,kBAAkB,CAAC,EAAE,MAAM,CAAC;QAC5B,eAAe,CAAC,EAAE,MAAM,CAAC;QACzB,OAAO,EAAE,OAAO,CAAC;KAClB,EACgB,OAAO,CAAC,8BAAkB,EAC1B,GAAG,CAAC,oBAAQ,EAqD9B;IAEM,6BAA6B,IAAI,MAAM,CAE7C;IAEM,gCAAgC,IAAI,MAAM,CAEhD;IAEM,qCAAqC,IAAI,MAAM,CAErD;IAEM,+BAA+B,IAAI,MAAM,CAE/C;IAEM,iBAAiB,CACtB,KAAK,EAAE,OAAO,CAAC,cAAc,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,IAAI,GAAG,cAAc,CAAC,aAAa,CAAC,GAC1G,SAAS,CAAC;IACN,iBAAiB,CACtB,KAAK,EAAE,OAAO,CAAC,cAAc,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,IAAI,GAAG,cAAc,CAAC,aAAa,CAAC,GAC1G,MAAM,CAAC;IACH,iBAAiB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;IA4B7D,cAAc,CAAC,QAAQ,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,QAiBtE;IAED;;;;;;;;OAQG;IACI,iBAAiB,CACtB,eAAe,EAAE,MAAM,GAErB;QAAE,QAAQ,EAAE,IAAI,CAAC;QAAC,QAAQ,EAAE,SAAS,CAAC;QAAC,WAAW,EAAE,IAAI,CAAA;KAAE,GAC1D;QAAE,QAAQ,EAAE,KAAK,CAAC;QAAC,QAAQ,EAAE,SAAS,CAAC;QAAC,WAAW,EAAE,KAAK,CAAA;KAAE,GAC5D;QAAE,QAAQ,EAAE,OAAO,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,OAAO,CAAA;KAAE,CAwDhE;CACF"}

package/dest/sequencer/timetable.js

@@ -1,227 +0,0 @@
-import { CHECKPOINT_ASSEMBLE_TIME, CHECKPOINT_INITIALIZATION_TIME, DEFAULT_P2P_PROPAGATION_TIME, MIN_EXECUTION_TIME, createCheckpointTimingModel } from '@aztec/stdlib/timetable';
-import { SequencerTooSlowError } from './errors.js';
-import { SequencerState } from './utils.js';
-export class SequencerTimetable {
-    metrics;
-    log;
-    checkpointTiming;
-    /**
-   * How late into the slot can we be to start working. Computed as the total time needed for assembling and publishing a block,
-   * assuming an execution time equal to `minExecutionTime`, subtracted from the slot duration. This means that, if the proposer
-   * starts building at this time, and all times hold, it will have at least `minExecutionTime` to execute txs for the block.
-   */ initializeDeadline;
-    /**
-   * Fixed time offset (in seconds) when the first sub-slot starts, used as baseline for all block deadlines.
-   * This is an estimate of how long initialization (sync + proposer check) typically takes.
-   * If actual initialization takes longer/shorter, blocks just get less/more time accordingly.
-   */ initializationOffset;
-    /**
-   * Total time needed to finalize and publish a checkpoint, including:
-   * - Assembling the checkpoint
-   * - Round-trip p2p propagation for the checkpoint proposal and its corresponding attestations
-   * - Publishing to L1
-   */ checkpointFinalizationTime;
-    /**
-   * How long it takes to get a published block into L1. L1 builders typically accept txs up to 4 seconds into their slot,
-   * but we'll timeout sooner to give it more time to propagate (remember we also have blobs!). Still, when working in anvil,
-   * we can just post in the very last second of the L1 slot and still expect the tx to be accepted.
-   */ l1PublishingTime;
-    /**
-   * What's the minimum time we want to leave available for execution and reexecution (used to derive init deadline)
-   * Defaults to half of the block duration if set, otherwise a constant.
-   */ minExecutionTime;
-    /** How long it takes to get ready to start building */ checkpointInitializationTime;
-    /** How long it takes to for proposals and attestations to travel across the p2p layer (one-way) */ p2pPropagationTime;
-    /** How much time we spend assembling a checkpoint after building the last block */ checkpointAssembleTime;
-    /** Ethereum slot duration in seconds */ ethereumSlotDuration;
-    /** Aztec slot duration in seconds (must be multiple of ethereum slot duration) */ aztecSlotDuration;
-    /** Whether assertTimeLeft will throw if not enough time. */ enforce;
-    /** Duration per block when building multiple blocks per slot (undefined = single block per slot) */ blockDuration;
-    /** Maximum number of blocks that can be built in this slot configuration */ maxNumberOfBlocks;
-    /**
-   * How far into the target slot assembly and attestation collection can start when pipelining.
-   * Production-like timing keeps this at zero; fast local publishing profiles can use the attestation window.
-   */ pipeliningAttestationGracePeriod;
-    constructor(opts, metrics, log){
-        this.metrics = metrics;
-        this.log = log;
-        this.minExecutionTime = MIN_EXECUTION_TIME;
-        this.checkpointInitializationTime = CHECKPOINT_INITIALIZATION_TIME;
-        this.checkpointAssembleTime = CHECKPOINT_ASSEMBLE_TIME;
-        this.ethereumSlotDuration = opts.ethereumSlotDuration;
-        this.aztecSlotDuration = opts.aztecSlotDuration;
-        this.l1PublishingTime = opts.l1PublishingTime;
-        this.blockDuration = opts.blockDurationMs ? opts.blockDurationMs / 1000 : undefined;
-        this.enforce = opts.enforce;
-        this.checkpointTiming = createCheckpointTimingModel({
-            aztecSlotDuration: this.aztecSlotDuration,
-            ethereumSlotDuration: this.ethereumSlotDuration,
-            blockDuration: this.blockDuration,
-            l1PublishingTime: this.l1PublishingTime,
-            p2pPropagationTime: opts.p2pPropagationTime ?? DEFAULT_P2P_PROPAGATION_TIME
-        });
-        this.p2pPropagationTime = this.checkpointTiming.p2pPropagationTime;
-        this.checkpointAssembleTime = this.checkpointTiming.checkpointAssembleTime;
-        this.checkpointInitializationTime = this.checkpointTiming.checkpointInitializationTime;
-        this.minExecutionTime = this.checkpointTiming.minExecutionTime;
-        // Calculate initialization offset - estimate of time needed for sync + proposer check
-        // This is the baseline for all sub-slot deadlines
-        this.initializationOffset = this.checkpointTiming.checkpointInitializationTime;
-        this.checkpointFinalizationTime = this.checkpointTiming.checkpointFinalizationTime;
-        this.pipeliningAttestationGracePeriod = this.checkpointTiming.pipeliningAttestationGracePeriod;
-        this.maxNumberOfBlocks = this.checkpointTiming.calculateMaxBlocksPerSlot();
-        this.initializeDeadline = this.checkpointTiming.initializeDeadline;
-        this.log?.info(`Sequencer timetable initialized with ${this.maxNumberOfBlocks} blocks per slot (${this.enforce ? 'enforced' : 'not enforced'})`, {
-            ethereumSlotDuration: this.ethereumSlotDuration,
-            aztecSlotDuration: this.aztecSlotDuration,
-            l1PublishingTime: this.l1PublishingTime,
-            minExecutionTime: this.minExecutionTime,
-            blockPrepareTime: this.checkpointInitializationTime,
-            p2pPropagationTime: this.p2pPropagationTime,
-            blockAssembleTime: this.checkpointAssembleTime,
-            initializeDeadline: this.initializeDeadline,
-            enforce: this.enforce,
-            pipeliningAttestationGracePeriod: this.pipeliningAttestationGracePeriod,
-            minWorkToDo: this.checkpointTiming.minimumBuildSlotWork,
-            blockDuration: this.blockDuration,
-            maxNumberOfBlocks: this.maxNumberOfBlocks
-        });
-        if (this.initializeDeadline <= 0) {
-            throw new Error(`Block proposal initialize deadline cannot be negative (got ${this.initializeDeadline} from total time needed ${this.checkpointTiming.minimumBuildSlotWork} and a slot duration of ${this.aztecSlotDuration}).`);
-        }
-    }
-    getCheckpointAssemblyDeadline() {
-        return this.checkpointTiming.checkpointAssemblyDeadline;
-    }
-    getCheckpointAttestationDeadline() {
-        return this.checkpointTiming.checkpointAttestationDeadline;
-    }
-    getCheckpointAttestationStartDeadline() {
-        return this.checkpointTiming.checkpointAttestationStartDeadline;
-    }
-    getCheckpointPublishingDeadline() {
-        return this.checkpointTiming.checkpointPublishingDeadline;
-    }
-    getMaxAllowedTime(state) {
-        switch(state){
-            case SequencerState.STOPPED:
-            case SequencerState.STOPPING:
-            case SequencerState.IDLE:
-            case SequencerState.SYNCHRONIZING:
-                return; // We don't really care about times for this states
-            case SequencerState.PROPOSER_CHECK:
-            case SequencerState.INITIALIZING_CHECKPOINT:
-                return this.initializeDeadline;
-            case SequencerState.WAITING_FOR_TXS:
-            case SequencerState.CREATING_BLOCK:
-            case SequencerState.WAITING_UNTIL_NEXT_BLOCK:
-                return this.initializeDeadline + this.checkpointInitializationTime;
-            case SequencerState.ASSEMBLING_CHECKPOINT:
-                return this.getCheckpointAssemblyDeadline();
-            case SequencerState.COLLECTING_ATTESTATIONS:
-                return this.getCheckpointAttestationStartDeadline();
-            case SequencerState.PUBLISHING_CHECKPOINT:
-                return this.getCheckpointPublishingDeadline();
-            default:
-                {
-                    const _exhaustiveCheck = state;
-                    throw new Error(`Unexpected state: ${state}`);
-                }
-        }
-    }
-    assertTimeLeft(newState, secondsIntoSlot) {
-        if (!this.enforce) {
-            return;
-        }
-        const maxAllowedTime = this.getMaxAllowedTime(newState);
-        if (maxAllowedTime === undefined) {
-            return;
-        }
-        const bufferSeconds = maxAllowedTime - secondsIntoSlot;
-        if (bufferSeconds < 0) {
-            throw new SequencerTooSlowError(newState, maxAllowedTime, secondsIntoSlot);
-        }
-        this.metrics?.recordStateTransitionBufferMs(Math.floor(bufferSeconds * 1000), newState);
-        this.log?.trace(`Enough time to transition to ${newState}`, {
-            maxAllowedTime,
-            secondsIntoSlot
-        });
-    }
-    /**
-   * Determines if we can start building the next block and returns its deadline.
-   *
-   * The timetable divides the slot into fixed sub-slots. This method finds the next
-   * available sub-slot that has enough time remaining to build a block.
-   *
-   * @param secondsIntoSlot - Current time (seconds into the slot)
-   * @returns Object with canStart flag, deadline, and whether this is the last block
-   */ canStartNextBlock(secondsIntoSlot) {
-        // When timetable enforcement is disabled, always allow starting,
-        // and build a single block with no deadline. This is here just to
-        // satisfy a subset of e2e tests and the sandbox that assume that the
-        // sequencer is permanently mining every tx sent.
-        if (!this.enforce) {
-            return {
-                canStart: true,
-                deadline: undefined,
-                isLastBlock: true
-            };
-        }
-        // If no block duration is set, then we're in single-block mode, which
-        // is handled for backwards compatibility towards another subset of e2e tests.
-        if (this.blockDuration === undefined) {
-            // In single block mode, execution and re-execution happen sequentially, so we need to
-            // split the available time between them. After building, we need time for attestations and L1.
-            const maxAllowed = this.aztecSlotDuration - this.checkpointFinalizationTime;
-            const available = (maxAllowed - secondsIntoSlot) / 2; // Split remaining time: half for execution, half for re-execution
-            const canStart = available >= this.minExecutionTime;
-            const deadline = secondsIntoSlot + available;
-            this.log?.verbose(`${canStart ? 'Can' : 'Cannot'} start single-block checkpoint at ${secondsIntoSlot}s into slot`, {
-                secondsIntoSlot,
-                maxAllowed,
-                available,
-                deadline
-            });
-            return {
-                canStart,
-                deadline,
-                isLastBlock: true
-            };
-        }
-        // Otherwise, we're in multi-block-per-slot mode, the default when running in production
-        // Find the next available sub-slot that has enough time remaining
-        for(let subSlot = 1; subSlot <= this.maxNumberOfBlocks; subSlot++){
-            // Calculate end for this sub-slot
-            const deadline = this.initializationOffset + subSlot * this.blockDuration;
-            // Check if we have enough time to build a block with this deadline
-            const timeUntilDeadline = deadline - secondsIntoSlot;
-            if (timeUntilDeadline >= this.minExecutionTime) {
-                // Found an available sub-slot! Is this the last one?
-                const isLastBlock = subSlot === this.maxNumberOfBlocks;
-                this.log?.verbose(`Can start ${isLastBlock ? 'last block' : 'block'} in sub-slot ${subSlot} with deadline ${deadline}s`, {
-                    secondsIntoSlot,
-                    deadline,
-                    timeUntilDeadline,
-                    subSlot,
-                    maxBlocks: this.maxNumberOfBlocks
-                });
-                return {
-                    canStart: true,
-                    deadline,
-                    isLastBlock
-                };
-            }
-        }
-        // No sub-slots available with enough time
-        this.log?.verbose(`No time left to start any more blocks`, {
-            secondsIntoSlot,
-            maxBlocks: this.maxNumberOfBlocks,
-            initializationOffset: this.initializationOffset
-        });
-        return {
-            canStart: false,
-            deadline: undefined,
-            isLastBlock: false
-        };
-    }
-}