pub fn uniform_hashed_keys_chunk(chunk_id: u64, chunk_count: u64) -> ops::RangeInclusive<H256> {
    assert!(chunk_count > 0, "`chunk_count` must be positive");
    assert!(
        chunk_id < chunk_count,
        "Chunk index {} exceeds count {}",
        chunk_id,
        chunk_count
    );

    let mut stride = U256::MAX / chunk_count;
    let stride_minus_one = if stride < U256::MAX {
        stride += U256::one();
        stride - 1
    } else {
        stride // `stride` is really 1 << 256 == U256::MAX + 1
    };

    let start = stride * chunk_id;
    let (mut end, is_overflow) = stride_minus_one.overflowing_add(start);
    if is_overflow {
        end = U256::MAX;
    }
    u256_to_h256(start)..=u256_to_h256(end)
}
Returns a chunk of `hashed_keys` with 0-based index `chunk_id` among `count`.

Chunks do not intersect and jointly cover the entire `hashed_key` space. If `hashed_key`s
are uniformly distributed (which is the case), the returned ranges are expected to contain
the same number of entries.

Used by multiple components during snapshot creation and recovery.

# Panics

Panics if `chunk_count == 0` or `chunk_id >= chunk_count`.
core/lib/types/src/snapshots.rs