Block #498,652

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2014, 5:25:15 AM · Difficulty 10.7818 · 6,315,386 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5fd718b210a3f742e32aaa85207ba539dc2a0de3c40d4d9c656ea113618137a6

Height

#498,652

Difficulty

10.781814

Transactions

1

Size

834 B

Version

2

Bits

0ac824f1

Nonce

46,074

Timestamp

4/18/2014, 5:25:15 AM

Confirmations

6,315,386

Merkle Root

e83fceb0211ee32c1660792ec17940c1fbe6b58140fe512c692a5f575ac6a0c2
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.

4.634 × 10⁹⁷(98-digit number)
46344366804200853205…91666480058052418561
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
4.634 × 10⁹⁷(98-digit number)
46344366804200853205…91666480058052418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.268 × 10⁹⁷(98-digit number)
92688733608401706410…83332960116104837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.853 × 10⁹⁸(99-digit number)
18537746721680341282…66665920232209674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.707 × 10⁹⁸(99-digit number)
37075493443360682564…33331840464419348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.415 × 10⁹⁸(99-digit number)
74150986886721365128…66663680928838696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.483 × 10⁹⁹(100-digit number)
14830197377344273025…33327361857677393921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.966 × 10⁹⁹(100-digit number)
29660394754688546051…66654723715354787841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.932 × 10⁹⁹(100-digit number)
59320789509377092102…33309447430709575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.186 × 10¹⁰⁰(101-digit number)
11864157901875418420…66618894861419151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.372 × 10¹⁰⁰(101-digit number)
23728315803750836841…33237789722838302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.745 × 10¹⁰⁰(101-digit number)
47456631607501673682…66475579445676605441
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,756,379 XPM·at block #6,814,037 · 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