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

I agree and say the following: Renting a GPU as I see on the privatekeys website etc, is good for those who rent, but it must be very bad for GPU owners to find puzzles

Most likely not. I even wonder how you were thinking that anyone would pay $200 for a program which is said to find the solution of btc puzzle 67 which in return is, around $600k. My alarm bell would ring hard.
If it's a shitty python script then don't even waste your computational resources with it. If it's just generating random addresses from any private key within the range begin and range end - also don't waste your time due to the birthday paradox.

I wonder why people always come up with such stupid statements and I'm so sick and tired of it.
We are talking about the 67 bitcoin puzzle which has approx. 73 quintillion possible solutions. ECC operations are slow, even if optimized.
I'm a rust developer and I optimized every possible ECC operation, yet my programs don't match the speed of albertos keyhunt (even though I'm using optimization techniques like point addition rather than scalar multiplication).
There is no shortcut to iterate over the entire keyspace faster. You only can reduce the needed steps to find the solution if you can make use of some algorithms like BSGS or Pollard Rho - However, currently we can only use those algorithms on known public keys due to the nature of these algorithms (so 135 and above).

I'm sorry if this came out rude - but my code is likely faster than your program and I would never think about to sell it for even 1 cent. That's because it's far more likely to get hit by lightning rather than finding a needle in a haystack of 73 quintillion keys with the current computational limit of home PCs.

Hello a programmer,

You can make it public and you can get even more than $200 in donations. OR you can run it yourself and claim the reward yourself.

I hope I could help you with this.

Best regards

This is because, instead of trying to solve puzzles by searching for WiF private keys, which is an extremely inefficient and impractical process (with a complexity of 10^58), it is much better and more effective to directly search for private keys and convert them into addresses or hash160(Ripemd160). This way, it is easier to identify the target address, as it significantly reduces the number of characters and the complexity of the process.

Your found puzzles list addresses ?

I found that solving puzzles by searching for WiF private keys is rarely used here.

I’ve shared many things here, but as you, Nomachines, or others might think, some of them might seem like ‘cute’ or futile attempts.
However, that doesn’t mean this thread captures the full depth of my efforts or experiments—there are still many scientific tricks and insights I haven’t shared yet.

Anyway, my post is specifically aimed at newbies—those who often enter these challenges with minimal effort and high expectations, hoping for quick success.
Even many of them don’t even take the time to read older posts, study the groundwork, or fully grasp the complexity of these puzzles.

This isn’t about discouraging genuine curiosity or scientific exploration—it’s about setting realistic expectations for those who might be diving in without the preparation or perseverance needed to even begin unraveling such a relentless riddle.

Some one know gpu based program
For hex char combination to check priv key for address
Example
File 1 = 1 hex char
File 2 = 5 hex char
File 3 = 5 hex char


Example command
./prog-run file1.txt file2.txt file3.txt -i input-file-address.txt -o result.txt

Pythone easy but no speed
Looking gpu based, if someone already have or know git repo
Thankx

graph visualize how impossible this is

I totally disagree with that, it's your personal experience, you waste time if you limit yourself to using what is already written without trying to go further, but the exploration of scientific topics that seem impossible have always been solved sooner or later, sometimes even without wanting to find it!.

An example:
Heinrich Hertz, never saw the practical use of radio waves. Decades later wireless communication signals were invented,
we should never give up on something, theorems have been solved even centuries later.
Just because you can't doesn't mean that nobody else will ever do it!

Well said, and your analogy is spot-on!

You captures the essence of this trap perfectly. My hope is that others see posts like yours and mine and decide to avoid this endless recursion before it’s too late.
The worst part is how deeply they prey on human curiosity and tenacity. Once you're hooked, it feels impossible to walk away because the sunk-cost fallacy kicks in hard.
You think, ‘Just a little more effort, a bit more time,’ but it’s all for nothing.

You'll get the exact same results / curve / fit if your inputs are randomly generated in their respective intervals. The only correct result is that 67 is somewhere between the start and the end of its respective range, with 100% confidence, and you don't need a graph for that. Anything else is pure speculation, usually futile.

Engaging with these puzzle games is akin to launching a process that immediately forks into an infinite loop, consuming 100% of your system resources while producing zero meaningful output. It’s a blockchain-backed black hole, an entropy vortex designed to maximize grind while minimizing ROI (Return on Investment).

Your intelligence? Irrelevant. RNG luck factor? Ineffectual. Effort? Cute, but futile. Once you enter this closed loop, you’ll find that all inputs - time, mental energy, and yes, even your precious Bitcoin - are siphoned off into the great digital void, leaving nothing but an irrecoverable stack overflow of regret.

Solving puzzles with social engineering is like trying to decrypt an avocado with a VPN -confusing, messy, and guaranteed to leave you questioning your life choices.

 Save your RAM, your energy, and your soul—run while you still have bandwidth.

i have no idea, but i seek around 6-7fxxx,
even when code says 5.9382703242690036e+19 (thats wrong)

what is range of 67 puzle show your scrypt ?

The current status/lists can be found on page 1 of this post: https://bitcointalksearch.org/topic/bitcoin-challenge-transaction-1000-btc-total-bounty-to-solvers-updated-5218972

import numpy as np
import matplotlib.pyplot as plt
from scipy.optimize import curve_fit

# Your sequence of numbers
sequence = [1, 3, 7, 8, 21, 49, 76, 224, 467, 514, 1155, 2683, 5216, 10544, 26867, 51510, 95823, 198669, 357535,
            863317, 1811764, 3007503, 5598802, 14428676, 33185509, 54538862, 111949941, 227634408, 400708894,
            1033162084, 2102388551, 3093472814, 7137437912, 14133072157, 20112871792, 42387769980, 100251560595,
            146971536592, 323724968937, 1003651412950, 1458252205147, 2895374552463, 7409811047825, 15404761757071,
            19996463086597, 51408670348612, 119666659114170, 191206974700443, 409118905032525, 611140496167764,
            2058769515153876, 4216495639600700, 6763683971478124, 9974455244496707, 30045390491869460,
            44218742292676575, 138245758910846492, 199976667976342049, 525070384258266191, 1135041350219496382,
            1425787542618654982, 3908372542507822062, 8993229949524469768, 17799667357578236628, 30568377312064202855, 46346217550346335726]

# Normalize the data
normalized_y = np.array(sequence)
normalized_y = (normalized_y - np.min(normalized_y)) / (np.max(normalized_y) - np.min(normalized_y))

# Create the x-values for curve fitting
x = np.arange(len(sequence))

# Define the sigmoid function
def sigmoid(x, a, b, c, d):
    return a / (1 + np.exp(-b * (x - c))) + d

# Initial guess for sigmoid parameters
initial_guess = [np.max(normalized_y), 1, len(sequence)/2, np.min(normalized_y)]

# Fit the sigmoid model
popt, _ = curve_fit(sigmoid, x, normalized_y, p0=initial_guess, maxfev=10000)

# Predict the next value (next index)
next_x = len(sequence)
pred_next = sigmoid(next_x, *popt)

# Reverse the normalization to get the predicted value in the original scale
predicted_next_value = pred_next * (np.max(sequence) - np.min(sequence)) + np.min(sequence)

# Calculate R² for the sigmoid fit
def calculate_r_squared(model, x, y, popt):
    y_pred = model(x, *popt)
    ss_res = np.sum((y - y_pred) ** 2)
    ss_tot = np.sum((y - np.mean(y)) ** 2)
    return 1 - (ss_res / ss_tot)

r_squared_sigmoid = calculate_r_squared(sigmoid, x, normalized_y, popt)

# Print results
print("Fitted parameters for Sigmoid model:", popt)
print("Predicted next value (Sigmoid):", predicted_next_value)
print("R² for Sigmoid fit:", r_squared_sigmoid)

# Plot the models alongside the actual data
plt.plot(x, sequence, label='Data')
plt.plot(x, sigmoid(x, *popt) * (np.max(sequence) - np.min(sequence)) + np.min(sequence), label='Sigmoid Fit')
plt.xlabel('Index')
plt.ylabel('Value')
plt.title('Sigmoid Fit')
plt.legend()
plt.show()

---

perfect fit, no prediction



https://ibb.co/ZWmGg6V

Because I don't have enough computing resources to use brute force to get the answer to this puzzle, I focused my research on social engineering.

social engineering: By analyzing the user profile of the creator, we can guess the wallet type and seed that the creator may use to try to get the answer to the puzzle.

Several prerequisites:

1. It is assumed that the seed used by the creator was not randomly created. If it is randomly generated, the random seed has been saved from 2015 to at least 2019, and the memory cost is relatively high.

2. The creator said the wallet used is a deterministic wallet, so I would not consider the HD wallet. Because it is difficult to get the answer if you consider HD wallet

Based on the above two prerequisites, I analyzed this puzzle and the user portrait of the creator, and got the following content, which may be just a coincidence

1. The first 6 private keys of the puzzle 1 3 7 8 15 31 basically correspond to the decimal 2^n-1, which is obviously determined artificially, and is randomly generated starting from the 7th key. And I found sha256(hex_str(sha256(010307081531)))=0cf0798e6901f26a879bc63e267bbd7c8f35cd9af58c9818248b14d0ac68f24c masked with leading 000...0001 is the 7th key (maybe just a 1/64 coincidence),The same is sha256(127)=922c7954216ccfe7a61def609305ce1dc7c67e225f873f256d30d7a8ee4f404c masked with leading 000...0001 is the 7th key , 127=2^7-1 (maybe just a 1/64 coincidence)

2. The puzzle creator writes in the same way that Satoshi Nakamoto writes. For example, after the end of each sentence (period), two spaces follow to start the next sentence. So the creator should be a loyal fan of Satoshi Nakamoto

3. 1: Puzzle was created in 2015, 6 years after the birth of Bitcoin (also in January).  2: The puzzle was created on January 15. The first block of Bitcoin was actually mined on January 9, 01.15 - 01.09, a difference of 6 days.  3: Bitcoin’s 0th block was generated on January 6th 4: God created mankind on the 6th day 5: Bitcoin’s block hash is composed of 6 parts. The first 6 keys of the puzzle are artificially determined.  6: Bitcoin is recommended to ensure security after 1 hour, that is, 6 blocks of confirmation (this is far-fetched). There may be some magic in the number 6, or it may just be a coincidence,Or maybe the answer to the puzzle is also related to 6, of course this is just a hypothesis.

4. The creator of the puzzle said that he is very busy, but with so much wealth, he is still busy enough to show that he is a full-fledged Bitcoin enthusiast

5. The creator saw the reply from "sabbybibi" at least on April 5th (because he generated the corresponding bitcoin wallet on April 5th), which is only 20 days apart, so the creator should be very concerned about bitcointalk.

To sum up, I think it is more likely that the creator used a specific symbol or sentence to generate the seed, and used this seed to generate all the keys. The deterministic wallet used should be type-1 and the algorithm is limited. So for people like me who don’t have enough computing resources, I will think more about the specific seed and deterministic wallet algorithms used by the creators.

I hope more people can contribute this convenient idea, I think this may also be a way to solve the puzzle.

Finally, I hope you can forgive me for my poor English expression skills.

to find it is a question of time.
current status, left hand does not know what rigth hand did.
4 so called pools on it.
lot of wasted hash, no datasheet to compare already searched ranges..

[/quote]

The 120, 125 and 130 was the same person. However, there must be a reason why the 67 does not have PubK and the 125 and 130 do not have PrivK. Your discoveries would be almost instantaneous if this information existed. Does anyone believe that 67 is available to anyone? more than 500 thousand dollars? just with the address we drop to 50mk/s which will take years to get there and with bsgs it was minutes  then we don't have PubKey and the available range is huge already for no one to get there
But these puzzles to capture something are still interesting...that's a truth told by Alberto. But don't dream my friends... don't dream (the 67 has the privKey between 17 and 18 characters) do you have fast machines to get it quickly in Address Mode? Huh I don't have 50mk/s
But whoever is lucky enough to meet you, don't be afraid of robots, but also don't have the ambition to win everything and be prepared to lose almost everything. If possible, pay network commissions of up to 5 BTC and only earn 1. This is if the network allows such commission values, but always start very HIGH on the commission. You managed to find the key and if it's not for you, it won't be for the robots. Is anyone going to lose 5 BTC, either you or the "robots" with RBF  Greetings to everyone and open your eyes
[/quote]

The only fact he was able to crack the 3 Puzzles is just mind blowing. There must be more to it!!