Block #213,416

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/16/2013, 8:57:22 PM · Difficulty 9.9214 · 6,601,436 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5dc5655c8fe243d874b4a2d653f18d57c178b8c1f89f90d682649550fa86cbf

Height

#213,416

Difficulty

9.921382

Transactions

1

Size

6.62 KB

Version

2

Bits

09ebdfb1

Nonce

1,164,765,640

Timestamp

10/16/2013, 8:57:22 PM

Confirmations

6,601,436

Merkle Root

310f2ab101083c90a87f17b5c8110deb818578b39a1a2a51f05450032db717ef
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.

6.236 × 10⁹²(93-digit number)
62364887701381502225…59174820637298274879
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
6.236 × 10⁹²(93-digit number)
62364887701381502225…59174820637298274879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.247 × 10⁹³(94-digit number)
12472977540276300445…18349641274596549759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.494 × 10⁹³(94-digit number)
24945955080552600890…36699282549193099519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.989 × 10⁹³(94-digit number)
49891910161105201780…73398565098386199039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.978 × 10⁹³(94-digit number)
99783820322210403560…46797130196772398079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.995 × 10⁹⁴(95-digit number)
19956764064442080712…93594260393544796159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.991 × 10⁹⁴(95-digit number)
39913528128884161424…87188520787089592319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.982 × 10⁹⁴(95-digit number)
79827056257768322848…74377041574179184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.596 × 10⁹⁵(96-digit number)
15965411251553664569…48754083148358369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.193 × 10⁹⁵(96-digit number)
31930822503107329139…97508166296716738559
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,762,899 XPM·at block #6,814,851 · 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