Bitcoin puzzle transaction ~32 BTC prize to who solves it

[GR Sasa]

Well, we're waiting  

puzzle 66 is still there @mcdouglasx

@mcdouglasx was not targeting 66, but 130 with his new mysterious invention

[1715361273]

1715361273

[1715361273]

1715361273

[albert0bsd]

Oh thats right in any case puzzle 130 is still there:

1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua

[Unplugged Taste]

Based on mcdouglas' post-claim comments, I can feel his frustration when he encountered EC's punch in face! He's been tricked and overpowered by the Illusion-of-Mastery, which made him post such a big claim. I am not demotivating him, no no!! I am happy about him that he is learning good maths here. Trying to divide like 58.5 and figuring what half would be, good good, great!!!! Majority of guys here possibly have been through lots of similar curve punches here. Someone rightly figured out here that EC cannot be broken from inside, whatsoever!!!! The only thing attached to it from outside is its point at infinity, WHICH CAN'T BE TOUCHED DUE TO BEING AT INFINITY SOMEHOW I GUESS, OR MAY BE IDK!!
Whatever secret mcdouglasx has, I am sure many of guys here have already tried & tested and accordingly slapped in ass by EC! SORRY FOR THAT!!
The possibilities of EC being broken by any BTC puzzle enthusiast are very slim! Because there are giant research & security institutes (I know few of them personally visited as well) which are rigorously and systematically approaching towards the solutions to ECDLP.
I bet Satoshi must have a good laugh today, Cheers, it is 1st of Feb 24!!!

[albert0bsd]

...
I am not demotivating him, no no!! I am happy about him that he is learning good maths here.
...
Whatever secret mcdouglasx has, I am sure many of guys here have already tried & tested and accordingly slapped in ass by EC! SORRY FOR THAT!!

I agree with you, i hope to know what is he doing.

[Cryptoman2009]

EC is a spiral curve like spring

try this 3d graph generator:



import matplotlib.pyplot as plt
from mpl_toolkits.mplot3d import Axes3D
import numpy as np

# parameters
p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
a = 0
b = 7
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424

# start + end decimal key
start = int(input("input start key: "))
end = int(input("input end key: "))

# generation
x = []
y = []
z = []
for i in range(start, end + 1):
    # point calculation index i
    Px = i * Gx
    Py = i * Gy
    x.append(Px % p)
    y.append(Py % p)
    z.append(i)

# 3D chart
fig = plt.figure()
ax = fig.add_subplot(111, projection='3d')
ax.plot(x, y, z, c='r', linewidth=2)

# add points on chart
for i, (xi, yi, zi) in enumerate(zip(x, y, z)):
    ax.text(xi, yi, zi, str(i), color='blue')

ax.set_xlabel('X')
ax.set_ylabel('Y')
ax.set_zlabel('Index')
ax.set_title('point on elliptic curve secp256k1 (3D graph)')

plt.show()

[Cryptoman2009]

similitudes with prime numbers...

https://www.youtube.com/watch?v=pnYkK6PqUro&ab_channel=voltagedrop

[mcdouglasx]

I have developed a new method!
I have studied it 100% and it works.
My calculations tell me that before the end of January 2024 I will have unlocked puzzle #130 (if someone else doesn't solve it before).
For registration, I will send it to this address BTC bc1qxs47ttydl8tmdv8vtygp7dy76lvayz3r6rdahu

This message will not have edits for its validity.

If you want to question it, do it on February 1, 2024 if I don't send it to that address.

happy new year in advance, see you in February!, if life allows me.

blessings for all.

In summary, my search is 70%, I do not intend to take up your time waiting for a precise date, I do not take external factors into the equation when calculating the time, I live in an underdeveloped country where electrical failures are frequent, I have an i5 4GB ddr3, although I want to, I can't go faster, it is what it is, I got excited with the calculations and completely omitted the external factors, I have earned the criticism and I understand it, but it does not offend me, because my path continues.

