Bitcoin puzzle transaction ~32 BTC prize to who solves it

[papiro08]

I imagine that with 2000 GPUs you will have tons of much longer prefixes.

[WanderingPhilospher]

This thread is increasingly resembling a helpdesk for beginners. I can understand that there's a lot to learn, and we learn something new every day, but a little personal research would help.

I see people here and there looking for miracle prefixes, constantly changing programs, or creating 36 different ones to find a key quickly, but there are no miracles at this stage.

No algorithm, no method currently available, allows you to find a private key quickly. The best strategy if you're short on resources is to let a good program run and hope you're lucky enough to find the key, because the key is patience.

Use BSGS cuda, Kangaroo by RetiredCoder for public keys, and Cyclone or KeyQuest by Benjade if you only have CPUs that perform very well; these are currently the best. Forget vanity search, mutagen, and other pseudo-scripts; you'll be wasting your time, and time is money.

CZ said, "If you can't hold, you'll never be rich." I think this applies not only to the stock market, but to patience in general.

Oh no, what do us poor old souls use that have GPUs, for keys with no known public key??!! No fork of VanitySearch? I am short on resources but since you only stated 4 programs that were good, and none to work with GPU and brute force, I am lost. I need to find a good program for GPU and let it run and run and run until Sally and Dick are both tired. Please advise. Thank you!!!

[cctv5go]

I tested this—amazing! It solved 12 characters in 8 minutes. Is there a C++ version of this? I can only imagine what a script that's 200x faster could do.    

I have a script in C++, but it's not 200x faster—it doesn't use AVX2 hashing or the JLP SECP256K1.
It uses OpenSSL.

But what are you going to do with it?

To generate the number of possible combinations between "ecrA1gh" and "kW1gt2H" (7 missing characters for puzzle 69) using the Base58 character set, there are approximately 1.54 trillion combinations.

• WIFRotator
• Starting WIF: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q
• Middle range: ecrA1gh to kW1gt2H
• Missing chars: 12
• Target: 61eb8a50c86b0584bb727dd65bed8d2400d6d5aa
• Cores: 12
• Initial middle: f9FtYtY
• New middle section activated: ipNX8dr
• Speed: 16,2 MKeys/sec | Total: 6,404 MKeys
• New middle section activated: hGnuha8
• Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
• New middle section activated: gxN4jE6
• Speed: 15,7 MKeys/sec | Total: 6,204 MKeys
• New middle section activated: fT9yPyt
• Speed: 15,9 MKeys/sec | Total: 6,404 MKeys
• New middle section activated: hM42ZDc
• Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
• New middle section activated: h5KwaZ5
• Speed: 16,2 MKeys/sec | Total: 6,300 MKeys
• New middle section activated: jSaH3oc
• Speed: 16,2 MKeys/sec | Total: 6,301 MKeys
• New middle section activated: iHgzCdB

This means your script will rotate through ~1.54 trillion different middle sections (each taking about 1–8 minutes), while brute-forcing the last 12 characters for each one.  

Can you share this program? To try your luck, at least closer than the end of the universe.What is the random probability that these seven characters in the middle are different?

[WanderingPhilospher]

Somebody let me know if I find the full address before Bram

t.me/puzzleprefixes

Those are coming in real-time. But I may be asleep when the real deal Holyfield address is found...so, wake me, if need be, LOL!

Increased the minimum match to 44 bits as 40 bits was creating too many results being sent to channel.

Wake me up LOL!

Changed it again to a minimum of 48 bits...still too many at 44 bits.

Let me know if anyone wants to donate to the Beat Bram fund

[brainless]

@nomachine
Have you tried to make cyclone version with load of list hash160 instead of 1 h160
And speed effects ?
If still not worked...
Could you try to develop this version for load of hash160 list

[kTimesG]

Let's go back to the beginning;
I told you in the first messages, you look down on people. You are being disrespectful. If you have knowledge, share it or have a logical conversation.

Logical conversation:

You: "No one said they broke 3 math structures. Oh, btw, look, I can find John without knocking 10k doors..."
Me: "You are contradicting yourself."
You: "Drug head lol"

Unless someone is on weed, IDK how can they ever engage intn such a high-level argumentative logic.

I wonder why none of the prefix believers fails to answer this simple question:

Assuming the prefix theory works, it automatically implies a weakness in the cryptographic guarantees of Bitcoin, and more generally automatically implies that the elliptic curve cryptographic assumptions are broken, and also the cryptographic security of SHA256 and/or RIPEMD-160 are also broken.

Yielding BTC as a 0$ asset. Hence, why would you try to solve the puzzle?

If so, why the hell aren't you guys publish a paper and wait for the academic gratitude? It would worth infinitely more than some stupid satoshis... RIGHT ?!?

Maybe because you know deep inside that you're simply just chasing ghosts of the statistical fluctuations of something that is not distinguishable from randomness? Or are you afraid that you'll need to call all the academic peers who'd dismiss your paper in 5 seconds, as people who obviously "don't understand probabilities" and have zero clues about math?

