The regularity would come from writing to that xor range always the same tidbit at its ‘max’ speed and having a way to up the counter and query for the result , it is like a chain that creates itself counting the rings as it goes sometimes a bit slower or faster , creating an average number count per interval of time .
There will be a measurable speed limit to such a function executing itself on the network which may also vary due to network size , network transmission times , storage technology … , but still something that ticks away within boundaries . The point is to have a counter that over the lifespan of the network does not run out of space , occupies very little space and writes at whatever max speed the network allows it counting up .
Being able to call up an always continuously increasing number count
into services / dapps that want to use it , to trigger some kind of event .
Just the fact that an address is already written to does not give us enough information , but
counting the numbers as they are occurring might give us an idea close enough to be of use .
If the writing of the xor addresses is linear by design even searching for the beginning of yet
unwritten address spaces would give some approximatively positive result after a few trials .
Just ideas , there a re also functions that search for groups and consensus maybe there is a way to
be aware of moving forward and counting that already is available and we don’t know it because we haven’t looked at it from this perspective . I think it is a great idea to open a thread to find The Ideas .
Dr. Louis Essen invented the first Atomic Clock and it was a big challenge , counting atomic hits safely .
He retained that Einstein’s Relativity Theory weren’t scientific enough . Essen was able to create an atomic clock , nobody else has been able to create before him , he was a scientist . Let’s get inspired !