Block #509,256

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/24/2014, 10:31:54 PM · Difficulty 10.8198 · 6,299,854 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
89bd33c9065f52be26a4e8936993220098b35e8e32089e29b63e675212ff2b62

Height

#509,256

Difficulty

10.819764

Transactions

4

Size

1.01 KB

Version

2

Bits

0ad1dc0b

Nonce

178,190,981

Timestamp

4/24/2014, 10:31:54 PM

Confirmations

6,299,854

Merkle Root

7b35b1668041c051c200abd4d243f81299af5a161bff6998be247a82c26bdaf9
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.420 × 10¹⁰⁰(101-digit number)
14208323469683253805…74047108533446170881
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.420 × 10¹⁰⁰(101-digit number)
14208323469683253805…74047108533446170881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.841 × 10¹⁰⁰(101-digit number)
28416646939366507611…48094217066892341761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.683 × 10¹⁰⁰(101-digit number)
56833293878733015222…96188434133784683521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.136 × 10¹⁰¹(102-digit number)
11366658775746603044…92376868267569367041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.273 × 10¹⁰¹(102-digit number)
22733317551493206088…84753736535138734081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.546 × 10¹⁰¹(102-digit number)
45466635102986412177…69507473070277468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.093 × 10¹⁰¹(102-digit number)
90933270205972824355…39014946140554936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.818 × 10¹⁰²(103-digit number)
18186654041194564871…78029892281109872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.637 × 10¹⁰²(103-digit number)
36373308082389129742…56059784562219745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.274 × 10¹⁰²(103-digit number)
72746616164778259484…12119569124439490561
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,716,936 XPM·at block #6,809,109 · 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