search

tromp / cuckoo

a memory-bound graph-theoretic proof-of-work system
Other
822 stars 173 forks source link

Add test ensuring that we can use nonces up to (2^32 - 1) #29

Closed akorosmezey closed 6 years ago

tromp commented 6 years ago

I don't see the point of this test. The nature of nonces is somewhat incidental to the operation of the solver. Header and nonce are combined to derive the siphash keys which define the graph. It's up to the user of Cuckoo Cycle to decide on what exact form nonces should take. They might as well be 64 bit or 128 bit or 256 bit...