Block #422,626

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 9:49:58 PM · Difficulty 10.3712 · 6,393,962 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e03de63d46be772d492038196e37b29f635ab6800c8271013df94822e954ed4f

Height

#422,626

Difficulty

10.371183

Transactions

2

Size

1.44 KB

Version

2

Bits

0a5f05d5

Nonce

676,551

Timestamp

2/27/2014, 9:49:58 PM

Confirmations

6,393,962

Merkle Root

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

2.884 × 10¹⁰²(103-digit number)
28840345481078494317…86556232143350965761
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
2.884 × 10¹⁰²(103-digit number)
28840345481078494317…86556232143350965761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.768 × 10¹⁰²(103-digit number)
57680690962156988635…73112464286701931521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.153 × 10¹⁰³(104-digit number)
11536138192431397727…46224928573403863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.307 × 10¹⁰³(104-digit number)
23072276384862795454…92449857146807726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.614 × 10¹⁰³(104-digit number)
46144552769725590908…84899714293615452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.228 × 10¹⁰³(104-digit number)
92289105539451181816…69799428587230904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.845 × 10¹⁰⁴(105-digit number)
18457821107890236363…39598857174461808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.691 × 10¹⁰⁴(105-digit number)
36915642215780472726…79197714348923617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.383 × 10¹⁰⁴(105-digit number)
73831284431560945453…58395428697847234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.476 × 10¹⁰⁵(106-digit number)
14766256886312189090…16790857395694469121
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,776,827 XPM·at block #6,816,587 · 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