Block #444,521

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/15/2014, 7:53:11 AM · Difficulty 10.3445 · 6,382,644 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c8a96d65595741a006e4952eef40cfa1549fcb63a33db1c1cc658ca414450798

Height

#444,521

Difficulty

10.344549

Transactions

1

Size

970 B

Version

2

Bits

0a583462

Nonce

26,480

Timestamp

3/15/2014, 7:53:11 AM

Confirmations

6,382,644

Merkle Root

6b8818fc66004dc45bf4be0f6f6b6677b874077f1fde4992f0ccea814ac4ffab
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.471 × 10¹⁰⁰(101-digit number)
14717119711334663119…04298229466982205961
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.471 × 10¹⁰⁰(101-digit number)
14717119711334663119…04298229466982205961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.943 × 10¹⁰⁰(101-digit number)
29434239422669326239…08596458933964411921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.886 × 10¹⁰⁰(101-digit number)
58868478845338652479…17192917867928823841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.177 × 10¹⁰¹(102-digit number)
11773695769067730495…34385835735857647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.354 × 10¹⁰¹(102-digit number)
23547391538135460991…68771671471715295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.709 × 10¹⁰¹(102-digit number)
47094783076270921983…37543342943430590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.418 × 10¹⁰¹(102-digit number)
94189566152541843966…75086685886861181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.883 × 10¹⁰²(103-digit number)
18837913230508368793…50173371773722362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.767 × 10¹⁰²(103-digit number)
37675826461016737586…00346743547444725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.535 × 10¹⁰²(103-digit number)
75351652922033475173…00693487094889451521
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,861,415 XPM·at block #6,827,164 · 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