Bitcoin puzzle transaction ~32 BTC prize to who solves it

[fmg75]

If broadcasting a transaction from a solved Bitcoin puzzle gets hijacked instantly by bots, does that mean all transactions spending from solved puzzles were mined directly ? And if the publick keys to certain puzzle addresses are already exposed publicly, why haven’t the bots swept those funds yet, if they claim they can steal coins within seconds?

You have some conceptual errors about the problem:

With the public keys exposed, you can't move funds ---> You need to calculate the private key, currently puzzle 135 and multiples of 5 and up. ---> Use the polling kangaroo algorithm, etc.

Bots can attack the PVKs of smaller puzzles, currently 71 and up, since it computationally leaves a window.

In my humble opinion, small players currently have no chance.

A large player who finds puzzle 71 will look for a very secure way to propagate, obviously avoiding the mempool.

[chrisnick19]

You generally cannot directly broadcast a BTC transaction to miners without it entering the mempool, as the mempool is the standard, unavoidable gateway for transactions to be picked up and confirmed by the network. Bitcoin's design relies on the peer-to-peer network to relay transactions to nodes, which store them in their respective mempools before miners select them for inclusion in blocks. The only widely established method to bypass the mempool for most transactions is to use the Lightning Network, a second-layer protocol for fast, off-chain payments that only requires the main blockchain for opening and closing payment channels.

[fmg75]

You generally cannot directly broadcast a BTC transaction to miners without it entering the mempool, as the mempool is the standard, unavoidable gateway for transactions to be picked up and confirmed by the network. Bitcoin's design relies on the peer-to-peer network to relay transactions to nodes, which store them in their respective mempools before miners select them for inclusion in blocks. The only widely established method to bypass the mempool for most transactions is to use the Lightning Network, a second-layer protocol for fast, off-chain payments that only requires the main blockchain for opening and closing payment channels.

You're wrong.

This is exactly what anyone who finds a puzzle's private key should do. Avoid the public mempool and send the tx to a private node.
Otherwise, they risk a front-running attack.

[fecell]

That’s the true nature of brute force. 

u'r right. kango, bsgs, lcg, and all other just a force of brute, but with different chance.

[ffcd1144]

It seems that there are no longer many people paying attention to this thread.

[brainless]

It seems that there are no longer many people paying attention to this thread.

Everyone waiting messages like congratulations to winner

[Kelvin555]

Now i am searching with 10 rigs and each of them with Total 109099.04 MK/s. So 10xTotal 109099.04 MK/s and i just started in this morning. I found a lot of keys with B9 and only one B9j. I hope soon to discover the key.

Do you own the 10 rigs or you rent them ?

[skedarve]

https://i.gyazo.com/499a7e9e963def49276b3489ffa31ecd.png

I dont know if this algorithm helps Flood-Fill algorithm

[chrisnick19]

This is a address with respect 1PWo3JeBossCxQ1GKaXYPLgTNVdUJkMvfw

[fmg75]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

[TheMissingNTLDR]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Would it not be faster if you target Hash 160 of the Address instead of the BTC Address. i.e. cut down on calculating Address from PK which is not needed.

[TNavarro007]

Very interesting indeed. I wonder whether Garcia’s algorithm can quickly uncover it. The paper describes its application to Satoshi’s Block 170. Go to Substack → Posts and search for “CBGarcia.”

[kTimesG]

Very interesting indeed. I wonder whether Garcia’s algorithm can quickly uncover it. The paper describes its application to Satoshi’s Block 170. Go to Substack → Posts and search for “CBGarcia.”

I'm sorry but the author of that "paper" must have been on crack. My IQ dropped to -170 after reading through all of that BS. He should maybe stick to management science instead of trying to break crypto.

[SilentSyntax]

I want to clear up something important for everyone in this Puzzle journey.

The truth is: prefixes (whether in Base58 addresses or HASH160) have no relation to the actual private key. Through many experiments step by step till now, I can confirm that once we pass through the irreversible transformation of elliptic curve multiplication, any hope of tracing back from a prefix to the real private key is gone. 

Thinking that a certain prefix gives us a “hint” about the actual key is just wishful thinking.

The only practical use of prefixes is to measure and track our scanning progress. For example:

Base58 (addresses):

Each character = 1 in 58 chance. 
Probability of matching n chars = 1 / 58ⁿ. 

In 2³² ≈ 4.29B scans you expect: 

1 char ≈ 74M matches 
2 chars ≈ 1M matches 
3 chars ≈ 22K matches 
4 chars ≈ 376 matches 
5 chars ≈ 7 matches 
6 chars ≈ 1 matches 

HASH160 (hex):

Each hex digit = 1 in 16 chance. 
Probability of matching n digits = 1 / 16ⁿ. 

