Block #451,209

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/19/2014, 6:48:45 PM · Difficulty 10.3825 · 6,374,485 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24467faa73101a100d92920bbd28f46c84a487ab85bf4d8525dda09862ea0ef4

Height

#451,209

Difficulty

10.382546

Transactions

3

Size

651 B

Version

2

Bits

0a61ee8d

Nonce

456,615

Timestamp

3/19/2014, 6:48:45 PM

Confirmations

6,374,485

Merkle Root

a19a73062bcc1f003452b83c5b29c6a2855e70d67ac98a2cfd0d4fe443b0aeed
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.933 × 10⁹⁷(98-digit number)
19333553044722743064…72922111531950967041
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.933 × 10⁹⁷(98-digit number)
19333553044722743064…72922111531950967041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.866 × 10⁹⁷(98-digit number)
38667106089445486128…45844223063901934081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.733 × 10⁹⁷(98-digit number)
77334212178890972256…91688446127803868161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.546 × 10⁹⁸(99-digit number)
15466842435778194451…83376892255607736321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.093 × 10⁹⁸(99-digit number)
30933684871556388902…66753784511215472641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.186 × 10⁹⁸(99-digit number)
61867369743112777805…33507569022430945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.237 × 10⁹⁹(100-digit number)
12373473948622555561…67015138044861890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.474 × 10⁹⁹(100-digit number)
24746947897245111122…34030276089723781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.949 × 10⁹⁹(100-digit number)
49493895794490222244…68060552179447562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.898 × 10⁹⁹(100-digit number)
98987791588980444488…36121104358895124481
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,849,664 XPM·at block #6,825,693 · 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