I have some basic doubts about consensus algorithm like hashgraph. For instance, let's take Raft the simplest leader based consensus algorithm, we cannot use it in a decentralised setting because it's very easy for a single attacker to take control of the cluster by spinning thousands of nodes to support him.
"In summary, the voting based algorithm makes it very easy for the attacker whether its leader based or leaderless. So we cannot use it in a decentralised setting."
Algos like PoW make its difficult for a single attacker to take over the network through the computational puzzle.
Taking about hashgraph it's again a voting based algorithm, so wondering how it prevents a single attacker from getting control of the network in a decentralised setting (where you cannot trust your peers)???
I do understand how hashgraph works but wasn't able to visualise it in a decentralised setting. Any insights? Thanks