## Issue Addressed NA ## Proposed Changes - Adds a new function to allow getting a state with a bad state root history for attestation verification. This reduces unnecessary tree hashing during attestation processing, which accounted for 23% of memory allocations (by bytes) in a recent `heaptrack` observation. - Don't clone caches on intermediate epoch-boundary states during block processing. - Reject blocks that are known to fork choice earlier during gossip processing, instead of waiting until after state has been loaded (this only happens in edge-case). - Avoid multiple re-allocations by creating a "forced" exact size iterator. ## Additional Info NA |
||
|---|---|---|
| .. | ||
| impls | ||
| chunked_iter.rs | ||
| chunked_vector.rs | ||
| config.rs | ||
| errors.rs | ||
| forwards_iter.rs | ||
| hot_cold_store.rs | ||
| impls.rs | ||
| iter.rs | ||
| leveldb_store.rs | ||
| lib.rs | ||
| memory_store.rs | ||
| metrics.rs | ||
| partial_beacon_state.rs | ||