Block #213,930

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/17/2013, 3:55:32 AM · Difficulty 9.9229 · 6,603,211 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7bd5b7e63201f1d03288c0554cfcaed2150f503d272367cdea1745293c5312e9

Height

#213,930

Difficulty

9.922874

Transactions

1

Size

5.56 KB

Version

2

Bits

09ec417d

Nonce

1,164,737,185

Timestamp

10/17/2013, 3:55:32 AM

Confirmations

6,603,211

Merkle Root

3d8a358d28abd3d4c28532c108bf1220a5b94c0997209b35489cc909b5acb66b
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.234 × 10⁹⁴(95-digit number)
32342127015672410033…45309478102627174399
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.234 × 10⁹⁴(95-digit number)
32342127015672410033…45309478102627174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.468 × 10⁹⁴(95-digit number)
64684254031344820066…90618956205254348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.293 × 10⁹⁵(96-digit number)
12936850806268964013…81237912410508697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.587 × 10⁹⁵(96-digit number)
25873701612537928026…62475824821017395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.174 × 10⁹⁵(96-digit number)
51747403225075856053…24951649642034790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.034 × 10⁹⁶(97-digit number)
10349480645015171210…49903299284069580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.069 × 10⁹⁶(97-digit number)
20698961290030342421…99806598568139161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.139 × 10⁹⁶(97-digit number)
41397922580060684842…99613197136278323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.279 × 10⁹⁶(97-digit number)
82795845160121369684…99226394272556646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.655 × 10⁹⁷(98-digit number)
16559169032024273936…98452788545113292799
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,781,163 XPM·at block #6,817,140 · 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