Implement a factoring mode for finding the largest prime factors for a given number.
The number would be specified by the --start parameter.
This necessitates a number of changes to the network protocol:
Alternatively, the factoring mode would accept a file with a bunch of discovered primes (that are smaller than sqrt(SP), where SP is the semiprime to factor), and would hand out chunks of those primes to clients to test against the number to factor. This requires the changes to RegisterClient or WorkItem as described above, but with the twist that the WorkItem message includes a list of primes to test against SP.
Implement a factoring mode for finding the largest prime factors for a given number.
The number would be specified by the --start parameter.
This necessitates a number of changes to the network protocol:
It would return a type-count-[size,value]+ for the discovered non-factors, and the discovered factor (if any.)
Alternatively, the factoring mode would accept a file with a bunch of discovered primes (that are smaller than sqrt(SP), where SP is the semiprime to factor), and would hand out chunks of those primes to clients to test against the number to factor. This requires the changes to RegisterClient or WorkItem as described above, but with the twist that the WorkItem message includes a list of primes to test against SP.