Block #559,077

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2014, 11:16:00 PM · Difficulty 10.9643 · 6,256,063 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
af0473d0dbf31db91d54e3da0bea1af36fa40c4d51960bdb5fc07b94988d0e47

Height

#559,077

Difficulty

10.964259

Transactions

6

Size

1.31 KB

Version

2

Bits

0af6d9a8

Nonce

27,756,034

Timestamp

5/23/2014, 11:16:00 PM

Confirmations

6,256,063

Merkle Root

5653ce231554de6159111c98fad1de6733b9bdb8baab141950ea23abb8d37fd3
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.

5.453 × 10⁹⁸(99-digit number)
54535914138929550584…38023453964768270001
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
5.453 × 10⁹⁸(99-digit number)
54535914138929550584…38023453964768270001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.090 × 10⁹⁹(100-digit number)
10907182827785910116…76046907929536540001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.181 × 10⁹⁹(100-digit number)
21814365655571820233…52093815859073080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.362 × 10⁹⁹(100-digit number)
43628731311143640467…04187631718146160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.725 × 10⁹⁹(100-digit number)
87257462622287280935…08375263436292320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.745 × 10¹⁰⁰(101-digit number)
17451492524457456187…16750526872584640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.490 × 10¹⁰⁰(101-digit number)
34902985048914912374…33501053745169280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.980 × 10¹⁰⁰(101-digit number)
69805970097829824748…67002107490338560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.396 × 10¹⁰¹(102-digit number)
13961194019565964949…34004214980677120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.792 × 10¹⁰¹(102-digit number)
27922388039131929899…68008429961354240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.584 × 10¹⁰¹(102-digit number)
55844776078263859798…36016859922708480001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,765,214 XPM·at block #6,815,139 · 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.
Privacy Policy·

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