Or even better.... a simplified NSA accelerated study on how to solve any puzzle with key-subtraction.

Yes, let them try this method again

Point X to Start Key
Int startKey;
Point p = checkPoint;// old Point to check hash160
Int k;
k.SetInt32(0);
k.Set(&p.x);
k.ShiftR(190);// 256 - 66
startKey.Set(&k);
printf("\n PointX to Start Key: %s ", startKey.GetBase16().c_str());
I wonder if anyone has done this?