Block #909,807

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/25/2015, 8:14:17 PM · Difficulty 10.9337 · 5,897,207 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a79eec6869335081bcbee98bf30d3c19967f6be57994877894e4e2bb67213e05

Height

#909,807

Difficulty

10.933693

Transactions

5

Size

3.53 KB

Version

2

Bits

0aef0685

Nonce

373,126,601

Timestamp

1/25/2015, 8:14:17 PM

Confirmations

5,897,207

Merkle Root

5916af3e9ee56e81ee82bcd334483a45f9287a409a3fa8cba924c0fa91548aba
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.

9.455 × 10⁹¹(92-digit number)
94552528708837767039…46482806433755971361
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
9.455 × 10⁹¹(92-digit number)
94552528708837767039…46482806433755971361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.891 × 10⁹²(93-digit number)
18910505741767553407…92965612867511942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.782 × 10⁹²(93-digit number)
37821011483535106815…85931225735023885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.564 × 10⁹²(93-digit number)
75642022967070213631…71862451470047770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.512 × 10⁹³(94-digit number)
15128404593414042726…43724902940095541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.025 × 10⁹³(94-digit number)
30256809186828085452…87449805880191083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.051 × 10⁹³(94-digit number)
60513618373656170905…74899611760382167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.210 × 10⁹⁴(95-digit number)
12102723674731234181…49799223520764334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.420 × 10⁹⁴(95-digit number)
24205447349462468362…99598447041528668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.841 × 10⁹⁴(95-digit number)
48410894698924936724…99196894083057336321
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,700,213 XPM·at block #6,807,013 · 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.

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