Bitcoin puzzle transaction ~32 BTC prize to who solves it

[bibilgin]

Then why waste time doing it?
I was thinking of raising up your inexistent merit from zero to 1 for "I am no longer sharing any ideas or thoughts here.". That's a good decision after 233 zero-valued posts! But then I remembered how it's impossible for you to ever admit your mistakes.

Hope the other 135 people are aware that their fascist leader can't count bits properly, while calling everyone else (who haven't yet ignored him) as AI disfunctional idiots.

Aren't you? An old boy trying to apologize. lol

Are you talking to me? Have you improved yourself that much? ) Were you using artificial intelligence 5.0?

Now your lover is waiting. (GPT) Don't answer me without asking him.

Attention other friends.!!

Your knowledge about prefixes is really weak. I recommend you to do research on how to improve this.
To those who don't believe my idea here, I say HODRİ MEYDAN.
Does anyone have more and closer h160s than me?
I know the answer, no.

I am writing the ones that are close for example. Compare your own h160.

f6f5431d25bbf7ebf2d652ebdd4706567468968b
f6f5431d25bbf7c73fc6ba422e2c9384944e01e5
f6f5431d25bbf7c2c1a542f87f2b4c6fcd994ce9
f6f5431d25bbf7383f07a040f6089a59d4d725e2
f6f5431d25bbf71fe311d2d4b68fe67f315466a8
f6f5431d25bbf702bafee0413954bfe84354863a
...

[Dragon914421]

I am writing the ones that are close for example. Compare your own h160.

f6f5431d25bbf7ebf2d652ebdd4706567468968b
f6f5431d25bbf7c73fc6ba422e2c9384944e01e5
f6f5431d25bbf7c2c1a542f87f2b4c6fcd994ce9
f6f5431d25bbf7383f07a040f6089a59d4d725e2
f6f5431d25bbf71fe311d2d4b68fe67f315466a8
f6f5431d25bbf702bafee0413954bfe84354863a
...

Sorry for my very noob question, you posted 4 of these a few days back, do you have the private keys of it or generating these h160s by shifting some bits.
Thanks, i just need to understand, if possible kindly share the wif of any two of those.

[mjojo]

Then why waste time doing it?
I was thinking of raising up your inexistent merit from zero to 1 for "I am no longer sharing any ideas or thoughts here.". That's a good decision after 233 zero-valued posts! But then I remembered how it's impossible for you to ever admit your mistakes.

Hope the other 135 people are aware that their fascist leader can't count bits properly, while calling everyone else (who haven't yet ignored him) as AI disfunctional idiots.

Aren't you? An old boy trying to apologize. lol

Are you talking to me? Have you improved yourself that much? ) Were you using artificial intelligence 5.0?

Now your lover is waiting. (GPT) Don't answer me without asking him.

Attention other friends.!!

Your knowledge about prefixes is really weak. I recommend you to do research on how to improve this.
To those who don't believe my idea here, I say HODRİ MEYDAN.
Does anyone have more and closer h160s than me?
I know the answer, no.

I am writing the ones that are close for example. Compare your own h160.

f6f5431d25bbf7ebf2d652ebdd4706567468968b
f6f5431d25bbf7c73fc6ba422e2c9384944e01e5
f6f5431d25bbf7c2c1a542f87f2b4c6fcd994ce9
f6f5431d25bbf7383f07a040f6089a59d4d725e2
f6f5431d25bbf71fe311d2d4b68fe67f315466a8
f6f5431d25bbf702bafee0413954bfe84354863a
...

both of you is same toxic.. rude and arrogance. you can say that if you already found the puzzle with your method.

[HABJo12]

Please leave personal issue lets fight on our basic issue like hex, Bit, Bytes, WIF , Hash160 using the compressed hash160 which is f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8 is i think more wise thing as a target it will deduct a few load on our device as my pc is core i3 it helped me if you find it good opetion  here is my code

