so right now we have process thinks it has a linear memory to itself, imagines it can write anywhere. writes trigger the expansion of a complex sparse tree dat

so right now we have process thinks it has a linear memory to itself, imagines it can write anywhere. writes trigger the expansion of a complex sparse tree data structure transparently converts virtual linear address space to non-contiguous actual locations in main memory the R1000 is program can repeatedly ask for an x KiB page, is given an id, which is actually an index into an array that holds the actual RAM address. data is fetched with an id+offset, which is range/pid checked against metadata in the array. the ids a program gets back aren't guaranteed to be sequential. BUT the array is dense, which is why no tree structure is needed. dynamic stacks have a little extra work to do, a data return pointer in addition to an instruction return pointer.