Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 200. (Read 215272 times)

jr. member
Activity: 59
Merit: 1
id love to help in any way i have 3 3070ti gpus i would constintly run 24/7 for someone if you can push me in the right direction if youd want to split the price if the chance came one of hit. in conclusion what im saying is im a script kiddie who cant code worth shit but this is too apealing not to learn how or help atleast. under the correct cicomstances id be willing to basically give 24\7 acess to my computing power "probably not much" to help in this if anyone wants to help let me know.P.s ive tried kangaroo its too confusing i cant even get it to work thats how "not hip " i am lol... best of luck to all though ive been reading this thread and multipule others about it for a few months now with the right teacher i feel like i could be somewhat of help.


Hello, I've been following this thread for a year. I stocked all of them, including many archives that were deleted from the internet, along with their source code.

I just came up with a new idea and I need a little help with it.

Do you have fast point extraction algorithm for python ?

Thanks..

Not: sorry for my bad english, i don't know english i use google translate


Guys! Add me to discord, we can work together.
I'm working with python, C++ and Rust.
Need help with some coding functions, and more power will really help.

 Cheesy

DaMonsterAJ#4341


Alberto igual podrías escribirme de favor! hay funciones y experiencia que tú tienes que nos pueden beneficiar.


 Grin
legendary
Activity: 1582
Merit: 1196
Reputation first.
Using tools will take much more time, this needs to be solved by math and by hands.😉

Agree with you, but how can you explain maths behind this puzzle? It is really hard and this will cost to you a lot of headache while you find a solution (if it exists). As I can see, sequence seems to be casual, there isn't any

math behind it. The only thing to do if you don't want to use tools, is to try with bit 0 and 1 and be lucky.

copper member
Activity: 1330
Merit: 899
🖤😏
Using tools will take much more time, this needs to be solved by math and by hands.😉
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
Just converting a public key to an address will not help here, as there are already specialized programs in C++ and other faster, multithreaded languages, that can do that.

You don't need to compute base58 or bech32 in order to compare the addresses. Comparing the address hashes directly also works and saves an extra (expensive) computation, such that most of the work is pooled into making an efficient SHA256 algorithm OR optimizing the process of making private keys from public keys.

Probably time for me to stop by Cornell university's internet arxiv for some more finite field research papers.

uncomprewssed key for 66 1Pir2jKv35rpYgUh8dUxNL6JTTm6d7HX6U

Therefore, the uncompressed public key for the P2PKH address "1Pir2jKv35rpYgUh8dUxNL6JTTm6d7HX6U" is:  04ce42244bfa7731d7088ee2f20a72b0dd834a723d2b8f563bc58cfa5d5dc4911a2f8aae5c5b

could be wrong could be wright do what you want with the info im just tossing ideas.



does this look like itd do anything am i in the right path?

Code:
import hashlib
import base58

# uncompressed public key
public_key = "04ce42244bfa7731d7088ee2f20a72b0dd834a723d2b8f563bc58cfa5d5dc4911a2f8aae5c5b"

# step 1: compute SHA-256 hash of public key
sha256 = hashlib.sha256(bytes.fromhex(public_key)).digest()

# step 2: compute RIPEMD-160 hash of SHA-256 result
ripemd160 = hashlib.new("ripemd160")
ripemd160.update(sha256)
hash160 = ripemd160.digest()

# step 3: add version byte (0x00 for MainNet or 0x6f for TestNet) to hash160
version = "00"
hash160_version = version + hash160.hex()

# step 4: compute double-SHA-256 checksum of hash160_version
checksum = hashlib.sha256(hashlib.sha256(bytes.fromhex(hash160_version)).digest()).digest()

# step 5: append the first 4 bytes of the checksum to hash160_version
btc_address_hex = hash160_version + checksum.hex()[:8]

# step 6: encode the result using Base58Check encoding
btc_address = base58.b58encode(bytes.fromhex(btc_address_hex)).decode()

print("BTC public address: ", btc_address)
newbie
Activity: 14
Merit: 1
uncomprewssed key for 66 1Pir2jKv35rpYgUh8dUxNL6JTTm6d7HX6U


