Block #408,072

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 10:03:36 AM · Difficulty 10.4296 · 6,406,815 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e9479718c66799fef7ec000e293f36e8b8b055435d42f91c76f4d407db022ea

Height

#408,072

Difficulty

10.429586

Transactions

5

Size

1.19 KB

Version

2

Bits

0a6df955

Nonce

164,074

Timestamp

2/17/2014, 10:03:36 AM

Confirmations

6,406,815

Merkle Root

3b2391ceadbae6bc7fd2e2d8072b29418d5447c54f37cde5b0fe1f597514cf96
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.934 × 10¹⁰⁰(101-digit number)
39344928142725229226…60791834440440954881
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.934 × 10¹⁰⁰(101-digit number)
39344928142725229226…60791834440440954881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.868 × 10¹⁰⁰(101-digit number)
78689856285450458452…21583668880881909761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.573 × 10¹⁰¹(102-digit number)
15737971257090091690…43167337761763819521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.147 × 10¹⁰¹(102-digit number)
31475942514180183381…86334675523527639041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.295 × 10¹⁰¹(102-digit number)
62951885028360366762…72669351047055278081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.259 × 10¹⁰²(103-digit number)
12590377005672073352…45338702094110556161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.518 × 10¹⁰²(103-digit number)
25180754011344146704…90677404188221112321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.036 × 10¹⁰²(103-digit number)
50361508022688293409…81354808376442224641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.007 × 10¹⁰³(104-digit number)
10072301604537658681…62709616752884449281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.014 × 10¹⁰³(104-digit number)
20144603209075317363…25419233505768898561
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,184 XPM·at block #6,814,886 · 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