Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it

Version 1

Last scraped

Scraped on 22/04/2025, 08:47:32 UTC

Quote from: POD5 on April 22, 2025, 08:06:07 AM

Quote from: nomachine on April 22, 2025, 07:54:31 AM

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.

Original archived Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it

Scraped on 22/04/2025, 08:17:16 UTC

Quote from: POD5 on April 22, 2025, 08:06:07 AM

Quote from: nomachine on April 22, 2025, 07:54:31 AM

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