Currently for a block hash to be accepted (proof of work) should have this form
XXX....YYYYYYYYYYYYYYYYYYYYYYYYYYY.....
where
X's : Zeros
Y's :
Don't cares actual pattern depends on the difficulty Difficulty Target demands at least a minimum number of zero X's.
This requirement does not adapt well with sadden network hash power changes and the time required to find a hash may vary significantly.
We propose a different algorithm as proof of work that adapts well and works without specifying a Difficulty target.
Instead of Y's being don't cares we count the bit changes (0 to 1 transitions) within them.
So we force a block hash to satisfy two contradictory requirements due to the fixed bit length of the hash (256bits)
Counting 0 to 1 transitions a hash could have at max 128 something really rare.
Given two hashes with the same number of transitions the one with the most X's being zero wins.
I exact starting from the left and comparing the hashes bit by bit the first having 0 where the other hash has 1 wins.
(Dominant 0 bit)
How the network develops consciousness?
A) All participating nodes try to maximize hash 0 to 1 transitions
B) At given time intervals nodes publish their best so far
C) A node receiving two or more hashes always prefers the one with most transitions and if equal the one with most dominant 0 bits.
*A node that finds a really rare block and publishes it on time radically improves the security of the network.
This is preliminary work an we would like your comments or suggest similar works from others.
Show Posts
