Block #409,201

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/18/2014, 5:40:51 AM · Difficulty 10.4245 · 6,401,472 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
320b96ff8304caed264232e5d3294870aafa009f1db4452dea04026c2fb057d6

Height

#409,201

Difficulty

10.424455

Transactions

7

Size

1.53 KB

Version

2

Bits

0a6ca910

Nonce

39,155

Timestamp

2/18/2014, 5:40:51 AM

Confirmations

6,401,472

Merkle Root

cb6b3b6374eed6b66d5085967b2748eb13d04b3ea364c0b403e2b81fc23cb031
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.

3.550 × 10¹⁰⁰(101-digit number)
35500169226154513067…09536902467578363919
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
3.550 × 10¹⁰⁰(101-digit number)
35500169226154513067…09536902467578363919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.100 × 10¹⁰⁰(101-digit number)
71000338452309026135…19073804935156727839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.420 × 10¹⁰¹(102-digit number)
14200067690461805227…38147609870313455679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.840 × 10¹⁰¹(102-digit number)
28400135380923610454…76295219740626911359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.680 × 10¹⁰¹(102-digit number)
56800270761847220908…52590439481253822719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.136 × 10¹⁰²(103-digit number)
11360054152369444181…05180878962507645439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.272 × 10¹⁰²(103-digit number)
22720108304738888363…10361757925015290879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.544 × 10¹⁰²(103-digit number)
45440216609477776726…20723515850030581759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.088 × 10¹⁰²(103-digit number)
90880433218955553452…41447031700061163519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.817 × 10¹⁰³(104-digit number)
18176086643791110690…82894063400122327039
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,729,475 XPM·at block #6,810,672 · 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