Bitcoin puzzle transaction ~32 BTC prize to who solves it

[oddstake]

Unfortunately, running tests and looking at the keys/s metric I'm still unsure which will be faster for 135 (well both are astronomically low for me but whatever), the kangaroo stills stays in thr Mkeys, while bsgs does 300 petakeys/sec. So I'm a bit confused, but haven't played with it enough I guess. But probably the Mkeys that the kangaroo shows are not important.

On my hardware, it finds puzzle 80 key in 28 seconds, with -R (random)
AMD EPYC 9965 192c/384t , 1T DDR5

Code:

[+] Reading binary fuse filter from file keyhunt_bsgs_4_412316860416.fuse [HP] malloc 884797 MB -> 1GB hugepage OK
..... Done!  884797.50 MB
[+] Reading bloom filter from file keyhunt_bsgs_6_12884901888.blm ..... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_402653184.tbl ..... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_402653184.blm ..... Done!
[+] Init time: 3m 11s
[+] Thread Key found privkey ea1a5c66dcc11b5ad180   : ~1 Zkeys/s (1046436873320693917286 keys/s)
[+] Publickey 037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc
All points were found
~/TRIPLE linux@linux-x8664 3m 39s

[ldabasim]

Thats some serious machine you got   what about the kangaroo

21778071482940061661655974875633165533184 possible keys for 135 divided by your rate 1046436873320693917286, then the seconds to years -> takes 633 (or 63?) billion years to scan the range. The kangaroo gives me a way shorter time estimate for 135 of around 100 thousand years on my $500 cpu, for you it will be way less. But is it accurate. So indeed the bsgs is a waste of time for high range even with 1 tb ram and the kangaroo starts to win due to its sqrt scaling. The math is not complex, but very big numbers indeed.

Are you running puzzle 71, my math says 35 years to cover range on your pc, based on how much less Key rate I get when going from bsgs to unrevealed public key ripemd160 search. But my scaling probably isn't right because the 1 TB ram changes things. But still way more likely than 135. But the question is will the kangaroo for 135 be better than 71 wallet search for you. Probably not, as its clearly designed to be harder.

edit: ok so the calculations the kangaroo gives me are correct, I checked with gemini and others. it takes 4 x 10 ^ 20 to solve 135 bits, which with my rate of around 100Mkeys gives exactly a hundred thousand years give or take. Which is 10 billion times faster than what BSGS gives me with its 300 petakeys/sec. So you clearly can't compare the Mkeys the kangaroo gives to the crazy numbers bsgs gives, the kangaroo ones are not actually keys 'tried' per second just operations.

[oddstake]

Everything is a waste of time when scanning for higher puzzles, unless you have hundreds/thousands of RTX5090.
For me BSGS random is the best approach.

[ldabasim]

I thought so too, but running the numbers the kangaroo is billions of times faster, bsgs is just better for small ranges/tests. Divide the number of keys in 135 by the number of keys/sec your bsgs makes and compare that to 2 ^ 68.5 divided by the keys/second(which are actually operations/sec) the kangaroo shows and observe needing a billion times less time to solve with kangaroo than bsgs.

[dextronomous]

 ./kangaroo_wild extend 037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc 79 80
[PARAMS] V2 loaded: local=12 jump=9 hist=4 esc=128 mult=2000 min_dp=1 trunc=11
[PARAMS] GLOBAL_BITS=16 RANGE=74-75 DIST_BYTES=8 TRUNC_BITS=11
[PARAMS] scored_target_dp=268435456 seed=42 local_buf1=64
[PARAMS] q_hat=0.428733 R_factor=1.1 N_sel=536870912
[JUMP_TABLE] target_dp=268435456 gap=3.52e+13 opt=137438953472 (2^37.0)
====================================================
[DB] 4194304.00 KB | 536870912 entries (disk: 8 B/entry, dist:8, trunc:11)
[FP] Fingerprints: 2097152.00 KB (536870912 entries)
[BO] Bucket offsets: 16384.00 KB (HASH_INDEX_BITS=22, u32)
====================================================
--- KANGAROO WILD ---
[CONFIG] Range: 2^74 - 2^75 | GLOBAL_BITS: 16 | DIST_BYTES: 8 | TRUNC_BITS: 11
[CONFIG] Workers: 60 | Batch: 20 | C: 1200 | VITA: 4194304

