Pollard's kangaroo ECDLP solver

[yoyodapro]

...
I'm work now with 861 811 060 385 455 217 keys/s but this is not helpful for 120 !!!

How is that high keys/s rate possible?

I am currently in the Quadrillions of Keys/s and still no luck with finding the 120 Puzzle... yet  

What a device is that?

Ive used to be big into mining crypto so Ive got a huge farm of GPU's, Im currently getting around 809 Billion Keys/s on Kangaroo

But believe it or not I get better performance from my 3990X Threadrippers (4 in total), i built a program that combines Bitcrack with BSGS and uses a POW server to distribute the ranges to my machines (with a few other minor revisions), Calculating huge Big Steps over 3TB of memory in total, ~40,000,000,000,000,000,000 Keys/s currently working on the 120 address, CPU machines have been running for 5.2 days solid now, GPUs have been running close to a month Getting close boys!

Interested in what you are doing combining a key/brute force program with BSGS.

With 5 GPUs I was getting 62,000,000,000,000,000 hashes per second, with a modified brute force/kangaroo approach.

With BSGS alone, a single 4 thread CPU should get/check around 2^44 keys in less than 3 seconds.

Applying your bruteforce/kangaroo approach with my farm might yield some impressive results, those are very intriguing numbers!

I am only utilizing the physical cores on my 3990X's,  severely underclocked as well... Using the full power of the CPU's resulted in a negative performance impact due to heat, even with watercooling I cannot dissipate the heat fast enough.

[1714473221]

1714473221

[1714473221]

1714473221

[1714473221]

1714473221

[1714473221]

1714473221

[1714473221]

1714473221

[COBRAS]

Ive used to be big into mining crypto so Ive got a huge farm of GPU's, Im currently getting around 809 Billion Keys/s on Kangaroo

With that rate you should be able to get #119 in ~10 days. What is your power consumption for these 809 Billion Keys/s on Kangaroo?

Getting close boys!

Good luck!

A little under 58 Kw

Hello, check your PM messages.

Regard.

[_Counselor]

I am currently in the Quadrillions of Keys/s and still no luck with finding the 120 Puzzle... yet  

Ive used to be big into mining crypto so Ive got a huge farm of GPU's, Im currently getting around 809 Billion Keys/s on Kangaroo

What DP size are you using and how many DPs have you already found?

[NotATether]

What DP size are you using and how many DPs have you already found?

I have discovered that adjusting the DP size too high or too low actually ruins the runtime of Kangaroo so usually it's better to leave it at the default setting, or no more than 5 bits away from the default.

[yoyodapro]

What DP size are you using and how many DPs have you already found?

I have discovered that adjusting the DP size too high or too low actually ruins the runtime of Kangaroo so usually it's better to leave it at the default setting, or no more than 5 bits away from the default.

I am running DP 25 I'm at [DP Count 2^25.35/2^25.55] Searching in the 2^99-2^100 Keyspace using 1,048,576 Divided Keys

[WanderingPhilospher]

What DP size are you using and how many DPs have you already found?

I have discovered that adjusting the DP size too high or too low actually ruins the runtime of Kangaroo so usually it's better to leave it at the default setting, or no more than 5 bits away from the default.

I am running DP 25 I'm at [DP Count 2^25.35/2^25.55] Searching in the 2^99-2^100 Keyspace using 1,048,576 Divided Keys

Are you running/checking all keys at once or run 1 key for so long then run the next key?

[yoyodapro]

What DP size are you using and how many DPs have you already found?

I have discovered that adjusting the DP size too high or too low actually ruins the runtime of Kangaroo so usually it's better to leave it at the default setting, or no more than 5 bits away from the default.

I am running DP 25 I'm at [DP Count 2^25.35/2^25.55] Searching in the 2^99-2^100 Keyspace using 1,048,576 Divided Keys

Are you running/checking all keys at once or run 1 key for so long then run the next key?

All keys simultaneously.

[wedom]

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

[NotATether]

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.

[racminer]

Hi

1) Suppose I find pvk for puzzle #64
2) I import the bitcoin address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
3) I start a full fund transfer to another wallet 
4) My transaction shows up in the blockchain (showing number of confirmations)
5) Once my transaction has been launched, the publickey is then visible.

My question is as follow:
Is it possible for someone using "Pollard's kangaroo ECDLP solver" to find the private key fast enough to be able to import the same address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN and then launch  a fund transfer
 to a different wallet ? (before enough confirmation on my transaction and of course pay more gas fees than me)   



 

[wedom]

Hi

1) Suppose I find pvk for puzzle #64
2) I import the bitcoin address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
3) I start a full fund transfer to another wallet  
4) My transaction shows up in the blockchain (showing number of confirmations)
5) Once my transaction has been launched, the publickey is then visible.

My question is as follow:
Is it possible for someone using "Pollard's kangaroo ECDLP solver" to find the private key fast enough to be able to import the same address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN and then launch  a fund transfer
 to a different wallet ? (before enough confirmation on my transaction and of course pay more gas fees than me)  


 

Theoretically, it is possible. Since, if the public key 64 is known, then it will take several seconds to solve the problem.
Practically unlikely. No one will sit and wait for this key to appear. And it is not known if there will be a second blockchain

Upd. Only if you set a very low commission and the transaction freezes for a long time, then yes. This scenario is possible.
Hmm, we need to write a script that will track the mempool and immediately launch the kangaroo, search and immediately create a transaction with a higher commission. Joke )))

