No one claimed this is an objectively superior data structure. Even the author presented benchmark numbers that showed that in some scenarios (calculating the sum) this data structure is slower than std::vector in all data sizes. To me, the author's claim isn't extraordinary at all. He simply offered a new data structure with different set of trade offs compared with arrays and linked lists. Also I don't think the author hid the trade offs in fine print. It's literally present in the first table of Big O complexities, and the first benchmark result literally shows his data structure beaten soundly by std::vector.