Block #562,773

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2014, 11:32:09 AM · Difficulty 10.9650 · 6,251,442 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c0a80fde8084122f575480b61e8c89d7e8e2796c7d5a6b4f311fc8aa179e47d

Height

#562,773

Difficulty

10.964971

Transactions

3

Size

81.38 KB

Version

2

Bits

0af7085e

Nonce

794,070

Timestamp

5/26/2014, 11:32:09 AM

Confirmations

6,251,442

Merkle Root

01cb4854ea50e52c49e171f74820d004105ec213f10a6f0ff83e4a6d61c848f0
Transactions (3)
1 in → 1 out9.1400 XPM110 B
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.010 × 10⁹⁶(97-digit number)
90100574165094715525…67326090683689055361
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.010 × 10⁹⁶(97-digit number)
90100574165094715525…67326090683689055361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.802 × 10⁹⁷(98-digit number)
18020114833018943105…34652181367378110721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.604 × 10⁹⁷(98-digit number)
36040229666037886210…69304362734756221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.208 × 10⁹⁷(98-digit number)
72080459332075772420…38608725469512442881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.441 × 10⁹⁸(99-digit number)
14416091866415154484…77217450939024885761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.883 × 10⁹⁸(99-digit number)
28832183732830308968…54434901878049771521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.766 × 10⁹⁸(99-digit number)
57664367465660617936…08869803756099543041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.153 × 10⁹⁹(100-digit number)
11532873493132123587…17739607512199086081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.306 × 10⁹⁹(100-digit number)
23065746986264247174…35479215024398172161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.613 × 10⁹⁹(100-digit number)
46131493972528494348…70958430048796344321
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,757,789 XPM·at block #6,814,214 · 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