Bitcoin puzzle transaction ~32 BTC prize to who solves it

[cicada 3301]

secp256k1 can't be hacked

Don't be so sure.
There are many tricks involving this curve. At some point, a combination of them - or perhaps a new property - will bring an end to it. This is both obvious and predictable.

I’ve been reading this forum for a long time. Why are there so few mathematical ideas on the forum? After all, everything is built on the formulas for adding points on a curve. For example, for the curve y^2=x^3, the point number is easy to find.

Also, there is a formula that shows where a point is located on the curve y^2=x^3+7: it is (y/x)^2-x = A.

There is also a formula that introduces a correction for point doubling: you double the point and get an answer with a correction; this answer will already correspond to a point on the curve y^2=x^3, and you can find the point’s number. But this works only for doubling. There is no such formula yet for the point addition formula.

Please share your ideas with formulas. It is in mathematics that the curve has the greatest vulnerability.

I forgot about this formula altogether. Drop the wallet number later, 1BTC I will send.


And the new problem is that 99% of people who are involved with Bitcoin say, “Oh my God, Bitcoin isn’t secure!” I’m going to specifically work on improving secp256k1 — something stricter and more secure against quantum computers. Fortunately, I have experience in this area.

And the new problem is that 99% of people who are involved with Bitcoin say, “Oh my God, Bitcoin isn’t secure!” I’m going to specifically work on improving secp256k1 — something stricter and more secure against quantum computers. Fortunately, I have experience in this area.

Correction: if I change the cryptography, then I must take all the prizes from the Bitkonen Puzzle.

[bankeroft]

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck. 

good job dude , did you scan it sequent or random??

[cctv5go]

What tools are you using to scan puzzle 71? I'm curious. I used the "AI" tool to generate a displacement-like scanning tool. The speed was not ideal, so I had to find a way to improve it.

[demonarcher360]

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck.  

good job dude , did you scan it sequent or random??

Thank you. At the moment, my pool is set to "scattered" mode, though I have several operating modes available—none of which will ever repeat a key that has already been scanned. The options include random, sequential, scattered, and block-based (either random or sequential) modes. You simply need to choose the mode you prefer and run the scan.

What tools are you using to scan puzzle 71? I'm curious. I used the "AI" tool to generate a displacement-like scanning tool. The speed was not ideal, so I had to find a way to improve it.

Sorry, I?

Mathematics is not my strong suit, and there are many intelligent people here; however, brute force and luck are all I have left.

[mjojo]

Billion dollar in BTC in nakamoto address just secure with number 7, if change 7 with 0 or P value the curve is reversible. I think we need to shifting the 7 and balancing the modulo result for strightening the curve

[Efim_Wr]

secp256k1 can't be hacked

Don't be so sure.
There are many tricks involving this curve. At some point, a combination of them - or perhaps a new property - will bring an end to it. This is both obvious and predictable.

I’ve been reading this forum for a long time. Why are there so few mathematical ideas on the forum? After all, everything is built on the formulas for adding points on a curve. For example, for the curve y^2=x^3, the point number is easy to find.

Also, there is a formula that shows where a point is located on the curve y^2=x^3+7: it is (y/x)^2-x = A.

There is also a formula that introduces a correction for point doubling: you double the point and get an answer with a correction; this answer will already correspond to a point on the curve y^2=x^3, and you can find the point’s number. But this works only for doubling. There is no such formula yet for the point addition formula.

Please share your ideas with formulas. It is in mathematics that the curve has the greatest vulnerability.

y^2=x^3 it is (y/x)^2-x = A
y^2=x^3+7 it is (y/x)^2-x-(7/x^2) = A.
A = 0!
It seems you forgot to mention that you reduced a certain value for the first curve.

[demonarcher360]

500 nice! Would it be possible to join you?

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck. 

Right now it’s local and solo, but send me a private message and we can talk.

[josscrypto]

This puzzle is insane. 32 BTC still untouched after years. I looked at the transactions - the creator keeps adding more puzzles but the big one remains. I think it's not about brute force, it's about pattern in the hex. Some people already cracked the smaller ones (like puzzle 66, 70 etc) but 130+ is still impossible with current tech.
Anyone here actually tried to brute force range or just watching? The prize is like $3M+ now, crazy someone left it there.

[And24r]

secp256k1 can't be hacked

Don't be so sure.
There are many tricks involving this curve. At some point, a combination of them - or perhaps a new property - will bring an end to it. This is both obvious and predictable.

I’ve been reading this forum for a long time. Why are there so few mathematical ideas on the forum? After all, everything is built on the formulas for adding points on a curve. For example, for the curve y^2=x^3, the point number is easy to find.

Also, there is a formula that shows where a point is located on the curve y^2=x^3+7: it is (y/x)^2-x = A.

There is also a formula that introduces a correction for point doubling: you double the point and get an answer with a correction; this answer will already correspond to a point on the curve y^2=x^3, and you can find the point’s number. But this works only for doubling. There is no such formula yet for the point addition formula.

