Block #447,179

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 2:47:24 AM · Difficulty 10.3560 · 6,361,440 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aa8edd2c003f14849852255e39c7d037b9b746d09c7c7995a493539ffdf4f7e1

Height

#447,179

Difficulty

10.355988

Transactions

3

Size

1.32 KB

Version

2

Bits

0a5b2202

Nonce

72,048

Timestamp

3/17/2014, 2:47:24 AM

Confirmations

6,361,440

Merkle Root

f3fefa8adf43a0cb403c88a8c2b8c4fddc58254c54c70208ba3d4afa250b8f19
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.

8.717 × 10⁹⁷(98-digit number)
87173712978072711803…68520687416524077601
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
8.717 × 10⁹⁷(98-digit number)
87173712978072711803…68520687416524077601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.743 × 10⁹⁸(99-digit number)
17434742595614542360…37041374833048155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.486 × 10⁹⁸(99-digit number)
34869485191229084721…74082749666096310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.973 × 10⁹⁸(99-digit number)
69738970382458169442…48165499332192620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.394 × 10⁹⁹(100-digit number)
13947794076491633888…96330998664385241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.789 × 10⁹⁹(100-digit number)
27895588152983267777…92661997328770483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.579 × 10⁹⁹(100-digit number)
55791176305966535554…85323994657540966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.115 × 10¹⁰⁰(101-digit number)
11158235261193307110…70647989315081932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.231 × 10¹⁰⁰(101-digit number)
22316470522386614221…41295978630163865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.463 × 10¹⁰⁰(101-digit number)
44632941044773228443…82591957260327731201
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,002 XPM·at block #6,808,618 · 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