Block #539,101

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/12/2014, 2:33:01 PM · Difficulty 10.9257 · 6,271,720 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c5f3b8742fa1eba1e1d1c8fb246b2f2a319857b6262e15d902b5f7574db9ecf3

Height

#539,101

Difficulty

10.925694

Transactions

4

Size

1.00 KB

Version

2

Bits

0aecfa48

Nonce

19,155,204

Timestamp

5/12/2014, 2:33:01 PM

Confirmations

6,271,720

Merkle Root

9e8dfbbb4b804af3c7a6a4395ce31f9691c9c00be901f585f4ed1f00ed85bd0c
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.205 × 10⁹⁶(97-digit number)
92059457407050142635…68729528091175455921
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.205 × 10⁹⁶(97-digit number)
92059457407050142635…68729528091175455921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.841 × 10⁹⁷(98-digit number)
18411891481410028527…37459056182350911841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.682 × 10⁹⁷(98-digit number)
36823782962820057054…74918112364701823681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.364 × 10⁹⁷(98-digit number)
73647565925640114108…49836224729403647361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.472 × 10⁹⁸(99-digit number)
14729513185128022821…99672449458807294721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.945 × 10⁹⁸(99-digit number)
29459026370256045643…99344898917614589441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.891 × 10⁹⁸(99-digit number)
58918052740512091286…98689797835229178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.178 × 10⁹⁹(100-digit number)
11783610548102418257…97379595670458357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.356 × 10⁹⁹(100-digit number)
23567221096204836514…94759191340916715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.713 × 10⁹⁹(100-digit number)
47134442192409673029…89518382681833431041
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,730,670 XPM·at block #6,810,820 · 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