In 2³² ≈ 4.29B scans you expect: 

1 char ≈ 268M matches 
2 chars ≈ 17M matches 
3 chars ≈ 1M matches 
4 chars ≈ 67k matches 
5 chars ≈ 4k matches 
6 chars ≈ 268 matches 
7 chars ≈ 16 matches 
8 chars ≈ 1 matches 

(On my one RTX 3060 Ti, this 2³² scan finishes in ~2 seconds, and I typically get 1 or 2 addresses with an 8-chars initial HASH160 hex match - sometimes none at all.) 

This shows clearly: prefix matching is only a statistical milestone, or a POW, not a clue toward the target private key.

Regarding fixed bits - my own “fixed bits” formula based on prefix matching is still random - it doesn’t inject any new logic or shortcut.

So in the end, prefix-based searching is just for fun, to keep ourselves engaged while facing the massive challenge of scanning through a 2^71 keyspace.

This puzzle is all about grinding through the natural variance of randomness until we get lucky. That’s the true nature of brute force. 

Hey, could you please share your "prefix" app? Or any open source ones which as you said were better? I don't seem to find any.

[chrisnick19]

Why everybody want everything for free? From what i see there are smart guys and beggers...If someone is giving a good ideea, internet and chatGPT can help you build that ideea.
Everyone want to win with work from other people without doing anything...this is not ok...

[dextronomous]

i think no need for greed on you telling all wanted for free by a newb,
 i think we know the best free software shared enough times by many over here, @btct like nomachine and amongst others a lot of the guys/girls here,

really miss this man,

guess many asked none received their answer if you want to know, begging?
only that he took out his git pages cause he not nomachine offcourse , asked for money if you needed to decrypt the private key wich you might get with his closed source software,

so guess the seller is known not to sell, but did before give away free software,
so relax brother,

[brainless]

Asking a updates, upgrade, app, scripts, open source, compiled ver, changes, feedback, testing, etc is this begging
??

Oh one line missing
Who buy me a coffee
Is this begging too

[Benchood]

Asking a updates, upgrade, app, scripts, open source, compiled ver, changes, feedback, testing, etc is this begging
??

Oh one line missing
Who buy me a coffee
Is this begging too

Ask your boyfriend to buy you coffee. No one owes you anything.
Don't want to share your work with the community? Then don't share it.

[SilentSyntax]

Why everybody want everything for free? From what i see there are smart guys and beggers...If someone is giving a good ideea, internet and chatGPT can help you build that ideea.
Everyone want to win with work from other people without doing anything...this is not ok...

I have my own tools and theories, I'm new here and no one has asked for them so I don't share them. But if I see someone like Zahid saying that this app "has no relation to the actual private key." and "Heads up though: don’t buy tools from anyone (even if they pretend to be me) — everything’s already open-source and free." then I would think the guy doesn't want to sell the app and likes open source apps which are, free. No one is begging.

If he would like to share hes app or code, it would be a plus for this community trying to crack the puzzle, maybe someone can make something better out of it. If he doesn't want to? It's hes choice and not yours or anyone else's here.

Thank you for your time.

Why everybody want everything for free? From what i see there are smart guys and beggers...If someone is giving a good ideea, internet and chatGPT can help you build that ideea.
Everyone want to win with work from other people without doing anything...this is not ok...

I have my own tools and theories, I'm new here and no one has asked for them so I don't share them. But if I see someone like Zahid saying that this app "has no relation to the actual private key." and "Heads up though: don’t buy tools from anyone (even if they pretend to be me) — everything’s already open-source and free." then I would think the guy doesn't want to sell the app and likes open source apps which are, free. No one is begging.

If he would like to share hes app or code, it would be a plus for this community trying to crack the puzzle, maybe someone can make something better out of it. If he doesn't want to? It's hes choice and not yours or anyone else's here.

Thank you for your time.

If any single 1 of you here is thinking they can find a faster way to crack the puzzle alone then wake up from your dreams. Whoever is living in the real world, has a real job and actually has had these kind of problems where they would need to think a lot about something knows that sometime they have to see things in a different perspective, this is what communities are for, for 1 to help the other.

Right now? This is just luck. No one is using 1000 GPU's as it's unprofitable for them. So here we are now.

[FrozenThroneGuy]

An update to CUDACyclone that generates non-repeating, persistent random subranges.
Ideal for collaborative search.

./CUDACyclone \                                                                                                                                                 
              --range 400000000000000000:7fffffffffffffffff \
              --address 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU \
              --random-subranges --num-subranges 10000000 --grid 256,8

Hello man, update your software. Previous version of a Cyclone has a bug. I did a mistake with a first batch of the thread, not right computing center point of the first batch, and than the last batch finish not in the end of the range. Last half batch of points from the end of the each thread doesnt computing!