when more memory is used the chances improv greatly. Perhaps you might have some input on the optimal bounds selecting. I am curious if the likelyness of a factor being found is just from experiments or from theory. perhaps using the results file we could see exactly how many smooth factors exist for each range. Perhaps that would be a bettr way or determineing the likelyness of finding a factor instead of theory that is often unreliable when dealing with extreme circumstances as we have here. This isn't a question for prime95 this is for anyone with input. How do the current optimal bounds selectors work?