Block #419,601

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/25/2014, 6:48:57 PM · Difficulty 10.3743 · 6,395,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b2d5616a44baeabfcd2bb00df9e4a49575db47c0a8fcb4ab259ef725cf61ca2b

Height

#419,601

Difficulty

10.374283

Transactions

2

Size

824 B

Version

2

Bits

0a5fd10b

Nonce

115,726

Timestamp

2/25/2014, 6:48:57 PM

Confirmations

6,395,251

Merkle Root

34372475695275b18d79c4e84f6a4cd19bfa452dab6c2c6320a62f80a87afe16
Transactions (2)
1 in → 1 out9.2800 XPM97 B
4 in → 1 out468.9451 XPM634 B
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.578 × 10¹⁰¹(102-digit number)
15780369266795155000…77284402228897152001
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.578 × 10¹⁰¹(102-digit number)
15780369266795155000…77284402228897152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.156 × 10¹⁰¹(102-digit number)
31560738533590310000…54568804457794304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.312 × 10¹⁰¹(102-digit number)
63121477067180620001…09137608915588608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.262 × 10¹⁰²(103-digit number)
12624295413436124000…18275217831177216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.524 × 10¹⁰²(103-digit number)
25248590826872248000…36550435662354432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.049 × 10¹⁰²(103-digit number)
50497181653744496001…73100871324708864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.009 × 10¹⁰³(104-digit number)
10099436330748899200…46201742649417728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.019 × 10¹⁰³(104-digit number)
20198872661497798400…92403485298835456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.039 × 10¹⁰³(104-digit number)
40397745322995596800…84806970597670912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.079 × 10¹⁰³(104-digit number)
80795490645991193601…69613941195341824001
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