Show Posts
|
Pages: [1] 2 3 4 5 6 »
|
If someone has a better solution for the bot, let me know. I'll use theirs.
Haha, I thought you've patched bitcoin-core and monitor blockchain itself. But you just rely on some public api. Are you sure it will show you pubkey without lag?
|
|
|
what computational power does the puzzles 130 needed to be solved
if you have 56core/256GB server, you'll check about 12 exakeys per sec 2^129 / 11344588059320129643 / 3600*24 = ? after 1_902_338_144_733 years AT MOST you'll become rich, but with this probability 1/680564733841876926926749214863536422912 you'll find PK in first second. Feel lucky? (haha) p.s. if you pay $200 per month for server, you'll pay 1902338144733*200*12 = ? 4_565_611_547_359_200 dollars so, it's only reasonable if you do not pay for server
|
|
|
It takes a thousand GPUs to make something serious. Everything else is just kidding
Why GPU? BSGS works on CPU. btw, what's more important RAM or CPU? I've tried AMD Ryzen 9 7950X - 4.5GHZ, 16c/32th + 128GB - 4ek on start, reaches 6ek after week Intel Core i7-11700K 3.6GHZ, 8c/16th + 128GB - only 2ek, no growth Intel Core i7-11700K 3.6GHZ, 8c/16th + 64GB - around 1ek, no growth E5-2670v3 2.3 GHz 12c/24th + 256GB - 7ek on start 2×E5-2680v4 2.4 GHz 28c/56th + 256GB - 9.5ek on start
|
|
|
He found BTC. Your stories are so boring... I personally, bought 1 BTC in 2013 also, but didn't hodl. Frankly speaking, $70k is not the sum I really miss. The true disasspointment is the 32BTC puzzle. This beast allowed lucky AND/OR wise guys to earn dozens of BTC, especially the inventor of kangaroo searcher. But for me it's only a loss of GPU time during all 5 years.
|
|
|
i wonder is it more probable to find a key through random approach or with consecutive trials ?
random mode adds probability to search same range more than once. also keyhunt speed slowly grows, at start it is 4exakeys/sec, after a week it is 6exakeys/sec (maybe it's just wrong counting, not real speed boost) btw, keyhunt is suitable for puzzle 130?
|
|
|
1. it is stupid to search for 66 and other lower puzzles, because when you begin to spend them, guys with kangaroo stuff will steal you key and likely overwrite your transaction.
2. The speed is ridiculous. keyhunt on ryzen7 is searching at speed of 4040394398072471407 keys per second (puzzle 130) no GPU
|
|
|
Ever since 2015, we are stuck at puzzle 66, you should double the key space size each bit you go up.
You're mistaken. P64 was depleted only 1 year ago. P65 was depleted by different algo. So, we are not really STUCK with 66
|
|
|
who solved ? which tools useing to crack keyhunt or BitCrack
Very unlikely that it was bitcrack. This magic kangaroo stuff is. I wonder of RAM requirements for 120 puzzle. Who's next p66 or p125? )
|
|
|
This code is so valuable I doubt anyone will just opensource it. And it's far from easy to write, as someone said there is probably only a handful working ones out there.
The same could be said about bruteforce code. Many years there was only crappy and slow LBC, then I payed a rather modest $450 to freelancer to fund opensource vanitygen fork. In the same time Bitcrack was already done and also opensource, just not popular. In result, as I can see, author of Bitcrack was donated several times with 0.1 BTC. That's better than nothing (a doubt he could use same resources as zielar)
|
|
|
Hello does anyone have a complete list of the taken addresses and it's corresponding private keys? from 1-60? Thank you
It's a bit boring to get last 10, they are spread on 20 pages. 1757756a93 2237d05330 4b5f8303e9 e9ae4933d6 153869acc5b 2a21e3a7271 6bd3b27c591 e02b35a358f 122fca143c05 2ec18388d544 6cd610b53cba ade6d7ce3b9b 174176b015f4d 22bd43c2e9354 75070a1a009d4 efae164cb9e3c 180788e47e326c 236fb6d5ad1f43 57dfa374c1d98f 9d18b63ac4ffdf 1eb25c90795d61c 2c675b852189a21 7496CBB87CAB44F First 55 are in one message
|
|
|
1 target compressed 107 Mkey/s 2.7M targets both 46 Mkey/s
OK, not stubborn, but alternatively gifted. Do you really think that 46 vs 107 is "won't change much"?
|
|
|
You, stubborn boyz, don't get simple thing: bounty is 100% compressed, so you need only -c switch. For abandoned wallets you 100% need both -u and -c switches. That's 2x drop.
bloom filter with thousands of addressed also cannot be free. Here you get another ~50% drop.
So, 1 address vs thousands is really around "3X difference".
|
|
|
Thank you for you very competent comments.
Welcome. I claim that an Rx480 does 105MHkey/s on 01 target and 85 MHkey/s on 2,749,473 targets (compressed only)... draw you own conclusions. This is no BS.
1. Most abandoned wallets are uncompressed. 2. If speed with one address is almost the same as with 2.7M, then you haven't found right values for -b A -t B -p C No other options.
|
|
|
One target or 45000 target won't change much. So incompetent opinion. 1 compressed address makes 250MK 50k compressed+uncompressed 80MK (on gf1070) that's 3.1 times difference. Never tried it, because most of non empty BTC addresses are compressed
Another BS This trick will increase your likelihood in finding the key as times increases
3rd BS.
|
|
|
Hi, guys! I have 36 rx480 cards running with bitcrack, if anyone can give me tips, I'll be very grateful!
Sell cards, buy bitcoin and hodl.
|
|
|
How can one get the BCH pk? Someone can help me with answers.....Thanks.
Yeah, the PK is the same and you could take these $70 instead of asking p.s. I guess there are other bitcoin forks. But it's a bit lazy to check...
|
|
|
Because it can be an digital analogue of a "black hole" There are some shortcuts in curve generation, that's why point are generated in large batches. But due to the next steps, that make hashes, other operations are calculated individually. Maybe authors of Bitcrack, vanitygen have mislooked something else, but this optimization should be not in stupid walls of numbers, but somewhere in the code of bruteforcer.
|
|
|
352 GHs on Bitcrack than means at least 3520*50 watt = 176 kWatt wasted electric power for a week that is 176*24*7 = 29568 kWh just for fun Relax, it could be just a blabla to sow the seeds for doubt, underdevelopment and unrest in our beautiful community. HODL ON
|
|
|
private key case #N has N-1 random bits following the leading bit. That's it.
If I was puzzle creator, I'd "forget" couple of ranges, say 60 and 61. That would make all mamma's bounty hunters to fall in endless loop trying to find puzzle60 forever and ever so all true bitcoins would be in safety.
|
|
|
Actually the pub key can be calculated into the private key, and it is exponentially faster than bruteforcing,
Idea for nextgen bruteforcer: taking large wallets with spends and bruteforcing their priv keys from pub keys. But that's for lawful evil guys, because it is 100% not lost wallets.
|
|
|
|