this seems to suggest that there is no relationship between layers of the resolution pyramid, right?

what I am getting at is: how would I structure an oct-tree or a quad tree with this? I specifically want to (performantly) traverse only chunks that are within a query region.

so the chunks are row-major... and we are making a distinction between the "N" dimensions of space over which a vertex is indexed, and the remaining "columns" aka dimensions, known here as vertex "Attributes" which are stored elsewhere yes?