Hello,

I would be appreciate if someone explain me algorithm primecoin uses.

I’ve red

http://primecoin.org/static/primecoin-paper.pdf

And I have several questions to this document:

"Another important property of proof-of-work for cryptocurrency is non-reusability. That is, the proof-of-work on a particular block should not be reusable for another block. To achieve this, the prime chain is linked to the block header hash by requiring that its origin be divisible by the block header hash. The quotient of the division then becomes the proof-of-work certificate. "

If i run “listprimerecords 11” I get numbers like:

244904970375722028798242559069071350723679913437376658289613677305863972540773149*29

73853903764168979088206401473739410396455001112581722569026969860983656346568919*151

351180085486160447415012448369256040681465106930437599802264494461674068970139256*107

etc.

I assume in that compositions first component is block header hash and second is a number serched by algorithm so a*b+/- 1 is prime and ten next cunningham primes as well.

What I’m curious about is why second component is so small. PrimeCoin has 1GH/sec I assume that it means it is capable of checking primarity of 1E9 primes per second. if It searches for 60 sec to find next chain. Why there is no numbers like:

351180085486160447415012448369256040681465106930437599802264494461674068970139256*[glow=red,2,300]48798379[/glow]

???

Thank you in advance for answer