Block #320,550

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 5:31:59 PM · Difficulty 10.1856 · 6,493,925 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1854885cb7172a29f1639a00ed36e9524eecb94509a5a8432ab4d5a6bec501a2

Height

#320,550

Difficulty

10.185563

Transactions

16

Size

4.93 KB

Version

2

Bits

0a2f8109

Nonce

29,645

Timestamp

12/19/2013, 5:31:59 PM

Confirmations

6,493,925

Merkle Root

6af9235ebde7e3a859cc058972f9afa8f386ad4a2ccb04210169818c1be071da
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.

1.203 × 10⁹¹(92-digit number)
12037353192616352858…29162439205869318241
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
1.203 × 10⁹¹(92-digit number)
12037353192616352858…29162439205869318241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.407 × 10⁹¹(92-digit number)
24074706385232705716…58324878411738636481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.814 × 10⁹¹(92-digit number)
48149412770465411433…16649756823477272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.629 × 10⁹¹(92-digit number)
96298825540930822867…33299513646954545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.925 × 10⁹²(93-digit number)
19259765108186164573…66599027293909091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.851 × 10⁹²(93-digit number)
38519530216372329146…33198054587818183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.703 × 10⁹²(93-digit number)
77039060432744658293…66396109175636367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.540 × 10⁹³(94-digit number)
15407812086548931658…32792218351272734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.081 × 10⁹³(94-digit number)
30815624173097863317…65584436702545469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.163 × 10⁹³(94-digit number)
61631248346195726634…31168873405090938881
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,759,875 XPM·at block #6,814,474 · 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.
Privacy Policy·

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