Therefore, the uncompressed public key for the P2PKH address "1Pir2jKv35rpYgUh8dUxNL6JTTm6d7HX6U" is:  04ce42244bfa7731d7088ee2f20a72b0dd834a723d2b8f563bc58cfa5d5dc4911a2f8aae5c5b




could be wrong could be wright do what you want with the info im just tossing ideas.



does this look like itd do anything am i in the right path?

Code:
import hashlib
import base58

# uncompressed public key
public_key = "04ce42244bfa7731d7088ee2f20a72b0dd834a723d2b8f563bc58cfa5d5dc4911a2f8aae5c5b"

# step 1: compute SHA-256 hash of public key
sha256 = hashlib.sha256(bytes.fromhex(public_key)).digest()

# step 2: compute RIPEMD-160 hash of SHA-256 result
ripemd160 = hashlib.new("ripemd160")
ripemd160.update(sha256)
hash160 = ripemd160.digest()

# step 3: add version byte (0x00 for MainNet or 0x6f for TestNet) to hash160
version = "00"
hash160_version = version + hash160.hex()

# step 4: compute double-SHA-256 checksum of hash160_version
checksum = hashlib.sha256(hashlib.sha256(bytes.fromhex(hash160_version)).digest()).digest()

# step 5: append the first 4 bytes of the checksum to hash160_version
btc_address_hex = hash160_version + checksum.hex()[:8]

# step 6: encode the result using Base58Check encoding
btc_address = base58.b58encode(bytes.fromhex(btc_address_hex)).decode()

print("BTC public address: ", btc_address)
member
Activity: 185
Merit: 15
Two things you should never abandon: Family & BTC
WOW!
Somebody (maybe the owner) increased the unsolved puzzles prizes again by x10 😱
Now the puzzle #66 prize is 6.6 BTC, #67 is 6.7 BTC... and so on .... puzzle # 160 prize is 16 BTC now
👍🏼🥳

OMG !!! 😱😱😱😱😱 Yesterday, I was thinking that I should give up now, but this has turned into a great motivation. need only one message from the puzzle creator in this situation, it would be the icing on the cake 👍🏼 👍🏼
RIGHT!!!!!!! the man the myth the legend "the creator" would you kindly please give us a hint of some sort a tool tool to look into something anything

Lol he did more than enough. The cracking method is on us to figure out.
newbie
Activity: 14
Merit: 1
WOW!
Somebody (maybe the owner) increased the unsolved puzzles prizes again by x10 😱
Now the puzzle #66 prize is 6.6 BTC, #67 is 6.7 BTC... and so on .... puzzle # 160 prize is 16 BTC now
👍🏼🥳

OMG !!! 😱😱😱😱😱 Yesterday, I was thinking that I should give up now, but this has turned into a great motivation. need only one message from the puzzle creator in this situation, it would be the icing on the cake 👍🏼 👍🏼
RIGHT!!!!!!! the man the myth the legend "the creator" would you kindly please give us a hint or maybe not a tool but a path to go for the ones who want to chase mr 125 -160 but your indeed right the cracking is to us everyone gave up a while back i feel like he brought the attention maybe this time to do as he said in the beginning test the ' community.'
member
Activity: 272
Merit: 20
the right steps towerds the goal
WOW!
Somebody (maybe the owner) increased the unsolved puzzles prizes again by x10 😱
Now the puzzle #66 prize is 6.6 BTC, #67 is 6.7 BTC... and so on .... puzzle # 160 prize is 16 BTC now
👍🏼🥳

OMG !!! 😱😱😱😱😱 Yesterday, I was thinking that I should give up now, but this has turned into a great motivation. need only one message from the puzzle creator in this situation, it would be the icing on the cake 👍🏼 👍🏼
newbie
Activity: 14
Merit: 1
"Pollard's rho algorithm" someone sent me this as a way to go at 66 is a way.

this is what ive kinda read up on so far about it. for anyone wondering if they don't know read below.


In the paper "A monte carlo method for factorization", Pollard introduces a method for factoring composite numbers that is better than trial division. The main idea is to generate random numbers and test if the difference between any pair has a non-1
 divisor in common with the number to be factored, which exploits the birthday paradox to find factors faster than trial division.

