Bitcoin puzzle transaction ~32 BTC prize to who solves it

[anyone_future_again]

Complex? To me it looks like any other program out there. What exactly did you do that's so complex. How is this any different than say FixedPaul's?

I have created the most complex vanitysearch that exist until now. I hace taked the actual code from JeanLuc and upgraded as much as it can.

All new features complete and tested
-v
Prints version
-l
Lists both GPUs with cap/memory
-i inputfile
Loaded 2 prefixes, found both
-o outputfile
Result written to file, not screen
-gpuId 0,1,2,3,4...

Both GPUs active simultaneously
-t N
CPU thread count respected
-m maxFound
Default 65536, user-selectable
-stop
Exits after all prefixes found
-start hexKey
Custom starting private key (e.g. 20000000000000000)
-range bit
Restricts search to [start, start + 2^bits]
-random
Each thread picks fresh random key per step; prints Mode: Random
-backup
Saves key= + count= to .bak every 30s
Resume
On restart with -backup, loads saved key+count and prints Resuming from backup.
EXTRA:
Also you can search for multiple prefixes from a input file up to 1 Milion.
Can handle any GPU arhitecture up to H200.
Support multiple GPU's on full speed and combining with CPU is double the power.
Support CPU's core up to 1024.

Should i add on github?
Any other features to implement?

FixedPaul's is using only 1 GPU for full power. For example 1 card 4090 i get 7.9MK/s and 5090 i get 9.5MK/s.
You cannot use also CPU and is not double the power of cards...for example for 8 cards 4090 i have almost 90.000MK/s. If you can get this power with what you find on github, good luck!
Everything that is on github, if you use CPU is limited to 256 threads by construction.
Also what is there is working only for RTX 3000, 4000 and 5000.
My code is working also on RTX 6000 ADA Blackwell up to H200+ CPU up to 1024 threads.
Plus extra to search not only by prefix, i search by any text i want inside or at the end of the Address.

So you kept the same multi GPU and CPU support from original JLP, so nothing changed there. Added extra GPU support, and changed how the input file is handled? I wouldn't call it the most complex VS out there.

Your opinion. Why is not existing this until now? I didn't reinvent anything, i just added more features and upgrade the functions with something extra. If you say is not complex, did you tried to built your own version?

[digitalbear]

Something really strange is going on here. There are over 11000 private keys with the puzzle 71 prefix up to "B9"spanning 168 videos that are 2:13 mins length each. I tested several hundred across all videos ( which were uploaded at the same time) and they all legit map to addresses with prefix 1PWo3JeB9 . The video indexing is almost linear, not quite though, and appears to be a riddle in itself. This might be from the creator? Im lost.
https://youtube.com/@bitcoinpuzzle71prefixes?si=xevYRExCNw_zPhS7

168 videos in one month. He's been busy.

This is some kind of miner that has a lot of video cards

Am I the only one who noticed he’s running a solo pool for Puzzle 71?
The results should be coming from the pool, but it seems like no one is using it anymore.
That’s probably why the videos stopped around 3 weeks ago.
Maybe it’s just a promotion for the pool… or maybe the puzzle creator left the key somewhere in one of the videos?

Overall Statistics
Puzzle 71 SOLO pool

Use exclusive prefix search method to increase the hit rate.

Current Speed

0 Mkeys/s

Peak Speed: 65156 Mkeys/s

Current Progress

9.097113%

Ranges Remaining: 61003895

[kTimesG]

I have created the most complex vanitysearch that exist until now. I hace taked the actual code from JeanLuc and upgraded as much as it can.

You do realize that turning something that was already slow, unoptimized, and full of bugs into a "most complex" version, is called a downgrade, not an upgrade, right?

[anyone_future_again]

I have created the most complex vanitysearch that exist until now. I hace taked the actual code from JeanLuc and upgraded as much as it can.

You do realize that turning something that was already slow, unoptimized, and full of bugs into a "most complex" version, is called a downgrade, not an upgrade, right?

