Block #312,696

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 3:32:31 AM · Difficulty 9.9959 · 6,494,438 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
1c362a04343038b699b88722289585bb445255bdee4faf38233af7d45e55e31c

Height

#312,696

Difficulty

9.995890

Transactions

1

Size

1.15 KB

Version

2

Bits

09fef2a4

Nonce

16,950

Timestamp

12/15/2013, 3:32:31 AM

Confirmations

6,494,438

Merkle Root

9f527c9b38623ef23da2c705214392f8a835867d382d66e73b95e4fc8b5c7b8c
Prime Chain Origin

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.

2.452 × 10⁹⁵(96-digit number)
24525860914790902932…05890227947140817921
Discovered Prime Numbers
p_k = 2^k × origin + 1

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.

1
origin + 1
2.452 × 10⁹⁵(96-digit number)
24525860914790902932…05890227947140817921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.905 × 10⁹⁵(96-digit number)
49051721829581805865…11780455894281635841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.810 × 10⁹⁵(96-digit number)
98103443659163611731…23560911788563271681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.962 × 10⁹⁶(97-digit number)
19620688731832722346…47121823577126543361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.924 × 10⁹⁶(97-digit number)
39241377463665444692…94243647154253086721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.848 × 10⁹⁶(97-digit number)
78482754927330889384…88487294308506173441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.569 × 10⁹⁷(98-digit number)
15696550985466177876…76974588617012346881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.139 × 10⁹⁷(98-digit number)
31393101970932355753…53949177234024693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.278 × 10⁹⁷(98-digit number)
62786203941864711507…07898354468049387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.255 × 10⁹⁸(99-digit number)
12557240788372942301…15796708936098775041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

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.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

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:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,701,177 XPM·at block #6,807,133 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy