Block #409,642

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 12:37:21 PM · Difficulty 10.4275 · 6,407,166 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
383a3f161dfc7a35b1e9bfdd53fedecdf263ae71be763851b5a730d45fee8669

Height

#409,642

Difficulty

10.427531

Transactions

3

Size

13.21 KB

Version

2

Bits

0a6d72a5

Nonce

10,806

Timestamp

2/18/2014, 12:37:21 PM

Confirmations

6,407,166

Merkle Root

86a69640d70b0c3ab9c7b34a06b675bb8d298b7a190977fdb448c1262144f77c
Transactions (3)
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.171 × 10⁹⁰(91-digit number)
11717780479489766134…51764381784738175041
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.171 × 10⁹⁰(91-digit number)
11717780479489766134…51764381784738175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.343 × 10⁹⁰(91-digit number)
23435560958979532269…03528763569476350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.687 × 10⁹⁰(91-digit number)
46871121917959064538…07057527138952700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.374 × 10⁹⁰(91-digit number)
93742243835918129076…14115054277905400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.874 × 10⁹¹(92-digit number)
18748448767183625815…28230108555810800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.749 × 10⁹¹(92-digit number)
37496897534367251630…56460217111621601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.499 × 10⁹¹(92-digit number)
74993795068734503261…12920434223243202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.499 × 10⁹²(93-digit number)
14998759013746900652…25840868446486405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.999 × 10⁹²(93-digit number)
29997518027493801304…51681736892972810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.999 × 10⁹²(93-digit number)
59995036054987602609…03363473785945620481
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,778,501 XPM·at block #6,816,807 · 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