ok. As you say...in this case i will keep for me and have fun with that limited version from github.

[E36cat]

I have created the most complex vanitysearch that exist until now. I hace taked the actual code from JeanLuc and upgraded as much as it can.

You do realize that turning something that was already slow, unoptimized, and full of bugs into a "most complex" version, is called a downgrade, not an upgrade, right?

ok. As you say...in this case i will keep for me and have fun with that limited version from github.

Don`t listen to those bots, post it and we will try it and tell you what to fix/add..

[anyone_future_again]

Let's give everybody a hint about the conversion of BTC and a little trick on inversion from BTC address to

Example:
Private key:0x61096513DBBE8AB91C

Only one SHA256 ->1PWo3JeBhFfVDPSKDvckqBh4LFNmeJPFqz
Double SHA256 -> 1PWo3JeBhFfVDPSKDvckqBh4LFNmeXPBqD

Have fun!

> import hashlib
> ALPH="123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
> def b58encode(b):
>     n=int.from_bytes(b,"big")
>     s=""
>     while n:
>         n,r=divmod(n,58)
>         s=ALPH[r]+s
>     pad=0
>     for x in b:
>         if x==0: pad+=1
>         else: break
>     return "1"*pad + (s or "1")
> def b58check(v,payload):
>     d=bytes([v])+payload
>     chk=hashlib.sha256(hashlib.sha256(d).digest()).digest()[:4]
>     return b58encode(d+chk)
> def rh(x):
>     h=hashlib.new("ripemd160"); h.update(x); return h.digest()
> p=0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
> Gx=55066263022277343669578718895168534326250603453777594175500187360389116729240
> Gy=32670510020758816978083085130507043184471273380659243275938904335757337482424
> def inv(a): return pow(a,p-2,p)
> def add(P,Q):
>     if P is None: return Q
>     if Q is None: return P
>     x1,y1=P; x2,y2=Q
>     if x1==x2 and (y1+y2)%p==0: return None
>     if P==Q: l=(3*x1*x1)*inv(2*y1)%p
>     else: l=(y2-y1)*inv((x2-x1)%p)%p
>     x3=(l*l-x1-x2)%p
>     y3=(l*(x1-x3)-y1)%p
>     return x3,y3
> def mul(k,P):
>     R=None
>     while k:
>         if k&1: R=add(R,P)
>         P=add(P,P)
>         k >>= 1
>     return R
> k=int("000000000000000000000000000000000000000000000061096513dbbe8ab91c",16)
> P=mul(k,(Gx,Gy)); x,y=P
> pubu=b"\x04"+x.to_bytes(32,"big")+y.to_bytes(32,"big")
> pubc=(b"\x02" if y%2==0 else b"\x03")+x.to_bytes(32,"big")
> print("uncompressed", b58check(0, rh(hashlib.sha256(pubu).digest())))
> print("compressed", b58check(0, rh(hashlib.sha256(pubc).digest())))
> PY'

[digitalbear]

I have created the most complex vanitysearch that exist until now. I hace taked the actual code from JeanLuc and upgraded as much as it can.

You do realize that turning something that was already slow, unoptimized, and full of bugs into a "most complex" version, is called a downgrade, not an upgrade, right?

ok. As you say...in this case i will keep for me and have fun with that limited version from github.

Don`t listen to those bots, post it and we will try it and tell you what to fix/add..

I also agree, post it on GitHub and include your Bitcoin address for tips. You never know who might need it, so it's good to have multiple options.

[vh07200]

Let's give everybody a hint about the conversion of BTC and a little trick on inversion from BTC address to

Example:
Private key:0x61096513DBBE8AB91C

Only one SHA256 ->1PWo3JeBhFfVDPSKDvckqBh4LFNmeJPFqz
Double SHA256 -> 1PWo3JeBhFfVDPSKDvckqBh4LFNmeXPBqD

