Block #319,509

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 1:45:28 AM · Difficulty 10.1702 · 6,490,650 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4d27e6a9cb0bcdb02652149995f6440eca49a7624fd4bab60c544db36e9dcb4d

Height

#319,509

Difficulty

10.170154

Transactions

1

Size

1.04 KB

Version

2

Bits

0a2b8f3d

Nonce

1,646

Timestamp

12/19/2013, 1:45:28 AM

Confirmations

6,490,650

Merkle Root

72a8a5190c88a29487b4923500f35e9c13afe3be6c448097cdf9e792dd223c8c
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.

3.208 × 10⁹³(94-digit number)
32082853455408688724…81450710999471910401
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
3.208 × 10⁹³(94-digit number)
32082853455408688724…81450710999471910401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.416 × 10⁹³(94-digit number)
64165706910817377448…62901421998943820801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.283 × 10⁹⁴(95-digit number)
12833141382163475489…25802843997887641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.566 × 10⁹⁴(95-digit number)
25666282764326950979…51605687995775283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.133 × 10⁹⁴(95-digit number)
51332565528653901958…03211375991550566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.026 × 10⁹⁵(96-digit number)
10266513105730780391…06422751983101132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.053 × 10⁹⁵(96-digit number)
20533026211461560783…12845503966202265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.106 × 10⁹⁵(96-digit number)
41066052422923121567…25691007932404531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.213 × 10⁹⁵(96-digit number)
82132104845846243134…51382015864809062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.642 × 10⁹⁶(97-digit number)
16426420969169248626…02764031729618124801
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,725,338 XPM·at block #6,810,158 · 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