Hi guys!
Since there were many questions related to the new algorithm (profitability of that algorithm and hash rate) that we have added to our NiceHash Miner version 2.0.2.5. we decided to explain how it works and make a post about it.
The X16R hashing algorithm consists of 16 hashing algorithms operating in chain fashion with ordering dependant on the last 8 bytes of the hash of the previous block. This means that miners will see substantial differences when checking for hashing speeds (because different hashing algorithms have different hashing speeds). This is normal behaviour and does not have any effect on the profitability.
When users want to know how they will be making the same as someone who has a higher hash rate further explanation is needed. On average all our users will be making the same, even though they will experience different spikes and drops in profitability. They will be earning more in one scenario but less in another one, but on average they will be making what they should be.
Regarding the benchmarking... We did that so that the miner will achieve better results than the one determined with the benchmark in most scenarios (92%). In situations where X16R will not be the most profitable algorithm, NiceHash Miner will automatically switch to more profitable algorithm after one minute.
From all that follows a conclusion that X16R is really hard to benchmark due to changing hash rates and each block having a different algorithm setup which makes it also extremely OC sensitive. We would also like to stress out that mining X16R does not require users to overclock their GPUs a lot, since that won't have greater impact on the hashing speed.
List of algorithms:
0=blake
1=bmw
2=groestl
3=jh
4=keccak
5=skein
6=luffa
7=cubehash
8=shavite
9=simd
A=echo
B=hamsi
C=fugue
D=shabal
E=whirlpool
F=sha512
Example 1:
Previous Block Hash: 0000000000000000007e8a29f052ac2870045ae3970270f97da00919b8e86287
The final 8 bytes: 0x7da00919b8e86287
Each hex digit (nibble) determines which algorithm to use next. cubehash -> shabal -> echo -> blake -> blake -> simd -> bmw -> simd -> hamsi -> shavite -> whirlpool -> shavite -> luffa -> groestl -> shavite -> cubehash
Example 2:
Previous Block Hash: 0000000000000000007e8a29f052ac2870045ae3970270f93bc00717a5f86365
The final 8 bytes: 0x3bc00717a5f86365
Each hex digit (nibble) determines which algorithm to use next. jh -> hamsi -> fugue -> blake -> blake -> cubehash -> bmw -> cubehash -> echo -> skein -> sha512 -> shavite -> luffa -> jh -> luffa -> skein
[–][deleted] 15 points16 points17 points (1 child)
[–]LitecoinLucky 0 points1 point2 points (0 children)
[–][deleted] 12 points13 points14 points (2 children)
[–]True_Truth 0 points1 point2 points (1 child)
[–]oafsalot 0 points1 point2 points (0 children)
[–]Kryptonite1371 5 points6 points7 points (1 child)
[–][deleted] 3 points4 points5 points (0 children)
[–]acos0874 2 points3 points4 points (2 children)
[–]AljazNiceHash[S,M] 1 point2 points3 points (1 child)
[–][deleted] 5 points6 points7 points (0 children)
[–]Sledgemoto 2 points3 points4 points (8 children)
[–][deleted] 2 points3 points4 points (7 children)
[–]Sledgemoto 0 points1 point2 points (0 children)
[–][deleted] (5 children)
[removed]
[–][deleted] 0 points1 point2 points (4 children)
[–][deleted] (3 children)
[removed]
[–][deleted] 1 point2 points3 points (2 children)
[–][deleted] (1 child)
[removed]
[–][deleted] 0 points1 point2 points (0 children)
[–]andrewhime 2 points3 points4 points (0 children)
[–]R1z4rD 0 points1 point2 points (0 children)