Can't proof-of-work be used as a leader election algorithm? If the proof is hard... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		cedws on Sept 27, 2024 \| parent \| context \| favorite \| on: Raft: Understandable Distributed Consensus (2014) Can't proof-of-work be used as a leader election algorithm? If the proof is hard enough to generate then one node should be able to generate one and broadcast it before the other nodes can, then that node becomes the leader.

withinboredom on Sept 27, 2024 | [–]

There’s a paper about that, using paxos as the base. Can’t find it right now, it is called “chained paxos” or “block paxos” or something like that.

ryanthemadone on Sept 27, 2024 | [–]

Proof of work is a leader election algorithm!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact