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.
-
-
PoW is not the transaction rate limiter. The transaction rate limiter is the block size cap. It's not to prevent DoS either. The important function of PoW is establishing a canonical ordering of transactions in a way that everyone can agree on, without requiring trust.
-
No, it does not. Longest-chain-wins is the thing that establishes the block order. PoW doesn't, and in fact, in practice already does not - the BitCoin chain already does occasionally get forks of this nature.
- 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.