Community Trust ScoreVerified
Node validation happens quickly on the AVAX blockchain. Compared to other ETH alternatives, Avalanche is the only EVM blockchain providing faster speeds therefore unwilling to compromise on decentralization. It is not easy; they are doing it as it is worth working towards.
Those who have been using it for a long are like: “What ETH will never be able to achieve. It’s amazing how fast you can validate on a node with the AVAX blockchain. While with centralized regents, you could take hours.”
Decentralization sets blockchain apart from traditional solutions by increasing security, censorship, and resistance, eventually enabling trust. It is more inclusive. Centralization creates an easy target for law enforcement to enforce any changes.
Classical consensus protocols are based on all-to-all voting. They typically have a designated leader who will start the decision process and a series of rounds consisting of all-to-all communication to make sure the correct nodes reach the same decision.
This typically requires “Quadratic communication overhead with all-to-all communication of O(n²). This means for each round if there is: A network of 10 nodes = 100 messages A network of 1,000 nodes = 1,000,000 messages A network of 100,000 nodes = 10,000,000,000 messages.”
Avalanche Consensus is the most significant breakthrough since Nakamoto. It uses repeated random sub-sampling of the entire network to quickly achieve consensus with minimal overhead per node for incredible performance.
Avalanche makes use of PoS instead of PoW.
Kevin Sekniqi expressed: Avalanche consensus was pretty much built to scale to an arbitrary number of validators. Weirdly enough, it gets faster as more nodes come into the system.
Critics: Avalanche consensus cannot scale to big number of validators, because all nodes broadcast to all nodes.
Technical clarification was given to critics by Ton618 on Twitter: Protocols in the Avalanche family function through repeated sub-sampled voting. In the process of determining whether a transaction should be accepted or not, a small, random subset of validators are asked whether they think the transaction should be accepted or rejected.
If random validators think the transaction is invalid or if they have already rejected the transaction, or choose to conflict a transaction, then the transaction gets rejected. Otherwise, it gets accepted.
If a majority random (alpha α) validators sampled reply acceptance, then the validator prefers to accept the transaction. That is, when it is queried about the transaction in the future, it will reply that it thinks the transaction should be accepted. Similarly, for rejection.
The validator repeats this sampling process until the alpha of the validators queried reply the same way (accept or reject) for beta β consecutive rounds.
Avalanche solves the message complexity problem by subsampling. So Avalanche can scale to millions of validators with no problem.
