Hacker News new | ask | show | jobs
by anonytrary 2860 days ago
The N-1 could name-take the name-taker on the same day if they can achieve consensus before the teacher comes back.

The N-1 simply have to wait for the teacher to come back, then explain that the name-taker was abusing his position, hoping the teacher will release them from punishment for name-taking the name-taker. AFAICT, there's no incentive for the N-1 to lie about whether or not the name-taker was taking advantage of them.
1 comments
SiempreViernes 2860 days ago
Eould you trust the N-1 if they suddenly started speaking with a unified voice? This from a class you don’t trust to keep working without supervision.
link
anonytrary 2859 days ago
What incentive is there for them to unify against the name-taker if the name-taker was being fair? N-1 people aren't just going to cry wolf in synchrony, because they don't trust each other. Can't a set of untrusted nodes still achieve consensus assuming more than half are good players? It's unlikely that over half of the class consists of class clowns.
link
mcguire 2860 days ago
Yes. It's hard to get many people to agree on anything.

On the other hand, it's hard to get many people to agree on anything.

link