▁was ▁a ▁test ▁to ▁port ▁the ▁B OIN C ▁sch eduler ▁to ▁Perl ▁to ▁obtain ▁greater ▁port ability . ▁After ▁a ▁while ▁the ▁project ▁attempted ▁the ▁R SA ▁factor ing ▁challenge ▁trying ▁to ▁factor ▁R SA - 6 4 0 . ▁After ▁R SA - 6 4 0 ▁was ▁fact ored ▁by ▁an ▁outside ▁team ▁in ▁November ▁ 2 0 0 5 , ▁the ▁project ▁moved ▁on ▁to ▁R SA - 7 6 8 . ▁With ▁the ▁chance ▁to ▁succeed ▁too ▁small , ▁it ▁disc arded ▁the ▁R SA ▁challeng es , ▁was ▁renamed ▁to ▁Prime Grid , ▁and ▁started ▁generating ▁a ▁list ▁of ▁the ▁first ▁prime ▁numbers . ▁At ▁ 2 1 0 , 0 0 0 , 0 0 0 , 0 0 0 ▁the ▁prim egen ▁sub project ▁was ▁stopped . ▁ ▁In ▁June ▁ 2 0 0 6 , ▁dialog ▁started ▁with ▁R ies el ▁S ieve ▁to ▁bring ▁their ▁project ▁to ▁the ▁B OIN C ▁community . ▁Prime Grid ▁provided ▁Perl B OIN C ▁support ▁and ▁R ies el ▁S ieve ▁was ▁successful ▁in ▁implementing ▁their ▁s ieve ▁as ▁well ▁as ▁a ▁prime ▁finding ▁( LL R ) ▁application . ▁With ▁collaboration ▁from ▁R ies el ▁S ieve , ▁Prime Grid ▁was ▁able ▁to ▁implement ▁the ▁LL R ▁application ▁in ▁partners hip ▁with ▁another ▁prime ▁finding ▁project , ▁T win ▁Prime ▁Search ▁( TP S ). ▁In ▁November ▁ 2 0 0 6 , ▁the ▁T PS ▁LL R ▁application ▁was ▁officially ▁released ▁at ▁Prime Grid . ▁Less