4

The current difficulty for mining Litecoins is about 6. If I mine them at 25kh/s, how often should I expect to solve a block with a difficulty of 6?

I'd also appreciate an explanation (or formula) of how the calculation is done.

Murch
  • 75,206
  • 34
  • 186
  • 622
Highly Irregular
  • 10,960
  • 6
  • 54
  • 103
  • Litecoin topics might be appropriate on the Alternate Cryptocurrencies board on the BitcoinTalk forum: http://bitcointalk.org/index.php?board=67.0 – Stephen Gornick Jul 20 '12 at 00:10
  • @StephenGornick, my understanding is that all similar cryptocurrencies are within the scope of this site. http://meta.bitcoin.stackexchange.com/questions/15/are-questions-about-other-crypto-currencies-on-topic – Highly Irregular Jul 20 '12 at 01:13

1 Answers1

2

I don't know much about Litecoin, but if its difficulty works the same as in Bitcoin, then on average it takes approximately difficulty * 2^32 hashes to solve each block.

Since you're calculating 25000 hashes per second, it should take you around 6 * 2^32 / 25000 seconds to solve a block. Or about 286 hours.

Does that sound about right?

Chris Moore
  • 14,825
  • 6
  • 66
  • 87
  • Yes, that seems about right. What's the significance of 2^32? Does the numeric value of the hash need to fall under 1/((2^32)*D) where D is the difficulty, as part of the block solving algorithm? That would explain it. – Highly Irregular Jul 20 '12 at 04:35
  • The answer to this question http://bitcoin.stackexchange.com/q/1453/516 has a formula for Bitcoin, but I couldn't make any sense of it. Seeing the similarity to your answer, I was able to fix it by adding some brackets that were necessary to get the correct result. I'm pleased to get that cleared up! – Highly Irregular Jul 20 '12 at 05:13
  • 1
    See the link 'approximately' for too many details about this whole 'difficulty' thing. But yes - a difficulty 1 block needs to have a hash starting with 32 zero bits. That's where the 2^32 comes from. It actually has to be less than 0x00000000FFFF, which is why I said "approximately", since 2^32 is off by a factor of 65535/65536. Starting with 32 zero bits isn't quite enough - at least one of the next 16 bits has to be zero too. – Chris Moore Jul 20 '12 at 05:42