Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it

Quote from: 7^k*G on April 23, 2025, 12:24:36 PM

Quote from: mcdouglasx on April 23, 2025, 09:06:14 AM

Another test simulating mining, infinite possibilities and solutions.

your method does not guarantee a 100% match. the algorithm does not iterate hashes inside subblocks starting from matching the first bits to the block boundary. with a difficult of 16 bits (as in the example) for some reason you are sure that the prefix will not be repeated in less than 5000 steps, and this is not a correct assumption. two prefixes can go either one after another or not repeat for a large number of iterations. If you are unlucky, you will go through the entire 68th range and will not find the desired hash.

lol, Do you know what probabilistic means? Did you even touch the script? Clearly, both achieve the objective 100% of the time.

Simulation 999:
  Sequential: Checks = 47447 | Time = 1.0510s | Success = True
~~Prefix:~~ Prefix: Checks = 55398 | Time = 1.9224s | Success = True
  Winner: Sequential

Simulation 1000:
  Sequential: Checks = 4381 | Time = 0.3199s | Success = True
~~Prefix:~~ Prefix: Checks = 3008 | Time = 0.2589s | Success = True

Quote from: kTimesG on April 23, 2025, 12:46:44 PM

Presenting the Scooby Doo method

... also called "Where are you? Whoo Whoo!" - because we all love animals inhere: from kangaroos to cats writing better code then most here, when walking over our keyboard.

Besides, we all have something in common: we don't know where Scooby is! I mean, the random key... uhm.

Prerequisites:

1. Clone any of the prefix theory magic scripts, in whatever language you wish.
2. Make sure the programming language is not rigged (what can we even trust these days, right? Even the AI became unreliable when writing high quality enterprise-level code).
3. Patch the bastard:

Code:

>>> Remove this!
            if not found_prefix and h.startswith(prefix_hash):
>>> Replace with this:            
            if random.randint(0, 5000) == 0:    // critical magic update

4. Run and watch the magic happen! Wins wins wins WINS !!!11

The Scooby Doo method relies on the following optimizations:

- replaces deprecated prefix search with a better heuristic method - efficiency, baby!
- removes reliance on any pre-existing useless information, such as "what are we even looking for anyway?"
- finds stuff faster! Why? Who are you, the police? It just works.
- leaves any sequential method far behind. Let's get rid of that sucker and switch to the Scooby Doo method TODAT!

Caveats and known issues

1. Please don't show this to your math teacher - they may lose their night's sleep trying to figure out if you broke reality.

2. It is forbidden to shuffle the block order when comparing the Scooby Doo method with other methods.

3. If you are comparing the Scooby Doo method with any other method - please make sure to use the same block order, so that we have a fair comparison of the same initial conditions.

4. Do not dare to ever disclose the Scooby Doo method to a statistician. They will terrorize you with all sorts of graphs showing cumulative probabilities, survival functions integration areas, and all sorts of voodoo that no one who cares about their mental sanity would ever understand.

Disclaimer

The Scooby Doo method might be dangerous and present a high risk factor of working slower than expected in some circumstances, but life is dangerous anyway.

Using the Scooby Doo method is not a cryptographical advice. Use at your own discretion.

Wonderful technical application, congratulations! It will be very useful for the thread.