[EXTEND] Range 2^79 - 2^80 | DB 2^74 - 2^75 | 32 partitions

[KEY 1/1] Searching (extend 2^79-2^80, 32 parts): 037e1238f7b1ce757df94faa9a2eb261bf0aeb9f84dbf81212104e78931c2a19dc
[EXTEND 1/1] 140.2M steps | 46.5M/s | 3s elapsed
[EXTEND 1/1] 313.2M steps | 52.0M/s | 6s elapsed
[EXTEND 1/1] 523.3M steps | 58.0M/s | 9s elapsed
[EXTEND 1/1] 789.1M steps | 65.6M/s | 12s elapsed
[EXTEND 1/1] 1143.2M steps | 76.1M/s | 15s elapsed
[EXTEND 1/1] 1609.9M steps | 89.3M/s | 18s elapsed
[EXTEND 1/1] 2126.0M steps | 101.1M/s | 21s elapsed
[EXTEND 1/1] 2667.9M steps | 111.0M/s | 24s elapsed

[!!!] KEY FOUND (f2 m1/1 delta=710 partition=26): 0x61a5c66dcc11b5ad180
[SOLVED 1/1] Key: 0xea1a5c66dcc11b5ad180 (part 26) | Steps: 2862.9M | Time: 25.133s

============================================================
           STEP ACCOUNTING REPORT
============================================================
 Total steps:               2862.87M
------------------------------------------------------------
 BREAKDOWN:
   life_limit rsp:                0
   buf1 (cycle) rsp:              2
   escape rsp:                    0
   escape jumps:            6866748
   avg life at rsp:         1780856
------------------------------------------------------------
 DP STATS:
   DP global hits:            43611
   DP filtered (k):               0
   DP saved:                      0
 WILD STATS:
   DP checked vs DB:          43611
   DB matches:                    1
============================================================

[!!!] PRIVATE KEY: 0xea1a5c66dcc11b5ad180 wow did not expected this one,

