Block #2,639,354

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 3:02:30 PM · Difficulty 11.5344 · 4,193,980 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c02a5044a6cd4837685a7d00d596d74b64635199d988a786cef626629272749

Height

#2,639,354

Difficulty

11.534361

Transactions

8

Size

2.74 KB

Version

2

Bits

0b88cbe0

Nonce

883,431,964

Timestamp

4/30/2018, 3:02:30 PM

Confirmations

4,193,980

Merkle Root

414e0a56d292135ffc02c05cdce897bcc22d396e4ade760ac37e74e9c52bbac3
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.

5.205 × 10⁹⁶(97-digit number)
52056725734437899800…76420108221875015679
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
5.205 × 10⁹⁶(97-digit number)
52056725734437899800…76420108221875015679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.041 × 10⁹⁷(98-digit number)
10411345146887579960…52840216443750031359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.082 × 10⁹⁷(98-digit number)
20822690293775159920…05680432887500062719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.164 × 10⁹⁷(98-digit number)
41645380587550319840…11360865775000125439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.329 × 10⁹⁷(98-digit number)
83290761175100639681…22721731550000250879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.665 × 10⁹⁸(99-digit number)
16658152235020127936…45443463100000501759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.331 × 10⁹⁸(99-digit number)
33316304470040255872…90886926200001003519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.663 × 10⁹⁸(99-digit number)
66632608940080511744…81773852400002007039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.332 × 10⁹⁹(100-digit number)
13326521788016102348…63547704800004014079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.665 × 10⁹⁹(100-digit number)
26653043576032204697…27095409600008028159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.330 × 10⁹⁹(100-digit number)
53306087152064409395…54190819200016056319
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,910,867 XPM·at block #6,833,333 · 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