Next scheduled rescrape ... never
Version 1
Last scraped
Scraped on 04/05/2025, 21:52:44 UTC
Quote
When Prefix wins - it wins by a very small margin (by just a few ops ahead)
When Prefix loses - it loses by a very high margin (proportional to range size)
When Prefix loses - it loses by a very high margin (proportional to range size)
Well we are working with very tiny ranges lol...
Quote
Once you freely let go of this constraint - you will notice that both methods act identical, which is the expected thing to happen.
For grins and giggles I will use random starting points (since I am just using 1 block size)Who needs prefixes or straight line sequential order
(2^17 range size, 500 simulations, random checked 4096 consecutive keys then skipped 64, if range was exhausted, it went back to first key skipped and checked them sequentially until key was found)
Code:
Wins:
ScoobyDoo : 0
Prefix : 9
RandomSkip : 482
Ties : 9
Total Checks:
ScoobyDoo : 31597542
Prefix : 31485133
RandomSkip : 31429414
Total Time:
ScoobyDoo : 43.892759 seconds
Prefix : 53.199185 seconds
RandomSkip : 46.203749 seconds
Averages (Total Time / Wins):
ScoobyDoo : inf seconds/victory
Prefix : 5.911021 seconds/victory
RandomSkip : 0.095858 seconds/victory
Checks per Win:
ScoobyDoo : inf checks/win
Prefix : 3,498,348.11 checks/win
RandomSkip : 65,206.25 checks/win
Average Checks per Simulation:
ScoobyDoo : 63,195.08 checks/simulation
Prefix : 62,970.27 checks/simulation
RandomSkip : 62,858.83 checks/simulation
Ok, 2^17 range size, 500 simulations, each method started from a random point inside the range, if key not found it went to whatever keys were not checked, and started checking those.
Code:
Wins:
ScoobyDoo : 133
Prefix : 241
RandomSkip : 126
Ties : 0
Total Checks:
ScoobyDoo : 31775601
Prefix : 22520018
RandomSkip : 32676939
Total Time:
ScoobyDoo : 45.047694 seconds
Prefix : 42.106104 seconds
RandomSkip : 49.145924 seconds
Averages (Total Time / Wins):
ScoobyDoo : 0.338704 seconds/victory
Prefix : 0.174714 seconds/victory
RandomSkip : 0.390047 seconds/victory
Checks per Win:
ScoobyDoo : 238,914.29 checks/win
Prefix : 93,444.06 checks/win
RandomSkip : 259,340.79 checks/win
Average Checks per Simulation:
ScoobyDoo : 63,551.20 checks/simulation
Prefix : 45,040.04 checks/simulation
RandomSkip : 65,353.88 checks/simulation
Prefix whooped some azzzzz....
Simulation 5000: Scooby_Doo = 87634 checks in 0.406732s | Prefix = 70515 checks in 0.261866s
=== FINAL RESULTS ===
Wins:
Scooby_Doo: 2423
Prefix: 2379
Ties: 198
Total Checks:
Scooby_Doo: 248193832
Prefix: 251283717
Total Time:
Scooby_Doo: 1133.652252 seconds
Prefix: 949.231911 seconds
Averages (Total Time / Wins):
Scooby_Doo : 0.467871 seconds/victory
Prefix : 0.399005 seconds/victory
Checks per Win:
Scooby_Doo : 102432.45 checks/win
Prefix : 105625.77 checks/win
Original archived Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Scraped on 27/04/2025, 21:52:27 UTC
Quote
When Prefix wins - it wins by a very small margin (by just a few ops ahead)
When Prefix loses - it loses by a very high margin (proportional to range size)
When Prefix loses - it loses by a very high margin (proportional to range size)
Well we are working with very tiny ranges lol...
Quote
Once you freely let go of this constraint - you will notice that both methods act identical, which is the expected thing to happen.
For grins and giggles I will use random starting points (since I am just using 1 block size)Who needs prefixes or straight line sequential order
(2^17 range size, 500 simulations, random checked 4096 consecutive keys then skipped 64, if range was exhausted, it went back to first key skipped and checked them sequentially until key was found)
Code:
=== FINAL RESULTS (Sequential, Full Range) ===
Wins:
ScoobyDoo : 0
Prefix : 9
RandomSkip : 482
Ties : 9
Total Checks:
ScoobyDoo : 31597542
Prefix : 31485133
RandomSkip : 31429414
Total Time:
ScoobyDoo : 43.892759 seconds
Prefix : 53.199185 seconds
RandomSkip : 46.203749 seconds
Averages (Total Time / Wins):
ScoobyDoo : inf seconds/victory
Prefix : 5.911021 seconds/victory
RandomSkip : 0.095858 seconds/victory
Checks per Win:
ScoobyDoo : inf checks/win
Prefix : 3,498,348.11 checks/win
RandomSkip : 65,206.25 checks/win
Average Checks per Simulation:
ScoobyDoo : 63,195.08 checks/simulation
Prefix : 62,970.27 checks/simulation
RandomSkip : 62,858.83 checks/simulation
Ok, 2^17 range size, 500 simulations, each method started from a random point inside the range, if key not found it went to whatever keys were not checked, and started checking those.
Code:
=== FINAL RESULTS (Sequential, Full Range with Random Starts) ===
Wins:
ScoobyDoo : 133
Prefix : 241
RandomSkip : 126
Ties : 0
Total Checks:
ScoobyDoo : 31775601
Prefix : 22520018
RandomSkip : 32676939
Total Time:
ScoobyDoo : 45.047694 seconds
Prefix : 42.106104 seconds
RandomSkip : 49.145924 seconds
Averages (Total Time / Wins):
ScoobyDoo : 0.338704 seconds/victory
Prefix : 0.174714 seconds/victory
RandomSkip : 0.390047 seconds/victory
Checks per Win:
ScoobyDoo : 238,914.29 checks/win
Prefix : 93,444.06 checks/win
RandomSkip : 259,340.79 checks/win
Average Checks per Simulation:
ScoobyDoo : 63,551.20 checks/simulation
Prefix : 45,040.04 checks/simulation
RandomSkip : 65,353.88 checks/simulation
Prefix whooped some azzzzz....
Simulation 5000: Scooby_Doo = 87634 checks in 0.406732s | Prefix = 70515 checks in 0.261866s
=== FINAL RESULTS ===
Wins:
Scooby_Doo: 2423
Prefix: 2379
Ties: 198
Total Checks:
Scooby_Doo: 248193832
Prefix: 251283717
Total Time:
Scooby_Doo: 1133.652252 seconds
Prefix: 949.231911 seconds
Averages (Total Time / Wins):
Scooby_Doo : 0.467871 seconds/victory
Prefix : 0.399005 seconds/victory
Checks per Win:
Scooby_Doo : 102432.45 checks/win
Prefix : 105625.77 checks/win