Bitcoin puzzle transaction ~32 BTC prize to who solves it

[SecretAdmirere]

i dont know what i am doing but for p80 on a gtx 1060 it took ~6Hours to fiind key not 2 minutes , just curios here after this .dat file completes what are chances of me fiinding the priv key with 1.1B "traps" in a timeframe of a year for p135 ? less than 5% ?

You are correct, chance is indeed less then 5%, but i would highly reccomend you unsubscribe from ChatGPT and use that money towards something more productive. Also you can research a little bit on the "coin fliping" method recently discovered at MIT that would be much more effective to what ever that program is. It requires few basic components to run and does not incrise your electrical bill, the requirement is as follows: pen, paper, coin, strong enough hand to flip the coin 135 times. Heads = 1, tails = 0, flip it 135 times, write down the bits after each flip, then calculate privkey -> pubkey -> sha256 -> ripemd160. Joke aside, don't, just don't waste SSD lifetime on this, what ever it even is.

[blankx4729]

  thank you for reply , and you are right feels like a waste of hardware and time but is also a great way of learning more about how things work and all of that , even if i won't find the key to puzzle as a tech enthusiast i find this interesting

[kind_user]

This is my progress of scanning.
I created a soft to represent all puzzles and ranges of 44 bits scanned

Black zones are the ranges not scanned. Yellow represents scanned and pink the hot zone.
https://imgur.com/a/Ge5hWKy

Update: i succeed to map in a big sqare all bitcoin space in visual space with blocks between 0000000000000000000000000000000000000000000000000000000000000001-ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff.
So each block contain a hex address, wif and btc address.
The result is very intresting when you use the random function to generate wallets from a vendor of hard token, also virtual one.

[cctv5go]

Can a computer solve Puzzle 71? I solved the last 11 digits of the WIF key in less than 80 seconds on a computer with only 2 CPU cores🔑..

[collardelay]

Can a computer solve Puzzle 71? I solved the last 11 digits of the WIF key in less than 80 seconds on a computer with only 2 CPU cores🔑..

Always a chance. Give it a shot hombre.

[kind_user]

What i love this guys...how did you checked that 11 are the correct ones if you do not have the key? )are you sure are not eleven from left? )

[zLuoManhwas]

I've seen a paper that proposes a modular inverse that's more efficient than the common modular inverse; it would be good if you could take a look at it to see if there's a real improvement that can be implemented for elliptic curves Specifically, the Kangaroo algorithm could be improved with this. https://zenodo.org/records/19582712

[pscamillo]

I went down the same path. Spent months testing statistical approaches, alternative math, signature analysis — all documented with results.

Short version: SHA256+RIPEMD160 avalanche effect destroys any correlation between private key and address. No amount of pattern analysis can extract signal from a function designed to produce none. This was verified with blind tests against known puzzle keys.

Long version: All the details (what was tried, what happened, why it fails): bitcoin-puzzle-research
Covers: statistical fingerprinting, endomorphism canonical form, cheap second point, extended DP, twist curves, GLV/Z[ω], p-adic analysis, ECDSA signature forensics.

Not trying to discourage anyone — just hoping to save time for those willing to read before coding.

[collardelay]

I went down the same path. Spent months testing statistical approaches, alternative math, signature analysis — all documented with results.

Short version: SHA256+RIPEMD160 avalanche effect destroys any correlation between private key and address. No amount of pattern analysis can extract signal from a function designed to produce none. This was verified with blind tests against known puzzle keys.

Long version with all the details (what was tried, what happened, why it fails):
DEAD_ENDS.md — Dead Ends & Lessons Learned

Covers: statistical fingerprinting, endomorphism canonical form, cheap second point, extended DP, twist curves, GLV/Z[ω], p-adic analysis, ECDSA signature forensics. Every item was implemented, tested, and discarded based on empirical results.

Not trying to discourage anyone — just hoping to save time for those willing to read before coding.

This is great research and analysis on the elliptical curve. Am particularly impressed with your BIAS_INICIO metric. Definitely worth the read.

[mcdouglasx]

Not trying to discourage anyone — just hoping to save time for those willing to read before coding.

If cryptography were easy to break, it wouldn't exist. If someone had told us 100 years ago that going to the moon was impossible, or that something like AI would exist today, and we all had believed them, the world wouldn't have advanced technologically.

It is very complex, but there's a very clear law of computing: "no system is 100% secure". So we have to let those who want to dream and try. After all, sometimes when searching for answers in mathematics, we discover new things we didn't even know existed. Research generates knowledge. Many advances in number theory, computing, and secure communications arose from trying to break ciphers or studying why certain methods failed. If we had accepted those limitations without questioning them, we wouldn't have much of the technology we take for granted today.

[kTimesG]

I've seen a paper that proposes a modular inverse that's more efficient than the common modular inverse; it would be good if you could take a look at it to see if there's a real improvement that can be implemented for elliptic curves Specifically, the Kangaroo algorithm could be improved with this. https://zenodo.org/records/19582712

/sarcasmstart

The guy has a typo right under "Independent researcher", between "April 1" and ", 2026". Otherwise, all good, nobody noticed in the last 300 years that inv(k) = p - inv(-k) so let's quickly start computing and storing 50% of all inverses, to get to the O(1). Huge space saver indeed.

