Hacker News new | past | comments | ask | show | jobs | submit login

Not for the sort of technology we have today using the best known algorithm. The approach relies on the idea of sieving. Sieving takes a lot of memory. As an example, the most recent 829 bit factoring record used multi GB for each processor during the parallel phase and 1.5 TB for the final matrix reduction phase. Neither phase would really get much out of a bunch of processors attached to just a few GB.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: