Block #490,614

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2014, 11:36:14 PM · Difficulty 10.6783 · 6,317,188 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dcffac17680a5d664f160223f90da2d5529c0891ed3e8ff64e7f4373314eb022

Height

#490,614

Difficulty

10.678303

Transactions

11

Size

3.48 KB

Version

2

Bits

0aada53e

Nonce

8,734,057

Timestamp

4/13/2014, 11:36:14 PM

Confirmations

6,317,188

Merkle Root

7a79c084e1bb2407ba0e1fc24d9f9f58b3aa8defe56a71ed5c499eff8c2fdba2
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.637 × 10⁹⁶(97-digit number)
16375392648105032728…21376227514059697921
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.637 × 10⁹⁶(97-digit number)
16375392648105032728…21376227514059697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.275 × 10⁹⁶(97-digit number)
32750785296210065457…42752455028119395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.550 × 10⁹⁶(97-digit number)
65501570592420130915…85504910056238791681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.310 × 10⁹⁷(98-digit number)
13100314118484026183…71009820112477583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.620 × 10⁹⁷(98-digit number)
26200628236968052366…42019640224955166721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.240 × 10⁹⁷(98-digit number)
52401256473936104732…84039280449910333441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.048 × 10⁹⁸(99-digit number)
10480251294787220946…68078560899820666881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.096 × 10⁹⁸(99-digit number)
20960502589574441892…36157121799641333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.192 × 10⁹⁸(99-digit number)
41921005179148883785…72314243599282667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.384 × 10⁹⁸(99-digit number)
83842010358297767571…44628487198565335041
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,706,450 XPM·at block #6,807,801 · 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