Block #205,248

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/12/2013, 12:44:44 AM · Difficulty 9.8998 · 6,611,323 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7bec84be46350e547b323b97683401f20fa683a590e2922ea1e984fd043bf4e0

Height

#205,248

Difficulty

9.899778

Transactions

2

Size

571 B

Version

2

Bits

09e657db

Nonce

242,880

Timestamp

10/12/2013, 12:44:44 AM

Confirmations

6,611,323

Merkle Root

6351e1602b9b99a878c96fcab983b684253553df8c2b31801472a6410cfc73b5
Transactions (2)
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.509 × 10⁹⁴(95-digit number)
25090371718389663418…24512356982328451361
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.509 × 10⁹⁴(95-digit number)
25090371718389663418…24512356982328451361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.018 × 10⁹⁴(95-digit number)
50180743436779326837…49024713964656902721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.003 × 10⁹⁵(96-digit number)
10036148687355865367…98049427929313805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.007 × 10⁹⁵(96-digit number)
20072297374711730734…96098855858627610881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.014 × 10⁹⁵(96-digit number)
40144594749423461469…92197711717255221761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.028 × 10⁹⁵(96-digit number)
80289189498846922939…84395423434510443521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.605 × 10⁹⁶(97-digit number)
16057837899769384587…68790846869020887041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.211 × 10⁹⁶(97-digit number)
32115675799538769175…37581693738041774081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.423 × 10⁹⁶(97-digit number)
64231351599077538351…75163387476083548161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.284 × 10⁹⁷(98-digit number)
12846270319815507670…50326774952167096321
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,776,700 XPM·at block #6,816,570 · 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