- It ignores the fact that decentralization isn't binary, it is a spectrum. Systems claiming decentralization can be characterized by their "Nakamoto coefficient":
The number of entities sufficient to disrupt a blockchain is relatively low: four for Bitcoin, two for Ethereum, and less than a dozen for most PoS networks.This number varies through time, but for both is almost always between two and five, which is not very "decentralized". Given that the "entities" in question are known to coordinate their behavior off-chain, this number doesn't tell you anything useful about the system.
- What calling a system "decentralized" even though it actually isn't does usefully do is to inhibit regulation. It creates the false impression that responsibility for the state and actions of the system is so diffuse that regulators lack a viable traget.
There is a much more useful, completely objective criterion. Participation in a system either is, or is not subject to permission from some authority, and this can be confirmed by the experiment of trying to participate without asking permission.
Permissionless systems can claim some advantages, but they suffer from some serious disadvantages. Chief among them is the need to defend against "Sybil attacks". Below the fold I discuss Sybil attacks, the defense against them, and the implications for the systems that adopt this defense.
Sybil AttackThe nodes in a distributed or decentralized system have to achieve consensus on the system's state by a process that can be thought of as voting on each transition from one state to the next. The assumption is that each voter acts independently, although in cryptocurrencies these are typically not "one voter one vote" systems; some voters votes may count for more than others.
The essence of a permissionless system is that there is no control over the electorate for these votes. That is, voters can join or leave the electorate at will.
This inherent feature of permissionless systems enables a Sybil attack, in which the attacker creates a large enough number of ostensibly independent voters (Sybils), which are actually under his control, to win any desired vote.
In a permissioned system, voters must register with a central authority before joining or leaving the electorate. Thus a Sybil attack is not possible.
Sybil DefenseIn a permissionless system it isn't possible to prevent the attacker creating an arbitrary number of voters. It is therefore necessary to provide some disincentive against doing so, by attaching a "ticket cost" to each vote sufficient to ensure that the reward for a successful Sybil attack is less than the cost of mounting it.
In Proof-of-Work systems such as Bitcoin, the ticket cost is the cost of the hardware, power, etc. to compete in the race to mine the next block. In Proof-of-Stake systems it is the stake, which is forfeit in an attack, and its foregone liquidity.
ImplicationsThe necessity for permissionless systems of implementing a ticket cost has many implications.
CryptocurrencyIt is necessary to reward the voters for bearing the ticket cost. A permissionless system cannot have a centralized nexus charging the users fiat currency and distributing it to the voters in proportion to their efforts. The rewards have to be generated internally by the system itself, so they must take the form of coins in a cryptcuurrency (See You Can't Have One Without The Other).
ExchangesTo have the necessary deterrent effect, the ticket cost must be in some form corresponding to real resources, and thus so must the rewards in the form of cryptocurrency. In order that the diligent voter might pay their power bill or buy the Lamborghini, there must be a way to convert the system's coins into fiat currency. Thus the need for exchanges, where the coins can be sold for fiat, or at least for metastablecoins that can be redeemed or used in trade.
I put forward a weak form of this argument in 2014's Economies of Scale in Peer-to-Peer Networks, pointing out that economies of scale meant that a notionally constant cost per voter would actually be a decreasing cost per voter which would drive centralization.
In 2019's Impossibility of Full Decentralization in Permissionless Blockchains, Yujin Kwon et al set out a much stronger form of the argument:
the blockchain system should be able to assign a positive Sybil cost, where the Sybil cost is defined as the difference between the cost for one participant running multiple nodes and the total cost for multiple participants each running one node.Thus there is a paradox; the necessary technique to implement decentralization, a permissionless network, ensures that a successful network will be centralized.
Considering the current gap between the rich and poor, this result implies that it is almost impossible for a system without Sybil costs to achieve good decentralization. In addition, because it is yet unknown how to assign a Sybil cost without relying on a TTP [Trusted Third Party] in blockchains, it also represents that currently, a contradiction between achieving good decentralization in the consensus protocol and not relying on a TTP exists.
PseudonymityKwon et al's definition of the Sybil cost is:
the difference between the cost for one participant running multiple nodes and the total cost for multiple participants each running one node.The problem is identifying a "participant". In permissionless systems "participants" must create their own identities; they cannot depend on a central service to generate them. They are normally pseudonyms in the form of public/private key pairs. It is cheap to create a new key pair, and initially there is no way to connect one public key with another created by the same "participant". Eventually it may be possible to connect them by observing the transactions in which they take part, but that would be too late to impose a Sybil cost on their votes. A Sybil attacker would take care to avoid linking their Sybil identities until after the attack succeeded, when it would be too late.
Another way of looking at the paradox is that the need for user-generated pseudonyms in a permissionless system renders a positive Sybil cost impossible, and thus makes eventual centralization inevitable.
Note that even with participant's identities known 51% attacks are still possible because the participants can conspire off-chain. See, for example, Justin Sun's takeover of the Steem blockchain.
Note further that in On-Chain Vote Buying and the Rise of Dark DAOs Philip Daian and co-authors show that "smart contracts" provide for untraceable on-chain collusion in which the parties are mutually pseudonymous.
Economic LimitsIn The Economic Limits Of Bitcoin And The Blockchain, Eric Budish analyzes two different kinds of 51% attacks on Proof-of-Work blockchains and shows that:
the equilibrium per-block payment to miners for running the blockchain must be large relative to the one-off benefits of attacking it. Equation (3) places potentially serious economic constraints on the applicability of the Nakamoto (2008) blockchain innovation.
This is necessary, because much academic work (see Taleb On Cryptocurrency Economics) shows that were the network funded largely by fees, it would be insecure. The hand-wavy explanation is that the fees in a block would have to be more than the value of the transactions, which is economically implausible. Related arguments apply to Proof-of-Stake blockchains.