Block #400,438

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 2:29:48 AM · Difficulty 10.4292 · 6,414,536 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7cf6d122668be03933f8817494b1696fc279ab807ee99b656728647dd6cf2de1

Height

#400,438

Difficulty

10.429160

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6ddd67

Nonce

216,574

Timestamp

2/12/2014, 2:29:48 AM

Confirmations

6,414,536

Merkle Root

760a30106b365bcfddbac915241af3bef790b46b4c8a4beef0d313fff7876e31
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.934 × 10¹⁰⁰(101-digit number)
19345738159587133803…98388582294599201161
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.934 × 10¹⁰⁰(101-digit number)
19345738159587133803…98388582294599201161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.869 × 10¹⁰⁰(101-digit number)
38691476319174267607…96777164589198402321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.738 × 10¹⁰⁰(101-digit number)
77382952638348535214…93554329178396804641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.547 × 10¹⁰¹(102-digit number)
15476590527669707042…87108658356793609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.095 × 10¹⁰¹(102-digit number)
30953181055339414085…74217316713587218561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.190 × 10¹⁰¹(102-digit number)
61906362110678828171…48434633427174437121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.238 × 10¹⁰²(103-digit number)
12381272422135765634…96869266854348874241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.476 × 10¹⁰²(103-digit number)
24762544844271531268…93738533708697748481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.952 × 10¹⁰²(103-digit number)
49525089688543062537…87477067417395496961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.905 × 10¹⁰²(103-digit number)
99050179377086125074…74954134834790993921
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,763,878 XPM·at block #6,814,973 · 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