Block #135,641
2CCLength 9★☆☆☆☆Cunningham Chain of the Second Kind · Discovered 8/26/2013, 6:05:25 PM · Difficulty 9.8118 · 6,673,861 confirmations
A sequence where each prime is double the previous prime minus one.
Height
#135,641
Difficulty
9.811803
Transactions
3
Size
648 B
Version
2
Bits
09cfd251
Nonce
51,845
Timestamp
8/26/2013, 6:05:25 PM
Confirmations
6,673,861
Mined by
Merkle Root
This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.
These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.
What this block proved
The miner who found this block proved the existence of 9 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.
Found in most blocks. The baseline for Primecoin's proof-of-work.
Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.
This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula: