Mining using Khovratovich's Equihash

I’m trying to mine using my c# script and i seems to be stuck.
Okay, i have response from server:



And i have the Khovratovich’s Equihash in C#:

which is taking following parameters:

    _N               The width (number of bits) of the generalized birthday problem, integer divisible by (K+1) _

_ K The length of the generalized birthday problem, small integer_
_ Seed Seed for the problem, to distinguish between solutions. Integer._

I really have no idea what to do next.
Could you explain me what to do?

for mining you will also need nonce_1 value, it sends by the mining pool right after you’ve connected.

then you join in one buffer parameters of mining.notify from second to seventh (should be 108 bytes), append nonce_1 from the pool, append your nonce_2 (nonce_1+nonce_2 should be 32 bytes), and after that use these 140 bytes of so called “block header” to find solutions, according to Protocol Specification[1] paragraph 6.4.1

in this implementation it looks like the block header is called “SEED”, but all constants require tweaking.


1 Like

Thanks for the answer!
As i see, the Khovratovich’s Equihash is taking uint Seed, how i can use it with a block header which is not uint variable?

his Seed is array on uint32 actually: equihash/pow.h at master · khovratovich/equihash · GitHub

apparently you’re supposed to make some bit manipulations to adapt inputs and outputs.

i would recommend you to study some more compete miner, for example Tromp’s.