Thank you for your answer, but I still have questions:
1) Why there is no difference? If you start every hour from some random seed, there is probability that you could start from the same wrong seed which you already checked earlier.
2) Why there is no "maximum"? What is "difficulty" mean then? I thought that "difficulty" is all possibly variants, and if I check every one of them I would find my prefix with 100% probability. And difference is only how soon I would find it - with very bad luck my prefix could be just last.
So, my statement is:
Maximum Time for prefix finding (with guaranteed result) = Difficulty / Speed
For example, with speed 1000000 keys/second I'll find prefix with 264104224 difficulty with 100% probability for maximum of 264104224/1000000=264 seconds
3) Thank you for wise advice, but I only need 1 exact prefix :(

1) Yes, Putin criticized cryptocurrencies. He said that cryptocurrencies now mainly used for illegal activities.
2) I am sure that Putin wants to create something useful based on blockchain.
3) Government needs no mining facility. They simply will create needed amount of cryptocurrency :)

Hi all!

I am trying to find rather long prefix (more than 8 symbols). I calculated estimated time as about 2 month with 8x1080.

But there is problem: oclvanitygen hangs after some working time (on Linux or Windows host). I had to write script which kills hanged process and restarts it.

So, there is no continuous running of oclvanytigen, and I am not sure that now I will find my prefix during expected 2 month.

Could someone tell me if there is mathematic difference between next two actions:
1) I run continuously without stopping oclvanitygen until it find my prefix (max 60 days, if I totally unlucky)
2) I run oclvanitygen for 1 hour, then kill process and start again - in cycle same 60 days.

Thank you!