Block #560,399

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2014, 7:20:56 PM · Difficulty 10.9651 · 6,248,423 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
21dc59884f2a214e91a35554530751aaa3dcae3bb8cd8b65423ce1cff3268d69

Height

#560,399

Difficulty

10.965110

Transactions

7

Size

1.50 KB

Version

2

Bits

0af71179

Nonce

435,239,012

Timestamp

5/24/2014, 7:20:56 PM

Confirmations

6,248,423

Merkle Root

f37eb743cf155d2e1d1cd1412541c482c006e7593eae3f6ec5397f7bdfb0f7a6
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.

8.844 × 10⁹⁷(98-digit number)
88441193829250773785…66993560338283060161
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
8.844 × 10⁹⁷(98-digit number)
88441193829250773785…66993560338283060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.768 × 10⁹⁸(99-digit number)
17688238765850154757…33987120676566120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.537 × 10⁹⁸(99-digit number)
35376477531700309514…67974241353132240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.075 × 10⁹⁸(99-digit number)
70752955063400619028…35948482706264481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.415 × 10⁹⁹(100-digit number)
14150591012680123805…71896965412528962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.830 × 10⁹⁹(100-digit number)
28301182025360247611…43793930825057925121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.660 × 10⁹⁹(100-digit number)
56602364050720495222…87587861650115850241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.132 × 10¹⁰⁰(101-digit number)
11320472810144099044…75175723300231700481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.264 × 10¹⁰⁰(101-digit number)
22640945620288198089…50351446600463400961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.528 × 10¹⁰⁰(101-digit number)
45281891240576396178…00702893200926801921
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,714,633 XPM·at block #6,808,821 · 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