Bitcoin puzzle transaction ~32 BTC prize to who solves it

[kreosan]

..........

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 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.

Tested your theory... There's something to it, but very insignificantly. And with additional tests, it tends to ordinary entropy...

----
PK (hex): 000000000000000000000000000000020000000000000000000000E8D4A50FFF
ADR: 13qD8Bs6Kx8gQmuH7hWVfWTHPBXRGJ94aW
hash160 (hex): 1f0e5698f426c93197f6fe4561913d2dca7b0f56
hash160 (dec): 177298468032361376284751942974563620350777298774
PK (dec): 680564733841876926926749215863536422911
Quotient from division: 260516684
Result of quotient * private_key_dec: 177298467707828357339067016616368705409995347124

hash160: 177298468032361376284751942974563620350777298774
Prod: 177298467707828357339067016616368705409995347124

[Nodemath]

zahid888
If... then as a token of gratitude, I have no problem sending you a reward, just like the creator of the bruteforce program that will help find the key. I don't mind giving 1 BTC out of more than free 6 BTC.  

I can help with I have clue It will break entire ranges to half of half time but I need 1 btc
First payment 0.5 btc then after 0.5 btc

[btc11235]

quick question for y'all...

I have a PC with no GPU, a CPU capable of running 32 threads, and 64GB of RAM...

I've been playing with Keyhunt recently, and if I try it in address mode on a lower number puzzle I get speeds somewhere in the Mkeys/s range (I forget the exact number)... And when I try it in BSGS mode for a higher puzzle (one with a known public key, like 135) I'm getting around 880 Pkeys/s...

The problem is that I know how to calculate how big the search space is when trying to solve by address, but I have no idea how to do the same for BSGS... If the math for BSGS is completely different from calculating addresses, then is the puzzle's key range still relevant...?

Basically, I know it'll take me a gazillion years to search an entire key space either way, but I don't know if I should try my luck at addresses on a lower puzzle or BSGS on a higher one... Which one is better odds for my setup, any ideas?

Thanks.

[cctv5go]

quick question for y'all...

I have a PC with no GPU, a CPU capable of running 32 threads, and 64GB of RAM...

I've been playing with Keyhunt recently, and if I try it in address mode on a lower number puzzle I get speeds somewhere in the Mkeys/s range (I forget the exact number)... And when I try it in BSGS mode for a higher puzzle (one with a known public key, like 135) I'm getting around 880 Pkeys/s...

The problem is that I know how to calculate how big the search space is when trying to solve by address, but I have no idea how to do the same for BSGS... If the math for BSGS is completely different from calculating addresses, then is the puzzle's key range still relevant...?

Basically, I know it'll take me a gazillion years to search an entire key space either way, but I don't know if I should try my luck at addresses on a lower puzzle or BSGS on a higher one... Which one is better odds for my setup, any ideas?

Thanks.

You're wasting your time. It's better to do something else meaningful。

[btc11235]

You're wasting your time. It's better to do something else meaningful。

Thanks, but I'd still like to know if I'm better off trying my luck at A) ~120 Mkeys/s address search on, say, puzzle 68, or B) ~880 Pkeys/s BSGS search on, say, puzzle 135...

I mean, does it end-up being basically equal...? I can apparently search much faster on BSGS, and if the search space grows at roughly the same rate as my calc speed (or a little more), then I'd rather try for puzzle 135 since the reward is double... But if the search space for BSGS is still based (at least somewhat) on the address search range, then I'm guessing the fact that I can do "Pkeys/s" on #135 doesn't make-up for the exponential difference in search space size over #68...

[kTimesG]

You're wasting your time. It's better to do something else meaningful。

Thanks, but I'd still like to know if I'm better off trying my luck at A) ~120 Mkeys/s address search on, say, puzzle 68, or B) ~880 Pkeys/s BSGS search on, say, puzzle 135...