In his paper, Pollard uses the formula: xi+1≡x2i−1modn
, to generate random numbers, where n
 is the number that we want to factor and x0=2
. He notes that any polynomial of degree ≥2
 can be used.

It intuitively makes sense to me that linear functions can have additional properties that cause the generated sequence to not be random enough. However, I see no clear reason why the algorithm would only work for polynomials. Using different functions, for example with bit 2^64 manipulations and storing intermediate results modulo 264
 could potentially make the algorithm faster on real computers.


edit: how possibly hard could 66 be with a decent group.
member
Activity: 185
Merit: 15
Two things you should never abandon: Family & BTC
There's the math comes again,

66 Bit puzzle  Kiss


the total number of keys in this range can be calculated by taking 16 to the power of 17 (i.e., 16^17), which is equal to 295,147,905,179,352,825,856.

So, there are a total of 295,147,905,179,352,825,856 keys in the given range.

If you have a speed of 343 million keys per second (Mkeys/s), the result's,

Total number of keys = 295,147,905,179,352,825,856
Time = Total number of keys / Speed

Substituting the values, we get:

Time = 295,147,905,179,352,825,856 / 343,000,000
Time = 859,488,566,568 seconds

Therefore, it would take approximately 859,488,566,568 seconds (or about 27,247 years) to generate all the possible keys in the given range at a speed of 343 million keys per second. This is a very long time and may not be practically feasible.

what if i have 5000 mkeys to scan those number of key ?
it would take approximately 59,029,581,036 seconds (or about 1,872 years) to generate all the possible keys in the given range at a speed of 5000 million keys per second, still lame haha  Grin



and there's other scenario to win the ticket haha

For a 66-bit puzzle, the key range would be from 0 to 2^66 - 1, which is:

0 to 7,922,816,251,426,433

The number of keys in this range is:

2^66 = 73,786,976,294,838,206,464

At a scanning speed of 343 Mkey/s, the time it would take to scan this entire range would be:

Time = Number of Keys / Keys per Second

Time = (2^66) / 343000000 = 215625224 seconds
= 3593754 minutes
= 59896 hours
= 2495 days
≈ 6.84 years

So, it would take approximately 6.84 years to scan the entire key range of a 66-bit puzzle at the given scanning speed.

If we were to randomly hit the private key in the middle of the range, then we would only need to scan half of the key range, which is:

2^65 = 36,893,488,147,419,103,232

Using the same formula as above, the time it would take to scan half of the key range would be:

Time = (2^65) / 343000000 = 107812612 seconds
= 1796877 minutes
= 29948 hours
= 1248 days
≈ 3.42 years

So, if we randomly hit the private key in the middle of the key range, it would take approximately 3.42 years to scan half of the key range at the given speed of 343 Mkey/s.


btw, my close friend is neat, he's building something on ASICs L3+ to give a proof to scan the puzzle for mean time haha.
let's see..



Wrong, the entire range of puzz #66 contains 36.8 million trillion keys, half that range is obviously 18.44 million trillion keys.

Also the calc is misleading. With 1billion keys/sec, you need a little over 1000 years to scan the entire range sequentially.
member
Activity: 185
Merit: 15
Two things you should never abandon: Family & BTC
Let's do it one more time. With that much money at stake, we should grow a huge community.
Everyone thinks he will be the lucky one and prefers to avoid having to share the X10 is made to encourage people to pool their power to demonstrate that even with a collective effort the 66 67 68 and 69 will be difficult to obtain otherwise it won't find away
Also give a good boost to this puzzle which is now 8 years old

With collective effort, we can go as far as 90 bits. Then from there, Quantum code should step in. But that's another level.
member
Activity: 117
Merit: 32
Let's do it one more time. With that much money at stake, we should grow a huge community.
Everyone thinks he will be the lucky one and prefers to avoid having to share the X10 is made to encourage people to pool their power to demonstrate that even with a collective effort the 66 67 68 and 69 will be difficult to obtain otherwise it won't find away
Also give a good boost to this puzzle which is now 8 years old
member
Activity: 185
Merit: 15
Two things you should never abandon: Family & BTC
Quote
  And i have the domain name and hosting ready. Domain is 21 years old so it's solid. SSL certificate already setup
