the hardest part about never-ending space is finding never-ending time to spend filling it

there are dozens of ways to increase the level limit with some tricks. you could have a multidimensional array: global_position[16000][16000][3] (i don't know if the amount of dimensions in an array can affect the limit on the array's size). you'd want it to be a local variable, and u'd need to use lite-c. but with a few code tricks (and model-only levels) this example would give you a level area of:
Code:
16000(999999.999-(-999999.999))
=16000(~2000000)
=32000000000
=3.2 x 10^10 quants squared
and i believe tompo's original speed mention was 2 quants
per time step (not frame), so the shortest possible time it takes to cross the level at this speed (i say shortest because if you go across diagonally it would take longer) would be:
Code:
3.2 x 10^10 / 32 = 10^9 seconds
10^9/3600 = 277 777.778 hrs
277 777.778/24 = 11 574.074 days
11 574.074/365 = 31.71 years

which is pretty close to the desired
never-endingjulz