Struct CertVerifier 

pub struct CertVerifier<T: NodeType, C: Verifiable<T>> {
    tasks: JoinMap<C::Key, Option<ValidCert<C::Output>>>,
    pending_task: BTreeMap<C::Key, HashMap<T::SignatureKey, C>>,
    pending_membership: BTreeMap<C::Key, HashMap<T::SignatureKey, C>>,
    completed: BTreeSet<C::Key>,
    lower_bound: Option<C::Key>,
    membership: EpochMembershipCoordinator<T>,
    upgrade_lock: UpgradeLock<T>,
    invalid_certs: u64,
}

Verifies certificates off the main coordinator thread.

The threshold-signature check is slow (> 1ms), so running it inline would stall the consensus loop. Each item’s check runs in a spawn_blocking task; next() yields only those that pass. An item whose epoch membership isn’t known yet is held in pending_membership and retried on Self::retry_pending.

Items are deduplicated per (Verifiable::Key, sender) and verified one at a time per key, trying the next sender’s item if one proves invalid; a faulty sender can neither shadow a key nor hold more than one slot per key. Since intake bounds the key space, memory is bounded by (admissible keys * committee size).

Fields

tasks: JoinMap<C::Key, Option<ValidCert<C::Output>>>

pending_task: BTreeMap<C::Key, HashMap<T::SignatureKey, C>>

pending_membership: BTreeMap<C::Key, HashMap<T::SignatureKey, C>>

completed: BTreeSet<C::Key>

lower_bound: Option<C::Key>

membership: EpochMembershipCoordinator<T>

upgrade_lock: UpgradeLock<T>

invalid_certs: u64

Implementations

impl<T: NodeType, C: Verifiable<T> + Send + 'static> CertVerifier<T, C>

pub fn new( membership: EpochMembershipCoordinator<T>, upgrade_lock: UpgradeLock<T>, ) -> Self

pub fn verify( &mut self, sender: T::SignatureKey, cert: C, ) -> Option<EpochNumber>

Submit an item received from the network for verification. If the epoch’s membership isn’t ready the item is held and its epoch returned so the caller can drive that epoch’s catchup. Duplicates are dropped.

pub fn mark_completed(&mut self, key: C::Key)

Record that this key’s item was completed by other means.

This can happen locally from votes for example.

pub fn retry_pending(&mut self) -> Vec<EpochNumber>

Re-attempt any items deferred because their epoch stake table wasn’t available. Called when new epoch data arrives. Returns the epochs whose stake table is still missing so the caller can keep driving their catchup.

pub async fn next(&mut self) -> Option<ValidCert<C::Output>>

pub fn gc(&mut self, key: C::Key)

pub fn num_invalid_certs(&self) -> u64

fn next_pending_sender(&mut self, k: C::Key) -> Option<(T::SignatureKey, C)>

fn is_stale(&self, key: C::Key) -> bool