Alright, after numerous calculations, I've come to the point where I need someone who is interested in puzzle 66 and capable of counting 48 bits within a few minutes. I have a total of 588 ranges for them to work on, with the opportunity to claim the prize of 6.6 BTC. Alternatively, if the author of the puzzle – the one who created this challenge to test the difficulty of increasing bits – has come across my post, I challenge them to assist me in improving my counting speed. I am confident in my ability to crack puzzle 66 in a matter of days.
i am also still trying to use Bit because I see that's the most highest probability of eliminating less likely keys and ranges. I have integrate and complete a whole Python code which I can predetermine the permutations of first 4 digits, skip keys that have a maximum consecutive "0" and "1", setting the weight on "0" and "1". This has eliminated a lot of keys but still, it needs a lot of computation power. I can easily find 30 up to 40 puzzle easily, but when it comes to 66 then headache already. I possibly know how you come out with the 48 bits ranges. Most likely you are trying to run a lower bits of predetermine weight 0 and 1 permutation to get the most likely range, am I correct?