Block #553,911

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2014, 11:31:42 AM · Difficulty 10.9631 · 6,254,367 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
99e499063ee10025c1084633ed3b9294a5c4f3499fdc9e480ac470e06678b945

Height

#553,911

Difficulty

10.963076

Transactions

3

Size

661 B

Version

2

Bits

0af68c24

Nonce

133,375,286

Timestamp

5/20/2014, 11:31:42 AM

Confirmations

6,254,367

Merkle Root

aebf25a9bfc895ea94760efd760c0eeee18b08f1b0484f46c31b13a60208ff02
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.643 × 10⁹⁸(99-digit number)
36431754384526624987…96827062025476240481
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.643 × 10⁹⁸(99-digit number)
36431754384526624987…96827062025476240481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.286 × 10⁹⁸(99-digit number)
72863508769053249974…93654124050952480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.457 × 10⁹⁹(100-digit number)
14572701753810649994…87308248101904961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.914 × 10⁹⁹(100-digit number)
29145403507621299989…74616496203809923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.829 × 10⁹⁹(100-digit number)
58290807015242599979…49232992407619847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.165 × 10¹⁰⁰(101-digit number)
11658161403048519995…98465984815239695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.331 × 10¹⁰⁰(101-digit number)
23316322806097039991…96931969630479390721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.663 × 10¹⁰⁰(101-digit number)
46632645612194079983…93863939260958781441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.326 × 10¹⁰⁰(101-digit number)
93265291224388159967…87727878521917562881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.865 × 10¹⁰¹(102-digit number)
18653058244877631993…75455757043835125761
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,710,274 XPM·at block #6,808,277 · 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