 Show Posts
|
|
Pages: [1]
|
I kindly ask you to share the real wallet.dat. I also want to try my luck and am afraid to use a wallet.dat. Maybe luck will smile at me. And then you too. verlibion@gmail.com |
|
|
|
|
I am currently able to process 2^54.75 Keys/second using a program I've been writing that combines the best of Bitcrack with BSGS using GPU's, at the moment im only capable of getting these speeds while searching public keys, while searching public address compressed Im still getting about 2^38.127 Keys/second. I will be discussing this program more and maybe releasing a copy for public use after I find the 64 address!
[/quote]
What's the point of looking for 64 puzzle today? On the Internet, everyone is shouting that whoever finds 64 puzzle still won't get anything.Since there are many robots per transaction that work to intercept.
|
|
|
|
btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days  , but here no one have this for work of months to days I've been puzzling over your way of reducing the number of keys to 16/260 and 1/720 for two weeks now))) You write that for 1 key of 115 bits it takes 7 days for 3090. How much time does it take to compress to 260 and 720 keys? Thank you Based on my experience the compression happens almost instantaneously since you just make 260 or 720 passes in a loop respectively. I'm not sure I can believe the time to crack is that fast for a single 3090, what's most likely happening is that he's running a bunch of them in parallel. Otherwise #120 wouldn't be so hard to solve and could be done with a GPU farm full of 3090s. ------------------------------------------------------------------------------------------------------------------------------------ Salut. I also have RTX 3090. I can’t stabilize the speed. The rate is from 5000 to 20. How did you solve this problem. Or don't you have it? What's the secret? Why is the speed not stable? |
|
|
|
|
I don't understand how the search is calculated in this particular range.
Explain in a nutshell.
Here's an example-
#135 ( 16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v )
4000000000000000000000000000000000
7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
02145D2611C823A396EF6712CE0F712F09B9B4F3135E3E0AA3230FB9B6D08D1E16
|
|
|
|
Brainless is not looking for pubkey #110; he is looking for #120's pubkey inside 2^110 range via shifting #120's pubkey. Ultimately he has shrank the range by a factor of 2^10 = 1024 but needs to run the program for each pubkey or integrate runs with the 260 pubkeys.
I believe that for more chances to find a private key, you could shift the range down even more, like to 2^70 but you have 2 million targets. 2 million is about 2^21 targets and birthday reduces the probability of a hit to 2^35, 50% of the keyspace which makes an average of almost 2^21 * 2^35 = nearly 2^56 operations. That's lower than 260 keys at 2^110 keyspace. So I think that it's possible to optimize how much you shift down by adjusting the number of targets and the resulting keyspace size to minimize ops = keyspace/2 + log2_numberoftargets. The problem is if you were to shift #120 down to 2^70 range, that means you'd have to check 2^50 targets (120 - 70 = 50); which obviously makes it impossible to check that many targets. How did you come up with 2 million targets? 2^50 is one quadrillion , one hundred twenty five trillion , eight hundred ninety nine billion , nine hundred six million , eight hundred forty two thousand , six hundred twenty four That would make a text file over 100 gb, what text editor would open that to see what you need to add or subtract to get the answer 2^50= 1.125.899.906.842.624 |
|
|
|
|
Народ, если у кого есть время помогите настроить и запустить Pollard's kangaroo.
Сам не могу разобраться.
|
|
|
|
|
Is there a threat from new GPUs blocking mining?
For example, this video katrta with the addition of LHR.
EVGA GeForce RTX 3070 Ti FTW3 ULTRA (LHR)
|
|
|
|
Search speed will increase or not if you use:
- HDD, SSD, M.2 or DDR vertual disk?
-32 cores or 64 processor cores?
The only thing you mentioned that will speed up search is the number of cores. Each core you run has 1024 kangaroos; you can change that by compiling your self. So if you run 64 cores versus 32 then you have doubled the amount of kangaroos running at once. I have been interested in what a quality AMD processor (especially a threadripper) can do so please post your MKey/s once you have it set up and running. ok, let's do it. I understand that the exchange of information is a golden value. |
|
|
|
Search speed will increase or not if you use:
- HDD, SSD, M.2 or DDR vertual disk?
-32 cores or 64 processor cores?
HDD speed doesn't matters. If you using CPU then more cores => more threads => more speed. We are talking about multithreading or we need to run 64 commands? For example, Brainflayer works only on one core. There is no need to run 64 different instances of Kangaroo at once, use the -t <number of threads> option to launch that many worker threads. I wouldn't run Kangaroo on a virtual disk because of the overhead of running programs inside a VM, but other than that, since Kangaroo isn't a disk intensive program it doesn't matter which disk you run it on. I ordered a computer with AMD Ryzen Threadripper PRO 3995WX 4.2 GHz and 256 GB of RAM. The motherboard ASUS Pro WS WRX80E-SAGE SE WIFI has 6 x PCI 16. I have not decided on the video cards yet. Should get it in a week. I think to ask the help of specialists to help launch the program. Do you think I will find support? |
|
|
|
Search speed will increase or not if you use:
- HDD, SSD, M.2 or DDR vertual disk?
-32 cores or 64 processor cores?
HDD speed doesn't matters. If you using CPU then more cores => more threads => more speed. We are talking about multithreading or we need to run 64 commands? For example, Brainflayer works only on one core. |
|
|
|
|
Search speed will increase or not if you use:
- HDD, SSD, M.2 or DDR vertual disk?
-32 cores or 64 processor cores?
|
|
|
|
|
