Search content
Sort by
Showing 20 of 58 results by madogss
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Who ever help me with this code able to run on gpu
I definitely give u 1 BTC
NEED ACHIEVE ATLEAST 250M Keys/sec
#include <stdio.h>
#include <cuda.h>
#include "secp256k1.h"
#include "sha256.h"
#include "ripemd160.h"
__global__ hash() {
}
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
If above code is done in gpu way
I am sure that I can find in a month even 71 to 80 puzzle
I am sure that I can find in a month even 71 to 80 puzzle
That code is already being done in a gpu way besides loading the file.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
basically it's a waste of time, if you want to solve it just invest in a lot of gpu, there's no other way to solve it. Are you tired?
Mybe private key cracker asic with ??ths 🤪
asic does sha256d which is 2 sha256 we only need 1, I think one guy got his asic to forcefully output before hashing the second time but sha256 is not what's holding us back it's secp256k1 that's limiting speed.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I have a side question that if the private key of the old address with balance is found, can it be freely spent, or do we need other measures to make it legal?
Addresses in this puzzle yes they can be spent freely.
you can find a list of the addresses here: https://privatekeys.pw/puzzles/bitcoin-puzzle-tx
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Surprised no one's mentioned hashcat for WIF solving.
Still will take you much longer than priv to h160 but since it's open source and has cpu, gpu, and fpga support it is a great resource for people trying to create their own software.
Still will take you much longer than priv to h160 but since it's open source and has cpu, gpu, and fpga support it is a great resource for people trying to create their own software.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
you could convert binary keys to hex easily and then run keyhunt
Hmmm, I am not sure if Keyhunt can do that. Just to be clear. I want to check .txt file of eg. 1 000 000 hypothetic 256bit private keys (not consecutive, more like random) against list of addreses. Keyhunt can't do that I think.
Best
Regards
Damian
if the list is that small then
Code:
import secp256k1 as ice
keys = []
addresses = []
with open("keys.txt", 'r') as vf:
for line in vf:
for word in line.split():
keys.append(word)
with open("addresses.txt", 'r') as vf:
for line in vf:
for word in line.split():
addresses.append(word)
for i in range(len(addresses)):
for k in range(len(keys)):
if ice.privatekey_to_address(0, True, keys[k]) == addresses[i]:
with open("Found.txt", "w") as file:
file.write(f"Found: {keys[k]} Address: {addresses[i]}")
file.close()
print("FOUND")
exit()
keys = []
addresses = []
with open("keys.txt", 'r') as vf:
for line in vf:
for word in line.split():
keys.append(word)
with open("addresses.txt", 'r') as vf:
for line in vf:
for word in line.split():
addresses.append(word)
for i in range(len(addresses)):
for k in range(len(keys)):
if ice.privatekey_to_address(0, True, keys[k]) == addresses[i]:
with open("Found.txt", "w") as file:
file.write(f"Found: {keys[k]} Address: {addresses[i]}")
file.close()
print("FOUND")
exit()
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Just a big list of hex/binary/decimal numbers no ranges or anything like that, I cant go into anymore detail or will be out of pocket 6.7btc
A python script would probably be fine but then that is CPU only then?. But that might work. Has anyone made a basic python script to check keys from a script.I guess GPU is a non issue, ill just get basic code working first.
I have done quite a bit of coding, but nothing on the cryptography side. I take it it would only be a few 100 lines of code?
Is it just like take 256bit private key guess, then hash it to the wallet address and check that matches the wallet address?
with Iceland's secp256k1 library it's simple https://github.com/iceland2k14/secp256k1
Code:
import secp256k1 as ice
Target = "1BP7ByGjkekGpUPweRGjBVWWa6hagnnrnm" # change with address you want to find
n = 0
keys = []
with open("possibilities.txt", 'r') as vf:
# here you would replace with getting each number from file and converting decimal if needed
while True:
if ice.privatekey_to_address(0, True, keys[n]) == Target:
with open("Found.txt", "w") as file:
file.write(f"Found: {keys[n]}")
file.close()
print("FOUND")
exit()
n += 1
Target = "1BP7ByGjkekGpUPweRGjBVWWa6hagnnrnm" # change with address you want to find
n = 0
keys = []
with open("possibilities.txt", 'r') as vf:
# here you would replace with getting each number from file and converting decimal if needed
while True:
if ice.privatekey_to_address(0, True, keys[n]) == Target:
with open("Found.txt", "w") as file:
file.write(f"Found: {keys[n]}")
file.close()
print("FOUND")
exit()
n += 1
Since you have so many combinations you will either need a lot of ram or split into multiple files.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Ok few questions before I get a GPU, because I will have around 200 trillion combinations maybe more.
Is the 4090 or 5090 way faster or not worth the $$ or is the 3090 just the best bang for your buck does it have to be Nvidia as AMD have good price to performance.
Converting into a Hexadecimal without Ox sounds easy enough. Hopefully python can output 100 trillion numbers without issues.
Could you give me a basic run though and how to set up and use keyhunt-cuda on a premade hexadecimal file (using a subprocess). Would it be txt file or a py file or a json file.
Also I take it this computation can be done offline once setup?
Cheers
With that many combinations it would be faster to write your own software since you would have to start and close the program every time.
What are the combinations are they ranges like 80000:fffff or are they 1 hexadecimal like d2c55?
if they are ranges then you would want to customize keyhunt-cuda so that each thread is of the gpu is searching a custom range.
if they are 1 hex number then a python script would be enough and if you wanted to do it faster then you would want to write it in C or C++.
I don't know about the specific speeds for the 5090 but in this topic there should be 4090 speeds if I remember correctly it's around 4 to 6 billion keys a second.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Hey Puzzlers
What would be the best offline way to test a big list of either Decimal or Binary possibilities I have.
Just CPU testing, I could buy a GPU if its like 100x faster than CPU.
Happy to give the 1-3 people 0.1btc that help me when I solve puzzle 69. (If that's allowed on this forum)
Note offline solving only, no pools or online, happy to download any requirements first. - This pc will not be connected to the internet once ready to solve the problem.
Cheers
What would be the best offline way to test a big list of either Decimal or Binary possibilities I have.
Just CPU testing, I could buy a GPU if its like 100x faster than CPU.
Happy to give the 1-3 people 0.1btc that help me when I solve puzzle 69. (If that's allowed on this forum)
Note offline solving only, no pools or online, happy to download any requirements first. - This pc will not be connected to the internet once ready to solve the problem.
Cheers
For cpu you want to use keyhunt or keyhunt-cuda. here's the links https://github.com/WanderingPhilosopher/KeyHuntCudaClient https://github.com/albertobsd/keyhunt
You can also find pre compiled ones for keyhunt on github.
cpu averages about 3.5 million keys a second per thread if using above software or I believe according to ktimesg 10 million keys a second per thread with custom software.
Gpu's are way faster a 3080 does about 2200MK/s or 2.2 billion keys a second.
Best way to test a big list is to write a python script to read the doc and import the possibilities into a list then in a loop convert the decimal or binary into hexadecimal get rid of the 0x in the front and run keyhunt or kehunt-cuda in that range using a subprocess.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I'm still learning Keyhunt and I have another question...
https://github.com/albertobsd/keyhunt?tab=readme-ov-file#xpoint-mode
In that documentation for "xpoint mode" he says that you can add/subtract values from the public key of a puzzle to fill the search file with the public key itself plus a bunch more that are (what I'm going to call) small jumps away from the actual public key, in order to (if I'm understanding this all correctly) increase the changes of hitting a match...
The problem is that I can't figure out how to correctly do the addition/subtraction... Anyone know exactly how to do this?
His example is for puzzle #40... and I can take the (now known) private key, get the X/Y point from it, and make the correct public key from that... I then tried subtracting the number 453856235784 from the X value, the X & Y, and from the public key itself, but none of those attempts yielded the same result that he shows ("034eee474fe724cb631d19f24934e88016e4ef2aee80d086621d87d7f6066ff860")
Also, I assume the numbers chosen to add/subtract aren't important or special, correct? Like, they don't have to be multiples of 256 or anything, right...?
Any help would be much appreciated, thx
https://github.com/albertobsd/keyhunt?tab=readme-ov-file#xpoint-mode
In that documentation for "xpoint mode" he says that you can add/subtract values from the public key of a puzzle to fill the search file with the public key itself plus a bunch more that are (what I'm going to call) small jumps away from the actual public key, in order to (if I'm understanding this all correctly) increase the changes of hitting a match...
The problem is that I can't figure out how to correctly do the addition/subtraction... Anyone know exactly how to do this?
His example is for puzzle #40... and I can take the (now known) private key, get the X/Y point from it, and make the correct public key from that... I then tried subtracting the number 453856235784 from the X value, the X & Y, and from the public key itself, but none of those attempts yielded the same result that he shows ("034eee474fe724cb631d19f24934e88016e4ef2aee80d086621d87d7f6066ff860")
Also, I assume the numbers chosen to add/subtract aren't important or special, correct? Like, they don't have to be multiples of 256 or anything, right...?
Any help would be much appreciated, thx
Here's https://bitcointalk.org/index.php?topic=5347863.0 and https://bitcointalk.org/index.php?topic=5218972.680
there are also more topics on this that you can find if you search for them.
Also in this topic you can a python script by Etar for public key division.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
So, if I'm understanding it the last 3 places are cut off or will they continue to be cut off as the number grows. The reason why I'm asking is to keep track of my place. What would the correct syntax to output it to a file and would the file have it cut off or would it be correct in the file?
No the last 3 places are not cut off and the number continues to grow without hiding any numbers.
It is hard to keep track of your place because keyhunt-cuda works by dividing the global range by your grid so each thread is assigned a small chunk and each is incremented.
example if your grid is 512,512 and your global range is 3FFFFFFFF (34 bit) then that means you have 512 * 512 = 262,144 threads
so with 3FFFFFFFF(17179869183) / 262,144 = 65,535.999996185302734375 then we round to 65,536
this means each thread searches a small range of 65,536 keys.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Question for someone smarter than me. I don't understand, I'm running KeyHunt-Cuda but the output shows 661.92 Mk/s but for the T: 15,032,385,536. only 15 million. can someone explain it because the original key hunt was display correctly. maybe its just me not understanding what the T stands for. I though it was threads processed which would be a single key processed. correct me if I'm wrong please.
PS C:\KeyHunt-Cuda-main> .\KeyHunt-Cuda.exe -t 0 -g --gpui 0 --gpux 512,512 -m address --coin BTC --range 730fc235c00000000:730fc235fffffffff 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
KeyHunt-Cuda v1.07
COMP MODE : COMPRESSED
COIN TYPE : BITCOIN
SEARCH MODE : Single Address
DEVICE : GPU
CPU THREAD : 0
GPU IDS : 0
GPU GRIDSIZE : 512x512
SSE : YES
RKEY : 0 Mkeys
MAX FOUND : 65536
BTC ADDRESS : 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
OUTPUT FILE : Found.txt
Start Time : Sat Feb 22 13:25:47 2025
Global start : 730FC235C00000000 (67 bit)
Global end : 730FC235FFFFFFFFF (67 bit)
Global range : 3FFFFFFFF (34 bit)
GPU : GPU #0 Tesla T4 (40x64 cores) Grid(512x512)
[00:00:20] [CPU+GPU: 661.98 Mk/s] [GPU: 661.98 Mk/s] [C: 78.125000 %] [R: 0] [T: 13,421,772,800 (34 bit)] [F: 0]
=================================================================================
PubAddress: 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qbP2K5cm35XKMND1X1KW
Priv (HEX): 730FC235C1942C1AE
PubK (HEX): 0212209F5EC514A1580A2937BD833979D933199FC230E204C6CDC58872B7D46F75
=================================================================================
[00:00:22] [CPU+GPU: 661.92 Mk/s] [GPU: 661.92 Mk/s] [C: 87.500000 %] [R: 0] [T: 15,032,385,536 (34 bit)] [F: 1]
PS C:\KeyHunt-Cuda-main> .\KeyHunt-Cuda.exe -t 0 -g --gpui 0 --gpux 512,512 -m address --coin BTC --range 730fc235c00000000:730fc235fffffffff 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
KeyHunt-Cuda v1.07
COMP MODE : COMPRESSED
COIN TYPE : BITCOIN
SEARCH MODE : Single Address
DEVICE : GPU
CPU THREAD : 0
GPU IDS : 0
GPU GRIDSIZE : 512x512
SSE : YES
RKEY : 0 Mkeys
MAX FOUND : 65536
BTC ADDRESS : 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
OUTPUT FILE : Found.txt
Start Time : Sat Feb 22 13:25:47 2025
Global start : 730FC235C00000000 (67 bit)
Global end : 730FC235FFFFFFFFF (67 bit)
Global range : 3FFFFFFFF (34 bit)
GPU : GPU #0 Tesla T4 (40x64 cores) Grid(512x512)
[00:00:20] [CPU+GPU: 661.98 Mk/s] [GPU: 661.98 Mk/s] [C: 78.125000 %] [R: 0] [T: 13,421,772,800 (34 bit)] [F: 0]
=================================================================================
PubAddress: 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qbP2K5cm35XKMND1X1KW
Priv (HEX): 730FC235C1942C1AE
PubK (HEX): 0212209F5EC514A1580A2937BD833979D933199FC230E204C6CDC58872B7D46F75
=================================================================================
[00:00:22] [CPU+GPU: 661.92 Mk/s] [GPU: 661.92 Mk/s] [C: 87.500000 %] [R: 0] [T: 15,032,385,536 (34 bit)] [F: 1]
That's displaying correctly, that is 15 billon not million multiply you Mk/s by the time so 661920000 * 22 = 14.56 billion this number is not exact because the speed fluctuates.
The T is for total keys checked.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
"here" do you mean in this thread or is there a link?
thanks
another question for the experts, is it possible to do a bruteforce search with GPUs (lots of them) that produces 1.44×10^30 keys per second?
That's about 1,440,000,000,000,000,000,000,000,000,000,000 keys/s
One nonillion four hundred forty octillion......
yes in this thread.
yes you can it's easy if you have tons of GPUs.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
How do bots anticipate the transfer transaction if a puzzle wallet is found ?
They don't, you set up a bot to check the blockchain whether through your own node or a public node like blockchain.com to see if a public key is available for the puzzle wallet every few seconds (public nodes usually have rate limits so you might have to check less often).
You can look at the history here some people have discussed this and posted versions of their bot code.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Thank you for the clarification. I wanted to understand the difference between a keyhant and a kangaroo. as for the fastest algorithm, I meant which is the fastest at the moment, not in theory.
I have an idea and I would really like someone to tell me about kangaroo's work. need the core of the algorithm and not much information to change the jumping mechanics. also need an algorithm for calculating the bitcoin address.
Can you help me ?
How are the kangaroo starting points calculated? what data (values) does the program use? what value is the public key converted from?
You will want to look at papers published for a deeper understanding or look at the kangaroo discussions on here but for basic understanding kangaroo has 2 types tames and wilds together they are a herd usually 1 tame and 2 wilds you can look at jeanlucpons or retiredC's readme for what they chose, tames jump to a random point then increment sequentially recording every point they land on while wilds jump from random point to random point not recording anything until they run into a tame then they hash and if the public key matches wow you found the key but if not then you get a dead kangaroo.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
hello. Can I ask you a question about kangaroos? using the example of the kangaroo RC.
When the program starts, the total number of kangaroos is displayed - 1507328 kangaroos, Speed: 2271 MKeys/s - do I understand correctly that the speed is indicated for each kangaroo?
When the program starts, the total number of kangaroos is displayed - 1507328 kangaroos, Speed: 2271 MKeys/s - do I understand correctly that the speed is indicated for each kangaroo?
no its all the kangaroo's combined.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
I might be thinking about this wrong but if you had a DB of DPs for say the 70 bit range then could use alberts ecctools to divide the #135 to that range and check for collisions, would that be faster then running bsgs over and over on that range for each pubkey.
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Does anyone else see the zcash in the first 5 puzzle addresses?
what do you mean ?
Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Would not trust it, original poster Nigromante on https://bitcointalk.org/index.php?topic=5218972.msg62745750#msg62745750 Sketchy