Have fun!

> import hashlib
> ALPH="123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
> def b58encode(b):
>     n=int.from_bytes(b,"big")
>     s=""
>     while n:
>         n,r=divmod(n,58)
>         s=ALPH[r]+s
>     pad=0
>     for x in b:
>         if x==0: pad+=1
>         else: break
>     return "1"*pad + (s or "1")
> def b58check(v,payload):
>     d=bytes([v])+payload
>     chk=hashlib.sha256(hashlib.sha256(d).digest()).digest()[:4]
>     return b58encode(d+chk)
> def rh(x):
>     h=hashlib.new("ripemd160"); h.update(x); return h.digest()
> p=0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
> Gx=55066263022277343669578718895168534326250603453777594175500187360389116729240
> Gy=32670510020758816978083085130507043184471273380659243275938904335757337482424
> def inv(a): return pow(a,p-2,p)
> def add(P,Q):
>     if P is None: return Q
>     if Q is None: return P
>     x1,y1=P; x2,y2=Q
>     if x1==x2 and (y1+y2)%p==0: return None
>     if P==Q: l=(3*x1*x1)*inv(2*y1)%p
>     else: l=(y2-y1)*inv((x2-x1)%p)%p
>     x3=(l*l-x1-x2)%p
>     y3=(l*(x1-x3)-y1)%p
>     return x3,y3
> def mul(k,P):
>     R=None
>     while k:
>         if k&1: R=add(R,P)
>         P=add(P,P)
>         k >>= 1
>     return R
> k=int("000000000000000000000000000000000000000000000061096513dbbe8ab91c",16)
> P=mul(k,(Gx,Gy)); x,y=P
> pubu=b"\x04"+x.to_bytes(32,"big")+y.to_bytes(32,"big")
> pubc=(b"\x02" if y%2==0 else b"\x03")+x.to_bytes(32,"big")
> print("uncompressed", b58check(0, rh(hashlib.sha256(pubu).digest())))
> print("compressed", b58check(0, rh(hashlib.sha256(pubc).digest())))
> PY'

Hello are you the one FixedPaul on github?

[average_student]

https://ibb.co/TqbhsZ5x

Searching in 6ca9000000000000000000000000000000 - 6caf000000000000000000000000000000

[anyone_future_again]

No, i am not. Many thanks to Pauld and JeanLuc!!!
Now i am preparing the new version and i will share the link to github. I am still thinking if i will add all project or only the final compiled program.

[average_student]

I feel that they are ,yes, "deterministic"

They are not.

[stillhere@2009]

Something really strange is going on here. There are over 11000 private keys with the puzzle 71 prefix up to "B9"spanning 168 videos that are 2:13 mins length each. I tested several hundred across all videos ( which were uploaded at the same time) and they all legit map to addresses with prefix 1PWo3JeB9 . The video indexing is almost linear, not quite though, and appears to be a riddle in itself. This might be from the creator? Im lost.
https://youtube.com/@bitcoinpuzzle71prefixes?si=xevYRExCNw_zPhS7

Oh finally you guys talking about this random channel the owner of channel is a crazy guy

[vh07200]

Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force.

The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key.
https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharing
Create a bin file for the KeyHunt-Cuda program:
py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin
BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin
Launching KeyHunt-Cuda
KeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin
Launching keyhunt
keyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff

The file xyz135_address.txt can be used to find the address.
https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharing

If you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally.

Let's find #135 together!

can i have your telegram ?

[danielcec2]

% RANGE TOTAL      DECIMAL                                    ADRESS
18.779760% =1402303888738421717393 1PWo3JeB9hJCjj4RtFnS74fJi6TgKRb81e
25.470790% =1481297631739205396460 1PWo3JeB9NjN72qBH1nwMPP2QmjRbsFAtV
27.747647% =1508178020354706369084 1PWo3JeB9HJg4StZRKn7Et9JgG4bUMWWDG
28.462917% =1516622430655368159121 1PWo3JeB9jqhsXUNL7QLWQ6JPSCNXHnScG
37.766419% =1626458797995677853123 1PWo3JeB9JMGmDqsn1Eea6HijWiwfLwhaR
37.713616% =1625835416473178838098 1PWo3JeB9GjS1QSwh4CUSupnBUFd931rWB
44.507143% =1706039216429624571529 1PWo3JeB9FjRzv53pXEv7iSKwdKFfttPma
49.779800% =1768287768912895834395 1PWo3JeB9vj6uzSVE8piiPbkrCqt6shP6N
50.158504% =1772758717250017619841 1PWo3JeB9jWRk2vLNwcqHvoZ6qP5GmuiaL
57.961730% =1864882950789034895740 1PWo3JeB9jUAfYHTXQjUYuS6timskdRieF
57.984062% =1865146598986922941237 1PWo3JeB9jSiimGHNbZUoc9hfVe9Ko5SGr
63.464519% =1929848418775489634186 1PWo3JeB9JmFqoVpWBvJjyqFfrbYvkzYat
64.324864% =1940005576616778403607 1PWo3JeB9ZjyUQ11wYs7jTSTHj6ToXCRWn
64.822941% =1945885833104418482963 1PWo3JeB9gjLidXVCXMDn52adRTPetL17q
67.011242% =1971720730525387119516 1PWo3JeB9J9puJqnPMk2L5nAQgGFgYJArw
81.966918% =2148286191759981289548 1PWo3JeB9qJb6rDDxwsTz11HhJaspuJrd1
89.712241% =2239726817778896215561 1PWo3JeBzCJyCuofb8gERr1RHvPcAa9qQH
89.717894% =2239793565437336166878 1PWo3JeBtKgRTGAo2A8Af3Qc4Kyfsn5qi8
89.720990% =2239830114844766344925 1PWo3JeBiqUHdsEjLvs1iHRBTWi62q1994
89.726228% =2239891953831813249270 1PWo3JeBrc4PUSqvwwecLM8Sm7bN838YMC
89.726929% =2239900224900811221133 1PWo3JeBni1tysKq4kFJvNf21kgaTm6pQ3
89.727199% =2239903416948670847074 1PWo3JeBS1Dy84eDvwfCbStqsq2fXP1ssw
90.309128% =2246773622638334217676 1PWo3JeB9Rjb5oH5SmwBiZCKVdhKxrtY5E
92.866623% =2276967188563859406067 1PWo3JeB9CjR63NbVDHGrH3JR1VYieADWS
                                                                     1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU


   

[optioncmdPR]

Something really strange is going on here. There are over 11000 private keys with the puzzle 71 prefix up to "B9"spanning 168 videos that are 2:13 mins length each. I tested several hundred across all videos ( which were uploaded at the same time) and they all legit map to addresses with prefix 1PWo3JeB9 . The video indexing is almost linear, not quite though, and appears to be a riddle in itself. This might be from the creator? Im lost.
https://youtube.com/@bitcoinpuzzle71prefixes?si=xevYRExCNw_zPhS7

Do not click on videos...this is another briliant ideea to make legit money....if he was a nice guy, was adding free the information.

I dont see any way that the maker of these there could financially gain from the videos. They arent advertized, there are no links, there is nothing. I scripted a visual base frame by frame text extractor for youtube and pulled 3980 keys in  video "1" . I checked 100ish of them from random  intervals and all had the puzzle 71 prefix. There are no duplicates.
There are 168 videos, thats somewhere around 500,000 + keys w/ prefix match.

https://github.com/optioncmdpr/Tube2textdump

