@aztec-labs/stdlib 6.0.0-nightly.20260829

package/dest/timetable/consensus_timetable.d.ts

@@ -0,0 +1,70 @@
+import type { SlotNumber } from '@aztec-labs/foundation/branded-types';
+import { type L1RollupConstants } from '../epoch-helpers/index.js';
+/** Slot-timing protocol constants the timetables derive wall-clock times from. */
+export type SlotTimingConstants = Pick<L1RollupConstants, 'l1GenesisTime' | 'slotDuration' | 'ethereumSlotDuration'>;
+/**
+ * Consensus acceptance bounds for the pipelined timetable.
+ *
+ * Returns the deadlines and matching receive-window lower bounds that validators and p2p use to decide
+ * whether a proposal or attestation is acceptable for a given target slot. All getters take a target slot
+ * and return an absolute wall-clock timestamp in seconds.
+ *
+ * Inputs are protocol slot-timing constants only (`genesis`, `aztec_slot_duration`,
+ * `ethereum_slot_duration`, `block_duration`, `checkpoint_proposal_sync_grace`); no operational budgets, so every
+ * node agrees on these bounds. See `stdlib/src/timetable/README.md` for the timing model.
+ */
+export declare class ConsensusTimetable {
+    /** Aztec slot duration (`S`) in seconds. */
+    readonly aztecSlotDuration: number;
+    /** Ethereum slot duration (`E`) in seconds. */
+    readonly ethereumSlotDuration: number;
+    /** Block sub-slot duration (`D`) in seconds. */
+    readonly blockDuration: number;
+    /** L1 genesis timestamp in seconds (`genesis`), the anchor all slot timings derive from. */
+    readonly genesisTime: bigint;
+    /** Consensus grace for received checkpoint proposals to materialize into local proposed state. */
+    readonly checkpointProposalSyncGrace: number;
+    constructor(opts: {
+        l1Constants: SlotTimingConstants;
+        blockDuration: number;
+        checkpointProposalSyncGrace?: number;
+    });
+    /**
+     * Build-frame start for the target slot: `target_slot_start - S - E`. Anchors all sub-slot timings.
+     * Computed directly (not via a `slot - 1` hop) so it is well-defined for slot 0, whose build frame
+     * predates genesis; p2p validators evaluate acceptance windows for arbitrary peer-supplied slots.
+     */
+    getBuildFrameStart(slot: SlotNumber): number;
+    /** Start of the target slot: `genesis + slot * S`. */
+    getTargetSlotStart(slot: SlotNumber): number;
+    /**
+     * Earliest acceptable arrival for a checkpoint proposal: `target_slot_start - S - E` (the build frame
+     * opening). Nothing legitimate for this slot exists before its build frame opens.
+     */
+    getCheckpointProposalReceiveStart(slot: SlotNumber): number;
+    /**
+     * Hard consensus receive deadline for a checkpoint proposal: `target_slot_start - E - D`. Validators
+     * reject proposals arriving after this, and the next proposer does not build on them.
+     */
+    getCheckpointProposalReceiveDeadline(slot: SlotNumber): number;
+    /**
+     * Wall-clock deadline by which a received checkpoint proposal should have materialized into local proposed
+     * state. This is `next_proposer_build_frame_start + checkpointProposalSyncGrace`, rounded up to the next
+     * integer second because L1 timestamps and archiver comparisons are second-granularity.
+     */
+    getCheckpointProposalSyncedDeadline(slot: SlotNumber): number;
+    /**
+     * Earliest acceptable arrival for an attestation: `target_slot_start - S - E` (the build frame
+     * opening). Deliberately liberal; attestations are attributed by content, not timing.
+     */
+    getAttestationReceiveStart(slot: SlotNumber): number;
+    /**
+     * Single hard consensus deadline: `target_slot_start + S - 2E`. The latest the checkpoint can still
+     * land on L1 in the target slot, and the cutoff by which every block and the checkpoint must be
+     * re-executed, validated, and signed. Consensus-driven (used for inactivity/slashing decisions).
+     */
+    getAttestationDeadline(slot: SlotNumber): number;
+    /** Slot-timing protocol constants this timetable derives wall-clock times from. */
+    getL1Constants(): SlotTimingConstants;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY29uc2Vuc3VzX3RpbWV0YWJsZS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3RpbWV0YWJsZS9jb25zZW5zdXNfdGltZXRhYmxlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLFVBQVUsRUFBRSxNQUFNLHNDQUFzQyxDQUFDO0FBRXZFLE9BQU8sRUFBRSxLQUFLLGlCQUFpQixFQUF1QixNQUFNLDJCQUEyQixDQUFDO0FBR3hGLGtGQUFrRjtBQUNsRixNQUFNLE1BQU0sbUJBQW1CLEdBQUcsSUFBSSxDQUFDLGlCQUFpQixFQUFFLGVBQWUsR0FBRyxjQUFjLEdBQUcsc0JBQXNCLENBQUMsQ0FBQztBQUVySDs7Ozs7Ozs7OztHQVVHO0FBQ0gscUJBQWEsa0JBQWtCO0lBQzdCLDRDQUE0QztJQUM1QyxTQUFnQixpQkFBaUIsRUFBRSxNQUFNLENBQUM7SUFFMUMsK0NBQStDO0lBQy9DLFNBQWdCLG9CQUFvQixFQUFFLE1BQU0sQ0FBQztJQUU3QyxnREFBZ0Q7SUFDaEQsU0FBZ0IsYUFBYSxFQUFFLE1BQU0sQ0FBQztJQUV0Qyw0RkFBNEY7SUFDNUYsU0FBZ0IsV0FBVyxFQUFFLE1BQU0sQ0FBQztJQUVwQyxrR0FBa0c7SUFDbEcsU0FBZ0IsMkJBQTJCLEVBQUUsTUFBTSxDQUFDO0lBRXBELFlBQVksSUFBSSxFQUFFO1FBQUUsV0FBVyxFQUFFLG1CQUFtQixDQUFDO1FBQUMsYUFBYSxFQUFFLE1BQU0sQ0FBQztRQUFDLDJCQUEyQixDQUFDLEVBQUUsTUFBTSxDQUFBO0tBQUUsRUFzQmxIO0lBRUQ7Ozs7T0FJRztJQUNJLGtCQUFrQixDQUFDLElBQUksRUFBRSxVQUFVLEdBQUcsTUFBTSxDQUVsRDtJQUVELHNEQUFzRDtJQUMvQyxrQkFBa0IsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLE1BQU0sQ0FFbEQ7SUFFRDs7O09BR0c7SUFDSSxpQ0FBaUMsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLE1BQU0sQ0FFakU7SUFFRDs7O09BR0c7SUFDSSxvQ0FBb0MsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLE1BQU0sQ0FFcEU7SUFFRDs7OztPQUlHO0lBQ0ksbUNBQW1DLENBQUMsSUFBSSxFQUFFLFVBQVUsR0FBRyxNQUFNLENBSW5FO0lBRUQ7OztPQUdHO0lBQ0ksMEJBQTBCLENBQUMsSUFBSSxFQUFFLFVBQVUsR0FBRyxNQUFNLENBRTFEO0lBRUQ7Ozs7T0FJRztJQUNJLHNCQUFzQixDQUFDLElBQUksRUFBRSxVQUFVLEdBQUcsTUFBTSxDQUV0RDtJQUVELG1GQUFtRjtJQUM1RSxjQUFjLElBQUksbUJBQW1CLENBTTNDO0NBQ0YifQ==

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

@@ -0,0 +1 @@
+{"version":3,"file":"consensus_timetable.d.ts","sourceRoot":"","sources":["../../src/timetable/consensus_timetable.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAEvE,OAAO,EAAE,KAAK,iBAAiB,EAAuB,MAAM,2BAA2B,CAAC;AAGxF,kFAAkF;AAClF,MAAM,MAAM,mBAAmB,GAAG,IAAI,CAAC,iBAAiB,EAAE,eAAe,GAAG,cAAc,GAAG,sBAAsB,CAAC,CAAC;AAErH;;;;;;;;;;GAUG;AACH,qBAAa,kBAAkB;IAC7B,4CAA4C;IAC5C,SAAgB,iBAAiB,EAAE,MAAM,CAAC;IAE1C,+CAA+C;IAC/C,SAAgB,oBAAoB,EAAE,MAAM,CAAC;IAE7C,gDAAgD;IAChD,SAAgB,aAAa,EAAE,MAAM,CAAC;IAEtC,4FAA4F;IAC5F,SAAgB,WAAW,EAAE,MAAM,CAAC;IAEpC,kGAAkG;IAClG,SAAgB,2BAA2B,EAAE,MAAM,CAAC;IAEpD,YAAY,IAAI,EAAE;QAAE,WAAW,EAAE,mBAAmB,CAAC;QAAC,aAAa,EAAE,MAAM,CAAC;QAAC,2BAA2B,CAAC,EAAE,MAAM,CAAA;KAAE,EAsBlH;IAED;;;;OAIG;IACI,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAElD;IAED,sDAAsD;IAC/C,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAElD;IAED;;;OAGG;IACI,iCAAiC,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAEjE;IAED;;;OAGG;IACI,oCAAoC,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAEpE;IAED;;;;OAIG;IACI,mCAAmC,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAInE;IAED;;;OAGG;IACI,0BAA0B,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAE1D;IAED;;;;OAIG;IACI,sBAAsB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAEtD;IAED,mFAAmF;IAC5E,cAAc,IAAI,mBAAmB,CAM3C;CACF"}

package/dest/timetable/consensus_timetable.js

@@ -0,0 +1,89 @@
+import { getTimestampForSlot } from '../epoch-helpers/index.js';
+import { getDefaultCheckpointProposalSyncGrace } from './budgets.js';
+/**
+ * Consensus acceptance bounds for the pipelined timetable.
+ *
+ * Returns the deadlines and matching receive-window lower bounds that validators and p2p use to decide
+ * whether a proposal or attestation is acceptable for a given target slot. All getters take a target slot
+ * and return an absolute wall-clock timestamp in seconds.
+ *
+ * Inputs are protocol slot-timing constants only (`genesis`, `aztec_slot_duration`,
+ * `ethereum_slot_duration`, `block_duration`, `checkpoint_proposal_sync_grace`); no operational budgets, so every
+ * node agrees on these bounds. See `stdlib/src/timetable/README.md` for the timing model.
+ */ export class ConsensusTimetable {
+    /** Aztec slot duration (`S`) in seconds. */ aztecSlotDuration;
+    /** Ethereum slot duration (`E`) in seconds. */ ethereumSlotDuration;
+    /** Block sub-slot duration (`D`) in seconds. */ blockDuration;
+    /** L1 genesis timestamp in seconds (`genesis`), the anchor all slot timings derive from. */ genesisTime;
+    /** Consensus grace for received checkpoint proposals to materialize into local proposed state. */ checkpointProposalSyncGrace;
+    constructor(opts){
+        const { l1Constants, blockDuration } = opts;
+        const checkpointProposalSyncGrace = opts.checkpointProposalSyncGrace ?? getDefaultCheckpointProposalSyncGrace(blockDuration);
+        if (l1Constants.slotDuration <= 0) {
+            throw new Error(`aztecSlotDuration must be positive (got ${l1Constants.slotDuration})`);
+        }
+        if (l1Constants.ethereumSlotDuration <= 0) {
+            throw new Error(`ethereumSlotDuration must be positive (got ${l1Constants.ethereumSlotDuration})`);
+        }
+        if (blockDuration <= 0) {
+            throw new Error(`blockDuration must be positive (got ${blockDuration})`);
+        }
+        if (checkpointProposalSyncGrace < 0) {
+            throw new Error(`checkpointProposalSyncGrace must be non-negative (got ${checkpointProposalSyncGrace})`);
+        }
+        this.aztecSlotDuration = l1Constants.slotDuration;
+        this.ethereumSlotDuration = l1Constants.ethereumSlotDuration;
+        this.blockDuration = blockDuration;
+        this.genesisTime = l1Constants.l1GenesisTime;
+        this.checkpointProposalSyncGrace = checkpointProposalSyncGrace;
+    }
+    /**
+   * Build-frame start for the target slot: `target_slot_start - S - E`. Anchors all sub-slot timings.
+   * Computed directly (not via a `slot - 1` hop) so it is well-defined for slot 0, whose build frame
+   * predates genesis; p2p validators evaluate acceptance windows for arbitrary peer-supplied slots.
+   */ getBuildFrameStart(slot) {
+        return this.getTargetSlotStart(slot) - this.aztecSlotDuration - this.ethereumSlotDuration;
+    }
+    /** Start of the target slot: `genesis + slot * S`. */ getTargetSlotStart(slot) {
+        return Number(getTimestampForSlot(slot, this.getL1Constants()));
+    }
+    /**
+   * Earliest acceptable arrival for a checkpoint proposal: `target_slot_start - S - E` (the build frame
+   * opening). Nothing legitimate for this slot exists before its build frame opens.
+   */ getCheckpointProposalReceiveStart(slot) {
+        return this.getBuildFrameStart(slot);
+    }
+    /**
+   * Hard consensus receive deadline for a checkpoint proposal: `target_slot_start - E - D`. Validators
+   * reject proposals arriving after this, and the next proposer does not build on them.
+   */ getCheckpointProposalReceiveDeadline(slot) {
+        return this.getTargetSlotStart(slot) - this.ethereumSlotDuration - this.blockDuration;
+    }
+    /**
+   * Wall-clock deadline by which a received checkpoint proposal should have materialized into local proposed
+   * state. This is `next_proposer_build_frame_start + checkpointProposalSyncGrace`, rounded up to the next
+   * integer second because L1 timestamps and archiver comparisons are second-granularity.
+   */ getCheckpointProposalSyncedDeadline(slot) {
+        return Math.ceil(this.getCheckpointProposalReceiveDeadline(slot) + this.blockDuration + this.checkpointProposalSyncGrace);
+    }
+    /**
+   * Earliest acceptable arrival for an attestation: `target_slot_start - S - E` (the build frame
+   * opening). Deliberately liberal; attestations are attributed by content, not timing.
+   */ getAttestationReceiveStart(slot) {
+        return this.getBuildFrameStart(slot);
+    }
+    /**
+   * Single hard consensus deadline: `target_slot_start + S - 2E`. The latest the checkpoint can still
+   * land on L1 in the target slot, and the cutoff by which every block and the checkpoint must be
+   * re-executed, validated, and signed. Consensus-driven (used for inactivity/slashing decisions).
+   */ getAttestationDeadline(slot) {
+        return this.getTargetSlotStart(slot) + this.aztecSlotDuration - 2 * this.ethereumSlotDuration;
+    }
+    /** Slot-timing protocol constants this timetable derives wall-clock times from. */ getL1Constants() {
+        return {
+            l1GenesisTime: this.genesisTime,
+            slotDuration: this.aztecSlotDuration,
+            ethereumSlotDuration: this.ethereumSlotDuration
+        };
+    }
+}

package/dest/timetable/index.d.ts

@@ -0,0 +1,5 @@
+export * from './budgets.js';
+export * from './build_proposer_timetable.js';
+export * from './consensus_timetable.js';
+export * from './proposer_timetable.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy90aW1ldGFibGUvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxjQUFjLENBQUM7QUFDN0IsY0FBYywrQkFBK0IsQ0FBQztBQUM5QyxjQUFjLDBCQUEwQixDQUFDO0FBQ3pDLGNBQWMseUJBQXlCLENBQUMifQ==

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/timetable/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,+BAA+B,CAAC;AAC9C,cAAc,0BAA0B,CAAC;AACzC,cAAc,yBAAyB,CAAC"}

package/dest/timetable/index.js

@@ -0,0 +1,4 @@
+export * from './budgets.js';
+export * from './build_proposer_timetable.js';
+export * from './consensus_timetable.js';
+export * from './proposer_timetable.js';

package/dest/timetable/proposer_timetable.d.ts

@@ -0,0 +1,106 @@
+import type { SlotNumber } from '@aztec-labs/foundation/branded-types';
+import type { Logger } from '@aztec-labs/foundation/log';
+import { ConsensusTimetable, type SlotTimingConstants } from './consensus_timetable.js';
+/** Result of selecting the next block sub-slot to build. */
+export type SubslotSelection = {
+    canStart: false;
+    index: undefined;
+    deadline: undefined;
+    isLastBlock: false;
+} | {
+    canStart: true;
+    index: number;
+    deadline: number;
+    isLastBlock: boolean;
+};
+/**
+ * Proposer ideal/happy-path schedule and block sub-slot timetable.
+ *
+ * Composes a {@link ConsensusTimetable} and adds the operational budgets that only the proposer needs
+ * (`min_block_duration`, `p2p_propagation_time`, `checkpoint_proposal_prepare_time`). Used by the
+ * sequencer and checkpoint-proposal job. All getters take a target slot and return an absolute
+ * wall-clock timestamp in seconds (or sub-slot deadlines in seconds for {@link selectNextSubslot}).
+ *
+ * The single hard deadline {@link getAttestationDeadline} is inherited from the composed
+ * {@link ConsensusTimetable}, so the proposer uses one object.
+ *
+ * `maxBlocksPerCheckpoint` is computed from the local operational budgets and then clamped down to the optional
+ * network-provided value when that value is lower; a network value at or above the computed count leaves the
+ * computed count in effect. When clamping down occurs and a logger is supplied, a warning is emitted.
+ */
+export declare class ProposerTimetable extends ConsensusTimetable {
+    /** Minimum block-building time (`min_block_duration`) in seconds. */
+    readonly minBlockDuration: number;
+    /** One-way proposal/attestation propagation budget (`p2p_propagation_time`) in seconds. */
+    readonly p2pPropagationTime: number;
+    /** Local checkpoint proposal preparation budget (`checkpoint_proposal_prepare_time`) in seconds. */
+    readonly checkpointProposalPrepareTime: number;
+    /** Proposer initialization budget (`checkpoint_proposal_init_time`) reserved before the first sub-slot, in seconds. */
+    readonly checkpointProposalInitTime: number;
+    /**
+     * Effective maximum number of block sub-slots per checkpoint: the value the local operational budgets compute,
+     * clamped down to the explicit network value when that value is lower. A network value above the computed
+     * count has no effect (the computed count is used) and is not logged.
+     */
+    readonly maxBlocksPerCheckpoint: number;
+    constructor(opts: {
+        l1Constants: SlotTimingConstants;
+        blockDuration: number;
+        minBlockDuration: number;
+        p2pPropagationTime: number;
+        checkpointProposalPrepareTime: number;
+        checkpointProposalInitTime: number;
+        checkpointProposalSyncGrace?: number;
+        /** Explicit network max blocks per checkpoint; the effective value is clamped down to this when it is lower. */
+        maxBlocksPerCheckpoint?: number;
+        /** Optional logger; warns when the local budgets compute more blocks than the network value allows. */
+        logger?: Logger;
+    });
+    /**
+     * Computes the maximum number of full-duration block sub-slots in a checkpoint from the already-resolved
+     * budgets. Derived from the spec's `max_blocks_per_checkpoint = floor((last_block_build_time -
+     * first_subslot_start) / D)`, where the first sub-slot starts one `checkpoint_proposal_init_time` (`init`)
+     * after `build_frame_start`, so it simplifies to `floor((S - init - D - 2P - prepCp) / D)`.
+     */
+    private computeMaxBlocksPerCheckpoint;
+    /**
+     * Ideal time the last block must finish building by to make the ideal L1 publish path:
+     * `target_slot_start - E - D - 2P - prepCp` (= `checkpoint_proposal_send_time - prepCp`). Single value;
+     * the proposer sizes block production around the ideal L1-publish path only.
+     */
+    getLastBlockBuildTime(slot: SlotNumber): number;
+    /**
+     * Latest start at which the proposer can still squeeze in a minimum-duration block.
+     *
+     * Multi-block mode: `last_block_build_time - min_block_duration`, an ideal-derived cutoff
+     * intentionally earlier (by `P`) than the consensus receive gate would strictly allow, and
+     * conservatively no later than the final sub-slot's start cutoff in {@link selectNextSubslot}.
+     *
+     */
+    getBuildStartDeadline(slot: SlotNumber): number;
+    /** Ideal L1 publish/send time: `target_slot_start - E`. Also the ideal attestation-receipt target. */
+    getL1PublishIdealTime(slot: SlotNumber): number;
+    /**
+     * Build deadline for sub-slot `k` (zero-based): `build_frame_start + init + (k + 1) * D`.
+     *
+     * The `init` (`checkpoint_proposal_init_time`) offset reserves the proposer's sync/proposer-check/init
+     * budget at the start of the build frame, so the first sub-slot still has its full duration once the
+     * prologue finishes rather than being eaten by it.
+     */
+    getBlockBuildDeadline(slot: SlotNumber, blockIndex: number): number;
+    /** Latest time to keep waiting for txs for sub-slot `k`: `block_build_deadline(k) - min_block_duration`. */
+    getWaitForTxsDeadline(slot: SlotNumber, blockIndex: number): number;
+    /** Maximum number of full-duration block sub-slots for this timing config. */
+    getMaxBlocksPerCheckpoint(): number;
+    /**
+     * Selects the next block sub-slot to build for the target slot given the current wall-clock time.
+     *
+     * Scans sub-slots in order and picks the first whose build deadline is at least `min_block_duration`
+     * in the future. Sub-slots with insufficient remaining headroom are skipped.
+     *
+     * @param slot - Target slot the checkpoint commits to.
+     * @param now - Current wall-clock time in seconds.
+     */
+    selectNextSubslot(slot: SlotNumber, now: number): SubslotSelection;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvcG9zZXJfdGltZXRhYmxlLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvdGltZXRhYmxlL3Byb3Bvc2VyX3RpbWV0YWJsZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxVQUFVLEVBQUUsTUFBTSxzQ0FBc0MsQ0FBQztBQUN2RSxPQUFPLEtBQUssRUFBRSxNQUFNLEVBQUUsTUFBTSw0QkFBNEIsQ0FBQztBQUd6RCxPQUFPLEVBQUUsa0JBQWtCLEVBQUUsS0FBSyxtQkFBbUIsRUFBRSxNQUFNLDBCQUEwQixDQUFDO0FBRXhGLDREQUE0RDtBQUM1RCxNQUFNLE1BQU0sZ0JBQWdCLEdBQ3hCO0lBQUUsUUFBUSxFQUFFLEtBQUssQ0FBQztJQUFDLEtBQUssRUFBRSxTQUFTLENBQUM7SUFBQyxRQUFRLEVBQUUsU0FBUyxDQUFDO0lBQUMsV0FBVyxFQUFFLEtBQUssQ0FBQTtDQUFFLEdBQzlFO0lBQUUsUUFBUSxFQUFFLElBQUksQ0FBQztJQUFDLEtBQUssRUFBRSxNQUFNLENBQUM7SUFBQyxRQUFRLEVBQUUsTUFBTSxDQUFDO0lBQUMsV0FBVyxFQUFFLE9BQU8sQ0FBQTtDQUFFLENBQUM7QUFFOUU7Ozs7Ozs7Ozs7Ozs7O0dBY0c7QUFDSCxxQkFBYSxpQkFBa0IsU0FBUSxrQkFBa0I7SUFDdkQscUVBQXFFO0lBQ3JFLFNBQWdCLGdCQUFnQixFQUFFLE1BQU0sQ0FBQztJQUV6QywyRkFBMkY7SUFDM0YsU0FBZ0Isa0JBQWtCLEVBQUUsTUFBTSxDQUFDO0lBRTNDLG9HQUFvRztJQUNwRyxTQUFnQiw2QkFBNkIsRUFBRSxNQUFNLENBQUM7SUFFdEQsdUhBQXVIO0lBQ3ZILFNBQWdCLDBCQUEwQixFQUFFLE1BQU0sQ0FBQztJQUVuRDs7OztPQUlHO0lBQ0gsU0FBZ0Isc0JBQXNCLEVBQUUsTUFBTSxDQUFDO0lBRS9DLFlBQVksSUFBSSxFQUFFO1FBQ2hCLFdBQVcsRUFBRSxtQkFBbUIsQ0FBQztRQUNqQyxhQUFhLEVBQUUsTUFBTSxDQUFDO1FBQ3RCLGdCQUFnQixFQUFFLE1BQU0sQ0FBQztRQUN6QixrQkFBa0IsRUFBRSxNQUFNLENBQUM7UUFDM0IsNkJBQTZCLEVBQUUsTUFBTSxDQUFDO1FBQ3RDLDBCQUEwQixFQUFFLE1BQU0sQ0FBQztRQUNuQywyQkFBMkIsQ0FBQyxFQUFFLE1BQU0sQ0FBQztRQUNyQyxnSEFBZ0g7UUFDaEgsc0JBQXNCLENBQUMsRUFBRSxNQUFNLENBQUM7UUFDaEMsdUdBQXVHO1FBQ3ZHLE1BQU0sQ0FBQyxFQUFFLE1BQU0sQ0FBQztLQUNqQixFQXNDQTtJQUVEOzs7OztPQUtHO0lBQ0gsT0FBTyxDQUFDLDZCQUE2QjtJQVdyQzs7OztPQUlHO0lBQ0kscUJBQXFCLENBQUMsSUFBSSxFQUFFLFVBQVUsR0FBRyxNQUFNLENBUXJEO0lBRUQ7Ozs7Ozs7T0FPRztJQUNJLHFCQUFxQixDQUFDLElBQUksRUFBRSxVQUFVLEdBQUcsTUFBTSxDQUVyRDtJQUVELHNHQUFzRztJQUMvRixxQkFBcUIsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLE1BQU0sQ0FFckQ7SUFFRDs7Ozs7O09BTUc7SUFDSSxxQkFBcUIsQ0FBQyxJQUFJLEVBQUUsVUFBVSxFQUFFLFVBQVUsRUFBRSxNQUFNLEdBQUcsTUFBTSxDQUV6RTtJQUVELDRHQUE0RztJQUNyRyxxQkFBcUIsQ0FBQyxJQUFJLEVBQUUsVUFBVSxFQUFFLFVBQVUsRUFBRSxNQUFNLEdBQUcsTUFBTSxDQUV6RTtJQUVELDhFQUE4RTtJQUN2RSx5QkFBeUIsSUFBSSxNQUFNLENBRXpDO0lBRUQ7Ozs7Ozs7O09BUUc7SUFDSSxpQkFBaUIsQ0FBQyxJQUFJLEVBQUUsVUFBVSxFQUFFLEdBQUcsRUFBRSxNQUFNLEdBQUcsZ0JBQWdCLENBV3hFO0NBQ0YifQ==

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

@@ -0,0 +1 @@
+{"version":3,"file":"proposer_timetable.d.ts","sourceRoot":"","sources":["../../src/timetable/proposer_timetable.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AACvE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAGzD,OAAO,EAAE,kBAAkB,EAAE,KAAK,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAExF,4DAA4D;AAC5D,MAAM,MAAM,gBAAgB,GACxB;IAAE,QAAQ,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,SAAS,CAAC;IAAC,WAAW,EAAE,KAAK,CAAA;CAAE,GAC9E;IAAE,QAAQ,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,OAAO,CAAA;CAAE,CAAC;AAE9E;;;;;;;;;;;;;;GAcG;AACH,qBAAa,iBAAkB,SAAQ,kBAAkB;IACvD,qEAAqE;IACrE,SAAgB,gBAAgB,EAAE,MAAM,CAAC;IAEzC,2FAA2F;IAC3F,SAAgB,kBAAkB,EAAE,MAAM,CAAC;IAE3C,oGAAoG;IACpG,SAAgB,6BAA6B,EAAE,MAAM,CAAC;IAEtD,uHAAuH;IACvH,SAAgB,0BAA0B,EAAE,MAAM,CAAC;IAEnD;;;;OAIG;IACH,SAAgB,sBAAsB,EAAE,MAAM,CAAC;IAE/C,YAAY,IAAI,EAAE;QAChB,WAAW,EAAE,mBAAmB,CAAC;QACjC,aAAa,EAAE,MAAM,CAAC;QACtB,gBAAgB,EAAE,MAAM,CAAC;QACzB,kBAAkB,EAAE,MAAM,CAAC;QAC3B,6BAA6B,EAAE,MAAM,CAAC;QACtC,0BAA0B,EAAE,MAAM,CAAC;QACnC,2BAA2B,CAAC,EAAE,MAAM,CAAC;QACrC,gHAAgH;QAChH,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC,uGAAuG;QACvG,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,EAsCA;IAED;;;;;OAKG;IACH,OAAO,CAAC,6BAA6B;IAWrC;;;;OAIG;IACI,qBAAqB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAQrD;IAED;;;;;;;OAOG;IACI,qBAAqB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAErD;IAED,sGAAsG;IAC/F,qBAAqB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAErD;IAED;;;;;;OAMG;IACI,qBAAqB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAEzE;IAED,4GAA4G;IACrG,qBAAqB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAEzE;IAED,8EAA8E;IACvE,yBAAyB,IAAI,MAAM,CAEzC;IAED;;;;;;;;OAQG;IACI,iBAAiB,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,GAAG,gBAAgB,CAWxE;CACF"}

package/dest/timetable/proposer_timetable.js

@@ -0,0 +1,132 @@
+import { getDefaultCheckpointProposalSyncGrace, resolveTimingBudgets } from './budgets.js';
+import { ConsensusTimetable } from './consensus_timetable.js';
+/**
+ * Proposer ideal/happy-path schedule and block sub-slot timetable.
+ *
+ * Composes a {@link ConsensusTimetable} and adds the operational budgets that only the proposer needs
+ * (`min_block_duration`, `p2p_propagation_time`, `checkpoint_proposal_prepare_time`). Used by the
+ * sequencer and checkpoint-proposal job. All getters take a target slot and return an absolute
+ * wall-clock timestamp in seconds (or sub-slot deadlines in seconds for {@link selectNextSubslot}).
+ *
+ * The single hard deadline {@link getAttestationDeadline} is inherited from the composed
+ * {@link ConsensusTimetable}, so the proposer uses one object.
+ *
+ * `maxBlocksPerCheckpoint` is computed from the local operational budgets and then clamped down to the optional
+ * network-provided value when that value is lower; a network value at or above the computed count leaves the
+ * computed count in effect. When clamping down occurs and a logger is supplied, a warning is emitted.
+ */ export class ProposerTimetable extends ConsensusTimetable {
+    /** Minimum block-building time (`min_block_duration`) in seconds. */ minBlockDuration;
+    /** One-way proposal/attestation propagation budget (`p2p_propagation_time`) in seconds. */ p2pPropagationTime;
+    /** Local checkpoint proposal preparation budget (`checkpoint_proposal_prepare_time`) in seconds. */ checkpointProposalPrepareTime;
+    /** Proposer initialization budget (`checkpoint_proposal_init_time`) reserved before the first sub-slot, in seconds. */ checkpointProposalInitTime;
+    /**
+   * Effective maximum number of block sub-slots per checkpoint: the value the local operational budgets compute,
+   * clamped down to the explicit network value when that value is lower. A network value above the computed
+   * count has no effect (the computed count is used) and is not logged.
+   */ maxBlocksPerCheckpoint;
+    constructor(opts){
+        super({
+            l1Constants: opts.l1Constants,
+            blockDuration: opts.blockDuration,
+            checkpointProposalSyncGrace: opts.checkpointProposalSyncGrace ?? getDefaultCheckpointProposalSyncGrace(opts.blockDuration)
+        });
+        // Resolve operational budgets, applying the fast local/e2e profile for low ethereum slot durations so a
+        // fast network does not inherit the conservative production budgets (which would shrink the build window).
+        const budgets = resolveTimingBudgets(this.ethereumSlotDuration, {
+            minBlockDuration: opts.minBlockDuration,
+            p2pPropagationTime: opts.p2pPropagationTime,
+            checkpointProposalPrepareTime: opts.checkpointProposalPrepareTime,
+            checkpointProposalInitTime: opts.checkpointProposalInitTime
+        });
+        this.p2pPropagationTime = budgets.p2pPropagationTime;
+        this.checkpointProposalPrepareTime = budgets.checkpointProposalPrepareTime;
+        this.checkpointProposalInitTime = budgets.checkpointProposalInitTime;
+        // Clamp min block duration to the block duration so a single sub-slot is always startable.
+        this.minBlockDuration = Math.min(budgets.minBlockDuration, this.blockDuration);
+        const computed = this.computeMaxBlocksPerCheckpoint();
+        this.maxBlocksPerCheckpoint = opts.maxBlocksPerCheckpoint !== undefined ? Math.min(computed, opts.maxBlocksPerCheckpoint) : computed;
+        if (opts.maxBlocksPerCheckpoint !== undefined && opts.maxBlocksPerCheckpoint < computed) {
+            opts.logger?.warn(`Locally computed max blocks per checkpoint clamped down to the network-provided value`, {
+                computed,
+                maxBlocksPerCheckpoint: opts.maxBlocksPerCheckpoint
+            });
+        }
+        if (this.maxBlocksPerCheckpoint < 1) {
+            throw new Error(`Invalid timing configuration: derived ${this.maxBlocksPerCheckpoint} blocks per checkpoint for ` + `slot duration ${this.aztecSlotDuration}s and block duration ${this.blockDuration}s.`);
+        }
+    }
+    /**
+   * Computes the maximum number of full-duration block sub-slots in a checkpoint from the already-resolved
+   * budgets. Derived from the spec's `max_blocks_per_checkpoint = floor((last_block_build_time -
+   * first_subslot_start) / D)`, where the first sub-slot starts one `checkpoint_proposal_init_time` (`init`)
+   * after `build_frame_start`, so it simplifies to `floor((S - init - D - 2P - prepCp) / D)`.
+   */ computeMaxBlocksPerCheckpoint() {
+        // last_block_build_time - (build_frame_start + init) = S - init - D - 2P - prepCp.
+        const timeAvailableForBlocks = this.aztecSlotDuration - this.checkpointProposalInitTime - this.blockDuration - 2 * this.p2pPropagationTime - this.checkpointProposalPrepareTime;
+        return Math.floor(timeAvailableForBlocks / this.blockDuration);
+    }
+    /**
+   * Ideal time the last block must finish building by to make the ideal L1 publish path:
+   * `target_slot_start - E - D - 2P - prepCp` (= `checkpoint_proposal_send_time - prepCp`). Single value;
+   * the proposer sizes block production around the ideal L1-publish path only.
+   */ getLastBlockBuildTime(slot) {
+        return this.getTargetSlotStart(slot) - this.ethereumSlotDuration - this.blockDuration - 2 * this.p2pPropagationTime - this.checkpointProposalPrepareTime;
+    }
+    /**
+   * Latest start at which the proposer can still squeeze in a minimum-duration block.
+   *
+   * Multi-block mode: `last_block_build_time - min_block_duration`, an ideal-derived cutoff
+   * intentionally earlier (by `P`) than the consensus receive gate would strictly allow, and
+   * conservatively no later than the final sub-slot's start cutoff in {@link selectNextSubslot}.
+   *
+   */ getBuildStartDeadline(slot) {
+        return this.getLastBlockBuildTime(slot) - this.minBlockDuration;
+    }
+    /** Ideal L1 publish/send time: `target_slot_start - E`. Also the ideal attestation-receipt target. */ getL1PublishIdealTime(slot) {
+        return this.getTargetSlotStart(slot) - this.ethereumSlotDuration;
+    }
+    /**
+   * Build deadline for sub-slot `k` (zero-based): `build_frame_start + init + (k + 1) * D`.
+   *
+   * The `init` (`checkpoint_proposal_init_time`) offset reserves the proposer's sync/proposer-check/init
+   * budget at the start of the build frame, so the first sub-slot still has its full duration once the
+   * prologue finishes rather than being eaten by it.
+   */ getBlockBuildDeadline(slot, blockIndex) {
+        return this.getBuildFrameStart(slot) + this.checkpointProposalInitTime + (blockIndex + 1) * this.blockDuration;
+    }
+    /** Latest time to keep waiting for txs for sub-slot `k`: `block_build_deadline(k) - min_block_duration`. */ getWaitForTxsDeadline(slot, blockIndex) {
+        return this.getBlockBuildDeadline(slot, blockIndex) - this.minBlockDuration;
+    }
+    /** Maximum number of full-duration block sub-slots for this timing config. */ getMaxBlocksPerCheckpoint() {
+        return this.maxBlocksPerCheckpoint;
+    }
+    /**
+   * Selects the next block sub-slot to build for the target slot given the current wall-clock time.
+   *
+   * Scans sub-slots in order and picks the first whose build deadline is at least `min_block_duration`
+   * in the future. Sub-slots with insufficient remaining headroom are skipped.
+   *
+   * @param slot - Target slot the checkpoint commits to.
+   * @param now - Current wall-clock time in seconds.
+   */ selectNextSubslot(slot, now) {
+        const maxBlocks = this.maxBlocksPerCheckpoint;
+        for(let index = 0; index < maxBlocks; index++){
+            const deadline = this.getBlockBuildDeadline(slot, index);
+            if (deadline - now >= this.minBlockDuration) {
+                const isLastBlock = index === maxBlocks - 1;
+                return {
+                    canStart: true,
+                    index,
+                    deadline,
+                    isLastBlock
+                };
+            }
+        }
+        return {
+            canStart: false,
+            index: undefined,
+            deadline: undefined,
+            isLastBlock: false
+        };
+    }
+}

package/dest/trees/append_only_tree_snapshot.d.ts

@@ -0,0 +1,71 @@
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { BufferReader, BufferSink, FieldReader } from '@aztec-labs/foundation/serialize';
+import { inspect } from 'util';
+import { z } from 'zod';
+import type { UInt32 } from '../types/shared.js';
+/**
+ * Snapshot of an append only tree.
+ *
+ * Used in circuits to verify that tree insertions are performed correctly.
+ */
+export declare class AppendOnlyTreeSnapshot {
+    /**
+     * Root of the append only tree when taking the snapshot.
+     */
+    root: Fr;
+    /**
+     * Index of the next available leaf in the append only tree.
+     *
+     * Note: We include the next available leaf index in the snapshot so that the snapshot can be used to verify that
+     *       the insertion was performed at the correct place. If we only verified tree root then it could happen that
+     *       some leaves would get overwritten and the tree root check would still pass.
+     *       TLDR: We need to store the next available leaf index to ensure that the "append only" property was
+     *             preserved when verifying state transitions.
+     */
+    nextAvailableLeafIndex: UInt32;
+    constructor(
+    /**
+     * Root of the append only tree when taking the snapshot.
+     */
+    root: Fr, 
+    /**
+     * Index of the next available leaf in the append only tree.
+     *
+     * Note: We include the next available leaf index in the snapshot so that the snapshot can be used to verify that
+     *       the insertion was performed at the correct place. If we only verified tree root then it could happen that
+     *       some leaves would get overwritten and the tree root check would still pass.
+     *       TLDR: We need to store the next available leaf index to ensure that the "append only" property was
+     *             preserved when verifying state transitions.
+     */
+    nextAvailableLeafIndex: UInt32);
+    static get schema(): z.ZodPipe<z.ZodObject<{
+        root: z.ZodType<Fr, string, z.core.$ZodTypeInternals<Fr, string>>;
+        nextAvailableLeafIndex: z.ZodPipe<z.ZodUnion<readonly [z.ZodBigInt, z.ZodNumber, z.ZodString]>, z.ZodCoercedNumber<string | number | bigint>>;
+    }, z.core.$strip>, z.ZodTransform<AppendOnlyTreeSnapshot, {
+        root: Fr;
+        nextAvailableLeafIndex: number;
+    }>>;
+    getSize(): number;
+    toBuffer(): Buffer;
+    toBuffer(sink: BufferSink): void;
+    toFields(): Fr[];
+    toString(): string;
+    static fromBuffer(buffer: Buffer | BufferReader): AppendOnlyTreeSnapshot;
+    static fromString(str: string): AppendOnlyTreeSnapshot;
+    static fromFields(fields: Fr[] | FieldReader): AppendOnlyTreeSnapshot;
+    toAbi(): [`0x${string}`, number];
+    static empty(): AppendOnlyTreeSnapshot;
+    /**
+     * Creates an AppendOnlyTreeSnapshot instance from a plain object without Zod validation.
+     * This method is optimized for performance and skips validation, making it suitable
+     * for deserializing trusted data (e.g., from C++ via MessagePack).
+     * @param obj - Plain object containing AppendOnlyTreeSnapshot fields
+     * @returns An AppendOnlyTreeSnapshot instance
+     */
+    static fromPlainObject(obj: any): AppendOnlyTreeSnapshot;
+    isEmpty(): boolean;
+    [inspect.custom](): string;
+    equals(other: this): boolean;
+    static random(): AppendOnlyTreeSnapshot;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXBwZW5kX29ubHlfdHJlZV9zbmFwc2hvdC5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3RyZWVzL2FwcGVuZF9vbmx5X3RyZWVfc25hcHNob3QudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLHFDQUFxQyxDQUFDO0FBRXpELE9BQU8sRUFBRSxZQUFZLEVBQUUsVUFBVSxFQUFFLFdBQVcsRUFBbUIsTUFBTSxrQ0FBa0MsQ0FBQztBQUUxRyxPQUFPLEVBQUUsT0FBTyxFQUFFLE1BQU0sTUFBTSxDQUFDO0FBQy9CLE9BQU8sRUFBRSxDQUFDLEVBQUUsTUFBTSxLQUFLLENBQUM7QUFFeEIsT0FBTyxLQUFLLEVBQUUsTUFBTSxFQUFFLE1BQU0sb0JBQW9CLENBQUM7QUFFakQ7Ozs7R0FJRztBQUNILHFCQUFhLHNCQUFzQjtJQUUvQjs7T0FFRztJQUNJLElBQUksRUFBRSxFQUFFO0lBQ2Y7Ozs7Ozs7O09BUUc7SUFDSSxzQkFBc0IsRUFBRSxNQUFNO0lBZHZDO0lBQ0U7O09BRUc7SUFDSSxJQUFJLEVBQUUsRUFBRTtJQUNmOzs7Ozs7OztPQVFHO0lBQ0ksc0JBQXNCLEVBQUUsTUFBTSxFQUNuQztJQUVKLE1BQU0sS0FBSyxNQUFNOzs7Ozs7UUFPaEI7SUFFRCxPQUFPLFdBRU47SUFFRCxRQUFRLElBQUksTUFBTSxDQUFDO0lBQ25CLFFBQVEsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLElBQUksQ0FBQztJQVFqQyxRQUFRLElBQUksRUFBRSxFQUFFLENBRWY7SUFFRCxRQUFRLElBQUksTUFBTSxDQUVqQjtJQUVELE1BQU0sQ0FBQyxVQUFVLENBQUMsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLEdBQUcsc0JBQXNCLENBR3ZFO0lBRUQsTUFBTSxDQUFDLFVBQVUsQ0FBQyxHQUFHLEVBQUUsTUFBTSxHQUFHLHNCQUFzQixDQUVyRDtJQUVELE1BQU0sQ0FBQyxVQUFVLENBQUMsTUFBTSxFQUFFLEVBQUUsRUFBRSxHQUFHLFdBQVcsR0FBRyxzQkFBc0IsQ0FJcEU7SUFFRCxLQUFLLElBQUksQ0FBQyxLQUFLLE1BQU0sRUFBRSxFQUFFLE1BQU0sQ0FBQyxDQUUvQjtJQUVELE1BQU0sQ0FBQyxLQUFLLDJCQUVYO0lBRUQ7Ozs7OztPQU1HO0lBQ0gsTUFBTSxDQUFDLGVBQWUsQ0FBQyxHQUFHLEVBQUUsR0FBRyxHQUFHLHNCQUFzQixDQUV2RDtJQUVELE9BQU8sSUFBSSxPQUFPLENBRWpCO0lBRUQsQ0FBQyxPQUFPLENBQUMsTUFBTSxDQUFDLFdBSWY7SUFFTSxNQUFNLENBQUMsS0FBSyxFQUFFLElBQUksV0FFeEI7SUFFRCxNQUFNLENBQUMsTUFBTSwyQkFFWjtDQUNGIn0=

package/dest/trees/append_only_tree_snapshot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"append_only_tree_snapshot.d.ts","sourceRoot":"","sources":["../../src/trees/append_only_tree_snapshot.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,qCAAqC,CAAC;AAEzD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAmB,MAAM,kCAAkC,CAAC;AAE1G,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAC/B,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAEjD;;;;GAIG;AACH,qBAAa,sBAAsB;IAE/B;;OAEG;IACI,IAAI,EAAE,EAAE;IACf;;;;;;;;OAQG;IACI,sBAAsB,EAAE,MAAM;IAdvC;IACE;;OAEG;IACI,IAAI,EAAE,EAAE;IACf;;;;;;;;OAQG;IACI,sBAAsB,EAAE,MAAM,EACnC;IAEJ,MAAM,KAAK,MAAM;;;;;;QAOhB;IAED,OAAO,WAEN;IAED,QAAQ,IAAI,MAAM,CAAC;IACnB,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IAQjC,QAAQ,IAAI,EAAE,EAAE,CAEf;IAED,QAAQ,IAAI,MAAM,CAEjB;IAED,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,sBAAsB,CAGvE;IAED,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,sBAAsB,CAErD;IAED,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,EAAE,GAAG,WAAW,GAAG,sBAAsB,CAIpE;IAED,KAAK,IAAI,CAAC,KAAK,MAAM,EAAE,EAAE,MAAM,CAAC,CAE/B;IAED,MAAM,CAAC,KAAK,2BAEX;IAED;;;;;;OAMG;IACH,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,GAAG,sBAAsB,CAEvD;IAED,OAAO,IAAI,OAAO,CAEjB;IAED,CAAC,OAAO,CAAC,MAAM,CAAC,WAIf;IAEM,MAAM,CAAC,KAAK,EAAE,IAAI,WAExB;IAED,MAAM,CAAC,MAAM,2BAEZ;CACF"}

package/dest/trees/append_only_tree_snapshot.js

@@ -0,0 +1,95 @@
+var _computedKey;
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { schemas } from '@aztec-labs/foundation/schemas';
+import { BufferReader, BufferSink, FieldReader, serializeToSink } from '@aztec-labs/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec-labs/foundation/string';
+import { inspect } from 'util';
+import { z } from 'zod';
+_computedKey = inspect.custom;
+/**
+ * Snapshot of an append only tree.
+ *
+ * Used in circuits to verify that tree insertions are performed correctly.
+ */ export class AppendOnlyTreeSnapshot {
+    root;
+    nextAvailableLeafIndex;
+    constructor(/**
+     * Root of the append only tree when taking the snapshot.
+     */ root, /**
+     * Index of the next available leaf in the append only tree.
+     *
+     * Note: We include the next available leaf index in the snapshot so that the snapshot can be used to verify that
+     *       the insertion was performed at the correct place. If we only verified tree root then it could happen that
+     *       some leaves would get overwritten and the tree root check would still pass.
+     *       TLDR: We need to store the next available leaf index to ensure that the "append only" property was
+     *             preserved when verifying state transitions.
+     */ nextAvailableLeafIndex){
+        this.root = root;
+        this.nextAvailableLeafIndex = nextAvailableLeafIndex;
+    }
+    static get schema() {
+        return z.object({
+            root: schemas.Fr,
+            nextAvailableLeafIndex: schemas.UInt32
+        }).transform(({ root, nextAvailableLeafIndex })=>new AppendOnlyTreeSnapshot(root, nextAvailableLeafIndex));
+    }
+    getSize() {
+        return this.root.size + 4;
+    }
+    toBuffer(sink) {
+        if (!sink) {
+            return BufferSink.serialize(this);
+        }
+        serializeToSink(sink, this.root, this.nextAvailableLeafIndex);
+    }
+    toFields() {
+        return [
+            this.root,
+            new Fr(this.nextAvailableLeafIndex)
+        ];
+    }
+    toString() {
+        return bufferToHex(this.toBuffer());
+    }
+    static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        return new AppendOnlyTreeSnapshot(Fr.fromBuffer(reader), reader.readNumber());
+    }
+    static fromString(str) {
+        return AppendOnlyTreeSnapshot.fromBuffer(hexToBuffer(str));
+    }
+    static fromFields(fields) {
+        const reader = FieldReader.asReader(fields);
+        return new AppendOnlyTreeSnapshot(reader.readField(), Number(reader.readField().toBigInt()));
+    }
+    toAbi() {
+        return [
+            this.root.toString(),
+            this.nextAvailableLeafIndex
+        ];
+    }
+    static empty() {
+        return new AppendOnlyTreeSnapshot(Fr.ZERO, 0);
+    }
+    /**
+   * Creates an AppendOnlyTreeSnapshot instance from a plain object without Zod validation.
+   * This method is optimized for performance and skips validation, making it suitable
+   * for deserializing trusted data (e.g., from C++ via MessagePack).
+   * @param obj - Plain object containing AppendOnlyTreeSnapshot fields
+   * @returns An AppendOnlyTreeSnapshot instance
+   */ static fromPlainObject(obj) {
+        return new AppendOnlyTreeSnapshot(Fr.fromPlainObject(obj.root), obj.nextAvailableLeafIndex);
+    }
+    isEmpty() {
+        return this.root.isZero() && this.nextAvailableLeafIndex === 0;
+    }
+    [_computedKey]() {
+        return `AppendOnlyTreeSnapshot { root: ${this.root.toString()}, nextAvailableLeafIndex: ${this.nextAvailableLeafIndex} }`;
+    }
+    equals(other) {
+        return this.root.equals(other.root) && this.nextAvailableLeafIndex === other.nextAvailableLeafIndex;
+    }
+    static random() {
+        return new AppendOnlyTreeSnapshot(Fr.random(), Math.floor(Math.random() * 1000));
+    }
+}

package/dest/trees/database_public_state_source.d.ts

@@ -0,0 +1,11 @@
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import type { AztecAddress } from '../aztec-address/index.js';
+import type { MerkleTreeReadOperations } from '../interfaces/merkle_tree_operations.js';
+import type { PublicStateSource } from '../interfaces/public_state_source.js';
+export type { PublicStateSource };
+export declare class DatabasePublicStateSource implements PublicStateSource {
+    private db;
+    constructor(db: MerkleTreeReadOperations);
+    storageRead(contractAddress: AztecAddress, slot: Fr): Promise<Fr>;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZGF0YWJhc2VfcHVibGljX3N0YXRlX3NvdXJjZS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3RyZWVzL2RhdGFiYXNlX3B1YmxpY19zdGF0ZV9zb3VyY2UudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLHFDQUFxQyxDQUFDO0FBRXpELE9BQU8sS0FBSyxFQUFFLFlBQVksRUFBRSxNQUFNLDJCQUEyQixDQUFDO0FBRTlELE9BQU8sS0FBSyxFQUFFLHdCQUF3QixFQUFFLE1BQU0seUNBQXlDLENBQUM7QUFDeEYsT0FBTyxLQUFLLEVBQUUsaUJBQWlCLEVBQUUsTUFBTSxzQ0FBc0MsQ0FBQztBQUk5RSxZQUFZLEVBQUUsaUJBQWlCLEVBQUUsQ0FBQztBQUVsQyxxQkFBYSx5QkFBMEIsWUFBVyxpQkFBaUI7SUFDckQsT0FBTyxDQUFDLEVBQUU7SUFBdEIsWUFBb0IsRUFBRSxFQUFFLHdCQUF3QixFQUFJO0lBRTlDLFdBQVcsQ0FBQyxlQUFlLEVBQUUsWUFBWSxFQUFFLElBQUksRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLEVBQUUsQ0FBQyxDQWN0RTtDQUNGIn0=

package/dest/trees/database_public_state_source.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"database_public_state_source.d.ts","sourceRoot":"","sources":["../../src/trees/database_public_state_source.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,qCAAqC,CAAC;AAEzD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAE9D,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,yCAAyC,CAAC;AACxF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AAI9E,YAAY,EAAE,iBAAiB,EAAE,CAAC;AAElC,qBAAa,yBAA0B,YAAW,iBAAiB;IACrD,OAAO,CAAC,EAAE;IAAtB,YAAoB,EAAE,EAAE,wBAAwB,EAAI;IAE9C,WAAW,CAAC,eAAe,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CActE;CACF"}

package/dest/trees/database_public_state_source.js

@@ -0,0 +1,18 @@
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { computePublicDataTreeLeafSlot } from '../hash/hash.js';
+import { MerkleTreeId } from './merkle_tree_id.js';
+export class DatabasePublicStateSource {
+    db;
+    constructor(db){
+        this.db = db;
+    }
+    async storageRead(contractAddress, slot) {
+        const leafSlot = (await computePublicDataTreeLeafSlot(contractAddress, slot)).toBigInt();
+        const lowLeafResult = await this.db.getPreviousValueIndex(MerkleTreeId.PUBLIC_DATA_TREE, leafSlot);
+        if (!lowLeafResult || !lowLeafResult.alreadyPresent) {
+            return Fr.ZERO;
+        }
+        const preimage = await this.db.getLeafPreimage(MerkleTreeId.PUBLIC_DATA_TREE, lowLeafResult.index);
+        return preimage.leaf.value;
+    }
+}