Up.

[Dragon914421]

I am silently watching and learning from all you guys that have been in this space for quite some long time and doing the puzzle, but again and again people say you need to find more than one or that. What exactly does that mean? Is it if someone has multiple addresses with private key in 69bit range that starts with 19vkiEajf, does it help to achieve goal faster

[JimsR]

I tested this—amazing! It solved 12 characters in 8 minutes. Is there a C++ version of this? I can only imagine what a script that's 200x faster could do.    

I have a script in C++, but it's not 200x faster—it doesn't use AVX2 hashing or the JLP SECP256K1.
It uses OpenSSL.

But what are you going to do with it?

To generate the number of possible combinations between "ecrA1gh" and "kW1gt2H" (7 missing characters for puzzle 69) using the Base58 character set, there are approximately 1.54 trillion combinations.

• WIFRotator
• Starting WIF: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q
• Middle range: ecrA1gh to kW1gt2H
• Missing chars: 12
• Target: 61eb8a50c86b0584bb727dd65bed8d2400d6d5aa
• Cores: 12
• Initial middle: f9FtYtY
• New middle section activated: ipNX8dr
• Speed: 16,2 MKeys/sec | Total: 6,404 MKeys
• New middle section activated: hGnuha8
• Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
• New middle section activated: gxN4jE6
• Speed: 15,7 MKeys/sec | Total: 6,204 MKeys
• New middle section activated: fT9yPyt
• Speed: 15,9 MKeys/sec | Total: 6,404 MKeys
• New middle section activated: hM42ZDc
• Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
• New middle section activated: h5KwaZ5
• Speed: 16,2 MKeys/sec | Total: 6,300 MKeys
• New middle section activated: jSaH3oc
• Speed: 16,2 MKeys/sec | Total: 6,301 MKeys
• New middle section activated: iHgzCdB

This means your script will rotate through ~1.54 trillion different middle sections (each taking about 1–8 minutes), while brute-forcing the last 12 characters for each one.  

Have you try With Non Standard Decoding Like a, heuristic Methode  - checksum-ignored Base58 decoding.
it can be faster.

https://drive.google.com/file/d/1ehe1cnNDna8_Sc8VtbTPyF1QhYRKQt9j/view?usp=drive_link
https://drive.google.com/file/d/1UQEGXmGQL509Zu0g1XpLf1raC5pzeuqX/view?usp=drive_link

Wif Ranges 69 is

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q e crA1gh************
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q k W1gt2H************


KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q e+(6 middle wif) + 12 Char

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q f+(6 middle wif) + 12 Char

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q g+(6 middle wif) + 12 Char

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q h+(6 middle wif) + 12 Char

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q i+(6 middle wif) + 12 Char

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q j+(6 middle wif) + 12 Char

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q k+(6 middle wif) + 12 Char


and the most important we need GPU Version, i am not familiar with Cuda and C++ Programming  

[AlanJohnson]

I am silently watching and learning from all you guys that have been in this space for quite some long time and doing the puzzle, but again and again people say you need to find more than one or that. What exactly does that mean? Is it if someone has multiple addresses with private key in 69bit range that starts with 19vkiEajf, does it help to achieve goal faster

No it doesn't  but some people don't like the truth cause it's too brutal for them.

[Bram24732]

Got bored this morning so I wrote a little snippet which looks for a value in a uniform space.
It does it using both methods :

• Sequential random (i.e. the one I use)
• Prefix based, I believe this is the WP version, but the code can easily be adjusted to your flavor of prefix optimization.

By defaults it runs 1000 simulations of a search in a 100M elements space with a range of 100k.
This is exactly equivalent to the 69 problem in terms of statistics. Just simpler because it uses integers instead of hashes, so we can run many more simulations for cheap.

How to run :

Code:

Have nodeJs installed on your machine.
Download script
Run "node prefixVsSequential.js"

Results, as you can see there is very little deviation. The more simulations/bigger ranges you run, the closer both values will be to 50% :

Code:

Average match percentage for random sequential method : 49.63%
Average match percentage for prefix sequential method : 52.35%

Link to script :

Code:

https://gist.github.com/Kowala24731/e9a52fcf08b14934a5e8e96ae967c729

You can change those parameters to update number of simulations / size of problem / ranges / percentage of deviation before skipping a range

Code:

const PREFIX_DEVIATION = 1.35;
const TOTAL_SIZE = 100_000_000;
const RANGE_SIZE = 100_000;
const NUMBER_SIMULATIONS = 1000;

[bibilgin]

Up.

I am calling out to everyone from here. This is an example.

The first prefix you find is similar to "19vkiEajfh" wallets,

78000000000009990000 - 7890000000000990000 between decimal difference, it does not matter whether it is above or below.

