On October 5th, Vitalik released a new article titled "Memory access is O(N^(1/3))" discussing memory access complexity, exploring the issue of "memory access" complexity in data structures and algorithms, and proposing that in certain architectures or models, the cost of accessing memory may have an upper bound of O(N^(1/3)). He pointed out that the time complexity of classical sorting algorithms is O(N log N), and when considering memory access bottlenecks, it is necessary to re-examine the efficiency analysis for large-scale data sets.
