Block #409,170

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 5:06:14 AM · Difficulty 10.4249 · 6,417,544 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d2a32f803e456a88f5c406583230147db446561e3acc6cde59ef7207d8e8488f

Height

#409,170

Difficulty

10.424945

Transactions

2

Size

2.00 KB

Version

2

Bits

0a6cc936

Nonce

118,888

Timestamp

2/18/2014, 5:06:14 AM

Confirmations

6,417,544

Merkle Root

f75df6e96fdc4ce9441aa4e2131f7f89fa896bf1c1c4df8b1050ce75b92174af
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.005 × 10⁹⁵(96-digit number)
30050147181732814103…83743460154982241161
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.005 × 10⁹⁵(96-digit number)
30050147181732814103…83743460154982241161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.010 × 10⁹⁵(96-digit number)
60100294363465628206…67486920309964482321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.202 × 10⁹⁶(97-digit number)
12020058872693125641…34973840619928964641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.404 × 10⁹⁶(97-digit number)
24040117745386251282…69947681239857929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.808 × 10⁹⁶(97-digit number)
48080235490772502565…39895362479715858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.616 × 10⁹⁶(97-digit number)
96160470981545005130…79790724959431717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.923 × 10⁹⁷(98-digit number)
19232094196309001026…59581449918863434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.846 × 10⁹⁷(98-digit number)
38464188392618002052…19162899837726868481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.692 × 10⁹⁷(98-digit number)
76928376785236004104…38325799675453736961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.538 × 10⁹⁸(99-digit number)
15385675357047200820…76651599350907473921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.077 × 10⁹⁸(99-digit number)
30771350714094401641…53303198701814947841
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,857,865 XPM·at block #6,826,713 · 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