Block #211,785

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2013, 9:47:28 PM · Difficulty 9.9174 · 6,597,741 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bfe8d5bb3403d41cefb71712ae24030a7208cd065997924785712874fb15592a

Height

#211,785

Difficulty

9.917406

Transactions

4

Size

4.86 KB

Version

2

Bits

09eadb1f

Nonce

1,164,948,338

Timestamp

10/15/2013, 9:47:28 PM

Confirmations

6,597,741

Merkle Root

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

9.390 × 10⁹⁶(97-digit number)
93901259297706607848…68123783310580714099
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
9.390 × 10⁹⁶(97-digit number)
93901259297706607848…68123783310580714099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.878 × 10⁹⁷(98-digit number)
18780251859541321569…36247566621161428199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.756 × 10⁹⁷(98-digit number)
37560503719082643139…72495133242322856399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.512 × 10⁹⁷(98-digit number)
75121007438165286278…44990266484645712799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.502 × 10⁹⁸(99-digit number)
15024201487633057255…89980532969291425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.004 × 10⁹⁸(99-digit number)
30048402975266114511…79961065938582851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.009 × 10⁹⁸(99-digit number)
60096805950532229022…59922131877165702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.201 × 10⁹⁹(100-digit number)
12019361190106445804…19844263754331404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.403 × 10⁹⁹(100-digit number)
24038722380212891609…39688527508662809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.807 × 10⁹⁹(100-digit number)
48077444760425783218…79377055017325619199
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,720,285 XPM·at block #6,809,525 · 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