Open
Description
Preliminary read: https://eth2book.info/capella/part2/building_blocks/shuffling/#a-full-shuffle
Full shuffle implementation: #467
Using compute_shuffled_index
is quite slow, so instead of computing it for every index that we care about. Instead we should shuffle the whole list once and then query each index. Maybe we'll need some type of cache for this.
Some places where this function is used
Acceptance criteria:
- There should be some type of benchmark that shows the improvement of performance from using one function vs the other
Metadata
Metadata
Assignees
Type
Projects
Status
Backlog