Block #199,569

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/8/2013, 11:17:07 AM · Difficulty 9.8878 · 6,608,347 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
690b020787cc56f4de1dabe1c5a341ecbb53c8aa2c7bf843daa20d26244099ae

Height

#199,569

Difficulty

9.887777

Transactions

8

Size

3.41 KB

Version

2

Bits

09e34559

Nonce

28,411

Timestamp

10/8/2013, 11:17:07 AM

Confirmations

6,608,347

Merkle Root

ca9a7d9778f05622e6090b8036c22431a8ae4413978f221af70efca22d6831f0
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.405 × 10⁹⁹(100-digit number)
74058134303646017460…20244027471283424379
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.405 × 10⁹⁹(100-digit number)
74058134303646017460…20244027471283424379
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.481 × 10¹⁰⁰(101-digit number)
14811626860729203492…40488054942566848759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.962 × 10¹⁰⁰(101-digit number)
29623253721458406984…80976109885133697519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.924 × 10¹⁰⁰(101-digit number)
59246507442916813968…61952219770267395039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.184 × 10¹⁰¹(102-digit number)
11849301488583362793…23904439540534790079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.369 × 10¹⁰¹(102-digit number)
23698602977166725587…47808879081069580159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.739 × 10¹⁰¹(102-digit number)
47397205954333451174…95617758162139160319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.479 × 10¹⁰¹(102-digit number)
94794411908666902349…91235516324278320639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.895 × 10¹⁰²(103-digit number)
18958882381733380469…82471032648556641279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.791 × 10¹⁰²(103-digit number)
37917764763466760939…64942065297113282559
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,707,363 XPM·at block #6,807,915 · 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