Block #420,774

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/26/2014, 2:17:28 PM · Difficulty 10.3754 · 6,395,952 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e8051971ad65e929da16f8ca2f0e64fffbf2355abfdae69e1b708c8c9bba7b2

Height

#420,774

Difficulty

10.375418

Transactions

1

Size

902 B

Version

2

Bits

0a601b6c

Nonce

268,973

Timestamp

2/26/2014, 2:17:28 PM

Confirmations

6,395,952

Merkle Root

c34502d5d007b4fe1b64b5c97bbb6a1d1f1fb5eee67c70e0ffe0d7d45fdeab08
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.147 × 10⁹⁶(97-digit number)
11478833707345862770…14255984135033171201
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.147 × 10⁹⁶(97-digit number)
11478833707345862770…14255984135033171201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.295 × 10⁹⁶(97-digit number)
22957667414691725541…28511968270066342401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.591 × 10⁹⁶(97-digit number)
45915334829383451083…57023936540132684801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.183 × 10⁹⁶(97-digit number)
91830669658766902166…14047873080265369601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.836 × 10⁹⁷(98-digit number)
18366133931753380433…28095746160530739201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.673 × 10⁹⁷(98-digit number)
36732267863506760866…56191492321061478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.346 × 10⁹⁷(98-digit number)
73464535727013521733…12382984642122956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.469 × 10⁹⁸(99-digit number)
14692907145402704346…24765969284245913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.938 × 10⁹⁸(99-digit number)
29385814290805408693…49531938568491827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.877 × 10⁹⁸(99-digit number)
58771628581610817386…99063877136983654401
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,777,842 XPM·at block #6,816,725 · 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