Why do proof of work systems ramp up the difficulty of hash solving while keeping latency constant, instead of keeping difficulty constant while nodes compete to reduce latency? The later seems more useful, and not inflationary.
-
-
But as it stands you could not do this because you would immediately get bad attackers spamming the network work with bogus blocks, and all the machines would then be swamped with block validation.
-
They would still _correctly_ reject all the bogus blocks, but they would be so busy doing so, the latency would skyrocket, because they'd be spending hours invalidating bad blocks just to get to the one real block they were supposed to validate.
End of conversation
New conversation -
-
-
if you had infinite computing power, difficulty would be adjusted to infinite and you would get no blocks and halt the whole network
-
I give up. Think whatever you want :)
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.