Sieve program PcpSieve

Our program generates random PCPs of a specified class and try to solve them. There are several commandline parameters: pcp_size stands for the size of a problem class. pcp_width is the length limitation of the words. sieve_size and sieve_length bound the solution algorithm. sieve_size = 10000 corresponds approximatly to 10 MB main memory and with sieve_length = 500 we reach a maximum depth of 500 in the bread-first search. You can increment this values if your computer system has sufficient (real) main memory (RAM). In such a case the program may find longer candidates, but consumes more CPU time and RAM space.

example: PcpSieve 3 3 10000 500

The source of the sieve program can be found here. Of course there are also some binaries:

Record candidates

The output of the sieve program is almost unreadable by human. The perl script PcpSieve.pl runs the sieve, filters out interesting candidates and send them via mail(1) to us. You should edit the first lines of the script to configure it for your purposes. If perl isn't available or if you don't want to use it (... I prise that ;-), you can catch the output of PcpSieve and grep(1) for candidates. Send them with your name and the used architecture (uname -a) to us. Please send only candidates that shortest solution lengths are greater than our records.