I would like a schema to represent integer numbers starting with 0, without any limit (assuming access to infinite linear storage).
Here's a schema that can represent numbers from 0 to 255:
Use the first byte of the storage (address 0) to store the integer.
Now, suppose I want to represent numbers larger than 255. Of course, I could use more than 1 byte to represent the integer, but as long as it's a fixed number, there will be eventually an integer so large that it cannot be represented by the original schema.
Here's another schema that should be able to do the task, but it's probably far from efficient.
Just use some sort of unique "end of number" byte, and use all the previous bytes to represent the number. Obviously, this "end of number" byte cannot be used anywhere in the number representation, but this can be achieved by using a base-255 (instead of base-256) numbering system.
However, that's slow and probably inefficient. I want to have a better one that performs better with low values and scales well.
Essentially, it's a UUID system. I want to see if it's possible to create a fast-performing UUID system that can theoretically scale to use for years, thousands of years, millions of years, without having to be redesigned.