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.
With the PoW rate limiter, BitCoin really does still live up to the promise of anyone can validate, right. I mean right now you could presumably set up a node and validate the entire history of BitCoin, as a basic user.
-
-
Without the PoW rate limiter and/or with arbitrarily massive blocks, then that all goes away.
-
Of course I would probably argue that this will happen either way, because I think frankly none of these "designs" really solve distributed transactions any better than the current system anyway. But for the sake of argument, the rate limit _is_ important.
End of conversation
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.