I've noticed that most of the posts are concerning the technical difficulties of getting the client up and running.
 I had a look at your white paper and see that your proof of work is based on the idea of prime chains.
 Is there any way that the pow could be manufactured by analysis of tables of existing primes or pseudo primes? (i.e. running verification tests against tables of known primes/ pseudo primes) If so your pow problem would be reduced to the manufacturing of large primes.
 I know the bitcoin SHA 256 is very well researched but I don't know about this prime chain stuff.
 Is your maths expertise good enough to guarantee the security of this?
 I like the idea, hope it works, just have to ask.