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.

[anyone_future_again]

I hope you like the project and you can find this well.

https://github.com/blackd116/Project-VanitySearch-Extreme/branches

If anybody finds bugs, please let me know.

Also if anyone wants some special functions implemented like binary search or other stuff, i am open to new ideas.

[anyone_future_again]

Because today i am feeling ok, i will share with you a little project just playing with the mouse in HTML page.
I created a server that is showing you full transformation of BTC addres from HEX to BTC address.

You can use GPU or CPU on creation and is generating very fast.

So go to my Github and have fun!

Stay tune for more projects!