Block #2,168,496

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/20/2017, 7:39:44 AM · Difficulty 10.8983 · 4,645,822 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5240db8c595608f0133d9deb2a541324a4263b4844f07723945df7de3487c49c

Height

#2,168,496

Difficulty

10.898329

Transactions

2

Size

6.09 KB

Version

2

Bits

0ae5f8e9

Nonce

657,583,653

Timestamp

6/20/2017, 7:39:44 AM

Confirmations

4,645,822

Merkle Root

56440981e9b7cb1b23f6636e9d6ac9c6b1f1031b9d04edf2cde8b8a231b02758
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.

2.203 × 10⁹⁴(95-digit number)
22038077896793593655…67325675577672404479
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.203 × 10⁹⁴(95-digit number)
22038077896793593655…67325675577672404479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.407 × 10⁹⁴(95-digit number)
44076155793587187310…34651351155344808959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.815 × 10⁹⁴(95-digit number)
88152311587174374621…69302702310689617919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.763 × 10⁹⁵(96-digit number)
17630462317434874924…38605404621379235839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.526 × 10⁹⁵(96-digit number)
35260924634869749848…77210809242758471679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.052 × 10⁹⁵(96-digit number)
70521849269739499697…54421618485516943359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.410 × 10⁹⁶(97-digit number)
14104369853947899939…08843236971033886719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.820 × 10⁹⁶(97-digit number)
28208739707895799878…17686473942067773439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.641 × 10⁹⁶(97-digit number)
56417479415791599757…35372947884135546879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.128 × 10⁹⁷(98-digit number)
11283495883158319951…70745895768271093759
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,758,608 XPM·at block #6,814,317 · 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