Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Akito S. M. Hosana]

Need multiple pubkeys load by file and  search...

Why I never add a list of targets in any of my apps ?

I have a list of about 1000 public keys. All are above 2BTC

[nomachine]

Need multiple pubkeys load by file and  search...

Why I never add a list of targets in any of my apps ?

I have a list of about 1000 public keys. All are above 2BTC

What range are they in, exactly? It's useless. Even if you know precisely how many bits each target is, if it's above 90 bits, it's useless.

[fixedpaul]

How to edit VanitySearch by JLP to search in puzzle 71 space (not from 1)?

Anybody gone into c/c++ in this project?

Try JLP VanitySearch forked by @allinbit and @Ilker, starting from ranges what you want.
https://github.com/ilkerccom/VanitySearch

It hangs when given keyspace option.

There was need to modify the code. Works fine now.

If you want in my GitHub you can find VanitySearch-bitcrack repo, 50% faster than these

[Bram24732]

Need multiple pubkeys load by file and  search...

Why I never add a list of targets in any of my apps ?

When you’re searching for 1 target public key, your app only does 1 comparison per candidate key.

But if you’re searching for 10 target keys, now it’s gotta do 10 comparisons per candidate key.

This is called linear time complexity (O(n)), where:

n = number of target keys

Runtime scales directly with the number of keys

Here’s how different methods stack up:

Brute-Force (O(n)) = ~10x slower

Hash Prefix (O(1)) = ~3.5x slower

Bloom Filter (O(1)) = ~2.5x slower

Multi-Key AVX2 = ~5x slower

Even with AVX2, you still gotta loop through all targets:

cpp

Code:

for (int i = 0; i < 100; i++) {  
    __m256i target = load_key(targets[i]);  
    __m256i cmp = _mm256_cmpeq_epi8(candidate, target);  
    if (_mm256_movemask_epi8(cmp) == 0xFFFFFFFF) {  
        // Match found for targets[i]  
    }  
}  

100x more comparisons = 100x slower in the worst case.

Yeah, the CPU tries to predict the loop, but with 100 targets, it messes up more often, pipeline stalls happen.

What’s your Bloomfilter implementation like ? 2.5x seems like a lot ?

[nomachine]

What’s your Bloomfilter implementation like ? 2.5x seems like a lot ?

My version, which is based on the Keyhunt version, didn’t work with more than 20 targets. What did work was either too slow or buggy, so I gave up on using the Bloomfilter altogether in brute-force puzzle apps.

[Akito S. M. Hosana]

so I gave up...

This is the first time someone has admitted they don’t know something while working on coding in this topic. Usually, everyone acts like they know everything. 

[nomachine]

Usually, everyone acts like they know everything. 

You've started trolling again, haven’t you?

[analyticnomad]

Need multiple pubkeys load by file and  search...

Why I never add a list of targets in any of my apps ?

I have a list of about 1000 public keys. All are above 2BTC

Are you trying to brute other peoples keys?

[Benjade]

so I gave up...

This is the first time someone has admitted they don’t know something while working on coding in this topic. Usually, everyone acts like they know everything. 

The pot calling the kettle black ?  

[pbies]

How to edit VanitySearch by JLP to search in puzzle 71 space (not from 1)?

Anybody gone into c/c++ in this project?

Try JLP VanitySearch forked by @allinbit and @Ilker, starting from ranges what you want.
https://github.com/ilkerccom/VanitySearch

I tested it with puzzle 57, give wrong private key generated:

Code:

VanitySearch v1.16 Linux with BitCrack integration
[keyspace] start=                                                 1EB25C907000000
[keyspace]   end=                                                 1EB25C90795DFFF
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz [Compressed]
Current task START time: Mon May 12 16:13:57 2025
Number of CPU thread: 0
GPU: GPU #0 NVIDIA GeForce RTX 2050 (16x128 cores) Grid(2048x256)
 