Based on mcdouglas' post-claim comments, I can feel his frustration when he encountered EC's punch in face! He's been tricked and overpowered by the Illusion-of-Mastery, which made him post such a big claim. I am not demotivating him, no no!! I am happy about him that he is learning good maths here. Trying to divide like 58.5 and figuring what half would be, good good, great!!!! Majority of guys here possibly have been through lots of similar curve punches here. Someone rightly figured out here that EC cannot be broken from inside, whatsoever!!!! The only thing attached to it from outside is its point at infinity, WHICH CAN'T BE TOUCHED DUE TO BEING AT INFINITY SOMEHOW I GUESS, OR MAY BE IDK!!
Whatever secret mcdouglasx has, I am sure many of guys here have already tried & tested and accordingly slapped in ass by EC! SORRY FOR THAT!!
The possibilities of EC being broken by any BTC puzzle enthusiast are very slim! Because there are giant research & security institutes (I know few of them personally visited as well) which are rigorously and systematically approaching towards the solutions to ECDLP.
I bet Satoshi must have a good laugh today, Cheers, it is 1st of Feb 24!!!

no, I have not broken ecc, I never said it, otherwise, it would not take more than a month to find a key, breaking ecc is creating a formula that allows you to obtain the private key in an instant, this is not it, it is just a system of search faster than the already known ones, and it is easy to verify if a search code works or not, so I am not wrong.

edit:
It has not yet been proven that the ECDLP is computationally intractable, therefore in mathematics we cannot consider something impossible that you cannot prove to be impossible.

An algorithm has not been found that can solve the ECDLP in polynomial time, but it cannot be said that it does not have such a solution.

You can solve a problem in two ways:
1= solution.
2= no solution.
If you are going to come and tell me that ECDLP is unbreakable in polynomial time, publish the formula that shows that this is the case, otherwise don't see something as impossible just because it is difficult, if all humans had that way of thinking, society would It was still in the prehistoric era.

Yes, there are giant institutions studying this, this does not mean that you have to feel less than them, but that you can learn from them and overcome them.

And I conclude that if you try and fail, you will have learned something, if you consider yourself incapable you only gain ignorance.

[nomachine]

EC is a spiral curve like spring

Nice graphic. It won't help us much with the methods we're using here.

[Cryptoman2009]

EC is a spiral curve like spring

Nice graphic. It won't help us much with the methods we're using here.

can open your mind to new ideas such as keymath and keydivision..

[unamic]

How can i Use VanitySearch for Windows with .exe file for the Puzzle nr66? BitCrack dont work for me nothing happens after i enter the commands. Kangaroo and Keyhunt is to high for me to understand.

If i enter this command with Vanitysearch
./VanitySearch.exe -stop -t 0 -bits 66 -start 0000000000000000000000000000000000000000000000020000000000000000 -gpu 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so

i get this message:

Unexpected -bits argument

[Bill buffalo]

Theoretically speaking let's say I had a quantum computer with the computational power of a 100 qubit what algorithm would I use on qisqit python to run the program that would find the private key

[bit_mind]

I am trying to solve the bitcoin puzzle mathematically.BTC

[ccinet]

I am trying to solve the bitcoin puzzle mathematically.BTC

I would also like to! But if there is no pattern I find it difficult.
Too bad there is no Ramanujan in our time, I fear new mathematics is needed to solve it 

[satashi_nokamato]

i get this message:

Unexpected -bits argument

Have you read the instructions on what args you can use? The message says the problem is "-bits", try to get rid of -start. Either use bits or start:end.

EC is a spiral curve like spring

Really interesting, I was kind of looking for something similar having colored 3D view of points,  something in the vein of mandelbrot rendering.

Surprisingly using some of the points as G, makes some unique shapes,  for example,  having n/2 public key as G and viewed in "polar" makes interesting lines,  I could also see Fibonacci's patterns.  Here try these points as G and set start to end at 1, 99. Though you should try different ranges both in polar and 3D view.

Code:

X= 0x7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a1
Y= 0xc5ac2496d64008aba9a7b1ceb9ee54a7cfdc7ca2ea265fe5ae84c963d490954b
Y= 0x3a53db6929bff75456584e314611ab583023835d15d9a01a517b369b2b6f66e4
X= 0x1
Y= 0x5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72
Y= 0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee
X= 0x3b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
Y= 0x3f3979bf72ae8202983dc989aec7f2ff2ed91bdd69ce02fc0700ca100e59ddf3
Y= 0xc0c686408d517dfd67c2367651380d00d126e4229631fd03f8ff35eef1a61e3c

Maybe we could find correlated connections based on each point differently, like e,g.  Having all the points generating spirals under one category, points generating triangles under one category, etc. Let me know what you think.

[unamic]

what is the best setting for an RTX 3090 with BitCrack? Is this the right setting? -b 128 -t 256 -p 1024

[sssergy2705]

I run customise python code on M2, work as like vanity gen, but speed is okay.

i run the 34 Bit Puzzle.
and the result is mostly satisfying, it almost hit 50-70% from target.

Searching for addresses starting with 1pwa and matching 1pwabe7ouahg2affqhhvviqovncr4rev7q with partial length 6 in the range 8589934592 to 17179869183
Searched 27902 keys in 6.61 seconds | Private key: 000000000000000000000000000000000000000000000000000000029281670d | Address (Compressed): 1PWaaEg8tHYzVZRoXia4YjkMci2Bq8s5Xd
Searched 38419 keys in 9.03 seconds | Private key: 000000000000000000000000000000000000000000000000000000037439dffc | Address (Compressed): 1PWAt7AjKjCHp4NhheRc3cR2YRwwrkbRNj
Searched 39670 keys in 9.31 seconds | Private key: 00000000000000000000000000000000000000000000000000000003c0460191 | Address (Compressed): 1PWa47ZVP1pzgySaPtn9pMvCSdxNkjCCfM
Searched 44105 keys in 10.34 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ea112d43 | Address (Compressed): 1PwAGySRoG8XCn5EwHszxEG5Q4oMikeUgC
Searched 86491 keys in 20.33 seconds | Private key: 00000000000000000000000000000000000000000000000000000002b55bda6d | Address (Compressed): 1PwaXp8YZUFk5hP7YivAieG7zEnaKVhwA6
Searched 102573 keys in 24.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002db48641a | Address (Compressed): 1Pwau8X2xjKieab9Xj6C7NjpMRQtZ5HhAz
Searched 116748 keys in 27.40 seconds | Private key: 0000000000000000000000000000000000000000000000000000000316d12e4d | Address (Compressed): 1PwAPdUUayDEqaxDP3q9VJDWiAq7CHfQFJ
Searched 123543 keys in 28.99 seconds | Private key: 00000000000000000000000000000000000000000000000000000003bf357910 | Address (Compressed): 1PwAUFihpnUudcAL5iioXPbUESMvYadCFW
Searched 124873 keys in 29.28 seconds | Private key: 0000000000000000000000000000000000000000000000000000000288ac21dd | Address (Compressed): 1PWa4zB1YrjobsHM2K3PzugeXJdBUqQrdt
Searched 154049 keys in 36.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002178fd357 | Address (Compressed): 1PwAk5hxgBBp79y9NP1Xv9Ez2tYcR5aiBJ
Searched 159895 keys in 37.45 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ff515a66 | Address (Compressed): 1PWAngTsfo7VfiJf5LtmWM66cvUhURg6uo
Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn


the search is using secret formula to make the rate of search not far away from actual range.

the real private key is 000000000000000000000000000000000000000000000000000000034a65911d

btw anyone have configuration code to make speed faster enough with cpu ?

Bitcoin address and hash160, has no meaning when searching for a private key.
You can select absolutely any search range and get the same results.

[Tepan]

I run customise python code on M2, work as like vanity gen, but speed is okay.

i run the 34 Bit Puzzle.
and the result is mostly satisfying, it almost hit 50-70% from target.

Searching for addresses starting with 1pwa and matching 1pwabe7ouahg2affqhhvviqovncr4rev7q with partial length 6 in the range 8589934592 to 17179869183
Searched 27902 keys in 6.61 seconds | Private key: 000000000000000000000000000000000000000000000000000000029281670d | Address (Compressed): 1PWaaEg8tHYzVZRoXia4YjkMci2Bq8s5Xd
Searched 38419 keys in 9.03 seconds | Private key: 000000000000000000000000000000000000000000000000000000037439dffc | Address (Compressed): 1PWAt7AjKjCHp4NhheRc3cR2YRwwrkbRNj
Searched 39670 keys in 9.31 seconds | Private key: 00000000000000000000000000000000000000000000000000000003c0460191 | Address (Compressed): 1PWa47ZVP1pzgySaPtn9pMvCSdxNkjCCfM
Searched 44105 keys in 10.34 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ea112d43 | Address (Compressed): 1PwAGySRoG8XCn5EwHszxEG5Q4oMikeUgC
Searched 86491 keys in 20.33 seconds | Private key: 00000000000000000000000000000000000000000000000000000002b55bda6d | Address (Compressed): 1PwaXp8YZUFk5hP7YivAieG7zEnaKVhwA6
Searched 102573 keys in 24.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002db48641a | Address (Compressed): 1Pwau8X2xjKieab9Xj6C7NjpMRQtZ5HhAz
Searched 116748 keys in 27.40 seconds | Private key: 0000000000000000000000000000000000000000000000000000000316d12e4d | Address (Compressed): 1PwAPdUUayDEqaxDP3q9VJDWiAq7CHfQFJ
Searched 123543 keys in 28.99 seconds | Private key: 00000000000000000000000000000000000000000000000000000003bf357910 | Address (Compressed): 1PwAUFihpnUudcAL5iioXPbUESMvYadCFW
Searched 124873 keys in 29.28 seconds | Private key: 0000000000000000000000000000000000000000000000000000000288ac21dd | Address (Compressed): 1PWa4zB1YrjobsHM2K3PzugeXJdBUqQrdt
Searched 154049 keys in 36.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002178fd357 | Address (Compressed): 1PwAk5hxgBBp79y9NP1Xv9Ez2tYcR5aiBJ
Searched 159895 keys in 37.45 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ff515a66 | Address (Compressed): 1PWAngTsfo7VfiJf5LtmWM66cvUhURg6uo
Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn


