Block #478,227

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 10:59:21 PM · Difficulty 10.4916 · 6,346,819 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2849b45987e9ecc7ffa591a3ad8c201b3e9eda4cb89966c12e68b65e40ccaa5d

Height

#478,227

Difficulty

10.491647

Transactions

2

Size

1.13 KB

Version

2

Bits

0a7ddc96

Nonce

154,182

Timestamp

4/6/2014, 10:59:21 PM

Confirmations

6,346,819

Merkle Root

cc56182610407e5fced91a7e14e124eccac5e3e366e3a6da8094b9c3326cf3b5
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.388 × 10¹⁰³(104-digit number)
33887497918632859061…04977035171610368001
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.388 × 10¹⁰³(104-digit number)
33887497918632859061…04977035171610368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.777 × 10¹⁰³(104-digit number)
67774995837265718123…09954070343220736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.355 × 10¹⁰⁴(105-digit number)
13554999167453143624…19908140686441472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.710 × 10¹⁰⁴(105-digit number)
27109998334906287249…39816281372882944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.421 × 10¹⁰⁴(105-digit number)
54219996669812574498…79632562745765888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.084 × 10¹⁰⁵(106-digit number)
10843999333962514899…59265125491531776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.168 × 10¹⁰⁵(106-digit number)
21687998667925029799…18530250983063552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.337 × 10¹⁰⁵(106-digit number)
43375997335850059598…37060501966127104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.675 × 10¹⁰⁵(106-digit number)
86751994671700119197…74121003932254208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.735 × 10¹⁰⁶(107-digit number)
17350398934340023839…48242007864508416001
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,844,451 XPM·at block #6,825,045 · 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