Bitcoin puzzle transaction ~32 BTC prize to who solves it

[kTimesG]

Your argument is, if the tests don't prove you right, then to hell with mathematics!

Nah, you converted me, I said I agree with ya. What more do you want?

Everyone: please use the prefix method. I endorse it. Just make sure you manage the hundreds of billions of queued sub-sub-ranges without a hiss. Oh, and it's 2 times faster now, forget pubKey seeking being 50x slower.

Nice pic of the X winning position BTW.

[farou9]

046aa3ec6fbe6188788ee0a5a18f95e405741f1b636559b355a857817a2e921160c85ca3b348638 d82ec4c3a986b2c58062b10a499afd5516581591127559925df  can someone check if this pubk has a 68bit scalar                   

I repeat can anyone help with this

[farou9]

046aa3ec6fbe6188788ee0a5a18f95e405741f1b636559b355a857817a2e921160c85ca3b348638 d82ec4c3a986b2c58062b10a499afd5516581591127559925df  can someone check if this pubk has a 68bit scalar                   

I repeat can anyone help with this

You cannot know if the private key is a 68-bit integer just from the public key unless it is known or brute-forced..

i suspect it t be

[kTimesG]

046aa3ec6fbe6188788ee0a5a18f95e405741f1b636559b355a857817a2e921160c85ca3b348638 d82ec4c3a986b2c58062b10a499afd5516581591127559925df  can someone check if this pubk has a 68bit scalar                   

I repeat can anyone help with this

It doesn't (99.999999999999999999999% certain though, unless you BSGS it to have an 100% sure yes/no answer). It might also not even be in the 75+ bits.

Unless you know something more about the scalar's known bits (maybe they are not 0), maybe the hidden 68 bits are not the trailing bits, etc.

[farou9]

046aa3ec6fbe6188788ee0a5a18f95e405741f1b636559b355a857817a2e921160c85ca3b348638 d82ec4c3a986b2c58062b10a499afd5516581591127559925df  can someone check if this pubk has a 68bit scalar                   

I repeat can anyone help with this

It doesn't (99.999999999999999999999% certain though, unless you BSGS it to have an 100% sure yes/no answer). It might also not even be in the 75+ bits.

Unless you know something more about the scalar's known bits (maybe they are not 0), maybe the hidden 68 bits are not the trailing bits, etc.

a previous guy said 65, i don't know what he maens .
anyway I just suspect it to be between 65b.....69b.  , if i had a better cpu i could have checked my self but i dont , but any of you with rtx4090 won't cost you 1m to check

[GoldTiger69]

046aa3ec6fbe6188788ee0a5a18f95e405741f1b636559b355a857817a2e921160c85ca3b348638 d82ec4c3a986b2c58062b10a499afd5516581591127559925df  can someone check if this pubk has a 68bit scalar                   

I repeat can anyone help with this

Code:

time ./keyhunt -m bsgs -t 4 -f tests/farou9_pubkey.txt -r 80000000000000000:100000000000000000 -n 0x1000000000000000 -M -s 0 -S -k 4
[+] Version 0.2.230430 Satoshi Quest, developed by AlbertoBSD

End

real	56m58.405s
user	217m20.758s
sys	0m15.504s

It seems like it's not in this range:  80000000000000000:100000000000000000
Cheers!

[GoldTiger69]

It's not in this range either: 10000000000000000:80000000000000000

Code:

time ./keyhunt -m bsgs -t 6 -f tests/farou9_pubkey.txt -r 10000000000000000:80000000000000000 -n 0x1000000000000000 -M -s 0 -S -k 4
[+] Version 0.2.230430 Satoshi Quest, developed by AlbertoBSD

End

real	35m15.934s
user	192m37.033s
sys	0m13.839s

[nomachine]

where to put this on wifhunter?

This is not the WIF Hunter script—it is named WIF Roulette.   

there is on github?

Here you go

https://github.com/NoMachine1/WIF-Roulette

 

[Akito S. M. Hosana]

Here you go
https://github.com/NoMachine1/WIF-Roulette

❓ Can I get rich with this?

Short answer: No.

Long answer: Hahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahah ahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahahaha

I've rarely read a crazier manual than this one.   

[fantom06]

Speed = 51.02 MWIFs/sec

[Akito S. M. Hosana]

Speed = 51.02 MWIFs/sec

Code:

[2025-04-22 08:23:50] [I] WIF Roulette
[2025-04-22 08:24:53] [W] KyhNzHj4CRTX5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob
[2025-04-22 08:24:53] [I] 1A1Phyzzm3KE1s3TWUYgNxZ1DPYk1pG1JA
[2025-04-22 08:24:53] [I] 1G3X9ebwpSnjDXrVuxrmgGpr47GySTZxLf
[2025-04-22 08:26:44] [W] KzyqiWpCuJJh5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob
[2025-04-22 08:26:45] [I] 1NNs1qHyQmAN4TzZVuf4vqPfehPWUd8zKZ
[2025-04-22 08:26:45] [I] 1CnbPKSfGkhr4J1KHXh6iuFapxKYCbq6Vi
[2025-04-22 08:30:50] [W] L1ShaXBmSr2M5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob
[2025-04-22 08:30:51] [I] 1BkCnpyBuc5XFT39AFFyHeXpLWVkoC2ky7
[2025-04-22 08:30:51] [I] 15uYV77sRqzPS5aQU2x7uvRqrz8mxmkKL7
[2025-04-22 08:31:04] [W] L1m7Qn7C4rJY5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob
[2025-04-22 08:31:04] [I] 1JgUBDAQeHwk9rVmqqWfmJjJiowwHxBx7C
[2025-04-22 08:31:05] [I] 1DXb5ny6oUV2iDsDG9stGDi9KjU59TzmyF
[2025-04-22 08:41:04] [W] L2YxpFMcM9rn5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob
[2025-04-22 08:41:04] [I] 19rNQy2c6869ahFruG6KRAym5t9BAy3qfS
[2025-04-22 08:41:05] [I] 1GsAR3iRup6sbHQNkeDBbnAnMUkuBqzkmr
[2025-04-22 08:48:59] [W] L3NDbwkove4y5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob
[2025-04-22 08:48:59] [I] 1CLU7YHv7AazqcnSQ9F8rUMGWcV2N7zZd3
[2025-04-22 08:49:00] [I] 1EBv8eTFDn3k5oR9qoEcQCzUcmQzwJ5fhJ
Spinning the wheel... ⠎⡱

