Block #205,538

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/12/2013, 5:25:09 AM · Difficulty 9.9000 · 6,619,159 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f9e9aa785ba88a6973f2d8493af9e2748aaf6685d2d698b818fce293d996a160

Height

#205,538

Difficulty

9.900034

Transactions

8

Size

3.07 KB

Version

2

Bits

09e66899

Nonce

158,723

Timestamp

10/12/2013, 5:25:09 AM

Confirmations

6,619,159

Merkle Root

984c520fa4b5e8a45e17bd0c51954aa1f3ca465482c3589b91a594ba3a76c6e1
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.398 × 10¹⁰⁴(105-digit number)
13986770168519926351…86648428890210629121
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.398 × 10¹⁰⁴(105-digit number)
13986770168519926351…86648428890210629121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.797 × 10¹⁰⁴(105-digit number)
27973540337039852703…73296857780421258241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.594 × 10¹⁰⁴(105-digit number)
55947080674079705406…46593715560842516481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.118 × 10¹⁰⁵(106-digit number)
11189416134815941081…93187431121685032961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.237 × 10¹⁰⁵(106-digit number)
22378832269631882162…86374862243370065921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.475 × 10¹⁰⁵(106-digit number)
44757664539263764325…72749724486740131841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.951 × 10¹⁰⁵(106-digit number)
89515329078527528650…45499448973480263681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.790 × 10¹⁰⁶(107-digit number)
17903065815705505730…90998897946960527361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.580 × 10¹⁰⁶(107-digit number)
35806131631411011460…81997795893921054721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.161 × 10¹⁰⁶(107-digit number)
71612263262822022920…63995591787842109441
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,841,642 XPM·at block #6,824,696 · 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