Collusion problem - golemfactory/golem-rd GitHub Wiki
Collusion is a problem for the process of Verification by replication. Approach called lottery-driven-verification specifically avoids this problem.
The problem. If two providers get to compute same subtask and learn about it they might want to reduce computational burden and guarantee success by doing following: one computes, other copies his result. One can imagine situation when "patched" version of Golem is published where all providers post information about their subtask assignments on some IRC channel and exchange results when duplication is detected.
Domain of the problem:
- verification by replication (for both deterministic and non-deterministic payloads)
- providers are economically distinct (we can't possibly tackle the problem if providers are Sybil)
How this problem can't be solved:
- controlling communication channels (counterexample: patched version with IRC channel)
- ...
Proposed solutions:
- collusion: game-theoretical solution without-smart-contract
- collusion: game-theoretical solution with-smart-contract
Dead-end proposals: