Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Bram24732]

Does anyone know if the most recent puzzle solver for puzzle 67 used mara successfully to get the funds?   Or is there just no way to be sure about it again if the solver isnt posting here?   I havent had time to read all recent posts, just thought I would ask.  Never expected puzzle 67 to be solved so quick since 66 took an insane amount of time.

I did solve it, and I did use slipstream without problems

[Nodemath]

Any other offers
It' s definitely worth it
Trust 💯

[bitcoinpuzzles621]

oh ok, thanks for verifying.  i just had more time to read through some of the other pages of the forum so its good to see a solver that actually posts here often for a change.  dont think that has happened for many months or longer.   my method of trying to solve is nothing like anything that is written here but it also scans much more slowly so i have less hope i will solve the other puzzles now since you all have found much faster methods it seems like.  still going to try 68 next though and see how more attempts go with that.

its great to know the slipstream will work now and that the funds wont get stolen by those terrible bots if i somehow manage to pull off a miracle and solve the next one before anyone else here manages to do it first,  lmao

[Tepan]

Hello everyone,

I need to show you something I was working on for a few months and because I am actually addicted of this, you have to see it.

So basically the case is I want to verify If I am that "smart" or it is just pure coincidence.

I have just now registered first ever account.

I am working with a very interesting python script that basically get's the private key directly from the hash160 of basically any address up to puzzle 130...sounds crazy isn't it?

So basically what I need to decode private key of the hash160 of an p2pkh bitcoin address? hah a private key

Seriously..

1.Chose whatever range, like I said, for the moment I have tested until puzzle 130, generate Yourself a hex private key in between chosen range and get the compressed address.
2 Convert the hash160 of that address to decimal string.
3.Convert the hexadecimal private key to decimal as well,
4 Now using a big integer calculator for example http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm ( I am also using it ) divide the decimal string of hash160 by decimal version of private key
5.The resulting string now You have to multiply times decimal private key.
6 That multiplication will result with a long string of course but quite similar with the first digits like so basically that string will be required by me.

That is pretty obvious that having only hash160 string we cannot see the private key directly can we?
 
So what I need actually to decode private key then?

I need a hex range boundary of Your address choice and the the resulting decimal string from step 6. or as You want convert it to an address back using brainwallet converter, so range boundary and an compressed address

Time to get the private key? Instant, 0.1 sec.

The most important: I don't need a private key , I will get one to verify what I say and second read carefully so You have zero questions about the steps.

Don't forget to pick up the range and address with that private key You don't use personally, that is just a test. Wanna see the results reply with what I ask for.


When I have the private key I will reply with signed message so You can verify Yourself.

I guarantee you will be intrigued.

this guy nailed it

[dastic]

Hello everyone,

I need to show you something I was working on for a few months and because I am actually addicted of this, you have to see it.

So basically the case is I want to verify If I am that "smart" or it is just pure coincidence.

I have just now registered first ever account.

I am working with a very interesting python script that basically get's the private key directly from the hash160 of basically any address up to puzzle 130...sounds crazy isn't it?

So basically what I need to decode private key of the hash160 of an p2pkh bitcoin address? hah a private key

Seriously..

1.Chose whatever range, like I said, for the moment I have tested until puzzle 130, generate Yourself a hex private key in between chosen range and get the compressed address.
2 Convert the hash160 of that address to decimal string.
3.Convert the hexadecimal private key to decimal as well,
4 Now using a big integer calculator for example http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm ( I am also using it ) divide the decimal string of hash160 by decimal version of private key
5.The resulting string now You have to multiply times decimal private key.
6 That multiplication will result with a long string of course but quite similar with the first digits like so basically that string will be required by me.

That is pretty obvious that having only hash160 string we cannot see the private key directly can we?
 
So what I need actually to decode private key then?

I need a hex range boundary of Your address choice and the the resulting decimal string from step 6. or as You want convert it to an address back using brainwallet converter, so range boundary and an compressed address

Time to get the private key? Instant, 0.1 sec.

The most important: I don't need a private key , I will get one to verify what I say and second read carefully so You have zero questions about the steps.

Don't forget to pick up the range and address with that private key You don't use personally, that is just a test. Wanna see the results reply with what I ask for.


When I have the private key I will reply with signed message so You can verify Yourself.

I guarantee you will be intrigued.

this guy nailed it

But that has nothing to do with puzzles. He needed a privkey (recalculated divided whatever) to get the private key. What is the point. 

[Tepan]

ye i know, no step 5-6, cannot do anything.

[whistle307194]

 He needed a privkey (recalculated divided whatever) to get the private key. What is the point.  

Like I said, I have need a string resultfrom step 6 and Your target bitcoin address only, Sir.

[dastic]

 He needed a privkey (recalculated divided whatever) to get the private key. What is the point.  

Like I said, I have need a string result from step 6 and Your target bitcoin address only, Sir.

But but i need to know the privkey to get results from step 6 - so for puzzles it is useless.

[whistle307194]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

[dastic]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

3.Convert the hexadecimal private key to decimal as well,
4 Now using a big integer calculator for example http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm ( I am also using it ) divide the decimal string of hash160 by decimal version of private key

So then how would you get that without the privkey from step 3 ? ...

[WanderingPhilospher]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

So I sat here the last 10 minutes to create my own script to do what you are doing.

I was successful.

Knowing the range speeds up the script, in that you can eliminate certain numbers, but the range is not needed.

[whistle307194]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

So I sat here the last 10 minutes to create my own script to do what you are doing.

I was successful.

Knowing the range speeds up the script, in that you can eliminate certain numbers, but the range is not needed.

Does that mean I was first ?

Then go for it Sir:
650101855847373604127500588369088602937332557710
1BP7ByGjkekGpUPweRGjBVWWa6hagnnrnm < p2pkh compressed target.

public key 038bf7dd0ee6e93ea35324dcea444a3e1b2e404e458c2a1777bdd1feca199c91f3
range 9000000000000000000000000000:ffffffffffffffffffffffffffff

[WanderingPhilospher]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

So I sat here the last 10 minutes to create my own script to do what you are doing.

I was successful.

Knowing the range speeds up the script, in that you can eliminate certain numbers, but the range is not needed.

Does that mean I was first ?

Then go for it Sir:
650101855847373604127500588369088602937332557710
1BP7ByGjkekGpUPweRGjBVWWa6hagnnrnm < p2pkh compressed target.

public key 038bf7dd0ee6e93ea35324dcea444a3e1b2e404e458c2a1777bdd1feca199c91f3
range 9000000000000000000000000000:ffffffffffffffffffffffffffff

You can be first lol, I mean, as far as I know you are. But being first at something like this, I dunno. I mean it's cool and all, just doesn't help us out with these challenges or any real life scenario.

Range was not needed.

0xe51e464444fc4495991b7852b855

[whistle307194]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

So I sat here the last 10 minutes to create my own script to do what you are doing.

I was successful.

Knowing the range speeds up the script, in that you can eliminate certain numbers, but the range is not needed.

Does that mean I was first ?

Then go for it Sir:
650101855847373604127500588369088602937332557710
1BP7ByGjkekGpUPweRGjBVWWa6hagnnrnm < p2pkh compressed target.

public key 038bf7dd0ee6e93ea35324dcea444a3e1b2e404e458c2a1777bdd1feca199c91f3
range 9000000000000000000000000000:ffffffffffffffffffffffffffff

You can be first lol, I mean, as far as I know you are. But being first at something like this, I dunno. I mean it's cool and all, just doesn't help us out with these challenges or any real life scenario.

Range was not needed.

0xe51e464444fc4495991b7852b855

Yes, I do confirm it's valid and I haven't told You pvk of it

Well I only wanted to present a bit of what I actually can, soon it will be more mark my words.

[WanderingPhilospher]

You actually don't need to know any pvk Yourself but just for introduce You a specific method that You can understand or try at least, for a test purpose I needed to write everything like "we need" initial pvk to demonstrate but the cracking reality is simple : string from step6 + target address, no more details and I'll demonstrate how fast I am.

So I sat here the last 10 minutes to create my own script to do what you are doing.

I was successful.

Knowing the range speeds up the script, in that you can eliminate certain numbers, but the range is not needed.

Does that mean I was first ?

Then go for it Sir:
650101855847373604127500588369088602937332557710
1BP7ByGjkekGpUPweRGjBVWWa6hagnnrnm < p2pkh compressed target.

public key 038bf7dd0ee6e93ea35324dcea444a3e1b2e404e458c2a1777bdd1feca199c91f3
range 9000000000000000000000000000:ffffffffffffffffffffffffffff

You can be first lol, I mean, as far as I know you are. But being first at something like this, I dunno. I mean it's cool and all, just doesn't help us out with these challenges or any real life scenario.

Range was not needed.

0xe51e464444fc4495991b7852b855

Yes, I do confirm it's valid and I haven't told You pvk of it

Well I only wanted to present a bit of what I actually can, soon it will be more mark my words.

I look forward to it, as I do most new scripts/ways to do things from people on this forum. Quite honestly, never a dull moment

[Akito S. M. Hosana]

Lottery Mathematics
Probability of Randomly Guessing One Key in Puzzle 68 :
1 in nine quintillion two hundred sixty quadrillion.

[btc11235]

I'm still learning Keyhunt and I have another question...

https://github.com/albertobsd/keyhunt?tab=readme-ov-file#xpoint-mode

In that documentation for "xpoint mode" he says that you can add/subtract values from the public key of a puzzle to fill the search file with the public key itself plus a bunch more that are (what I'm going to call) small jumps away from the actual public key, in order to (if I'm understanding this all correctly) increase the changes of hitting a match...

The problem is that I can't figure out how to correctly do the addition/subtraction... Anyone know exactly how to do this?

His example is for puzzle #40... and I can take the (now known) private key, get the X/Y point from it, and make the correct public key from that... I then tried subtracting the number 453856235784 from the X value, the X & Y, and from the public key itself, but none of those attempts yielded the same result that he shows ("034eee474fe724cb631d19f24934e88016e4ef2aee80d086621d87d7f6066ff860")

Also, I assume the numbers chosen to add/subtract aren't important or special, correct? Like, they don't have to be multiples of 256 or anything, right...?

Any help would be much appreciated, thx

[madogss]

I'm still learning Keyhunt and I have another question...

https://github.com/albertobsd/keyhunt?tab=readme-ov-file#xpoint-mode

In that documentation for "xpoint mode" he says that you can add/subtract values from the public key of a puzzle to fill the search file with the public key itself plus a bunch more that are (what I'm going to call) small jumps away from the actual public key, in order to (if I'm understanding this all correctly) increase the changes of hitting a match...

The problem is that I can't figure out how to correctly do the addition/subtraction... Anyone know exactly how to do this?

His example is for puzzle #40... and I can take the (now known) private key, get the X/Y point from it, and make the correct public key from that... I then tried subtracting the number 453856235784 from the X value, the X & Y, and from the public key itself, but none of those attempts yielded the same result that he shows ("034eee474fe724cb631d19f24934e88016e4ef2aee80d086621d87d7f6066ff860")

Also, I assume the numbers chosen to add/subtract aren't important or special, correct? Like, they don't have to be multiples of 256 or anything, right...?

Any help would be much appreciated, thx

Here's https://bitcointalk.org/index.php?topic=5347863.0 and https://bitcointalk.org/index.php?topic=5218972.680
there are also more topics on this that you can find if you search for them.

Also in this topic you can a python script by Etar for public key division.

[btc11235]

...follow-up from my last post:

These are two of his test values (the last two in the list):

Code:

038d3711fd681e26c05b2f0cd423fa596e15054024e40add24a93bfa0c630531f1 # + 549755814000
03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4 # target

The one labeled "target" does appear to be, in fact, the compressed public key for puzzle #40... However, the one just above that is labeled "+ 549755814000", but when I convert it to a BigInt it's *lower* than the actual public key as BigInt (despite the fact that he supposedly got it by *adding* 549755814000 to the public key)...

