Block #448,182

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 5:57:00 PM · Difficulty 10.3687 · 6,369,308 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0d7109f624055846a6624d6cea3c191397959accc577a0ff0e9fff555f8f637d

Height

#448,182

Difficulty

10.368692

Transactions

2

Size

2.66 KB

Version

2

Bits

0a5e62a0

Nonce

133,356

Timestamp

3/17/2014, 5:57:00 PM

Confirmations

6,369,308

Merkle Root

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

4.319 × 10⁹⁹(100-digit number)
43195889927261799840…61721016766405994241
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
4.319 × 10⁹⁹(100-digit number)
43195889927261799840…61721016766405994241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.639 × 10⁹⁹(100-digit number)
86391779854523599681…23442033532811988481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.727 × 10¹⁰⁰(101-digit number)
17278355970904719936…46884067065623976961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.455 × 10¹⁰⁰(101-digit number)
34556711941809439872…93768134131247953921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.911 × 10¹⁰⁰(101-digit number)
69113423883618879745…87536268262495907841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.382 × 10¹⁰¹(102-digit number)
13822684776723775949…75072536524991815681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.764 × 10¹⁰¹(102-digit number)
27645369553447551898…50145073049983631361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.529 × 10¹⁰¹(102-digit number)
55290739106895103796…00290146099967262721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.105 × 10¹⁰²(103-digit number)
11058147821379020759…00580292199934525441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.211 × 10¹⁰²(103-digit number)
22116295642758041518…01160584399869050881
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,783,967 XPM·at block #6,817,489 · 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