Block #413,800

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/21/2014, 12:10:05 PM · Difficulty 10.4141 · 6,395,518 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb4e34c015e321cc68f3f6c77f43f83362782c962f0e1358b5f3b1198baae312

Height

#413,800

Difficulty

10.414103

Transactions

6

Size

1.95 KB

Version

2

Bits

0a6a02a8

Nonce

236,903

Timestamp

2/21/2014, 12:10:05 PM

Confirmations

6,395,518

Merkle Root

9f8e0e9251766fe0e0ff258defe5cb56065d0f376aa297313326f67a9fa27871
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.187 × 10⁹⁷(98-digit number)
71873299740511892010…04682355845592128641
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.187 × 10⁹⁷(98-digit number)
71873299740511892010…04682355845592128641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.437 × 10⁹⁸(99-digit number)
14374659948102378402…09364711691184257281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.874 × 10⁹⁸(99-digit number)
28749319896204756804…18729423382368514561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.749 × 10⁹⁸(99-digit number)
57498639792409513608…37458846764737029121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.149 × 10⁹⁹(100-digit number)
11499727958481902721…74917693529474058241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.299 × 10⁹⁹(100-digit number)
22999455916963805443…49835387058948116481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.599 × 10⁹⁹(100-digit number)
45998911833927610886…99670774117896232961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.199 × 10⁹⁹(100-digit number)
91997823667855221773…99341548235792465921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.839 × 10¹⁰⁰(101-digit number)
18399564733571044354…98683096471584931841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.679 × 10¹⁰⁰(101-digit number)
36799129467142088709…97366192943169863681
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,718,610 XPM·at block #6,809,317 · 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.

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