 Show Posts
|
|
Pages: [1] 2 3 4 »
|
|
[TARGET: 1] [SPEED: 1632701.66 MKey/s] [TOTAL: 48,937,041,920] [00:05:18]
search 48,937,041,920 keys in 318 seconds
48,937,041,920 / 318
So the real speed is 153,890,068 ~= 153 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
|
|
|
|
Seems that sha256 and rmd160 is a joke for most users here, all those partial address are not useful at all.
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 file1 = open('file1.txt', 'r')
for line in file1.read().splitlines():
compressed_keys.append(bytes.fromhex(line))
file1.close()
file2 = open('file2.txt', 'r')
for line in file2.read().splitlines():
compressed_keys.append(bytes.fromhex(line))
file2.close()
Good Luck with your studies  |
|
|
|
Yes there is, already taken care of, if you are the first one spending from that address, nobody else even you can not double spend it, RBF is turned off for all puzzle keys.
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 that 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
Edit:
I test the auto diff and its work fantastic so its OK to not have way to set diff manually.
|
|
|
|
|
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?
|
|
|
|
python for cpu.
now i have 50.000 key per second on cpu
i finished a first version for gpu and i get 250.000 keys per second for now
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 pick up one of them, or you can change the code as you wash(its open source at the end) |
|
|
|
I'm only running one Compac F its about 17Watts at the socket and its being run by a Raspberry PI Zero 2W, which is about 3 watts at the socket so in total approx 20Watts. As a lottery miner thats great, it blends into the background a costs litterally nothing to run, especially given the house is running mostly on solar & battery.
But, yes a real miner you're looking at more than 3000Watts at the socket!
Great choose, I was plan to buy it or rent high rigs for few months(which I choose). And it's look like I will need up having nothing so take good care of your rigs  |
|
|
|
Always encouraging to wake up and find your miner has churned out its biggest share so far. "hashrate1m": "283G", "hashrate5m": "296G", "hashrate1hr": "291G", "hashrate1d": "296G", "hashrate7d": "295G", "lastshare": 1689495159, "workers": 1, "shares": 415751586, "bestshare": 2479049083.761295, "bestever": 2479049083, "authorised": 1685417900..... only 22,000 times more and its a win!  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 that greater than bitcoin diff. That's it. Good luck for everyone. |
|
|
|
Bro thanks for replying, can you pl tell me How to run it in cmd with my particular range & pub key, plus can it take multiple pubkeys at a time, all within same range of 2^80??
No here you must use one pubkey but in https://github.com/JeanLucPons/Kangaroo you 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 |
|
|
|
|
Maybe albert0bsd refer to bug of using -m address (single, NOT -m addresses ) which will miss the key.
|
|
|
|
Well yes it is some offtopic but i going to reply to you here Okay, I didn't get your idea at first glance, but after rereading it for the second time, I now understand what you're trying to do. There are many substractions in BSGS not only ONE example: Current Implementation:Key 99
known range 75-100
Baby step 5 = { 0,1,2,3,4}
Giant step 5 = {0,5,10,25,20}
First subtraction to move key to the BSGS range
99(key) - 75(Base range) = 24
New Target Key 24
Giant step 0
24 - 0 = 24 is on Baby Table? NO
Giant step 1
24 - 5 = 19 is on Baby Table? NO
Giant step 2
24 - 10 = 14 is on Baby Table? NO
Giant step 3
24 - 15 = 9 is on Baby Table? NO
Giant step 4
24 - 20 = 4 is on Baby Table? YES (HIT)
Calcualted KEY is Giant Step 4 plus Baby step 4 PLUS [b]Base range[/b], this is 20 + 4 + 75 = 99 Key 99
known range 75-100
Baby step 5 = {75,76,77,78,79}
Giant step 5 = {0,5,10,25,20}
Target Key 99
Giant step 0
99 - 0 = 99 is on Baby Table? NO
Giant step 1
99 - 5 = 94 is on Baby Table? NO
Giant step 2
99 - 10 = 89 is on Baby Table? NO
Giant step 3
99 - 15 = 84 is on Baby Table? NO
Giant step 4
99 - 20 = 79 is on Baby Table? YES (HIT)
Calcualted KEY is the HIT key
I don't know if that is your idea or not, please correctme if im wrong But in this example We only avoid one substraction, all the Giant Step subtractions remain... There will be some more varians of this (only make stride with the Giant step, etc...) but almost all keep the Giant Step subtractions. BTW another important thing to Generate a lis from 1 to X is that we can use that SAME list for ANOTHER targets BUt if you do the list from Target to ( Target + X), then that list only is going to be useful againts that specific target.Mora about BSGS: https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/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.
|
|
|
|
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 move the 161-256 bit to 1-160 bit so the amount in 1-160 bit is increase by 10. |
|
|
|
Thanks for everybody for explanation.
And any tool to take participate in loterry? I want random bruteforce of all keyspace, at a database of all BTC adresses with balance
I think about Hashcat, but it doesn't take secret exponent, in can bruteforce onli WIFs
Go with Keyhunt if you want to use CPU & RAM https://github.com/albertobsd/keyhuntAnd go with KeyHunt-Cuda if you want to use Nvidia GPU(Only) https://github.com/manyunya/KeyHunt-Cuda |
|
|
|
Its easy error See use "-m address" if use CPU with ONE thread only otherwise (GPU or CPU with more than one thread) use "-m addresses" Good luck hunting |
|
|
|
Funny to see the newbie accounts claiming having hundrends of petakeys worth of rate. You should have taken the 120bit key by now mate.
Using BSGS you can get speed up to Ekeys/s but this speed is nothing compare to the length of 120bit. You will have more chance with Mkeys/s in 66bit then having Ekeys/s in 120bit |
|
|
|
|
??
