proth20 can only be used for k*2^n+1. In other words b = 2 and c = +1. Hopefully Yves will extend that to other bases and c = 1 in the near future.
My experience is that it is slower than pfgw, but I haven't run it with many different values of n to see how it scales as n increases.