[racminer]

Hi

1) Suppose I find pvk for puzzle #64
2) I import the bitcoin address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
3) I start a full fund transfer to another wallet  
4) My transaction shows up in the blockchain (showing number of confirmations)
5) Once my transaction has been launched, the publickey is then visible.

My question is as follow:
Is it possible for someone using "Pollard's kangaroo ECDLP solver" to find the private key fast enough to be able to import the same address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN and then launch  a fund transfer
 to a different wallet ? (before enough confirmation on my transaction and of course pay more gas fees than me)  


 

Theoretically, it is possible. Since, if the public key 64 is known, then it will take several seconds to solve the problem.
Practically unlikely. No one will sit and wait for this key to appear. And it is not known if there will be a second blockchain

Upd. Only if you set a very low commission and the transaction freezes for a long time, then yes. This scenario is possible.
Hmm, we need to write a script that will track the mempool and immediately launch the kangaroo, search and immediately create a transaction with a higher commission. Joke )))

It is not a joke, such scripts exist ... It is not actually hard to do, just install a full node and the rest follows. It is easy to check that such watchdog-scripts are out there.

[brainless]

Hi

1) Suppose I find pvk for puzzle #64
2) I import the bitcoin address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
3) I start a full fund transfer to another wallet  
4) My transaction shows up in the blockchain (showing number of confirmations)
5) Once my transaction has been launched, the publickey is then visible.

My question is as follow:
Is it possible for someone using "Pollard's kangaroo ECDLP solver" to find the private key fast enough to be able to import the same address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN and then launch  a fund transfer
 to a different wallet ? (before enough confirmation on my transaction and of course pay more gas fees than me)  


 

Theoretically, it is possible. Since, if the public key 64 is known, then it will take several seconds to solve the problem.
Practically unlikely. No one will sit and wait for this key to appear. And it is not known if there will be a second blockchain

Upd. Only if you set a very low commission and the transaction freezes for a long time, then yes. This scenario is possible.
Hmm, we need to write a script that will track the mempool and immediately launch the kangaroo, search and immediately create a transaction with a higher commission. Joke )))

It is not a joke, such scripts exist ... It is not actually hard to do, just install a full node and the rest follows. It is easy to check that such watchdog-scripts are out there.

use electrum
in Tools >> transaction >> Use Replace-By-Fee
by default its checked
un check it
before create your transaction,
you will be safe

[wedom]

Hi

1) Suppose I find pvk for puzzle #64
2) I import the bitcoin address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN
3) I start a full fund transfer to another wallet  
4) My transaction shows up in the blockchain (showing number of confirmations)
5) Once my transaction has been launched, the publickey is then visible.

My question is as follow:
Is it possible for someone using "Pollard's kangaroo ECDLP solver" to find the private key fast enough to be able to import the same address 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN and then launch  a fund transfer
 to a different wallet ? (before enough confirmation on my transaction and of course pay more gas fees than me)  


 

Theoretically, it is possible. Since, if the public key 64 is known, then it will take several seconds to solve the problem.
Practically unlikely. No one will sit and wait for this key to appear. And it is not known if there will be a second blockchain

Upd. Only if you set a very low commission and the transaction freezes for a long time, then yes. This scenario is possible.
Hmm, we need to write a script that will track the mempool and immediately launch the kangaroo, search and immediately create a transaction with a higher commission. Joke )))

It is not a joke, such scripts exist ... It is not actually hard to do, just install a full node and the rest follows. It is easy to check that such watchdog-scripts are out there.

use electrum
in Tools >> transaction >> Use Replace-By-Fee
by default its checked
un check it
before create your transaction,
you will be safe

Does this help? Another transaction ID will be created with a different recipient address and with a higher commission. I just don’t remember whether the bitcoin core takes into account the spent of those transactions that are still in the mempool

Upd: Anyone with a little bitcoin can just do an experiment. From two identical wallets, send yourself first with a very low commission so that the transaction hangs for a long time in the mempool, and after a while (10-15 minutes) send the same coins from another wallet to another address, but with a higher commission.

[racminer]

I remember sometime ago, I ran a full bitcoin node and I wrote a python script that interacts with bitcoin-cli which checked every second the balance for I think this wallet 1F3sAm6ZtwLAUnj7d38pGFxtP3RVEvtsbV which pvk is known (empty space brainwallet). I've sent some fraction of bitcoin there and it was sucked up before my script reaction !
In fact, someone with programming skills can write a specific bitcoin-cli to scan a list of known wallets and move funds quickly.
check this https://www.blockchain.com/btc/address/1F3sAm6ZtwLAUnj7d38pGFxtP3RVEvtsbV

[rage0920]

does anyone know how to edit the work file..?? i was trying to solve key for 7 days straight and i let it run for 7 days straight and just now i indented another key and its saved in the same save.work file how do i retrieve my 7 days work ..?? please help

[ssxb]

" I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... "

for 10 bit down = 1024 pubkeys
for 20 bit down = 1024*1024 = 1048576 pubkeys
for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys
now you can start to find with above tip

can you share script to do these calculations or explain a way please

[NotATether]

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

[COBRAS]

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

NotATeater, your script not generate 260 pubkey, yours script generate 260 000. You remeber this ? And so, say how to transfrom yours 260000 to 260 ?

[ssxb]

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

consider me as child , i am just 16 year old and trying to learn things , can you please explain who to get lower keys with this script as @COBRAS said this is generating big number of keys