Struct ProofCachingLayer 

pub struct ProofCachingLayer { /* private fields */ }

An LFU-evicting, TTL-expiring cache for proof results.

The internal store is a plain Vec intentionally: the default capacity is 256 entries so linear scan overhead is negligible, and it avoids the overhead of a hash-map for this small working set.

Implementations

impl ProofCachingLayer

pub fn new(config: ProofCacheConfig) -> Self

Create a new caching layer with the supplied configuration.

pub fn lookup( &mut self, key: &ProofCacheKey, now_secs: u64, ) -> Option<&CachedProof>

Look up a proof by key.

• Stale entries (TTL exceeded) are skipped and treated as misses.
• On a hit, access_count and last_accessed_secs of the entry are updated in place, and stats.hits is incremented.
• On a miss, stats.misses is incremented.

Returns a shared reference into self.entries on success.

pub fn insert(&mut self, proof: CachedProof)

Insert a proof into the cache.

• If an entry with the same key already exists it is replaced.
• If the cache is at capacity, the entry with the lowest access_count is evicted first (LFU policy), and stats.evictions is incremented.

pub fn invalidate_kb_version(&mut self, old_version: u64)

Remove all entries whose key.kb_version == old_version (when invalidate_on_kb_change is true).

stats.invalidations is incremented by the number of entries removed.

pub fn evict_stale(&mut self, now_secs: u64) -> usize

Remove all stale entries and return the number removed.

pub fn stats(&self) -> &ProofCacheStats

Return a shared reference to the current statistics.

pub fn len(&self) -> usize

Number of entries currently in the cache.

pub fn is_empty(&self) -> bool

true if the cache holds no entries.

Trait Implementations

impl Debug for ProofCachingLayer

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ProofCachingLayer

fn default() -> Self

Returns the “default value” for a type.