[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

[analyticnomad]

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.

[Ali_555]

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

[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

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.

[Ali_555]

PubAddress: 1PWo3JeB92hdhCDhzGUTKWzXXAk4yyf8LZ  40454500BEFCD1F484
PubAddress: 1PWo3JeB94PagTvzGs4QnCSpMkjtCgTpac  780BA26B4335DB5D4E
PubAddress: 1PWo3JeB9Aau8Keh7vYmSWqrYjcPGDEgBv  4C7E2531A81D6E1D20
PubAddress: 1PWo3JeB9BzDrnNycFZKb4TtALHYLbuC8J  53A9EB79D9B84A4381
PubAddress: 1PWo3JeB9GpR4E3d675QpWFFFGKGmrQX7w  54E62D323423B35FC8
PubAddress: 1PWo3JeB9HWaqqbdrRT8HfZrdqZCxWqA8E  7846F8D0D67F03AE20
PubAddress: 1PWo3JeB9NdN9vp2kEnPgjMggPzofCpmLF  5CBF887DDB7C1C4C1D
PubAddress: 1PWo3JeB9RF6GjfsP1TDgLhMFHpHSZykzr  541B71F145F7BA6B4C
PubAddress: 1PWo3JeB9SB6r5eWzwmyrxLE9pSvTiAJkE  5468A1A79105286BC9
PubAddress: 1PWo3JeB9UEjZsHsV2yA5kY6ona17cviwD  700338D531BCF97F4F
PubAddress: 1PWo3JeB9jBM397if58QoC8GTPeSyzoGfZ  6F553FE8667335C7D4
PubAddress: 1PWo3JeB9jJhsyYCWPyMU1GY96tSgDnoGj  7EE8DC02CA96F1D21F
PubAddress: 1PWo3JeB9nZCsdCnJ7wmsFsBCF2iw28drm  72A04C8EE0FD0012DA


found using VBCr

[average_student]

Maybe it helps anyone this information with this inverted bits:

Useless information. The bit pattern has been overanalysed and confirmed to be random (by the creator all the same, by the way).

Ti will take 62,400 years for one RTX5090 to scan the full range.

[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 3523  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

[brainless]

.....
PubAddress: 1PWo3JeB9nZCsdCnJ7wmsFsBCF2iw28drm  72A04C8EE0FD0012DA


found using VBCr

What is VBCr?

Van bitcrack

[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

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 3523  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

[bibilgin]

Anyone found on 4B, 57 and 63 some B9j? i have searched for days and nothing...

Code:

1PWo3JeB9jdv1SaFoJK7SynTq94JFdbagU	63F651BB9C47645CD6
1PWo3JeB9jyQfLNG5YJLApRa21966Ai1jg	63C86054AE0E6952A9
1PWo3JeB9jaDuTKrGpCdsBzM3nrZD1VsuJ	635C2E7ECB042E57B1
1PWo3JeB9j8GCA9vqa8T7UjmKR8bf4mo45	635C1EDB84CD8EF2C2
1PWo3JeB9jgfrS4sWgwMyzJx6ycLbkfBod	635B3398FA7AA2DC10
1PWo3JeB9jdwAbXLkRkQwVZFW182JavydT	635B26C2E234F165E2
1PWo3JeB9jTi5oxgEpcqQ6umFSW4pK5eeg	635AB012204FE6F7FF
1PWo3JeB9jGBCr4oX1qThyLtfEnvczio2d	635aa850f7c900c556
1PWo3JeB9jJKn4WFrJ1KA98P2JsXVN6XtA	635AA799E02FD40650
1PWo3JeB9jy6P6zdWTxvbNQm39w3NidztQ	635AA0C7F832AD087C
1PWo3JeB9j2yjV8kfHfJwnkDYsLe9u1xtX	635A9BE637FA8F75A5
1PWo3JeB9jAuQeGd5aVg6Hi546LMAgZ9pm	635A9442B6373AE8F6
1PWo3JeB9jRH5fgYsGMbzhU9GTffHRyVCw	635A869AB53A05A6C8
1PWo3JeB9jzEmHNAdSVeBVVsq5nN7vz2u3	6358F64E541170783E
1PWo3JeB9jEv5krobH2NC3Hr72KiAQjAsY	57B115142966266753
1PWo3JeB9jFxbSjkRAZBiyXtsx35zKJQJu	5797831CE1F679DCC1
1PWo3JeB9jJgCornu9pADfCmQNfq3iJ6MV	578BB0E8E7BB755576
1PWo3JeB9jTdR8NHXBSdi5L4CkjN4VCBst	4BD37781D6EF972C19
1PWo3JeB9j1cUxmPFzpQn3EekgZpmvGRoP	4BCC74D564712C9766
1PWo3JeB9jS9zZLgbr7pRpfgWeYVKRhthr	4B8C00B994BEF2E5F7
1PWo3JeB9j4d2YEbSrqbxPTZX2VoauRDAQ	4B25F244EB89419044
1PWo3JeB9jC7rJ7shUGoAhB5gyzy5xXidk	4B1256BDFAB70D408B

I hope this helps.

[Psy_Duck]

Anyone found on 4B, 57 and 63 some B9j? i have searched for days and nothing...

B9j i think i seen one just upto 1PWo3Je & istas

[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.

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?

[0xastraeus]

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?

[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.

[0xastraeus]

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.