the search is using secret formula to make the rate of search not far away from actual range.

the real private key is 000000000000000000000000000000000000000000000000000000034a65911d

btw anyone have configuration code to make speed faster enough with cpu ?

Searched 1414289 keys in 307.98 seconds | Private key: 000000000000000000000000000000000000000000000000000000034710b2da | Address (Compressed): 1PwATmTLCtGLVwbqVx4dcyDHbvTVdyuQQX
Searched 1435507 keys in 312.59 seconds | Private key: 0000000000000000000000000000000000000000000000000000000345a8b581 | Address (Compressed): 1PWaFgHSEdGvnSmrfYC2DsWTxq7sMpPLkV
Searched 1477916 keys in 321.80 seconds | Private key: 00000000000000000000000000000000000000000000000000000003b7c88e5b | Address (Compressed): 1PwAgRhPYNPQvXJdP9dEr7dzmT8LLwQswM
Searched 1479675 keys in 322.19 seconds | Private key: 00000000000000000000000000000000000000000000000000000003b88983dc | Address (Compressed): 1PWAXkdsfoLdbWyu8HoUyJy1Lc5EAz33ze
Searched 1511866 keys in 329.17 seconds | Private key: 000000000000000000000000000000000000000000000000000000029a297ba1 | Address (Compressed): 1PwA47SjPnFrz2AQZ6wm2v3Tm7e7A8byXi
Searched 1514627 keys in 329.78 seconds | Private key: 00000000000000000000000000000000000000000000000000000003ed2d3c81 | Address (Compressed): 1PwAaexSpxH8PNxNUwfueV7Nn7QFt31LBu
Searched 1529648 keys in 333.06 seconds | Private key: 0000000000000000000000000000000000000000000000000000000342f74068 | Address (Compressed): 1PWAvwUScR41KWnG7r8gzkKr9FhWGjG6ht
Searched 1563424 keys in 340.40 seconds | Private key: 00000000000000000000000000000000000000000000000000000003e6aa1312 | Address (Compressed): 1PwAvEjNNZhiCNJ2yst8w8SzdG6iUowEvG
Searched 1575709 keys in 343.08 seconds | Private key: 00000000000000000000000000000000000000000000000000000003f6a32b74 | Address (Compressed): 1PWavPMfHdYfb7vPYypKxkoVczmwmndtQi
Searched 1576434 keys in 343.24 seconds | Private key: 00000000000000000000000000000000000000000000000000000003e0bf05e1 | Address (Compressed): 1PWAAsuv2CfHs63zVixBxb39dYoMj7bR5G


i use range threshold by filtering public key hash + downscale range multiplication.
can someone rate this ?

I run customise python code on M2, work as like vanity gen, but speed is okay.

i run the 34 Bit Puzzle.
and the result is mostly satisfying, it almost hit 50-70% from target.

