Block #444,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/15/2014, 7:38:52 AM · Difficulty 10.3438 · 6,380,706 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
942a11869d24b4e610b65b4d4cbbc518d1f9634a9a208f7c4541d5b60eaa1128

Height

#444,502

Difficulty

10.343763

Transactions

3

Size

1.46 KB

Version

2

Bits

0a5800de

Nonce

2,243

Timestamp

3/15/2014, 7:38:52 AM

Confirmations

6,380,706

Merkle Root

5cc300c3684d94e030353d0becf1c40ac7ab870ff874b3832377998ebab7de48
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.

6.073 × 10¹⁰⁰(101-digit number)
60739713882384122397…74584013008912376321
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
6.073 × 10¹⁰⁰(101-digit number)
60739713882384122397…74584013008912376321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.214 × 10¹⁰¹(102-digit number)
12147942776476824479…49168026017824752641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.429 × 10¹⁰¹(102-digit number)
24295885552953648959…98336052035649505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.859 × 10¹⁰¹(102-digit number)
48591771105907297918…96672104071299010561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.718 × 10¹⁰¹(102-digit number)
97183542211814595836…93344208142598021121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.943 × 10¹⁰²(103-digit number)
19436708442362919167…86688416285196042241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.887 × 10¹⁰²(103-digit number)
38873416884725838334…73376832570392084481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.774 × 10¹⁰²(103-digit number)
77746833769451676669…46753665140784168961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.554 × 10¹⁰³(104-digit number)
15549366753890335333…93507330281568337921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.109 × 10¹⁰³(104-digit number)
31098733507780670667…87014660563136675841
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,845,758 XPM·at block #6,825,207 · 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