Please share your ideas with formulas. It is in mathematics that the curve has the greatest vulnerability.

y^2=x^3 it is (y/x)^2-x = A
y^2=x^3+7 it is (y/x)^2-x-(7/x^2) = A.
A = 0!
It seems you forgot to mention that you reduced a certain value for the first curve.

For the curve y^2=x^3, it should be 0 because there is no +7 shift. This formula shows how much the point is shifted relative to the curve y^2=x^3.

[bankeroft]

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck.  

good job dude , did you scan it sequent or random??

Thank you. At the moment, my pool is set to "scattered" mode, though I have several operating modes available—none of which will ever repeat a key that has already been scanned. The options include random, sequential, scattered, and block-based (either random or sequential) modes. You simply need to choose the mode you prefer and run the scan.

What tools are you using to scan puzzle 71? I'm curious. I used the "AI" tool to generate a displacement-like scanning tool. The speed was not ideal, so I had to find a way to improve it.

Sorry, I?

Mathematics is not my strong suit, and there are many intelligent people here; however, brute force and luck are all I have left.

i invent a revolutionary scanner but it needs a powerful gpu , i have a weak one "mx330" so the speed only reach 45 mk/sec !! i can give you my app & you can try it in your powerful gpu . i guarantee it'll find the key in less than 2 month ,

[demonarcher360]

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck.  

good job dude , did you scan it sequent or random??

Thank you. At the moment, my pool is set to "scattered" mode, though I have several operating modes available—none of which will ever repeat a key that has already been scanned. The options include random, sequential, scattered, and block-based (either random or sequential) modes. You simply need to choose the mode you prefer and run the scan.

What tools are you using to scan puzzle 71? I'm curious. I used the "AI" tool to generate a displacement-like scanning tool. The speed was not ideal, so I had to find a way to improve it.

Sorry, I?

Mathematics is not my strong suit, and there are many intelligent people here; however, brute force and luck are all I have left.

i invent a revolutionary scanner but it needs a powerful gpu , i have a weak one "mx330" so the speed only reach 45 mk/sec !! i can give you my app & you can try it in your powerful gpu . i guarantee it'll find the key in less than 2 month ,

Hello,  thanks, and I’ve reached out via private message

"User 'bankeroft' has not chosen to allow messages from newbies. You should post in their relevant thread to remind them to enable this setting."

You need to enable the option in your settings to receive messages from newcomers... private messages from newcomers.

I wait you

[vh07200]

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck.  

good job dude , did you scan it sequent or random??

Thank you. At the moment, my pool is set to "scattered" mode, though I have several operating modes available—none of which will ever repeat a key that has already been scanned. The options include random, sequential, scattered, and block-based (either random or sequential) modes. You simply need to choose the mode you prefer and run the scan.

What tools are you using to scan puzzle 71? I'm curious. I used the "AI" tool to generate a displacement-like scanning tool. The speed was not ideal, so I had to find a way to improve it.

Sorry, I?

Mathematics is not my strong suit, and there are many intelligent people here; however, brute force and luck are all I have left.

i invent a revolutionary scanner but it needs a powerful gpu , i have a weak one "mx330" so the speed only reach 45 mk/sec !! i can give you my app & you can try it in your powerful gpu . i guarantee it'll find the key in less than 2 month ,

hi can i try you apps also

[vh07200]

500 nice! Would it be possible to join you?

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck. 

Right now it’s local and solo, but send me a private message and we can talk.

hi can i join the pool ?

[crytoestudo]

I even tried, but since I'm new here I'm not allowed to send messages.

500 nice! Would it be possible to join you?

At the moment, my local private pool has already scanned 500 quadrillion keys, and I’m not even close to finding the key for Puzzle 71. I’m picking up another GPU—just for fun, really—because actually finding it would require a tremendous, truly immense amount of luck. 

Right now it’s local and solo, but send me a private message and we can talk.

[Efim_Wr]

Browser-only secp256k1 scalar calculator & point visualizer — single HTML file,
no dependencies. Scalar arithmetic mod n, powers/roots, CSPRNG random k,
point ops (P±G, 2P, P/2, k·P, m·P, P±k·G), point log with Bitcoin addresses
(P2PKH, P2SH-P2WPKH, P2WPKH, P2TR) and WIF private keys.
Source: https://github.com/Fantom-C/secp256k1-Scalar-Plotter
If you have any suggestions, please let me know what could be added or removed.

[And24r]

Browser-only secp256k1 scalar calculator & point visualizer — single HTML file,
no dependencies. Scalar arithmetic mod n, powers/roots, CSPRNG random k,
point ops (P±G, 2P, P/2, k·P, m·P, P±k·G), point log with Bitcoin addresses
(P2PKH, P2SH-P2WPKH, P2WPKH, P2TR) and WIF private keys.
Source: https://github.com/Fantom-C/secp256k1-Scalar-Plotter
If you have any suggestions, please let me know what could be added or removed.

For some reason, instead of studying how the basic formula for adding points on the curve works, everyone starts immediately calculating these points in modular arithmetic.