Searching for addresses starting with 1pwa and matching 1pwabe7ouahg2affqhhvviqovncr4rev7q with partial length 6 in the range 8589934592 to 17179869183
Searched 27902 keys in 6.61 seconds | Private key: 000000000000000000000000000000000000000000000000000000029281670d | Address (Compressed): 1PWaaEg8tHYzVZRoXia4YjkMci2Bq8s5Xd
Searched 38419 keys in 9.03 seconds | Private key: 000000000000000000000000000000000000000000000000000000037439dffc | Address (Compressed): 1PWAt7AjKjCHp4NhheRc3cR2YRwwrkbRNj
Searched 39670 keys in 9.31 seconds | Private key: 00000000000000000000000000000000000000000000000000000003c0460191 | Address (Compressed): 1PWa47ZVP1pzgySaPtn9pMvCSdxNkjCCfM
Searched 44105 keys in 10.34 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ea112d43 | Address (Compressed): 1PwAGySRoG8XCn5EwHszxEG5Q4oMikeUgC
Searched 86491 keys in 20.33 seconds | Private key: 00000000000000000000000000000000000000000000000000000002b55bda6d | Address (Compressed): 1PwaXp8YZUFk5hP7YivAieG7zEnaKVhwA6
Searched 102573 keys in 24.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002db48641a | Address (Compressed): 1Pwau8X2xjKieab9Xj6C7NjpMRQtZ5HhAz
Searched 116748 keys in 27.40 seconds | Private key: 0000000000000000000000000000000000000000000000000000000316d12e4d | Address (Compressed): 1PwAPdUUayDEqaxDP3q9VJDWiAq7CHfQFJ
Searched 123543 keys in 28.99 seconds | Private key: 00000000000000000000000000000000000000000000000000000003bf357910 | Address (Compressed): 1PwAUFihpnUudcAL5iioXPbUESMvYadCFW
Searched 124873 keys in 29.28 seconds | Private key: 0000000000000000000000000000000000000000000000000000000288ac21dd | Address (Compressed): 1PWa4zB1YrjobsHM2K3PzugeXJdBUqQrdt
Searched 154049 keys in 36.10 seconds | Private key: 00000000000000000000000000000000000000000000000000000002178fd357 | Address (Compressed): 1PwAk5hxgBBp79y9NP1Xv9Ez2tYcR5aiBJ
Searched 159895 keys in 37.45 seconds | Private key: 00000000000000000000000000000000000000000000000000000002ff515a66 | Address (Compressed): 1PWAngTsfo7VfiJf5LtmWM66cvUhURg6uo
Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn


the search is using secret formula to make the rate of search not far away from actual range.

the real private key is 000000000000000000000000000000000000000000000000000000034a65911d

btw anyone have configuration code to make speed faster enough with cpu ?

Bitcoin address and hash160, has no meaning when searching for a private key.
You can select absolutely any search range and get the same results.

i run this on 23 bit, only takes 6 sec, i still have hope can improvises the code sir..

[citb0in]

First things first --> stop the consecutive posts

apparently you missed developing a performance counter to measure your capabilities. Let me do the maths for you...

Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn

173862 / 40.74 = 4,268 Keys/sec

Searched 1576434 keys in 343.24 seconds | Private key: 00000000000000000000000000000000000000000000000000000003e0bf05e1 | Address (Compressed): 1PWAAsuv2CfHs63zVixBxb39dYoMj7bR5G

1576434 / 343.24 = 4,593 Keys/sec

4,5 K/sec ... seriously?

the search is using secret formula to make the rate of search not far away from actual range.

I wouldn't make this secret elixir public under any circumstances, it would change the world. Please keep the secret to yourself

can someone rate this ?

done. Now go ahead and solve puzzle 66 using your magic elixir sir

[Tepan]

First things first --> stop the consecutive posts

apparently you missed developing a performance counter to measure your capabilities. Let me do the maths for you...

Searched 173862 keys in 40.74 seconds | Private key: 0000000000000000000000000000000000000000000000000000000374830ffc | Address (Compressed): 1Pwab9zMnNd5aeM2KZX8itAncLxUzcZNwn

173862 / 40.74 = 4,268 Keys/sec

Searched 1576434 keys in 343.24 seconds | Private key: 00000000000000000000000000000000000000000000000000000003e0bf05e1 | Address (Compressed): 1PWAAsuv2CfHs63zVixBxb39dYoMj7bR5G

1576434 / 343.24 = 4,593 Keys/sec

4,5 K/sec ... seriously?

the search is using secret formula to make the rate of search not far away from actual range.

I wouldn't make this secret elixir public under any circumstances, it would change the world. Please keep the secret to yourself

can someone rate this ?

done. Now go ahead and solve puzzle 66 using your magic elixir sir

Thank you for your input, I'm still a beginner and trying to develop it, I'm still trying and remain positive for the community

and how about this sir ?
i tweak some vanity search of 23 bit puzzle with cpu speed and hash160 filter and private key downscale multiplications

