Block #2,169,887

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/21/2017, 4:50:40 AM · Difficulty 10.9008 · 4,639,400 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0e868ffd169f415a745c2515b166237c4a54536fead2dc44f890924656382a5f

Height

#2,169,887

Difficulty

10.900758

Transactions

17

Size

10.01 KB

Version

2

Bits

0ae69819

Nonce

137,803,640

Timestamp

6/21/2017, 4:50:40 AM

Confirmations

4,639,400

Merkle Root

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

2.687 × 10⁹⁵(96-digit number)
26870903443969823265…59782737742219135359
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
2.687 × 10⁹⁵(96-digit number)
26870903443969823265…59782737742219135359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.374 × 10⁹⁵(96-digit number)
53741806887939646531…19565475484438270719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.074 × 10⁹⁶(97-digit number)
10748361377587929306…39130950968876541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.149 × 10⁹⁶(97-digit number)
21496722755175858612…78261901937753082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.299 × 10⁹⁶(97-digit number)
42993445510351717225…56523803875506165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.598 × 10⁹⁶(97-digit number)
85986891020703434450…13047607751012331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.719 × 10⁹⁷(98-digit number)
17197378204140686890…26095215502024663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.439 × 10⁹⁷(98-digit number)
34394756408281373780…52190431004049326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.878 × 10⁹⁷(98-digit number)
68789512816562747560…04380862008098652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.375 × 10⁹⁸(99-digit number)
13757902563312549512…08761724016197304319
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,718,365 XPM·at block #6,809,286 · 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