Block #439,210

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 12:57:38 PM · Difficulty 10.3593 · 6,375,819 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0803e6ebeb4ebde735cfec3023dfb9d8d1a30cc330c3235a25218c75be502ca9

Height

#439,210

Difficulty

10.359268

Transactions

11

Size

4.25 KB

Version

2

Bits

0a5bf8f9

Nonce

272,503

Timestamp

3/11/2014, 12:57:38 PM

Confirmations

6,375,819

Merkle Root

45ad5078377ababea1f1ca7767fd1f65c419879363d6aed242c446202ca1131d
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.

2.455 × 10¹⁰²(103-digit number)
24552020677160505932…67869572880485200881
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
2.455 × 10¹⁰²(103-digit number)
24552020677160505932…67869572880485200881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.910 × 10¹⁰²(103-digit number)
49104041354321011864…35739145760970401761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.820 × 10¹⁰²(103-digit number)
98208082708642023728…71478291521940803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.964 × 10¹⁰³(104-digit number)
19641616541728404745…42956583043881607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.928 × 10¹⁰³(104-digit number)
39283233083456809491…85913166087763214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.856 × 10¹⁰³(104-digit number)
78566466166913618982…71826332175526428161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.571 × 10¹⁰⁴(105-digit number)
15713293233382723796…43652664351052856321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.142 × 10¹⁰⁴(105-digit number)
31426586466765447593…87305328702105712641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.285 × 10¹⁰⁴(105-digit number)
62853172933530895186…74610657404211425281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.257 × 10¹⁰⁵(106-digit number)
12570634586706179037…49221314808422850561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.514 × 10¹⁰⁵(106-digit number)
25141269173412358074…98442629616845701121
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,764,321 XPM·at block #6,815,028 · 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