So, either this test/example data is all wrong, or I've **completely** misunderstood it... Because when *I* add 549755814000 to the public key (and then convert it back to hex) I get:

Code:

03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0edbee53de0d4 # target
03a2efa402fd5268400c77c20e574ba86409ededee7c4020e4b9f0ee3ee53de144 # + 549755814000

...and those are almost exactly the same except for the last 12 chars, which is exactly what I would expect to get.

So, what am I missing? Or am I doing it correctly, and it's the example data that's wrong...?

Please someone help me here, this is driving me crazy  

Edit: This was posted while I was writing the above:

Here's https://bitcointalk.org/index.php?topic=5347863.0 and https://bitcointalk.org/index.php?topic=5218972.680
there are also more topics on this that you can find if you search for them.

Also in this topic you can a python script by Etar for public key division.

Thanks for this, I took a quick look and I think my brain's just too fried for the day for me to understand what they're saying, expecially since they don't appear to be about keyhunt's "xpoint mode" specifically... I'll take a closer look later, or tomorrow, but in the meantime if someone can just answer the above questions directly I would greatly appreciate it...

Edit 2: Okay, I looked through those threads, and I think I get it now... The documentation for Keyhunt's "xpoint mode" made it seem like you simply add/subtract numbers directly from the public key, but of course if this is all points on a curve then it can't actually be that simple, right...? I also found a link to the https://github.com/albertobsd/keysubtracter tool (which I had no idea existed until just now) by the same guy who built Keyhunt and for exactly this reason/purpose...

Anyway, thx, I think I get it now... I just wish I could get my own code anywhere near the speeds y'all do... IDK if it's just because I'm using C# or what, but doing ECC specifically is just *so slow*... Everything else I've got written is crazy fast, but calculating these points on the curve just destroys me o_O

[mjojo]

Hello everyone,

I need to show you something I was working on for a few months and because I am actually addicted of this, you have to see it.

So basically the case is I want to verify If I am that "smart" or it is just pure coincidence.

I have just now registered first ever account.

I am working with a very interesting python script that basically get's the private key directly from the hash160 of basically any address up to puzzle 130...sounds crazy isn't it?

So basically what I need to decode private key of the hash160 of an p2pkh bitcoin address? hah a private key

Seriously..

1.Chose whatever range, like I said, for the moment I have tested until puzzle 130, generate Yourself a hex private key in between chosen range and get the compressed address.
2 Convert the hash160 of that address to decimal string.
3.Convert the hexadecimal private key to decimal as well,
4 Now using a big integer calculator for example http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm ( I am also using it ) divide the decimal string of hash160 by decimal version of private key
5.The resulting string now You have to multiply times decimal private key.
6 That multiplication will result with a long string of course but quite similar with the first digits like so basically that string will be required by me.

That is pretty obvious that having only hash160 string we cannot see the private key directly can we?
 
So what I need actually to decode private key then?

I need a hex range boundary of Your address choice and the the resulting decimal string from step 6. or as You want convert it to an address back using brainwallet converter, so range boundary and an compressed address

Time to get the private key? Instant, 0.1 sec.

The most important: I don't need a private key , I will get one to verify what I say and second read carefully so You have zero questions about the steps.

Don't forget to pick up the range and address with that private key You don't use personally, that is just a test. Wanna see the results reply with what I ask for.


When I have the private key I will reply with signed message so You can verify Yourself.

I guarantee you will be intrigued.


///////////////////// 01-03-2025 / 4:25PM update /////////////////////

At this moment I am going tell You something like this..
Because I don't want bother people trying prove something that is looking a little too crazy I want to increase difficulty to crack the pvk of Your choice to make this looking even more unimaginable.

In a first post I was asking You to do the 1-6 steps and provide me a range boundary and the initial address You have got from the pvk of Your choice of that range boundary...

Now I am asking You to provide only initial address and the decimal string from step 6 (or second address while converted to B58Check using brainwallet converted) BUT no range borders!.

Use of course a range boundary not from puzzles asking me for a private key but similar range up to puzzle 130!

So now the difficulty is that I will provide pvk using these two initials without knowing range boundary at all! Try me!

Hi friend, would you share your script?