[TARGET: 1] [SPEED: 1632701.66 MKey/s] [TOTAL: 48,937,041,920] [00:05:18]
search 48,937,041,920 in 318 seconds

48,937,041,920 / 318
So the real speed is 16,215,056 ~= 16 MKey/s

Hi,

I rent rigs(more than one) from MRR and I use this pool as main pool but the pool suddenly cut connections with rigs!?(pool down, pool update...)
This happen twice in less than 24 hours!?

Thanks

I agree with that. Some people think the processes inside sha256 and rmd160 are based on scientific steps but they are wrong.
It's based on what we called "BLACK MAGIC", You do the steps in certain way and you get your target output(Here is UNIQUENESS) without any scientific explanation on why you do it in this order or why you use this operation instead of that operation...

BLACK MAGIC != SCIENCE

You could just use it as


Good Luck with your studies 

Where you get this info, If attacker send new transaction with 3BTC as fees then all pools will be so happy to replace the founder(who solve the puzzle) transaction which in best case have fraction of 1BTC as fees.

I check your coinbase transaction which is pay direct to my address. That's good.

Just for Diff is there way to set manually?

Thanks

The method is good as idea but you will lose significant amount of speed because you need to do scalar multiplication for each key, the secp256k1 sequential tricks will not work here.

So the new question will be arises, Is it worth to lose that much of speed to avoid that amount of keys?

Don't waste your time, Keyhunt(CPU) can start with 1,000,000 key/s and you can get 27,000,000 on high end CPU.
BitCrack and KeyHuntCuda can get 1,000,000,000  key/s with mid range GPU.

Just pickup one of them, or you can change the code as you wash(its open source at the end)

Great choose, I was plan to buy it or rent high rigs for few months(which I choose).
And it look like I will need up having nothing so take good care of your rigs 

I was getting 24T but it's never go up after that so I give up. And now I come back with mindset to ignore the bestever.
All we need is share the greater than bitcoin diff. That's it.


Good luck for everyone.

Hi,
I just want to be sure, Is the Native SegWit multi signatures (like https://solo.ckpool.org/users/bc1qruzlf3pszgl5dgsy5n99afpjmt93r4sx64q99vvslg5ywnnrht4s3gkkm7 ) full supported or I should use single Native SegWit?

Thanks

No here you must use one pubkey but in https://github.com/JeanLucPons/Kangaroo use can use CPU or GPU or both with multiple pubkeys.

The script is easy to run from cmd.
You should first install python package (For here https://www.python.org/downloads/ )
Then use this format in cmd(HEX = Hexadecimal)
python kangaroo.py -p PUBLICK_KEY_HEX -keyspace START_RANGE_HEX:END_RANGE_HEX

For example(search in range 80):
python kangaroo.py -p 0352b1af31d67e6a83ec7931c148f56b0755ce40c836f20c6fe2b6da612c89cf3e -keyspace 80000000000000000000:100000000000000000000

Check this https://github.com/iceland2k14/kangaroo

Maybe albert0bsd refer to bug of using -m address (single, NOT -m addresses ) which will miss the key.

You are right, I was wrong. I just think of it in my head and I'm aware of trade off, creating new list with every target but when you put it with example I see it clearly useless.

There something I found odd that could be useful for this topic, I test both KeyHunt-Cuda & VanitySearch, there result is too big different in the speed.
KeyHunt-Cuda(I test on around 20M keys, so with one key it should be 2200-2400Mk/s)
[00:00:04] [CPU+GPU: 2151.32 Mk/s] [GPU: 2151.32 Mk/s] [C: 0.000000 %] [R: 0] [T: 8,606,711,808 (34 bit)] [F: 0]

VanitySearch
[5258.87 Mkey/s][GPU 5258.87 Mkey/s][Total 2^36.89][Prob 0.0%][50% in 42.0213y][Found 0]

I know VanitySearch is just check first few bits of the address but that could be useful trade off for example checking 70% of the address to increase the speed of keyhunt and if there are a hit then do 100% checking.

This could be out of topic but I have suggestion for BSGS.
Instead of create list from 1bit -> Xbit, create it from target -> +Xbit (or reverse) so you can just directly check the hash table without doing any subtract to the private key.

We just want to see how much step is taken before get to THE TOP BEST SHARE.
As you said, it not important but think of it as gamble so its can help us to decide to run again or try something else.

Or it can be as trophy for your try, for example I get 24,621,621,978,697 BS (https://solo.ckpool.org/users/115pH6tHqcKpS7RvyzseW4RQySankBQd89) so when the rig I rent end then I can take break with some dignity

Your way to get "Denis" is just a luck. If it's really a clue then you should do it with all/most puzzle keys.

Yes the old puzzle is 256 bit but the creator is move the 161-256 bit to 1-160 bit so the amount in 1-160 bit is increase by 10.

Go with Keyhunt if you want use CPU & RAM
https://github.com/albertobsd/keyhunt

And go with KeyHunt-Cuda if you want use Nvidia GPU(Only)
https://github.com/manyunya/KeyHunt-Cuda