Block #909,218

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2015, 9:30:43 AM · Difficulty 10.9344 · 5,901,351 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2cf0edb71c381dccbe64df6dd22233e28b31a034db71d999551b8cf3c5a69dd2

Height

#909,218

Difficulty

10.934385

Transactions

3

Size

4.25 KB

Version

2

Bits

0aef33d4

Nonce

26,453,030

Timestamp

1/25/2015, 9:30:43 AM

Confirmations

5,901,351

Merkle Root

6083dc1b2b5616f66b27a30d5b89ccca047371b56e6d403090173562d4bf3317
Transactions (3)
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.709 × 10⁹⁶(97-digit number)
17091118170229184927…61778236335279652159
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.709 × 10⁹⁶(97-digit number)
17091118170229184927…61778236335279652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.418 × 10⁹⁶(97-digit number)
34182236340458369854…23556472670559304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.836 × 10⁹⁶(97-digit number)
68364472680916739709…47112945341118608639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.367 × 10⁹⁷(98-digit number)
13672894536183347941…94225890682237217279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.734 × 10⁹⁷(98-digit number)
27345789072366695883…88451781364474434559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.469 × 10⁹⁷(98-digit number)
54691578144733391767…76903562728948869119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.093 × 10⁹⁸(99-digit number)
10938315628946678353…53807125457897738239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.187 × 10⁹⁸(99-digit number)
21876631257893356707…07614250915795476479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.375 × 10⁹⁸(99-digit number)
43753262515786713414…15228501831590952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.750 × 10⁹⁸(99-digit number)
87506525031573426828…30457003663181905919
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,728,643 XPM·at block #6,810,568 · 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