Searched 645240 keys in 0.55 seconds | Private key: 000000000000000000000000000000000000000000000000000000000054df77 | Address (Compressed): 1L2gKhvbWubwppJLfZXAhSfLuG8xw3uL9X
Searched 666794 keys in 0.58 seconds | Private key: 000000000000000000000000000000000000000000000000000000000045e993 | Address (Compressed): 1L2gVKpCZAPwDSTMEo3diJeKNybKeo3RjR
Searched 849294 keys in 0.60 seconds | Private key: 00000000000000000000000000000000000000000000000000000000006ba875 | Address (Compressed): 1L2gwSaaRWnK7Xj8E9upXrwXS5M9BYqjwH
Searched 857465 keys in 1.16 seconds | Private key: 000000000000000000000000000000000000000000000000000000000042707b | Address (Compressed): 1L2gP2jnz4AEXGTfMwvhgytvPwUtGMUzGJ
Searched 861241 keys in 1.88 seconds | Private key: 000000000000000000000000000000000000000000000000000000000056484a | Address (Compressed): 1L2GnHVKQ5AQZw5FASVy4USoRrUteR6Qpz
Searched 897078 keys in 2.73 seconds | Private key: 00000000000000000000000000000000000000000000000000000000004af06e | Address (Compressed): 1L2g5efN8kWG2fwEd2QUFLTNfnc96hBXqc
Searched 920717 keys in 3.26 seconds | Private key: 0000000000000000000000000000000000000000000000000000000000556e52 | Address (Compressed): 1L2GM8eE7mJWLdo3HZS6su1832NX2txaac
Found matching address (Compressed): 1L2GM8eE7mJWLdo3HZS6su1832NX2txaac | Private key: 0000000000000000000000000000000000000000000000000000000000556e52

The downside is that if I run 30 bit and above, it takes up a lot of RAM and CPU and also becomes unstable, resulting in a lot of decreases in the key search, and very drastically.

[WanderingPhilospher]

Thank you for your input, I'm still a beginner and trying to develop it, I'm still trying and remain positive for the community Cheesy

and how about this sir ?
i tweak some vanity search of 23 bit puzzle with cpu speed and hash160 filter and private key downscale multiplications

Searched 645240 keys in 0.55 seconds | Private key: 000000000000000000000000000000000000000000000000000000000054df77 | Address (Compressed): 1L2gKhvbWubwppJLfZXAhSfLuG8xw3uL9X
Searched 666794 keys in 0.58 seconds | Private key: 000000000000000000000000000000000000000000000000000000000045e993 | Address (Compressed): 1L2gVKpCZAPwDSTMEo3diJeKNybKeo3RjR
Searched 849294 keys in 0.60 seconds | Private key: 00000000000000000000000000000000000000000000000000000000006ba875 | Address (Compressed): 1L2gwSaaRWnK7Xj8E9upXrwXS5M9BYqjwH
Searched 857465 keys in 1.16 seconds | Private key: 000000000000000000000000000000000000000000000000000000000042707b | Address (Compressed): 1L2gP2jnz4AEXGTfMwvhgytvPwUtGMUzGJ
Searched 861241 keys in 1.88 seconds | Private key: 000000000000000000000000000000000000000000000000000000000056484a | Address (Compressed): 1L2GnHVKQ5AQZw5FASVy4USoRrUteR6Qpz
Searched 897078 keys in 2.73 seconds | Private key: 00000000000000000000000000000000000000000000000000000000004af06e | Address (Compressed): 1L2g5efN8kWG2fwEd2QUFLTNfnc96hBXqc
Searched 920717 keys in 3.26 seconds | Private key: 0000000000000000000000000000000000000000000000000000000000556e52 | Address (Compressed): 1L2GM8eE7mJWLdo3HZS6su1832NX2txaac
Found matching address (Compressed): 1L2GM8eE7mJWLdo3HZS6su1832NX2txaac | Private key: 0000000000000000000000000000000000000000000000000000000000556e52

The downside is that if I run 30 bit and above, it takes up a lot of RAM and CPU and also becomes unstable, resulting in a lot of decreases in the key search, and very drastically.

Where is the code so we can see how to offer any advice for speed up?


Also, question for everyone, if you can solve a 52 bit key, with known pubkey, in 30 seconds, what rate of speed is that?
Simplify the question, if you one is using some version of BSGS and finds a 52 bit key within 30 seconds, what's the speed?