Struct OptimizedProofCache 

pub struct OptimizedProofCache { /* private fields */ }

Optimized proof cache with hash table for O(1) operations.

Uses open addressing with linear probing for collision resolution. Cache-line aligned entries minimize memory access overhead.

Implementations

impl OptimizedProofCache

pub const fn new() -> Self

Creates a new empty optimized proof cache.

pub const fn len(&self) -> usize

Returns the number of active entries.

pub const fn is_empty(&self) -> bool

Returns true if cache is empty.

pub const fn is_full(&self) -> bool

Returns true if cache is full.

pub fn insert( &mut self, mutation_hash: [u8; 32], nonce: u64, proof_id: u32, current_time_ns: u64, ) -> Result<(), CacheError>

Inserts a new proof into the cache (O(1) amortized).

Uses open addressing with linear probing.

pub fn verify_and_consume( &mut self, mutation_hash: &[u8; 32], nonce: u64, current_time_ns: u64, ) -> Result<u32, CacheError>

Verifies and consumes a proof (O(1) amortized, <100ns target).

This is the hot path - optimized for:

• Single hash computation
• Minimal cache line accesses
• Single atomic write for consumption

pub fn exists( &self, mutation_hash: &[u8; 32], nonce: u64, current_time_ns: u64, ) -> bool

Checks if a proof exists without consuming it.

pub fn evict_expired(&mut self, current_time_ns: u64)

Evicts all expired entries.

pub fn clear(&mut self)

Clears all entries.

pub const fn generation(&self) -> u64

Returns the current generation counter.

Trait Implementations

impl Debug for OptimizedProofCache

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

Formats the value using the given formatter.

impl Default for OptimizedProofCache

fn default() -> Self

Returns the “default value” for a type.