 Show Posts
|
|
Pages: [1] 2 3 »
|
|
Three years on the puzzle, and nothing.Good luck to everybody.
|
|
|
|
|
Puzzle 71 is expected to be solved by the end of this year.
|
|
|
|
|
How do I get an application for Mara? I submitted my application a week ago but haven't gotten any reply email.
|
|
|
|
|
Even if we find the private key for Puzzle 71 now, we still can't securely transfer the remaining funds because MARA isn't publicly available yet
|
|
|
|
The interesting math behind this (private key binary): Plz27 13,14 Plz31 10,21--->The two numbers differ by 11 Plz35 20,15 Plz39 19,20 Plz43 19,24 Plz47 23,24 Plz51 32,19--->The two numbers differ by 13 Plz55 24,31 Plz59 26,33 Plz63 27,36 Plz67 36,31 Plz71  , --->The two numbers differ by 15？？？(43,28)? |
|
|
|
|
Besides MARA, do we have any other options，Puzzle 71 seems to be close to being solved.
|
|
|
|
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🔑..  |
|
|
|
|
Ps. Hello, everyone. I really take it from you. We quarrel every day. I recently developed and improved a set of algorithms, and it only takes 15 days and 10,000 dollars to solve the problem #71, believe me.
Donate:13gLHZJYcCJVSCoSuWbAFiYPU3X7kv47iH
|
|
|
|
|
A crash test:
Hash160☞Public key☞Private key
|
|
|
|
|
Puzzle # 71 will have its answer announced before September 20th.
|
|
|
|
|
Puzzle 71 will be solved within next week, stay tuned.I am confident that I have found mathematical magic.
|
|
|
|
Seven words remain to solve the puzzle 17+7 = 24 word
That's approximately 4.79 billion years.  You have a much better chance of solving a WIF (Wallet Import Format) key that is missing the last 12–14 characters than cracking anything related to BIP39. Related processes (like PBKDF2) are intentionally slow to resist attacks. https://github.com/AlexanderKud/WIF-Cracker_NoMachineCan the teacher compile the GPU version? This looks good. |
|
|
|
|
It cannot be denied that prefix search combined with mathematical methods is currently the most efficient way to find keys.
Under the premise of unknown public key, too many puzzle pools use search prefixes as exits, and for individuals, the winning rate of randomly searching for private keys is almost zero.
|
|
|
|
|
Share a prefix:
1PWo3JeB9jTm84otLWfm4ePF9x7e1gc81S
5FC34BED98D3286F62
|
|
|
|
|
Solving puzzle 71 is actually quite simple, but we haven't found the appropriate code yet.JeanLucPons may be able to easily solve such puzzles.But I have never seen him discuss this topic here, perhaps it is a mystery.He is an excellent developer.
|
|
|
|
|
Does anyone know who the author of the puzzle is?JPL?…
|
|
|
|
|
Good programmers are always excellent wherever they go, there are always some bad programmers who always talk big.
|
|
|
|
|
Does this puzzle have a backdoor, damn prefix method?The creators seem to be having a great time, and more and more low-level puzzles will be solved in a short period of time.
|
|
|
|
Regarding this program,Can we calculate the stride from the left?  |
|
|
|
I tested this—amazing! It solved 12 characters in 8 minutes. Is there a C++ version of this? I can only imagine what a script that's 200x faster could do.  I have a script in C++, but it's not 200x faster—it doesn't use AVX2 hashing or the JLP SECP256K1. It uses OpenSSL. But what are you going to do with it? To generate the number of possible combinations between "ecrA1gh" and "kW1gt2H" (7 missing characters for puzzle 69) using the Base58 character set, there are approximately 1.54 trillion combinations. - WIFRotator
- Starting WIF: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3q
- Middle range: ecrA1gh to kW1gt2H
- Missing chars: 12
- Target: 61eb8a50c86b0584bb727dd65bed8d2400d6d5aa
- Cores: 12
- Initial middle: f9FtYtY
- New middle section activated: ipNX8dr
- Speed: 16,2 MKeys/sec | Total: 6,404 MKeys
- New middle section activated: hGnuha8
- Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
- New middle section activated: gxN4jE6
- Speed: 15,7 MKeys/sec | Total: 6,204 MKeys
- New middle section activated: fT9yPyt
- Speed: 15,9 MKeys/sec | Total: 6,404 MKeys
- New middle section activated: hM42ZDc
- Speed: 16,2 MKeys/sec | Total: 6,304 MKeys
- New middle section activated: h5KwaZ5
- Speed: 16,2 MKeys/sec | Total: 6,300 MKeys
- New middle section activated: jSaH3oc
- Speed: 16,2 MKeys/sec | Total: 6,301 MKeys
- New middle section activated: iHgzCdB
This means your script will rotate through ~1.54 trillion different middle sections (each taking about 1–8 minutes), while brute-forcing the last 12 characters for each one.  Can you share this program? To try your luck, at least closer than the end of the universe.What is the random probability that these seven characters in the middle are different? |
|
|
|
|
