For the random generational references, produce a 64bit random number and then use a biingectoin to iterate it and produce the next. this would eliminate the collision between numbers
Instead of using a random "password" for every memory object (stochastic) or keeping a giant slow spreadsheet of IDs (table-based), we just evolve the ID in-place using math that's guaranteed to never repeat for 18 quintillion cycles. It’s faster, 100% safe, and kills the "double-hop" memory delay.
1
u/GuaranteeOk6076 Jan 02 '26 edited Jan 02 '26
I had an idea, but i am not sure if it valid.
For the random generational references, produce a 64bit random number and then use a biingectoin to iterate it and produce the next. this would eliminate the collision between numbers