Block #510,800

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2014, 8:51:36 PM · Difficulty 10.8272 · 6,300,357 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cc224c9b9b2ff2ce2e5c46ebad036a5e3149414dfd7b966ede2e1385c53a83c4

Height

#510,800

Difficulty

10.827179

Transactions

2

Size

427 B

Version

2

Bits

0ad3c207

Nonce

5,953,043

Timestamp

4/25/2014, 8:51:36 PM

Confirmations

6,300,357

Merkle Root

2d92da46d409cd5b7a710970ee33f7ab2003582dd10a38d74fc33925889be36a
Transactions (2)
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.

2.336 × 10⁹⁶(97-digit number)
23368542867199327796…40666314246602523681
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
2.336 × 10⁹⁶(97-digit number)
23368542867199327796…40666314246602523681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.673 × 10⁹⁶(97-digit number)
46737085734398655592…81332628493205047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.347 × 10⁹⁶(97-digit number)
93474171468797311185…62665256986410094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.869 × 10⁹⁷(98-digit number)
18694834293759462237…25330513972820189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.738 × 10⁹⁷(98-digit number)
37389668587518924474…50661027945640378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.477 × 10⁹⁷(98-digit number)
74779337175037848948…01322055891280757761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.495 × 10⁹⁸(99-digit number)
14955867435007569789…02644111782561515521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.991 × 10⁹⁸(99-digit number)
29911734870015139579…05288223565123031041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.982 × 10⁹⁸(99-digit number)
59823469740030279158…10576447130246062081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.196 × 10⁹⁹(100-digit number)
11964693948006055831…21152894260492124161
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,733,367 XPM·at block #6,811,156 · 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