Block #2,105,390

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2017, 9:05:03 PM · Difficulty 10.8843 · 4,721,746 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e34bf41a9e6b17d2dff245278c4210710e2a439eb858d3362e9c7228160f7edf

Height

#2,105,390

Difficulty

10.884290

Transactions

3

Size

60.39 KB

Version

2

Bits

0ae260d2

Nonce

1,300,043,017

Timestamp

5/7/2017, 9:05:03 PM

Confirmations

4,721,746

Merkle Root

1542c85c1a909f85486ae9db80fd135ee02b3713f2c7bb823f44ee9538ccfeb2
Transactions (3)
1 in → 1 out9.0600 XPM109 B
340 in → 1 out28.1265 XPM59.83 KB
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.691 × 10⁹⁴(95-digit number)
16910653909659352596…42186819785620321159
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.691 × 10⁹⁴(95-digit number)
16910653909659352596…42186819785620321159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.382 × 10⁹⁴(95-digit number)
33821307819318705193…84373639571240642319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.764 × 10⁹⁴(95-digit number)
67642615638637410387…68747279142481284639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.352 × 10⁹⁵(96-digit number)
13528523127727482077…37494558284962569279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.705 × 10⁹⁵(96-digit number)
27057046255454964154…74989116569925138559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.411 × 10⁹⁵(96-digit number)
54114092510909928309…49978233139850277119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.082 × 10⁹⁶(97-digit number)
10822818502181985661…99956466279700554239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.164 × 10⁹⁶(97-digit number)
21645637004363971323…99912932559401108479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.329 × 10⁹⁶(97-digit number)
43291274008727942647…99825865118802216959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.658 × 10⁹⁶(97-digit number)
86582548017455885295…99651730237604433919
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,861,269 XPM·at block #6,827,135 · 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