Alight

    /// Coarse block timestamps require a long window and do not measure first-seen latency.    pub fn mean_slot_ms(self) -> Option<f64> {        let slots = self.end_slot.checked_sub(self.start_slot)?;        let seconds = self.end_unix_s.checked_sub(self.start_unix_s)?;        if slots == 0 || seconds <= 0 {            return None;        }        Some(seconds as f64 * 1000.0 / slots as f64)    }} #[cfg(test)]mod tests {    use super::*;    #[test]    fn one_process_has_one_comparable_monotonic_origin() {        let (a, start) = process_clock_origin();        let (b, second) = process_clock_origin();        assert_eq!(a, b);        assert_eq!(start, second);    }     #[test]    fn expiry_needs_both_strict_height_and_absence() {

1. Line 99 let slots = self.end_slot.checked_sub(self.start_slot)?;: Uses checked arithmetic so overflow fails instead of wrapping.
2. Line 112 fn one_process_has_one_comparable_monotonic_origin() {: Checks that a stored pubkey field matches the passed account.

            if bs58::decode(identity)                .into_vec()                .map_or(true, |b| b.len() != 32)            {                return Err(ProbeError::Format);            }            for relative in relative_slots.as_array().ok_or(ProbeError::Format)? {                let relative = relative                    .as_u64()                    .filter(|s| *s < slots_in_epoch)                    .ok_or(ProbeError::Format)?;                let slot = first_slot.checked_add(relative).ok_or(ProbeError::Format)?;                if slots.insert(slot, identity.clone()).is_some() {                    return Err(ProbeError::Format);                }            }        }        if slots.len() as u64 != slots_in_epoch {            return Err(ProbeError::Format);        }        let mut stakes = BTreeMap::<String, u64>::new();        for group in ["current", "delinquent"] {            for vote in raw["getVoteAccounts"][group]                .as_array()

1. Line 72 let slot = first_slot.checked_add(relative).ok_or(ProbeError::Format)?;: Uses checked arithmetic so overflow fails instead of wrapping.
2. Line 81 let mut stakes = BTreeMap::<String, u64>::new();: Touches staking state: the amount locked and when it was locked.