I think even if i had two of first HEX numbers i wouldn't be able to solve it anyway.
The remaining search space is 2^(66-2) = 2^64.
It would take approximately 584 years to complete the task in Python.
Well it depends ... There is small luck factor. I can often see people calulating it in a way "how much time it will take to scan the whole range with your currents keys generating speed"... But you can do it randomly or the right key can be close to to point in which you started your search. Anyway it's still incredibly hard to solve 66bit.
I was also wondering what who will be able to solve anything if somehow 66 and 130 will be solved ? Maybe we are already at point where it will take years to wait for faster hardware...