Block #562,844

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2014, 12:28:55 PM · Difficulty 10.9650 · 6,248,299 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e3994287d97f84f145c811d6926f3acb9ea18db5440d2d1fa26c11c48afdb0a

Height

#562,844

Difficulty

10.965039

Transactions

4

Size

883 B

Version

2

Bits

0af70ccd

Nonce

105,322,042

Timestamp

5/26/2014, 12:28:55 PM

Confirmations

6,248,299

Merkle Root

5adbf0158e1894e5c96b3785eac18360adbca0e9889860057c34df41857871a5
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.977 × 10⁹⁷(98-digit number)
19771636886598434731…65421955252465452361
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.977 × 10⁹⁷(98-digit number)
19771636886598434731…65421955252465452361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.954 × 10⁹⁷(98-digit number)
39543273773196869462…30843910504930904721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.908 × 10⁹⁷(98-digit number)
79086547546393738924…61687821009861809441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.581 × 10⁹⁸(99-digit number)
15817309509278747784…23375642019723618881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.163 × 10⁹⁸(99-digit number)
31634619018557495569…46751284039447237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.326 × 10⁹⁸(99-digit number)
63269238037114991139…93502568078894475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.265 × 10⁹⁹(100-digit number)
12653847607422998227…87005136157788951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.530 × 10⁹⁹(100-digit number)
25307695214845996455…74010272315577902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.061 × 10⁹⁹(100-digit number)
50615390429691992911…48020544631155804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.012 × 10¹⁰⁰(101-digit number)
10123078085938398582…96041089262311608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.024 × 10¹⁰⁰(101-digit number)
20246156171876797164…92082178524623216641
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,733,253 XPM·at block #6,811,142 · 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