As I understand it, you have developed a p-1/ecm program that deals with 4 million bit proth numbers (k*2^n+1, k small). Is there any chance of writing a version for Reisel numbers (k*2^n-1). I am sure it would be very useful to others. I think it would be useful to us at 3*2^n-1 search over at:
http://www.mersenneforum.org/

Does your current program do all large Proth numbers (k small)?

Is the source available?