Block #421,711

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 6:10:15 AM · Difficulty 10.3737 · 6,393,141 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e3cc8b1a2975445a00780e19c2c96448891b0639cb54b6ae25addd85f7d42aa

Height

#421,711

Difficulty

10.373741

Transactions

2

Size

1.20 KB

Version

2

Bits

0a5fad83

Nonce

11,526

Timestamp

2/27/2014, 6:10:15 AM

Confirmations

6,393,141

Merkle Root

c2d8413124e236324b935be5fd0a7e67169f02c1932f2297cb1eb24007cc4068
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.597 × 10¹⁰²(103-digit number)
35971781792901982141…37151784678973342721
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.597 × 10¹⁰²(103-digit number)
35971781792901982141…37151784678973342721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.194 × 10¹⁰²(103-digit number)
71943563585803964283…74303569357946685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.438 × 10¹⁰³(104-digit number)
14388712717160792856…48607138715893370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.877 × 10¹⁰³(104-digit number)
28777425434321585713…97214277431786741761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.755 × 10¹⁰³(104-digit number)
57554850868643171426…94428554863573483521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.151 × 10¹⁰⁴(105-digit number)
11510970173728634285…88857109727146967041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.302 × 10¹⁰⁴(105-digit number)
23021940347457268570…77714219454293934081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.604 × 10¹⁰⁴(105-digit number)
46043880694914537141…55428438908587868161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.208 × 10¹⁰⁴(105-digit number)
92087761389829074282…10856877817175736321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.841 × 10¹⁰⁵(106-digit number)
18417552277965814856…21713755634351472641
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,762,899 XPM·at block #6,814,851 · 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