Warning, wrong private key generated !
  Addr :15c9mPGLku1HuW9LRtBf4jcHVpBUunRoQS
  Check:1MH9K9aeZNBvLoyRzk2pwfMwygM5hMjwgZ
  Endo:0 incr:540 comp:1
[EXIT] Range research completed (2^36.55) [00:01:06 RUN || END ...finishing][0]  
Current task END time: Mon May 12 16:15:05 2025

I had no problem with other puzzle - it was found properly,
however the output file is not written, if pvk from console will disappear then it will be not written to the file.

[Bram24732]

What’s your Bloomfilter implementation like ? 2.5x seems like a lot ?

My version, which is based on the Keyhunt version, didn’t work with more than 20 targets. What did work was either too slow or buggy, so I gave up on using the Bloomfilter altogether in brute-force puzzle apps.

I’ll add one to your repo when I have a bit of time

[benjaniah]

Need multiple pubkeys load by file and  search...

Why I never add a list of targets in any of my apps ?

I have a list of about 1000 public keys. All are above 2BTC

You should add Satoshi's 34k public keys to your list, each one with 50BTC. Maybe someone can calculate how many RTX-5090's you'd need to crack just one of those wallets in 24 hours? 

https://bitcoin.oni.su/satoshi_public_keys/34K_2009_50.html

[nomachine]

What program was used and how, when people talked about petahash and nomachine did run around eksahash?

Keyhunt in bsgs mode using 64GB bP Table  

P.S. something like this:

Code:

./keyhunt -m bsgs -f tests/135.txt -b 135 -R -n 0x100000000000 -k 4096 -e -q -t 48 -s 10 -S

[fecell]

You should add Satoshi's 34k public keys to your list, each one with 50BTC. Maybe someone can calculate how many RTX-5090's you'd need to crack just one of those wallets in 24 hours? 

how pub keys was gotten, if no one out TX was?!

[user_not_here]

What program was used and how, when people talked about petahash and nomachine did run around eksahash?

Keyhunt in bsgs mode using 64GB bP Table  

P.S. something like this:

Code:

./keyhunt -m bsgs -f tests/135.txt -b 135 -R -n 0x100000000000 -k 4096 -e -q -t 48 -s 10 -S

Thanks, now i remember.

Tested PointSearch, fast..
Miss some range suffle.

[POD5]

Trying Point_Search_RC

So, for puzzle 135 it would be;   

Code:

134
135
25
02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16

and it goes forwards and backwards?

[Psychedelic Susa]

You should add Satoshi's 34k public keys to your list, each one with 50BTC. Maybe someone can calculate how many RTX-5090's you'd need to crack just one of those wallets in 24 hours? 

how pub keys was gotten, if no one out TX was?!

Pay To Public Key

"outputs": [
    {
      "address": "1Lo1VC2YNkqELDNGHpsKDD8KEzbNKBjzpF",
      "pkscript": "41040000356cb2e0d0c0a0167693b14c338f548da20fea024a04449907140fa270ebff37ae70d00 db8137b5c60d9563b743b090f162f7bf1b51650d20cd7022d695dac",
      "value": 5000000000,
      "spent": false,
      "spender": null
    }
  ],

pkscript = public key

[Nodemath]

Can anyone provide me GPU private key to Hash 160 with c++  call work with Python
600Mkeys/sec
Not like vanity or bit crack
I will release whole new way

Help me out it will decrease whole thing

[Nodemath]

Python code

Under private to hash 160 GPU Using with C++
#Include

Close with python

[AlexanderCurl]

Trying Point_Search_RC

So, for puzzle 135 it would be;    

Code:

134
135
25
02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16

and it goes forwards and backwards?

Just a concept code. Not worth trying for puzzle #135. CPU version can be improved in many ways(partitioning the space according to number of CPU cores set to use). Best choice GPU code with search space partitioning to an array of GPUs. And moreover if you have some interesing ideas or questions you can always contact me on telegram that is in github profile but not spam here with useless stuff. We are here to share useful info and not talk shit.