Regarding the recent and ongoing BCH DAA gaming, I have been learning a little bit about Bobtail - and I think it will help with this problem.

With current mining, we take 1 miner's best solution and award them the block. With Bobtail this is generalized to any number of miners - the number of miners is called K. So currently in BCH, K is 1. With Bobtail, K miners report their best solutions and if the average solves the block, then the block is awarded to the miner with the lowest (best) solution.

If BCH had K value of, say, 8 then the miners trying to game the DAA would have to cooperate with 7 other miners, or simulate being 8 miners at once (hence solving the puzzle 8 separate times - which insantely inefficient).

I am very new to this and do not understand most of the mechanisms, but Bobtail looks like a very promising technique that not only might help with this problem, but also many others.

Check out the Bobtail talk

ps. the talk starts at 4:18:51 - the playback seems to start at least 20 seconds earlier, so keep that in mind.

submitted by /u/whyison
[link] [comments]

source https://www.reddit.com/r/btc/comments/es5yvu/regarding_the_recent_and_ongoing_bch_daa_gaming_i/