Vitalik Buterin personal blog
Memory access is O(N^[1/3])
In computer science, we often compare the efficiency of algorithms by describing their runtime as a function of the size of the input. Sorting is O(n * log(n)), meaning that sorting a list of N items takes an amount of time proportional to the number of items multiplied by its logarithm. Matrix multiplication is…
- Points
- 189
- HN comments
- 132
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSystems & Performance2025
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Oct 5, 2025 | Memory access is O(N^[1/3]) by jxmorris12 | 189 | 132 |
