Please read the following table in HTML format from a webpage and then answer the question in detail according to the table. Each table cell is defined by a <td> and a </td> tag. Each table row starts with a <tr> and ends with a </tr> tag. 'rowspan=m' and 'colspan=n' represents a cell spaning over 'm' rows and 'n' columns.

Webpage title:
PrimeGrid
Table title:
Projects
Table:
<table id='hittask' contenteditable='False'>
<tr> <th colspan=1 rowspan=1 > Project </th><th colspan=1 rowspan=1 > Active sieve project? </th><th colspan=1 rowspan=1 > Active LLR project? </th><th colspan=1 rowspan=1 > Start </th><th colspan=1 rowspan=1 > End </th><th colspan=1 rowspan=1 > Best result </th></tr>
<tr> <td colspan=1 rowspan=1 > 321 Prime Search (primes of the form 3×2n±1) </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 30 June 2008 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 3×211895718-1, largest prime found in the 321 Prime Search project </td></tr>
<tr> <td colspan=1 rowspan=1 > AP26 Search (Arithmetic progression of 26 primes) </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > 27 December 2008 </td><td colspan=1 rowspan=1 > 12 April 2010 </td><td colspan=1 rowspan=1 > 43142746595714191 + 23681770×23#×n, n = 0...25 (AP26) </td></tr>
<tr> <td colspan=1 rowspan=1 > AP27 Search (Arithmetic progression of 27 primes) </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > 20 September 2016 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > N/A </td></tr>
<tr> <td colspan=1 rowspan=1 > Generalized Fermat Prime Search (active: n = 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304 inactive: n = 8192, 16384) </td><td colspan=1 rowspan=1 > Yes (manual sieving) </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > January 2012 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 9194441048576+1, largest known Generalized Fermat prime </td></tr>
<tr> <td colspan=1 rowspan=1 > Cullen Prime Search </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > August 2007 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 6679881×26679881+1, largest known Cullen prime </td></tr>
<tr> <td colspan=1 rowspan=1 > Message7 </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > 12 June 2005 </td><td colspan=1 rowspan=1 > August 2005 </td><td colspan=1 rowspan=1 > PerlBOINC testing successful </td></tr>
<tr> <td colspan=1 rowspan=1 > Prime Sierpinski Problem </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 10 July 2008 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > N/A </td></tr>
<tr> <td colspan=1 rowspan=1 > Extended Sierpinski Problem </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 7 June 2014 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 161041×27107964+1, largest and only prime found in the Extended Sierpinski Problem </td></tr>
<tr> <td colspan=1 rowspan=1 > PrimeGen </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > March 2006 </td><td colspan=1 rowspan=1 > February 2008 </td><td colspan=1 rowspan=1 > N/A </td></tr>
<tr> <td colspan=1 rowspan=1 > Proth Prime Search </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 29 February 2008 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 7×25775996+1 </td></tr>
<tr> <td colspan=1 rowspan=1 > Riesel Problem </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > March 2010 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 502573×27181987-1, largest prime found in the Riesel problem </td></tr>
<tr> <td class="highlighted"  colspan=1 rowspan=1 > RSA-640 </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > August 2005 </td><td class="highlighted"  colspan=1 rowspan=1 > November 2005 </td><td colspan=1 rowspan=1 > N/A </td></tr>
<tr> <td class="highlighted"  colspan=1 rowspan=1 > RSA-768 </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > N/A </td><td class="highlighted"  colspan=1 rowspan=1 > November 2005 </td><td colspan=1 rowspan=1 > March 2006 </td><td colspan=1 rowspan=1 > N/A </td></tr>
<tr> <td colspan=1 rowspan=1 > Seventeen or Bust </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 31 January 2010 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 10223 ×2 31172165+1 </td></tr>
<tr> <td colspan=1 rowspan=1 > Sierpinski/Riesel Base 5 Problem </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 14 June 2013 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 301562×52408646−1, largest prime found in the Sierpinski/Riesel Base 5 Problem </td></tr>
<tr> <td colspan=1 rowspan=1 > Sophie Germain Prime Search </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 16 August 2009 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 2618163402417×21290000-1 (2p-1 = 2618163402417×21290001-1), the world record Sophie Germain prime </td></tr>
<tr> <td colspan=1 rowspan=1 > Twin prime Search </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > N/A </td><td colspan=1 rowspan=1 > 26 November 2006 </td><td colspan=1 rowspan=1 > 25 July 2009 </td><td colspan=1 rowspan=1 > 65516468355×2333333±1 </td></tr>
<tr> <td colspan=1 rowspan=1 > Woodall Prime Search </td><td colspan=1 rowspan=1 > No </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > July 2007 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > 3752948×23752948−1, largest known Woodall prime </td></tr>
<tr> <td colspan=1 rowspan=1 > Generalized Cullen/Woodall Prime Search </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > Yes </td><td colspan=1 rowspan=1 > 22 October 2016 </td><td colspan=1 rowspan=1 > Ongoing </td><td colspan=1 rowspan=1 > N/A </td></tr>
</table>
Question:
When was the RSA-640 project finished and what was the next project?
Answer:
After RSA-640 was ended in November 2005, the project was moved on to RSA-768.