What domain do you own/have?

I had a pool running over 2 years ago, for #64. People say they will run their GPUs but we only had around 2-4 people running consistently.

What would be nice is to know everyone’s fire power, and then decide what tools to use, and best setup. But most get excited in the beginning and then fizzle out a week or so later when the key hasn’t been found lol.



I own cesr.net

Let's do it one more time. With that much money at stake, we should grow a huge community.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
Yeah your math is way off.

We already knew/know the starting point of 61 and 65 and their applicable ranges and private keys.

61 is in the 61 bit range.
A 1 followed by 15 zeros thru a 1 followed by 15 f’s
65 is in the 65 bit range.
A 1 followed by 16 zeros thru a 1 followed by 16 f’s.

For 66:
The starting range is a 2 followed by 16 zeros
The ending range is a 3 followed by 16 f’s
20000000000000000-3ffffffffffffffff

ive also seen alot of your work sir you sir are a legend  indeed. im going based off things ive done myself as long with the math and ideas throught the thousands of posts ive read through multiple threads. if you do think anything is off please let me know i get what you mean about my first part im too braindead to explain all of it rn that i put into it. id love to hear any output that you or anyone else has to say. please stay open minded in the factt that everyone is still learning something at this point its about brining all of our knowlge together and seeing what we get like the other guy said i think its time for something new we cannot let history repeat itself.
Well now you have changed your range starts LOL...these make more sense:

Code:
#66 ranges between
3b320044788A17DA0 - 3BC0ABFC3654BAE80
3475FBD690F7B3880 - 34B85C9495BA98840
30389466D233BCDE0 - 305E58789566D2EA0
2E1325EAAC24E8A40 - 2E6917C76BF8F5340

#67 would be
76650288f113CE0C0 - 778157F86CA914280
67EBF7AD21EF67100 - 69cb0874000C96B00
60020C853D2F282C0 - 60BCB0F12ACD13580
5C264BD668493ECC0 - 455DB0955BB3E3100
newbie
Activity: 14
Merit: 1
Yeah your math is way off.

We already knew/know the starting point of 61 and 65 and their applicable ranges and private keys.

61 is in the 61 bit range.
A 1 followed by 15 zeros thru a 1 followed by 15 f’s
65 is in the 65 bit range.
A 1 followed by 16 zeros thru a 1 followed by 16 f’s.

For 66:
The starting range is a 2 followed by 16 zeros
The ending range is a 3 followed by 16 f’s
20000000000000000-3ffffffffffffffff

ive also seen alot of your work sir you sir are a legend  indeed. im going based off things ive done myself as long with the math and ideas throught the thousands of posts ive read through multiple threads. if you do think anything is off please let me know i get what you mean about my first part im too braindead to explain all of it rn that i put into it. id love to hear any output that you or anyone else has to say. please stay open minded in the factt that everyone is still learning something at this point its about brining all of our knowlge together and seeing what we get like the other guy said i think its time for something new we cannot let history repeat itself.
newbie
Activity: 14
Merit: 1
Yeah your math is way off.

We already knew/know the starting point of 61 and 65 and their applicable ranges and private keys.

61 is in the 61 bit range.
A 1 followed by 15 zeros thru a 1 followed by 15 f’s
65 is in the 65 bit range.
A 1 followed by 16 zeros thru a 1 followed by 16 f’s.

For 66:
The starting range is a 2 followed by 16 zeros
The ending range is a 3 followed by 16 f’s
20000000000000000-3ffffffffffffffff

from my guess its weeks if not a few months till 66 is solved my guess is its key is in the ranges of and thats at a 90% probability rate. now back to the guy who wanted to conjoin if we could get multipule people to run each range id bet itd be a matter od days till its cracxked depending on everyones computer specs and how long you comfortable with running. with the right code id bet my first two numbers in privkey  are no greater than 35 logistically 36 and no smaller than at a like 0.00000000000000000001 ect chamce min is 0x1a274a956a7d53d977 which i dont think will be anywere close to that..

