Review memory/performance trade off for SszVectorImpl.createCache
Description
Would be worth investigating if the child view cache we use for large SszVectorImpls is getting the best performance bang for memory buck. For large vectors we are using a default sized ArrayIntCache which starts with a backing array of size 16 but if we then access an element right at the end of the vector it will resize to the full size of the vector using all the memory. If we access close to the end, then further along it would have to resize and copy the already large array.
Depending on access patterns we may be better just allocating the full size backing array up front, or using a IntHashMap or LimitedMap based IntCache implementation which only caches recently accessed child views rather than allocating a full array.