Can we check if these addresses have BTC while we wait ?   

[nomachine]

Can we check if these addresses have BTC while we wait ?   

Sure. You already have the python code on GitHub that checks for that—just add it to this script. Although it's unlikely you'll find anything.. 

[Akito S. M. Hosana]

Can we check if these addresses have BTC while we wait ?   

Sure. You already have the python code on GitHub that checks for that—just add it to this script. Although it's unlikely you'll find anything.. 

Can you add this directly to GitHub? Then the script will truly be Casino.. 

[nomachine]

Can you add this directly to GitHub? Then the script will truly be Casino.. 

Done. . .

[POD5]

Done. . .

Thanks!  
Any instructions on how to use it specifically when searching for an address?

[nomachine]

Done. . .

Thanks!  
Any instructions on how to use it specifically when searching for an address?

There are no instructions—unless you have a real WIF that's missing the first 12 characters. It can be any WIF if you're just relying on luck

P.S. It may be possible to reduce the number of prefixes in the main script
From:

Code:

static const char VALID_PREFIXES[][3] = {
    "Kw", "Kx", "Ky", "Kz", "L1", "L2", "L3", "L4", "L5"
};

To:

Code:

static const char VALID_PREFIXES[][3] = {
    "Kz"
};

If you're sure it's right there, then work even faster.

[Akito S. M. Hosana]

a real WIF that's missing the first 12 characters.

What if I have a real WIF that's missing, say, the last 12 characters ? 

[novaflare12]

where to put this on wifhunter?

This is not the WIF Hunter script—it is named WIF Roulette.  

there is on github?

Here you go

https://github.com/NoMachine1/WIF-Roulette

 

I love your sense of humour brother Can I DM you?

[nomachine]

What if I have a real WIF that's missing, say, the last 12 characters ?  

change in WIFRoulette.cpp to be:

Code:

using namespace std;

#define ROOT_LENGTH 12

alignas(64) const char BASE58[] = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";

const char WIF_START[] = "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qd7sDG4F";

class Timer {

remove "static const char VALID_PREFIXES[][3]" , static constexpr size_t NUM_PREFIXES and  "void generate_valid_prefix" from script.

change "void init_batch(WIFBatch& batch, int batch_size)" to:

Code:

void init_batch(WIFBatch& batch, int batch_size) {
    thread_local Xoshiro256plus rng([]() {
        static atomic<uint64_t> global_seed(chrono::steady_clock::now().time_since_epoch().count());
        uint64_t seed_value = global_seed.load();
        global_seed.store(seed_value + 1); 
        return Xoshiro256plus(seed_value);
    }());
    char random_root[ROOT_LENGTH + 1]; 
    for (int b = 0; b < batch_size; ++b) {
        generate_random_root(random_root, ROOT_LENGTH, rng);
        memcpy(batch.wifs[b], WIF_START, strlen(WIF_START));
        memcpy(batch.wifs[b] + strlen(WIF_START), random_root, ROOT_LENGTH + 1);
        memset(batch.extended_WIFs[b], 0, 64);
        batch.extended_WIFs[b][0] = 0x80;
        batch.extended_WIFs[b][33] = 0x01;
    }
}

Change target adress in WIFRoulette.py to:
1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ

Code:

[2025-04-22 08:20:16] [I] WIF Roulette
[2025-04-22 08:25:34] [W] KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qd7sDG4F2sdMtzNe8y2U
[2025-04-22 08:25:35] [I] 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ | Balance: 0 BTC
[2025-04-22 08:25:35] [I] 1G1PszAzdLZWgGNG79pijNrt6BuK5HsVo8 | Balance: 0 BTC
[2025-04-22 08:25:36] [I] Partial match found (Compressed): 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
[2025-04-22 08:25:36] [I] PRIVATE KEY FOUND!!!
[2025-04-22 08:25:37] Compressed Bitcoin Address: 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
[2025-04-22 08:25:37] Uncompressed Bitcoin Address: 1G1PszAzdLZWgGNG79pijNrt6BuK5HsVo8
[2025-04-22 08:25:37] Private key (hex): 00000000000000000000000000000000000000000000000bebb3940cd0fc1491
[2025-04-22 08:25:38] Private key (decimal): 219898266213316039825
[2025-04-22 08:25:38] [I] Private key saved to found_key.txt
PRIVATE KEY FOUND!     
[2025-04-22 08:25:39] [I] Script execution ended

[farou9]

It's not in this range either: 10000000000000000:80000000000000000

Code:

time ./keyhunt -m bsgs -t 6 -f tests/farou9_pubkey.txt -r 10000000000000000:80000000000000000 -n 0x1000000000000000 -M -s 0 -S -k 4
[+] Version 0.2.230430 Satoshi Quest, developed by AlbertoBSD

End

real	35m15.934s
user	192m37.033s
sys	0m13.839s

thank you for your time


why doesn't libsecp256k1  support point addition