3bb30754d9
## Overview There are forked chains which get referenced by blocks and attestations on a network. Typically if these chains are very long, we stop looking up the chain and downvote the peer. In extreme circumstances, many peers are on many chains, the chains can be very deep and become time consuming performing lookups. This PR adds a cache to known failed chain lookups. This prevents us from starting a parent-lookup (or stopping one half way through) if we have attempted the chain lookup in the past.
8 lines
150 B
Rust
8 lines
150 B
Rust
//! A library to provide fast and efficient LRU Cache's without updating.
|
|
|
|
mod space;
|
|
mod time;
|
|
|
|
pub use space::LRUCache;
|
|
pub use time::LRUTimeCache;
|