import ecdsa
from ecdsa import SECP256k1
import hashlib
import time
import random
import os
from datetime import datetime

start_hex = "794B37D30000000000"
end_hex = "794B37D3FFFFFFFFFF"
target_hash160 = "f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8".lower()

start_int = int(start_hex, 16)
end_int = int(end_hex, 16)
range_size = end_int - start_int


desktop = os.path.join(os.path.expanduser("~"), "Desktop")
output_file = os.path.join(desktop, "found_keys.txt")

def hex_to_compressed_hash160(hex_value):
   
    priv_key = hex_value.to_bytes(32, byteorder='big')
   
   
    sk = ecdsa.SigningKey.from_string(priv_key, curve=SECP256k1)
    vk = sk.get_verifying_key()
   
   
    if vk.pubkey.point.y() & 1:
        pub_key_compressed = bytes([0x03]) + vk.pubkey.point.x().to_bytes(32, byteorder='big')
    else:
        pub_key_compressed = bytes([0x02]) + vk.pubkey.point.x().to_bytes(32, byteorder='big')
   
   
    sha256 = hashlib.sha256(pub_key_compressed).digest()
    ripemd160 = hashlib.new('ripemd160')
    ripemd160.update(sha256)
    hash160 = ripemd160.hexdigest()
   
    return pub_key_compressed.hex(), hash160

def save_found_key(private_hex, pub_key, hash160, keys_checked, elapsed_time):
   
    with open(output_file, "a") as f:
        timestamp = datetime.now().strftime("%Y-%m-%d %H:%M:%S")
        f.write("\n" + "="*70 + "\n")
        f.write(f"BITCOIN PRIVATE KEY FOUND - {timestamp}\n")
        f.write("="*70 + "\n")
        f.write(f"Private Key (HEX): {private_hex}\n")
        f.write(f"Private Key (DEC): {int(private_hex, 16)}\n")
        f.write(f"Compressed Public Key: {pub_key}\n")
        f.write(f"Hash160: {hash160}\n")
        f.write("\nAdditional Info:\n")
        f.write(f"Total Keys Checked: {keys_checked:,}\n")
        f.write(f"Search Time: {elapsed_time:.2f} seconds\n")
        f.write(f"Speed: {keys_checked/elapsed_time:,.0f} keys/sec\n")
        f.write("="*70 + "\n\n")

def print_match_info(keys_checked, current_hex, elapsed_time, pub_key, hash160, match_len):
   
    print("\n" + "-"*70)
    print(f"New best partial match found:")
    print(f"Matching characters: {match_len}")
    print(f"Private Key: {current_hex}")
    print(f"Public Key: {pub_key[:20]}...{pub_key[-20:]}")
    print(f"Hash160: {hash160}")
    print(f"Total Keys Checked: {keys_checked:,}")
    print(f"Elapsed Time: {elapsed_time:.2f} seconds")
    print(f"Speed: {keys_checked/elapsed_time:,.0f} keys/sec")
    print("-"*70 + "\n")


with open(output_file, "w") as f:
    f.write("Bitcoin Private Key Search Log\n")
    f.write(f"Start Time: {datetime.now().strftime('%Y-%m-%d %H:%M:%S')}\n")
    f.write(f"Search Range: {start_hex} to {end_hex}\n")
    f.write(f"Target Hash160: {target_hash160}\n")
    f.write("="*70 + "\n\n")


best_match_len = 0
best_match_private = ""
best_match_hash160 = ""
start_time = time.time()
keys_checked = 0
last_pub_key = ""
last_hash160 = ""
current_hex = ""

# Main loop
print(f"\n{' BITCOIN PRIVATE KEY SCANNER ':=^70}")
print(f"{'Random Search Mode':^70}")
print(f"{'='*70}")
print(f"Search Range: {start_hex} to {end_hex}")
print(f"Target Hash160: {target_hash160}")
print(f"Output File: {output_file}")
print(f"{'='*70}\n")

try:
    while True:
       
        random_int = random.randint(start_int, end_int)
        current_hex = format(random_int, 'x').zfill(len(start_hex))
       
       
        pub_key_compressed, hash160 = hex_to_compressed_hash160(random_int)
        keys_checked += 1
        last_pub_key = pub_key_compressed
        last_hash160 = hash160
       
       
        match_len = len(os.path.commonprefix([hash160, target_hash160]))
       
        if match_len == 40: 
            elapsed = time.time() - start_time
            print("\n" + "!"*70)
            print(f"!!! MATCH FOUND AFTER {keys_checked:,} KEYS !!!")
            print(f"Private Key: {current_hex}")
            print(f"Public Key: {pub_key_compressed}")
            print(f"Hash160: {hash160}")
            print(f"Elapsed Time: {elapsed:.2f} seconds")
            print(f"Speed: {keys_checked/elapsed:,.0f} keys/sec")
            print("!"*70)
            save_found_key(current_hex, pub_key_compressed, hash160, keys_checked, elapsed)
            break
        elif match_len >= 5 and match_len > best_match_len:
           
            best_match_len = match_len
            best_match_private = current_hex
            best_match_hash160 = hash160
            elapsed = time.time() - start_time
            print_match_info(keys_checked, current_hex, elapsed, pub_key_compressed, hash160, match_len)

except KeyboardInterrupt:
    elapsed = time.time() - start_time
    print("\n\n" + "-"*70)
    print(f"SCAN INTERRUPTED BY USER")
    print(f"Total Keys Checked: {keys_checked:,}")
    print(f"Elapsed Time: {elapsed:.2f} seconds")
    print(f"Last Private Key: {current_hex}")
    if best_match_len >= 5:
        print(f"Best Partial Match Found:")
        print(f"Matching Characters: {best_match_len}")
        print(f"Private Key: {best_match_private}")
        print(f"Hash160: {best_match_hash160}")
    else:
        print("No partial match of 5 or more characters found.")
    print("-"*70)


elapsed = time.time() - start_time
print("\n\n" + "="*70)
print("SCAN COMPLETE - FINAL STATISTICS")
print("="*70)
print(f"Total Keys Checked: {keys_checked:,}")
print(f"Total Time: {elapsed:.2f} seconds")
print(f"Average Speed: {keys_checked/elapsed:,.0f} keys/sec")
print(f"Last Private Key: {current_hex}")
print(f"Last Public Key: {last_pub_key[:20]}...{last_pub_key[-20:]}")
print(f"Last Hash160: {last_hash160}")
print("="*70)      use the Hex you need on start_hex and  end_hex  also you can modify the target hash160

If this helps buy me a coffee by sending some $ on my BTC address 16qw4VqkxSSfKzguDyVzM68jsWw71yEgP4

[kTimesG]

Sorry for my very noob question, you posted 4 of these a few days back, do you have the private keys of it or generating these h160s by shifting some bits.
Thanks, i just need to understand, if possible kindly share the wif of any two of those.

Please quote properly. Regarding your question, you'll never get any info other than metaphorical BS about finding John. The guy is non-sensing for half a year, even before 67 was solved, bragging about how he would break 67, 68, 69, (and now 71, 72, and so on), all while the puzzles got solved by other people using scaled brute-force attacks (which is the only way to actually crack address puzzles). He also said that he will provide super-important information about his methods after 67 gets solved, but this never happened. His track record on actual skills include: not knowing how to hash a public key; failing to properly count matching bits of two H160 values (since his script was generated by ChatGPT, which is laughable in itself, seeing at what he writes about other's posts), all while continously insulting other users. That also explains his superb acknowledgements from this community (e.g. non-existent, since everyone ignores him directly or indirectly).

[bibilgin]

Sorry for my very noob question, you posted 4 of these a few days back, do you have the private keys of it or generating these h160s by shifting some bits.
Thanks, i just need to understand, if possible kindly share the wif of any two of those.

h160 - Keys are available. (I have hundreds of these.)
There is not just a fixed single calculation.
There is no fixed decimal or bit difference.
I do not want to write anything to anyone from here anymore. Because RESPECT is a very important issue for me. There are many DISRESPECTFUL people.
I am someone who believes that ideas, thoughts, even the worst action should be RESPECTED.

both of you is same toxic.. rude and arrogance. you can say that if you already found the puzzle with your method.

Ask people I don't know on Telegram what kind of personality I am.
My aim is to provide full support and unity.
Sometimes very absurd ideas are discussed. But I don't make fun of them. Because HUMAN is a being that is open to improving itself every day.
Yes, I have strict rules. If there is no RESPECT, there is no community. You cannot create a community with a person who is DISRESPECTFUL.


A few notes,

- I think WP 71. stopped looking for wallets.

We had good memories with WP. Sometimes we argued.. We even did a small test with him. He found 1 1PWo3JeB9j prefix.

- We had a conversation about this with a few people I don't know. Did they have a problem with TRUST? (You can ask.)

- I have made a few sincere friends now. Because I didn't write anything wrong to anyone. I didn't say anything bad. I RESPECTED them.

- It's nice to argue or agree with someone. But if it goes beyond the level of argument, DISRESPECT begins. I react to this. (Because don't ask people who don't believe about their beliefs. You'll waste your time.)

[mjojo]

both of you is same toxic.. rude and arrogance. you can say that if you already found the puzzle with your method.

Ask people I don't know on Telegram what kind of personality I am.
My aim is to provide full support and unity.
Sometimes very absurd ideas are discussed. But I don't make fun of them. Because HUMAN is a being that is open to improving itself every day.
Yes, I have strict rules. If there is no RESPECT, there is no community. You cannot create a community with a person who is DISRESPECTFUL.


A few notes,

- I think WP 71. stopped looking for wallets.

We had good memories with WP. Sometimes we argued.. We even did a small test with him. He found 1 1PWo3JeB9j prefix.

- We had a conversation about this with a few people I don't know. Did they have a problem with TRUST? (You can ask.)

- I have made a few sincere friends now. Because I didn't write anything wrong to anyone. I didn't say anything bad. I RESPECTED them.

- It's nice to argue or agree with someone. But if it goes beyond the level of argument, DISRESPECT begins. I react to this. (Because don't ask people who don't believe about their beliefs. You'll waste your time.)

Hi dude when I explain from my perspective about the purpose of prefix finder I didn't mean to offend you, I didn't even mention your name. but your response like hurt person, you become sensitive people and feel if don't agree with you is become your enemy.
once again I dont have problem with you and good luck to you. cheers

[Akito S. M. Hosana]

~~ snippet ~~

You have these options in ecloop by default. There is even an option to have zeros in the middle of the range - like stride (here is offset for example 19bit). Plus it is 2 -3 times faster than Cyclone in HASH160 mode.

https://github.com/vladkens/ecloop

# ./ecloop rnd -f 71.txt -t 12 -o ./BINGO.txt -r 400000000000000000:7fffffffffffffffff  -endo
threads: 12 ~ addr33: 1 ~ addr65: 0 ~ endo: 1 | filter: list (1)
----------------------------------------
[RANDOM MODE] offs: 19 ~ bits: 32

0000000000000000 0000000000000000 0000000000000078 62f0000000024f56
0000000000000000 0000000000000000 0000000000000078 62f7fffffffa4f56
8.86s ~ 68.54 Mkeys/s ~ 0 / 465,567,744 ('p' – pause)

Makefile flags:

Code:

CC_FLAGS ?= -m64 -Ofast -Wall -Wextra -mtune=native \
           -funroll-loops -ftree-vectorize -fstrict-aliasing \
           -fno-semantic-interposition -fvect-cost-model=unlimited \
           -fno-trapping-math -fipa-ra -flto -fassociative-math \
           -mavx2 -mbmi2 -madx -fwrapv \
           -fomit-frame-pointer -fpredictive-commoning -fgcse-sm -fgcse-las \
           -fmodulo-sched -fmodulo-sched-allow-regmoves -funsafe-math-optimizations

I'm having ridiculous speeds with these flags. Fastest CPU s*it out here.

[nomachine]

Makefile flags:

Code:

CC_FLAGS ?= -m64 -Ofast -Wall -Wextra -mtune=native \
           -funroll-loops -ftree-vectorize -fstrict-aliasing \
           -fno-semantic-interposition -fvect-cost-model=unlimited \
           -fno-trapping-math -fipa-ra -flto -fassociative-math \
           -mavx2 -mbmi2 -madx -fwrapv \
           -fomit-frame-pointer -fpredictive-commoning -fgcse-sm -fgcse-las \
           -fmodulo-sched -fmodulo-sched-allow-regmoves -funsafe-math-optimizations

I'm having ridiculous speeds with these flags. Fastest CPU s*it out here.

Carefully monitor the temperature of the processor. I don't know what settings you have in the system.

For example:

sudo tuned-adm profile latency-performance
sudo cpufreq-set -r -g performance

OR

GOVERNOR="performance" in "/etc/init.d/cpufrequtils"

or you have liquorix kernel (MX Linux “ahs”)......

If they are all on unlimited like root in linux - you can burn the processor.

[Frequence]

Then why waste time doing it?
I was thinking of raising up your inexistent merit from zero to 1 for "I am no longer sharing any ideas or thoughts here.". That's a good decision after 233 zero-valued posts! But then I remembered how it's impossible for you to ever admit your mistakes.

Hope the other 135 people are aware that their fascist leader can't count bits properly, while calling everyone else (who haven't yet ignored him) as AI disfunctional idiots.

Aren't you? An old boy trying to apologize. lol

Are you talking to me? Have you improved yourself that much? ) Were you using artificial intelligence 5.0?

Now your lover is waiting. (GPT) Don't answer me without asking him.

Attention other friends.!!

Your knowledge about prefixes is really weak. I recommend you to do research on how to improve this.
To those who don't believe my idea here, I say HODRİ MEYDAN.
Does anyone have more and closer h160s than me?
I know the answer, no.

I am writing the ones that are close for example. Compare your own h160.

f6f5431d25bbf7ebf2d652ebdd4706567468968b
f6f5431d25bbf7c73fc6ba422e2c9384944e01e5
f6f5431d25bbf7c2c1a542f87f2b4c6fcd994ce9
f6f5431d25bbf7383f07a040f6089a59d4d725e2
f6f5431d25bbf71fe311d2d4b68fe67f315466a8
f6f5431d25bbf702bafee0413954bfe84354863a
...

I'm not here to criticize anyone, and sure, anything is possible. But have you actually tested your method on low bit puzzles, or are you just making an attempt?!! Honestlyy, it doesn't seem to make much sense, since it's essentially the same as searching for the key to the puzzle. Try it on low bit puzzles and come back with the results (prove your point of view). I hope you do find something.

[Akito S. M. Hosana]

or you have liquorix kernel (MX Linux “ahs”)......

How do you know I have Mx Linux? 

[nomachine]

or you have liquorix kernel (MX Linux “ahs”)......

How do you know I have Mx Linux? 

Such systems and their kernels are optimized for audio/video processing, delivering the best performance for CPU/GPU usage. However, the issue arises when you run this script with these flags. Similar to launching a mining program. You may experience impressive speed and responsiveness, but the trade-off is excessive heat generation, whether in the GPU or CPU. Speed and heat always go hand in hand. 

[HABJo12]

~~ snippet ~~

You have these options in ecloop by default. There is even an option to have zeros in the middle of the range - like stride (here is offset for example 19bit). Plus it is 2 -3 times faster than Cyclone in HASH160 mode.

https://github.com/vladkens/ecloop

# ./ecloop rnd -f 71.txt -t 12 -o ./BINGO.txt -r 400000000000000000:7fffffffffffffffff  -endo
threads: 12 ~ addr33: 1 ~ addr65: 0 ~ endo: 1 | filter: list (1)
----------------------------------------
[RANDOM MODE] offs: 19 ~ bits: 32

0000000000000000 0000000000000000 0000000000000078 62f0000000024f56
0000000000000000 0000000000000000 0000000000000078 62f7fffffffa4f56
8.86s ~ 68.54 Mkeys/s ~ 0 / 465,567,744 ('p' – pause)

Makefile flags:

Code:

CC_FLAGS ?= -m64 -Ofast -Wall -Wextra -mtune=native \
           -funroll-loops -ftree-vectorize -fstrict-aliasing \
           -fno-semantic-interposition -fvect-cost-model=unlimited \
           -fno-trapping-math -fipa-ra -flto -fassociative-math \
           -mavx2 -mbmi2 -madx -fwrapv \
           -fomit-frame-pointer -fpredictive-commoning -fgcse-sm -fgcse-las \
           -fmodulo-sched -fmodulo-sched-allow-regmoves -funsafe-math-optimizations

I'm having ridiculous speeds with these flags. Fastest CPU s*it out here.

         dear @Akito S. M. Hosana how to fix such error  MINGW64 ~/ecloop
$ ./ecloop rnd -f /home/yohan/ecloop/data/btc-puzzles-hash -o ./found.txt -a c -r 650000000000000000:67ffffffffffffffff -t 2
failed to open /dev/urandom

[cctv5go]

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.

[bibilgin]

Hi dude when I explain from my perspective about the purpose of prefix finder I didn't mean to offend you, I didn't even mention your name. but your response like hurt person, you become sensitive people and feel if don't agree with you is become your enemy.
once again I dont have problem with you and good luck to you. cheers

Hello friend,

I don't have any problems with anyone either.
Actually, what I get angry about is that it is full of people who write such nonsense here or ask very simple questions. Everyone has what they know and what they don't know.
I am disturbed by people who respond to a comment in an EGOIC manner such as DISRESPECTFUL, BElittle, UNKNOWN, IGNORANT etc. etc.

When I see these posts, I either ignore them or write the answer to the question.

Every person's work, work, and thoughts are different. After all, these also reveal ideas. I have been working on encryption algorithms for many years and earning my money this way. I have no respect for anyone who does not respect my area of ​​expertise.

I have no problem with you either. I am the first person to start the prefix topic. It doesn't matter what anyone thinks about prefix. Because I know the work I do and the results.
Good luck to you too, my friend.

I'm not here to criticize anyone, and sure, anything is possible. But have you actually tested your method on low bit puzzles, or are you just making an attempt?!! Honestlyy, it doesn't seem to make much sense, since it's essentially the same as searching for the key to the puzzle. Try it on low bit puzzles and come back with the results (prove your point of view). I hope you do find something.

Yes my friend, I was working on it during the old Zielar, Alberto, JF period. They all left because of betrayal or fake TROL accounts. I left it too.
In July 2024, I discovered something while working on an encryption. Then I focused on it and did my tests. The first test I did was wallet 52. Then wallet 56 etc. etc.

As I said, I'm tired of explaining this to anyone now.
Normally I would explain it in detail after wallet 67. But I gave up on this idea because of some people. Because there are many SELFISH and TRAITORY people among the good people here.

[nomachine]

failed to open /dev/urandom

Windows does not have /dev/urandom. The way random numbers are generated must be changed in the code. Here is the relevant discussion and contact the author:

https://bitcointalk.org/index.php?topic=5544649.0

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.

Even with JeanLucPons' expertise, solving the 71-bit puzzle requires approximately 3,000 GPUs running for months. Or a massive GPU farm, due to the brute-force nature of the search (2⁷¹ keys).

A 1000x faster implementation would still demand 3 GPUs running for months or a custom supercomputer.

This isn’t about miracles. It’s about physics. Even with perfect parallelism, the energy, cost, and time required make it unrealistic without quantum breakthroughs or a flaw in the puzzle’s design (which is not the case here) .

If JeanLuc ever discovers a clever mathematical shortcut, we’d all celebrate.... Until then, it remains a hardware-bound challenge.   

[kTimesG]

Puzzle 71 updates:

- it's simple, we just don't have good code yet (naughty devs hide their 9000x speedups over the best known methods...)
- it doesn't cost, on average, four times the amount of the reward, to break it; it's a deal so good that it shouldn't be missed
- WanderingPhilospher gave up on it (ohnoez... though his strategy remains a mystery as great as the puzzle itself; tried to reproduce it without success)
- CPU tools got better at frying CPUs (this is admirable, since we all know CPUs are meant to run at 100% for centuries, to get to that 0.1% scanned keys out of total keys)
- this thread is definitely not a garbage dump, where self-proclaimed encryption experts can't even handle a simple bit matching count (but claim to be prefix world record holders nevertheless), while reality check is dismissed as "AI non-sense".

[Wanderingaran]

This puzzle is a scam. Let's give it up!

[kTimesG]

Puzzle 71 updates

Damn, sounds like you’ve been grinding harder on excuses than the actual puzzle.  Keep flexing that ‘naughty dev’ talk. Meanwhile, the rest of us are out here turning ‘CPU fryers’ into actual progress. But hey, if prefix world records came with salt, you’d be Michelin-starred. Stay mad, stay bad, and maybe, just maybe, crack a clue instead of a tantrum. 

Not really. I honestly don't care about address puzzles, because of this reason:

There is no incremental progress to speak of. Every time you hash a key, you have the exact same chances of success as before, even if you scanned all keys except the very last two, or if you're just trying for the very first time some random key.

People who don't agree with this are ignorant: they ignore the fact that there was effort already performed. The only thing to track is the scanned regions, but this is not exactly progress. Progress implies that somehow something's better, which is not the case here. It's just economy: you trade time/resources/money with the chance that you might win, or you might lose everything. However, the chances are 4 to 1 not in your favor (every time you pay for hashing a key, you "win" a quarter of your expenses; and that only ever happens after you played millions of dollars). Not a good gamble, lottery is way more profitable if you play it smart (though it's still a losing gamble).

If someone discovers a way that the effort actually improves on anything, then we'd need to rewrite most math books. That's why it's really easy to call BS instantly on some people around here...

[analyticnomad]

Puzzle 71 updates

Damn, sounds like you’ve been grinding harder on excuses than the actual puzzle.  Keep flexing that ‘naughty dev’ talk. Meanwhile, the rest of us are out here turning ‘CPU fryers’ into actual progress. But hey, if prefix world records came with salt, you’d be Michelin-starred. Stay mad, stay bad, and maybe, just maybe, crack a clue instead of a tantrum. 

Not really. I honestly don't care about address puzzles, because of this reason:

There is no incremental progress to speak of. Every time you hash a key, you have the exact same chances of success as before, even if you scanned all keys except the very last two, or if you're just trying for the very first time some random key.

People who don't agree with this are ignorant: they ignore the fact that there was effort already performed. The only thing to track is the scanned regions, but this is not exactly progress. Progress implies that somehow something's better, which is not the case here. It's just economy: you trade time/resources/money with the chance that you might win, or you might lose everything. However, the chances are 4 to 1 not in your favor (every time you pay for hashing a key, you "win" a quarter of your expenses; and that only ever happens after you played millions of dollars). Not a good gamble, lottery is way more profitable if you play it smart (though it's still a losing gamble).

If someone discovers a way that the effort actually improves on anything, then we'd need to rewrite most math books. That's why it's really easy to call BS instantly on some people around here...

"the chances are 4 to 1 not in your favor"

So you're telling me there's a chance?