Why scramble the information instead of adding here as everyone else? I do not see the point...if you want to give a hint or share, do it right and do not joke on this...making this videos, he need a lot of views and make money, otherwise he was adding here the full list....but wait...he is affraid that somebody will use his data to win the puzzle 71

 Well whoever is behind it is advocating the potential only of finding the full key, so no guarantee that its even in there and if it was I would very surprised seeing as the prefix's seem to have a match continuance barricade at B9, with an occasional B9j but those are super rare. But anything is possible so In going to be an idiot and spend some time poking at this . Im working on a better extraction script to handle all 168 videos in sequence, sort the keys alphabetically, print out each keys public key and hash 160 . I also intend to add a columnn to specify which video #iit originated from as well its corresponding timestamp in milliseconds from start. The one problem I am trying to solve is how to get youtube to expose all 168 video links at once so I can send them to the OCR engine.

[optioncmdPR]

Something really strange is going on here. There are over 11000 private keys with the puzzle 71 prefix up to "B9"spanning 168 videos that are 2:13 mins length each. I tested several hundred across all videos ( which were uploaded at the same time) and they all legit map to addresses with prefix 1PWo3JeB9 . The video indexing is almost linear, not quite though, and appears to be a riddle in itself. This might be from the creator? Im lost.
https://youtube.com/@bitcoinpuzzle71prefixes?si=xevYRExCNw_zPhS7

Oh finally you guys talking about this random channel the owner of channel is a crazy guy

Oh yea I started to lean to that conclusion when I saw that the last few videos had bizarre obfuscation attemps with colored streaks, upsided down and reversed text, screen tearing, zoomed in areas....wierd shit. It kinda creepy actually.  I was unable to pull a single key from those ones ( there are 6 like this ) using visual auto extraction methods. I did however manage to get some  keys manually from less chaotic portions in the video(s) But you know what is actually crazy? The fact that I pulled exactly 2560 keys out of a total of 3980 from video 1 with the 1PWo3JeB9 prefix. The other 1420  keys were in the same range for#71 just not prefix matched. The rest of videos seem to contain strictly prefixed addresses only. As to why there are extra non prefixed keys in the proper range found in video 1 , well, I have no idea. If this shit keeps getting deeper I will most probably surrender and abandon this whole damn puzzle fiasco entirely. My eyes are sore, and my brain effin' hurts.  

[anyone_future_again]

Something really strange is going on here. There are over 11000 private keys with the puzzle 71 prefix up to "B9"spanning 168 videos that are 2:13 mins length each. I tested several hundred across all videos ( which were uploaded at the same time) and they all legit map to addresses with prefix 1PWo3JeB9 . The video indexing is almost linear, not quite though, and appears to be a riddle in itself. This might be from the creator? Im lost.
https://youtube.com/@bitcoinpuzzle71prefixes?si=xevYRExCNw_zPhS7

Oh finally you guys talking about this random channel the owner of channel is a crazy guy

Oh yea I started to lean to that conclusion when I saw that the last few videos had bizarre obfuscation attemps with colored streaks, upsided down and reversed text, screen tearing, zoomed in areas....wierd shit. It kinda creepy actually.  I was unable to pull a single key from those ones ( there are 6 like this ) using visual auto extraction methods. I did however manage to get some  keys manually from less chaotic portions in the video(s) But you know what is actually crazy? The fact that I pulled exactly 2560 keys out of a total of 3980 from video 1 with the 1PWo3JeB9 prefix. The other 1420  keys were in the same range for#71 just not prefix matched. The rest of videos seem to contain strictly prefixed addresses only. As to why there are extra non prefixed keys in the proper range found in video 1 , well, I have no idea. If this shit keeps getting deeper I will most probably surrender and abandon this whole damn puzzle fiasco entirely. My eyes are sore, and my brain effin' hurts.  


So let me be clear. This guy who created the videos is a SCAM! he took a vanitysearch, scanned 1PWo3Je and he found some B and B9. After that to be more interesting, he scrambled the images and to make views...

Advice: if you don't want to loose precious time of your life don't go there. I am not a hater but taking some ranges random you will see what is happening. I have used that OCR program, extracted almost all ranges from video and scanned, so it's a big SCAM!!!