Post
Topic
Board Development & Technical Discussion
Re: HITs (Human Intelligence Tasks) as part of a proof-of-work algorithm
by
exapted
on 17/03/2014, 09:28:54 UTC
If a chess game was integrated into the protocol, such that two players play against each other, and moves are signed with private keys, then I think the winner could be verified automatically. Beating a highly rated player would count more than beating a lowly rated player. The rating system would need to be secure, and some election process would need to determine a system-wide winner/leader set, or something similar.

Another idea is that an election protocol verifies HITs by randomly polling users, such that users sign their votes with their private keys and the votes need to be nearly unanimous.

I hope I'm on the right track here.