Block #448,112

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 4:54:23 PM · Difficulty 10.3676 · 6,377,183 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3eb55e940f965a044f6334fe6d827e49e1eb285d17c8d9124b80a1487eb41e61

Height

#448,112

Difficulty

10.367587

Transactions

1

Size

901 B

Version

2

Bits

0a5e1a2f

Nonce

12,507

Timestamp

3/17/2014, 4:54:23 PM

Confirmations

6,377,183

Merkle Root

798aca8e1ba2eabcdbaf27302dccf568008da6268b87995982a97abc11c7b13c
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.

2.440 × 10⁹⁵(96-digit number)
24405439912468712457…32906099687401799001
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
2.440 × 10⁹⁵(96-digit number)
24405439912468712457…32906099687401799001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.881 × 10⁹⁵(96-digit number)
48810879824937424915…65812199374803598001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.762 × 10⁹⁵(96-digit number)
97621759649874849831…31624398749607196001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.952 × 10⁹⁶(97-digit number)
19524351929974969966…63248797499214392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.904 × 10⁹⁶(97-digit number)
39048703859949939932…26497594998428784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.809 × 10⁹⁶(97-digit number)
78097407719899879865…52995189996857568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.561 × 10⁹⁷(98-digit number)
15619481543979975973…05990379993715136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.123 × 10⁹⁷(98-digit number)
31238963087959951946…11980759987430272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.247 × 10⁹⁷(98-digit number)
62477926175919903892…23961519974860544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.249 × 10⁹⁸(99-digit number)
12495585235183980778…47923039949721088001
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,846,460 XPM·at block #6,825,294 · 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