#66 ranges between
0x1a274a956a7d53d977 - 0x3b320044788A17DA0 ( most likely this group)
3b320044788A17DA0 - 3BC0ABFC3654BAE80
3475FBD690F7B3880 - 34B85C9495BA98840
30389466D233BCDE0 - 305E58789566D2EA0
2E1325EAAC24E8A40 - 2E6917C76BF8F5340





#67 would be 
76650288f113CE0C0 - 778157F86CA914280
67EBF7AD21EF67100 - 69cb0874000C96B00
60020C853D2F282C0 - 60BCB0F12ACD13580
5C264BD668493ECC0 - 455DB0955BB3E3100

once 66 is cracked id delete a row from the list for 67 and its be a completely different
full member
Activity: 1162
Merit: 237
Shooters Shoot...
Yeah your math is way off.

We already knew/know the starting point of 61 and 65 and their applicable ranges and private keys.

61 is in the 61 bit range.
A 1 followed by 15 zeros thru a 1 followed by 15 f’s
65 is in the 65 bit range.
A 1 followed by 16 zeros thru a 1 followed by 16 f’s.

For 66:
The starting range is a 2 followed by 16 zeros
The ending range is a 3 followed by 16 f’s
20000000000000000-3ffffffffffffffff
newbie
Activity: 14
Merit: 1
i have no idea if this helps if it does contribute at all think of me when your doing a line off my mothers butt when ur sitting with 200k


Based on the information given, we can derive the starting point for Puzzle 49 and use it to calculate the starting point for Puzzle 66.

Puzzle 49 would be (1/16.532318326723157) times Puzzle 53, which gives us a factor of 0.06056415335786299. Multiplying this factor with the starting point for Puzzle 53 (0x9c8c956992e7aaf45d) gives us a starting point for Puzzle 49 of 0x5e2c3f6f1a2c80486f.

To calculate the starting point for Puzzle 66, we need to multiply the starting point for Puzzle 65 times 40, which gives us 0x4248dbb048e3e05018. We can then use the starting point for Puzzle 49 and the factor between Puzzles 49 and 65 to calculate the starting point for Puzzle 66:

Puzzle 65 is 21.439643985050658 times Puzzle 61.
Puzzle 61 is 10.313427000231762 times Puzzle 57.
Puzzle 57 is 20.439417260448156 times Puzzle 53.
Puzzle 53 is 16.532318326723157 times Puzzle 49.
Puzzle 49 is 0.06056415335786299 times Puzzle 66.

