Neat. Although a flat memory space / full file approach would be nice, I wonder if a paging scheme would be possible? Where you would only need all possible f

Neat. Although a flat memory space / full file approach would be nice, I wonder if a paging scheme would be possible? Where you would only need all possible finite strings of length N, where N would ideally be the max page size of RAM, but could be less if the substring could not be found within a reasonable offset... Ignoring compression speed, I suspect it'd have a practical limitation where using a maximum offset would mean that some strings wouldn't be as big as the cell needed to describe them. That's usually the gotcha in schemes like this... In order to entertain this, I think all possible 12 byte strings (64bit offset + 32bit size) would need to be found within whatever a reasonable amount of storage is. I suppose the computational challenge is "How big an offset is required to have all possible strings of length N?"