I mean, does it end-up being basically equal...? I can apparently search much faster on BSGS, and if the search space grows at roughly the same rate as my calc speed (or a little more), then I'd rather try for puzzle 135 since the reward is double... But if the search space for BSGS is still based (at least somewhat) on the address search range, then I'm guessing the fact that I can do "Pkeys/s" on #135 doesn't make-up for the exponential difference in search space size over #68...

Address: 2**67 / (120 M/s) = 38,996 years maximum (19,498 years expected)

BSGS: [max_ops] / (880 P/s) = years

Replace max_ops with whatever op count are required, it probably depends on the size of the baby steps table (which depends on how much RAM you have available).

You might find BSGS would need billions of years for your setup. It's already explained that there isn't enough storage on our planet to hold your baby step table to have the complexity reduced to sqrt(N).

[nomachine]

~120 Mkeys/s address search on, say, puzzle 68

I have achieved approximately 200 Mkeys/s in my script for searching Hash160 targets in pure random mode. This was accomplished using an AVX2 8-way parallel implementation of SHA-256 and RIPEMD-160 (based on the cpuminer version), which processes 8 hashes simultaneously.

Additionally, this script performs quite well in a similar way

https://bitcointalk.org/index.php?topic=5532654.msg65124268#msg65124268

 

[whistle307194]

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 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 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.

 Your project seems amazing. Do you have success so far? If you need more accurate calculator just let me know. I have a very fast karatsuba calculator that can solve up to 500 digit integers and up to 100 decimals. Can you tell more about about your project?

JackMazzoni Check pm please.

[Nodemath]

People u have still my offer because even newbie who solved puzzle

I have less compute speed but I used a lot brain to get clue
Even though creator don't know there was a way

Offer still at table

[bibilgin]

People u have still my offer because even newbie who solved puzzle

I have less compute speed but I used a lot brain to get clue
Even though creator don't know there was a way

Offer still at table

Don't bother yourself, no one will give you even 0.005 BTC. Proof of theory is not a definitive result.

[Nodemath]

I will show how it decrease range half size trust me
Upto 159 and I will try 160 covering some basics for this one

Who more computation power just ping me here

shadowmancer081@gmail.com

[k3ntINA]

This is just an opinion and since I don't have a lot of resources to search, I'm posting it here and anyone who would like to use it may be correct:
For number 68 in decimal starting from: 1446000000000000000000 or hex: 7d6ba65e0597c0000

[WanderingPhilospher]

This is just an opinion and since I don't have a lot of resources to search, I'm posting it here and anyone who would like to use it may be correct:
For number 68 in decimal starting from: 1446000000000000000000 or hex: 7d6ba65e0597c0000

1446000000000000000000  in hex = 0x4E6347FAC37ED80000, which outside 68's range.

68's range = 147573952589676412928 ; thru, 295147905179352825855 ; or 0x80000000000000000:0xfffffffffffffffff

1446000000000000000000
147573952589676412928
295147905179352825855

[3dmlib]

Hello. I will nice to get status update how much percent puzzle 67 solver scanned 68. To get any understanding if still any reason to scan it with not many compute resources available or it just wasting electricity, money and make world more hot Thanks.

[bitcoinpuzzles621]

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.

[Desyationer]

zahid888
If... then as a token of gratitude, I have no problem sending you a reward, just like the creator of the bruteforce program that will help find the key. I don't mind giving 1 BTC out of more than free 6 BTC.  

I can help with I have clue It will break entire ranges to half of half time but I need 1 btc
First payment 0.5 btc then after 0.5 btc

Send you 1 BTC? Funny!))) I'm so broke that even if I sold my apartment, I wouldn't even reach half a BTC!))) It would be hilarious to do that—let's say I get 0.3 BTC and end up homeless, completely relying on you!)))

I will send 1 BTC only after the BTC from the puzzle is in my personal wallet. I will send a total of 1 BTC to those whose software solutions or hints helped me find the golden key. For example, if a BitCrack fork helps, I will send part to the creator of BitCrack and the other half to the creator of the fork based on BitCrack.

[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