Block #446,244

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/16/2014, 10:25:15 AM · Difficulty 10.3617 · 6,363,630 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
877543d8369c3aee1c3c25e37943a6353663aa1b56bfeb394fae99967ce7b74d

Height

#446,244

Difficulty

10.361735

Transactions

4

Size

1.57 KB

Version

2

Bits

0a5c9ab0

Nonce

94,733

Timestamp

3/16/2014, 10:25:15 AM

Confirmations

6,363,630

Merkle Root

7362217a47d29b9355b3abc035c84183bbce6120ee356a870b8a92072c005fa4
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.

2.166 × 10⁹⁹(100-digit number)
21667402319695551789…54717800454112799199
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
2.166 × 10⁹⁹(100-digit number)
21667402319695551789…54717800454112799199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.333 × 10⁹⁹(100-digit number)
43334804639391103579…09435600908225598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.666 × 10⁹⁹(100-digit number)
86669609278782207158…18871201816451196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.733 × 10¹⁰⁰(101-digit number)
17333921855756441431…37742403632902393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.466 × 10¹⁰⁰(101-digit number)
34667843711512882863…75484807265804787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.933 × 10¹⁰⁰(101-digit number)
69335687423025765727…50969614531609574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.386 × 10¹⁰¹(102-digit number)
13867137484605153145…01939229063219148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.773 × 10¹⁰¹(102-digit number)
27734274969210306290…03878458126438297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.546 × 10¹⁰¹(102-digit number)
55468549938420612581…07756916252876595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.109 × 10¹⁰²(103-digit number)
11093709987684122516…15513832505753190399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,723,078 XPM·at block #6,809,873 · 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