Therefore, the starting point for Puzzle 66 would be (0x4248dbb048e3e05018)/(21.43964398505065810.31342700023176220.4394172604481560.06056415335786299)(0x5e2c3f6f1a2c80486f) which evaluates to 0x1a274a956a7d53d977. edit--- with a ending point of 0x3500000000000000000 "based off my guess" or logically 0x3600000000000000000
I do not understand your logic (not knocking it, I just don't get it)
#66 should have a starting range of 20000000000000000 and an ending range of 3ffffffffffffffff; that's the way every puzzle/challenge bit has worked up to this point.
im on 24 hours of no sleep rn im off for the night when im back on later ill try to explain in as much detail as i can.. also has anyone thats good at coding or that makes their own programs can use these to cancle out half of keys needed ran? to put it fast and direct have the starting point at 0x1a274a956a7d53d977  then put ending put with a rang starting at 35 or 36. doesnt matter what the rest is just key it cant go past 35 in my boook but logically 0x36*********** ECT.

To find the ending point of puzzle 66 given the starting point of 0x1a274a956a7d53d977 and the end key of 000000000000000000000000000000000000000000000003ffffffffffffffff, you would need to solve the puzzle chain.

Starting with puzzle 66, you would need to work backwards through each puzzle to find the initial key. Here is the puzzle chain:

Puzzle 66: starting point is 0x1a274a956a7d53d977
Puzzle 65: starting point is 0x109236ec1238f81406, ending point is 0x21246dd82471f0280c
Puzzle 61: starting point is 0x9de8dcbfaea2640cb, ending point is 0x7f8cfa5a2a5be5fcf
Puzzle 57: starting point is 0xb245378dbb04d76b3, ending point is 0x468c347ac9ec620d8
Puzzle 53: starting point is 0x940cfc26d7a0ebe1a, ending point is 0x2a0a052f630b2602

You can then use the solution to puzzle 53 as the initial key to puzzle 57, the solution to puzzle 57 as the initial key to puzzle 61, and so on until you reach the solution to puzzle 66.  EDIT----- some things i may post are built up or saved comments ive never got around to sharing any of my thoughts but this 10x btc increase has got me to making a account and getting more intertwined then ever into all of this.
full member
Activity: 1162
Merit: 237
Shooters Shoot...
i have no idea if this helps if it does contribute at all think of me when your doing a line off my mothers butt when ur sitting with 200k


Based on the information given, we can derive the starting point for Puzzle 49 and use it to calculate the starting point for Puzzle 66.

Puzzle 49 would be (1/16.532318326723157) times Puzzle 53, which gives us a factor of 0.06056415335786299. Multiplying this factor with the starting point for Puzzle 53 (0x9c8c956992e7aaf45d) gives us a starting point for Puzzle 49 of 0x5e2c3f6f1a2c80486f.

To calculate the starting point for Puzzle 66, we need to multiply the starting point for Puzzle 65 times 40, which gives us 0x4248dbb048e3e05018. We can then use the starting point for Puzzle 49 and the factor between Puzzles 49 and 65 to calculate the starting point for Puzzle 66:

Puzzle 65 is 21.439643985050658 times Puzzle 61.
Puzzle 61 is 10.313427000231762 times Puzzle 57.
Puzzle 57 is 20.439417260448156 times Puzzle 53.
Puzzle 53 is 16.532318326723157 times Puzzle 49.
Puzzle 49 is 0.06056415335786299 times Puzzle 66.

Therefore, the starting point for Puzzle 66 would be (0x4248dbb048e3e05018)/(21.43964398505065810.31342700023176220.4394172604481560.06056415335786299)(0x5e2c3f6f1a2c80486f) which evaluates to 0x1a274a956a7d53d977. edit--- with a ending point of 0x3500000000000000000 "based off my guess" or logically 0x3600000000000000000
I do not understand your logic (not knocking it, I just don't get it)
#66 should have a starting range of 20000000000000000 and an ending range of 3ffffffffffffffff; that's the way every puzzle/challenge bit has worked up to this point.
newbie
Activity: 14
Merit: 1
 i have no idea if this helps if it does contribute at all think of me when your doing a line off my mothers butt when ur sitting with 200k


Based on the information given, we can derive the starting point for Puzzle 49 and use it to calculate the starting point for Puzzle 66.

Puzzle 49 would be (1/16.532318326723157) times Puzzle 53, which gives us a factor of 0.06056415335786299. Multiplying this factor with the starting point for Puzzle 53 (0x9c8c956992e7aaf45d) gives us a starting point for Puzzle 49 of 0x5e2c3f6f1a2c80486f.

To calculate the starting point for Puzzle 66, we need to multiply the starting point for Puzzle 65 times 40, which gives us 0x4248dbb048e3e05018. We can then use the starting point for Puzzle 49 and the factor between Puzzles 49 and 65 to calculate the starting point for Puzzle 66:

Puzzle 65 is 21.439643985050658 times Puzzle 61.
Puzzle 61 is 10.313427000231762 times Puzzle 57.
Puzzle 57 is 20.439417260448156 times Puzzle 53.
Puzzle 53 is 16.532318326723157 times Puzzle 49.
Puzzle 49 is 0.06056415335786299 times Puzzle 66.

Therefore, the starting point for Puzzle 66 would be (0x4248dbb048e3e05018)/(21.43964398505065810.31342700023176220.4394172604481560.06056415335786299)(0x5e2c3f6f1a2c80486f) which evaluates to 0x1a274a956a7d53d977. edit--- with a ending point of 0x3500000000000000000 "based off my guess" or logically 0x3600000000000000000
Jump to: