I think I have found a method that simplifies the scanning process. I am trying the range 2^70 - 2^71. If I am successful and solve the puzzle, I will be able to solve higher ranges with significant savings in power.

KEY Start 43........

I think you mean 9359 years. Unless of course the non-n00bz manage to break the hardware limitations via a combination of ideas and proper techniques (the 27th time's the charm) and crack open the lame mathematical limitations of the last 30 years..Or is it maybe of the last 5000 years? Or maybe since forever, and forever?

🚀 ADAPTIVE AI RANGE DEPLOYMENT:
─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────
📦 PRECISION: 717BF1E8E60C65E698 → 717D955714BE2A1968
              Width:  0.01% (118,059,162,071,741,136 keys)
              Surgical precision + AI

📦  BALANCED: 717B2D02DED7C1B1E0 → 717E5A3D1BF2CE4E20
              Width:  0.02% (228,903,190,186,990,656 keys)
              Optimal balance + AI

📦    SAFETY: 7178CB173103783CC0 → 7180BC28C9C717C340
              Width:  0.05% (572,257,975,467,476,608 keys)
              Enhanced safety + AI

📦  COVERAGE: 7174D28E64A1A87980 → 7184B4B19628E78680
              Width:  0.10% (1,144,515,950,934,953,216 keys)
              Maximum coverage + AI

I've been running puzzle 71 with keyhunt-cuda for 3 months and it feels completely hopeless.

Why overcomplicate things? You are talking about a pool. You can just join one.

I created this helper app, it has both the modes, auto or manual/personalized mode. In auto mode it first pick a random number and check if its it is already scanned or not and apply filters, if everything is ok it creates a command and pass it to new cmd and wait for the search to complete. It also has an option to divide the full rane in to multiple parts and search N number of ranges in each parts.

https://postimg.cc/6810xJJL
https://postimg.cc/w79Mg19g

Not possible for a solo user until next few years.
I prefer random search. I am using RTX3060 and Keyhunt-Cuda in a random mode with an helper app. I am using 36 bit search with 9 random prefix. Link contains the ranges I have already scanned, it may not be useful if someone searching with less prefix.

https://drive.google.com/file/d/1zig8usXOQmqRZD5xlSHndNf5RRir-eg2/view?usp=sharing

How is this?
1PWoer2JRPuTkoaeoPj4TpwFpvtRY6bzXU

do you have code simulating the checksum prefix

Click on the link to see the photo

You don't understand how key derivation in BIP32 works and your foolish assumptions that puzzle keys have any dependency from one to another is deeply flawed.

Even though key derivation in deterministic wallets is deterministic, it doesn't mean that you can calculate a sequential key solely from knowledge of its predecessor or successor (or any other key).

In a deterministic wallet all keys appear as if they're random. Period! There is no exploitable relation between individual keys. Masking them down to a certain bitlength doesn't introduce any new relation.

But you can happily continue to read tea leaves...

https://ibb.co/DDQtZnwf
like this

Well, you can always try to solve some easier puzzle, which requires less grinding, at least for now: https://mempool.space/tx/aba3c2ae442aa20150996ee68f9aa4da83b57a4312891078be0c2e68c50b2801

For example, this address: https://mempool.space/address/bc1qzsjnew5qcn75e4cqdsc6r9v8fjy5ensancqmv2l2n82p0q5f5tlsfu3slz

You need to check only 256 transaction hashes on average, to solve it.

Proof of being spendable in testnet4: https://mempool.space/testnet4/address/tb1qzsjnew5qcn75e4cqdsc6r9v8fjy5ensancqmv2l2n82p0q5f5tls758l9d

Of course, rewards from my puzzle are smaller, because I am not that wealthy. But they are also easier to get, at least at the beginning, when nobody is trying to do that yet.

1PWo3JeB9j5asAZX7457hXNUypugyosSfw
f6f5431d25bbe51d5f7633c702ba2608f3163704
Checksum (Hex): 89c9a9c6
Checksum (Decimal): 2311694790
----------------------------------------
1PWo3JeB9j5nh1sKHaudeo82T4GLTXWdyf
f6f5431d25bbe533119c98ad7904b81121ad9631
Checksum (Hex): e135cdce
Checksum (Decimal): 3778399694
----------------------------------------
1PWo3JeB9j6YptaZDx6UaNsmgZRuakjrum
f6f5431d25bbe5840bfb07f2aad41820879502ce
Checksum (Hex): b0793cb8
Checksum (Decimal): 2960735416
----------------------------------------
1PWo3JeB9j6ffmBQZ4tTuWxaByxBvPKVbB
f6f5431d25bbe59099ee9b35fb4a89ac2576371a
Checksum (Hex): 3ef22ffe
Checksum (Decimal): 1056059390
----------------------------------------
1PWo3JeB9jA5WGsbKBo1fsbvZawV81YKgG
f6f5431d25bbe6fb94ccecf0e58b2c8c632e952b
Checksum (Hex): 9d3e02a5
Checksum (Decimal): 2638086821
----------------------------------------
1PWo3JeB9jCVcGHZ8A8RtvvRAuzRYjJ8XM
f6f5431d25bbe7fca2acb33a3eebe9d58992d4c3
Checksum (Hex): bb4fc504
Checksum (Decimal): 3142567172
----------------------------------------
1PWo3JeB9jEJ4Z6LC6f9cKooNViuukaCyG
f6f5431d25bbe8bc47e76e1558ebb52a99986d3d
Checksum (Hex): cd162c23
Checksum (Decimal): 3440782371
----------------------------------------
1PWo3JeB9jEzsR5sR3HcUvfDNP7eQ1cZqv
f6f5431d25bbe9072738674df75ad60e8e6c1e99
Checksum (Hex): eb11a2ad
Checksum (Decimal): 3943801517
----------------------------------------
1PWo3JeB9jFYt1sLaz7QVUpZVHSt1nhP7r
f6f5431d25bbe941e25510cae40bc9c531d13a76
Checksum (Hex): 4fcf19f5
Checksum (Decimal): 1338972661
----------------------------------------
1PWo3JeB9jGBe6DNEAoAmEm12s5qmwhaCj
f6f5431d25bbe985544c01b3b23258960ba70315
Checksum (Hex): bbc8b56c
Checksum (Decimal): 3150493036
----------------------------------------
1PWo3JeB9jH8F1Mor4PbvcqoVwL6DZMp9v
f6f5431d25bbe9e9829ca059af52a2e3d73951b4
Checksum (Hex): 972d9901
Checksum (Decimal): 2536347905
----------------------------------------

P71..  1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU

found 1PWo3JeB9jrGLDTmsp45h1pDXXtb7zisQH

Does anyone have any idea how far apart the two might be (64bit?)

63f651bb9c47645cd6  1PWo3JeB9jdv1SaFoJK7SynTq94JFdbagU +64bit
649a3dd0486c96e70b 1PWo3JeB9jdvp56gzG8navJjUMFQxxb997

If you have 5090 gpu
Can someone explain, for search complete range of 48 bit, how much time by bitcrack or keyhunt etc sequence search ?