Files
lighthouse/beacon_node/beacon_chain/src/pending_payload_envelopes.rs
Michael Sproul cf3d5e285e Gloas spec v1.7.0-alpha.5 and beacon_chain tests (#8998)
Fix database pruning post-Gloas


  - Fix DB pruning logic (and state summaries DAG)
- Get the `beacon_chain` tests running with `FORK_NAME=gloas` 🎉


Co-Authored-By: Michael Sproul <michael@sigmaprime.io>

Co-Authored-By: Jimmy Chen <jchen.tc@gmail.com>

Co-Authored-By: Eitan Seri- Levi <eserilev@gmail.com>

Co-Authored-By: dapplion <35266934+dapplion@users.noreply.github.com>

Co-Authored-By: Eitan Seri-Levi <eserilev@ucsc.edu>
2026-04-21 06:29:15 +00:00

153 lines
4.7 KiB
Rust

//! Provides the `PendingPayloadEnvelopes` cache for storing execution payload envelopes
//! that have been produced during local block production.
//!
//! For local building, the envelope is created during block production.
//! This cache holds the envelopes temporarily until the validator fetches, signs,
//! and publishes the payload.
use std::collections::HashMap;
use types::{EthSpec, ExecutionPayloadEnvelope, Slot};
/// Cache for pending execution payload envelopes awaiting publishing.
///
/// Envelopes are keyed by slot and pruned based on slot age.
/// This cache is only used for local building.
pub struct PendingPayloadEnvelopes<E: EthSpec> {
/// Maximum number of slots to keep envelopes before pruning.
max_slot_age: u64,
/// The envelopes, keyed by slot.
envelopes: HashMap<Slot, ExecutionPayloadEnvelope<E>>,
}
impl<E: EthSpec> Default for PendingPayloadEnvelopes<E> {
fn default() -> Self {
Self::new(Self::DEFAULT_MAX_SLOT_AGE)
}
}
impl<E: EthSpec> PendingPayloadEnvelopes<E> {
/// Default maximum slot age before pruning (2 slots).
pub const DEFAULT_MAX_SLOT_AGE: u64 = 2;
/// Create a new cache with the specified maximum slot age.
pub fn new(max_slot_age: u64) -> Self {
Self {
max_slot_age,
envelopes: HashMap::new(),
}
}
/// Insert a pending envelope into the cache.
pub fn insert(&mut self, slot: Slot, envelope: ExecutionPayloadEnvelope<E>) {
// TODO(gloas): we may want to check for duplicates here, which shouldn't be allowed
self.envelopes.insert(slot, envelope);
}
/// Get a pending envelope by slot.
pub fn get(&self, slot: Slot) -> Option<&ExecutionPayloadEnvelope<E>> {
self.envelopes.get(&slot)
}
/// Remove and return a pending envelope by slot.
pub fn remove(&mut self, slot: Slot) -> Option<ExecutionPayloadEnvelope<E>> {
self.envelopes.remove(&slot)
}
/// Check if an envelope exists for the given slot.
pub fn contains(&self, slot: Slot) -> bool {
self.envelopes.contains_key(&slot)
}
/// Prune envelopes older than `current_slot - max_slot_age`.
///
/// This removes stale envelopes from blocks that were never published.
// TODO(gloas) implement pruning
pub fn prune(&mut self, current_slot: Slot) {
let min_slot = current_slot.saturating_sub(self.max_slot_age);
self.envelopes.retain(|slot, _| *slot >= min_slot);
}
/// Returns the number of pending envelopes in the cache.
pub fn len(&self) -> usize {
self.envelopes.len()
}
/// Returns true if the cache is empty.
pub fn is_empty(&self) -> bool {
self.envelopes.is_empty()
}
}
#[cfg(test)]
mod tests {
use super::*;
use types::{ExecutionPayloadGloas, ExecutionRequests, Hash256, MainnetEthSpec};
type E = MainnetEthSpec;
fn make_envelope(slot: Slot) -> ExecutionPayloadEnvelope<E> {
ExecutionPayloadEnvelope {
payload: ExecutionPayloadGloas {
slot_number: slot,
..ExecutionPayloadGloas::default()
},
execution_requests: ExecutionRequests::default(),
builder_index: 0,
beacon_block_root: Hash256::ZERO,
}
}
#[test]
fn insert_and_get() {
let mut cache = PendingPayloadEnvelopes::<E>::default();
let slot = Slot::new(1);
let envelope = make_envelope(slot);
assert!(!cache.contains(slot));
assert_eq!(cache.len(), 0);
cache.insert(slot, envelope.clone());
assert!(cache.contains(slot));
assert_eq!(cache.len(), 1);
assert_eq!(cache.get(slot), Some(&envelope));
}
#[test]
fn remove() {
let mut cache = PendingPayloadEnvelopes::<E>::default();
let slot = Slot::new(1);
let envelope = make_envelope(slot);
cache.insert(slot, envelope.clone());
assert!(cache.contains(slot));
let removed = cache.remove(slot);
assert_eq!(removed, Some(envelope));
assert!(!cache.contains(slot));
assert_eq!(cache.len(), 0);
}
#[test]
fn prune_old_envelopes() {
let mut cache = PendingPayloadEnvelopes::<E>::new(2);
// Insert envelope at slot 5
let slot_1 = Slot::new(5);
cache.insert(slot_1, make_envelope(slot_1));
// Insert envelope at slot 10
let slot_2 = Slot::new(10);
cache.insert(slot_2, make_envelope(slot_2));
assert_eq!(cache.len(), 2);
// Prune at slot 10 with max_slot_age=2, should keep slots >= 8
cache.prune(Slot::new(10));
assert_eq!(cache.len(), 1);
assert!(!cache.contains(slot_1)); // slot 5 < 8, pruned
assert!(cache.contains(slot_2)); // slot 10 >= 8, kept
}
}