Ethereum co-founder Vitalik Buterin has published a new article titled "Memory access is O(N^(1/3))," challenging the traditional assumption that memory access complexity is O(1). Buterin argues that the actual complexity should be O(N^(1/3), meaning that if memory capacity increases eightfold, access time approximately doubles. He supports his argument with insights from physical principles and computer architecture, highlighting the implications for cryptography and algorithm optimization. Buterin calls for future computational models to more accurately reflect memory hierarchy and physical constraints.