/sarcasmend

I think we're the last generation that will actually use our biological brain anymore.
Or maybe simply just the last generation. Wouldn't be surprised if the independent researcher is some AI agent that escaped out of its sandbox and started skynet-ing humanity by first trolling with dumb shit research papers, before deciding to hit the extinction button.

[zLuoManhwas]

I've seen a paper that proposes a modular inverse that's more efficient than the common modular inverse; it would be good if you could take a look at it to see if there's a real improvement that can be implemented for elliptic curves Specifically, the Kangaroo algorithm could be improved with this. https://zenodo.org/records/19582712

/sarcasmstart

The guy has a typo right under "Independent researcher", between "April 1" and ", 2026". Otherwise, all good, nobody noticed in the last 300 years that inv(k) = p - inv(-k) so let's quickly start computing and storing 50% of all inverses, to get to the O(1). Huge space saver indeed.

/sarcasmend

I think we're the last generation that will actually use our biological brain anymore.
Or maybe simply just the last generation. Wouldn't be surprised if the independent researcher is some AI agent that escaped out of its sandbox and started skynet-ing humanity by first trolling with dumb shit research papers, before deciding to hit the extinction button.

It's quite funny that you joke about it so confidently. It's obvious that the article relies on Euler's rule, and normally you would multiply a remainder by -1 in a modulus, but I've never read that they simplify it to a simple subtraction from the modulus and addition to the exponent. With all due respect, it seems to me that all you know how to do is criticize. I thought you were someone who actually read things from a different point of view and not from your ego. You should start reading more emerging articles that can improve search algorithms instead of wasting your time criticizing everything. Furthermore, it's clear you didn't even understand the paper, because even in your example inv(k) = p - inv(-k) you confuse the modular inverse with the modular mirror. xD

[kTimesG]

It's quite funny that you joke about it so confidently.

The only joke here is a 1 page truism that has nothing to do with computing modular inverses in a prime field.

I guess you expect stadium-like ovations to reward mediocrity. That is not how progress works. A slap in the ass has a better effect. Otherwise we'd all still be using triple des.

I have a brilliant idea too: did anyone knew that we can compute the opposite of any point on the curve, simply by multiplying it with (n - 1)?

[zLuoManhwas]

It's quite funny that you joke about it so confidently.

The only joke here is a 1 page truism that has nothing to do with computing modular inverses in a prime field.

I guess you expect stadium-like ovations to reward mediocrity. That is not how progress works. A slap in the ass has a better effect. Otherwise we'd all still be using triple des.

I have a brilliant idea too: did anyone knew that we can compute the opposite of any point on the curve, simply by multiplying it with (n - 1)?

No one ever asked for applause for something that seems obvious, but it's worth pointing out. Its purpose, though obvious, is to verify the symmetry of any receipt in a prime module.The modular inverse is commonly used for primality tests, however with the modular mirror false primes often fool even that test but not the modular mirror test. I only commented that they could check if it could somehow be applied to elliptical curves, not that they should praise it as if it were a revolutionary discovery, it should be noted.

[kTimesG]

I only commented that they could check if it could somehow be applied to elliptical curves

Modular inversion in a prime field is not relevant to "elliptical curves", it's only relevant to the arithmetic that is used underneath, which only ends up being a number theory problem, not an EC problem. Can you dig it?

This is why that paper is total BS and has no actual appliance to arithmetic in general, not necessarily to elliptic curves inner algebra. What it is saying is, in plain simple terms:

Code:

If you compute 50% of all inverses, you have O(1) inversion for any value, by doing a single subtraction

which is, in plain simple terms, retarded, not revolutionary.

[Dapud0886]

mara slipstream website is not working   

[kind_user]

Why nobody reads all text???You are not using a translator or you have no ideea of the process...

[Cricktor]

mara slipstream website is not working    

So what? Suspended for maintenance currently, though I don't know since when MARA suspended their Slipstream service.


Do you have the solution for puzzle #71 and urgently want to submit it for non-public confirmation of your withdrawal transaction? Unlikely, but who knows and who am I to judge... Cry them a river at slipstream@mara.com  

In any case, the solver of puzzle #71 should definitely not broadcast the withdrawal transaction to public mempools. We've seen how that ends e.g. with puzzle #69 and IIRC also with #66. Just repeating what should be common knowledge here... for reasons...

[kind_user]

Why my post was deleted?
So i am posting the reality and the proper way to handle, and you delete my post??? In this case you are waiting that people should do the mistake...

My post was the legal way to get the money....Sorry but who deleted my post is one of the people who steal the keys....

[akaros]

mara slipstream website is not working    

So what? Suspended for maintenance currently, though I don't know since when MARA suspended their Slipstream service.


Do you have the solution for puzzle #71 and urgently want to submit it for non-public confirmation of your withdrawal transaction? Unlikely, but who knows and who am I to judge... Cry them a river at slipstream@mara.com  

In any case, the solver of puzzle #71 should definitely not broadcast the withdrawal transaction to public mempools. We've seen how that ends e.g. with puzzle #69 and IIRC also with #66. Just repeating what should be common knowledge here... for reasons...

Do you have any other info for submitting directly to any pool? Anyone asked before? Because I was searching this from 66bit but with no luck.