You will find at least 1 more wallet starting with the prefix 19vkiEajfh.

Note:
1- 7800000000000999000 - 78900000000000990000 is not a decimal that remains constant.

2- After the similar prefix wallet found in the range of 78000000000009990000 - 78900000000000990000, there are several different decimal differences for the other first 10 prefix similar wallets.

Important; After finding a 10 similar prefix wallet, I analyze 30+ decimal differences and find the other 10 prefix similar wallets. Then I calculate the common decimal values ​​of the wallet I found and the previous wallets I found.

Question to you,
Can you tell me the method to find John without knocking on 10 thousand doors?
My method is to ask the region of the other after finding any John.

I repeat it again and again. This is not a Sha256, h160, base58 or anything else. It is the calculation of the next hash range of each created hash. (Decimal range values ​​more than 30+ are important.)

[Bram24732]

Question to you,
Can you tell me the method to find John without knocking on 10 thousand doors?
My method is to ask the region of the other after finding any John.

Does the fact that a John lives somewhere have any impact on where the actual John lives ?

[POD5]

Have you try With Non Standard Decoding Like a, heuristic Methode  - checksum-ignored Base58 decoding.
it can be faster.

Do you have GITHUB? 

[bibilgin]

Does the fact that a John lives somewhere have any impact on where the actual John lives ?

Does John live somewhere? Yes.

Does this living situation indicate where he actually is? Yes.

So the fact that he lives somewhere indicates that he is already there; so the living situation does not change his actual location, it merely expresses it.

[Bram24732]

Does the fact that a John lives somewhere have any impact on where the actual John lives ?

Does John live somewhere? Yes.

Does this living situation indicate where he actually is? Yes.

So the fact that he lives somewhere indicates that he is already there; so the living situation does not change his actual location, it merely expresses it.

I don't understand what you're saying I'm sorry.

[bibilgin]

I don't understand what you're saying I'm sorry.

The question you asked has 2 perspectives.

Reality = Where John lives is the situation as it really is. In other words, if John really lives in Türkiye, this situation reflects a reality in the outside world and this reality exists independently.

Knowledge = Saying "where John lives" is valid if the reality is where he lives. But it does not change where John really lives right now.

I don't know which answer will make you happy.

Here, we don't need to confuse many people in a philosophical, ontological, epistemological cycle. It is enough to tell the answer to the question I asked and which method you will use.

There was an article that I mentioned before and you also mentioned.

I = Every brave man eats yogurt differently.
You = We all have different learning/understanding abilities.

[kTimesG]

Up.

I am calling out to everyone from here. This is an example.

Can you tell me the method to find John without knocking on 10 thousand doors?
My method is to ask the region of the other after finding any John.

I repeat it again and again. This is not a Sha256, h160, base58 or anything else. It is the calculation of the next hash range of each created hash. (Decimal range values ​​more than 30+ are important.)

- Telepathy - call up John via brain waves / tachyons to share location.

- Remote viewing: don't knock, see through. Requires specific genetic skills (CIA leaked it?)

- Quantum entanglement: spin up the quarks and get the door number; need John's quantum signature / state at some point in time and space in advance.

- Multiverse interpretation or multiworld: collapse the correct door by observing all doors at once. Requires Infinity rings.

- Proximity bias [© mcdouglasx] - piss on the very basic definitions and properties of ECC arithmetic / hash functions. Avalanche effect? Nope. Independent doors? Nope. After all, we've all been living next door to Alice for 20 years, right? Immutable before you even open the doors. Call people AI / NPCs / FUD? YES!

[AlanJohnson]

It seems like some people here wants to solve it so badly they become mental and starting  to see things and connections that aren't really there...

[benjaniah]

I found this exact prefix '19vkiEajfhu' within the 69-bit range, but from what I've read from more knowledgeable people on the forum, it may not have much significance idk. I'm just a hobbyist

You need to prove the 19vkiEajfhu prefix you found.

Otherwise, you won't be listened to much.


Edit;

After scanning 9000 trillion keys for the actual address (the good hash) of Puzzle 69, there was still no 53 bits or larger prefix found.

61eb8a50c86b0584bb727dd65bed8d2400d6d5aa

H160 - Is the first 61eb8a50c86b0 the one you mentioned as 53 bits?

If that's what you mean, I have it.

Freebie for all you prefix hunters.
While you guys were scanning hundreds of trillions of keys for a 53 bit prefix match, I found one using grep on the Loyce Club All BTC addresses list.
Used by someone on Nov 20, 2024, a few days after 66 was solved. The pubkey is there so the private key can be found in a few seconds.
https://mempool.space/address/19vkiEajfhnHnZjGpogP6Rv8sUQFvF7PiS
Newbie Disclaimer: This information is for entertainment purposes only, and cannot and will not aid you in your search for the prize, no matter how strongly you believe so.

[kTimesG]

The pubkey is there so the private key can be found in a few seconds.

How?