![]() ![]() Instead of benchmarking, could we implement something where all algos are pre-defined with a very high hashrate, and NiceHash simply begins mining using the most profitable? As it's mining, it's keeping a running log of the average hashrate of the last 1000 submitted shares (think N=1000 parameter in ccminer) for each algorithm as it mines and creates this data.īy doing this, every algo will at least be sampled (due to the high initial value) but bad algos will quickly be sorted out by low average running hashrates, and the favorable ones will not only rise to the top, but gradually form accurate estimates regardless of how random the hashrate is. Without getting into details, this is a problem for generically benchmarking all algos after an upgrade or modifications to overclock settings. ![]() In the spirit of ASIC-resistance, a lot of algorithms (like x16r) randomize the algorithms in use and by design, have erratic hashrates.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |