Block #214,075

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/17/2013, 6:21:54 AM · Difficulty 9.9228 · 6,603,397 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
730306806737776978d1c81e8b7a5defe348827d9e6562fd308be8c694e7716e

Height

#214,075

Difficulty

9.922806

Transactions

5

Size

1.34 KB

Version

2

Bits

09ec3cfd

Nonce

9,959

Timestamp

10/17/2013, 6:21:54 AM

Confirmations

6,603,397

Merkle Root

2e83b4a2332e2e29794b40131b3704e989754cf9667f8d8780a06ea2e21abe0f
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.

7.648 × 10⁹⁵(96-digit number)
76483480782491570099…88771628729694498241
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
7.648 × 10⁹⁵(96-digit number)
76483480782491570099…88771628729694498241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.529 × 10⁹⁶(97-digit number)
15296696156498314019…77543257459388996481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.059 × 10⁹⁶(97-digit number)
30593392312996628039…55086514918777992961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.118 × 10⁹⁶(97-digit number)
61186784625993256079…10173029837555985921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.223 × 10⁹⁷(98-digit number)
12237356925198651215…20346059675111971841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.447 × 10⁹⁷(98-digit number)
24474713850397302431…40692119350223943681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.894 × 10⁹⁷(98-digit number)
48949427700794604863…81384238700447887361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.789 × 10⁹⁷(98-digit number)
97898855401589209727…62768477400895774721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.957 × 10⁹⁸(99-digit number)
19579771080317841945…25536954801791549441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.915 × 10⁹⁸(99-digit number)
39159542160635683890…51073909603583098881
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,828 XPM·at block #6,817,471 · 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