Block #447,392

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 6:29:08 AM · Difficulty 10.3549 · 6,378,160 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
db10914b85558b9766ed97f11fd13301eb5dddfa21801dc4bb7ed6452bae8f83

Height

#447,392

Difficulty

10.354879

Transactions

2

Size

1.35 KB

Version

2

Bits

0a5ad957

Nonce

27,562

Timestamp

3/17/2014, 6:29:08 AM

Confirmations

6,378,160

Merkle Root

1332d8db01c995b6b4e4b7261425086fe2ca9e9a6d0196d49a45ab2a92b55a44
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.893 × 10⁹⁵(96-digit number)
38930523116682718425…64875538515023104001
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.893 × 10⁹⁵(96-digit number)
38930523116682718425…64875538515023104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.786 × 10⁹⁵(96-digit number)
77861046233365436850…29751077030046208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.557 × 10⁹⁶(97-digit number)
15572209246673087370…59502154060092416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.114 × 10⁹⁶(97-digit number)
31144418493346174740…19004308120184832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.228 × 10⁹⁶(97-digit number)
62288836986692349480…38008616240369664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.245 × 10⁹⁷(98-digit number)
12457767397338469896…76017232480739328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.491 × 10⁹⁷(98-digit number)
24915534794676939792…52034464961478656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.983 × 10⁹⁷(98-digit number)
49831069589353879584…04068929922957312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.966 × 10⁹⁷(98-digit number)
99662139178707759169…08137859845914624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.993 × 10⁹⁸(99-digit number)
19932427835741551833…16275719691829248001
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,848,517 XPM·at block #6,825,551 · 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