Block #448,008

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/17/2014, 3:06:57 PM · Difficulty 10.3677 · 6,359,961 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee9b6b8e72f5d602fd6a752da068c107da60bac6e022301312b4f932e3c1d3f7

Height

#448,008

Difficulty

10.367718

Transactions

3

Size

957 B

Version

2

Bits

0a5e22be

Nonce

27,730

Timestamp

3/17/2014, 3:06:57 PM

Confirmations

6,359,961

Merkle Root

419f5c4b1a4838d6905ce07508d2e3f898d49d526a04f4502de518f9bcccb33e
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.

1.594 × 10¹⁰³(104-digit number)
15946859978756474356…87746143926091776001
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
1.594 × 10¹⁰³(104-digit number)
15946859978756474356…87746143926091776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.189 × 10¹⁰³(104-digit number)
31893719957512948713…75492287852183552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.378 × 10¹⁰³(104-digit number)
63787439915025897426…50984575704367104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.275 × 10¹⁰⁴(105-digit number)
12757487983005179485…01969151408734208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.551 × 10¹⁰⁴(105-digit number)
25514975966010358970…03938302817468416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.102 × 10¹⁰⁴(105-digit number)
51029951932020717941…07876605634936832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.020 × 10¹⁰⁵(106-digit number)
10205990386404143588…15753211269873664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.041 × 10¹⁰⁵(106-digit number)
20411980772808287176…31506422539747328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.082 × 10¹⁰⁵(106-digit number)
40823961545616574352…63012845079494656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.164 × 10¹⁰⁵(106-digit number)
81647923091233148705…26025690158989312001
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,707,795 XPM·at block #6,807,968 · 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