Block #408,107

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 10:35:44 AM · Difficulty 10.4299 · 6,408,837 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d34fddea3209f762df94a433918c497d7a12f1eeba7845af691db3e48f0af4fd

Height

#408,107

Difficulty

10.429917

Transactions

7

Size

3.30 KB

Version

2

Bits

0a6e0f0f

Nonce

131,468

Timestamp

2/17/2014, 10:35:44 AM

Confirmations

6,408,837

Merkle Root

6a2451f231dc0ef9b16eeecf5b3ada1806c85e22ed5a886d2ab478c85b78a4a5
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.

3.621 × 10⁹⁸(99-digit number)
36219090370841814848…23744861038540100321
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
3.621 × 10⁹⁸(99-digit number)
36219090370841814848…23744861038540100321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.243 × 10⁹⁸(99-digit number)
72438180741683629696…47489722077080200641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.448 × 10⁹⁹(100-digit number)
14487636148336725939…94979444154160401281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.897 × 10⁹⁹(100-digit number)
28975272296673451878…89958888308320802561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.795 × 10⁹⁹(100-digit number)
57950544593346903757…79917776616641605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.159 × 10¹⁰⁰(101-digit number)
11590108918669380751…59835553233283210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.318 × 10¹⁰⁰(101-digit number)
23180217837338761502…19671106466566420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.636 × 10¹⁰⁰(101-digit number)
46360435674677523005…39342212933132840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.272 × 10¹⁰⁰(101-digit number)
92720871349355046011…78684425866265681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.854 × 10¹⁰¹(102-digit number)
18544174269871009202…57368851732531363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.708 × 10¹⁰¹(102-digit number)
37088348539742018404…14737703465062727681
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,779,595 XPM·at block #6,816,943 · 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