Each 22-digits ECS cube has 21 other counterpart cubes that result from shifting the digits up to 21 times around. For each set of 22 cubes (any cube and its 21 of such counterpart cubes) there is the smallest sphere that can contain them all, the size of which telling how close they are to each other.
The bitcoin network could be using part of its processing power to find such sets that could be contained in a sphere smaller than a given size.
The greater the processing power of the bitcoin network the closer would the cubes of such a set - to be found - would have to be.
Topic: Using PoW to find special ECS cubes in straight line clusters (Read 417 times)
Using PoW to find special ECS cubes in straight line clusters
ECS (Earth Cubic Spacetimestamp) is described here:
https://earthcubicspacetimestamp.wordpress.com
Following previous posts where I explore imaginative ways of forcing mining to produce interesting computations,
I have a new one to suggest, namely searching for interesting 22-digits ECS cubes in terms of how many other contingent cubes, in a straight line, have the same sum result when you add up its 22 digits.
You would get the SHA-256 hash of the bitcoin block mining, as usual, and do:
{Hash % 9261000000000000000000} = n
You preceed 'n' by the number of leading zeros you need to have a string of 22 digits, making a ECS cube, and find out
how many ECS cubes can you have in a contiguous straight line of cubes, with n being one of them, so that the sum of all 22 digits of each cube is always the same for all of them.
The difficulty would be tightened with maximizing the length of these straight lines of cubes - with this propriety in common - for the current collective processing power of the network.
So, the greater the processing power of the network the lengthy these straight lines of cubes - with 'n' being one of them - to be discovered, would get.
What do you think?
[EDIT]:
According to my calculations,
If the network hash rate was:
1,000,000,000,000,000,000,000 hashes per block
You would find a straight line of 22 contiguous ECS cubes all of them with the same sum of their 22 digits in every block!!!
ECS (Earth Cubic Spacetimestamp) is described here:
https://earthcubicspacetimestamp.wordpress.com
Following previous posts where I explore imaginative ways of forcing mining to produce interesting computations,
I have a new one to suggest, namely searching for interesting 22-digits ECS cubes in terms of how many other contingent cubes, in a straight line, have the same sum result when you add up its 22 digits.
You would get the SHA-256 hash of the bitcoin block mining, as usual, and do:
{Hash % 9261000000000000000000} = n
You preceed 'n' by the number of leading zeros you need to have a string of 22 digits, making a ECS cube, and find out
how many ECS cubes can you have in a contiguous straight line of cubes, with n being one of them, so that the sum of all 22 digits of each cube is always the same for all of them.
The difficulty would be tightened with maximizing the length of these straight lines of cubes - with this propriety in common - for the current collective processing power of the network.
So, the greater the processing power of the network the lengthy these straight lines of cubes - with 'n' being one of them - to be discovered, would get.
What do you think?
[EDIT]:
According to my calculations,
If the network hash rate was:
1,000,000,000,000,000,000,000 hashes per block
You would find a straight line of 22 contiguous ECS cubes all of them with the same sum of their 22 digits in every block!!!
Jump to: