Block #447,630

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 9:53:34 AM · Difficulty 10.3590 · 6,361,015 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
52717ad4c17f5b6122daf2bd810443496f80de1a28d5af3c9f68132d59a376d9

Height

#447,630

Difficulty

10.359026

Transactions

2

Size

2.11 KB

Version

2

Bits

0a5be923

Nonce

177,791

Timestamp

3/17/2014, 9:53:34 AM

Confirmations

6,361,015

Merkle Root

83bc4fba01a6caee3187e44c45fc6b6d4290a14ed6e4351338883e7c292b3495
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.005 × 10⁹⁸(99-digit number)
30053528885743866737…61300623355261620781
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.005 × 10⁹⁸(99-digit number)
30053528885743866737…61300623355261620781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.010 × 10⁹⁸(99-digit number)
60107057771487733475…22601246710523241561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.202 × 10⁹⁹(100-digit number)
12021411554297546695…45202493421046483121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.404 × 10⁹⁹(100-digit number)
24042823108595093390…90404986842092966241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.808 × 10⁹⁹(100-digit number)
48085646217190186780…80809973684185932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.617 × 10⁹⁹(100-digit number)
96171292434380373560…61619947368371864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.923 × 10¹⁰⁰(101-digit number)
19234258486876074712…23239894736743729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.846 × 10¹⁰⁰(101-digit number)
38468516973752149424…46479789473487459841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.693 × 10¹⁰⁰(101-digit number)
76937033947504298848…92959578946974919681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.538 × 10¹⁰¹(102-digit number)
15387406789500859769…85919157893949839361
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,713,212 XPM·at block #6,808,644 · 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