Block #448,199

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 6:16:28 PM · Difficulty 10.3686 · 6,362,877 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eacf723591f079a2cc7ef2459794de4960446f93459bf366421757e5012c4a02

Height

#448,199

Difficulty

10.368561

Transactions

4

Size

1.64 KB

Version

2

Bits

0a5e59fe

Nonce

1,062,522

Timestamp

3/17/2014, 6:16:28 PM

Confirmations

6,362,877

Merkle Root

b202a4949e5643b73ae36005def8c909f864a51cb19def7fa18584615f3ca2b4
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.010 × 10⁹⁷(98-digit number)
60109509563929617421…95383153760528445121
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.010 × 10⁹⁷(98-digit number)
60109509563929617421…95383153760528445121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.202 × 10⁹⁸(99-digit number)
12021901912785923484…90766307521056890241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.404 × 10⁹⁸(99-digit number)
24043803825571846968…81532615042113780481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.808 × 10⁹⁸(99-digit number)
48087607651143693937…63065230084227560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.617 × 10⁹⁸(99-digit number)
96175215302287387874…26130460168455121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.923 × 10⁹⁹(100-digit number)
19235043060457477574…52260920336910243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.847 × 10⁹⁹(100-digit number)
38470086120914955149…04521840673820487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.694 × 10⁹⁹(100-digit number)
76940172241829910299…09043681347640975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.538 × 10¹⁰⁰(101-digit number)
15388034448365982059…18087362695281950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.077 × 10¹⁰⁰(101-digit number)
30776068896731964119…36174725390563901441
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,732,714 XPM·at block #6,811,075 · 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