Block #419,050

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/25/2014, 8:08:50 AM · Difficulty 10.3851 · 6,395,145 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b5395a9c22d58849b8088cd34ddefc67e8816f9fd6d6482897021e0f5c90a1a7

Height

#419,050

Difficulty

10.385114

Transactions

8

Size

1.89 KB

Version

2

Bits

0a6296ce

Nonce

258,058

Timestamp

2/25/2014, 8:08:50 AM

Confirmations

6,395,145

Merkle Root

4a5e75900469ebf93be40eb5e49fa60f36745acd6c02859db08ac8b702e75fa1
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.

7.662 × 10¹⁰³(104-digit number)
76622245359370101988…10533832703049958401
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
7.662 × 10¹⁰³(104-digit number)
76622245359370101988…10533832703049958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.532 × 10¹⁰⁴(105-digit number)
15324449071874020397…21067665406099916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.064 × 10¹⁰⁴(105-digit number)
30648898143748040795…42135330812199833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.129 × 10¹⁰⁴(105-digit number)
61297796287496081590…84270661624399667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.225 × 10¹⁰⁵(106-digit number)
12259559257499216318…68541323248799334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.451 × 10¹⁰⁵(106-digit number)
24519118514998432636…37082646497598668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.903 × 10¹⁰⁵(106-digit number)
49038237029996865272…74165292995197337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.807 × 10¹⁰⁵(106-digit number)
98076474059993730544…48330585990394675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.961 × 10¹⁰⁶(107-digit number)
19615294811998746108…96661171980789350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.923 × 10¹⁰⁶(107-digit number)
39230589623997492217…93322343961578700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.846 × 10¹⁰⁶(107-digit number)
78461179247994984435…86644687923157401601
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,757,634 XPM·at block #6,814,194 · 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