Hello I am Abhijith Reddy a 3rd year undergrad student from India and my idea for this year's GSOC is to implement an efficient prime factorization (large numbers) class that could be integrated into the Math and numerics library of Boost. I have been working on this since 2-3 months as i am currently doing a project on it, so i already have most of the code however its written in a different language(PIKE) since it supports bigint (uses GMP). So for this project I have to implement my own mini bigint class as well. This class will be relatively smaller compared to any full fledged bigint libraries since the numbers dealt here are relatively small (less than 50 digits) and always positive, so complex algorithms used in normal bigint libraries like (karatsuba,fft based multiplication) can be avoided. So i want to know the scope of this project and any other tips/suggestions would be helpful. Thank you