Block #211,910

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2013, 11:13:57 PM · Difficulty 9.9180 · 6,598,007 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
65dfddd435d12dee7323c0d21ad3306f686de0e1f24c32da3571f73599ab9e68

Height

#211,910

Difficulty

9.918016

Transactions

2

Size

424 B

Version

2

Bits

09eb0311

Nonce

19,530

Timestamp

10/15/2013, 11:13:57 PM

Confirmations

6,598,007

Merkle Root

c242fc76ed4ac08c85dfccb11150966f0dd7dfce4248def5a9205dbfa40528d8
Transactions (2)
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.

1.395 × 10⁹⁵(96-digit number)
13955736872275273297…95895937806559953599
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
1.395 × 10⁹⁵(96-digit number)
13955736872275273297…95895937806559953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.791 × 10⁹⁵(96-digit number)
27911473744550546594…91791875613119907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.582 × 10⁹⁵(96-digit number)
55822947489101093188…83583751226239814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.116 × 10⁹⁶(97-digit number)
11164589497820218637…67167502452479628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.232 × 10⁹⁶(97-digit number)
22329178995640437275…34335004904959257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.465 × 10⁹⁶(97-digit number)
44658357991280874550…68670009809918515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.931 × 10⁹⁶(97-digit number)
89316715982561749100…37340019619837030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.786 × 10⁹⁷(98-digit number)
17863343196512349820…74680039239674060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.572 × 10⁹⁷(98-digit number)
35726686393024699640…49360078479348121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.145 × 10⁹⁷(98-digit number)
71453372786049399280…98720156958696243199
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,723,421 XPM·at block #6,809,916 · 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