Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 64. (Read 253699 times)
yeah, I already looked at all the diffs (git diff with git-delta) so you see it like shown on your screenshots. Very neat tool to get the data displayed in linux CLI. However the program does not work as intended, GPU is not utilized at all, only CPU works. The performance counter (rate) shows unreliable and unrealistic high values (trillions and billions of MKeys/sec) depending on the grid size you choose. But most important part is that the GPU is not utilized at all. You can check with monitoring tools on your system OS.
sad we cannot see the diff to JLP's original kangaroo tool. Anyone dived into mikorists' code and can share some thoughts about the changes and implementation routines ?
I didn't have time to go through all the files, but I did go through the SECPK1 folder. Everything has been changed to work for 256bit if the CPU is used. Looking at the counter this version is about 15-20% faster than the original in CPU mode. I didn't look at how the GPU is used. This is a mixed code between ZenulAbidin & AlbertTajuelo. There is nothing new here.
120, 125 and 130.
captured by hacker ? because this address is 1DiegoU6ETJXK9hNWVTeuK4Y8fkksPnEnK seem fishy with 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
and he's announce this "https://www.blockchain.com/explorer/transactions/btc/69888f5e55d414b8de65f3a9307a1f414d7035cf9142239045300ce018984bd4"
the next target to take and spend.
{
"address": "1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"pkscript": "76a914739437bb3dd6d1983e66629c5f08c70e5276937188ac",
"value": 1231,
"spent": false,
"spender": null
},
it's 67, anyone who can find even 67, the transactions will be attacked by this person.
ngl, this guy very smart and genius build the transaction and from the number of transactions increasing slowly and rhythmically.
captured by hacker ? because this address is 1DiegoU6ETJXK9hNWVTeuK4Y8fkksPnEnK seem fishy with 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
and he's announce this "https://www.blockchain.com/explorer/transactions/btc/69888f5e55d414b8de65f3a9307a1f414d7035cf9142239045300ce018984bd4"
the next target to take and spend.
{
"address": "1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"pkscript": "76a914739437bb3dd6d1983e66629c5f08c70e5276937188ac",
"value": 1231,
"spent": false,
"spender": null
},
it's 67, anyone who can find even 67, the transactions will be attacked by this person.
ngl, this guy very smart and genius build the transaction and from the number of transactions increasing slowly and rhythmically.
You are right about the attack. However about 3Emi, I do not think so, that transaction you shared does not belong to 3Emi, it belongs to a lamer, a noob, a very beginner who does not know anything.
And for you guys, I shared in older posts a script where you can immediately move BTC from one wallet to another. Use those kind of proper and reliable script to move when you solve any puzzle. Also, move whole balance all in once, because while waiting small amount of transfer to be moved (testing if btc is going), hackers start slowing and solves the private key from the exposed public key in 4-5 minutes for the small numbers like the puzzle #67.
python scans 50,000 addresses per second
Just to add... Rust is about 10-15 times faster than python, depending on which Crates are used on which hardware and how it is compiled. So for those who don't have a GPU, they also have a solution together with standard C++ scripts.
120, 125 and 130.
captured by hacker ? because this address is 1DiegoU6ETJXK9hNWVTeuK4Y8fkksPnEnK seem fishy with 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
and he's announce this "https://www.blockchain.com/explorer/transactions/btc/69888f5e55d414b8de65f3a9307a1f414d7035cf9142239045300ce018984bd4"
the next target to take and spend.
{
"address": "1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"pkscript": "76a914739437bb3dd6d1983e66629c5f08c70e5276937188ac",
"value": 1231,
"spent": false,
"spender": null
},
it's 67, anyone who can find even 67, the transactions will be attacked by this person.
ngl, this guy very smart and genius build the transaction and from the number of transactions increasing slowly and rhythmically.
captured by hacker ? because this address is 1DiegoU6ETJXK9hNWVTeuK4Y8fkksPnEnK seem fishy with 3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
and he's announce this "https://www.blockchain.com/explorer/transactions/btc/69888f5e55d414b8de65f3a9307a1f414d7035cf9142239045300ce018984bd4"
the next target to take and spend.
{
"address": "1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9",
"pkscript": "76a914739437bb3dd6d1983e66629c5f08c70e5276937188ac",
"value": 1231,
"spent": false,
"spender": null
},
it's 67, anyone who can find even 67, the transactions will be attacked by this person.
ngl, this guy very smart and genius build the transaction and from the number of transactions increasing slowly and rhythmically.
Holy snappers, guys! How could we forget about this?
We did not write #66 off our bingo cards. Here, let me sort this out real quick:
Now we can officially transition to #67.
We did not write #66 off our bingo cards. Here, let me sort this out real quick:
Now we can officially transition to #67.
for real, i forgot who's make that wheel of fortune HAHAHAH.
Maybe bitcoin key generation cypher technique use to genrate these address still searching the method to solve this problem.
No, I don't have enough XP to meddle with the Wheel of Fortune. This thing is just too powerful.
Just by making this simple edit it took me so much mana and HP that will take me weeks to recover.
Just by making this simple edit it took me so much mana and HP that will take me weeks to recover.
Holy snappers, guys! How could we forget about this?
We did not write #66 off our bingo cards. Here, let me sort this out real quick:
We did not write #66 off our bingo cards. Here, let me sort this out real quick:
Can you round your circle more ? to 160
))) This is you try to sell python scrypt for brute 130 puzzle some posts ago ?)))
Holy snappers, guys! How could we forget about this?
We did not write #66 off our bingo cards. Here, let me sort this out real quick:
Now we can officially transition to #67.
We did not write #66 off our bingo cards. Here, let me sort this out real quick:
Now we can officially transition to #67.
Let me fix that graph for you
Before judging, note that all your % and etc. are inside the red line and even if it weren't it would need a very high amount of zoom-in in to actually be noticeable.
% is basicly following from web privatekeys, and for the rest is just for description what the lines do on that box graph.
okay bro, thankyou for sharing your thoughts.
Let me fix that graph for you
Before judging, note that all your % and etc. are inside the red line and even if it weren't it would need a very high amount of zoom-in in to actually be noticeable.
Also to note you need the specific Purebasic v.5.31 other versions to my knowledge do not work
That's right. But once you buy it you gain access to any version, I think.
I'm not going to tell you guys that you could get it from some torrent cause it might be against forum rules/country laws.
And since I'm not telling anyone that, I don't even need to say to be careful with potentially backdoored software provenient from torrents.
Any other Kangaroo version known that is known to be usable for >128bit ranges ?
Note that its Windows only and if you want to compile it yourself you need PureBasic, which is paid.
Also to note you need the specific Purebasic v.5.31 other versions to my knowledge do not work
Any other Kangaroo version known that is known to be usable for >128bit ranges ?
This has been answered 10 thousand times in this same thread some pages back.
The only public available Kangaroo that works beyond 125 bits is Etar's.
It's based on JLP's but it can go up to 192 bits.
It has an edge on the speed too, yielding +-1Gk/s more than JLP's (at least on my setup).
https://github.com/Etayson/Etarkangaroo
Note that its Windows only and if you want to compile it yourself you need PureBasic, which is paid.
python scans 50,000 addresses per second
The GPU scans +- 5,000,000,000 addresses per second
GPU scans +- 100,000 times faster than python
so you can forget about python, you have to make codes for gpu
you don't have eternity to solve it with python
The GPU scans +- 5,000,000,000 addresses per second
GPU scans +- 100,000 times faster than python
so you can forget about python, you have to make codes for gpu
you don't have eternity to solve it with python
bro can i talk about 1000 Btc puzzle i am using python but can't use my gpu i have rtx 4070 plz help
I am using Rotor-Cuda with relatively small blocks driven by my python script.
bro can i talk about 1000 Btc puzzle i am using python but can't use my gpu i have rtx 4070 plz help
You run a 65 bit range searching for pubkey Z, solve in expected time, and accumulate x amount of DPs to solve (whatever number you want to use, it is irrelevant)
Now, you tamed the wilds from the previous 65 bit run.
Lastly, you run a 65 bit range searching for pubkey W, on average, how much quicker will you solve pubkey W versus pubkey Z?
Now, you tamed the wilds from the previous 65 bit run.
Lastly, you run a 65 bit range searching for pubkey W, on average, how much quicker will you solve pubkey W versus pubkey Z?
A LOT BETTER, if this was your question. And every time I benchmark to test for a new solution, I tame the found wild DPs, so results improve themselves. I also trim periodically DPs that are outside of some range, since almost 99% of the solutions are found via a DP which is an specific median range. I almost never find a key by hitting a DP which is below 50% of the interval, for example, even though there were a lot of them in that region. Don't ask for why that happens, I can only speculate it has to do with average travel size, who knows.
Currently I have a 80-bits solver DP database that can solve any key in under 6 seconds on a GPU, and under a minute if using the CPU.
Jump to: